This Quiz contains totally 10 Questions each carry 1 point for you.
1. How many Queues are required to implement a Stack?
1
2
3
4
Correct!
Wrong!
2. Which of the following is not the application of the Queue data structure?
Resource shared between various systems
Data is transferred asynchronously
Load balancing
Balancing of symbols
Correct!
Wrong!
3. The necessary condition to be checked before deletion from the Queue is
underflow
overflow
frontflow
Rearflow
Correct!
Wrong!
4. Which data structure is the best for implementing a priority queue?
stack
heap
array
linked list
Correct!
Wrong!
5. Which of the following principle is used if two elements in the priority queue have the same priority?
LIFO
FIFO
linked list
None of these
Correct!
Wrong!
6. Which of the following statement is not true regarding the priority queue?
Processes with different priority can be easily handled
Easy to implement
Deletion is easier
None of these
Correct!
Wrong!
7. A linear data structure in which insertion and deletion operations can be performed from both the ends is
Queue
deque
Priority queue
Circular queue
Correct!
Wrong!
8. In the Deque implementation using singly linked list, what would be the time complexity of deleting an element from the rear end?
O(1)
O(n)
O(n2)
O(nlogn)
Correct!
Wrong!
9. Which of the following data structure allows you to insert the elements from both the ends while deletion from only one end?
Input-restricted queue
output-restricted queue
Priority queue
None of these
Correct!
Wrong!
10. In a circular queue implementation using array of size 5, the array index starts with 0 where front and rear values are 3 and 4 respectively. Determine the array index at which the insertion of the next element will take place.
0
1
2
5
Correct!
Wrong!
Share the quiz to show your results !
Subscribe to see your results
Ignore & go to results
Data-Structures-Quiz-4
You got %%score%% of %%total%% right
%%description%%
%%description%%
Loading...