Data Structures and Algorithms (DSA)

Ma'lumot tuzilmalari va algoritmlar (DSA) bo'yicha bosqichma-bosqich amaliy qo'llanma, tushuntirishlar va ko'rgazmali misollar.

0 / 69 mavzu tugatilgan

Kursni boshlash

01DSA Introduction

Ma'lumot tuzilmalari va algoritmlar (DSA) asoslari, algoritmlar samaradorligi, asimptotik baholash (Big O) va asosiy tushunchalar.

0 / 7
01
Getting Started with DSADSA bilan boshlash
02
What is an Algorithm?Algoritm nima?
03
Data Structure and TypesMa'lumotlar tuzilmasi va turlari
04
Why Learn Data Structures and Algorithms?Nega ma'lumotlar tuzilmalari va algoritmlarni o'rganish kerak?
05
Asymptotic NotationsAsimptotik belgilar
06
Master TheoremMaster teoremasi
07
Divide and Conquer AlgorithmBo'lib tashla va hukmronlik qil algoritmi

02Data Structures (I)

Stack (stek), Queue (navbat), Circular Queue, Priority Queue va Deque kabi asosiy chiziqli ma'lumot tuzilmalari.

0 / 6
08
StackStek ma'lumotlar tuzilmasi
09
QueueNavbat ma'lumotlar tuzilmasi
10
Types of QueueNavbat turlari
11
Circular QueueDoiraviy navbat
12
Priority QueuePrioritetli navbat
13
DequeDeque ma'lumotlar tuzilmasi

03Data Structures (II)

Bog'langan ro'yxatlar (Linked List), Hash Table (xesh-jadval) va Heap tuzilmalari bilan ishlash.

0 / 7
14
Linked ListBog'langan ro'yxat ma'lumotlar tuzilmasi
15
Linked List OperationsBog'langan ro'yxat amallari
16
Types of Linked ListBog'langan ro'yxat turlari
17
Hash TableXesh-jadval ma'lumotlar tuzilmasi
18
Heap Data StructureTo'p ma'lumotlar tuzilmasi
19
Fibonacci HeapFibonachchi to'pi ma'lumotlar tuzilmasi
20
Decrease Key and Delete Node on Fibonacci HeapFibonachchi to'pida kalitni kamaytirish va tugunni o'chirish amallari

04Tree based DSA (I)

Tree, Tree Traversal, Binary Tree, Full/Perfect/Complete/Balanced daraxtlar, Binary Search Tree (BST) va AVL Tree.

0 / 9
21
Tree Data StructureDaraxt ma'lumotlar tuzilmasi
22
Tree TraversalDaraxtni aylanib chiqish — Inorder, Preorder va Postorder
23
Binary TreeIkkilik daraxt ma'lumotlar tuzilmasi
24
Full Binary TreeTo'liq ikkilik daraxt
25
Perfect Binary TreeMukammal ikkilik daraxt
26
Complete Binary TreeTo'ldirilgan ikkilik daraxt
27
Balanced Binary TreeBalanslangan ikkilik daraxt
28
Binary Search TreeIkkilik qidiruv daraxti
29
AVL TreeAVL daraxti

05Tree based DSA (II)

B-Tree, B+ Tree va Red-Black Tree daraxtlari hamda ularda qidiruv, kiritish va o'chirish amallari.

0 / 9
30
B-TreeB-daraxt ma'lumotlar tuzilmasi
31
Insertion into a B-treeB-daraxtga element qo'shish
32
Deletion from a B-treeB-daraxtdan elementni o'chirish
33
B+ TreeB+ daraxt ma'lumotlar tuzilmasi
34
Insertion on a B+ TreeB+ daraxtga element qo'shish
35
Deletion from a B+ TreeB+ daraxtdan elementni o'chirish
36
Red-Black TreeQizil-qora daraxt ma'lumotlar tuzilmasi
37
Insertion in a Red-Black TreeQizil-qora daraxtga element qo'shish
38
Deletion from a Red-Black TreeQizil-qora daraxtdan elementni o'chirish

06Graph based DSA

Graf tuzilmalari, Adjacency Matrix/List, BFS va DFS qidiruv algoritmlari, Bellman-Ford va eng qisqa yo'lni topish algoritmlari.

0 / 8
39
Graph Data StructureGraf ma'lumotlar tuzilmasi
40
Spanning Tree and Minimum Spanning TreeQoplovchi daraxt va Minimal qoplovchi daraxt
41
Strongly Connected ComponentsKuchli bog'langan komponentlar
42
Adjacency MatrixQo'shnilik matritsasi
43
Adjacency ListQo'shnilik ro'yxati
44
Depth First Search (DFS)Chuqurlik bo'yicha qidiruv
45
Breadth First Search (BFS)Kenglik bo'yicha qidiruv
46
Bellman Ford's AlgorithmBellman-Ford algoritmi

07Sorting and Searching Algorithms

Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, hamda Linear va Binary Search algoritmlari.

0 / 12
47
Bubble SortPufaksimon saralash
48
Selection SortTanlash orqali saralash
49
Insertion SortQo'shish orqali saralash
50
Merge Sort AlgorithmBirlashtirib saralash algoritmi
51
Quicksort AlgorithmTezkor saralash algoritmi
52
Counting Sort AlgorithmSanash orqali saralash
53
Radix Sort AlgorithmRazryadli saralash
54
Bucket Sort AlgorithmSavatli saralash
55
Heap Sort AlgorithmUyjumli saralash algoritmi
56
Shell Sort AlgorithmShell saralash algoritmi
57
Linear SearchChiziqli qidiruv
58
Binary SearchIkkilik qidiruv

08Greedy Algorithms

Greedy (ochko'z) algoritmlar, Dijkstra, Kruskal, Prim va boshqa optimal yechim algoritmlari.

0 / 6
59
Greedy AlgorithmGreedy algoritm nima?
60
Ford-Fulkerson AlgorithmFord-Fulkerson algoritmi
61
Dijkstra's AlgorithmDijkstra algoritmi nima?
62
Kruskal's AlgorithmKruskal algoritmi nima?
63
Prim's AlgorithmPrim algoritmi nima?
64
Huffman CodingHuffman kodlash nima?

09Dynamic Programming

Dinamik dasturlash (Dynamic Programming) tamoyillari, memoizatsiya va optimal qism-tuzilmalar.

0 / 3
65
Dynamic ProgrammingDinamik dasturlash nima?
66
Floyd-Warshall AlgorithmFloyd-Warshall algoritmi nima?
67
Longest Common SubsequenceEng uzun umumiy qism-ketma-ketlik nima?

10Other Algorithms

Backtracking (orqaga qaytish) algoritmi, Rabin-Karp va boshqa ilg'or algoritmlar.

0 / 2
68
Backtracking AlgorithmBacktracking algoritmi nima?
69
Rabin-Karp AlgorithmRabin-Karp algoritmi nima?