1.Consider a two dimensional array of integers arr[1…. 10][1…. 15]. One memory location is occupied by each integer. The first element of array is stored at location 100 and the array is stored in row-major order. The address of the element arr[i][j] is
15j + i + 84 15i + j + 84 21i + j + 93 21j + I + 93
2.Assuming that the height of a tree with a single node is 0, the maximum height of any AVL-tree with 7 nodes is
5 4 3 2
3.Consider an empty binary search tree into which the following numbers are inserted in the given order: 10,1, 3, 5, 15, 12, 16. The height of the maximum distance of a leaf node from the root is
2 4 3 8
4.Linked list are not suitable data structures of _________________
Binary search Insertion sort Polynomial manipulation Radix sort
5.For efficiently converting an infix expression to the post fix form, use
A parse tree An operand stack An operator stack Both an operator and an operand stack
15j + i + 84 15i + j + 84 21i + j + 93 21j + I + 93
2.Assuming that the height of a tree with a single node is 0, the maximum height of any AVL-tree with 7 nodes is
5 4 3 2
3.Consider an empty binary search tree into which the following numbers are inserted in the given order: 10,1, 3, 5, 15, 12, 16. The height of the maximum distance of a leaf node from the root is
2 4 3 8
4.Linked list are not suitable data structures of _________________
Binary search Insertion sort Polynomial manipulation Radix sort
5.For efficiently converting an infix expression to the post fix form, use
A parse tree An operand stack An operator stack Both an operator and an operand stack
No comments:
Post a Comment