D.Bockus J324
Tutorial time: Tuesday 14:00. to 15:00  AS202 - Tutorial Leader - TBA
Lecture time: Tuesday & Friday 11:00 to 12:30 p.m. AS217

Course Description:

This course emphasizes the definition, usage and manipulation of dynamic data structures and their associated algorithms. Topics will include but are not limited to: Stacks, Queues, Sorting, Trees, Graphs, Hashing, Strings, and associated complexity theory related to these topics. Particular emphasis will be placed on trees and tree manipulation algorithms.

Students should have a firm background in programming, particularly in Java. Java will be the language used for the assignment component of the course. Students who do not have experience programming in Java should see the instructor to make alternate arrangements.
 

The following texts are on 3 hour reserve (See Library)	Data Structures & Algorithm Analysis in Java    or 3rd Edition Mark Allen Weiss  ISBN:0-321-37013-9
	Data Structures & Algorithms in Java Robert Lafore  Waite Publishing  ISBN: 1-571-69095-6	Data Structures and Algorithms in Java Michael T. Goodrich  John Wiley & Sons Inc.  ISBN: 0-471-19308-9
	Data Structures & Problem Solving Using Java Mark Allen Weiss  Addison-Wesley Publishing  ISBN: 0-201-54991-3	Data Structure Techniques  Thomas A. Standish  Addison-Wesley Publishing  ISBN: 0-201-07256-4
	Data Structures in Java Thomas A. Standish  Addison-Wesley  ISBN 0-201-30564-X	Data Structures - Form and Function Harry F. Smith  Harcort Brace Jovanovich, Publishers.  ISBN: 0-15-516820-7
		Other material may be placed in the library as the course progresses.

 

Marking Scheme:
Assignments: (5)  Term Test:  Final Exam:	25% (5@5%)  20% (TBA during the tutorial period)  55%

Note 1: Due date and time for assignment submission will be printed on the assignment text. Assignments will be accepted late up to 3 day after the original due date subject to a 25% penalty. Assignments after the late date will not be accepted.

Note 2: In order to pass this course a mark of at least 40% must be obtained on the final exam.

Note 3: The department views plagiarism as a serious issue. Students are directed to the Department's Web server where they can view the department's policies on plagiarism.http://www.cosc.brocku.ca/about/policies/plagiarism 

Note 4: Assignments will be required to be submitted to an online plagiarism detection engine, currently Berkeley's MOSS system. Assignments not validated by MOSS will not be marked.

Note 5: All assignments will be the result of individual student effort. Pair programming is not allowed.

Note 6: A cover sheet available from http://www.cosc.brocku.ca/forms/cover must be submitted with each assignment.

Note 7: Assignment material will be distributed through the Web. Please see my home page http://www.cosc.brocku.ca/~bockusd/2p03 .

Note 8: A departmental medical form will need to be submitted as per instructions before any consideration will be given due to sickness.