Question No. 01 Marks 10.
To traverse means to visit the vertices in some systematic order. You should be familiar with various traversal
methods for trees:
In this assignment, you’ll see one other traversal: depth first search (DFS). This construct spanning tree with certain properties useful in other graph algorithms. We’ll start by describing it in undirected graphs, but it is also very useful for directed graphs.
You are supposed to solve the given example of an undirected graph with DFS algorithm by taking ‘A’ is the starting point.
Question no. 2 Marks 10.
You are required to articulate the optimal way to select Game playing problems. Support your answer with reason.DOWNLOAD SOLUTION HERE