CSCE 3110 - Data Structures and Algorithms

3 hours

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.

Prerequisite(s): CSCE 2100 and CSCE 2110, each with a C or better.