Grading Policy

• 40% Homework Problems and Programs
• 15% First Midterm Exam
• 15% Second Midterm Exam
• 30% Final Exam

Topics we're going to cover

• Introduction. Review of Prerequisites.
• Algorithm Analysis
• Lists, Stacks of Queues
• Trees
• Hashing
• Priority Queues and Heaps
• Sorting
• Graphs
• Algirithm Design Techniques
• Advanced Data Structures and Implementation

We'll cover virtually everything in the text by Weiss. Note that the concepts on data structures in CSE143 are prerequisites for this course.