S.No
101 The Truth about Hydrogen
102 The Spitfire's Fatal Flaw
103 The Insane Engineering of James Webb Telescope
104 Why SpaceX is Making Starlink
105 How Russia Stopped The Blitzkrieg
106 The Insane Engineering of the SR-71 Blackbird
107 How a Single Swedish Submarine Defeated the US Navy
108 Lecture 18: Merge Sort Algorithm and Analysis | Design and Analysis of Algorithms
109 Lecture 9: Searching Algorithms | Linear Search | How it Works | Design and Analysis of Algorithms
110 Lecture 19: GATE PYQ's of Merge Sort 🔥 | Design and Analysis of Algorithms #algorithms #mergesort
111 Lecture 10: Binary Search | How it Works | Implementation in Iterative & Recursive Way | Algorithms
112 Lecture 11: What is Skip List | How it Works | Design and Analysis of Algorithms
113 Lecture 6: Space Complexity of Iterative and Recursive Program #algorithm #gate2021 #spacecomplexity
114 Lecture 20: Quick Sort Algorithm and Analysis | Design and Analysis of Algorithms | V. Important 🔥
115 Lecture 16: Insertion Sort Concept, Algorithm and Analysis | Design and Analysis of Algorithms
116 Lecture 1: Course Structure of Algorithms | What is Algorithm & Analysis of Algorithms | #algorithms
117 Lecture 14: Implementation and Analysis of Bubble Sort | Design and Analysis of Algorithms
118 Lecture 5: Master Theorem | V. Important for Exams | #algorithms #mastertheoreminhindi
119 Lecture 13: Concept of Bubble Sort | How it Works | Design and Analysis of Algorithms
120 Lecture 12: Introduction to Sorting | Types of Sorting Algorithm | Design and Analysis of Algorithms
121 Lecture 15: Selection Sort | Concept, Implementation and Analysis | Design & Analysis of Algorithms
122 Lecture 17: Merge Algorithm and Analysis | V. Important🔥 | Design and Analysis of Algorithms
123 Lecture 21: GATE PYQ's of Quick Sort | Design and Analysis of Algorithms
124 Lecture 3: Time Complexity of Iterative Program | #algorithminhindi #timecomplexityinhindi #gate2021
125 Lecture 8: Properties of Asymptotic Notations | GATE PYQ's | Design and Analysis of Algorithms
126 Lecture 2: Asymptotic Notations | Big Oh, Omega and Theta Notation | #algorithminhindi #gate2021
127 Lecture 7: Comparison of Various Time Complexity | Design and Analysis of Algorithms
128 Lecture 4: Time Complexity of Recursive Program #algorithms #timecomplexityinhindi #gate2021
129 Lecture 10: How to Convert ER Diagram into Tables | V. Important Concept
130 Lecture 3: What is Data Independence | Introduction to Entity Relationship (ER) Diagram
131 Lecture 9: What is Partial Key | What is Weak Entity Set & Strong Entity Set | Identifying Relation
132 Lecture 13: Introduction to Relational Algebra | Various Operations of Relational Algebra #database
133 Lecture 34: Delete vs Drop vs Truncate | V. Important 🔥🔥 | Interview Question | Database | SQL
134 Lecture 24: Create Table and Insert Data into Tables | View Data | Database Management System
135 Lecture 8: What is Foreign Key | How it Works | Referential Integrity in Foreign Key | V. Important
136 Lecture 15: Set Operations - Union, Intersection and Difference in Relational Algebra | #database
137 Lecture 32: HAVING Clause, Subqueries and Set Operations in SQL | Database Management System 🔥
138 Lecture 14: Selection and Projection in Relational Algebra | #relationalalgebrainhindi #database
139 Lecture 28: Pattern Searching and Range Searching in SQL | Database Management System
140 Lecture 1: What is Database | Limitations of File System over Database System
141 Lecture 18: Introduction of Joins in Relational Algebra | Need of Joins | V. Important for Interview
142 Lecture 35: SQL Views and Constraints | Database Management System | SQL in Hindi
143 Lecture 22: Introduction to SQL | Structured Query Language | Database Management System
144 Lecture 12: Extended ER Model | Generalization and Specialization | Integrity Constraints
145 Lecture 21: What is Equi Join and Self Join | How it Works | Database Management System
146 Lecture 23: My SQL Data Types | Varchar vs Varchar2 🔥 | Database Management System
147 Lecture 11: GATE PYQ's of ER Model and Relational Model | V. Important Questions
148 Lecture 36: Normalization in Database | V. Important 🔥🔥 | GATE and Interview Preparation
149 Lecture 6: Various Notations of ER Diagram | ER Diagram of Hospital Management System | Database
150 Lecture 25: WHERE Clause | SQL Operators - AND, OR, NOT & IN Operator | Database Management System
151 Lecture 7: Introduction to Relational Model and RDBMS | What is Key | Various Types of Keys
152 Lecture 20: Outer Join - Left Outer, Right Outer and Full Outer Join | Database Management System
153 Lecture 30: SQL TOP, LIMIT and Rownum | Aliases in SQL | Database Management System in Hindi 🔥
154 Lecture 27: ALTER, UPDATE and DELETE Command in SQL | Database Management System
155 Lecture 19: Natural Join in Relational Algebra | Database Management System
156 Lecture 4: What is ER Model, Entity and Entity Set | Types of Attributes | What is Domain
157 Lecture 37: Functional Dependency in Normalization | How it Works | Usage of FD | Database in Hindi
158 Lecture 16: Cartesian Product in Relational Algebra #databasemanagementsystem #relationalalgebra
159 Lecture 33: DCL and TCL Commands in SQL | Database Management System #databaseinhindi #sqlinhindi
160 Lecture 29: Aggregate Functions in SQL | Database Management System
161 Lecture 31: GROUP BY and Joins in SQL | Database Management System | Structured Query Language #sql
162 Lecture 5: Relationship Set, Types of Relation and Mapping Cardinality | Participation Constraints
163 Lecture 17: Division Operator in Relational Algebra #database #relationalalgebrainhindi
164 Lecture 2: Database Schema | 3 Schema Architecture | Types of Schema | Database Users
165 Lecture 26: ORDER BY and NULL Values in SQL | Database Management System
166 Lecture 49: Count the Number of Nodes in a Tree | Count the Leaf Nodes and Internal Nodes in a Tree
167 Lecture 50: Implementation of Height of Binary Tree | Find the Maximum Element in a Binary Tree
168 Lecture 10: Binary Search | How it Works | Implementation in Iterative & Recursive Way | Algorithms
169 Lecture 17: Merge Algorithm and Analysis | V. Important🔥 | Design and Analysis of Algorithms
170 Lecture 15: Selection Sort | Concept, Implementation and Analysis | Design & Analysis of Algorithms
171 Lecture 52: Implementation of Diameter of Binary Tree | Zig - Zag Traversal of Binary Tree
172 Lecture 18: Merge Sort Algorithm and Analysis | Design and Analysis of Algorithms
173 Lecture 16: Insertion Sort Concept, Algorithm and Analysis | Design and Analysis of Algorithms
174 Lecture 14: Implementation and Analysis of Bubble Sort | Design and Analysis of Algorithms
175 Lecture 51: Level Order Traversal of a Binary Tree | Level Order Traversal in Reverse Order
176 Lecture 20: Quick Sort Algorithm and Analysis | Design and Analysis of Algorithms | V. Important 🔥
177 Lecture 23: Doubly Linked List | Inserting and Deleting a Node from Beginning & Specific Position
178 Lecture 19: Middle of Linked List | Kth node from the End | Merge two Sorted Linked Lists
179 Lecture 20: Detect and Remove Loop from Singly Linked List | Floyd's Cycle Algorithm
180 Lecture 29: Tower of Hanoi | Important Application of Stack and Recursion | Interview Problem
181 Lecture 38: Implementation of Queue using Array and Linked List
182 Lecture 22: Circular Linked List | Deleting a node from Front and End from a Circular Linked List
183 Lecture 30: Balance Parenthesis Problem | Reverse a String using Stack | Interview Problem
184 Lecture 17: Singly Linked List | Deletion of an Element | Complexity of Various Operations
185 Lecture 16: Singly Linked List | Traversal and Insertion of an Element in Singly Linked List
186 Lecture 34: Maximum Rectangular Area under Histogram | Common Interview Problem
187 Lecture 42: Stack using Queue | Job Opportunities through Infytq, HackWithInfy, TCS NQT & CodeVita
188 Lecture 7: Interview Questions of Array | Part 1
189 Lecture 40: Reverse a Queue | Reverse a Queue in Group of Size K
190 Lecture 8: Interview Questions of Array | Part 2
191 Lecture 31: How to Reverse a Stack | String of a's and b's Palindrome or Not | Interview Problem
192 Lecture 35: The Celebrity Problem | Interview Problem | Puzzle | Google, Amazon, Microsoft, Flipkart
193 Lecture 18: Reverse a Linked List | Iterative and Recursive | Reverse in Group | Rotate Linked List
194 Lecture 21: Circular Linked List | Inserting a node in Front and End in the Circular Linked List
195 Lecture 33: Stock Span Problem | Famous Interview Problem | Product Based Companies
196 Lecture 41: Implementation of Queue using Two Stacks | GATE PYQ of Queue using Stack
197 Lecture 32: Design a Stack that supports getMin( ) in O(1) time | Interview Question
198 Lecture 45: Traversal of Tree - Preorder, Inorder and Postorder | Implementation of Traversal
199 Lecture 9: LL(1) Parser | How to Compute First and Follow of a Grammar
200 Lecture 13: Operator Grammar | Operator Precedence Parser | Precedence Relation & Parsing of String