The oral exam will be held on Thursday 11 2015.

The exam will focus on (1) your solution of the assignment, and (2) a randomly drawn exam question.

You should prepare a short presentation (maximum 5 minutes) on your assignment, which should focus on the algorithms and data structures used for solving the assignment. The examiners will discuss the assignment with you, and might ask questions about things in the report, explanations of your solution, or background questions relevant to the assignment, relating to the course contents.

Finally, you will be given an exam question drawn randomly from the following list:

1. Class TreeMap
2. Class HashMap
3. Quicksort
4. Mergesort
5. Heapsort
6. Dijkstra’s algorithm
7. Huffman’s algorithm

You should be prepared to give a short presentation (maximum 5 minutes) on each of these subjects.

For subjects 1 to 2 you can structure your presentation as follows:

a) Name the most important operations of the class.
b) Name one or more examples of application.
c) Describe how the class has been implemented.
d) Specify the running time of its operations using Big-Oh notation.

For subjects 3 to 7 you can structure your presentation as follows:

a) Specify input and output for the algorithm.
b) Describe the main idea of the algorithm.
c) Specify its running time using Big-Oh notation.

Your presentations can be verbal and/or use overhead projector slides. You can also show material on a laptop computer, provided that it is ready to display without any delay.