CS301-Midterm
1 / 50
In an array list the current element is
2 / 50
5+6/2 If one converts the above expression into postfix, what would be the resultant expression?
3 / 50
The tree data structure is a
4 / 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?
5 / 50
AVL Tree is,
6 / 50
The difference between a binary tree and a binary search tree is that ,a binary search tree has
7 / 50
Which one of the following is a valid postfix expression?
8 / 50
Which one of the following calling methods does not change the original value of the argument in the calling function?
9 / 50
The nodes with no successor are called _________
10 / 50
11 / 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 ?
12 / 50
Which statement of the following statements is incorrect?
13 / 50
Which one of the following operators has higher priority than all of others?
14 / 50
Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,
15 / 50
A tree is an AVL tree if
16 / 50
Consider the following sequence of push operations in a stack: stack.push(’7’); stack.push(’8’); stack.push(’9’); stack.push(’10’); stack.push(’11’); stack.push(’12’);
17 / 50
Which of the following is Non Linear Data Structure?
18 / 50
Which one of the following is correct in respect of the above statements regarding the Binary trees?
19 / 50
________ is the maximum number of nodes that you can have on a stack-linked list ?
20 / 50
21 / 50
22 / 50
A binary search tree should have minimum of one ________ node/s at each level,
23 / 50
Parameters in function call are passed using,
24 / 50
Which one is INCORRECT?
25 / 50
The operation for adding an entry to a stack is traditionally called :
26 / 50
We access elements in AVL Tree in,
27 / 50
Which one of the following statements is NOT correct?
28 / 50
29 / 50
What is the maximum depth of recursive calls a function may make?
30 / 50
A queue where the de-queue operation depends not on FIFO, is called a priority queue
31 / 50
Queue follows,
32 / 50
In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?
33 / 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)?
34 / 50
The operation for removing an entry from a stack is traditionally called:
35 / 50
bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?
36 / 50
Which one is a self- referential data type?
37 / 50
38 / 50
The expression AB+C* is called?
39 / 50
Which one of the following statements is correct?
40 / 50
41 / 50
42 / 50
We can add elements in QUEUE From _________
43 / 50
44 / 50
45 / 50
Which of the above is/are related to normal queues?
46 / 50
Each node in doubly link list has,
47 / 50
48 / 50
Each node in Binary Search Tree has
49 / 50
50 / 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?
Your score is
The average score is 51%
Restart quiz
