Practice Question
Duration: 2 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- About the Course: About the Course
- Paper-1 & 2 | Basic Numeracy: Ratio and Proportion (Ratios), Divisibility Rules, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Percentage, Average, Mensuration and Geometry, Age Problems, Arithmetic, Statistics, Probability, Profit and Loss, Simple Interest and Compound Interest, Partnership, Speed Mathematics and Basic Mathematics, Algebra, Powers and Exponents (Surds and Indices), Time and Work, Pipe and Cistern, RSSB Specific Videos - Basic Numeracy
- Paper-1 & 2 | Data Interpretation: Data Interpretation
- Paper-1 & 2 | General Mental Ability: Mental Ability, RSSB Specific Videos - Mental Ability
- Paper-1 & 2 | Logical Reasoning and Analytical Ability: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Syllogisms, Seating Arrangements, Blood Relations, Directions (Direction Test), Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Calendar, Clock, Cubes & Dices, Venn Diagram, Analogy, Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Data Arrangement, Logical Sequence Of Words, Crypt Arithmetic
- Paper-1 & 2 | Decision Making and Problem Solving: Selection Decision Table (Decision Making)
- Paper-1 | General Science: Physics, Biology, Chemistry, RSSB Specific Videos
- Paper-1 | General Awareness: State Wise GK, GK- Current Affairs
- Paper - 2 | Digital Logic Systems: Digital Systems & Boolean Basics, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits
- Paper-2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Calculus, Relational Algebra, SQL, NoSQL
- Paper-2 | Data Structures & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Algorithm Analysis, Sorting Algorithms, Intro to Compilers, Hashing
- Paper 2 | Data Communication and Network Security: Introduction to CN, Data Communication, Data Link Layer - Ethernet, DLL: Error Control, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Application Layer, Hardware basics, Network Security, Ethical Hacking
- Paper-2 | Operating Systems: Introduction to OS, Process Management, Memory Management, File Management, Deadlock
- Paper-2 | Computer Organization and Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Programming the Basic Computer, Number System, Number Representation
- Paper 2 | System Analysis and Design: Fundamentals of Systems and Information Systems, Fundamentals of Software Engineering, SDLC and Development Approaches, Software Documentation and Software Requirements Specification (SRS), SDD and Quality Assurance, Security, Risk Management & Maintenance, Software Testing
- Paper-2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
- Paper 2 | OOPS , C++ , JAVA: Language Design, OOPS with C++, Java, .Net Programming, Java Fundamentals
- Paper 2 | 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 and AI: Emerging Tech Trends, Artificial Intelligence
- Paper-2 | Data Processing (Ms-Office): MS Office Applications
- Paper-2 | Internet and Web Technologies: HTML Basics, CSS, XML, JavaScript-Basics, Internet Fundamentals, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, Terms & Abbreviations, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing
- Paper 2 | Pedagogy: Child Development, Theories, Concept of Pedagogy, Inclusive Education, Experiential Pedagogy, Assessment & Evaluation, Psychology, Curriculum Framework & Reforms, National Education Policy (NEP) 2020
- Live Classes: RSSB Live Sessions
- Paper 1 - Full Mock Tests:
- Paper 2 - Full Mock Tests:
- BCI Previous Year Papers:
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.