• Anne DeFrance          E-mail: defrance@cs.montana.edu        
  Office: EPS 361        Phone: 994-4835
  Office Hours: Monday 10:00 - 11:15; Tuesday 10:00 - 11:15; Wednesday 10:00 - 11:15; Thursday 1:00 - 2:15 and by appointment.

Teaching Assistant

• William Merryman          E-mail: wmerryma@cs.montana.edu
  Office: EPS 109        Phone: 994-6591
  Office Hours: Tuesday 10:00 to 12:00

• Objects, Abstraction, Data Structures and Design Using Java, by Koffman & Wolfgang.

Grading

• 50%  Lab
•  5%   Lecture quizes and homework
• 10%  Exam1
• 15%  Exam2
  
• 20%  Final
  To pass the course, you must past both the lecture and lab portions of the course.

• Final:
  The final will not be given early.

Course Outcomes
At the end of the course, students should be able to

• Understand the concept of an ADT.
• Understand and be able to implement the list ADT.
• Understand and be able to implement the stack ADT.
• Understand and be able to implement the queue ADT.
• Understand and be able to implement the priority queue ADT.
• Be able to determine the time complexity of simple algorithms.
• Understand and be able to implement several standard sorting techniques.
• Understand and be able to implement linear and binary search.

Other Information

• Useful Resources
• Collaboration Policy

Last modified: August 29, 2005.