Description
This class is a continuation of CSE 115/503. It heavily emphasizes abstract data types (ADTs) and object-oriented methodology, and expects students not only to understand ADTs but also to design and implement robust ADTs using a modern object-oriented programming language. Further emphasis is on object-oriented techniques, which support sound software engineering, such as encapsulation, polymorphism and inheritance as well as the use of more complex design patterns. Essential topics integrated in this framework include the use of recursion; linked data structures, including lists, stacks, queues, binary trees, and other advanced data structures; and algorithms for searching and sorting; exceptions and exception handling, event-driven programming. Introduces the analysis of algorithm complexity (0-notation).
General Information
Schedules, lectures, and more can be found on the class website
| Name | Office Hours | |
|---|---|---|
Matthew Hertz | When? Where? | |
Suchismit Mahapatra | When? Where? | |
Zachary M Wieand | When? Where? | |
Adhish Chugh | When? Where? | |
Jared | When? Where? | |
Noah Poczciwinski | When? Where? | |
Megan Renz | When? Where? |