Data Structures

This course builds on CSCI 0101 and stresses ideas and structures helpful in designing algorithms and writing programs for solving large, complex problems. The course introduces important abstract data types (ADTs) such as stacks, queues, trees, and graphs. We will study efficient implementations of these ADTs, and learn classic algorithms to manipulate these structures for tasks such as sorting and searching. Familiarity with the Java programming language is assumed. (CSCI 0101) 3 hrs. lect./lab

Schedule
10:10am-11:00am on Monday, Wednesday, Friday (Sep 7, 2009 to Dec 4, 2009)
Location
McCardell Bicentennial Hall 438
Instructors