Cell Size Classification
Duration: 8 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- KVS/NVS Interview Preparation: Interview Preparation
- The Teaching & Pedagogy Playbook / शिक्षण एवं शिक्षाशास्त्र मार्गदर्शिका: शिक्षा, समाज एवं जेंडर / Education, Society and Gender, Theories of Development / विकास के सिद्धांत, विज्ञान शिक्षणशास्त्र / Science Pedagogy, Teaching-Learning Process and Classroom Management / शिक्षण-अधिगम प्रक्रिया एवं कक्षा प्रबंधन, Teacher: Qualities, Professional Ethics and Development / शिक्षक: गुण, व्यावसायिक नैतिकता एवं विकास, Curriculum, Arts and Co-curricular Areas / पाठ्यचर्या, कला एवं सह-शैक्षिक क्षेत्र, Educational Psychology / शैक्षिक मनोविज्ञान, Growth and Development / वृद्धि और विकास, Cognitive Processes / संज्ञानात्मक प्रक्रियाएँ, Teaching Methods / शिक्षण विधियाँ, Methods of Research and Research Design / शोध विधियाँ एवं अभिकल्प, Social Science Pedagogy / सामाजिक विज्ञान शिक्षणशास्त्र, Educational Policies, Acts and Administration / शैक्षिक नीतियाँ, अधिनियम एवं प्रशासन, Learning and Behavioural Theories / अधिगम और व्यवहारवादी सिद्धांत, Teaching Planning and Teaching Skills / शिक्षण योजना और शिक्षण कौशल
- Computer Systems and Organisation: Basics of COA, Cache Memory Organization, Introduction to OS, Digital Systems & Boolean Basics, Logic Gates & Hardware, Number System, Number Representation
- Computer Networks: Introduction to CN, Data Communication, Net Layer: IP Addressing, Application Layer, Hardware basics
- Database Management: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, SQL
- Introduction to Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
- Emerging Trends: Emerging Trends and AI, Sets, Relations, Functions and Discrete Mathematics / समुच्चय, संबंध, फलन और विविक्त गणित, Trade, Marketing and Consumer Protection / व्यापार, विपणन एवं उपभोक्ता संरक्षण, Internet of Things, Cloud Computing, Solid State Physics and Electronics / ठोस अवस्था भौतिकी और इलेक्ट्रॉनिकी, Network Access Technologies
- Artificial Intelligence: Simple and Compound Interest / साधारण और चक्रवृद्धि ब्याज
- Digital Society & Cyber Law: Society, Law & Ethics, Cyber Safety and Security, Teaching Aids and Educational Technology / शिक्षण सहायक सामग्री एवं शैक्षिक तकनीकी, Computer Software, डिजिटल समाज, नैतिकता और साइबर कानून / Digital Society, Ethics and Cyber Law, Digital India and Online Services, Culture, Socialisation and Social Control / संस्कृति, समाजीकरण और सामाजिक नियंत्रण, Web Publishing & Hosting
- Application Software: MS Office Applications, Operating System, Terms & Abbreviations, Computer Hardware, Language Design, C Fundamentals
- KVS/NVS Tier 2 Live Class Notes: EMRS TGT/PGT Live Class, Subjective Notes
- Full Mock Test:
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
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: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.
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.

