Memory Extension

Duration: 6 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-architecture/basics-of-coa/cpu-organization-basics/asset-memory-extension after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. 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, Relational Calculus, Transaction Management, Concurrency Control
  2. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  3. Digital Electronics: 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
  4. 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
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Virtual Memory, Disc Scheduling, File Management, Memory Management, Threads & Process Creation
  6. 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, Network Security, Hardware Basics
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis
  9. 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, Complexity Theory
  10. 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
  11. C language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums
  12. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Emerging Trends & AI: Emerging Tech Trends, Artificial Intelligence, Cloud Computing, Internet of Things
  14. Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing
  15. Aptitude: Percentage, Ratio and Proportion (Ratios), Logarithm, HCF LCM, Average, Sequence and Series (Series), Number System, Powers and Exponents (Surds and Indices), Algebra, Permutation and Combination, Probability, Profit and Loss, Simple Interest and Compound Interest, Pipe and Cistern, Speed Time and Distance, Mixture and Alligation, Mensuration and Geometry, Mental Ability, Age Problems, Partnership, Statistics, Data Interpretation, Arithmetic, Linear Algebra, Trigonometry, Percentages, Simplification and Approximation, Number System, Ratio and Proportion, Averages, Mixtures and Alligation, Permutations and Combinations, Profit, Loss and Discount, Sequences and Series, Vocabulary, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Powers, Surds and Logarithms, Mathematical Operations, Alphabet and Word Tests, Transformation of Shapes, Signal Space and Optimum Detection, Constraint Puzzles, Mensuration, Patterns in Two-Dimensional Figures, Measurement and Quantity Take-Off, Three-Dimensional Patterns and Visualization, Numerical Reasoning, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Coding and Decoding, Series Completion, Order, Ranking and Sequence, Data Sufficiency, Differential Calculus, Wireless, Satellite and Optical Communication Systems, Complex Analysis, Vector Analysis, Trigonometry, Probability, Statistics, Differential Calculus, Algebra, Time and Work, Speed, Time and Distance, Data Interpretation, Combinatorics
  16. Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Selection Decision Table (Decision Making), Logical Sequence Of Words, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence, TCS NQT Advanced Reasoning Ability, Assembling and Grouping of Shapes, Cubes and Dice, Analogy and Classification, Direction Sense, Algebra, Logical Deduction and Induction, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Time and Work, Clocks and Calendars, Data Interpretation, Blood Relations, Data Sufficiency
  17. English (Verbal Ability): Vocabulary, Noun, Pronoun, Adjectives, Preposition, Articles, Direct and Indirect Speech, Tenses, Conjunction, Subject Verb Agreement (Verb Noun Agreement), Modals, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Adverb, Verb, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Adjectives and Adverbs, Articles and Determiners, Voice and Reported Speech, Modals, Conditionals and Subjunctive, Blood Relations, Tenses, Vocabulary
  18. Engineering Mathematics: Calculus, Vectors
  19. GATE Live Class Recordings 2026: GATE 2026 Live Class
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a detailed lecture on memory mapping and address decoding in computer architecture. The instructor, Sanchit Jain, uses a circuit diagram to explain how a CPU interfaces with multiple memory chips (RAM and ROM). The diagram features a CPU block connected to a 3-to-8 decoder and five memory chips: four RAM chips (labeled 128 x 8) and one ROM chip (labeled 128 x 8). The lecture focuses on determining the address range for each memory chip based on the connections to the decoder and the address bus lines. The instructor demonstrates how to calculate the hexadecimal addresses by analyzing the logic levels of the high-order address bits that control the chip select lines. He also clarifies the role of the lower address lines in accessing specific memory locations within a selected chip.

Chapters

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

    The instructor introduces the memory connection diagram, pointing out the CPU, address bus, and data bus. He identifies the specific memory components: four "128 x 8 RAM" blocks and one "128 x 8 ROM" block. He explains the function of the "Decoder" block, noting that it receives inputs from the upper address lines (16-11) to generate chip select signals (CS1, CS2, etc.). He also points out the "RD" (Read) and "WR" (Write) control lines that are connected to all memory chips, indicating that these signals control the direction of data flow. The visual evidence includes the clear labeling of "Address bus", "Decoder", and the memory blocks, along with the instructor's gestures indicating the flow of signals from the CPU to the memory chips. He establishes the context that the decoder is responsible for selecting which memory chip is active at any given time, while the RD/WR lines control the operation.

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

    The instructor begins the practical calculation of address ranges. He focuses on the ROM chip at the bottom of the diagram. He writes "10 -> 0 ROM" and "0 -> 1 RAM" on the screen, indicating that address bit 10 determines whether the ROM or RAM is selected. He circles the address lines AD9, AD8, and AD7, writing the numbers "7" and "8" to highlight their significance in the address calculation. He draws a vertical block diagram representing the memory space, labeling it "1024" and "10", likely referring to the total addressable space or specific bit positions. This section is critical for understanding how to derive the specific hexadecimal address range for each chip based on the decoder inputs and chip select logic. He explains that the "128 x 8" notation means the chip has 128 locations, each storing 8 bits of data.

  3. 5:00 – 5:36 05:00-05:36

    The instructor concludes the explanation by clarifying the role of the lower address lines. He points to the "AD7" line which is common to all chips, explaining that these lines (AD0-AD7) are used for internal addressing within the 128-byte memory chips. He emphasizes that while the decoder selects the chip, the lower bits select the specific byte within that chip. The visual evidence includes his hand gestures pointing to the "AD7" label and the "Data" bus connection. He reinforces the concept that the total address is a combination of the chip select bits (from the decoder) and the internal offset bits.

The lecture effectively bridges the gap between theoretical memory concepts and practical circuit implementation. By analyzing the specific connections in the diagram, the instructor demonstrates how to calculate address ranges for memory chips. The use of the decoder to map high-order address bits to chip select lines is a fundamental concept in memory organization. The instructor's step-by-step calculation, including the writing of logic levels and address bits, provides a clear method for students to solve similar problems. The distinction between chip selection and internal addressing is crucial for understanding how the CPU accesses specific data in a memory system.

Loading lesson…