Mathematical Foundations of Computer Engineering

- Syllabus
- TA info
- Textbook Web site
- PDF of entire textbook
- PDF of solutions to selected problems in textbook
- Source code demonstrated in class
- Binary search example
- Polynomial and exponential running time plots
- Notes on FFT
- 8-point FFT example
- Notes on inclusion-exclusion principle
- Material covered on Midterm 1
- Sample test for Midterm 1
- Notes on probability
- Notes on applications of probability (Huffman codes and Pi estimation)
- Example structural induction proof
- Notes on AVL trees
- Notes on Prim's Algorithm (including pseudocode)
- Dijkstra's Algorithm pseudocode
- A* Algorithm description, pseudocode, and example (
*Note:*I generally do not like to reference Wikipedia pages but this description is by far the clearest I found among the first 10 A* Algorithm sites I visited.) - Notes on network flow
- Material covered on Midterm 2
- Sample test for Midterm 2
- Notes on game trees
- Notes on state machine minimization
- Pascal context-free grammar
- New material for final exam (since Midterm 2)
- Sample final exam

- Homework 1 (due Sept. 1)
- Homework 2 (due Sept. 8)
- Homework 3 (due Sept. 15)
- Homework 4 (No turn in - study problems only)
- Homework 5 (due Oct. 4)
- Homework 6 (due Oct. 13)
- Homework 7 (due Oct. 20)
- Homework 8 (due Oct. 27)
- Homework 9 (due Nov. 3)
- Homework 10 (No turn in - study problems only)
- Homework 11 (due Nov. 20)
- Homework 12 (due Dec. 4)

Problems with this page? Please email doug.blough ece.gatech.edu

Page last modified on November 27, 2017