Rift Valley University – Adama Campus

Department of Computer Science – Analysis of Algorithms – Assignment II

Instruction: This is an individual assignment that you have to work on your own and submit
your assignment at the time of your final exam.

1. What is a graph? What are the ways used for representing graphs?
2. How do you traverse a graph? State graph traversal algorithms and their corresponding
complexity?
3. Consider the following labeled graph and answer the questions below:

(a) Represent the graph using both (i) adjacency matrix and (ii) adjacency list?
(b) Obtain the traversal of the graph using both (i) DFS and (ii) BFS?
4. What is a minimum spanning tree of a graph? For the following graph below find
(a) The minimum spanning tree using (i) Prim’s algorithm and (ii) Kruskal’s
algorithm?
(b) Obtain the shortest-path from node 𝒂 to every other nodes using the
Dijkstra’s algorithm?

5. List and briefly describe the algorithm design techniques?