Memory Chip Configuration
Duration: 9 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics, Signal Space and Optimum Detection, Probability, Statistics, Combinatorics
- Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
- C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- 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
- 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
- Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
- 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
- Computer Networks: Introduction to CN, DLL: Access Control, DLL: Flow Control, DLL: Error Control, 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
- General Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement, Ratio and Proportion, Vocabulary, Averages, Mixtures and Alligation, Percentages, Subject-Verb Agreement, Sentence Completion, Geometry, Reading Comprehension, Statistics, Three-Dimensional Patterns and Visualization, Permutations and Combinations, Trigonometry, Simplification and Approximation, Constraint Puzzles, Numerical Reasoning, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Direction Sense, Assembling and Grouping of Shapes, Cubes and Dice, Profit, Loss and Discount, Mensuration, Probability, Measurement and Quantity Take-Off, Sentence Structure and Correction, Critical Reasoning, Syllogisms and Venn Diagrams, Order, Ranking and Sequence, Logical Deduction and Induction, Narrative Sequencing, Project Monitoring, Resources and Safety, Traverse Surveying, Clocks and Calendars, Time and Work, Algebra, Data Interpretation, Speed, Time and Distance, Data Sufficiency, Blood Relations, Simple Interest and Compound Interest, Calendar, Alphabet and Word Tests, Sequences and Series, Powers, Surds and Logarithms, Number System, Transformation of Shapes
- English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Verb, Articles, Adverb, Modals, Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Basics, Nouns and Pronouns, Articles and Determiners, Adjectives and Adverbs, Modals, Conditionals and Subjunctive, Voice and Reported Speech, Blood Relations, Tenses, Vocabulary
- Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
- Full Mock Test:
- Previous Year Papers:
- GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
This educational video segment focuses on memory chip configuration and the calculation of address bits required for specific memory organizations. The instructor systematically breaks down memory specifications into components such as the number of cells and cell size to determine addressing requirements. The primary example used throughout the initial section is a 64K x 8 bit memory configuration. The teaching flow begins by defining the relationship between memory size and address bits, emphasizing that the number of addresses depends on the specific configuration. The instructor demonstrates how to convert standard memory notation into binary powers, showing that 64K equals 2^16 addresses. This calculation necessitates a 16-bit address representation to uniquely identify each memory cell. The lesson further clarifies the distinction between word size (cell size) and the number of addressable units, illustrating that while 64K determines the address lines, the '8 bit' component defines the data width per word. Control signals, such as Chip Select (CS), are introduced as separate 1-bit requirements distinct from the address lines. The progression moves from basic definitions to practical calculation methods, ensuring students understand how physical memory layout translates into logical addressing schemes.
Chapters
0:00 – 2:00 00:00-02:00
The video opens with the instructor introducing memory chip configuration concepts using a slide titled 'Memory Chip Configuration'. The key visible text states that the number of address bits required depends on the memory configuration. The instructor presents Example 1: '64K x 8 bit' and breaks this down into '#cells' (number of cells) and 'cell size word size'. A critical calculation is displayed on screen: 'No. of Addresses = 64K = 2^6 x 2^10 = 2^16', which leads to the conclusion that a '16-bit address representation' is needed. The slide also lists 'Control Signal 1-bit' and 'Address 16-bit', establishing the foundational parameters for memory addressing. The instructor underlines key phrases and labels components to clarify terminology, specifically distinguishing between the count of cells and the size of each cell.
2:00 – 5:00 02:00-05:00
The instructor continues the analysis of the 64K x 8 bit configuration, reinforcing the relationship between memory size and address lines. The visual aids consistently show the breakdown of 64K into 2^16 addresses, emphasizing that this calculation dictates the width of the address bus. The slide details memory organization with 8-bit words, illustrating how multiple words are addressed within the total capacity. A summary table at the bottom reiterates that a 'Control Signal' requires 1-bit while 'Address lines' require 16-bit. The instructor demonstrates binary representation for addressing and connects the physical memory layout to logical addressing, explaining how the '8 bit' component relates to word size rather than addressability. Teaching cues include converting K (kilo) notation to powers of 2 and relating cell count directly to address line width. The segment solidifies the understanding that addressing is determined solely by the number of cells, not the data width per cell.
5:00 – 8:32 05:00-08:32
The video transitions to a more complex problem labeled 'Example 3'. The on-screen text presents the scenario: 'If main memory consists of 16384 blocks, and each block contains 256, 8-bit words'. The instructor guides the calculation by converting decimal numbers into powers of 2: '16384' becomes '2^14' and '256' becomes '2^8'. The total number of addressable units is found by multiplying these values, resulting in '2^14 x 2^8 = 2^22'. Consequently, the final calculation shows that '22-bits' are required for addressing. The instructor highlights the method of summing exponents to determine total address bits, moving from simple single-chip examples to block-based memory structures. This section demonstrates how hierarchical memory organization affects address bit requirements, showing that the total number of words (blocks multiplied by words per block) determines the necessary address width.
The lecture provides a structured approach to calculating memory addressing requirements, progressing from basic chip configurations to complex block-based systems. The core principle established is that the number of address bits is determined by the total count of addressable units (cells or words), calculated as powers of 2. For a '64K x 8 bit' configuration, the 64K factor dictates 16 address bits because 64K equals 2^16, while the '8 bit' factor defines data width but does not affect address lines. Control signals like Chip Select are treated as separate 1-bit requirements. The methodology extends to multi-block systems in Example 3, where the total addressable units are derived by multiplying block counts (2^14) by words per block (2^8), yielding a total of 2^22 units and requiring 22 address bits. This progression teaches students to decompose memory specifications into numerical components, convert them to binary exponents, and sum these exponents to find the total address width. The consistent use of visual breakdowns and on-screen equations reinforces the mathematical relationship between memory capacity and hardware addressing requirements.

