CSE20212 Fundamentals of Computing II

 

 

Course Info

Personnel
Lecture Notes
Handouts
Lab
Project
Listserv

Lecture Notes

Lecture 2 - See handouts section of this course site for C/C++ intro

Lecture 3 - Lecture notes Example 1 Example 2 Example 3 Example 4

Lecture 4 - Lecture notes

Lecture 5 - This lecture closely follows the book. See the end of Ch 9 for a summary

Lecture 6 - this pointer, new/delete, static class members, i.e., end of Ch 10

Lecture 7-8 - Const and Friends Lecture notes

Lecture 17 - UML Lecture notes

Lecture 18 - finalize STL algorithms (Ch 22.5)

Lecture 19 - Exception handling (Ch 16)

Lecture 20 - midterm review

Lecture 21-22 - Intro to GLUT - Lecture notes

Lecture 23 - GUI using GLUI - GLUI user manual Download Example code

Lecture 24-25: STL lists and vectors - - Example code

Lecture 26: Battleship example - No inheritance

Lecture 27: Battleship example - With inheritance

Lecture 28: Software engineering - Lecture slides (ppt) Case study

Lecture 29 - Template-based Lists and Trees from Ch 20 - Example code

Lecture 30 - Binary trees and traversing them Example code Traversal wiki

Lecture 31 - Hash tables Example code

Lecture 32 - Hash tables and maps Example code

Lecture 33 - Sorting Example code Lecture notes

Lecture 34 - Introduction to MPI Lecture notes

Lecture 35 - n-queens MPI example

Lecture 36 - design patterns Lecture notes

Lecture 36 - Basic graph algorithms Lecture notes

Lectures 37 - exam review