HOME | EDUCATION | RESEARCH | PEOPLE | ABOUT US | SITE MAP  
  » Programs » Undergrads » Course Central »

CMPT 120

Introduction to Computing Science and Programming I

Summer, 2009


HOMEWORK LINK



Instructor: Steven Pearce (TASC 1 - 9225)
Phone: 778-782-4444
E-mail: stevenp AT cs.sfu.ca - Emergencies Only 

Time and Place:  Lectures are MWF from 14:30 to 15:20 in EDB 7618

Office Hours:

Instructor: MWF the hour before class in my office
TA: Tutorial times can be found on SIMS.  Your TAs are H. Vaezi Joze (hrv1@sfu.ca), Dan Lin (lindanl@sfu.ca), and Farid Molazem Tabizi (fma20@cs.sfu.ca)

Course Pack (Required):  Available at bookstore, or it can be downloaded from the author's website.

Software: Author's website

Grading:


  • Homework - 20%
  • Midterm (Monday, June 15,) - 30%
  • Final Examination (August 13, from 15:30 to 17:30 in AQ3182) - 50%
NOTES:
  • All assignments must be completed and handed in for a passing grade in this course.
  • A wide range of resources are available at Greg Baker's website.
  • It is the student's responsibility to keep track of his/her performance using GradeBook.
  • Assignments and examinations will be open to review for one week only.
  • Be aware of the fact that the midterm date is after the last day to drop classes.
  • Plagiarism will result in an automatic failing grade.

Tentative Schedule of Lectures:

NOTE: I prefer to move at a rapid pace in the first half of the course in order to cover all of the principal aspects of coding.   During the last few weeks, however,  you will master what we have learned as well as cover an advanced topic or two arrived at democratically.  Remember that a computer is a tool for problem solving.  We are going to spend much of our time learning to apply this technology to an array of problems - some familiar, some not so familiar.

WEEKS
TOPIC
READINGS from Course Pack (Unit #)
1
Introduction to course.  Introduction to programming 1
2
Continued
2
3
Control Structures
3
4
Functions and Control Modules
4
5
Data Structures
5
6
Continued
5
7
MIDTERM, Algorithms
6
8
Continued
6
9
Theory of Computational Complexity
Class Notes
10


11


12


13



Revised: April 8, 2009