Autoplay
Autocomplete
Previous Lesson
Complete and Continue
Data Structures and Algorithms (210243)
Unit I Introduction to Algorithm and Data Structures
Session 1 : Algorithms- Problem Solving
Session 2 : Introduction to Algorithms
Session 3 : Characteristics of algorithms
Session 4 : Algorithm design tools: Pseudo code and flowchart
Session 5 : Analysis of Algorithms
Session 7 : Time complexity
Session 8 : Asymptotic notation- Big-O
Session 9 : Theta and Omega
Session 10 : standard measures of efficiency
Session 11 : Data Structures- Data structure
Session 12 : Abstract Data Types (ADT)
Session 13 : Concept of linear and Non-linear
Session 14 : static and dynamic
Session 15 : persistent and ephemeral data structures
Session 16 : relationship among data
Session 17 : data structure
Session 18 : algorithm
Session 19 : From Problem to Program.
Session 20 : Algorithmic Strategies- Introduction to algorithm design strategies- Divide and Conquer, and Greedy strategy.
Session 21 : Recurrence relation - Recurrence Relation
Session 22 : Linear Recurrence Relations
Session 23 : With constant Coefficients
Session 24 : Homogeneous Solutions. Solving recurrence relations
Unit II Linear Data Structures Using Sequential Organization
Session 25 : Sequential Organization
Session 26 : Linear Data Structure Using Sequential Organization
Session 27 : Array as an Abstract Data Type
Session 28 : Memory Representation and Address Calculation
Session 29 : Inserting an element into an array
Session 30 : Deleting an element
Session 31 : Multidimensional Arrays
Session 32 : Two-dimensional arrays
Session 33 : n- dimensional arrays
Session 34 : Concept of Ordered List
Session 35 : Single Variable Polynomial
Session 36 : Representation using arrays
Session 37 : Polynomial as array of structure
Session 38 : Polynomial addition
Session 39 : Polynomial multiplication
Session 40 : Sparse Matrix
Session 41 : Sparse matrix representation
Session 42 : Sparse matrix addition
Session 43 : Transpose of sparse matrix
Session 44 : String Manipulation Using Array
Session 45 : Case Study- Use of sparse matrix in Social Networks and Maps
Unit III Linked Lists
Session 46 : Concept
Session 47 : Comparison of sequential and linked organizations
Session 48 : Primitive operations
Session 49 : Realization of Linked Lists
Session 50 : Realization of linked list using arrays
Session 51 : Dynamic Memory Management
Session 52 : Linked list using dynamic memory management
Session 53 : Linked List Abstract Data Type
Session 54 : Linked list operations
Session 55 : Head pointer and header node
Session 56 : Types of linked list- Linear and circular linked lists
Session 57 : Doubly Linked List and operations
Session 58 : Circular Linked List
Session 59 : Singly circular linked list
Session 60 : Doubly circular linked list
Session 61 : Polynomial Manipulations - Polynomial addition
Session 62 : Multiplication of two polynomials using linked list
Session 63 : Generalized Linked List (GLL) concept
Session 64 : representation of polynomial and sets using GLL
Session 65 : Case Study- Garbage Collection
Unit IV Stacks
Session 66 : Stacks- concept
Session 67 : Primitive operations
Session 68 : Stack Abstract Data Type
Session 69 : Representation of Stacks Using Sequential Organization
Session 70 : stack operations
Session 71 : Multiple Stacks
Session 72 : Applications of Stack- Expression Evaluation and Conversion
Session 73 : Polish notation and expression conversion
Session 74 : Need for prefix and postfix expressions
Session 75 : Postfix expression evaluation
Session 76 : Linked Stack and Operations
Session 77 : Recursion- concept
Session 78 : variants of recursion- direct
Session 79 : indirect
Session 80 : tail and tree
Session 81 : Backtracking algorithmic strategy
Session 82 : use of stack in backtracking
Session 83 : Case Study- 4 Queens problem
Session 84 : Android- multiple tasks/multiple activities and back stack
Unit V Queues
Session 85 : Concept
Session 86 : Queue as Abstract Data Type
Session 87 : Realization of Queues Using Arrays
Session 88 : Circular Queue
Session 89 : Advantages of using circular queues
Session 90 : Multi-queues
Session 91 : Deque
Session 92 : Priority Queue
Session 93 : Array implementation of priority queue
Session 94 : Linked Queue and operations
Session 95 : Case study- Priority queue in bandwidth management.
Unit VI Sorting and Searching
Session 96 : Searching- Search Techniques
Session 97 : Sequential search
Session 98 : Sequential search
Session 99 : variant of sequential search- sentinel search
Session 100 : Binary search
Session 101 : Fibonacci search
Session 102 : Case Study- Use of Fibonacci search in non-uniform access memory storage and in Optimization of Unimodal Functions
Session 103 : Sorting- Types of sorting-Internal and external sorting
Session 104 : General sort concepts-sort order
Session 105 : stability
Session 106 : efficiency
Session 107 : number of passes
Session 108 : Sorting methods- Bubble sort
Session 109 : Insertion sort
Session 110 : Selection sort
Session 111 : Quick sort
Session 112 : Heap sort
Session 113 : Shell sort
Session 114 : Bucket sort
Session 115 : Radix sort
Session 116 : Comparison of All Sorting Methods
Session 117 : Case Study- Timsort as a hybrid stable sorting algorithm.
Current Ongoing Sessions
Session 1 : Introduction and Problem solving (87:26)
Session 2 : What is an Algorithm (37:38)
Session 3 : Characteristics of Algorithm (63:38)
Session 4 : Algorithm Tools (51:00)
Session 5 : Analysis of Algorithms (39:05)
Session 6 : Complexity Of Algorithms (47:32)
Session 7 : Space Complexity (27:30)
Session 8 : Asymptic Notation (42:06)
Session 9 : Big Omega And Theta Notations (25:54)
Session 10 : Data Structures and Types (41:17)
Session 11 : Algorithm Strategy (33:15)
Session 12 : Recurrence relation (31:38)
Session 13 : Homogeneous Relation (29:12)
Session 14 : Linear Data Structures (61:05)
Session 15 : 1 DimentionalArray (58:01)
Session 16 : 2 Dimentional Array (70:05)
Session 17 : MultiDimentionalArray (41:59)
Session 18 : Sparse Matrix (37:55)
Session 19 : Sparse Matrix Addition and Transpose (59:15)
Session 20 : String Manipulation (58:46)
Session 21 : Ordered List and Polynomials (81:30)
Session 22 : Case Study Sparce Matrix (38:30)
Session 23 : Linked Lists (46:01)
Session 24 : Array Representation Of Linked List (66:11)
Session 25 : Dynamic Representation Of Linked List (41:11)
Session 26 : Linked List Operations (51:33)
Session 27 : Linked List as an ADT (21:04)
Session 28 : Circular Linked List (45:46)
Session 29 : Header node and Doubly linked list (47:29)
Session30 : Polynomials using LinkedList (30:41)
Session 31 : Generalized Linked List (37:10)
Session 32 : Stack Concept and Primitive Operations (33:34)
Session 33 : Stack using array (29:02)
Session 34 : 2020-09-Stack as an ADT and stack using linked list (30:31)
Session 35 : multiple stacks (35:02)
Session 36 : Application of stack - Notations and conversion (48:03)
Session 37 : Application of stack - Infix to postfix using stack (50:42)
Session 38 : Recursion (37:11)
Session 39 : Backtracking (31:19)
Session 40 : 4 queens problem (38:09)
Session 41 : queue introduction (27:25)
Session 42 : queue as array and linked list (76:42)
Session 43 : Variations of queue (40:41)
Session 44 : Priority queue using array and case study (50:48)
Session 45 : Searching (37:39)
Session 46 : binary search and fibonnaci search (18:48)
Session 47 : Sorting Introduction (28:48)
Session 48 : Bubble sort (29:54)
Session 49 : Insertion and Selection Sort (41:24)
Session 50 : Quick Sort and Merge Sort (70:46)
Session 51 : Shell Sort (43:37)
Session 52 : Radix and Bucket Sort (29:12)
Session 46 : binary search and fibonnaci search
Lesson content locked
If you're already enrolled,
you'll need to login
.
Enroll in Course to Unlock