|Class Meeting Time:||Tuesday and Thrsday, 10:00-11:15||Room No:||4C84|
|Course Group:||Email email@example.com to receive an invite.|
|Midterm Exam:||Tuesday, October 21, 2008, in class|
|Final Exam:||December 15, 2008, 9:00-12:00|
The course official course outline is available here.
There will be four (4) assignments throughout the course. All assignments are due at 17:00 on the following non-negotiable due dates:
|Assignment 1||Lists and Recursion
Additional code: iList.java
Solution to the written part: soln1.pdf
|September 25, 2008|
|Assignment 2||Complexity and Abstract Data Types
Additional code: iStack.java, KTS.java
Solution to the written part: soln2.pdf
|October 16, 2008|
|Assignment 3||Trees and Hash Tables
Additional code: iMap.java, pam.zip,
Example of a Linked List based map
|November 6, 2008|
|Assignment 4||Priority Queues, Heaps, and Graph Algorithms
Additional code: RoadMaker.java, Graph.java
December 4, 2008
Assignments will not be accepted after the due date.
Assignments must be submitted in both paper and electronic form. Each assignment will specify what files to submit and how they should be named.
Electronic submission will take place using the ACS department's electronic assignment submission system (PASS). You must email the instructor for your initial password to the system. You are strongly encuraged to login test the submission process prior to the assignment deadline to become familiar with the system.
The text for the course is Goodrich and Tamassia, ``Data Structures and Algorithms in Java, 4th ed.'', 2006, ISBN 0-471-73884-0. There will be readings assigned for each lecture. You should do the readings before attending the lecture.
There is a discussion group for the course where you can post and discuss questions that arise from the course material. To get access to the group, send email to the course account and an invite will be sent to you for the group.
The website associated with the course text provides the source code examples in the text as well as additional material.
If you find additional websites that you think may be helpful for the course, let me know and I will add them here.
A course mark will be assigned based on three assignments, a written midterm, and a written final examination. Each student has the choice of one of the two marking schemes; the marking scheme most beneficial to each student will be used.
|Marking Scheme I||30%||20%||50%|
|Marking Scheme II||30%||0%||70%|
The midterm exam will be held in class on Tuesday, October 21, 2008.
The final exam will be held on TBA.
For both exams Photo Identification is required. No paper or electronic electronic aids, such as dictionaries, calculators or talking slide rulers, are allowed.
Students caught cheating on an assignment or an exam will be assigned a mark of 0 for that assignment or exam. Furthermore, the case will be forwarded to the department chair for further prosecution resulting in a possible suspension or expulsion from the university.
To avoid the possibility of plagiarism here are some rules of thumb that you should follow: