C Programming (Hindi)

C Programming (Hindi)

     
Starting a new Lecture Notes Series on C Programming


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
C Programming By Lecture Notes together!


Lecture 1: C Programming Syllabus for Placements, Competitive exams & College/University exams
Lecture 2: First C Program | Easiest way to Understand C Programming
Lecture 3: Precedence & Associativity of All Operators | Funny & Easiest Way to Remember
Lecture 4: Arithmetic Operators on Integers | C Programming
Lecture 5: Various Arithmetic Operations on Float Datatype | C Programming
Lecture 6: Increment and Decrement operators in C Programming | Postfix | Prefix
Lecture 7: Practice Question on Increment/Decrement Operator | Postfix | Prefix Example
Lecture 8: Comma Operator with examples | C Programming
Lecture 9: Ternary Operator || Conditional Operator | Nested Ternary Operator | C Programming
Lecture 10: Sizeof() Operator | C Programming
Lecture 11: Typecasting in C programming | Implicit & Explicit type conversions
Lecture 12: If else in C Programming | Syntax, Examples, Full Concept | Control statement
Lecture 13: While loop in C Programming with examples
Lecture 14: do-while loop in C Programming with example
Lecture 15: Break & Continue in C Programming with example
Lecture 16: Introduction to Storage Classes in C & its types | Programming in C Language
Lecture 17: Auto Storage class explanation with best examples | C Programming
Lecture 18: Static Storage class explanation with best examples | C Programming
Lecture 19: Static Scoping vs Dynamic Scoping in C language with Example
Lecture 20: How Pointer Works?? Simplest Example | C Programming
Lecture 21: Declaration examples in C Programming
Lecture 22: Introduction to Pointers | C Language | Basics of Pointers in Hindi
Lecture 23: Dangling Pointer in C with Example in Hindi | Types of Pointers | C Programming
Lecture 24: Generic Pointer in C | Type Casting ( Implicit vs Explicit )| Little Endian and Big Endian
Lecture 25: Example of Generic Pointer and Little Endian in C Programming
Lecture 26: What is Wild Pointer and Null Pointer with Examples | Types of Pointers | C programming
Lecture 27: Introduction to Functions in C Programming with examples
Lecture 28: Function Pointer in C Programming
Lecture 29: Array & Pointers in C Programming with examples
Lecture 30: Array of Pointers, Character Array in C Programming with examples | C language in Hindi
Lecture 31: Introduction to Structure in C Programming in Hindi with best examples
Lecture 32: Structure & Pointer in C Programming with example
Lecture 33: Self-Referential Structure with example | Where Self-Referential Struct is used?
Lecture 34: How Memory is Allocated to a Process? | Why Dynamic allocation is Required?
Lecture 35: Malloc() in C Programming | Dynamic Allocation
Lecture 36: Recursion in Programming | Smallest Recursive Program | Recursion using stack
Lecture 37: Strings in C Programming | Concept of Strings in C Programming
Lecture 38: String Functions in C Programming | strcat(), strcpy(), strcmp(), strstr(), strlen(), strchr() etc.
Lecture 39: Union in C programming | Structure vs Union
Lecture 40: Enumerator in C Programming | enum in C Programming
Lecture 41: How to Solve Pointers Question in C Programming | Most Imp Topic #Cprogramming
Lecture 42: File Handling in C Programming | Creating📁Opening📂Reading📁Writing📂Closing📂
Lecture 43: fopen() function in file handling | Opening, reading, appending, writing a file
Lecture 44: fclose() in file handling | C Programming
Lecture 45: Practice Questions on Operators in C Programming
Lecture 46: For loop in C Programming with examples
Lecture 47: Tokens in C programming with Example | C Programming for Beginners🧑‍💻👩‍💻
Lecture 48: Identifiers in C programming👩‍💻🧑‍💻 with example & execution
Data Structure (Hindi)

Data Structure (Hindi)

     
Starting a new Lecture Notes Series on Data Structure


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
Data Structure By Lecture Notes together!


Lecture 1: Lec-1: Roadmap 🛣️ of DSA | Syllabus of Data structure | Data Structure for Beginners
Lecture 2: Lec-2: Introduction to Data Structure with real life examples by #Naina Mam
Lecture 3: Lec-3: Arrays in Data Structure by #Naina Mam | Initialization, Declaration, Memory Representation
Lecture 4: Lec-4: Types of Array | One dimensional & Multi-dimensional Array by #Naina Mam
Lecture 5: Lec-5: Addressing in One Dimensional Array by #Naina Mam | Data Structure
Lecture 6: Lec-6: 2D Arrays | Addressing in 2D Arrays | Row Major Order
Lecture 7: Lec-7: 3D Arrays | Addressing in 3D Arrays | Row Major Order
Lecture 8: Lec-8: Addressing in Lower Triangular Matrix | Data Structure for beginners
Lecture 9: Lec-9: Find 2nd Largest2️⃣ Number in Array | Data Structure for beginners
Lecture 10: Lec-10: Two 2️⃣ Pointer👆 Technique | Two 2️⃣ Sum Problem in Data Structure
Lecture 11: Lec-11: Maximum Sum Subarray Problem | Understand Naive Approach
Lecture 12: Lec-12: Sliding Window 🪟 Technique | Data Structure
Lecture 13: Lec-13: Remove Duplicate Elements in Sorted Array | Various Methods | Data Structure
Lecture 14: Lec-14: Linear Search in Data Structure by #Naina Mam | Time Complexity
Lecture 15: Lec-15: Binary Search in Data Structure by #Naina Mam
Lecture 16: Lec-16: Introduction to Linked List | Types and Need of linked list | data structures
Lecture 17: Lec-17: Arrays vs Linked Lists | Data Structures
Lecture 18: Lec-18: Single Linked List in Data Structures | Self Referential Structure
Lecture 19: Lec-19: The Basic Operations of Linked List | Data Structure
Lecture 20: Lec-20: Traversing in Linked list | Data Structure
Lecture 21: Lec-21: Insert a node at the beginning of Linked list | Data Structure
Lecture 22: Lec-22: Insert a node at the end of Linked List | Data Structure
Lecture 23: Lec-23: Insert a node after a given node in Linked List | Data Structure
Lecture 24: Lec-24: Delete a node from the beginning of Linked List | Data Structure
Lecture 25: Lec-25: Delete a node from the end of Linked List | Data Structure
Lecture 26: Lec-26: Deletion after a given node in Linked List | Data Structure
Lecture 27: Lec-27: Deleting Entire Linked List🔗| Single Linked List🔗| Data Structure
Lecture 28: Lec-28: Introduction to Doubly Linked List | Data Structure
Lecture 29: Lec-29: How to find a Cycle in Linked List | 2 Pointer Algorithm | DS for Beginners
Lecture 30: Lec-30: Introduction to Stack | PUSH and POP operations | Data Structure
Lecture 31: Lec-31: PUSH operation using Array | Implementation of Stack | Data Structure
Lecture 32: Lec-32: POP operation using Array | Implementation of Stack | Data Structure
Lecture 33: Lec-33: PUSH operation using Linked List | Implementation of Stack | Data Structure
Lecture 34: Lec-34: POP operation using Linked List | Implementation of Stack | Data Structure
Lecture 35: Lec-35: Recursion vs Loop | How both approaches work | Data structure for interview preparation
Lecture 36: Lec-36: Infix, Prefix & Postfix👩‍🔧 with examples | Data Structure
Lecture 37: Lec-37: Infix to prefix Conversion | Infix➡️Prefix Conversion with examples | Data Structure
Lecture 38: Lec-38: Infix to Postfix Conversion | Infix➡️Postfix Conversion with examples | Data Structure
Lecture 39: Lec-39: Infix to Prefix conversion using Stack | Data Structure
Lecture 40: Lec-40: Infix to postfix Conversion using Stack | Infix➡️Postfix Conversion with examples
Lecture 41: Lec-41: Practice question on Infix to postfix notation | Data Structure
Lecture 42: Lec-42: Postfix Expression Evaluation | Stack Application | Data Structure
Lecture 43: Lec-43: Practice question on Postfix Evaluation | Stack | Data Structure
Lecture 44: Lec-44: Understanding Call Stack with example | Data Structure #gatesmashers #Stack
Lecture 45: Lec-45: The Magic of Recursion: Understanding the Power of Recursive Functions | Time Complexity
Lecture 46: Lec-46: Introduction to Queue Data structure with real life example | Data Structure #queue
Lecture 47: Lec-47: Enqueue(), Dequeue() & other Operations on Queue | Data Structure
Lecture 48: Lec-48: Dequeue() in Queue using Array | Data Structure #gatesmashers
Lecture 49: Lec-49: isfull() and isempty() in queue | Queue operations | Data Structure
Lecture 50: Lec-50: Implementation of Queue using Array | Enqueue() in Queue | Data Structure #gatesmashers
Lecture 51: Lec-51: Implementation of Queue using Linked List | Enqueue() in Queue | Data Structure
Lecture 52: Lec-52: Introduction to Trees | Binary Tree, Almost Complete Binary Tree, Full BT, Complete
Lecture 53: Lec-53: Binary Search Tree in Data Structure | Insertion and Traversal in BST
Lecture 54: Lec-54: Deletion from Binary Search Tree(BST) with Example | Data Structure
Lecture 55: Lec-55: Find Preorder, Postorder & Inorder of Binary Search Tree(BST) in Data Structure
Lecture 56: Lec-56: Preorder, Inorder and Postorder in 5 minute | Tree Traversal | Easiest and Shortest Trick
Lecture 57: Lec-57: Imp Question on Binary Search Tree | GATE Question | Data Structure
Lecture 58: Lec-58: Introduction to AVL Tree in Data Structure with Examples | All Imp Points of AVL
Lecture 59: Lec-59: How to Create AVL tree | LL, RR, LR, RL Rotation in AVL | Data Structure
Lecture 60: Lec-60: AVL Tree Creation in Data Structure | All Imp Points
Lecture 61: Lec-61: Time Complexities of All Trees | Binary Tree, Binary Search Tree, AVL Tree, Heap Tree
Lecture 62: Lec-62: Introduction to Red-Black Tree | Data Structure for Beginners
Lecture 63: Lec-63: Insertion in Red Black Tree | Data Structure for Beginners
Lecture 64: Lec-64: Topological Order/ Sort in DAG(Direct Acyclic Graph)
DBMS (Database Management System) (Hindi) (Part 3)

DBMS (Database Management System) (Hindi) (Part 3)

     
Starting a new Lecture Notes Series on DBMS (Database Management System)


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
DBMS (Database Management System) By Lecture Notes together!


Lecture 97: Lec-83: Conflict Equivalent Schedules with Example | Transaction concurrency and Control | DBMS
Lecture 98: Lec-84: Conflict Serializability | Precedence Graph | Transaction | DBMS
Lecture 99: Lec-85: Why View Serializability is Used | Introduction to View Serializability | DBMS
Lecture 100: Lec-86:Shared Exclusive Locking Protocol with Example in Hindi | Concurrency Control | DBMS | Part-1
Lecture 101: Lec-87: Drawbacks in Shared/Exclusive Locking Protocol with Example | Concurrency Control Part-2
Lecture 102: Lec-88: 2 Phase Locking(2PL) Protocol in Transaction Concurrency Control | DBMS
Lecture 103: Lec-89: Drawbacks in 2 Phase Locking(2PL) Protocol with examples | Concurrency Control | DBMS
Lecture 104: Lec-90: Strict 2PL, Rigorous 2PL and Conservative 2PLSchedule | 2 Phase Locking in DBMS
Lecture 105: Lec-91: Basic Timestamp Ordering Protocol with Example in Hindi | Concurrency Control | DBMS
Lecture 106: Lec-92: How to Solve Question on Timestamp Ordering Protocol | Concurrency Control | DBMS
Lecture 107: Lec-93: Why Indexing is used | Indexing Beginning | DBMS
Lecture 108: Lec-94: Numerical Example on I/O Cost in Indexing | Part-1 | DBMS
Lecture 109: Lec-95: Numerical Example on I/O Cost in Indexing | Part 2 | DBMS
Lecture 110: Lec-96: Types Of Indexes | Most Important Video on Indexing
Lecture 111: Lec-97: Primary Index With Example | GATE, PSU and UGC NET | DBMS
Lecture 112: Lec-98: Clustered Index in Database with Example
Lecture 113: Lec-99: Secondary Index in Database with Example | Multilevel Indexing
Lecture 114: Lec-100: Introduction to B-Tree and its Structure | Block Pointer, Record Pointer, Key
Lecture 115: Lec-101: Insertion in B-Tree with example in Hindi
Lecture 116: Lec-102: How to find Order of B-Tree | Imp Question on B-Tree
Lecture 117: Lec-103: Difference b/w B-Tree & B+Tree in Hindi with examples
Lecture 118: Lec-104: Order of B+ Tree | Order of Leaf Node & Non Leaf Node in B+Tree
Lecture 119: Lec-105: Immediate Database Modification in DBMS | Log Based Recovery Methods
Lecture 120: Lec-106: Deferred Database Modification in DBMS | Log Based Recovery | Imp for UGC NET and KVS
Lecture 121: Lec-108: Basic PL-SQL Programming With Execution | Part-1
Lecture 122: Lec-109: Basic PL-SQL Programming(While, For Loop) With Execution | Part-2
Lecture 123: Lec-110: Single row and Multi row functions in SQL
Lecture 124: Lec-111: Character functions in SQL with execution | Oracle LIVE
Lecture 125: Lec-112: View in Database | Oracle, SQL Server Views | Types of Views
Lecture 126: Lec-114: What is RAID? RAID 0, RAID 1, RAID 4, RAID 5, RAID 6, Nested RAID 10 Explained
Lecture 127: Lec-115: Various objects in Database | Oracle, SQL Server
Lecture 128: Lec-117: Very Imp. Questions on DBMS basic concepts and Data Modelling | DBMS
Lecture 129: Lec-119: 4 Imp Questions on Advance DBMS | BIG Data and Data Warehouse | DBMS
Lecture 130: Lec-121: Important Question on Relational Algebra | DBMS
Lecture 131: Lec-122: Codd’s 12 Rules of RDBMS with examples
Lecture 132: Lec-123: Top 15 SQL Interview Questions Answers | Most Important Questions for Job Interview
Lecture 133: Lec-127: Introduction to Hadoop🐘| What is Hadoop🐘| Hadoop Framework🖥
Lecture 134: Lec-128: Introduction to BIG Data in Hindi | Small Data Vs BIG Data | Real Life Examples
Lecture 135: Lec-129: Simple vs Complex vs Materialized Views with examples | DBMS
Lecture 136: Procedures in PL-SQL | Local Procedure vs Stored Procedure
Lecture 137: How to Fetch Data from Database using Procedures | PL-SQL Procedure
Lecture 138: What is Cursor in PL-SQL with example
Lecture 139: %TYPE & %ROWTYPE in PL-SQL with Examples
Lecture 140: Data Cleaning using SQL Functions with examples
DBMS (Database Management System) (Hindi) (Part 2)

DBMS (Database Management System) (Hindi) (Part 2)

     
Starting a new Lecture Notes Series on DBMS (Database Management System)


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
DBMS (Database Management System) By Lecture Notes together!


Lecture 49: Lec-49: Question on Inner, Left, Right & Full Outer Joins Explanation | DBMS
Lecture 50: Lec-50: Introduction to Relational Algebra | Database Management System
Lecture 51: Lec-51: Projection in Relational Algebra | Database Management System
Lecture 52: Lec-52: Selection in Relational Algebra | Database Management System
Lecture 53: Lec-53: Cross/Cartesian Product in Relational Algebra | Database Management System
Lecture 54: Lec-54: Set Difference in Relational Algebra | Database Management System
Lecture 55: Lec-55: Union Operation in Relational Algebra | Database Management System
Lecture 56: Lec-56: Division Operation in Relational Algebra | Database Management System
Lecture 57: Lec-57: Rename Operator in Relational Algebra | Database Management System (DBMS)
Lecture 58: Lec-58: Tuple Calculus in DBMS with examples
Lecture 59: Lec-59: Introduction to Structured Query Language | All Points regarding its Features and Syllabus
Lecture 60: Lec-60: All Types of SQL Commands with Example | DDL, DML, DCL, TCL and CONSTRAINTS | DBMS
Lecture 61: Lec-61: Create table in SQL with execution | SQL for Beginners | Oracle LIVE
Lecture 62: Lec-124: CREATE Command (DDL) in SQL with Implementation on ORACLE
Lecture 63: Lec-55: ALTER Command (DDL) in SQL with Implementation on ORACLE
Lecture 64: Lec-56: Difference between Alter and Update in SQL with examples in Hindi | DBMS
Lecture 65: Lec-57 Difference between Delete, Drop & Truncate in SQL | DBMS
Lecture 66: Lec-58: Constraints in SQL in Hindi | DBMS
Lecture 67: Lec-59: SQL Queries and Subqueries (part-1) | Database Management System
Lecture 68: Lec-60: SQL Queries and Subqueries (part-2) | 2nd Highest Salary | Nested Queries | DBMS
Lecture 69: Lec-61: SQL Queries and Subqueries (part-3) | Group By clause | Database Management System
Lecture 70: WITH Clause in SQL | SQL CTE (Common Table Expression) | DBMS
Lecture 71: Lec-62: SQL Queries and Subqueries (part-4) | Having clause | Database Management System
Lecture 72: Lec-63: SQL Queries and Subqueries (part-5) | Database Management System
Lecture 73: Lec-64: SQL Queries and Subqueries (part-6)| use of IN and Not IN | Database Management System
Lecture 74: Lec-65: SQL Queries and Subqueries (part-7)| use of IN and Not IN in Subquery | DBMS
Lecture 75: Lec-66: EXIST and NOT EXIST Subqueries(part-8) | Database Management System
Lecture 76: Lec-107: Like Command in SQL with example in Hindi | Learn SQL in Easiest Way| DBMS
Lecture 77: Lec-125: SEQUENCE in SQL with Syntax & Examples
Lecture 78: Lec-126: How SQL Query executes?? Order of SQL Query Execution⏳🔄
Lecture 79: Lec-67: SQL Aggregate Functions - SUM, AVG(n), COUNT, MIN, MAX Functions | DBMS
Lecture 80: Lec-113: How Aggregate Functions work on NULL Values | SQL | DBMS
Lecture 81: Lec-68: Correlated Subquery in SQL with Example | Imp for Placements, GATE, NET & SQL certification
Lecture 82: Non Correlated Subquery in SQL with Example | Imp for Placements, GATE, NET & SQL certification
Lecture 83: Lec-69: Difference between Joins, Nested Subquery and Correlated Subquery | Most Imp Concept of SQL
Lecture 84: Lec-70: Find Nth(1st,2nd,3rd....N) Highest Salary in SQL | Imp for Competitive & Placement exam
Lecture 85: Lec-71: 3 Imp Questions on SQL basic Concepts | DBMS
Lecture 86: Lec-72: Introduction to PL-SQL in DBMS
Lecture 87: Lec-73: Introduction to Transaction Concurrency in HINDI | Database Management System
Lecture 88: Lec-74: ACID Properties of a Transaction | Database Management System
Lecture 89: Lec-75: Transaction States | Database Management System
Lecture 90: Lec-76: What is Schedule | Serial Vs Parallel Schedule | Database Management System
Lecture 91: Lec-77: All Concurrency Problems | Dirty Read | Incorrect Summary | Lost Update | Phantom Read
Lecture 92: Lec-78: Write-Read Conflict or Dirty Read Problem | Database Management System
Lecture 93: Lec-79: Read-Write Conflict or Unrepeatable Read Problem | Database Management System
Lecture 94: Lec-80: Irrecoverable Vs Recoverable Schedules in Transactions | DBMS
Lecture 95: Lec-81: Cascading vs Cascadeless Schedule with Example | Recoverability | DBMS
Lecture 96: Lec-82: Introduction to Serializability | Transactions Concurrency and Control | DBMS
DBMS (Database Management System) (Hindi) (Part 1)

DBMS (Database Management System) (Hindi) (Part 1)

     
Starting a new Lecture Notes Series on DBMS (Database Management System)


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
DBMS (Database Management System) By Lecture Notes together!


Lecture 1: Lec-1: DBMS Syllabus for GATE, UGCNET, NIELIT, DSSSB etc.| Full DBMS for College/University Students
Lecture 2: Lec-2: Introduction to DBMS (Database Management System) With Real life examples | What is DBMS
Lecture 3: Lec-3: File System vs DBMS | Disadvantages of File System | DBMS Advantages
Lecture 4: Lec-4: 2 tier and 3 tier Architecture with real life examples | Database Management System
Lecture 5: Lec-5: What is Schema | How to define Schema | Database management system in Hindi
Lecture 6: Lec-6: Three Schema Architecture | Three Level of Abstraction | Database Management System
Lecture 7: Lec-7: What is Data Independence | Logical vs. Physical Independence | DBMS
Lecture 8: Lec-8: Integrity Constraints in Database with Examples
Lecture 9: Lec-9: What is CANDIDATE KEY and PRIMARY key | Full Concept | Most suitable examples | DBMS
Lecture 10: Lec-10: What is Primary Key in DBMS | Primary Key with Examples in Hindi
Lecture 11: Lec-11: Foreign Key in DBMS | Full Concept with examples | DBMS in Hindi
Lecture 12: Lec-12: Insert, Update & Delete from Foreign Key table | Referential Integrity
Lecture 13: Lec-13: Question on Foreign Key | ये Question Competition Exams में अक्सर पूछा गया है
Lecture 14: Lec-14: Foreign Key🔑 with On Delete Cascade with Execution
Lecture 15: Lec-15: Super key in DBMS in HINDI | ये Question Competition Exams में अक्सर पूछा गया है
Lecture 16: Lec-16: Introduction to ER model | ER Model क्या है
Lecture 17: Lec-17: Types of Attributes in ER Model | Full Concept | DBMS in Hindi
Lecture 18: Lec-18: One to One relationship in DBMS in Hindi
Lecture 19: Lec-19: One to Many Relationship in DBMS in Hindi | 1-M Relationship
Lecture 20: Lec-20: Many to Many Relationship in DBMS | M-N Relationship
Lecture 21: Lec-21:Introduction to Weak Entity Set with Example | Database Management System
Lecture 22: Lec-22:Question on Minimize tables in ER Model | ये Question Competition Exams में अक्सर पूछा गया है
Lecture 23: Lec-23: Important Question explanation on ER Model | DBMS
Lecture 24: Lec-24: Introduction to Normalization | Insertion, Deletion & Updation Anomaly
Lecture 25: Lec-25: First Normal form in DBMS in HINDI | 1st Normal form क्या होती है ?
Lecture 26: Lec-26: Finding Closure of Functional dependency in DBMS | Easiest & Simplest way
Lecture 27: Lec-27: Functional Dependency & its properties in DBMS in HINDI
Lecture 28: Lec-28: Second Normal Form | 2NF | Database Management System
Lecture 29: Lec-29: Third Normal Form in dbms with examples in Hindi | Normalization
Lecture 30: Lec-30: Boyce Codd Normal Form #BCNF #DBMS #Normalization with best examples
Lecture 31: Lec-31: BCNF Always Ensures Dependency Preserving Decomposition?? Normalization Examples
Lecture 32: Lec-32: Lossless and Lossy Decomposition| Fifth (5th) Normal Form | Database Management System
Lecture 33: Lec-33: All Normal Forms with Real life examples | 1NF 2NF 3NF BCNF 4NF 5NF | All in One
Lecture 34: Lec-34: Minimal Cover in DBMS With Example | Canonical cover
Lecture 35: Lec-35: Practice Question on Normalization | Database Management System
Lecture 36: Lec-36: How to find out the Normal form of a Relation | DBMS
Lecture 37: Lec-37: How to Solve Normalization Questions | DBMS
Lecture 38: Lec-38: Important Question Explanation on Normalization
Lecture 39: Lec-39: Important Question on Normalization (Schemas) Explanation | DBMS
Lecture 40: Lec-40: Cover and Equivalence of Functional Dependencies | Database Management System
Lecture 41: Lec-41: Dependency Preserving Decomposition in DBMS with Examples in Hindi | DBMS
Lecture 42: Lec-42: Dependency Preserving Decomposition in DBMS | Example 2 in Hindi
Lecture 43: Lec-43: Introduction to Joins and its types | Need of Joins with example | DBMS
Lecture 44: Lec-44: Natural Join operation with Example | Database Management System
Lecture 45: Lec-45: Self Join operation with Example | Database Management System
Lecture 46: Lec-46: Equi Join operation with Example | Database Management System
Lecture 47: Lec-47: Left Outer Join operation with Example | Database Management System
Lecture 48: Lec-48: Right Outer Join operation with Example | Database Management System
Operating System (Hindi)

Operating System (Hindi)

     
Starting a new Lecture Notes Series on Operating System


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
Operating System By Lecture Notes together!


Lecture 1: Lec-0:Operating System Syllabus Discussion for all College/University & Competitive exams (GATE,NET)
Lecture 2: L-1.1: Introduction to Operating System and its Functions with English Subtitles
Lecture 3: L-1.2: Batch Operating System | Types of Operating System
Lecture 4: L-1.3: Multiprogramming and Multitasking Operating System in Hindi with real life examples
Lecture 5: L-1.4: Types of OS(Real Time OS, Distributed, Clustered & Embedded OS)
Lecture 6: L-1.5: Process States in Operating System| Schedulers(Long term,Short term,Medium term)
Lecture 7: L-1.6: Imp Linux Commands(Operating System) | Must Watch for College/University & Competitive exams
Lecture 8: L-1.7: System Calls in Operating system and its types in Hindi
Lecture 9: L-1.8: Fork System call with Example | Fork() system call questions
Lecture 10: L-1.9: Questions on Fork System Call With Explanation | Operating System
Lecture 11: L-1.10: User mode and Kernel mode in operating system in hindi
Lecture 12: L-1.11: Process Vs Threads in Operating System
Lecture 13: L-1.12: User Level Vs Kernel Level Thread in Operating System | All Imp Points
Lecture 14: L-2.1: Process Scheduling Algorithms (Preemption Vs Non-Preemption) | CPU Scheduling in OS
Lecture 15: L-2.2: What is Arrival, Burst, Completion, Turnaround, Waiting and Response time in CPU Scheduling
Lecture 16: L-2.3: First Come First Serve(FCFS) CPU Scheduling Algorithm with Example
Lecture 17: L-2.4: Shortest Job First(SJF) Scheduling Algorithm with Example | Operating System
Lecture 18: L-2.5: Shortest Remaining Time First (SJF With Preemption) Scheduling Algorithm with Example | OS
Lecture 19: L-2.6: Question on Shortest Job First(SJF) with Preemption Scheduling Algorithm
Lecture 20: L-2.7: Round Robin(RR) CPU Scheduling Algorithm with Example
Lecture 21: L-2.8: Pre-emptive Priority Scheduling Algorithm with Example | Operating System
Lecture 22: L-2.9: Example of Mix Burst Time(CPU & I/O both) in CPU Scheduling | Tough Question
Lecture 23: L-2.10: Multi Level Queue Scheduling | Operating System
Lecture 24: L-2.11: Multilevel Feedback Queue Scheduling | Operating System
Lecture 25: L-3.1: Process Synchronization | Process Types | Race Condition | Operating System-1
Lecture 26: L-3.2: Producer Consumer Problem | Process Synchronization Problem in Operating System
Lecture 27: L-3.3: Printer-Spooler Problem | Process Synchronization Problem in Operating System
Lecture 28: L-3.4: Critical Section Problem | Mutual Exclusion, Progress and Bounded Waiting | Operating System
Lecture 29: L-3.5: LOCK Variable in OS | Process Synchronization
Lecture 30: L-3.6: Test and Set Instruction in OS | Process Synchronization
Lecture 31: L-3.7: Turn Variable | Strict Alteration Method | Process Synchronization
Lecture 32: L-3.8: Semaphores | Wait, Signal Operation | Counting Semaphore | Example| Operating system
Lecture 33: L-3.9: What is Binary Semaphore | Easiest Explanation | Operating system
Lecture 34: L-3.10: Practice Question on Binary Semaphore in Operating System
Lecture 35: L-3.11: Solution of Producer Consumer Problem using Semaphore | Operating System
Lecture 36: L-3.12: Solution of Readers-writers Problem using Binary semaphore
Lecture 37: L-3.13: Dining philosophers Problem and Solution using Semaphore in Operating System
Lecture 38: L-4.1: DEADLOCK concept | Example | Necessary condition | Operating System
Lecture 39: L-4.2: Resource Allocation Graph in Deadlock | Single Instance with example | Operating System
Lecture 40: L-4.3: Multi-Instance Resource Allocation Graph with Example | Operating System
Lecture 41: L-4.4: Deadlock Handling Methods and Deadlock Prevention | Operating System
Lecture 42: L-4.5: Deadlock Avoidance Banker's Algorithm with Example |With English Subtitles
Lecture 43: L-4.6: GATE 2018 Question on Banker's Algorithm | Deadlock avoidance | Operating System
Lecture 44: L-4.6: GATE 2018 Question on Banker's Algorithm | Deadlock avoidance | Operating System
Lecture 45: L-4.8: GATE 2018 Question Explaination on deadlock | Operating system
Lecture 46: L-5.1: Memory Management and Degree of Multiprogramming | Operating System
Lecture 47: L-5.2: Memory management Techniques | Contiguous and non-Contiguous | Operating System
Lecture 48: L-5.3: Internal Fragmentation | Fixed size Partitioning | Memory management | Operating System
Lecture 49: L-5.4: Variable size Partitioning | Memory management | Operating System
Lecture 50: L-5.5: First Fit, Next Fit, Best Fit, Worst fit Memory Allocation | Memory Management | OS
Lecture 51: L-5.6: GATE Question Solved on First Fit,Best Fit and Worst fit Memory Allocation | Operating System
Lecture 52: L-5.7: GATE 2007 Question Solved on First Fit, Best Fit and Worst fit with timeline | OS
Lecture 53: L-5.8: Need of Paging | Memory Management | Operating System
Lecture 54: L-5.9: What is Paging | Memory management | Operating System
Lecture 55: L-5.10: Question Explanation on Logical address and Physical address space | Operating System
Lecture 56: L-5.11: Question Explanation on Paging | Memory Management | Operating System
Lecture 57: L-5.12: Page Table Entries | Format of Page Table | Operating System
Lecture 58: L-5.13: 2-Level Paging in Operating System | Multilevel Paging
Lecture 59: L-5.14: Inverted paging | Memory Management | Operating System
Lecture 60: L-5.15: Paging Questions in Operating System(OS) | Imp Question for all competitive exams
Lecture 61: L-5.16: What is Thrashing | Operating System
Lecture 62: L-5.17: Segmentation Vs Paging | Segmentation Working | Operating system
Lecture 63: L-5.18: Overlay | Memory Management | Operating system
Lecture 64: L-5.19: Virtual Memory | Page fault | Significance of virtual memory | Operating System
Lecture 65: L-5.20: Translation Lookaside Buffer(TLB) in Operating System in Hindi
Lecture 66: L-5.21: Numerical on Translation Lookaside Buffer (TLB) | Operating System
Lecture 67: L-5.22: Page Replacement Introduction | FIFO Page Replacement algorithm | Operating System
Lecture 68: L-5.23: Belady's Anomaly in FIFO page Replacement with example | Operating System
Lecture 69: L-5.24: Optimal Page Replacement algorithm | Operating System
Lecture 70: L-5.25: Least Recently Used Page Replacement Algorithm | Operating System
Lecture 71: L-5.26: Most recently used page replacement algorithm | Operating System
Lecture 72: L-6.1: Hard Disk Architecture in Operating System in Hindi
Lecture 73: L-6.2: Disk Access Time with Example | Seek Time, Rotational Time and Transfer Time
Lecture 74: L-6.3: Disk Scheduling Algorithm | Operating System
Lecture 75: L-6.4: FCFS in Disk scheduling with Example | Operating System
Lecture 76: L-6.5: SSTF in Disk scheduling with Example | Operating System
Lecture 77: L-6.6: SCAN Algorithm in Disk scheduling with Example | Operating System
Lecture 78: L-6.7: LOOK Algorithm in Disk scheduling with Example | Operating System
Lecture 79: L-6.8: C-SCAN Algorithm in Disk scheduling with Example | Operating System
Lecture 80: L-6.9: C-LOOK Algorithm in Disk scheduling with Example | Operating System
Lecture 81: L-6.10: Important Questions on Operating System | Must Watch | NTA NET June 2021
Lecture 82: L-7.1: File System in Operating System | Windows, Linux, Unix, Android etc.
Lecture 83: L-7.2: File Attributes & Operations in Operating System
Lecture 84: L-7.3: Allocation Methods in operating system in hindi | Contiguous vs NonContiguous
Lecture 85: L-7.4: Contiguous Allocation in Operating system | Advantages & Disadvantages
Lecture 86: L-7.5: Linked List allocation in file allocation with example | Operating system
Lecture 87: L-7.6: Indexed File Allocation in Operating System‬
Lecture 88: L-7.7: Unix Inode Structure with Numerical Example | OS
Lecture 89: Lec-8: Protection & Security in Operating system | Full OS playlist
Lecture 90: TLBs Toughest Question asked in GATE exam | Operating System
Lecture 91: Top 15 OS Interview Questions | Operating System Interview | Placement Strategy
Lecture 92: Linker & Loader with example