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