Requirement of Memory Hierarchy
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- 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
- 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
- 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
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- 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
- 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
- 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
- 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- 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
- 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
- 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
- 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
- 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
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture provides a foundational introduction to the concept of Memory Hierarchy within computer architecture, presented by a "Knowledgegate Educator". The instructor begins by outlining the three primary, yet conflicting, requirements for an ideal memory system: "Large capacity", "Less per unit cost", and "Less access time (fast access)". He explains that achieving all three simultaneously is impossible, necessitating a hierarchical approach. To make this abstract concept concrete, he employs two distinct analogies. The first compares transportation modes—a "Cycle", "Car", and "Airbus"—to illustrate the relationship between speed and cost. The second analogy uses weapons—a "Lathi", "303", and "AK-47"—to further emphasize the trade-off between power/speed and expense. The lecture culminates in a detailed examination of the memory hierarchy pyramid, breaking down the specific storage levels from "Register" at the top to "Optical Disk" at the bottom. The instructor analyzes the trends in capacity, access time, and cost per unit across these levels, distinguishing between "Inboard Memory" and "Outboard Storage". Finally, a system block diagram is presented to show the physical connections between the CPU, Cache, Main Memory, and Secondary Memory, solidifying the theoretical concepts with a practical architectural view.
Chapters
0:00 – 2:00 00:00-02:00
The session opens with the title "Memory Hierarchy" displayed at the top of the slide. The instructor lists the three essential needs from a memory system as bullet points: "Large capacity", "Less per unit cost", and "Less access time (fast access)". He gestures with his hands to emphasize that while these are the desired traits, they are mutually exclusive in a single technology. He states that we need a system that combines these features, setting the stage for the hierarchy concept. He explains that we cannot have a memory that is fast, cheap, and large all at once, which is why we need a hierarchy. He mentions that we need to understand what we need from a memory first. The slide also shows the "Knowledgegate Educator" branding at the bottom.
2:00 – 5:00 02:00-05:00
The instructor transitions to analogies to explain the trade-offs. A slide appears showing a "Cycle", "Car", and "Airbus". He explains that a cycle is cheap and has large capacity but is slow, whereas an Airbus is fast but very expensive. He then switches to a slide featuring a "Lathi", "303", and "AK-47". He describes the Lathi as having large capacity but being slow, the 303 as faster, and the AK-47 as the fastest and most powerful but also the most expensive. This section reinforces the idea that higher performance and capacity come at a higher cost. He points to each image to highlight the progression. The slide also shows the Indian emblem at the top left.
5:00 – 9:25 05:00-09:25
The instructor presents the "Memory Hierarchy" pyramid diagram. He points to the levels: "Register", "Cache Memory", "Main Memory", "Magnetic Disk", and "Optical Disk". He explains the trends indicated by the arrows: "Capacity (Increase)" and "Access Time (Increase)" as you go down, while "Per unit storage cost (Increase)" goes up. He categorizes the top three levels as "Inboard Memory" and the bottom two as "Outboard Storage". The segment concludes with a block diagram showing the CPU connected to "Cache Memory", "Main Memory" (labeled as RAM), and "Secondary Memory" (labeled as Auxiliary Memory), illustrating the data flow and hierarchy in a real system. He draws lines to show the connections. The diagram also lists synonyms like "Physical Memory" and "Primary Memory".
The video effectively bridges the gap between abstract requirements and physical implementation. It starts by identifying the conflicting goals of memory design, uses relatable analogies to build intuition about cost-performance trade-offs, and then formalizes this understanding through the standard memory hierarchy pyramid. The final block diagram ties these concepts together, showing how different memory technologies are integrated into a computer system to balance speed, cost, and capacity. This structured approach helps students understand why modern computers use multiple types of memory rather than a single type.

