COSC 310 Data Structures

The course reviews object-oriented design and discusses algorithm complexity, Big-O notation, and tractable and intractable algorithms. The course introduces concepts of abstract data types, basic data structures (i.e., lists, stacks, queues, and trees), and advanced data structures (i.e., graphs, sets, and heap). It also presents fundamental computing algorithms, including sorting, searching, and graph algorithms.

Credits

3

Prerequisite

( ECCE230, or COSC230), MATH234

Distribution

2-3-3

Offered

Fall Spring