ROM

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-STET-COMPUTER-SCIENCE-COMPLETE-COURSE/unit-2-coa/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. Mathematical Aptitude: संख्या पद्धति / Number System, महत्तम समापवर्तक और लघुत्तम समापवर्त्य / HCF and LCM, Divisibility Rules, प्रतिशत / Percentage, अनुपात और समानुपात / Ratio and Proportion, औसत / Average, लाभ, हानि और बट्टा / Profit, Loss and Discount, समय और कार्य / Time and Work, घन क्षेत्रमिति / Solid Mensuration, साधारण और चक्रवृद्धि ब्याज / Simple and Compound Interest, समय, चाल और दूरी / Time, Speed and Distance, Age Problems, मिश्रण और एलिगेशन / Mixture and Alligation, Algebra, सरलीकरण, घातांक और करणी / Simplification, Indices and Surds, Pipe and Cistern, Trigonometry, Statistics, आँकड़ा निर्वचन / Data Interpretation, Arithmetic, समुच्चय, संबंध, फलन और विविक्त गणित / Sets, Relations, Functions and Discrete Mathematics, संख्या पद्धति और संख्या सिद्धांत / Number Systems and Number Theory, निर्देशांक ज्यामिति, सदिश और त्रिविमीय ज्यामिति / Coordinate Geometry, Vectors and 3D Geometry, बहुपद, समीकरण और सम्मिश्र संख्याएँ / Polynomials, Equations and Complex Numbers
  3. Logical Reasoning: श्रेणी / Series, कूट लेखन एवं कूट वाचन / Coding-Decoding, सादृश्यता एवं वर्गीकरण / Analogy and Classification, रक्त संबंध / Blood Relations, दिशा एवं दूरी / Direction and Distance, क्रम एवं रैंकिंग / Order and Ranking, अशाब्दिक तर्क / Non-Verbal Reasoning, बैठक व्यवस्था एवं पहेलियाँ / Seating Arrangement and Puzzles, Syllogisms, वेन आरेख, न्याय वाक्य एवं असमानता / Venn Diagrams, Syllogism and Inequalities, गणितीय संक्रियाएँ एवं लुप्त संख्या / Mathematical Operations and Missing Numbers, वर्णमाला एवं संख्या परीक्षण / Alphabet and Number Test, कथन आधारित तार्किक विवेचन / Statement-Based Reasoning, Analytical Reasoning (Counting Figures Reasoning), घन, पासा एवं आकृतियों की गिनती / Cubes, Dice and Figure Counting, कैलेंडर एवं घड़ी / Calendar and Clock, Clock
  4. General Knowledge: वैज्ञानिक उपलब्धियाँ और अनुसंधान / Scientific Achievements and Research, Chemistry, Biology, History, Geography, Polity, Indian Economy, समसामयिकी / Current Affairs, Static General Knowledge, राज्य विशेष सामान्य ज्ञान / State-Specific General Knowledge
  5. Art of Teaching: शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन / Teaching-Learning Process and Classroom Management, Learners & Learning Process, Factors Affecting Teaching, शिक्षण विधियाँ एवं उपागम / Teaching Methods and Approaches, सूक्ष्म शिक्षण एवं कक्षा संप्रेषण / Microteaching and Classroom Communication, शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी / Teaching Aids and Educational Technology, आकलन एवं मूल्यांकन / Assessment and Evaluation, शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास / Teacher: Qualities, Professional Ethics and Development, शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन / Educational Policies, Acts and Administration, पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र / Curriculum, Arts and Co-curricular Areas, निर्देशन एवं परामर्श / Guidance and Counselling, दिव्यांग बच्चों की शिक्षा / Education of Children with Disabilities, Micro-Teaching & Teaching Skills, पाठ योजना / Lesson Planning
  6. Environmental Science: Environment
  7. Unit 1 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  8. Unit 2 | COA: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer
  9. Unit 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  10. Unit 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  11. Unit 4 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  12. Unit 5 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  13. Unit 6 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Transaction Management, Concurrency Control
  14. Unit 7 | Computer Networks: Introduction to CN, Data Communication, 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
  15. Unit 8 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  16. Unit 9 | Object Oriented Programming: OOPS with C++
  17. Unit 10 | Web Development: HTML Basics, CSS, JavaScript-Basics, XML, Node.js, Git & Github, PHP
  18. Unit 11 | Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  19. Unit 12 | IoT: Emerging Tech Trends, Cloud Computing, कंप्यूटर नेटवर्क / Computer Networks, Internet of Things
  20. Unit 13 | Artificial Intelligence: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms
  21. Unit 14 | E-Commerce: Electronic Data Interchange and E-Commerce, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Physical Security and Cryptography Basics, Cyber Safety and Security
  22. Unit 15 | Multimedia: Multimedia
  23. Unit 16 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  24. Full Length Mock Tests — General Paper:
  25. Full Length Mock Tests — Computer Science (Paper II):
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…