Ma’lumotlar tuzilmasi va algoritmlar

#include
Deque dek1;


Dek ustida bajariladigan amallar:

• 
  boshidan element kiritish. Push_front()
  
• 
  Oxiridan element kiritish. Push_back()
  
• 
  boshidan element chiqarish. pop_front()
  
• 
  oxiridan element chiqarish. Pop_back()
  
• 
  Empty() – bo’shlikka tekshirish.
  

Dekka oid misol keltiramiz:

#include
#include
int main (){
std::deque mydeque (2,100); // two ints with a value of 100
mydeque.push_front (200);
mydeque.push_front (300);
std::cout << "mydeque contains:";
for (std::deque::iterator it = mydeque.begin(); it != mydeque.end(); ++it)
std::cout << ' ' << *it;
std::cout << '\n';
return 0;
}
Natija:
300 200 100 100


Nazorat savollar.

1. 
   Yarimstatik ma’lumotlar tuzilmasi nima va unga nimalar kiradi?
   
2. 
   Stek va uning xususiyatlari?
   
3. 
   Steklarni dasturda e’lon qilinishi?
   
4. 
   Navbat nima va dasturda qanday ifodalanadi?
   
5. 
   Dek nima va stek , navbatdaqn farqi nima? Dasturda ifodalanishi qanday?
   
6. 
   Bu tuzilmalar statik va dinamik tuzilmalardan nimasi bilan farq qiladi?
   

Adabiyotlar

1. 
   AdamDrozdek. Data structure and algorithms in C++. Fourthedition. 2013. Chapter 4.
   
2. 
   Data structure and algorithms. Made easy guide. Fast track student edition. 2014. Chapter 5,6.
   

https://play.google.com/books/reader?id=jnnCAwAAQBAJ&printsec=frontcover&output=reader&hl=ru&pg=GBS.PA8


8-mavzu


Steklar va navbatlar. Ularni mantiqiy tasvirlash va ustida amal bajarish algoritmlari. Stek va navbatni bog‘langan ro‘yxat ko‘rinishida tasvirlash


REJA

1.