Assignments
Links
Schedule
Syllabus

Syllabus

Objective:

We will learn basic assessment of the performance of algorithms for searching, sorting, and manipulation of data structures. Some of the data structures we will examine are queues, stacks, trees and graphs. Students will be expected to write their own data structures and access methods using a variety of design techniques, including recursion, and object-oriented programming.
Prerequisites: CP122 or MA221

Instructor:

Jonathan Bredin
Tutt Science 205; 389-6540

Hours:

class: M-F 9:00am-12:00pm TSC221
office: MWR 1:30-3:00pm TSC205

Text:

Data Structures and Algorithms in Java (2ed), Drozdek, Thomson, 2005

Honor Code:

originality: All submitted assignments must be original. Do not submit source code or prose written as part of another course. All submitted material must be authored by the submitter.

sources: It is acceptable to use text or online sources to complete assignments, so long as the source is cited and it is not a direct solution to the problem at hand. Searching the Internet for solutions is grounds for an honor-code charge.

group work: You may work in pairs to for written and programming assignments.

  • Written assignments are to be written up individually and turned in separately. You are responsible for understanding all work that you submit. Copying solutions without understanding them is an honor-code violation.
  • Programming assignments may be completed and submitted by distinct pairs of enrolled students. Exams will require source code to be written without help from a partner, so take care to understand all work submitted as a programming pair.

late assignments: Assignments are to be submitted by 11:59pm on the due date assigned. Grade scores of late assignments will be reduced 10% per calendar day late. If you cannot complete your assignment by the due date, submit what you have completed with documentation describing what you were able to complete, and what direction you would take to complete the remainder of the work.