DBATU Model MCQ – Data Structures Spread the love Views: 201 [adinserter block="1"] Welcome to your Data Structures, dated August 2, 2021 1. A full binary tree with n leaves containsDeselect Answern - 1 nodeslog2n nodes2n-1 nodes2n nodes 2. The data structure required to Breadth first Traversal on a graph isDeselect Answerqueuestackarraynone of the above 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 Answeradd all values by 10subtract 10 from all the valuesIn both the cases of multiplying and adding by 10multiply all values by 10 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 Answerevery node stores data saying which of its children exist in the arrayno need of any changes continue with 2w and 2w+1, if node is at ikeep a separate table telling children of a nodeuse another array parallel to the array with tree 5. In what type of dynamic array do you divide the array into two parts?Deselect AnswerHashed Array TreeBounded-size dynamic arrayGeometric ArrayNone of the mentioned 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 Answer4210 7. What is the location of parent node for any arbitary node i?Deselect Answer(i/2) position(i+1)/ positionceil(i/2) positionfloor(i/2) position 8. To which data structure are skip lists similar to in terms of time complexities in worst and best cases?Deselect Answerbalanced binary search treesbinary search treesbinary treeslinked list 9. What is the average case complexity of selection sort?Deselect AnswerO(nlogn)O(logn)O(n)O(n2) 10. What is the number of moves required in the Tower of Hanoi problem for k disks?Deselect Answer2k – 22k+22k-12k+1 Please fill in the comment box below. Name Email [adinserter block="1"] Spread the love