# CSC2025 Quiz 9Fall 2013

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

This is the 9th daily quiz to be taken or before Tuesday, 19 November 2013 You should need several hours to do this quiz properly, so it is being made available early. It involves some serious programming. You may work with whoever else you wish on this quiz, but you are responsible for understanding whatever you submit. You should submit your best effort on time, but you may return to this important quiz as often as you wish to try to improve your work for full credit. This is a very hard quiz. Don't get discouraged if you have trouble with it. We will work through the problems people have together and get everybdy to understand how to handle this, but if you don't try it yourself, you won't fully appreciate the discussion.

<==== 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. The previous two quizzes were concerned with programming involving graph theory. Draw on what you have learned to write your own class to represent an arbitrary directed graph with weighted edges. The graph should be stored in an array, rather than by using links. Using that class, write a complete implementation of Dijkstra's algorithm, complete with a test program and test data. Include in the comments a discussion of the performance of your code in terms of time and space, and include in your tests, tests of that performance. Post your program, documentation and data on your course web site and give the URL as the answer to this question. Be sure to grant access to yayahjb@gmail.com.

2. The previous two quizzes were concerned with programming involving graph theory. Draw on what you have learned to write your own class to represent an arbitrary directed graph with weighted edges. The graph should be stored by using links, rather than by using an array. Using that class, write a complete implementation of Dijkstra's algorithm, complete with a test program and test data. Include in the comments a discussion of the performance of your code in terms of time and space, and include in your tests, tests of that performance, and compare them to your results on question 1. Post your program, documentation and data on your course web site and give the URL as the answer to this question. Be sure to grant access to yayahjb@gmail.com.

3. Discuss how to create a Binary Search Tree and how to rebalance it on data insertion.

4. Describe your project and summarize its status. Post as much as you have on the project to the web and give the URL.

5. Explain the three most important things you learned from Dr. Garg's lecture 31

6. Explain the three most important things you learned from Dr. Garg's lecture 32

7. Explain the three most important things you learned from Dr. Garg's lecture 33

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

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

Revised 17 November 2013