Set Associative Mapping Part-1
Duration: 5 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- Paper 1 | Quantitative Aptitude: Percentage Ratio and Proportion (Ratios) Powers and Exponents (Surds and Indices) Logarithm Sequence and Series (Series) Mensuration and Geometry Data Interpretation Average Arithmetic Simplification and Approximation Algebra Sequences and Series Profit, Loss and Discount Percentages Number System Ratio and Proportion Averages, Mixtures and Alligation Permutations and Combinations Time and Work Vocabulary Subject-Verb Agreement Sentence Completion Geometry Reading Comprehension Powers, Surds and Logarithms Trigonometry Mensuration Speed, Time and Distance Patterns in Two-Dimensional Figures Probability Measurement and Quantity Take-Off Transformation of Shapes Three-Dimensional Patterns and Visualization Statistics Mathematical Operations Data Sufficiency Constraint Puzzles Data Interpretation Mixture and Alligation Speed Time and Distance HCF LCM Algebra Profit and Loss Venn Diagram
- Paper 1 | Logical Reasoning: Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning) Series (Number and Letter Series) (Numerical Relations and Reasoning) Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning) Analogy Cubes & Dices Syllogisms Numerical Reasoning Assembling and Grouping of Shapes Coding and Decoding Cubes and Dice Series Completion Alphabet and Word Tests Analogy and Classification Direction Sense Logical Deduction and Induction Order, Ranking and Sequence Critical Reasoning Syllogisms and Venn Diagrams Narrative Sequencing Project Monitoring, Resources and Safety Simple Interest and Compound Interest Coding Decoding Seating Arrangements
- Paper 1 | English Language: Vocabulary Noun Pronoun Verb Adjectives Adverb Preposition Conjunction Articles Tenses Subject Verb Agreement (Verb Noun Agreement) Modals Sentence Correction (Error Correction) Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions) Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing) Prepositions and Conjunctions Idioms and Phrases Verb Forms and Verb Patterns Sentence Basics, Nouns and Pronouns Adjectives and Adverbs Articles and Determiners Modals, Conditionals and Subjunctive Sentence Structure and Correction Voice and Reported Speech Tenses Vocabulary
- Paper 1 | Unit Tests:
- Paper 1 | Full-Length Mock Tests:
- Paper 2 | Engineering Mathematics: Set Theory Relations Functions Graph Theory Group Theory Propositional and Predicate Logic Linear Algebra Calculus Permutation and Combination Probability Statistics Signal Space and Optimum Detection Probability Statistics Combinatorics
- Paper 2 | Digital Logic: 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
- Paper 2 | 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
- Paper 2 | Programming and Data Structures: 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
- Paper 2 | Algorithms: Algorithm Analysis Time Complexity Analysis Sorting Algorithms Greedy Algorithms Dynamic Programming Minimum Spanning Trees Shortest Path Algos
- Paper 2 | 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
- Paper 2 | 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
- Paper 2 | Operating System: Introduction to OS Process Management CPU Scheduling Process Synchronization Threads & Process Creation Deadlock Memory Management Virtual Memory Disc Scheduling File Management
- Paper 2 | 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 Database Recovery
- Paper 2 | 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 Hardware Basics
- Paper 2 | CS/IT Sectional Mock Tests:
- Complete Paper Full Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video lecture introduces Set Associative Mapping in computer architecture. It defines k-way set associative mapping where cache lines are grouped into sets of size 'k'. It explains that a main memory block maps to a specific set but can occupy any line within that set. The instructor uses a diagram to illustrate a 2-way set associative cache with 4 lines (CL-0 to CL-3) and 16 memory blocks (B-0 to B-15), demonstrating how blocks are distributed into Set-0 and Set-1 based on modulo arithmetic. This hybrid approach balances the speed of direct mapping with the flexibility of fully associative mapping.
Chapters
0:00 – 2:00 00:00-02:00
The lecture begins with a definition slide for Set Associative Mapping. The instructor explains that in k-way set associative mapping, cache lines are grouped into sets, each containing 'k' lines. He clarifies that a specific main memory block maps to only one particular set of the cache, but within that set, it can map to any freely available cache line. This establishes the hybrid nature of the mapping, combining direct and fully associative characteristics. The slide text explicitly states: 'In k-way set associative mapping, cache lines are grouped into sets where each set contains 'k' number of lines.' This foundational concept is crucial for understanding how cache memory manages data placement efficiently.
2:00 – 5:00 02:00-05:00
The visual shifts to a diagram illustrating a 2-way set associative cache. The cache has 4 lines (CL-0 to CL-3) divided into two sets: Set-0 (CL-0, CL-1) and Set-1 (CL-2, CL-3). The instructor draws red circles around these components to highlight the grouping. He explains the mapping logic, writing numbers like 0, 4, 8, 12 next to Set-0 and 2, 6, 10, 14 next to Set-1. He demonstrates that memory blocks B-0, B-4, B-8, and B-12 map to Set-0, while B-2, B-6, B-10, and B-14 map to Set-1. This visual aid clarifies how blocks are distributed across sets while maintaining flexibility within the set. The diagram shows lines connecting memory blocks to the sets, illustrating the relationship between memory blocks and sets.
5:00 – 5:24 05:00-05:24
In the final segment, the instructor reinforces the concept of flexibility within the set. He gestures towards the connections between memory blocks and the cache sets, emphasizing that while the set is fixed, the specific line within that set is not. He highlights that if a line in the target set is occupied, a replacement policy must be used. This concludes the explanation of the mapping mechanism shown in the diagram. The instructor's hand movements and pointing gestures serve to draw attention to the specific lines and sets being discussed, ensuring students grasp the dynamic nature of data placement in set associative mapping.
The lecture progresses from theoretical definition to practical application. It starts by defining k-way set associative mapping, establishing that memory blocks map to specific sets but have freedom within those sets. It then transitions to a concrete example using a 2-way set associative cache diagram. The instructor visually demonstrates the mapping of 16 memory blocks into 2 sets of 2 lines each, using modulo arithmetic to determine set assignment. This progression helps students understand the balance between the rigidity of direct mapping and the flexibility of fully associative mapping. The use of diagrams and annotations provides a clear visual representation of abstract concepts, making the learning process more effective.

