CS-270

This course addresses the representation, storage, access, and manipulation of data. We discuss appropriate choices of data structures for diverse problem contexts. We consider abstract data types such as stacks, queues, maps, and graphs, as well as implementations using files, arrays, linked lists, tree structures, heaps, and hash tables. We analyze and implement methods of updating, sorting, and searching for data in these structures. We develop object-oriented programming concepts such as inheritance, polymorphism, and encapsulation. We consider implementation issues including dynamic memory management, as well as tools for programming in the large. Prerequisite: Computer Science 167.
Saved seats for this course are: Seniors-4, Juniors-4, Sophmores-8, First Years-8. Seats will be adjusted every morning the day a new class pre-registers.