Cell Size Classification

Duration: 8 min

This video lesson is available to enrolled students.

Return to /learn/BPSC/computer-system-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 the Course: About the Course
  2. Section 1 | Language (Hindi): भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, संधि, समास, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material), वर्णमाला
  3. Section 1 | Language (उर्दू भाषा — 22 प्रश्न (निश्चित)): Spelling & Diacritics, Grammar (اسم, فعل, صفت, ضمیر), Vocabulary, Idioms & Proverbs, Comprehension
  4. Section 1 | Language (বাংলা / बांग्ला भाषा — 22 प्रश्न (निश्चित)): Bangla Script and Sounds, Bangla Grammar and Usage, Bangla Word Formation and Vocabulary, Reading and Text Interpretation
  5. Section 1 | Language (English): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Verb, Adverb, Preposition, Articles, Determiner, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Verbal Analogy (Word Based Analogy), Facts, Inference and Judgements
  6. Section 2 | Primary Maths & Reasoning: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Average, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Mensuration and Geometry, Age Problems, Arithmetic, Powers and Exponents (Surds and Indices), Algebra, Probability, Trigonometry, Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Data Arrangement, Inequality, Analogy, Ranking, Order and Sequence
  7. Section 2 | General Awareness (GK + Current Affairs): Polity, Physics, Biology, State Wise GK, Chemistry, History, Geography, Indian Economy, Environment, GK- Current Affairs, Static General Knowledge
  8. Section 3 | Computer System and Org. (CSO): Basics of COA, Floating Point Rep, Cache Memory Organization, Instr Formats & Modes, Programming the Basic Computer, Input Output Organisation, Register Transfer and Microoperations, Control Unit Design
  9. Section 3 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, SQL, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control
  10. Section 3 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Process Synchronization
  11. Section 3 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow 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
  12. Section 3 | Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Shortest Path Algos
  13. Section 3 | Theory Of Computation & Compiler Design: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines, Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization
  14. Section 3 | Emerging Trends (AI, Societal Ethics & MS Office): Artificial Intelligence, Emerging Tech Trends, Society, Law & Ethics, MS Office Applications
  15. Section 3 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Maintenance and Configuration Management, Software Testing
  16. Section 3 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  17. Section 3 | OOPS, C++, JAVA, HTML: OOPS with C++, Java, HTML Basics, CSS
  18. Section 3 | Java: Java Fundamentals, Array, String, IO & References
  19. Section 3 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  20. Section 3 | Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  21. Section 3 | Multimedia: Multimedia
  22. BPSC Previous Year Papers:
  23. BPSC Full Mock Tests:
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…