31. The _______ memory allocation function modifies the previous allocated space.
A. calloc
B. free
C. malloc
D. realloc
Answer : D
32. Number of binary trees formed with 5 nodes are
A. 30
B. 36
C. 108
D. 42
Answer : D
33. The "C" language is
A. Context free language
B. Context sensitive language
C. Regular language
D. None of the above
Answer : A
34. The worst case time complexity of AVL tree is better in comparison to binary search tree for
A. Search and Insert Operations
B. Search and Delete Operations
C. Insert and Delete Operations
D. Search, Insert and Delete Operations
Answer : D
35. In which tree, for every node the height of its left subtree and right subtree differ almost by one?
A. Binary search tree
B. AVL tree
C. Threaded Binary Tree
D. Complete Binary Tree
Answer : B
A. calloc
B. free
C. malloc
D. realloc
Answer : D
32. Number of binary trees formed with 5 nodes are
A. 30
B. 36
C. 108
D. 42
Answer : D
33. The "C" language is
A. Context free language
B. Context sensitive language
C. Regular language
D. None of the above
Answer : A
34. The worst case time complexity of AVL tree is better in comparison to binary search tree for
A. Search and Insert Operations
B. Search and Delete Operations
C. Insert and Delete Operations
D. Search, Insert and Delete Operations
Answer : D
35. In which tree, for every node the height of its left subtree and right subtree differ almost by one?
A. Binary search tree
B. AVL tree
C. Threaded Binary Tree
D. Complete Binary Tree
Answer : B
No comments:
Post a Comment