DBATU Model MCQ – Data Structures Views: 450 [adinserter block="1"] Welcome to your Data Structures, dated October 3, 2024 1. A full binary tree with n leaves containsDeselect Answer n - 1 nodes log2n nodes 2n-1 nodes 2n nodes None 2. The data structure required to Breadth first Traversal on a graph isDeselect Answer queue stack array none of the above None 3. Assuming value of every weight to be greater than 10, in which of the following cases the shortest path of a directed weighted graph from 2 vertices u and v will never change?Deselect Answer add all values by 10 subtract 10 from all the values In both the cases of multiplying and adding by 10 multiply all values by 10 None 4. If the tree is not a complete binary tree then what changes can be made for easy access of children of a node in the array ?Deselect Answer every node stores data saying which of its children exist in the array no need of any changes continue with 2w and 2w+1, if node is at i keep a separate table telling children of a node use another array parallel to the array with tree None 5. In what type of dynamic array do you divide the array into two parts?Deselect Answer Hashed Array Tree Bounded-size dynamic array Geometric Array None of the mentioned None 6. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array?Deselect Answer 4 2 1 0 None 7. What is the location of parent node for any arbitary node i?Deselect Answer (i/2) position (i+1)/ position ceil(i/2) position floor(i/2) position None 8. To which data structure are skip lists similar to in terms of time complexities in worst and best cases?Deselect Answer balanced binary search trees binary search trees binary trees linked list None 9. What is the average case complexity of selection sort?Deselect Answer O(nlogn) O(logn) O(n) O(n2) None 10. What is the number of moves required in the Tower of Hanoi problem for k disks?Deselect Answer 2k – 2 2k+2 2k-1 2k+1 None Please fill in the comment box below. Name Email [adinserter block="1"]
