Neso Academy Computer Organization & Architecture: study plan and how long it takes
The Neso Academy playlist is 100 videos and 17.9 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
100 videos · 17.9 hours · Neso Academy
Neso Academy's COA course covers the memory hierarchy, cache mapping with solved PYQs, cache coherency, secondary storage, number systems and complements, floating point representation, Booth's algorithm and computer arithmetic, with many previous-year GATE questions solved.
The free YouTube playlist ends with computer arithmetic: the last four entries (instructions and addressing modes, the ALU and control unit, I/O and pipelining) are one-minute chapter previews for the rest of the course on nesoacademy.org.
Who it's for: GATE aspirants and university students who want COA with lots of exam-style practice.
How long does it take?
The full playlist is 17.9 hours across 100 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 36 days | 24 days | 18 days |
| 1 h a day | 18 days | 12 days | 9 days |
| 2 h a day | 9 days | 6 days | 5 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 3 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–35 · 6h 21m
Day 1 · 57m
- 1Introduction to Computer Organization and Architecture (COA)7m
- 2Basics of Computer Architecture6m
- 3Classifications of Computer Architecture6m
- 4Introduction to Memory8m
- 5Memory Hierarchy & Interfacing8m
- 6Memory Interfacing – Solved PYQs6m
- 7Introduction to Cache Memory7m
- 8Direct Memory Mapping9m
Day 2 · 53m
- 9Direct Memory Mapping – Solved Examples11m
- 10Direct Memory Mapping – Solved PYQs (Part 1)12m
- 11Direct Memory Mapping – Solved PYQs (Part 2)9m
- 12Direct Memory Mapping – Solved PYQs (Part 3)11m
- 13Direct Memory Mapping – Hardware Implementation10m
Day 3 · 55m
- 14Associative Mapping10m
- 15Associative Mapping – Solved Examples7m
- 16Associative Mapping – Solved PYQ6m
- 17Set Associative Mapping11m
- 18Set Associative Mapping – Solved Examples (Part 1)13m
- 19Set Associative Mapping – Solved Examples (Part 2)8m
Day 4 · 48m
- 20Set Associative Mapping – Solved PYQs (Part 1)10m
- 21Set Associative Mapping – Solved PYQs (Part 2)7m
- 22Cache Memory Mapping – A Comparative Study10m
- 23Cache Memory Mapping – Solved PYQ10m
- 24Set Associative Mapping – Bonus PYQs11m
Day 5 · 1h
- 25Cache Design - An Overview15m
- 26Cache Replacement Policies - RR, FIFO, LIFO, & Optimal15m
- 27Cache Replacement Policies - MRU, LRU, Pseudo-LRU, & LFU29m
Day 6 · 56m
- 28LRU Cache Replacement Policy - Solved PYQs13m
- 29Cache Coherence Problem & Cache Coherency Protocols12m
- 30Snooping-based Cache Coherency Protocol6m
- 31Directory-based Cache Coherency Protocol6m
- 32Introduction to Primary Memory18m
Day 7 · 53m
- 33Primary Memory – Architecture of ROM (Part 1)15m
- 34Primary Memory – Architecture of ROM (Part 2)21m
- 35Primary Memory – Architecture of ROM (Part 3)16m
Week 2Videos 36–73 · 6h 44m
Day 8 · 56m
- 36Primary Memory – Architecture of ROM (Part 4)12m
- 37ROM – Solved Examples8m
- 38Primary Memory – RAM11m
- 39Primary Memory – Solved Example9m
- 40Introduction to Secondary Memory15m
Day 9 · 58m
- 41Secondary Memory – Hard Disk Drives7m
- 42Hard Disk Drives (Solved Problems) - Set 18m
- 43Hard Disk Drives – Recording Density & Rotational Speed7m
- 44Hard Disk Drives (Solved Problems) - Set 27m
- 45Hard Disk Drives (Solved Problems) - Set 310m
- 46Hard Disk Drives (Solved Problems) - Set 412m
- 47Hard Disk Drives (Solved Problems) - Set 58m
Day 10 · 59m
- 48Secondary Memory – Solid State Drives8m
- 49Introduction to Number Systems11m
- 50Binary Number System7m
- 51Octal Number System8m
- 52Hexadecimal Number System11m
- 53Conversion to Decimal Number System14m
Day 11 · 58m
- 54Conversion from Decimal Number System9m
- 55Number System – Solved Problems (Set 1)16m
- 56Number System – Solved Problems (Set 2)12m
- 57Number System – Solved Problems (Set 3)9m
- 58Number System – Solved Problems (Set 4)12m
Day 12 · 55m
- 59Introduction to Complementary Number Systems10m
- 60Complementary Number Systems - Examples9m
- 61Diminished Radix and Radix Complement6m
- 62Subtraction in Diminished Radix Complement17m
- 63Subtraction in Radix Complement13m
Day 13 · 58m
- 64Representations of Binary Numbers17m
- 65Representations of Binary Numbers - Solved Problems7m
- 66Sign bit Extension (Part 1)11m
- 67Sign bit Extension (Part 2)13m
- 68Overflow in Signed and Unsigned Numbers10m
Day 14 · 1h
- 69Introduction to Binary Codes11m
- 708421, Excess-3, and 3321 Codes14m
- 71Binary Codes - Solved Problems14m
- 72BCD Addition11m
- 73BCD Adder10m
Week 3Videos 74–100 · 4h 49m
Day 15 · 48m
- 74Excess-3 Addition8m
- 75Gray Code8m
- 76Error Detection11m
- 77Error Correction7m
- 78Problem of Encoding in Error Detection and Correction13m
Day 16 · 1h
- 79Hamming Code14m
- 80Hamming Code – Solved Problems20m
- 81Floating Point Numbers13m
- 82Representations of Floating Point Numbers14m
Day 17 · 49m
- 83Explicit vs. Implicit Normalization of Floating Point Numbers9m
- 84Floating Point Numbers - Solved Problems20m
- 85IEEE Standard for Floating-Point Arithmetic (IEEE 754)9m
- 86IEEE 754 - Single and Double Precision11m
Day 18 · 47m
- 87IEEE 754 - Solved Problems (Set 1)13m
- 88IEEE 754 - Solved Problems (Set 2)11m
- 89Binary Multiplication11m
- 90The Concept of Booth’s Algorithm12m
Day 19 · 57m
- 91The Implementation of Booth’s Algorithm17m
- 92Binary Division9m
- 93The Concept of Restoring Division20m
- 94Implementation of Restoring Division12m
Day 20 · 28m
- 95Improving the Hardware of Restoring Division13m
- 96Non-Restoring Division11m
- 97Machine Instructions & Addressing Modes | Chapter-4 | Computer Organization & Architecture (COA)1m
- 98ALU, Data Path & Control Unit | Chapter-5 | Computer Organization & Architecture (COA)1m
- 99I/O Interfacing | Chapter-6 | Computer Organization & Architecture (COA)1m
- 100Instruction Pipelining | Chapter-7 | Computer Organization & Architecture (COA)1m
Tips for finishing
- Work through the solved PYQ videos with the video paused before checking the answer.
- Cover addressing modes and pipelining with Gate Smashers' COA playlist, and tick off the four preview videos so the planner skips them.