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