Graph and tree manipulations, searching, sorting, merging, dynamic memory allocation, algorithm analysis, classical data structures, recursion, and abstract data types are covered. Attendance will not be regularly taken but students are responsible for all material, assignments, lab work and exams as scheduled. The majority of the programming will be done outside the lab. Depending on the program, assignments are due within 2 to 3 weeks.
Assignments are individual efforts outside of class.
Late work will receive a substantial penalty. The first midterm exam will focus on the first four chapters of the book. The second midterm exam will focus on chapters 5 - 8. The final will be comprehensive. The letter grade will be determined at the end of the course by listing all grades in the course in decreasing numeric order.