GeekInterview.com
Series: Subject: Topic:
Question: 44 of 246

Deletions at Both the Ends

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
a. Input-restricted deque
b. Output-restricted deque
c. Priority queues
d. None of above
Asked by: senthilkumar3355 | Member Since Feb-2010 | Asked on: Feb 19th, 2010

View all questions by senthilkumar3355

Showing Answers 1 - 4 of 4 Answers
Piyush Verma

Answered On : Mar 26th, 2010

View all answers by Piyush Verma

a) Input-Restricted dequeue

  
Login to rate this answer.
sonia_mehta

Answered On : Jul 6th, 2010

View all answers by sonia_mehta

Normally, in a queue we insert and delete from one side only but in double ended queue, we can do from both sides. Priority queue is a different concept, in which deletion and insertion are according to priority so, answer is input restricted queue, as input is restricted to 1 side.

Yes  1 User has rated as useful.
  
Login to rate this answer.
Rajan Patekar

Answered On : Aug 12th, 2011

View all answers by Rajan Patekar

a.input-restricted queue.

  
Login to rate this answer.
Shilpa chavare

Answered On : Sep 12th, 2011

your qtn itself has the answer.. wen insertion is restricted to one end, then it obviously has to be input restricted dequeue..:)

  
Login to rate this answer.

Give your answer:

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

Related Open Questions

Ads

Connect

twitter fb Linkedin GPlus RSS

Ads

Interview Question

 Ask Interview Question?

 

Latest Questions

Interview & Career Tips

Get invaluable Interview and Career Tips delivered directly to your inbox. Get your news alert set up today, Once you confirm your Email subscription, you will be able to download Job Inteview Questions Ebook . Please contact me if you there is any issue with the download.