Computer Science 431

Algorithms

Spring 2013, The College of Saint Rose

Agenda

- Announcements
- Exam 2 recap
- Problem Set 6 due
- Problem Set 7 out
- Reachability

Due at the start of class, Tuesday, April 23.

Please submit answers to these questions
either as a hard copy (typeset or handwritten are OK) or by email to
*terescoj AT strose.edu* by the start of class. Please use a clear subject line
when submitting by email (*e.g.*, CSC 431 Lecture
Assignment 24, Joe Student). We will discuss these
questions at the start of class, so no late submissions are
accepted.

- Compute the binary coefficient
*C(6,3)*by applying the dynamic programming algorithm. (3 points) - Levitin Exercise 8.1.12, p. 292 (10 points)
- Levitin Exercise 8.2.1, p. 296 (4 points)
- Levitin Exercise 8.2.6, p. 297 (3 points)

Examples

- Reachability