Starting a new Lecture Notes Series on Computer Organization and Architecture


Youtube Lecture Playlist CreditsChannel 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 4: L-1.4:Types of Buses (Address, Data and Control) in Computer Organization and Architecture
Lecture 7: L-1.7: Types of Instructions in General Purpose Computer | Computer Organization 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 12: L-1.12: Program Control Instructions(Types of Control Instructions) | Computer Organization
Lecture 15: L-1.15: Single Accumulator CPU Organisation | Single Address Instructions in Computer Organisation
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 32: L-3.1: Memory Hierarchy in Computer Architecture | Access time, Speed, Size, Cost | All Imp Points
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 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 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 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 61: I/O Interface in Computer Organization
Lecture 64: Parallel priority interrupt | I/O organization

.png)
.png)
