CS2711 Course Outline
Introduction to Algorithms and Data Structures
TERM: Fall 2011
TEXTBOOK:
Data Structures \& Algorithms in Java(5th edition),Gooddrich and Tamassia, 2010
,ISBN:978470383461, Wiley.
NOTES:

Labs begin on Thursday, September 22, 9:00am in CS1019.

In the event of university closure on the day of a test,
the test will be given in the next class meeting.

Paper submission for assignments are due at 9:00am, the start of the lab.
One assignment is due at the start of class.
Electronic submission are due at midnight of the previous day.

If, for special circumstances you miss a lab, quiz, assignment or test,
notify your instructor, providing any related documentation.
Failure to do this will result in zero credit for the missed work.
If the justification is valid, the mark will be assigned to the final exam.

The lab instructor and instructional assistants are available to help students.

The subject line for email addressed to the instructor should contain CS2711.

There is a Computer Science Student Help Centre located in EN2013C.
Please check the Computer Science home page,
www.cs.mun.ca for hours of operations.
GRADING SCHEMA
9 Assignments (20 marks, 2 or 3 each)
10 Lab quizzes(15 marks, 1.5 each)
Midterm test(20 marks),
Final Exam(45 marks)

No late work is accepted. The mark for any missed work will be assigned to the final exam if an acceptable reason is provided (See notes).
PREREQUISITES
CS2710 and 2740
TENTATIVE TIME TABLE

Week1 Recursion, Analysis Tools.

Week2 Linked Lists.

week3 Stacks and Queues.

week4 Trees.

week5 Trees and Priority Queues.

week6 Priority Queues(Heaps).

week7 Binary Search Trees.

week8 Midterm Break  No lectures or labs.

week9 Midterm examination.

week10 Sorting.

week11 Graphs.

week11 Graphs.

week12 Hash Tables.

week13 Review.