Question#1: Encircle the correct answer. Avoid cutting and overwriting. (1+20=20) 1. Consider an undirected weighted graph, which of the given edges would form a cycle? a) AB & BC b) AB&BA C) AC&BC d) None 2. Consider a directed graph and set of continuous edges {AB,BC,CD,DF). The set represent which of the following concept? a) Cycle b) Tree c) Simple path d) None 3. Consider a graph G1 below. G1 is only a graph and cannot be classified as a tree. Is the statement true or false? G1 a) True b) False 4. Consider a graph P1 below, the possible spanning trees of P1 can be: 5 P1 1| Email your handwritten answer sheet (pdf) at mariamb_meer@yahoo.com c) Botha) &D) d) None 5. In a spanning tree of any undirected graph, how many numbers of nodes (N) and edges are there, respectively? a)N, N-2 b) N-1,N c) N-1, N-1 d) None 6. In the given graph H1 below, the set of edges "CBDC" is what? 9 HI a) Simple path b) Cycle c) Loop d) None 7. Consider the graph B, and corresponding adjacency matrix M below, does M correctly represent all the edges of B? 1 2 3 4 1 1 1 1 0 2 1 0 1 0 3 0 1 1 1 4 0 1 0 M a) Yes b) No 8. While traversing a graph using DFS, are the leaf nodes pushed into the stack if unexplored nodes are remaining? a) Yes b) No 9. If all adjacent nodes of a predecessor/parent node are fully explored in any order, then this graph traversal is what? a) DFS b) BFS c) BST d) None 10. Given a graph Q below, select the valid DFS. 2 Email your handwritten answer sheet (pdf) af mariamh_meera yahoo.com