COMS 5010X: Programming Foundations
Credits: 4. Contact Hours: Lecture 4.
Prereq: Graduate Standing or Permission of Instructor
Design and implementation of data structures and algorithms using objects as the mechanism for modularity, abstraction, and code reuse. Program structures, conditionals, iteration, recursion, and exception handling. Collections including lists, stacks, queues, trees, and hash tables. Searching and sorting. Divide and conquer algorithms. Graph algorithms. Programming projects. This course may not be taken to satisfy MS (with thesis) and PhD requirements in Computer Science.