CSCE 2110 - Foundations of Data Structures

(COSC 2336 or COSC 2436)

3 hours (3;0;1)

Introduces students to more advanced data structures and algorithms. Time complexity of algorithms; merge sort and heap sort; data structures for trees and graphs; elementary graph algorithms; breadth-first search; depth-first search; topological sorting; Prim’s algorithm and Kruskal’s algorithm. Additionally, the effective use of regular expressions to parse text and the use of hash tables to store data are covered. By the end of the foundation courses, each student will have a solid foundation in conceptual and formal models and levels of abstraction as used in the field of computer science, as well as greater proficiency in software development.

Prerequisite(s): CSCE 1040 or CSCE 1045, with a grade of C or better.

Corequisite(s): This course can be taken concurrently with CSCE 2100.

Course specific fees (in addition to tuition and mandatory):
Academic (AF) per hour: $52.70