Answer the following true/false and multiple choice questions and briefly explain your answer. Q1: A special property of

[answerhappygod]

Answer The Following True False And Multiple Choice Questions And Briefly Explain Your Answer Q1 A Special Property Of 1 (70.52 KiB) Viewed 19 times

Answer the following true/false and multiple choice questions and briefly explain your answer. Q1: A special property of BST in-order traversal is that it traverses in an increasing order. Q2: If the values of a sorted array are stored in a balanced BT, only level-order traverse displays the values in order. Q3: The left and right sub-trees of a heap should be heaps. Q4: In a BST, the node stores the minimum value is always a leaf. Q5: Finding the shortest path between two cities is an application of graphs. Q6: Adjacency matrix of all graphs are symmetric. Q7: For some sparse graph an adjacency list is more space efficient against an adjacency matrix. Q8: A connected graph G without any cycles is called ......... a) Weighted graph b) DAG c) Tree d) None, if G is connected then it must contain a cycle Q9: Given a binary tree, which traversal type would print the values in the nodes in sorted order? a) Pre-Order Traversal b) Post-Order Traversal c) In-Order Traversal d) None of the above Q10: A heap is represented using an array. Which of the following arrays corresponds to a heap? a) 16 | 14 | 10 | 8|7|9|3|2|4|1 b) 16 | 14 | 3 | 8 | 7 | 9 | 10 | 2 | 4 | 1 c) 16 | 14 | 10 | 8 | 1 | 9 | 3|2|4|7 d) 16 | 14 | 10 | 4 | 7 | 9 | 3 | 2 | 8 | 1 e) None of the above satisfies heap conditions! Q11: In an array representation of a binary tree, if a node is stored at index 3, the left child of the node will be at index a) 5 b) 6 c) 7 d) 8 e) Other:
Q12: Given the graph below, which of the following is not a visit order of BFS algorithm? 8 9 (10) b) a) 13 697410852 24536978110 c) 31 697410852 d) 43 169710852 e) Other: Q13: For the given graph(G), which of the following statements is true? (B) a) G is a complete graph b) G is not a connected graph c) The vertex connectivity of the graph is 2 d) The edge connectivity of the graph is 1 Q14: What is the number of edges present in a complete graph having n vertices? a) (n*(n+1))/2 b) (n*(n-1))/2 c) n d) Information given is insufficient
Q15: The number of elements in the adjacency matrix of a graph having 7 vertices is a) 7 b) 14 c) 36 d) 49 Q16: The time complexity to calculate the number of edges in a graph whose information in stored in form of an adjacency matrix is a) O (V) b) O (E²) c) O (E) d) O (V²) Q17: On which of the following statements does the time complexity of checking if an edge exists between two particular vertices is not, depends? a) Depends on the number of edges b) Depends on the number of vertices c) Is independent of both the number of edges and vertices d) It depends on both the number of edges and vertices
Q18: Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is_ a) O(E) b) O (V * V) c) O (E + V) d) O (V) Q19: Which of the following properties are obeyed by all three tree - traversals? a) Left subtrees are visited before right subtrees b) Right subtrees are visited before left subtrees c) Root node is visited before left subtree d) Root node is visited before right subtree a) Each node has exactly zero or two children b) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left c) A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right d) A tree In which all nodes have degree 2 Q21: Indicate which, of the following graphs G = (V, E), | V| = 5, is not connected a) E = {{1, 2}, {1, 2}, {2, 3}, {3, 4}, {1,5}, {1,5}} b) E = {{4, 5}, {1, 3}, {1, 3}, {2, 3}, {2, 5}, {4, 5}} {{4, 5}, {1, 3}, {1, 3}, {2, 3}, {2, 4}, {4, 5}} d) E = {{1, 2}, {2, 3}, {1, 2}, {1, 3}, {2, 3}, {4, 5}} c) E = Q20: What is a complete binary tree?