Data Structures and Algorithms Dr. Robin Gras Ext Lambton Tower 8111

Lectures: Tuesday, Thursday 4:00pm – 5:20pm, DH 355 Labs: Section 51 – Tuesday 14:30 – 15:50 WL 305 Section 52 – Thursday 14:30 – 15:30 WL 305 Section 53 – Tuesday 10:00 – 11:20 WL 305 Office Hours: Tuesday, 10:30am – 12:30am. Text book: Mark Allen Weiss, Data Structures and Problem Solving Using Java, Addison-Wesley. Slides: Thank you for Dr. Mukopadhyay, Dr. Goodwin and Dr. Wu for their slides.

Course web page: Clew. Access through the “class notes” link of the Webpage of the University of Windsor Your responsibility for periodically checking the course web page. All course news will be posted there. Labs: Instructor: Abbas Golestani, Attending all labs is compulsory. Except for any logistical problem, labs will start on Tuesday, September 21. The labs assignments will be posted on the CLEW website

GA Iman Rezaeian, Yifeng Li,

CLASS LISTS IMPORTANT NOTES The add/drop date period ends November 10 You are not allowed to attend classes for this course unless you are officially registered, and your name appears on the current class list. Assignments will not be accepted, you will not be allowed to write tests or examinations, and credit will not be granted to any student who is not properly registered. "Financial Ineligibility" will not be accepted as a reason for non-registration in a course and will not be considered as a rationale to support a late registration. Please make sure your address is correct on the Student Information Service SIS. Important information may be ed during the term. If you are using your campus userid as your preferred , please update your address on the web with your Be sure to protect your Personal Access Code and do not share it with anyone.

Make-Up Test Policy Midterm tests, which are missed for any reason whatsoever cannot be made up. In the exceptional case that a student misses a midterm test for a valid reason, i.e. supported by appropriate documentation (see below), the mark for that test will be carried over to the next test (midterm or final). In case of a Doctor’s note, it must specifically say that the student was incapable of writing the exam on the day of the test. A copy of the "Student Medical Certificate" filled in and signed by a qualified physician is the only valid doctor's note that can be accepted. The medical certificate to use is available on the course website. The final exam must be written in order to obtain a grade for the course. If a student is sick, s/he must keep the instructor informed about his/her illness, with a supporting doctor's certificate. No extensions for labs will be allowed without a written application supported by documents. The documents should be given within 7 (seven) days after the lab is due. If any student is caught adopting unfair means (e.g. plagiarism), the student will face serious consequences including official disciplinary procedures.

If a student is unable to appear for the midterm test or the final exam due to serious and unavoidable circumstances, s/he must immediately contact the instructor (within 7 days) and submit a written letter with supporting documents (e.g., a copy of a Doctor's certificate in case of sickness) at the earliest opportunity. Students must keep a copy of their letter explaining their absence and the original supporting documents (e.g., doctor's notes). This original document will be stamped by the department as a proof that we have received their letter. A make-up test will be arranged for students who miss their final exam due to legitimate reasons. If a student has a medical condition, which may create problems during the term, s/he must inform the instructor in writing with supporting documents beforehand. No consideration will be made after the term is over (the last day of classes). All appeals about missing labs, lab marks, missing midterms, or midterm marks must be made during the term. No appeals will be accepted after the term is over (the last day of classes).

Main topics: Algorithm analysis, Stacks, Queues, Linked Lists, Recursion, Sorting, Trees, Binary Trees, Binary Search Trees, Balanced Trees and AVL trees, Hashing, Heap and priority queues, Huffman Coding Graphs.

Evaluation scheme: Midterms 120% Midterms 225% Labs10%  each worth 1 % Final Exam45% Exam dates: Midterm 1 : Oct 19 or 21, 2010, 4:00pm – 5:20pm Midterm 2 : Nov 16 or 18, 2010, 4:00pm – 5:20pm Final: Dec 16, 2010, 3:30pm – 6:00pm