CS301-Midterm
1 / 50
In which of the traversal method, the recursive calls can be used to traverse a binary tree ?
2 / 50
AVL Tree is,
3 / 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 ?
4 / 50
We can add elements in QUEUE From _________
5 / 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?
6 / 50
The nodes with no successor are called _________
7 / 50
A tree is an AVL tree if
8 / 50
Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are,
9 / 50
Each node in doubly link list has,
10 / 50
In a program a reference variable, say x, can be declared as
11 / 50
12 / 50
Which one of the following calling methods does not change the original value of the argument in the calling function?
13 / 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?
14 / 50
The tree data structure is a
15 / 50
Where does the push member function place the new entry in the array?
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
The operation for removing an entry from a stack is traditionally called:
18 / 50
Which statement of the following statements is incorrect?
19 / 50
The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should
20 / 50
The operation for adding an entry to a stack is traditionally called :
21 / 50
Which of the following can be used to reverse a string value,
22 / 50
bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?
23 / 50
Which one of the following is a valid postfix expression?
24 / 50
25 / 50
26 / 50
Which one of the following statements is correct?
27 / 50
In an array list the current element is
28 / 50
Each node in Binary Search Tree has
29 / 50
30 / 50
In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?
31 / 50
32 / 50
The difference between a binary tree and a binary search tree is that ,a binary search tree has
33 / 50
A queue where the de-queue operation depends not on FIFO, is called a priority queue
34 / 50
Parameters in function call are passed using,
35 / 50
5+6/2 If one converts the above expression into postfix, what would be the resultant expression?
36 / 50
37 / 50
38 / 50
We access elements in AVL Tree in,
39 / 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)?
40 / 50
What statement changes currentNode so that it refers to the next node?
41 / 50
Which one of the following statements is NOT correct?
42 / 50
43 / 50
44 / 50
Which of the following is a non linear data structure?
45 / 50
46 / 50
What boolean expression will be true when cursor refers to the tail node of the list?
47 / 50
An array is a group of consecutive related memory locations.
48 / 50
49 / 50
Which of the following abstract data types are NOT used by Integer Abstract Data type group?
50 / 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?
Your score is
The average score is 51%
Restart quiz
