CS301 LIVE QUIZ FINAL TERM 23/24

136
Created on By Dilawar

CS301 LIVE QUIZ FINAL TERM 23/24

1 / 20

A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time.

2 / 20

Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure?

3 / 20

What will be postfix expression of the following infix expression?
Infix Expression : a+b*c-d

4 / 20

For compiler a postfix expression is easier to evaluate than infix expression?

5 / 20

onsider 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)?

6 / 20

If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree?

7 / 20

If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree?

9 / 20

Which one of the following is NOT the property of equivalence relation:

10 / 20

A binary tree of N nodes has _______.

11 / 20

The easiest case of deleting a node from BST is the case in which the node to be deleted ___________.

12 / 20

f there are N elements in an array then the number of maximum steps needed to find an element using Binary
Search is _______ .

13 / 20

Merge sort and quick sort both fall into the same category of sorting algorithms. What is this category?

15 / 20

We convert the ________ pointers of binary to threads in threaded binary tree.

16 / 20

If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a

17 / 20

What is the best definition of a collision in a hash table?

19 / 20

Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays
below; determine the one that cannot possibly be a heap:

20 / 20

Which of the following statement is correct about find(x) operation:

Your score is

The average score is 59%

0%

Leave a Comment