Algorithms and Data Structures
COSC 3320
Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0
Prerequisite: A grade of C- or better in MATH 3336, and COSC 2320 or COSC 2436.
Description
Algorithm analysis and design, heuristics; advanced tree structures; advanced hashing techniques; sorting and searching; graphs, sets. NP-Completeness, Time and Space complexities.
Repeatability: No
Note: Declared Computer Science majors and minors only.
Typically Offered: Fall
Additional Fee: Y
Lecture Contact Hours: 3 Lab Contact Hours: 0
Prerequisite: A grade of C- or better in MATH 3336, and COSC 2320 or COSC 2436.
Description
Algorithm analysis and design, heuristics; advanced tree structures; advanced hashing techniques; sorting and searching; graphs, sets. NP-Completeness, Time and Space complexities.
Repeatability: No
Note: Declared Computer Science majors and minors only.
Typically Offered: Fall
Additional Fee: Y
Sources:
Basic Information
- Earliest record:
- Latest record:
- Number of instructors:
- Number of sections:
- Average number of students per section: