ROM

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/computer-system-architecture/basics-of-coa/basics-of-memory/asset-rom after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This lecture introduces Read-Only Memory (ROM) as a non-volatile primary memory that retains data when power is off and stores the BIOS for bootstrapping. The instructor explains ROM's read-only nature, where data is permanently written during manufacturing, and compares its speed to RAM and hard disks. The lesson then transitions to specific ROM types: MROM (Masked ROM), which is hard-wired by the manufacturer; PROM (Programmable ROM), manufactured blank for one-time user programming; EPROM, which uses ultraviolet light for erasure; and EEPROM, allowing selective erasure via electric signals. A comparison table summarizes the differences in erasing methods and constraints across all four types.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with a slide titled 'Basics of ROM (Read-Only Memory)' defining ROM as a non-volatile primary memory that retains data when power is off. The instructor explains the 'Read-Only' nature, noting data is permanently written during manufacturing, and describes ROM's function in storing the BIOS for booting. A four-quadrant diagram visually summarizes key properties, including a speed comparison showing ROM is slower than RAM but faster than a hard disk. The instructor then uses red annotations to highlight Cache Memory, Main Memory, and Secondary Memory in the memory hierarchy, drawing an arrow labeled 'ROM' pointing toward the CPU/Cache area to indicate its system role.

  2. 2:00 – 5:00 02:00-05:00

    The lesson transitions to 'Types of ROM & Their Usage,' beginning with MROM (Masked ROM), described as hard-wired by the manufacturer and permanent, with examples like washing machines and old video game cartridges. PROM (Programmable ROM) is introduced next, manufactured blank but programmable only once by the user; a red circle highlights the constraint that a mistake means a wasted chip. The instructor then covers EPROM (Erasable PROM), which can be erased using ultraviolet light, and EEPROM (Electrically Erasable PROM), allowing selective erasure via electric signals. A two-panel diagram contrasts EPROM's UV light erase mechanism with EEPROM's electric signal approach, emphasizing that EPROM requires erasing the entire chip.

  3. 5:00 – 6:26 05:00-06:26

    The final segment consolidates the four ROM types through a comparison table with columns for MROM, PROM, EPROM, and EEPROM. Rows detail the Erasing Method, showing 'UV Light' for EPROM and 'Electric Signal' for EEPROM, with red check and X marks indicating capabilities. The instructor revisits the MROM and PROM slide, pointing to illustrations of a mask, washing machine, game cartridge, and a trash can labeled 'wasted chip' to reinforce the one-time programming constraint. The EPROM vs. EEPROM diagram reappears, with red-underlined phrases like 'entire chip' emphasizing that EPROM erasure is not selective, unlike EEPROM's targeted electric signal approach.

The lecture builds a clear progression from ROM fundamentals to specific type comparisons. It starts with core definitions—non-volatility, read-only nature, and BIOS function—then places ROM within the memory hierarchy relative to CPU, cache, main memory, and secondary storage. The teaching flow moves logically through four ROM types in order of increasing programmability: MROM (fixed), PROM (one-time user programming), EPROM (UV-erasable, whole-chip), and EEPROM (electrically erasable, selective). Key pedagogical tools include red annotations for emphasis, visual diagrams contrasting erasure mechanisms, real-world examples (washing machines, game cartridges), and a final comparison table that consolidates erasing methods and constraints. The central takeaway is the trade-off between permanence, programmability, and erasure flexibility across ROM types.

Loading lesson…