CMPT 120 D1 FUTURE Home MAYBE – and as itemized list

An elementary introduction to computing science and computer programming, suitable for students with little or no programming background. Students will learn … more

===========================

Introduction to Computer Science and Programming

Instructor: Diana Cukierman
TAs: Seyed Hajimirsadeghi,  Zhiwei Liao, Hao Wang
Contacting the teaching staff:  cmpt-120-d1-help@sfu.ca
See Course details in the right hand side, under Menu
Visit the Posts in the right hand side menu
Quick access for frequently used links:
Course calendar Includes lecture,  office hours and  test dates, one month at a time. It may be updated as the course progresses.
Semester at a glance The whole semester is summarized in one or two pages. Includes due dates. Will be updated as the course progresses.
CMPT 120? or CMPT 126? Self evaluation The self evaluation  test is recommended for students who may have an appropriate background to take directly CMPT 126. Consult with the instructor and academic advisors if in doubt.
CMPT 120? or CMPT 126? Self evaluation The self evaluation test is recommended for students who may have an appropriate background to take directly CMPT 126. Consult with the instructor and academic advisors if in doubt.
CMPT 120? or CMPT 126? Self evaluation The self evaluation test is recommended for students who may have an appropriate background to take directly CMPT 126. Consult with the instructor and academic advisors if in doubt.
CMPT 120? or CMPT 126? Self evaluation The self evaluation test is recommended for students who may have an appropriate background to take directly CMPT 126. Consult with the instructor and academic advisors if in doubt.
Continuing with expressions, function definitions, Boolean expressions, Control Structures: Conditionals (If statements)

Solutions to lab exercises

Week 5
Continuing with control structures, Definite Loops: For loops

Solutions to lab exercises

Week 6
Examples, concepts, flowcharts: for loops and if statements
Same as above, also work on exercises Notes and Examples
Week 7
Examples, concepts, flowcharts: for loops and if statements. Incorporating while loops
Same as above, also work on exercises Notes and Examples ,

Notes and examples 2

Week 8
Examples, concepts, flowcharts: While loops, order of execution.

Notes and examples 2

Week 9
Functions in more depth – scope of variables: global and local variables

Notes and examples 2

Week10
Lists

Notes and Examples 2

Notes and examples 3

Notes and examples 4

Week11
Lists (cont.)
Notes and examples

Notes-announcements

Notes and examples

Week12
Lists (cont.), Binary Numbers

Notes and examples.2

Week13
Representing Information, Binary Numbers (cont.), Time complexity