CS 136 Elementary Algorithm Design and Data Abstraction
Computer Science (2009-2010)

This course builds on the techniques and patterns learned in CS 135 while making the transition to use of an imperative language. It introduces the design and analysis of algorithms, the management of information, and the programming mechanisms and methodologies required in implementations. Topics discussed include iterative and recursive sorting algorithms; lists, stacks, queues, trees, and their application; abstract data types and their implementations.
Prerequisites: CS 116 or a grade of at least 60% in CS 135.
Antirequisites: CS 134, 137, 138, 145
Notes: See Note 2 above. Offered: F,W,S

Sections For Fall 2009

Note: Choose TUT section for Related 1.
Lectures
ProfessorTimeCapacitySecAssocLocationCode
Larson, Kate 08:30-09:50 M T W Th F 39/89 1 1 MC 4061 5446
Larson, Kate 11:30-12:50 M T W Th F 115/120 2 2 MC 4020 6841
Tutorials
ProfessorTimeCapacitySecAssocLocationCode
TBA 03:30-04:20 M T W Th F 42/59 103 99 DWE 3516 6843
TBA 03:30-04:20 M T W Th F 27/32 104 99 RCH 106 6844
TBA 03:30-04:20 M T W Th F 31/59 102 99 MC 4042 6842
TBA 03:30-04:20 M T W Th F 54/59 101 99 MC 4060 5447
Tests
ProfessorTimeCapacitySecAssocLocationCode
TBA 07:00-09:00M
11/02-11/02
154/209 201 99 UW U 5448

Sections For Spring 2009

Lectures
ProfessorTimeCapacitySecAssocLocationCode
Li, Jiye 02:30-03:50 M T W Th F 100/110 1 1 MC 4059 3356
Tutorials
ProfessorTimeCapacitySecAssocLocationCode
TBA 08:30-09:20 M T W Th F 100/110 101 1 MC 4059 3357
Tests
ProfessorTimeCapacitySecAssocLocationCode
TBA 07:00-09:00M
06/22-06/22
100/110 201 1 UW U 3418

Professors That Have Taught CS 136