Data Structure Questions and Answers-Queue using Linked List

 

 Buy/Download all MCQ Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Queue using Linked List

Click on any option to know the CORRECT ANSWERS

Question 1
In linked list implementation of queue, if only front pointer is maintained, which of the following operation take worst case linear time?
A
Insertion
B
Deletion
C
To empty a queue
D
Both Insertion and To empty a queue
UPSC GS Questions answers

Question 1 Explanation: 
Since front pointer is used for deletion, so worst time for the other two cases.

Question 2
In linked list implementation of a queue, where does a new element be inserted?
A
At the head of link list
B
At the centre position in the link list
C
At the tail of the link list
D
None of the mentioned
HRM Questions answers

Question 2 Explanation: 
Since queue follows FIFO so new element inserted at last.

Question 3
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into a NONEMPTY queue?
A
Only front pointer
B
Only rear pointer
C
Both front and rear pointer
D
None of the mentioned
Library science Questions answers

Question 3 Explanation: 
Since queue follows FIFO so new element inserted at last.

Question 4
In linked list implementation of a queue, front and rear pointers are tracked. Which of these pointers will change during an insertion into EMPTY queue?
A
Only front pointer
B
Only rear pointer
C
Both front and rear pointer
D
None of the mentioned
Microbiology Questions answers

Question 4 Explanation: 
Since its the starting of queue, so both values are changed.

Question 5
In case of insertion into a linked queue, a node borrowed from the ..... list is inserted in the queue.
A
AVAIL
B
FRONT
C
REAR
D
None of the mentioned
Journalism Questions answers

Question 5 Explanation: 
All the nodes are collected in AVAIL list.

There are 5 questions to complete.

 

 Buy/Download all MCQ Ebook >>>CLICK HERE<<<