Course description This course serves as an introduction to computer programming and computer science. We will introduce the Python programming language. We will use Python to solve a variety of problems, and practice problem-solving techniques that are applicable to computational problems. We will discuss good practices in software engineering (designing and building large software systems). We will analyze the efficiency of algorithms, and discuss designing efficient algorithms. Various research areas in computer science (AI, software engineering research, the theory of computation, etc.) will be introduced throughout the term. No previous knowledge of programming or computer science is assumed.
The course syllabus is available here.
Lab 1: Tracing, Functions, and Conditionals (assigned Sept. 2, show the TA during the lab).
Lab 2: Functions and Local and Global Variables: Simulating a Pocket Calculator (assigned Sept. 11, show the TA during the lab).
The midterm will be held on Nov. 2
2015 midterm paper. Reference sheet. Solutions: Part 1, Part 2 (contains optional advanced material).
2014 midterm and aid sheet. (Solutions). Note: in Q2d, True and False should switch places. Another solution is to go return not (a==b==c).
2010 midterm. (Solutions; note that there is a small bug in the solutions to the last question and that the midterm was written in Python 2, which means that it uses print <things-to-print> instead of print(<things-to-print>).)
The exam will be held in December. Past exams are below.
2016 exam paper (reference sheet). Solutions + marking scheme.
2015 exam paper (reference sheet). Partial solution of the challenging problems. I encourage people to work on the problems in the beginning of the exam by themsleves. (Note that Q8 and Q9 were supposed to be very challenging -- exam grades were adjusted.)
2014 exam paper (reference sheet). Solutions and my favourite solution of Q7. Video solution of Q7.
Design credit: CS229, Jan 2019.