|
|
|
Lecture Notes
Lecture 2 - Notes; Also see handouts for supporting C/C++ intro
Lecture 3 - Introduction to classes; Notes
Lecture 4 - More classes; Notes
Lecture 5 - Constructors / deconstructors; homework sample; Notes
Lecture 6 - Const, containment, friends and this (Ch 10) Notes
Lecture 7 - Finishing up classes (end of Ch 10) Notes
Lecture 8 - Introduction to overloading (Ch 11) Notes
Lecture 9 - Overloading applied to arrays (middle of Ch 11) Notes
Lecture 10 - Overloading applied to strings; Inheritance (Ch 11, Ch 12) Notes
Lecture 11 - Inheritance (Ch 12) Notes
Lecture 12 - Polymorphism (Ch 13) Notes
Lecture 13 - Polymorphism example and UML Notes
Lecture 14 - Intro to Templates Notes
Lecture 15 - STL vectors, lists and basic algorithms (Ch 22) Notes
Lecture 16 - Templates (Ch 14) Notes
Lecture 17 - Examples of templates Notes
Lecture 18 - Template discussion, new/delete handouts Notes
Lecture 19 - Introduction to exception handling (Ch 16) Notes
Lecture 20 - Discussion of Exception handling handouts Notes
Lecture 21 - Brief intro to OpenGL and the GLUT toolkit Notes
Lecture 22 - Brief intro to Qt Notes
Lecture 23 - Graphs and minimum spanning trees Notes
Lecture 24 - Software engineering Notes
Lecture 25 - Battleship case study Code
Lecture 26 - Battleship case study w/ inheritance Code
Lecture 27 - Design patterns Notes
Lecture 28 - Intro to trees; phylogentics Notes
Lecture 29 - Linked lists and binary trees Code
Lecture 30 - Binary trees, basic stacks Code
Lecture 31 - Advanced STL: lists, binary search Code
Lecture 32 - Advanced STL: maps Code
Lecture 33 - Hash tables Notes
Lecture 34 - Intro to Hidden Markov Models (HMMs) Notes
Lecture 35 - Hidden Markov Models (HMMs) Notes and code
Lecture 36 - Documentation and Version control Notes
Lecture 37 - Introduction to parallel programming Notes
Lecture 38 - Speedup vs. Efficiency; parallel sorting outside Notes
Lecture 39 - Phylogenetics conclusion Notes
|