ROM

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/IOCL-ENGINEERS-OFFICERS-GRADE-A-PAPER-2/computer-architecture/basics-of-coa/basics-of-memory/asset-rom after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
  3. Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
  4. Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
  5. Paper 1 | Unit Tests:
  6. Paper 1 | Full-Length Mock Tests:
  7. Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
  8. Paper 2 | Digital Logic: Digital Systems & Boolean Basics Logic Gates & Hardware Boolean Expression Boolean Minimization Combinational Circuit Sequential Circuits Number System Number Representation Registers and Counters Boolean Algebra and Logic Gates Microprocessors and Microcontrollers Logic Families and CMOS Logic Microprocessors Logic Gates and Boolean Algebra Number Systems and Codes Minimization of Boolean Functions Timing, Hazards and Testing Logic Families Combinational Logic Design Arithmetic Circuits Semiconductor Memories and Programmable Logic Devices Combinational Logic Circuits Sequential Circuits and State Machines Latches and Flip-Flops Finite State Machines Minimization of Boolean Functions Arithmetic Circuits Registers and Counters Latches and Flip-Flops Number Systems and Codes
  9. Paper 2 | Computer Architecture: Basics of COA Floating Point Rep Cache Memory Organization Input Output Organisation Pipelining Instr Formats & Modes Control Unit Design Semiconductor Memories and Programmable Logic Processor Organization and Instructions Memory Hierarchy and Input/Output
  10. Paper 2 | Programming and Data Structures: C Fundamentals Control Flow Functions Arrays & Pointers Storage Classes, Structures & Enums DMA, Macros, Scoping & File Handling Introduction to DS Array Stack Queue Linked List Tree Graphs Hashing
  11. Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
  12. Paper 2 | Theory Of Computation/Automata Theory: Introduction to TOC Deterministic FA (DFA) Non-Deterministic FA Regular Expressions Grammar Regular Language Properties Moore & Mealy Machines Pushdown Automata & CFG Turing Machines Complexity Theory
  13. Paper 2 | Compiler Design: Intro to Compilers Lexical Analysis Grammar & CFG Syntax Analysis: Top-Down Syntax Analysis: Bottom-Up Semantic Analysis & SDT Intermediate Code Gen Code Optimization Run Time Environment
  14. Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
  15. Paper 2 | DataBase Management System/DBMS: Basics of DBMS ER Diagram Relational Model & Functional Dependencies Keys & Integrity Constraints Normalization (1NF - BCNF) Decomposition Properties & 4NF File Organization & Indexing Relational Algebra SQL Relational Calculus Transaction Management Concurrency Control Database Recovery
  16. Paper 2 | Computer Networks: Introduction to CN DLL: Access Control DLL: Flow Control DLL: Error Control DLL: Framing Data Link Layer - Ethernet Net Layer: IPv4 & Proto Net Layer: IP Addressing Net Layer:Routing Protocol Transport Layer Services TL: Congestion & UDP Application Layer Hardware Basics
  17. Paper 2 | CS/IT Sectional Mock Tests:
  18. Complete Paper Full Mock Test:
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…