Excellent		0 Reviews
Good		0 Reviews
medium		0 Reviews
Acceptable		0 Reviews
Not Good		0 Reviews

تحميل Data Structures DS

Programming 2022-03-26

روابط التحميل

لمشاهدة الكورس مباشر بدون تحميل اضغط هنا

عدد الدروس 67

قسم Programming

Data Structures | Introduction | Lec 1 | Bhanu Priya

Programming Methodologies | Introduction | Data Structures | Lec 2 | Bhanu Priya

Programming Methodologies | Part 1 2 | Data Structures | Lec 3 | Bhanu Priya

Programming Methodologies | Part 2 2 | Data Structures | Lec 4 | Bhanu Priya

Abstract Data Type | Data Structures | Lec 5 | Bhanu Priya

Arrays | Declare Create Initialisation | 1 D 2 D | Data Structures| Lec 6 | Bhanu Priya

Array representation | Row Major order Column Major order | Data Structures| Lec 7 | Bhanu Priya

1 D Array representation | Row Major Column Major order | Data Structures | Lec 8 | Bhanu Priya

2 D Array representation | Row Major Column Major order | Data Structures | Lec 9 | Bhanu Priya

Stack | PUSH POP | Data Structures | Lec 10 | Bhanu Priya

Stack Abstract Data Type | Insertion Deletion | Data Structures | Lec 11 | Bhanu Priya

Queues | FIFO Applications | Data Structures | Lec 12 | Bhanu Priya

Queue as ADT | Enqueue Dequeue | Data Structures | Lec 13 | Bhanu Priya

Infix Prefix and Postfix | Notations | Data Structures | Lec 14 | Bhanu Priya

Infix to Postfix conversions example | Data Structures | Lec 15 | Bhanu Priya

Infix to Prefix conversion | Examples | Data Structures | Lec 16 | Bhanu Priya

Postfix to Infix Conversion | Examples | Data Structures | Lec 17 | Bhanu Priya

Prefix to Infix Conversion | Examples | Data Structures | Lec 18 | Bhanu Priya

Evaluation of Postfix Expression | Algorithm | Data Structures | Lec 19 | Bhanu Priya

Evaluation of Postfix Expression | Examples | Data Structures | Lec 20 | Bhanu Priya

Evaluation of Prefix expression | Examples | Data Structures | Lec 21 | Bhanu Priya

Linked list | Introduction | Data Structures | Lec 22 | Bhanu Priya

Linked list | Single Double Circular | Data Structures | Lec 23 | Bhanu Priya

Sparse Matrix | Array representation | Data Structures | Lec 24 | Bhanu Priya

Sparse Matrix | Linked list representation | Data Structures | Lec 25 | Bhanu Priya

What is Tree | Data Structures | Lec 26 | Bhanu Priya

Binary tree | Recursive Properties | Data Structures | Lec 27 | Bhanu Priya

Recursive and Implementation of trees | Data Structures | Lec 28 | Bhanu Priya

Binary tree traversal | Preorder Inorder Postorder | Data Structures | Lec 29 | Bhanu Priya

Binary Tree Traversal | Preorder | Data Structures | Lec 30 | Bhanu Priya

Binary Tree Traversal | Inorder | Data Structures | Lec 31 | Bhanu Priya

Binary Tree Traversal | Postorder | Data Structures | Lec 32 | Bhanu Priya

Binary Search Tree BST | Part 1 2 | Data Structures | Lec 33 | Bhanu Priya

Binary Search Tree BST | Part 2 2 | Data Structures | Lec 34 | Bhanu Priya

expression tree | Data Structures | Lec 35 | Bhanu Priya

Binary Search Tree Traversal | In Pre Post Order | Data Structures | Lec 36 | Bhanu Priya

Searching in Binary Search Tree | Algo Example | Data Structures | Lec 37 | Bhanu Priya

Insertion in Binary Search Tree | Algo Example | Data Structures | Lec 38 | Bhanu Priya

Deletion in Binary Search Tree | Algo Example | Data Structures | Lec 39 | Bhanu Priya

Avl tree | Introduction | Data Structures | Lec 40 | Bhanu Priya

avl tree rotation examples | Left Left rotation | Data Structures | Lec 41 | Bhanu Priya

avl tree rotation examples | Left Right rotation | Data Structures | Lec 42 | Bhanu Priya

avl tree rotation examples | RR RL rotation | Data Structures | Lec 43 | Bhanu Priya

AVL tree insertion example | Data Structures | Lec 44 | Bhanu Priya

Heap tree | Min Max heap | Data Structures | Lec 45 | Bhanu Priya

Graph terminology | Data Structures | Lec 46 | Bhanu Priya

Adjacency Matrices | Example | Graph representation | Data Structures | Lec 47 | Bhanu Priya

Incidence matrix | Example | Graph representation | Data Structures | Lec 48 | Bhanu Priya

Adjacency list | Example | Graph representation | Data Structures | Lec 49 | Bhanu Priya

Depth First Search | Also Example | Graph traversal | Data Structures | Lec 50 | Bhanu Priya

Breadth First Search | Also Example | Graph traversal | Data Structures | Lec 51 | Bhanu Priya

Sorting | Methods | Data Structures | Lec 52 | Bhanu Priya

Selection Sort example | Straight | Data Structures | Lec 53 | Bhanu Priya

Selection sort algorithm | Straight | Data Structures | Lec 54 | Bhanu Priya

Heap sort example | Data Structures | Lec 55 | Bhanu Priya

Heap sorting algorithm | Data Structures | Lec 56 | Bhanu Priya

Insertion sort example | Straight | Data Structures | Lec 57 | Bhanu Priya

Shell sort example | Insertion | Data Structures | Lec 58 | Bhanu Priya

Bubble sort Example | Exchange Sort | Data Structures | Lec 59 | Bhanu Priya

Quicksort algorithm | Divide Conquer | Exchange Sort | Data Structures | Lec 60 | Bhanu Priya

Quick sort example | Divide Conquer | Data Structures | Lec 61 | Bhanu Priya

What is Hashing | Data Structures | Lec 62 | Bhanu Priya

Hashing methods | Introduction | Part 1 4 | Data Structures | Lec 63 | Bhanu Priya

Hashing methods | Direct Modulo Division | Part 2 4 | Data Structures | Lec 64 | Bhanu Priya

Hashing methods | Digit extraction Mid square | Part 3 4 | Data Structures | Lec 65 | Bhanu Priya

Hashing methods | Folding Rotation Random | Part 4 4 | Data Structures | Lec 66 | Bhanu Priya

Collision Resolution | Linear Quadratic probing | Data Structures | Lec 67 | Bhanu Priya

Programming
2022-03-26