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