Data Structures for Cross-Disciplinary Minors

Open only to students enrolled in a cross-disciplinary minor sponsored by the Computer Science Department. Fundamental data structures and their implementations: stacks, queues, trees (binary and AVL), heaps, graphs, hash tables. Searching and sorting algorithms. Runtime analysis. Examples of problem- solving using greedy algorithm, divide-and-conquer, and backtracking.

Credits

3 credits

Course Code

CSCI 314