Time Left - 15:00 mins
GATE 2019 - P&DS Quiz-8 (Tree )
Attempt now to get your rank among 510 students!
Question 1
If each node of the B-tree is 80 percent full, and total nodes int the tree are 22,then what is the average number of keys per node of the above B tree?
Question 2
How many distinct binary operations can be defined on a set of 2 elements?
Question 3
Which of the following data structure is suitable for implementing file directory structure in an operating system?
Question 4
In a binary tree, the number of internal nodes of degree 1 is 3 and number of internal nodes of degree 2 is 6. How many leaf nodes will be present in the binary tree?
Question 5
Construct the Max Heap assuming the following set of integers were inserted into it in the following given order: 20, 32, 1, 3, 4, 5, 6, 7, 10, 23, 45
Postorder traversal of the resultant max heap was stored in an array A with an index variable I inorder (Starting from 0).similarly level order traversal was stored in the array B using index variable j in order (starting from 0). For particular element, respective I and j location values from A and B were obtained and is calculated. What could be the maximum possible value of ?
Postorder traversal of the resultant max heap was stored in an array A with an index variable I inorder (Starting from 0).similarly level order traversal was stored in the array B using index variable j in order (starting from 0). For particular element, respective I and j location values from A and B were obtained and is calculated. What could be the maximum possible value of ?
Question 6
A k - ary tree is a tree in which every node has at most k children. In a k - ary tree with n nodes and height h, which of the following is an upper bound for the maximum number of leaves as a function of h, k, and n?
- 510 attempts
- 1 upvote
- 8 comments
Tags :
GATE & PSU CSGeneralMar 31GATE & PSU CS