EECS 2011Z (W) FUNDAMENTALS OF DATA STRUCTURES

CLH B Tues Thurs 13:00-14:30

Instructor Information:

James H. Elder 0003G Lassonde Building
tel: (416) 736-2100 ext. 66475 fax: (416) 736-5857
email: jelder@yorku.ca website: www.yorku.ca/jelder

Office Hour: Thursday 14:30-15:30

TAs:

Alireza Moghaddam
Email: alireza@cse.yorku.ca
Office Hour: By appointment

Nada el Assal
Email: elassal_nada@yahoo.com
Office Hour: By appointment

Syllabus

Lectures:

I reserve the right to make changes to the lectures up to the time of the class. Small changes may also be made after class, e.g., to correct errors. I will indicate in each set of slides the date they were last modified: please verify that you have the most recent versions.

Slides:

  1. Introduction
  2. Asymptotic Analysis
  3. Linear Data Structures
  4. The Java Collections Framework
  5. Recursion
  6. Trees
  7. Priority Queues and Heaps
  8. Maps and Hash Tables
  9. Loop Invariants and Binary Search
  10. Midterm Review
  11. Search Trees
  12. Comparison Sorts
  13. Linear Sorts
  14. Graphs - ADTs and Implementations
  15. Graphs - Depth First Search
  16. End of Term Review

Camtasia Recorded Lectures:

Final Exam: Fri Apr 24 9am - 12pm LAS C

Grades: As submitted work is marked, grades are posted here.

Announcements:
This is a stack: the most recent announcements are at the top.

obj1.compareTo(obj2) returns

–Negative integer if obj1 < obj2
–Positive integer if obj1 > obj2
–0 if obj1 = obj2