CSCI0201A-S10
Data Structures
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
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
- Term:
- Spring 2010
- Location:
- McCardell Bicentennial Hall 632(MBH 632)
- Schedule:
- 9:05am-9:55am on Monday, Wednesday, Friday (Feb 8, 2010 to May 10, 2010)
- Type:
- Lecture
- Instructors:
- Daniel Scharstein
- Subject:
- Computer Science
- Department:
- Computer Science
- Division:
- Natural Sciences
- Requirements Fulfilled:
- DED
- Levels:
- Undergraduate
- Availability:
- View availability, prerequisites, and other requirements.
- Course Reference Number (CRN):
- 20080
- Subject Code:
- CSCI
- Course Number:
- 0201
- Section Identifier:
- A