technifyed

Gate Smashers via YouTube Video playlist

Computer Organization and Architecture (Complete Playlist)

Videos in this playlist 66

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

Advantages and disadvantages

Advantages

  • Free and complete: every lecture is in the playlist, in order.
  • Watch at 1.5x, skip what you know, rewatch what you don't.
  • Taught in Hindi (or Hinglish), which many students find easier to follow.
  • Made for Indian students, with placement and exam context.
  • 3,419,811 views, so help and notes are easy to find.
  • Completely free.
  • Self-paced: start any time.
  • A clear syllabus (66 videos) you can see before you start.

Disadvantages

  • No certificate, deadlines or graded work.
  • Quality and depth vary: check that the playlist is finished before you start.
  • Less depth than a university course on some topics.
  • No certificate.
  • No graded assignments or feedback.
  • Recorded in 2018: tools may have changed since.

Some points apply to every course of this kind; see how we rank.

Free

  • Free: Watch on YouTube, no account needed.
  • Certificate: None. Code or take notes along to make it stick.

Gate Smashers is in Tier 3: good universities, respected companies, nonprofits and well-known teachers of our institution ranking (76/100). GATE and university CS subjects in Hindi.

Similar courses

Compare these

Massachusetts Institute of Technology · YouTube

MIT 15.S12 Blockchain and Money, Fall 2018

Instructor: Prof. Gary Gensler View the complete course: https://ocw.mit.edu/15-S12F18 This course is for students wishing to explore blockchain technology’s potential use - by entrepreneurs & incumbents - to change the world of money and finance. License: Creative Commons BY-NC-SA More information…

Free video23 videos, 29 hours

Massachusetts Institute of Technology · YouTube

MIT 6.006 Introduction to Algorithms, Fall 2011

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…

Free video47 videos, 42 hours

Harvard University · YouTube

CS50's Introduction to Programming with Python (CS50P) 2022

This is CS50P, CS50's Introduction to Programming with Python. Register for free at https://cs50.edx.org/python. Slides and source code at https://cs50.harvard.edu/python. Playlist at https://www.youtube.com/playlist?list=PLhQjrBD2T3817j24-GogXmWqO5Q5vYy0V. An introduction to programming using a la…

Free video11 videos, 16 hours

Harvard University · YouTube

CS50x 2023 Lectures

This is CS50, Harvard University's introduction to the intellectual enterprises of computer science and the art of programming, for concentrators and non-concentrators alike, with or without prior programming experience. (Two thirds of CS50 students have never taken CS before.) This course teaches…

Free video12 videos, 26 hours

Massachusetts Institute of Technology · YouTube

MIT 6.100L Introduction to CS and Programming using Python, Fall 2022

Instructor: Ana Bell View the complete course: https://ocw.mit.edu/courses/6-100l-introduction-to-cs-and-programming-using-python-fall-2022/ *Note: Lectures 6, 10 have been updated! This subject is aimed at students with little to no programming experience. It aims to provide students with an under…

Free video26 videos, 28 hours

Stanford University · YouTube

Stanford Online Courses and Programs

Get more information about the courses and programs we offer. In this playlist you can learn more about course content, pricing, credentials and more!

Free video154 videos, 139 hours

Enter your email and the official page opens. Phone is optional.