DATA STRUCTURES QUIZ

1. What is the key principle of a queue?

• LIFO

• FIFO

• RANDOM ORDER

• NONE OF THE ABOVE

2. Which operation is used to remove am element from a queue

• ENQUEUE()

• DEQUEUE()

• PUSH()

• POP()

3. Which real-world scenario best represents a queue?

• A stack of plates

• People in line at a bus stop

• Bookshelf

• A tree structure

4. What does a node in a singly linked list contain?

• Data only

• Data and two pointer

• Data and one pointer

• Only a pointer

5. Which data structure is used to implement a dynamic queue?

• Array

• Stack

• Linked List

• Tree

6. Which of these is an example of priority queue?

• People entering a cinema hall

• Patients waiting in an emergency room

• Books arranged on a shelf

• Vending machine

7. Which queue allows insertion and deletion from both ends?

• Circular queue

• Priority queue

• Dequeue(Double-ended queue)

• Simple queue

8. What is the time complexity of inserting a node at the beginning of a singly linked list?

• O(1)

• O(n)

• O(logn)

• O(n^2)

9. An array is a collection of?

• Different datatypes

• Same datatype in random location

• Same datatype in continuous memory

• Dynamic memory allocation

10. What is the time complexity for accessing an element in an array?

• O(1)

• O(n)

• O(logn)

• O(n^2)