Cell Size Classification

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/ZERO-TO-HERO/computer-architecture/cache-memory-organization/memory-chip-configuration/asset-cell-size-classification 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.

This lecture segment focuses on memory addressing calculations and the classification of memory chips based on cell size. The instructor begins by solving Example 3, which requires determining the number of bits needed to address a main memory system composed of 16384 blocks, each containing 256 words. The solution involves converting the block count and word count into powers of two (2^14 and 2^8 respectively) to calculate the total addressable space. Following this calculation, the lesson transitions into a theoretical classification of memory chips: Byte Addressable Memory (BAM) and Word Addressable Memory (WAM). The instructor defines BAM as having a fixed 8-bit cell size regardless of the processor's architecture, while WAM varies its cell size to match the specific word length of the processor. A comparison table is utilized to illustrate how these addressing modes handle different bit lengths (8-bit, 16-bit, and 32-bit). The analysis highlights that WAM is generally more efficient because it allows for single addressing cycles, whereas BAM often requires multiple addressing cycles to transfer a full word of data. The segment concludes by revisiting the calculation for Example 3, reinforcing the method of summing exponents to find total address bits and visualizing memory addressing through diagrams that map specific addresses to data blocks.

Chapters

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

    The video opens with the instructor solving Example 3, which asks for the number of bits required to address a main memory consisting of 16384 blocks, each containing 256 words. The instructor breaks down the calculation by converting the number of blocks (16384) and words per block (256) into powers of 2. The on-screen text displays the problem statement: 'If main memory consists of 16384 blocks, and each block contains 256, 8-bit words'. The instructor writes the calculation '(16384 x 256) x 8-bit words' and simplifies it to '2^14 x 2^8 = 2^22'. The final result is explicitly stated as '22-bits' on the screen. This section establishes the foundational arithmetic for memory addressing by summing exponents (14 + 8 = 22) to determine the total address bits required for the specified memory configuration.

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

    The lecture transitions from numerical examples to the theoretical classification of memory chips based on cell size. The instructor introduces two primary categories: Byte Addressable Memory (BAM) and Word Addressable Memory (WAM). The on-screen text clearly labels these as 'I) Byte Addressable M/R (BAM)' and 'II) Word Addressable M/R (WAM)'. The instructor defines BAM as having a fixed 8-bit memory cell size, underlining the term '8-bits long' to emphasize its constancy. In contrast, WAM is defined as having a cell size that is 'dependent' on the processor's word length. A comparison table is presented with columns for 'Word Length', 'BAM (Fixed Length)', and 'WAM (Variable Length)'. The instructor circles specific values in the table, such as '8-bit' and '16-bit', to demonstrate how BAM maintains a constant 8-bit cell while WAM scales its cell size (e.g., to 16 bits) to match the processor. The instructor notes that WAM is more efficient because it aligns with the word length, reducing the number of addressing cycles needed.

  3. 5:00 – 7:45 05:00-07:45

    The instructor elaborates on the efficiency differences between BAM and WAM using a detailed comparison table. For an 8-bit word length, both modes operate similarly with single addressing. However, for a 16-bit word length, the table indicates that BAM requires 'Multiple addressing' while WAM allows for 'Single addressing'. The instructor draws arrows to connect the processor word length to these addressing requirements, visually reinforcing that BAM must address two 8-bit cells to retrieve a single 16-bit word. The lesson concludes by revisiting the calculation for Example 3, where the instructor draws a memory addressing diagram. This diagram shows addresses like '1000' and '1001' pointing to specific data blocks labeled '10H' and '28H'. The instructor calculates address ranges, writing values such as '1028H' and '2810H', to illustrate how memory blocks are physically organized. This final demonstration ties the abstract bit calculations back to a concrete visual representation of memory addressing.

The lecture effectively bridges practical calculation with theoretical classification. The initial focus on Example 3 provides a concrete method for calculating address bits by converting memory dimensions into powers of two. This arithmetic foundation is then applied to the broader concepts of BAM and WAM. The core distinction lies in cell size: BAM is rigid at 8 bits, while WAM adapts to the processor. The efficiency argument for WAM is supported by the observation that it minimizes addressing cycles, particularly for word lengths greater than 8 bits. The visual aids, including the comparison table and memory diagrams, are crucial for understanding how these abstract concepts manifest in hardware addressing. The repeated reference to Example 3 serves as a consistent anchor, ensuring students can apply the bit-calculation logic to real-world memory configurations.

Loading lesson…