COP 3538 - Data Structure for IT

Credits: 3

Prerequisites: COP 2551 with a grade of “C” or higher.
The course formalizes the concepts of algorithm and time complexity. Data structures such as heaps, lists, queues, stacks, and various forms of trees are covered. Students design and analyze algorithms. Numerous classic algorithms are covered.

Terms Offered: Fall, Spring, Summer

Contact Hours: 3