Software Engineering (English)

Software Engineering (English)

     
Starting a new Lecture Notes Series on Software Engineering


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
Software Engineering By Lecture Notes together!


Lecture 1: Software Engineering Syllabus Discussion | Imp. for Competitive, College/University & Placements
Lecture 2: What is Software Engineering and its Evolution in Hindi with examples
Lecture 3: SDLC Life Cycle for Beginners | Software Development Life Cycle with Real life example
Lecture 4: Classic Waterfall model in Software Engineering
Lecture 5: Iterative Waterfall Model with example in Hindi
Lecture 6: V Shaped Model with examples | SDLC | Software Engineering
Lecture 7: Prototyping Model in Software Engineering
Lecture 8: Incremental Model in Software Engineering | SDLC
Lecture 9: Evolutionary Model with real life examples | Software Engineering
Lecture 10: Spiral Model in Software Engineering | SDLC
Lecture 11: Agile in Software Engineering
Lecture 12: SCRUM Model in Software Engineering | Agile Technology
Lecture 13: Comparison of All SDLC Models | Waterfall, Iterative, Prototype, Spiral, Increment, RAD, Agile etc.
Lecture 14: Software Requirements | Requirement Engineering | Feasibility Study, Elicitation, SRS, Validation
Lecture 15: Functional vs Non-functional Requirements | Requirement Engineering | Software Engineering
Lecture 16: Software Requirements Specification (SRS) | Software Engineering
Lecture 17: User Requirements with real life examples | User Requirement Specification | Software Engineering
Lecture 18: What is DFD? How to design DFD, Symbols, examples full explanation
Lecture 19: Levels of DFD | 0-Level, 1-Level, 2-Level with examples
Lecture 20: Logical vs Physical DFD with example | How Question asked from DFD?
Lecture 21: Function Oriented vs Object Oriented Design Approach | Software Design Approaches
Lecture 22: SPM(Software Project Management) with real life examples
Lecture 23: Risk Identification | Reactive vs Proactive Risk Management |Types of Risks with real life examples
Lecture 24: Risk Assessment with examples | Risk Management | Software Engineering
Lecture 25: Risk Control vs Risk Mitigation with example | Software engineering
Lecture 26: Basic COCOMO & Intermediate COCOMO with Numerical
Lecture 27: CPM (Critical Path Method) in Software Engineering | PERT/CPM Numerical
Lecture 28: Verification vs Validation in Software Engineering
Lecture 29: Types of Testing in Software Engineering | Levels of Testing
Lecture 30: Error Seeding in Software Testing | With Numerical Explanation
Lecture 31: 2 Imp. MCQs on Software Engineering | Must Watch|
Lecture 32: Question on Cyclomatic Complexity | Software Engg.
Lecture 33: Cohesion and Coupling in Software Engineering
Lecture 34: Unit Testing with examples in Software Engineering
Lecture 35: Integration Testing with examples | Software Engineering
Lecture 36: System Testing with examples | Software Engineering
Lecture 37: Types of System Testing | Software Engineering
Lecture 38: White box Testing with example | Software Engineering
Lecture 39: White Box vs Black Box Testing | Software Engineering
Lecture 40: Statement Coverage Technique | White Box Testing | Software Engineering
Lecture 41: Condition Coverage in White Box Testing | Software Engineering
Lecture 42: Data Flow Testing Technique in White Box Testing | Software Engineering
Lecture 43: Boundary Value Testing | Black 📦 Testing | Software Engineering with Real Life examples
Lecture 44: Perfective, Preventive, Adaptive, Corrective Maintenance in Software Engineering
Lecture 45: MTBF vs MTTR | Mean Time Between Failure | Mean Time to Repair
Lecture 46: Reverse◀️ Engineering👷with Real life examples🧐 | Software Engineering
Lecture 47: CASE Tools ⚒️ in Software Engineering👷
Lecture 48: Performance Testing with Real life examples | Software Engineering
Lecture 49: Regression Testing with Real Life Examples | Software Engineering
Lecture 50: Introduction to UML (Unified Modelling Language🤟) with examples | Software Engineering👷‍♂️👷‍♀️
Lecture 51: Use Case Diagram in UML | Software Engineering
Lecture 52: Sequence Diagram in UML | Software Engineering
Lecture 53: Activity Diagram in UML | Software Engineering
Lecture 54: Class Diagram in UML | Banking System (Real Life example) | Software Engineering
Lecture 55: Class Diagram in UML | OTT Platform (Real life example) | Easiest Explanation
Lecture 56: Object Diagram in UML | Class vs Object UML diagram with real life examples
Lecture 57: RAD Model
Lecture 58: RAD Model in Software Engineering | Rapid Application Development 🛠️ with Example
Lecture 59: Function Point(FP) vs Line of Code(LOC) | Project Size Estimation
Lecture 60: Function Point Analysis (FPA) | Function Point with Real life examples in Software Engineering
Lecture 61: Function Point Calculation | How Project Estimation is Done using FP | Numerical Explanation
Lecture 62: Aggregation vs Composition in UML with Examples | Software Engineering
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)
Design and Analysis of algorithms (DAA) (Hindi)

Design and Analysis of algorithms (DAA) (Hindi)

     
Starting a new Lecture Notes Series on Design and Analysis of algorithms (DAA)


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
Design and Analysis of algorithms (DAA) By Lecture Notes together!


Lecture 1: L-1.1: Introduction to Algorithm & Syllabus Discussion for GATE/NET & Placements Preparation | DAA
Lecture 2: L-1.2: What is Algorithm | How to Analyze an Algorithm | Priori vs Posteriori Analysis | DAA
Lecture 3: L-1.3: Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm
Lecture 4: L-1.4: Various Properties of Asymptotic Notation with Example | Algorithm | DAA
Lecture 5: L-1.5: Comparison of Various Time Complexities | Different types in Increasing Order| Must Watch
Lecture 6: L-1.6: Time Complexities of all Searching and Sorting Algorithms in 10 minute | GATE & other Exams
Lecture 7: L-1.7: Question#1 on Comparison of Various Time Complexities | GATE Questions
Lecture 8: L-1.8: Question#2 on Comparison of Various Time Complexities | GATE Questions
Lecture 9: L-2.1: What is Recurrence Relation| How to Write Binary Search Recurrence Relation|How we Solve them
Lecture 10: L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm
Lecture 11: L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm
Lecture 12: L-2.4: Recurrence Relation [ T(n)= 2T(n/2) +n] | Substitution Method | Algorithm
Lecture 13: L-2.5: Recurrence Relation [ T(n)= T(n-1) +logn] | Substitution Method | Algorithm
Lecture 14: L-2.6: Recurrence Relation [ T(n)= 8T(n/2) + n^2 ] | Master Theorem | Example#1 | Algorithm
Lecture 15: L-2.7: Recurrence Relation [ T(n)= T(n/2) +c] | Master Theorem | Example-2 | Algorithm
Lecture 16: L-2.8: Recurrence Relation T(n)=T(√n)+logn | Master Theorem
Lecture 17: L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm
Lecture 18: L-2.10: Recurrence Relation [T(n)= 3T(n/4) +cn^2] | Recursive Tree method | Algorithm
Lecture 19: L-3.0: Divide and Conquer | Algorithm
Lecture 20: L-3.1: How Quick Sort Works | Performance of Quick Sort with Example | Divide and Conquer
Lecture 21: L-3.2: Performance of Quick Sort | Worst Case Time Complexity with Example | Algorithm
Lecture 22: How Merge Sort Works?? Full explanation with example
Lecture 23: Merge Sort Pseudocode | Merge Sort with example
Lecture 24: L-3.3: Imp. Question on Merge Sort | Divide and Conquer | Algorithm
Lecture 25: L-3.4: How Bubble Sort Works | Performance of Bubble Sort | All Imp Points with Example | Algorithm
Lecture 26: L-3.5: Insertion Sort | Time Complexity Analysis | Stable Sort | Inplace Sorting
Lecture 27: L-3.6: Selection Sort | Time Complexity(Best, Avg & Worst) Analysis | Stable or Not | Inplace or Not
Lecture 28: Radix Sort | Easiest explanation with example
Lecture 29: Counting Sort | Easiest explanation with example
Lecture 30: Bucket Sort | Easiest explanation with examples | Time Complexity analysis with Pseudocode
Lecture 31: L-3.7: Introduction to Trees (Binary Tree, Almost Complete Binary Tree, Full BT, Complete BT, BST)
Lecture 32: L-3.8: Introduction to Heap Tree with examples | Max Min Heap
Lecture 33: L-3.9: Insertion in Heap Tree | Max-Heap & Min-Heap Creation | Time Complexities
Lecture 34: L-3.10: Imp Question on Max Heap | GATE Question on Max/Min Heap | Algorithm
Lecture 35: L-3.11: Build Heap in O(n) time complexity | Heapify Method | Full Derivation with example
Lecture 36: L-3.12: Deletion in Heap tree | Time complexity
Lecture 37: L-3.13: Heap sort with Example | Heapify Method
Lecture 38: L-4.1: Introduction to Greedy Techniques With Example | What is Greedy Techniques
Lecture 39: L-4.2: Knapsack Problem With Example| Greedy Techniques| Algorithm
Lecture 40: L-4.3: Huffman Coding Algorithm in Hindi with Example | Greedy Techniques(Algorithm)
Lecture 41: L-4.4: Huffman Coding Question in Greedy Technique | Imp Question for all competitive exams
Lecture 42: L-4.5: Job Sequencing Algorithm with Example | Greedy Techniques
Lecture 43: L-4.6: Optimal Merge Pattern using Greedy Method in Hindi | Algorithm
Lecture 44: L-4.7: What is Spanning Tree with Examples in Hindi | Algorithm
Lecture 45: L-4.8: Kruskal Algorithm for Minimum Spanning Tree in Hindi | Algorithm
Lecture 46: L-4.9: Prim's Algorithm for Minimum Cost Spanning Tree | Prims vs Kruskal
Lecture 47: L-4.10: Dijkstra's Algorithm - Single Source Shortest Path - Greedy Method
Lecture 48: L-4.11: Dijkstra's Algorithm Analysis | Time Complexity | Pseudocode Explanation
Lecture 49: L-4.12: Why does Dijkstra fail on Negative Weights?? Full Explanation with examples
Lecture 50: L-4.13: Bellman Ford Algorithm | Dijkstra's Vs Bellman Ford | Single Source Shortest Path
Lecture 51: L-4.14: Bellman Ford pseudo code and Time complexity | Single Source Shortest Path
Lecture 52: L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA
Lecture 53: L-5.1: Introduction to Dynamic Programming | Greedy Vs Dynamic Programming | Algorithm(DAA)
Lecture 54: L-5.2: 0/1 Knapsack failed using Greedy approach
Lecture 55: L-5.3: 0/1 Knapsack Problem |Dynamic Programming |Recursive Equation |Recursion Tree Time Complexity
Lecture 56: L-5.4: Traveling Salesman Problem | Dynamic Programming
Lecture 57: L-5.5: Sum of Subsets Problem | Dynamic Programming
Lecture 58: L-5.6: Multistage Graph | Dynamic Programming
Lecture 59: L-5.7: Introduction to All Pair Shortest Path (Floyd Warshall Algorithm)
Lecture 60: L-5.8: Floyd Warshall Working with example | All Pair Shortest Path Algorithm
Lecture 61: L-5.9: Floyd Warshall Time & Space complexity | All Pair Shortest Path
Lecture 62: L-6.1: What is hashing with example | Hashing in data structure
Lecture 63: L-6.2: Collision Resolution Techniques in Hashing | What are the collision resolution techniques?
Lecture 64: L-6.3: Chaining in Hashing | What is chaining in hashing with examples
Lecture 65: L-6.4: Linear Probing in Hashing with example
Lecture 66: L-6.5: Imp Question on Hashing | Linear Probing for Collision in Hash Table | GATE Questions
Lecture 67: L-6.6: Quadratic Probing in Hashing with example
Lecture 68: L-6.7: Double Hashing | Collision Resolution Technique
Lecture 69: Topological Sorting with examples | Topological Sorting using DFS | Imp For Placements & Comp. Exams
Lecture 70: Kahn's Algorithm | Topological Sorting | DAA | Imp for Placements
Lecture 71: Branch & Bound Algorithm with Example | Easiest Explanation of B&B with example
Lecture 72: 0/1 Knapsack using Branch and Bound with example
Lecture 73: Shortcut for Swaps🔁 in Bubble🫧 Sorting📶| Best Case | Worst Case
Lecture 74: Optimized Bubble Sort | Best Case | O(n) Time Complexity | Sorting Algorithms |DAA
Lecture 75: Recurrence Relation [T(n) = 2T(n/2) + 2] | Min-Max Algorithm
Lecture 76: Min-Max Algorithm without Divide & Conquer🏆 | Linear Approach | Find Max & Min
Lecture 77: Min Max Algorithm with Divide & Conquer🏆
Lecture 78: Time complexity and Comparison of All Data Structures
Computer Organization and Architecture (Hindi)

Computer Organization and Architecture (Hindi)

     
Starting a new Lecture Notes Series on Computer Organization and Architecture


Youtube Lecture Playlist Credits 
Channel Name: Gate Smashers

So Let Us Start to This Journey of Learning 
Computer Organization and Architecture By Lecture Notes together!


Lecture 1: L-1.1: Computer Organization and Architecture Syllabus Discussion for GATE and UGC NTA NET
Lecture 2: L-1.2: Von Neumann's Architecture | Stored Memory Concept in Computer Architecture
Lecture 3: L-1.3:Various General Purpose Registers in Computer Organization and Architecture
Lecture 4: L-1.4:Types of Buses (Address, Data and Control) in Computer Organization and Architecture
Lecture 5: L-1.5: Common bus system using multiplexer | Computer organization and Architecture
Lecture 6: L-1.6: Common Bus system| How basic computer works
Lecture 7: L-1.7: Types of Instructions in General Purpose Computer | Computer Organization and Architecture
Lecture 8: L-1.8: Data Transfer Instructions in Computer Organisation and Architecture
Lecture 9: L-1.9: Arithmetic Instructions(Data Manipulation) in Computer Organisation and Architecture
Lecture 10: L-1.10: Logical Instructions(Data Manipulation) in Computer Organisation and Architecture
Lecture 11: L-1.11: Shift Instructions(Data Manipulation) in Computer Organisation and Architecture
Lecture 12: L-1.12: Program Control Instructions(Types of Control Instructions) | Computer Organization
Lecture 13: L-1.13: What is Instruction Format | Understand Computer Organisation with Simple Story
Lecture 14: L-1.14: Question on Instruction Format | Computer Organization | UGC NTA NET June 2021
Lecture 15: L-1.15: Single Accumulator CPU Organisation | Single Address Instructions in Computer Organisation
Lecture 16: L-1.16: General Register CPU Organisation | Two and Three Address Instructions | COA
Lecture 17: L-1.17: Register Stack Organisation | Zero Address Instructions | COA
Lecture 18: L-1.18:Memory Stack Organisation | Memory stack Vs Register stack | COA
Lecture 19: L-2.1: What is Addressing Mode | Various Types of Addressing Modes | COA
Lecture 20: L-2.2: Implied Addressing Mode | Computer Organisation and Architecture
Lecture 21: L-2.3: Immediate Addressing Mode | Computer Organisation and Architecture
Lecture 22: L-2.4: Register Mode | Addressing Mode | Computer Organisation and Architecture
Lecture 23: L-2.5: Register Indirect Mode | Addressing Modes | Computer Organisation and Architecture
Lecture 24: L-2.6: Auto Increment and Decrement Addressing Modes | Computer Organisation and Architecture
Lecture 25: L-2.7: Direct Addressing Mode || Computer Organization and Architecture
Lecture 26: L-2.8: Indirect Addressing Mode | Computer Organisation and Architecture
Lecture 27: `L-2.9: Relative Addressing Mode || Computer Organisation and Architecture
Lecture 28: L-2.10: Base Register Addressing Mode || Computer Organisation and Architecture
Lecture 29: L-2.11: Indexed Addressing Mode || Computer Organisation and Architecture
Lecture 30: L-2.12: Question on Addressing Modes | Computer Organization
Lecture 31: L-2.13: RISC vs CISC | Computer Organization & Architecture
Lecture 32: L-3.1: Memory Hierarchy in Computer Architecture | Access time, Speed, Size, Cost | All Imp Points
Lecture 33: L-3.2: Independent vs Hierarchical Memory Organization | 2-Level Memory Organization
Lecture 34: L-3.3: 3-Level Memory Organisation || Computer Organisation and Architecture
Lecture 35: L-3.4: GATE 2004 Question on 3-Level Memory Organisation || Computer Organisation and Architecture
Lecture 36: L-3.5: What is Cache Mapping || Cache Mapping techniques || Computer Organisation and Architecture
Lecture 37: L-3.6: Direct Mapping with Example in Hindi | Cache Mapping | Computer Organisation and Architecture
Lecture 38: L-3.7: GATE 2005 Question on Direct Mapping | Cache Mapping Questions | Computer Organization
Lecture 39: L-3.8: Fully Associative Mapping with examples in Hindi | Cache Mapping | Computer Organisation
Lecture 40: L-3.9: Advantages and Disadvantages of Direct Mapping | Cache Mapping | Computer Organisation
Lecture 41: L-3.10: Set Associative Mapping with Examples in Hindi | Cache Mapping | Computer Organisation
Lecture 42: L-3.11: Locality of Reference in Cache Memory | Spatial Vs Temporal Locality | Computer Organization
Lecture 43: L-3.12: Cache Replacement Algorithms in Computer Organisation and Architecture
Lecture 44: L-3.13: LRU (Least Recently Used) Cache Replacement Algorithm | Computer Organisation & Architecture
Lecture 45: L-3.14: Gate 2014 Question on Set Associative Cache Mapping | Computer Organisation and Architecture
Lecture 46: L-3.15: FIFO Cache Replacement Policy with example | Computer Organisation and Architecture
Lecture 47: L-3.16: LRU(least recently used ) Cache Replacement Policy | Computer Organisation and Architecture
Lecture 48: L-4.1: Pipelining with real life example| Need of Pipelining | COA
Lecture 49: L-4.2: Pipelining Introduction and structure | Computer Organisation
Lecture 50: L-4.3: Pipelining Vs Non-Pipelining | Instruction Execution | Speedup, Efficiency, Utilization | COA
Lecture 51: L-4.4: Stage Delay in Pipeline | Previous Year GATE Question | Computer Organisation & Architecture
Lecture 52: L-4.5: Numerical Question on Pipelining | Previous year GATE Question | COA
Lecture 53: L-4.6: What is Hazard in Pipelining | various types of Hazards | computer Architecture
Lecture 54: L-4.7: Structural Hazards in Pipelining | Types of Hazards with Example in Hindi
Lecture 55: L-4.8: Control Hazards in Pipelining | Types of Hazards with Example in Hindi
Lecture 56: L-4.9: What is Read After Write(RAW) Hazards| Data Hazard in Pipelining with Example in Hindi | COA
Lecture 57: L-4.10: Write After Read Hazard with Example | Data Hazards| Computer Organization and Architecture
Lecture 58: L-4.11: Write After Write Hazard | Data Hazards in Pipelining | Computer Organization &&Architecture
Lecture 59: L-4.12: Register Renaming in Computer Organization | Data Hazard
Lecture 60: L-4.13: Operand Forwarding in Computer Organization & Architecture | Data Hazard
Lecture 61: I/O Interface in Computer Organization
Lecture 62: Interrupts in 8085 microprocessor | Types of Interrupts in Computer Organization
Lecture 63: Daisy Chaining in Priority Interrupt | Priority Based Interrupt in I/O Organization
Lecture 64: Parallel priority interrupt | I/O organization
Lecture 65: Question on Interrupt Handling(I/O organization) | Computer Organization | UGC NTA NET June 2021
Lecture 66: Question on DMA (Direct Memory Access) | Input/Output Organization| COA | UGC NTA NET June 2021