CS301-Midterm
1 / 50
We access elements in AVL Tree in,
2 / 50
Which one of the following calling methods does not change the original value of the argument in the calling function?
3 / 50
Which one of the following is a valid postfix expression?
4 / 50
Consider the following infix expression: 3+5*6–7*(8+5) Which of the following is a correct equivalent expression(s) for the above?
5 / 50
Consider the following function: void test_a(int n) { cout << n << " "; if (n>0) test_a(n-2); } What is printed by the call test_a(4)?
6 / 50
________ is the maximum number of nodes that you can have on a stack-linked list ?
7 / 50
Which statement of the following statements is incorrect?
8 / 50
AVL Tree is,
9 / 50
In an array list the current element is
10 / 50
Where does the push member function place the new entry in the array?
11 / 50
There is/are case/s for rotation in an AVL tree,
12 / 50
13 / 50
Which one of the following statements is NOT correct?
14 / 50
Which one is INCORRECT?
15 / 50
The operation for removing an entry from a stack is traditionally called:
16 / 50
What statement changes currentNode so that it refers to the next node?
17 / 50
bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?
18 / 50
19 / 50
A tree is an AVL tree if
20 / 50
Which one of the following statements is correct?
21 / 50
In which of the traversal method, the recursive calls can be used to traverse a binary tree ?
22 / 50
Each node in doubly link list has,
23 / 50
Which of the following is Non Linear Data Structure?
24 / 50
25 / 50
Is a data structure that can grow easily dynamically at run time without having to copy existing elements?
26 / 50
5+6/2 If one converts the above expression into postfix, what would be the resultant expression?
27 / 50
Which of the above is/are related to normal queues?
28 / 50
A queue where the de-queue operation depends not on FIFO, is called a priority queue
29 / 50
We can add elements in QUEUE From _________
30 / 50
Which of the following is a non linear data structure?
31 / 50
What is the maximum depth of recursive calls a function may make?
32 / 50
Which one is a self- referential data type?
33 / 50
_________ 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?
34 / 50
35 / 50
36 / 50
The expression AB+C* is called?
37 / 50
The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should
38 / 50
The difference between a binary tree and a binary search tree is that ,a binary search tree has
39 / 50
Which of the following can be used to reverse a string value,
40 / 50
Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,
41 / 50
42 / 50
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 ?
43 / 50
A binary search tree should have minimum of one ________ node/s at each level,
44 / 50
The tree data structure is a
45 / 50
A Compound Data Structure is the data structure which can have multiple data items of same type or of different types.Which of the following can be considered compound data structure?
46 / 50
What boolean expression will be true when cursor refers to the tail node of the list?
47 / 50
Parameters in function call are passed using,
48 / 50
Which one of the following operators has higher priority than all of others?
49 / 50
Queue follows,
50 / 50
The operation for adding an entry to a stack is traditionally called :
Your score is
The average score is 51%
Restart quiz
