CS282: Intermediate Java Programming and Fundamental Data Structures

4 Units (3 lecture hours, 3 lab hours)

Continuation of CS 182, students will learn to implement and analyze a variety of data structures and the algorithms used with those data structures. Students will learn to create their own abstract data types and how and when to utilize them. The fundamental data structures include: multidimensional arrays, linked lists, stacks, queues, heaps, trees, and hash tables. Students will learn when to use which of the available dynamic memory data structures. Tools for analyzing and predicting run time and memory usage are introduced, as is “big-oh” notation. A variety of sort algorithms are reviewed, analyzed for best, worst, and average case performance, and compared with tree traversal algorithms. Students will develop increased sophistication in object-oriented basics such as inheritance, encapsulation, design of abstract data types, and polymorphism. Students will gain experience working on larger programs and managing large, multi-programmer, projects. Laboratory instruction includes program development and execution.

Prerequisite: CS 182; Math 175 or equivalent
Corequisite: None
Recommended Preparation: None