1.Which one of the following statement is true for Abstract Data type (ADT)?
It is same as an abstract class It is a data type for which only the operations defined on it can be used but none else It is the data type that cannot be instantiated None of the above.
2.Consider a binary tree that is initially empty. The numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in a binary tree in that order. The binary search tree uses the usual ordering on natural numbers. The in-order traversal sequence of the resultant tree will be
7 6 5 4 8 9 0 1 2 3 1 9 2 7 3 8 5 6 0 4 0 1 2 3 4 5 6 7 8 9 0 3 2 5 6 4 8 1 9 7
3.Faster access to non-local variables is achieved using an array of pointers to activation records called a
Activation tree Stack Heap None of the above
4.The programming language feature that cannot be implemented on a certain processor, which supports only immediate and the direct addressing modes is
Pointers Records Arrays Recursive procedures with local variables
It is same as an abstract class It is a data type for which only the operations defined on it can be used but none else It is the data type that cannot be instantiated None of the above.
2.Consider a binary tree that is initially empty. The numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in a binary tree in that order. The binary search tree uses the usual ordering on natural numbers. The in-order traversal sequence of the resultant tree will be
7 6 5 4 8 9 0 1 2 3 1 9 2 7 3 8 5 6 0 4 0 1 2 3 4 5 6 7 8 9 0 3 2 5 6 4 8 1 9 7
3.Faster access to non-local variables is achieved using an array of pointers to activation records called a
Activation tree Stack Heap None of the above
4.The programming language feature that cannot be implemented on a certain processor, which supports only immediate and the direct addressing modes is
Pointers Records Arrays Recursive procedures with local variables
No comments:
Post a Comment