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


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

NOTES:
Lab sessions are posted below. For clarity, every weekday's 8:00-9:00 a.m. time-slot has a brief summary of what is happening with Labs on that day.
Office hours are posted on the schedule below, along with their location.

Course Calendar as of 9:30 PM (Friday) 2015-04-10 for (Sunday) 2015-04-12 thru 2015-04-18 (Saturday)

Wed 22 Apr (12 noon) Final Exam

Your final will be held in
SRCA (so thats Room 220A of Student Recreation Centre )

Lecture Schedule

Section Days Time Place Instructor
201 Mon Wed Fri 10.00–11.00 DMP 110 Alan Hu
202 Tues Thurs 14.00–15.30 DMP 110 Hassan Khosravi

Lab Session Times and Locations

Section Day Time Place TAs
L2DMon11.00-13.00ICCS X350Benny, Kai Di, Justin
L2EMon15.00-17.00ICCS X350Benny, Kai Di, Yushu
L2KMon17.00-19.00ICCS X350Benny, Sainan, Brian
L2GTue11.00-13.00ICCS X350Yushu, Justin, Farzad
L2ATue13.00-15.00ICCS X350Justin, Nasim, Zeinab
L2BWed12.00-14.00ICCS X350Benny, Sainan, Kai Di
L2CThu16.00-18.00ICCS X350Yushu, Kai Di, Farzad
L2JFri14.00-16.00ICCS X350Yushu, Nasim, Zeinab

Sorry, but we're full

In almost every previous offering of this course, immediately following the schedules of the Lectures and the Labs (so right here in this web-based version) there are a couple of sentences -- or paragraph- which encouraged students to attend any of the other cs221 lectures scheduled for that term. The phrase "feel free" was used over and over. The assurance that students should feel free to schedule their own lectures if they so wished, would not have seemed out of place.
One of the intentions of this policy was to empower the students to seek out the knowledge that is offered, and to be persistent about it too. Teaching Staff were aware (and still are) that practical experience is one of the best ways to learn these things, and so students were to "feel free" to attend several lab sessions per week as well.
We cannot offer you that freedom. We don't have the capacity. Registration to Lectures and Labs were wait-listed. Almost all lab sections are now full. So please only attend the Lab section you are registered in; do not attempt to attend another without prior approval. We must be sure there is room for the registered students, because all students must have their work marked in their registered section.
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, and how you can get some help with the current lab material.

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