CSI 202 - Computer Science II

Week #

Lecture #s

Description

15
  • 40
  • 39
14
  • 38
  • 37
  • 36
  • Exam
  • AVL, Review
  • AVL Trees
13
  • 35
  • Trees, Binary Search Trees
12
  • 34
  • 33
  • 32
  • Linked Lists - as a class - Big 3 - Assignment #11
  • Linked Lists (push_back, pop_back, insert_at) Assignment #10
  • Linked Lists (add_at_front, remove_from_front)
11
  • 31
  • 30
  • 29
  • Linked Lists (Nodes, head, counting)
  • Exam Review - Assignment #9
  • Exam
10
  • 28
  • 27
  • Priority Queues, Overview
  • Templated Functions and Classes
9
  • 26
  • 25
  • 24
  • Comparable Abstract Class - why can't we have one? who can have one?
  • File input/output
  • Person/Doctor/Patient/Billing hierarchy
8
  • 23
  • 22
  • 21
  • Queues
  • Purely Virtual Functions/Abstract Classes Assignment #8
  • Virtual Functions
7
  • 20
  • 19
  • Stacks, Inheritance Review
  • Inheritance visibility (protected)
6
  • 18
  • 17
  • 16
  • Inheritance
  • friends review, stacks, and Assignment #7 - STL stacks
  • Rational, overloading, friend functions
5
  • 15
  • 14
  • 13
  • IntCell, overloaded operations
  • Exam
  • The Big 3
4
  • 12
  • 11
  • 10
  • Constructors, Default Values, Big 3
  • Classes, Constructors, Initializer Lists, Destructors Assigment #6 due Fri - using classes
  • Assignment #5 due Wed - using structs
3
  • 9
  • 8
  • 7
2
  • 6
  • 5
  • 4
1
  • 3
  • 2
  • 1
  • Pointers
  • Review 201                                                                
  • Syllabus