Practice Question
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About Course: About the Course
- English Language: Vocabulary, Noun, Adjectives, Tenses, Pronoun, Adverb, Preposition, Conjunction, Active Passive Voice (Voice), Articles, Direct and Indirect Speech, Sentence Correction (Error Correction), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Cloze Test (Cloze Passage)
- Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Puzzle Solving (Puzzles), Seating Arrangements, Blood Relations, Syllogisms, Inequality, Directions (Direction Test), Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Clock, Calendar, Analytical Reasoning (Counting Figures Reasoning), Selection Decision Table (Decision Making), Cubes & Dices, Machine Input-Output
- Quantitative Aptitude: Ratio and Proportion (Ratios), Data Interpretation, Mixture and Alligation, Permutation and Combination, Number System, Sequence and Series (Series), Speed Time and Distance, Algebra, Speed Mathematics and Basic Mathematics, Percentage, Average, Time and Work, Simple Interest and Compound Interest, Profit and Loss, Age Problems, Partnership, Mensuration and Geometry, Probability, IBPS Specific Videos
- Data Structures - Professional Knowledge: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms- Professional Knowledge: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
- Python- Professional Knowledge: Python for Placements by Yash Sir, Python Basics
- Operating System- Professional Knowledge: Introduction to OS, Process Management, CPU Scheduling, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management
- DBMS + SQL- Professional Knowledge: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), File Organization & Indexing, SQL, Transaction Management, Concurrency Control
- Computer Networks- Professional Knowledge: Introduction to CN, Data Communication, Net Layer: IP Addressing, Net Layer: IPv4 & Proto, Application Layer, Hardware basics, Network Security
- Software Engineering- Professional Knowledge: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- Computer Organization & Microprocessor- Professional Knowledge: Basics of COA, Cache Memory Organization, Programming the Basic Computer
- Digital Logic Design- Professional Knowledge: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Theory of Computation- Professional Knowledge: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Regular Language Properties, Pushdown Automata & CFG, Turing Machines
- Compiler Design- Professional Knowledge: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Intermediate Code Gen, Code Optimization
- Programming Languages- Professional Knowledge: C Programming by Yash Sir, Object Oriented Programming (OOPS), Programming in C++, Java, C Language Core
- Emerging Tech- Professional Knowledge: Emerging Tech Trends
- Artificial Intelligence: Artificial Intelligence
- Unit Test - Professional Knowledge:
- Full Length Mock Test:
AI summary & chapters
AI Summary
An AI-generated summary of this video lecture.
The video presents a worked example for calculating Effective Memory Access Time (EMAT) in a computer architecture context. The problem specifies a cache hit rate of 80%, cache access time of 5ns, and main memory access time of 100ns. The instructor calculates EMAT for both hierarchical and simultaneous access methods.
Chapters
0:00 – 2:00 00:00-02:00
The video begins with a clear problem statement displayed at the top of the screen: 'Calculate the EMAT for a machine with a cache hit rate of 80% where cache access time is 5ns and main memory access time is 100ns, both for simultaneous and hierarchical access.' The instructor systematically underlines critical values on the text, specifically 'EMAT', '80%', '5ns', and '100ns', to emphasize the variables needed for the formula. He then proceeds to write out the calculation for hierarchical access first. He writes the equation 0.8[5ns] + 0.2[5ns + 100ns], representing the hit rate multiplied by cache time plus the miss rate multiplied by the sum of cache and memory times. He calculates the first term as 4ns and the second term as 21ns, summing them to get 25ns. He draws a horizontal line to separate this from the next part and begins writing the formula for simultaneous access, starting with 0.8[5ns] + 0.2[.
2:00 – 2:16 02:00-02:16
Continuing from the previous step, the instructor completes the formula for simultaneous access. He writes the full expression 0.8[5ns] + 0.2[100ns] on the board. He performs the multiplication to get 4ns and 20ns. He adds these values together to find the final EMAT for simultaneous access, which is 24ns. He clearly underlines the final result 24ns to signify the completion of the problem. The video ends with this final answer visible on the screen alongside the previous calculation.
This lecture segment effectively contrasts two methods of calculating Effective Memory Access Time (EMAT) based on system architecture. The instructor first tackles the hierarchical access model, where a cache miss requires accessing the cache first and then the main memory, leading to a total miss penalty of 5ns + 100ns. This results in an EMAT of 25ns. He then shifts to the simultaneous access model, where the cache and main memory are accessed in parallel. In this scenario, a miss simply incurs the main memory access time of 100ns as the penalty, without the initial cache delay. This yields a slightly faster EMAT of 24ns overall.

