CSC 315 Data Structures & Algorithms

Credits: 3

A systematic study of data structures and accompanying algorithms with an emphasis on implementation and algorithmic complexity. Program development is done on Linux systems using standard software engineering tools. Topics may include: principles of object-oriented programming, such as inheritance, abstraction, polymorphism, encapsulation, and late binding; binary and m-ary trees, heaps, maps, sets, disjoint sets, and graphs; sorting techniques, hashing, shortest path and minimal spanning tree algorithms, string matching algorithms and an introduction to dynamic programming.

Prerequisites: CSC 215, CSC 216, and CSC 251 all with a grade of “C” or higher.

Check course scheduling information