This Quiz contains totally 10 Questions each carry 1 point for you.
1. If the elements '1', '2', '3' and '4' are inserted in a queue, what would be order for the removal?
1234
4321
3241
None of the above
Correct!
Wrong!
2. A list of elements in which enqueue operation takes place from one end, and dequeue operation takes place from one end is
Binary tree
Linked list
Queue
stack
Correct!
Wrong!
3. Which of the following principle does Queue use?
LIFO principle
FIFO principle
Linear tree
Ordered array
Correct!
Wrong!
4. Which of the following is not the type of the Queue?
Linear Queue
Circular Queue
Single ended Queue
Double ended Queue
Correct!
Wrong!
5. Which of the following is the overflow condition if linear queue is implemented using an array with a size MAX_SIZE?
rear = front
rear = front+1
rear=MAX_SIZE -1
rear=MAX_SIZE
Correct!
Wrong!
6. Which of the following is the overflow condition if circular queue is implemented using an array with a size MAX_SIZE?
rear = MAX
rear = MAX-1
front=(rear+1) mod max
rear=MAX_SIZE
Correct!
Wrong!
7. The time complexity of enqueue operation in Queue is
O(1)
O(n)
O(logn)
O(nlogn)
Correct!
Wrong!
8. Which of the following determines the need for the Circular Queue?
Avoid wastage of memory
Access the Queue using priority
Follows the FIFO principle
None of the above
Correct!
Wrong!
9. Which of the following is the correct way to increment the rear end in a circular queue?
rear =rear+1
(rear+1) % max
(rear % max) + 1
None of the above
Correct!
Wrong!
10. In the linked list implementation of queue, where will the new element be inserted?
At the middle position of the linked list
At the head position of the linked list
At the tail position of the linked list
None of the above
Correct!
Wrong!
Share the quiz to show your results !
Subscribe to see your results
Ignore & go to results
Data-Structures-Quiz-3
You got %%score%% of %%total%% right
%%description%%
%%description%%
Loading...