Double ended queues (deque)

                  It is also a homogeneous list of elements in which insertion and deletion operations are performed from both the ends. That is we can insert elements from the rear end or from the front ends. Hence it is called double- ended queue. It is commanly referred to as deque.

                  There are two types of deques. These two types are due to the restrictions put to perfrom either the insertions or deletions only at one end. They are

1.      Input restricted deques.

2.      Output restricted deques.

Figure shows a depue of 5 elements.

                          Dq[0]       Dq[1]            Dq[2]                       Dq[3]                     Dq[4]

Since both insertion and deletion are performed from either end it is necessary design algorithm to perform the following four operations.

1.      Insertion of an element at the REAR end of the queue.

2.      Deletion of an element from the FRONT end of the queue.

3.      Insertion of an element at the FRONT end of the queue.

4.      Deletion of an element from the REAR end of the queue.

Data Structure & Algorithms Assignment Help, Live Experts 

Struggling with data structure problems? Data structure subject is quite tough to learn? Need quick assistance in data structure questions? ExpertsMind.com is right place for you where your search ends, We at ExpertsMind offer online data structure assignment help, data structure homework help and data structure and algorithms question's answers by best online support by qualified tutors.