## CSC2281 Quiz 2## Spring 2013 |

This web page is http://www.bernstein-plus-sons.com/.dowling/CSC2281S13/CSC2281_Quiz_2.html

Copyright © 2011, 2012, 2013 Herbert J. Bernstein and other parties. All rights
reserved.

This is quiz 2 to be taken by Friday, 15 February 2013. It should take you between half an hour and 2 hours to answer the following questions. You should be sure to read Chapter 1 (pp 1 -- 35) of H. J. Bernstein, M. Goldstein, "Network Design and Implementation Lecture Notes Spring 1984" all the way through the section on graph theory and then read the Cook text chapters 1 through 3. Your objective is to be able to start work with the Ford-Fulkerson Max-Flow-Min-Cut algorithm, so you can find the maximal flows on networks. By the end of the semester you will need to be able to do real calculations optimizing real networks.

Revised 27 January 2013