CPSC 221: Basic Algorithms and Data Structures
2015 Winter Term 2
Schedule


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

NOTES:

Labs begin on Monday, January 11.
Lab sessions are listed beneath the calendar below.
Office hours will be 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
201 Mon Wed Fri 10.00–11.00 DMP 110 Lars Kotthoff
202 Mon Wed Fri 16.00–17.00 SCRF 100 Alan Hu

Lab Session Times and Locations

Section Day Time Place TAs
L2DMon11.00-13.00ICCS X050Geneva, Jason, Kyle
L2EMon14.00-16.00ICCS X050Nasim, Jennifer, Coulter
L2GTue11.00-13.00ICCS X050Graham, Devon, Farzad
L2ATue13.00-15.00ICCS X350Jennifer, Coulter, Farzad
L2BWed14.00-16.00ICCS X350Victor, Nasim, Noah
L2KThu14.00-16.00ICCS X350Coulter, Noah, Farzad
L2CThu16.00-18.00ICCS X350Jason, Kyle, Farzad
L2HFri12.00-14.00ICCS X350Geneva, Graham, Devon
L2JFri14.00-16.00ICCS X350Victor, Coulter, Catherine

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.)

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 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 (3rd ed/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
9.2/11.2 2.6 2 Big-O, Big-Omega, Big-Theta
9.3/11.3 Time and Space Complexity; Memory Layout
5.1-5.2/6.1-6.2
7.1-7.2/7.1-7.2
4.2-4.3, 4.5/5.2-5.3, 5.5
Chapter 7 3 Induction and Recursion. Loop Invariants and Program Correctness
n/a 8.5 4 Priority Queues and Heaps
9.5/11.5 10.1, 10.4, 10.7-10.10 5 Mergesort, Insertion Sort, Quicksort, Heapsort
11.5/10.5 8.1-8.4 6 Trees, Tree Traversal, Binary Search Trees
n/a 11.1-11.2, 11.5 7 Tree rotation, B Trees
7.3/9.4 Chapter 9 8 Hashing and Hash Tables
Sophomoric Parallelism and Concurrency 9 Parallelism & Concurrency Intro
10 Parallelism
TBA TBA 11 Parallelism
11.1-11.4/10.1-10.4 12.1-12.4 12 Graphs
6.1-6.5/9.1-9.6
(includes pigeonhole principle)
n/a 13 Counting

 

cs221@ugrad.cs.ubc.ca
Last Modified: Thurs 19 Feb, 2015