Course: CMPT-225 Data Structures and Programming [2006-2]
Instructor: Jan Manuch (jmanuch@sfu.ca)
TAs: Osama Saleh (osaleh@sfu.ca)

Maryam Moslemi Naeini (mmoslemi@sfu.ca)

 

Course information

Objective:

The course will provide:

·         Develop problem solving techniques:

o       Use abstraction to design solutions

o       Design modular programs

o       Use recursion as a problem-solving strategy

·         Provide tools for the management of data

o       Identify abstract data types (ADTs)

o       Construct implementations of the ADTs

 

The official course outline:

http://www.cs.sfu.ca/undergrad/Outlines/2006-2/CMPT-225-Manuch-06-2.txt

 

Marking scheme:

What

Date

Time

Room

 Weight 

Solutions

 6 assignments 

 

 

 

 30% 

 

 midterm 

 Monday, June 26, 2006

 13:30 – 14:20

WM3210

25%

pdf

 final 

 Tuesday, August 15, 2006

 12:00 – 15:00

 C9002

 45% 

pdf

 

Remarks:

  1. At most 50% of the midterm can be shifted to the final. That is: if your performance on the final is better than on the midterm, the weight of midterm will be adjusted to 12.5% and the weight of final to 57.5%. No other changes to the marking scheme are possible!
  2. The midterm and the final exam will refer to material covered at the lectures and in the readings in the textbook. The midterm will refer to material covered up to the 6th week of the course; the final exam will refer to all the course material, with an emphasis on material in the second part of the semester.
  3. The programming problems in assignments, midterm or final can be written in either JAVA or C++. It’s not necessary to learn JAVA for those who know only C++ and to learn C++ for those who know only JAVA. However, the language used in the examples during lecture will be JAVA, hence it would be beneficial to read Chapter 1 in the textbook for those who know only C++.
  4. Late assignments: assignments submitted after deadline will be penalized by -20% per day. For instance, if the deadline for the assignment is 10am on May 22, and you submit your assignment after 10am, May 22 but before 10am, May 23, you will be penalized with -20% of the score you would normally get from the assignment.

 

 Textbooks:

Author

Name

Edition

Year

Frank M. Carrano & Janet J. Prichard

Data abstraction & Problem Solving with Java: Walls & Mirrors

2th edition

2006

 

Supplementary textbooks:

Author

Name

Edition

Year

Frank M. Carrano

Data abstraction & Problem Solving with C++: Walls & Mirrors

4th edition

2005

Robert Kruse & Alexander J. Ryba

Data Structures and Programming Design in C++

1st edition

1998

 

Academic Honesty

Academic Honesty plays a key role in our efforts to maintain a high standard of academic excellence and integrity. Students are advised that ALL acts of intellectual dishonesty are subject to disciplinary action by the School; serious infractions are dealt with in accordance with the Code of Academic Honesty (T10.02) (http://www.sfu.ca/policies/teaching/t10-02.htm). Students are encouraged to read the School’s Statement on Intellectual Honesty (http://www.cs.sfu.ca/undergrad/Policies/honesty.html).

 

 

General Information
Lecture notes
Assignments

Last modified: 29-08-2006 13:30