CSCI 3333 Algorithms and Data Structures

This course is a continuation of data structures topics covered in CSCI 2380. Content includes theoretical topics in algorithmic efficiency and complexity, along with abstract data types, including graphs, networks, trees, and priority queues. Search topics, including hashing, trees, external search trees (B-trees), and sorting algorithms including external sorting are introduced and compared. Computational complexity topics include the class P and NP, NP-completeness and reducibility, NP-completeness proofs, and NP-complete problems.

Credits

3

Prerequisite

Grade of C or better in: [CSCI 3310 or MATH 2346 or MATH 2305] and [CSCI 2380 or CMPE 2380].

Schedule Type

Lecture

Grading Basis

Standard Letter (A-F)

Administrative Unit

Computer Science

Offered

Fall/Spring/Summer