Course Notes, Practice Problems, and Solutions
Course Notes and Stuff
C++ notes
Cone of Learning
Google's C++ Style Guide
Java Coding Style Conventions
Basic Unix commands
How to transfer files and compile under linux
Getting started using MS Visual Studio (.net)
Language and C++ Environment notes
Java vs. traditional architecture
(e.g., C++)
Software Engineering Life Cycle
Explaining end-of-file I/O
Miscellaneous C++ notes
Pass by value vs. pass by reference
When an object has dynamic memory
Pointers and memory diagram
How to use the valgrind memory checker
STL and iterators: big picture
Notes on the STL and iterators
About summations
Definition of big oh
(introduction to complexity)
Big oh examples
Recursion (and execution trees)
Sorting
Trees
Binary Search Trees
OOP design information
Algorithm to evaluate postfix
Show execution of evaluating postfix
Algorithm to convert infix to postfix
Show execution of infix to postfix algorithm
Recurrence
Induction
Representation of integers
Propositional logic
Predicate logic
Practice Problems
Tree practice: Count the nodes at level n in a binary tree
(root is at level zero) ..............
solution
Find recurrence equation/big-oh for the nodes at level n in binary tree
..............
solution
Number Base Problems
..............
solutions
Induction Problems
.......................
solutions
Big-O Practice Problems
.......................
solutions
Pointer parameter practice
.............
Solution
More pointer parameter practice
.............
Solution