• Introduction to the CPSC network
• The UNIX graphical manager
• Using a UNIX text editor e.g. GEdit, NEdit
• Going through Assignment zero 'A0' as a tutorial exercise

Second tutorial (Wednesday or Thursday)

• Going through Part I of Assignment 1 'A1' as a tutorial exercise

First tutorial (Monday or Tuesday)

• Variable naming conventions
• Getting user input
• Escape codes
• Order of operation
• Types in Python (string vs. numeric)
• Using format specifiers
• Student exercises

Second tutorial (Wednesday or Thursday)

• Errors: syntax, runtime, logical
• Writing program documentation
• Assignments: documentation and backup requirements
• TA goes over the high level requirements for mini-A2 (the technical concepts: branches and loop will be covered in future lectures and tutorials)

Jan 28 - Feb 3

• Generating random numbers
• Repetition using loops
• Generating random numbers
• Introduction to nesting
• TA goes over the high level requirements for mini-A3 (the technical concepts: functions and other details will be covered in future lectures and tutorials)

Feb 4 - 10

• Tips for program debugging

Second tutorial (Wednesday or Thursday)

• Defining functions
• Declaring local variables
• Passing parameters/inputs into functions

A2 due Friday

• Function inputs/parameters as local variables
• Passing parameters by value
• Function return values
• Boolean functions
• Global vs. local scope
• The 'global' keyword

A3 due Friday

• TA goes over the requirements for mini-assignment 4
• TA goes over the requirements for (full) assignment 4

Second tutorial (Wednesday or Thursday)

• Teaching Assistants will hand back midterm examinations and go over select questions
• Examinations can only be picked up the student (university regulations do not allow you designate another person to do so)
• Make sure you attend your registered section. The exams distributed for a particular tutorial will only include papers for the students registered in that section

First tutorial (Monday or Tuesday)

• Parameter passing mechanisms (pass by reference and pass by value)
• Complex examples of accessing list elements
• Common problems with lists e.g. "Forest fire", "cheat mode"

Second tutorial (Wednesday or Thursday)

• Writing a Boolean function for lists ("isSpace")
• A more challenging list example problem e.g. checking if a move is valid in a 2D board game
• Drawing graphics using the tkinter library module

Friday March 30 is Good Friday

First tutorial (Monday or Tuesday)

• TA goes over the requirements for mini-assignment 5
• TA goes over academic misconduct cases: distinguishing between what is and is not allowed for this class
• Introduction to classes and objects, splitting classes and functions into multiple modules
• File input and output using a data processing example

Second tutorial (Wednesday or Thursday)

• 'Open tutorial': TAs will be available for help in the lab (you can also work there without asking questions). Unlike regular tutorial you can go during any tutorial time and not just section in which you registered. List of all tutorials for CPSC 231, winter 2018.

A4 due Friday

First tutorial (Monday or Tuesday)

• Error handling file IO and using exceptions
• Modules: functions, classes and objects. Defining a module with global constants
• Advanced trace using classes and objects

• Introduction to recursion
• TA goes over the requirements for A5

First tutorial (Monday or Tuesday)

• More recursive examples: error handling, implementing the Fibonacci number sequence
• Recursive student exercises

• 'Open tutorial': TAs will be available for help in the lab (you can also work there without asking questions). Unlike regular tutorial you can go during any tutorial time and not just section in which you registered. List of all tutorials for CPSC 231, winter 2018.

A5 due Friday