Lectures

This calendar displays what we have covered each day and may also contain rough estimates of what we will cover in the future. Information listed about future dates is speculative and may change over time, except for exam dates.

Week Mon Wed Fri
1
2
3
4
5
  • folder 10-20

    recursive backtracking;
    classes and objects (icon preview)

    icon read Ch. 9; Ch. 6

  • folder 10-24

    *** THIS LECTURE HELD IN ROOM 420-040 ***

    arrays; implementing a collection class (icon preview)

    icon read 11.2 - 11.3, 12.1, 12.3, 14.1, 14.4

6
  • folder 10-27

    pointers and linked nodes (icon preview)

    icon read 11.2, 11.4; 12.1 - 12.3

    icon Wikipedia: pointer

7
  • folder 11-05

    MIDTERM EXAM is Wed Nov 5 at 7-9pm!

    binary search trees (BSTs);
    tree set implementation (icon preview)

    icon read 16.2

    icon Wikipedia: BST

    icon Videos: Julie

  • folder 11-07

    tree map implementation;
    balanced trees (icon preview)

    icon read 16.3 - 16.4

    icon Wikipedia: AVL tree

8
9
10
  • folder 11-24

    NO CLASS
    Thanksgiving holiday

  • folder 11-26

    NO CLASS
    Thanksgiving holiday

  • folder 11-28

    NO CLASS
    Thanksgiving holiday

11
  • folder 12-03

    *** THIS LECTURE HELD IN ROOM 420-040 ***

    polymorphism; templates (icon preview)

    icon read: Ch. 19; 14.1 - 14.2

    icon Wikipedia: polymorphism, templates

  • folder 12-05

    standard template library (STL);
    C++ without Stanford libraries;
    course wrap-up; discuss final exam (icon preview)

    icon read: Ch. 20 (optional)

    icon Wikipedia: STL; STL reference

12
  • folder 12-08
  • folder 12-10

    Final Exam, Wed 12-10, 12:15 - 3:15pm

  • folder 12-12
This document and its content are copyright © Marty Stepp, 2014. All rights reserved. Any redistribution, reproduction, transmission, or storage of part or all of the contents in any form is prohibited without the authors' expressed written permission.