CS 0445: Data Structures
This course emphasizes the study of the basic data structures of computer science (stacks, queues, trees, lists, graphs) and their implementations using the Java language. Included in this study are programming techniques which use recursion and reference variables. Students in this course are also introduced to various searching and sorting methods and are also expected to develop an intuitive understanding of the complexity of these algorithms.
Requirements and Grading
Between 5 and 7 programming assignments, 2 or 3 exams, and a cumulative final exam.
Recitation: A recitation associated with the selected class section is required.
Expected class size: 40-80 students.
Frequency: This course is offered every term.
Course Web Pages
Section (11587): M W 6:00PM - 7:15PM
Instructor: George Novacky