1. A tree is an AVL tree if

2. Suppose that the class declaration of SomeClass includes the following function prototype bool LessThan( SomeClass anotherObject );
Which of the following tests in the client code correctly compares two class objects alpha and beta?

3. A queue where the de-queue operation depends not on FIFO, is called a priority queue

4. Consider the function X as under
int X (int& Value)
{
return Value;
}
Now a and b are integers in a calling function. Which one of the following is a valid call to the above function
X

5. Which one is a self- referential data type?

6. Let’s call the node as that requires re-balancing. Consider the two cases given below:
1) An insertion into left sub tree of the left child of a
2) An insertion into right sub tree of the right child of a.
Which of the following statement is correct about these two cases?

7. In the linked list implementation of the stack class, where does the push member function places the new entry
on the linked list?

8. Which one of the following calling methods does not change the original value of the argument in the calling function?

9. Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What statement changes currentNode so that it refers to the next node?

10. Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What boolean expression will be true when cursor refers to the tail node of the list?

11. (i) A binary tree can contain at least 2L Nodes at level L.
(ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive.
(iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1- 1 .
(iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of nodes.

Which one of the following is correct in respect of the above statements regarding the Binary trees?

12. In which of the traversal method, the recursive calls can be used to traverse a binary tree ?

13. The expression AB+C* is called?

14. The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

15. A tree is an AVL tree if

16. Here is the start of a C++ class declaration:
class foo
{
public:
void x(foo f);
void y(const foo f);
void z(foo f) const;
...
Which of the three member functions can alter the PRIVATE member variables of the foo object that activates
the function?

17. The nodes with no successor are called _________

18. Which one of the following statement is NOT correct .

19. We access elements in AVL Tree in,

20. In the call by value methodology, a copy of the object is passed to the called function.

21. When should you use a const reference parameter?

22. What is the maximum depth of recursive calls a function may make?

23. Each operator in a postfix expression refers to the previous ________ operand(s)

24. “+” is a _________operator.

25. Suppose we have a circular array implementation of the queue class, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42, i.e., the array has been declared to be of size 42. Where does the push member function place the new entry in the array?

26. The tree data structure is a

27. Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,

28. Doubly Linked List always has one NULL pointer

29. _________ is a binary tree where every node has a value, every node's left subtree contains only values less
than or equal to the node's value, and every node's right subtree contains only values that are greater then or
equal?

30. AVL Tree is,