Search Results

Credits: 3. Contact Hours: Lecture 3, Discussion 1.

Prereq: Minimum of C- in COMS 2270; credit or concurrent enrollment in MATH 1650
An object-oriented approach to data structures and algorithms. Object-oriented analysis, design, and programming, with emphasis on data abstraction, inheritance and subtype polymorphism, and generics. Abstract data type specification and correctness. Collections including lists, stacks, queues, trees, heaps, maps, hash tables, and graphs. Big-O notation and algorithm analysis. Searching and sorting. Graph search and shortest path algorithms. Emphasis on object-oriented design, writing and documenting medium-sized programs. This course is designed for majors. (Typically Offered: Fall, Spring, Summer)