CSE 2011 Winter 2009

***
CSE 2011 (Section Z)
*

Fundamentals of Data Structures

Winter 2009

***
     Lecture Schedule:  TR, 13:00 - 14:30, CLH J
***
     Instructor: Natalija Vlajic
     E-mail:   vlajic@cs.yorku.ca
     Office Hours:   TR, 15:00 - 16:00, CSEB 2047
***
     TAs:
     Han Liping, e-mail:   lipingh@cse.yorku.ca
     Serene Wong, e-mail: swong@cse.yorku.ca
     Office Hours: TR, 11:30 - 12:30 , CSEB 2013

Course Information:
Textbook and Other Recommended Material
Prerequisite
Course Description
Grading Scheme
Course Schedule (Topics, Notes, Required Reading, Assignments)

Course Policies:
Late Assignments and Missed Midterm
Academic Honesty

WWW Links:
Link to Earlier Course Web-page (includes exam samples)

NEWS:

May 31: Final examination grades are available through ePost.
May 31: Assignment 3 grades are available through ePost.
May 13: Solutions to Assignment 3.
May 25: Assignment 2 grades are available through ePost.
May 19: Office hours for the week of May 18: Wednesday and Thursday (May 20 and 21) between 10:00 - 12:00.
May 19: NOTE: In Q1 of Assignment 3 the assumed tree should be 'full'!
May 14: Examples of earlier finals: EarlierFinal(1), EarlierFinalSolutions(1), Final_Fall2008_Solutions.
May 13: Assignment 3 is available. Due date: May 23, 7pm.
May 13: Solutions to Assignment 2.
May 11: Due to a large number of requests, the submission deadline for Assignment 2 has been extended to: Wednesday, May 13, noon.
April 22: Assignment 2 is available. Due date: May 11. Test file for project question: WisdomForRoad.txt. Your assignment solutions (typed rather than handwritten) are to be turned into the class drop-box by noon of Monday, May 11. To submit your code for the programming question (Q3) electronically, you need to: 1) Put all your code files, i.e. java classes, into a directory named analyzer. It is this (entire) directory that you are submitting. 2) From any PRISM machine, execute the following: % submit 2011 Assignment2 analyzer. If you need more information on the submit command, run man submit on a PRISM box.
April 21: Assignment 1 grades are available through ePost.
April 21: Solutions to Assignment 1.
April 20: Midterm grades are available through ePost.
April 20: Midterm. Sample midterm solutions.
April 8: The midterm examination will be held this coming Tuesday (April 14), in class. The examination is closed-book and closed-notes, and it will be based on all of the lecture material + assignments + quiz questions covered in the course up to (and including) April 7. Please arrive 5 min before the official beginning of the class.
April 8: Examples of earlier midterms: EarlierMidterm(1), EarlierMidtermSolutions(1), Midterm_Fall2008_Solutions.
April 8: Assignment 1 Submission Info: To submit your code for the programming question (Q4) electronically, you need to: 1) Put all your code files, i.e. java classes, into a directory named assembler. It is this (entire) directory that you are submitting. 2) From any PRISM machine, execute the following: % submit 2011 Assignment1 assembler. If you need more information on the submit command, run man submit on a PRISM box.
April 8: Course evaluation has been scheduled for Thursday, May 7, 2009.
April 7: At the request of some students, an additional 'office hour' will be held tomorrow (Wednesday, April 8), 10:00 - 11:00 am.
March 30: Assignment 1 is available. Due date: April 13. Test file for project question: Mystery.txt. Your assignment solutions (typed rather than handwritten) are to be turned into the class drop-box by noon of Monday, April 13. Include with the materials a print-out of your code for the programming question. In addition, you must submit via CS@York's submit utility your code for the programming portion of the assignment. Specific instructions for submit will be posted shortly.
March 27: Assignment 1 will be posted on the course web-site on Monday, March 30.
March 27: Quiz 1, as discussed in class.
March 5: Classes begin.

Textbook:
"Data Structures and Algorithms in Java", M. T. Goodrich and R. Tamassia, John Wiley and Sons, 2006, 4th edition.

References:
"Data Structures & Other Objects Using Java", M. Main, Addison-Wesley, 2006, 3rd edition.
"Data Structures and Algorithm Analysis in Java", M. A. Weiss, Addison-Wesley, 2006, 2nd edition.
"Data Structures and Abstractions with Java", F. M. Carrano, Pearson Prentice Hall, 2007, 2nd edition.
"Java Foundations: Introduction to Program Design & Data Structures", J. Lewis, P. J. DePasquale, J. Chase, Addison Wesley, 2007.
"Java Collections: An Introduction to Abstract Data Types, Data Structures and Algorithms", D. A. Watt and D. F. Brown, John Wiley and Sons, 2001.

Prerequisite:
General Prerequisite. The course assumes prior knowledge of Java programming, as taught in CSE 1020 and 1030.

Course Description:
The design and analysis of data structures is one of the key subjects in computer science and software engineering. The main objective of this course is to provide students with a solid knowledge of some advanced data structures and fundamental concepts in the design and analysis of algorithms. At the end of the course, the students should be able to make intelligent choices in the selection and design of data structures and algorithms, when dealing with problems at hand.

Grading Scheme:
15% Assignment (3 Assignments - 5% each)
35% Midterm Exam
50% Final Exam

Late Assignments and Missed Midterm:
Late assignments will not be accepted, unless a prior arrangement is made with the instructor.
Makeups of missed midterm exams are only possible in extremely exceptional situations (such as verifiable medical emergencies) or by arrangement well prior to the exam, provided there is an extremely compelling reason.

Academic Honesty:
"The Department takes the matter of academic honesty very seriously. Academic honesty is essentially giving credit where credit is due. And not misrepresenting what you have done and what work you have produced. When a piece of work is submitted by a student it is expected that all unquoted and uncited ideas and text are original to the student. Uncited and unquoted text, diagrams, etc., which are not original to the student, and which the student presents as their own work is considered academically dishonest."
For more see: Department of Computer Science Academic Honesty Guidelines

Course Schedule (Topics, Notes, Required Reading, Assignments):

Week	Date	Topic	Required Reading	Assignments
1	R, Mar 5	Introductory Class
	T, Mar 10	Algorithm Analysis (1)	Sections 4.1 and 4.2
2	R, Mar 12	cont.
	T, Mar 17	Arrays and Linked Lists	Sections 2.1, 1.5, 3.1 to 3.4
3	R, Mar 19	Algorithm Analysis (2)	Section 3.5
	T, Mar 24	Java-Generics, Stacks	Sections 1.3.3, 2.5.2, 5.1
4	R, Mar 26	Queues	Section 5.2	Assignment 1 posted
	T, Mar 31	Deques, Additional Exercise	Section 5.3
5	R, Apr 2	Array List	Section 6.1
	T, Apr 7	Node List, Self-Organizing List, Iterators	Sections 6.2, 6.3, 6.5
6	R, Apr 9	Trees (1), Trees (2)	Sections 7.1, 7.2
	T, Apr 14	Midterm Examination ( in class, closed book )
7	R, Apr 16	Binary Trees (1)	Sections 7.3.1 to 7.3.5
	T, Apr 21	Midterm Solutions ( last date to drop courses: Apr 22 )
8	R, Apr 23	Binary Trees (2)	Section 7.3.6	Assignment 2 posted
	T, Apr 28	Binary Search Trees	Sections 9.1, 9.3, 10.1
9	R, Apr 30	AVL Trees	Section 10.2
	T, May 5	Heaps	Section 8.3
10	R, May 7	Hash Tables (1)	Section 9.2
	T, May 12	Hash Tables (2)
11	R, May 14	cont.		Assignment 3 posted
	T, May 19	Graphs	Section 13.1
		Final Examination Saturday May 23, 7:00 - 10:00 pm