Course Notes and Problems

Course Notes, Practice Problems, and Solutions
Course Notes and Stuff Extensive C++ notes

Growth of Functions (introduction to complexity)

Recursion

Hanoi puzzle code

Execution tree for Hanoi puzzle

Simple Unified Modeling Language (UML)

OOP design information

OOP design example

OOP design principles

Algorithm to convert infix to postfix

Show execution of infix to postfix algorithm

Algorithm to evaluate a postfix expression

Induction proof examples

Recurrence equation examples

Propositional Logic

Predicate Logic

Obama on sorting

Sorting out sorting, part 1

Sorting out sorting, part 2

Sorting out sorting, part 3

Sorting out sorting, part 4

Design patterns

Gang of Four's (gof) original design patterns

Exam

Sample old midterm exam .................... solution (within typos)

Practice Problems

Number Base Problems .............. solutions

Logic Practice Problems

Recursion 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

Find recurrence equation/big-oh for the Towers of Hanoi (hint) .............. solution

Induction Problems ....................... solutions

Induction and recurrence practice problems from Rosen book, 6th edition

Section 4.1: #7, #11, #47

Section 7.2: #47(a) my answer

Induction and recurrence practice problems from Rosen book, 7th edition

Section 5.1: #7, #11, #49

Section 8.2: #47(a) my answer

Big-O notes on summations

Big-O Practice Problems ....................... solutions

Complexity practice problems from Rosen book (6th edition):

Section 3.1: #35, #39, #41(a), #47

Section 3.2: #1, #3, #15, #19

Section 3.3: #3, #5, #17, #19, #25

Complexity practice problems from Rosen book (7th edition):

Section 3.1: #35, #39, #41(a), #47

Section 3.2: #1, #3, #15, #25

Section 3.3: #7, #9, #27, #29, #35

Here are the actual problems from Rosen