Poornima Exam 2023

1. Which one of the following is an application of Stack Data Structure?

Managing function calls
The stock span problem
Arithmetic expression evaluation
All of the above

2. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

Insertion Sort
Quick Sort
Heap Sort
Merge Sort

3. In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is

log 2 n/label>
n/2
log 2 n – 1
n

4. What is the worst case possible height of AVL tree?

2Logn (Assume base of log is 2)
1.44log n (Assume base of log is 2)
Depends upon implementation
Theta(n)

5. Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is

Find First Zero
Find First One
Counting lead Zeroes
Counting lead One

6. Which one of the following operations returns the first occurrence of bit 1 in bit arrays?

O(n)
O(log2 n)
O(logn)
O(1)

7. The minimum number of stacks needed to implement a queue is

3
2
1
4

8. What is a bit array?

Data structure for representing arrays of records
Data structure that compactly stores bits
An array in which most of the elements have the same value
Array in which elements are not present in continuous locations

9. Which of the following bitwise operations will you use to set a particular bit to 1?

OR
AND
XOR
NAND

10. Which of the following bitwise operations will you use to set a particular bit to 0?

OR
AND
XOR
NAND

11. Which of the following is not an advantage of bit array?

Exploit bit level parallelism
Maximal use of data cache
Can be stored and manipulated in the register set for long periods of time
Accessing Individual Elements is easy

Poornima Institute of Engineering and Technology Jaipur

Data Structure and Algorithm

Class Test section-C

Warnings