CSC2281 Quiz 10

Spring 2012
Herbert J. Bernstein ( )

CSC2281 Quiz 10
Spring 2012

 		 

This web page is http://www.bernstein-plus-sons.com/.dowling/CSC2281S12/CSC2281_Quiz_10.html
Copyright © 2011, 2012 Herbert J. Bernstein and other parties. All rights reserved.

This is the tenth and final daily quiz to be taken by Friday, 4 May 2012. It should take you between half an hour and 2 hours to answer the following questions. You should have finished all work for the course other than the final, first.

  <==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>  

Please fill in the following information:

Name:


Email:

Skype ID:

Please answer the following questions on this form (or on a paper copy of this form).

  1. Give the URL of your best and final project for grading.

  2. Carefully describe Dijkstra's algorithm, step by step. Be certain to state what inputs you start with and what outputs the algorithm produces.

  3. Carefully describe Ford-Fulkerson algorithm, step by step. Be certain to state what inputs you start with and what outputs the algorithm produces.

  4. Carefully describe Kleinrock's method of optimizing network capacities, step by step. Be certain to state what inputs you start with and what outputs the algorithm produces.

  5. Referring to your prior answers where appropriate, carefully describe the process of designing and optimizing a network.

  6. Referring to your prior answers, explain how you applied that process and those algorithms to your project.

  <==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>  

Revised 30 April 2012