CSI 202 - Computer Science II - Spring 2011

Week #

Lecture #s

Description

Files/HW/Links

16
  • 45
  • Final Exams
  • Final Exams
15
  • 44
  • 43
  • Reading Day
  • 3 Sorts
  • Big-Oh
14
  • 42
  • 41
  • 40
  • Exam#3
  • RB Trees
  • RB Trees
13
  • 39
  • 38
  • 37
  • Review
  • Rotations
  • Comparisons/Practice
  •  
  •  
  •  
12
  • 36
  • 35
  • 34
  • AVL trees
  • AVL Trees
  • Trees in Code
11
  • 33
  • 32
  • 31
  • Red-Black Trees
  • Advising Day
  • Red-Black Trees
  •  
  •  
  •  
10
  • 30
  • 29
  • 28
  • BST
  • Review
  • Exam II
9
  • 27
  • 26
  • 25
  • Review, Trees
  • Trees in code
  • Depth First Traversal (pre,post,in- order), Breadth First Traversal
8
  • 22-24
  • SPRING BREAK
  • No classes
7
  • 21
  • 20
  • 19
  • Programming Recursion, Tree Basics
  • Exam
  • Recursion Review
  •  
  •  
  •  
6
  • 18
  • 17
  • 16
  • BST
  • Tree Intro
  • Queues
  •  
  •  
  •  
5
  • 15
  • 14
  • 13
  • Stacks/Queues
  • Vectors, Strings
  • Exam
4
  • 12
  • 11
  • 10
  • Classes Wrapup
  • Overloading
  • Classes, Big 3
3
  • 9
  • 8
  • 7
  • Classes/Inheritance
  • -Wall, Linked Lists
  • Pointers and Classes
2
  • 6
  • 5
  • 4
  • Linked Lists
  • Linked Lists and Code
  • Linked Lists
  •  
  •  
  •  
1
  • 3
  • 2
  • 1
  • Dynamic Arrays and Memory
  • Continued Review
  • Syllabus and Review