Conceptually, a linked list queue is the same as a queue built using an array.

Skill/Topic: Queues Using Linked Lists
A) True
B) False
Explanation: Conceptually, a linked list queue is the same as a queue built using an array. Both store data. Both place data at the front of the queue and remove data from the front of the queue
  • Interview Candidate
  • 6
  • 2007

Showing Answers 1 - 6 of 6 Answers

Sandhya.Kishan

  • May 15th, 2012
 

A queue built using array is same as a linked list queue because both insert the data in the front and delete the data from front of the queue,i.e,both follow fifo data structure.

  Was this answer useful?  Yes

ptmich

  • May 28th, 2012
 

A FIFO (first in, first out) structure means data is added to the back of the queue and removed from the front of the queue. A first in first out structure is equivalent to last in last out structure, which means the last data node added will be the last node removed.

data in a fifo structure is not added to the front of the queue but to the back of the queue.

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions