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 |
|
|
|
30% |
|
|
midterm |
Monday, June 26, 2006 |
13:30 – 14:20 |
WM3210 |
25% |
|
final |
Tuesday, August 15, 2006 |
12:00 – 15:00 |
C9002 |
45% |
Remarks:
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