CSS interview questions part 15
CSS interview questions part 15
Take as many assements as you can to improve your validate your skill rating
Total Questions: 20
1. A B+ -tree of order 3 is generated by inserting 89, 9 and 8. The generated B+ -tree is __________
Correct Answer is : !important
2. Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node. Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
Correct Answer is : Both Selector and Declaration
3. Efficiency of finding the next record in B+ tree is ____
Correct Answer is : Property
4. What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
Correct Answer is : Selector
5. Which one of the following data structures are preferred in database-system implementation?
Correct Answer is : All of the mentioned
6. What will be the height of a balanced full binary tree with 8 leaves?
Correct Answer is : parent to child
7. The balance factor of a node in a binary tree is defined as _____
Correct Answer is : Align
8. Figure below is a balanced binary tree. If a node inserted as child of the node R, how many nodes will become unbalanced?
Correct Answer is : Resize
9. A binary tree is balanced if the difference between left and right subtree of every node is not more than ____
Correct Answer is : author
10. Which of the following tree data structures is not a balanced binary tree?
Correct Answer is : user
11. Which of following figures is a balanced binary tree?
Correct Answer is : inherit
12. Balanced binary tree with n items allows the lookup of an item in ____ worst-case time.
Correct Answer is : @font-face
13. Which of the following data structures can be efficiently implemented using height balanced binary search tree?
Correct Answer is : 0.5
14. Two balanced binary trees are given with m and n elements respectively. They can be merged into a balanced binary search tree in ____ time.
Correct Answer is : WOFF
15. Which of the following is an advantage of balanced binary search tree, like AVL tree, compared to binary heap?
Correct Answer is : orientation
16. AVL trees are more balanced than Red-black trees.
Correct Answer is : aspect-ratio
17. The figure shown below is a balanced binary tree. If node P is deleted, which of the following nodes will get unbalanced?
Correct Answer is : device-height
18. What is the time complexity of balancing parentheses algorithm?
Correct Answer is : font-style
19. Which application of stack is used to ensure that the pair of parentheses is properly nested?
Correct Answer is : accelerator
20. In balancing parentheses algorithm, the string is read from?
Correct Answer is : font-variant
