CPSC 221: Basic Algorithms and Data Structures
2016 Winter Term 1
Schedule


Home Learning Goals Schedule Administration Readings Lab/Lecture Notes Assignments Computing

NOTES:

The final will be on Friday, 2016 December 16, 12:00-14:30 in OSBO A

The midterm will be 7:00-8:30pm, on Wednesday evening, 2016 October 19.
Section 101 (afternoon lectures) will be in CIRS 1250.
Section 102 (morning lectures) will be in Neville Scarfe 100.

You may bring one sheet of notes (double-sided) to the exam. No books, calculators, etc.

Lab sessions are listed beneath the calendar below.

Office hours are posted on the schedule here.
Unless otherwise specified, all office hours are in the Demco learning centre (X150), which is behind the Reboot Café on the bottom floor of the X-wing of the computer science building.

The office hour schedule is constantly changing, and the office hour schedule for a week might not be finalized until the week before. Use the arrows below to change what week you're viewing.


Lecture Schedule

Section Days Time Place Instructor
101 Tue Thu 14.00–15.30 CHBE 101 Jan Manuch
102 Tue Thu 8.00–9.30 DMP 310 Will Evans

Lab Session Times and Locations

Section Day Time Place TAs
L1JMon9.00-11.00ICCS X350Chris Hunter, Harman Gakhal
L1CMon16.00-18.00ICCS X350Jason Zeng, Sharon Yang
L1ATue11.00-13.00ICCS X350Nancy Chen, Sharon Yang, Oliver Zhang
L1FTue16.00-18.00ICCS X350Jordan Coblin, Xing Zeng
L1BWed9.00-11.00ICCS X350Henry Chee, Xing Zeng
L1EWed14.00-16.00ICCS X350Henry Chee, Patience Shyu, Jason Zeng
L1MWed17.00-19.00ICCS X350Chris Hunter, Jason Zeng
L1DThu10.30-12.30ICCS X350Harman Gakhal, Mike Spearman, Nancy Chen
L1GThu16.00-18.00ICCS X350Alex Lim, Jordan Coblin
L1KFri13.00-15.00ICCS X350Alex Lim, Patience Shyu, Xing Zeng
L1HFri15.00-17.00ICCS X350David Zheng, Michael Zhang, Oliver Zhang

Sorry, we're full...

If you're trying to enroll in this course, or audit it, or change into a lab or lecture section that's full, please go to the Computer Science main office (ICCS Room 201) and ask to see an undergraduate course advisor. They control all waitlists. (Therefore, asking your TA or professor for a special exception is useless.) If you want more information about how wating lists work, check the following link.

In the past, when we had multiple sections, we encouraged students to attend any or all sections, if they found it helpful. Similarly, if someone missed his/her lab section, we would recommend attending any other lab section that week. Please do not do so this term. We're very full, with waitlists, and we need to give the officially enrolled students priority in their sections. Later in the term, after people drop, we might be able to allow some flexibility, but unless/until your professors announces it, please attend only your registered lecture and lab sections.

Note that help with your current lab-work is available from TA's during their scheduled Office Hours, as posted above on the Course Calendar.

If you do miss one of your scheduled lab sessions, see Missed Lab for how to get the work that was due in that session graded.

Approximate Reading Schedule

Epp Sections (4th ed) Koffman Sections Approximate Week Description
n/a Chapters P and 1 on your own/labs Getting Familiar with C++
n/a 4.5-4.7, 5, 6.1-6.3, 6.5 1 Linked Lists; Stacks; Queues
11.2 2.6 2 Big-O, Big-Omega, Big-Theta
11.3 3 Time and Space Complexity; Memory Layout
n/a 8.5 4 Priority Queues and Heaps
6.1-6.2
7.1-7.2
5.2-5.3, 5.5
Chapter 7 5 Induction and Recursion. Loop Invariants and Program Correctness
11.5 10.1, 10.4, 10.7-10.10 6 Mergesort, Insertion Sort, Quicksort, Heapsort
9.4 Chapter 9 7 Hashing and Hash Tables
10.6 8.1-8.4, 11.1-11.2, 11.5 8-9 Tree traversal, Self-Balancing Search Trees
Sophomoric Parallelism and Concurrency 10-11 Parallelism & Concurrency Intro
10.1-10.4 12.1-12.4 12-13 Graphs & Counting

 

cs221@ugrad.cs.ubc.ca
Last Modified: Sun 18 Sep, 2016