In queue using linked-list, during an insertion in to the queue?a) Only rear end changesb) only front end changesc) both changesd) no change for both

Questions by suji   answers by suji

Showing Answers 1 - 6 of 6 Answers

vabzplanet

  • Nov 18th, 2005
 

answer is b.

Queue:ABCD<-

  Was this answer useful?  Yes

Sarada

  • Feb 25th, 2006
 

  • Queue Execution is First in First Out (FIFO).
  • In a Queue insertion will be done at rear end and deletion will be done at front end.
  • So, during insertion into the queue changes are made only at the rear end.

Answer is A

  Was this answer useful?  Yes

deepak narang

  • Apr 4th, 2006
 

hello frnds,Ans----> awhen u insert in linked list onlt rear end changes bcoz its works on the funda of FIFO (First in First out)

  Was this answer useful?  Yes

AMISH

  • May 25th, 2006
 

ANS : 'd' due to insertion in a linklist we may insert after the rear node or bfore the front node that's why there is no change in the rear or front so alsowe see int the linklist the first node(rear) is fixed. and the last node set to be null.

  Was this answer useful?  Yes

raka_00786

  • Jun 4th, 2008
 

The answer is "a" because Queue follow FIFO Data Structure.

       Front---------A  B  C  D  E-----REAR
 
        insertion will take place from REAR end..so result will be REAR.                     

  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