In a circular queue implemented using an array of size 5, if the front is at index 3 and the rear is at index 1, how many elements are present in the queue?
3
1
4
2
Which real-world scenario is best represented using a priority queue?
Maintaining a list of recently used applications
Managing a print queue where documents are printed in the order they are received
Scheduling tasks in an operating system based on their priority levels
Storing a history of visited web pages in a browser
You have a queue implemented using a linked list. What is the time complexity of finding the kth element from the front of the queue?
O(log k)
O(1)
O(k)
O(n)
How does a circular queue determine if it is full?
A separate variable keeps track of the number of elements
Front pointer is one position behind the rear pointer (considering wrapping)
Front pointer equals rear pointer
Rear pointer reaches the end of the array
What is the key advantage of using a linked list implementation for a queue over an array-based implementation?
Easier to implement
Dynamic resizing to prevent overflow
Lower memory usage
Faster enqueue and dequeue operations
Which data structure is commonly used to implement a priority queue where efficient insertion and removal of the highest-priority element are crucial?
Hash Table
Binary Heap
Binary Search Tree
Doubly Linked List
What is the time complexity of inserting an element into a priority queue implemented using a binary heap (in the average case)?
O(n log n)
O(log n)
In the context of Breadth-First Search (BFS), how does a queue help explore a graph?
It stores the path from the source node to the current node.
It maintains a list of visited nodes to prevent cycles.
It facilitates visiting all neighbors of a node before moving to the next level.
It ensures that nodes are visited in a depth-first manner.
You need to implement a queue using two stacks. What is the time complexity of the dequeue operation in the worst-case scenario?
In a priority queue implementation using a sorted array, what is the time complexity of the dequeue operation in the worst-case scenario?