CS 3220 - Data Structures and Algorithms II

Credits: 3
Lecture: 45
Lab: 0

Expands on the concepts begun in Data Structures and Algorithms I, including stacks, queues, trees and binary trees as fundamental conceptual structures of data. Various physical implementations for each conceptual view are examined with emphasis on the concept of abstract data types. Algorithm development continues with coverage of methods solving recurrences, divide-and-conquer algorithms, dynamic programming, greedy algorithms and graph algorithms.

Prerequisite(s): CS 3210
Corequisite(s): None