Cell Size Classification

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/DSSSB-TGT-COMPUTER-SCIENCE-PAPER-2/computer-systems-architecture/cache-memory-organization/memory-chip-configuration/asset-cell-size-classification after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Programming, Data Structures, OOP & Java: 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, Java, OOPS with C++, Java Fundamentals, Array, String, IO & References, Language Design, Intro to Compilers, Visual Basics, Syntax Analysis: Bottom-Up, Object Oriented Technology
  3. Computer Networks, TCP/IP & Network Security: Introduction to CN, Data Communication, DLL: Flow Control, DLL: Access Control, DLL: Error Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Access Technologies, Network Security, Society, Law & Ethics, Cloud Computing, Mobile Computing, Net Layer:Routing Protocol, Cyber Safety and Security
  4. Teaching Methodology: Child Development, Concept of Pedagogy, Theories, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Curriculum Framework & Reforms, National Education Policy (NEP) 2020, Psychology, Teaching-Learning Process, Personality Development, Teaching Methods & Strategies, Learning and Motivation, Learners & Learning Process, Factors Affecting Teaching, Methods of Teaching, Nature, Objectives & Characteristics of Teaching, Teaching-Learning Aids & ICT Integration, Classroom Management & Communication, Evaluation, Assessment & Measurement, Curriculum & School Environment, Inclusive Education & Special Needs, Professional Development & Ethics
  5. Digital Electronics / Boolean Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Analog-Digital Conversion
  6. Operating Systems & Linux: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, File Management, Disc Scheduling, Unix OS, Linux OS, Distributed Systems, Windows OS
  7. Data Base Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, File Organization & Indexing, Transaction Management, Concurrency Control, Database Security & Authorization, Database Recovery, Data Warehousing & Mining
  8. Internet & Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, HTML Basics, CSS, Emerging Technologies, JavaScript-Basics, .Net Programming, Electronic Data Interchange and E-Commerce, XML
  9. Computer Fundamentals, IT Basics & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer, Terms & Abbreviations, MS Office Applications, Instr Formats & Modes, Floating Point Rep
  10. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, extras, Fundamentals of Systems and Information Systems
  12. Design & Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  13. Mathematics - I, II, III, IV: Permutation and Combination, Logarithm, Linear Algebra, Algebra, Calculus, Trigonometry, Vectors, Set Theory, Functions, Relations, Propositional and Predicate Logic, Research Process Steps, Graph Theory
  14. Computer Graphics, Multimedia & Mobile Computing: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing, Multimedia
  15. Emerging Trends: Emerging Tech Trends, Knowledge Representation, Natural Language Processing
  16. Statistical Techniques: Probability, Statistics
  17. Interpolation - DI: Data Interpretation
  18. Basis of Physics: Physics
  19. Previous Year Paper:
  20. Business Studies and Management: Business Communication, Business Organization and Management, Financial Accounting, Business Economics, Management Information System (MIS), Knowledge Management & New Economy
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…