Да се създаде демонстративна програма за моделиране на дек

}

}

{

int i = 1;

while(i>0 && i<6)

{

cout<<" ***************************************"<

cout<<" * 1 , to ADD element at the beggining *"<

cout<<" * 2 , to ADD element at the end *"<

cout<<" * 3 , to DELETE first element *"<

cout<<" * 4 , to DELETE last element *"<

cout<<" * 5 , to PRINT the queue *"<

cout<<" * other number , to finish *"<

cout<<" ***************************************"<

cout<<" type number : ";

cin>>i;

cout<

switch (i)

{

case 1 :

cout<<" type number to ADD : ";

cin>>num;

add_first(num);

break;

}

case 2 :

cout<<" type number to ADD : ";

cin>>num;

add_last(num);

break;

}

case 3 :

del_first();

break;

}

case 4 :

del_last();

break;

}

case 5 :

print_queue();

break;

}

default : break;

cout<

}

• 
  Алгоритмично реализиране на програмата чрез свързан списък
  

Source Code: Linked list

#include
struct list

{

int x;

};
list *tque = NULL;

list *bque = NULL;
void add_last(int i) // Вкарване на елемент в края

{

list *tmp = new list;

tmp->next = NULL;

if(tque == NULL)

{

bque = tque = tmp;

else

bque->next = tmp;

bque = tmp;

}

cout<<" element added... "<

}
void add_first(int i) // Вкарване на елемент в началото

{

list *tmp = new list();

tmp->next=tque;

tque=tmp;

if(bque == NULL)

{

bque=tque;

cout<<" element added... "<

}
void print_queue() // Отпечатване на списък

{

if(tque == NULL)

cout<<" Empty deque "<

}

else

list *tmp = tque;

while(tmp != NULL)

{

cout<x<<" , ";

}

}

{

if(bque == NULL || tque == NULL)

cout<<" Empty deque "<

}

else if(bque == tque)

list *tmp=tque;

tque = bque = NULL;

delete tmp;

}

else

list *tmp=tque;

while(( tmp != NULL ) && (tmp->next != NULL) && (tmp->next->next != NULL))

{

tmp = tmp->next;

delete tmp->next;

tmp->next = NULL;

bque = tmp;

cout<<" element deleted... "<

}

}

{

if(tque == NULL)

cout<<" Empty deque "<

}

else if(bque == tque)

list *tmp=tque;

tque = bque = NULL;

delete tmp;

}

else

list *tmp=tque;

tque=tque->next;

delete tmp;

cout<<" element deleted... "<

}

}

{

int i = 1;

while(i>0 && i<6)

{

cout<<" ***************************************"<

cout<<" * 1 , to ADD element at the beggining *"<

cout<<" * 2 , to ADD element at the end *"<

cout<<" * 3 , to DELETE first element *"<

cout<<" * 4 , to DELETE last element *"<

cout<<" * 5 , to PRINT the queue *"<

cout<<" * other number , to finish *"<

cout<<" ****************************************"<

cout<<" type number : ";

cin>>i;

cout<

switch (i)

{

case 1 :

cout<<" type number to ADD : ";

cin>>num;

add_first(num);

break;

}

case 2 :

cout<<" type number to ADD : ";

cin>>num;

add_last(num);

break;

}

case 3 :

del_first();

break;

}

case 4 :

del_last();

break;

}

case 5 :

print_queue();

break;

}

default : break;

cout<

}

}

5. 
   Таблица на съответствията
   

5. 
   Резултати от изпълнението на програмата
   

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number :
Добавяне на елемент в началото на дека
***************************************

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number : 1
type number to ADD: 1

element added…

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number : 2
type number to ADD: 2

element added…

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number : 5
1 , 2 ,

Изтриване на първи елемент на дека
***************************************

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number : 3
element deleted…
Изтриване на последен елемент на дека
***************************************

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number : 4
element deleted…
Контролна проверка за наличието на елементи в дека ( Отпечатване на дека )
***************************************

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

type number : 5
Empty Deque

Край на програмата
***************************************

* 1 , to ADD element at the beggining *

* 2 , to ADD element at the end *

* 3 , to DELETE first element *

* 4 , to DELETE last element *

* 5 , to PRINT the deque *

* other number , to finish *

***************************************

5. 
   Изводи:
   

• 
  Програмата има два общи начина за ефективно прилагане на ДЕК: с използването на модифициран динамичен масив или с двойно-свързан списък. С динамичен масив изпълнението използва даден вариант на динамичен масив, който може да нарасне от двата края. Има възможност за премахване на елементи от двата края вместо само от единия , както е при опашката.
  

5. 
   Използвана литература:
   

• 
  http://en.wikipedia.org
  
• 
  http://www.cplusplus.com