Instructor

Gustavo Rodriguez-Rivera, LWSN 1210 . Available any time for short questions, or make an appointment.

Class Homepage

An updated syllabus, class handouts, lecture notes, and other information can be found at:

http://www.cs.purdue.edu/homes/cs251

Goal

After successfully completing this course:

• You will understand the foundations of computer data structures
• You will improve your programming skills by programming these data structures and using them in practical applications.

Course Organization

The course is organized in lecture sessions and help sessions (PSOs). You are encouraged to attend the PSOs every week since the instructors will explain details of the class projects and also answer questions.

Grade Distribution

The final grade will be about 50% midterm and final exams, and 10% class attendance . 40% projects and homeworks.

Sylabus

• Week      1. Design Principles. Data structures and algorithms.
• Week      2. Analysis Tools. Asymptotic notation, asymptotic analysis.
• Week      3. Stacks, Queues, and Linked Lists . Including double-ended queues.
• Week      4. Sequences. Ranked, positional, and general sequences.
• Week      5. Trees. Emphasis on binary trees.
• Week      6. Trees.
• Week      7. Priority Queues. Implementations using sequences and heaps.
• Week      8. Dictionaries. Implementations using skip lists, hash tables.
• Week      9. Dictionaries. Implementations using binary search trees, AVL trees.
• Week     10,11. Sorting, Sets, and Selection.Merge-sort, quick-sort, lower bound on comparison-basedsorting, bucket-sort, radix-sort.
• Week     12. Graphs.Graph traversal, directed graphs.
• Week     13. Graphs, weighted graphs.
• Week     14. Strings. Strings, Pattern Matching.
• Week     15: More Strings. Review