CS280: Data Structures

General Info:
Class policies:
Time and Location:  10:30am-11:20am
M-F room 211 in Building 18

Assignments:

1. Homework 0
2. Homework 1
3. Project 0
4. Project 1
5. Homework 2
6. Project 2
7. Project 3

Materials:

• The main text, Data Structures and Algorithm Analysis in Java, is REQUIRED. We will have problem sets assigned out of this text and you will want to look at the code listings.
• Since this is a Java course, you should have a JDK from sun installed and operational.
• Periodically, we will work problems similar to the EWU CS Advancement Exam . This is to help you prepare for this exam.

Course Objectives:

• Understanding of big and little 'o' notation as well as omega.
• Sorting
• Linked Lists
• Trees
• Heaps
• Graphs
• Hashes

Course Outline:

• Generic Sorting in Java (2 days)
• Notation (2 days)
• Lists (1 week)
• Trees (2 weeks)
• Heaps (1 week)
• Graphs (2 weeks)
• Hash (1 week)