#### Test 1, Quizzes 1-3, Homework Assignment 1

Symbol [W] refers to the book *Algorithms and Complexity* by Herbert Wilf:

http://www.math.upenn.edu/%7Ewilf/AlgoComp.pdf

Quiz 1, 07/02/12, covers 1.4-1.5, 9.1-9.2

Quiz 1 practice problems:** **1.3, 1.7 (reference: 4.1,
4.2 of [W]), 1.10, 1.11, 1.12, 1.13 (reference: 1.1 of [W]), 1.14, 1.16
(reference: 1.1 of [W]), 1.17, 1.18, 9.1 (change the loop: **for** i:=1 **to**
n **do** to: for i running through all the vertices of the graph)

**Quiz 2, 07/09/12, covers 9.3-9.4**

Quiz 2 practice problems: 9.2, 9.4, 9.7, 9.8, 9.10 (reference: 1.3, 1.5 of [W],
in part b consider only k=1,2,3), 9.13

**Quiz 3, 07/16/12, covers 2.1-2.6**

Quiz 3 practice problems: 2.1, 2.2, 2.3, 2.4, 2.9, 2.11, 2.14, 2.19, 2.24

Homework Assignment 1 due 07/16/12

Textbook problems: 1.10-1.14, 1.16-1.17, 9.4, 9.8, 9.10 (in part b
consider only k=1,2,3), 9.13, 2.8-2.9, 2.11, 3.7

Test 1, 07/23/12, covers 1.4-1.5, 9.1-9.4, 2.1-2.6, 3.1-3.3, Review Problems, Solutions
of Review Problems

Practice problems related to trees: 3.1, 3.3, 3.4, 3.7, 3.10, 3.11, 3.12, 3.14,
3.16