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