What you’ll learn
- Have a good grasp of algorithmic thinking
-
Be able to develop your own algorithms
-
Be able to detect and correct inefficient code snippets
Course Curriculum
001 Introduction | |||
001 Introduction | 00:00:00 | ||
01 Introduction to Data Structures and Algorithms | |||
002 Data Structures and Algorithms | 00:00:00 | ||
003 Measuring Running time of Algorithms | 00:00:00 | ||
004 Asymptotic Analysis | 00:00:00 | ||
005 Big O Notation | 00:00:00 | ||
006 Finding Big O | 00:00:00 | ||
007 Tight and Loose Upper Bounds | 00:00:00 | ||
008 Big O analysis of Algorithms | 00:00:00 | ||
009 Finding Time Complexity | 00:00:00 | ||
010 Big O analysis of Algorithms Examples | 00:00:00 | ||
011 Worst case Best case and Average Case Analysis | 00:00:00 | ||
012 Common Complexities | 00:00:00 | ||
013 Abstract Data Types | 00:00:00 | ||
02 Linked List | |||
014 Introduction | 00:00:00 | ||
015 Traversing and Searching a Single Linked List | 00:00:00 | ||
016 Finding references in a single linked list | 00:00:00 | ||
017 Insertion in a Single Linked List | 00:00:00 | ||
018 Insertion in a Single Linked List ..contd | 00:00:00 | ||
019 Deletion in a Single Linked List | 00:00:00 | ||
020 Reversing a Single Linked List | 00:00:00 | ||
021 Sorting a Linked list using Bubble Sort | 00:00:00 | ||
022 Merging of sorted Linked lists | 00:00:00 | ||
023 Sorting a Linked list using Merge Sort | 00:00:00 | ||
024 Finding and Removing a cycle in a Linked list | 00:00:00 | ||
025 Doubly linked list | 00:00:00 | ||
026 Insertion in a doubly linked List | 00:00:00 | ||
027 Deletion from doubly linked list | 00:00:00 | ||
028 Reversing a doubly linked list | 00:00:00 | ||
029 Circular linked list | 00:00:00 | ||
030 Insertion in a circular Linked List | 00:00:00 | ||
031 Deletion in a circular linked list | 00:00:00 | ||
032 Concatenation | 00:00:00 | ||
033 Linked List with Header Node | 00:00:00 | ||
034 Sorted linked list | 00:00:00 | ||
03 Stack and Queue | |||
035 Introduction | 00:00:00 | ||
036 Stack | 00:00:00 | ||
037 Array Implementation of Stack | 00:00:00 | ||
038 Linked List Implementation of Stack | 00:00:00 | ||
039 Queue | 00:00:00 | ||
040 Array Implementation of Queue | 00:00:00 | ||
041 Circular Queue | 00:00:00 | ||
042 Linked List implementation of Queue | 00:00:00 | ||
043 Queue through Circular Linked List | 00:00:00 | ||
044 Deque | 00:00:00 | ||
045 Priority Queue | 00:00:00 | ||
046 Checking validity of an expression containing nested parentheses | 00:00:00 | ||
047 Evaluating Arithmetc Expressions | 00:00:00 | ||
048 Polish Notations | 00:00:00 | ||
049 Converting infix expression to postfix expression | 00:00:00 | ||
050 Evaluation of postfix expression | 00:00:00 | ||
04 Binary Tree | |||
051 Intoduction to trees | 00:00:00 | ||
052 Binary Tree | 00:00:00 | ||
053 Strictly Binary Tree and Extended Binary Tree | 00:00:00 | ||
054 Full binary tree and Complete Binary Tree | 00:00:00 | ||
055 Array Representation of Binary trees | 00:00:00 | ||
056 Linked Representation of Binary Trees | 00:00:00 | ||
057 Binary Tree in Python | 00:00:00 | ||
058 Traversal in Binary Tree | 00:00:00 | ||
059 Preorder Traversal | 00:00:00 | ||
060 Inorder Traversal | 00:00:00 | ||
061 Postorder Traversal | 00:00:00 | ||
062 Level order traversal | 00:00:00 | ||
063 Finding height of a Binary tree | 00:00:00 | ||
064 Constructing Binary tree from Traversals | 00:00:00 | ||
065 Constructing binary tree from inorder and preorder traversals | 00:00:00 | ||
066 Constructing binary tree from inorder and postorder traversals | 00:00:00 | ||
05 Binary Search Tree | |||
067 Introduction | 00:00:00 | ||
068 Traversal in Binary Search Tree | 00:00:00 | ||
069 Searching in a Binary Search Tree | 00:00:00 | ||
070 Nodes with Minimum and Maximum key | 00:00:00 | ||
071 Insertion in a Binary Search Tree | 00:00:00 | ||
072 Deletion in a Binary Search Tree | 00:00:00 | ||
06 Heap | |||
073 Introduction | 00:00:00 | ||
074 Heap Representation | 00:00:00 | ||
075 Insertion in Heap | 00:00:00 | ||
076 Deletion | 00:00:00 | ||
077 Building a Heap | 00:00:00 | ||
078 Heap Applications | 00:00:00 | ||
07 Sorting | |||
079 Introduction | 00:00:00 | ||
080 Sort Stability | 00:00:00 | ||
081 Selection Sort | 00:00:00 | ||
082 Selection Sort Example | 00:00:00 | ||
083 Selection Sort in Python | 00:00:00 | ||
084 Analysis of Selection Sort | 00:00:00 | ||
085 Bubble Sort | 00:00:00 | ||
086 Bubble Sort Example | 00:00:00 | ||
087 Bubble Sort in Python | 00:00:00 | ||
088 Improvement in Bubble Sort | 00:00:00 | ||
089 Analysis of Bubble Sort | 00:00:00 | ||
090 Insertion Sort | 00:00:00 | ||
091 Insertion Sort Example | 00:00:00 | ||
092 Insertion Sort in Python | 00:00:00 | ||
093 Analysis of Insertion sort | 00:00:00 | ||
094 Shell Sort | 00:00:00 | ||
095 Shell Sort Example | 00:00:00 | ||
096 Shell Sort in Python | 00:00:00 | ||
097 Analysis of Shell Sort | 00:00:00 | ||
098 Merging | 00:00:00 | ||
099 Recursive Merge Sort | 00:00:00 | ||
100 Recursive Merge Sort in Python | 00:00:00 | ||
101 Analysis of Merge Sort | 00:00:00 | ||
102 Iterative Merge Sort | 00:00:00 | ||
103 Iterative Merge Sort in Python | 00:00:00 | ||
104 Quick Sort | 00:00:00 | ||
105 Quick Sort in Python | 00:00:00 | ||
106 Analysis of Quick Sort | 00:00:00 | ||
107 Binary tree sort | 00:00:00 | ||
108 Binary Tree Sort in Python | 00:00:00 | ||
109 Analysis of Binary Tree Sort | 00:00:00 | ||
110 Heap Sort | 00:00:00 | ||
111 Heap Sort Python Implementation and Analysis | 00:00:00 | ||
112 Radix Sort | 00:00:00 | ||
113 Radix Sort Implementation and Analysis | 00:00:00 | ||
08 Searching | |||
114 Linear Search | 00:00:00 | ||
115 Linear Search in Sorted List | 00:00:00 | ||
116 Binary Search | 00:00:00 | ||
117 Implementation of Binary Search | 00:00:00 | ||
118 Analysis of Binary Search | 00:00:00 | ||
09 Hashing | |||
119 Direct Addressing | 00:00:00 | ||
120 Hashing | 00:00:00 | ||
121 Collisions | 00:00:00 | ||
122 Hash Functions | 00:00:00 | ||
123 Open Addressing Linear Probing | 00:00:00 | ||
124 Open Addressing Quadratic Probing | 00:00:00 | ||
125 Open Addressing Double Hashing | 00:00:00 | ||
126 Deletion in Open Addressed Tables | 00:00:00 | ||
127 Implementation of Open Addressing | 00:00:00 | ||
128 Separate Chaining | 00:00:00 | ||
129 Implementation of Separate Chaining | 00:00:00 | ||
10 Bonus Lecture | |||
130 UdemyStudentCoupon | 00:00:00 |
3 STUDENTS ENROLLED