Practice Question (Gate 1993)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/computer-architecture/input-output-organisation/disk-access-time-performance/asset-practice-question-gate-1993 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
  2. Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
  3. English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
  4. Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
  5. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  6. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  7. Computer Networks: Introduction to CN, Data Communication, 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
  8. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  9. Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  10. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  11. 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, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This educational video provides a detailed walkthrough of a GATE 1993 computer organization problem involving moving arm disk storage. The instructor systematically breaks down the given specifications to calculate two key performance metrics: average latency (P) and data transfer rate (Q). The lecture focuses on converting units and applying standard formulas for disk access time and throughput.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The session begins with the instructor reading the problem statement displayed on the screen. He lists the specifications: 'Number of tracks/recording surface = 200', 'Disk rotation speed = 2400 rpm', and 'Track storage capacity = 62,500 bits'. He underlines the target variables, 'average latency' and 'data transfer rate'. He starts the calculation by converting the rotation speed from rpm to rotations per second, writing '2400 / 60' on the board. This yields 40 rotations per second. Consequently, he calculates the time for one full rotation as 1/40 seconds. To make this more readable, he converts the time into milliseconds by multiplying by 1000, resulting in '25 ms' for one full rotation.

  2. 2:00 – 2:40 02:00-02:40

    The instructor proceeds to find the average latency, explaining that it is half the time of one full rotation. He writes '12.5 ms' on the board, identifying this as the value for P. Next, he tackles the data transfer rate (Q). He establishes a relationship where 25 ms corresponds to the transfer of 62,500 bits. To find the rate per second, he sets up a proportion: 1 second corresponds to (62,500 / 25) * 1000 bits. He performs the division 62,500 / 25 to get 2,500, and then multiplies by 1000 to get 2,500,000. He writes the final answer as '= 2.5 x 10^6 b/s', completing the calculation for Q.

The video effectively demonstrates how to derive disk performance parameters from basic physical specifications. By first determining the rotational period, the instructor establishes the foundation for calculating both latency and transfer rates. The step-by-step board work clarifies unit conversions between seconds and milliseconds, ensuring students understand the magnitude of the values involved. This methodical approach is crucial for solving similar problems in computer architecture exams.

Loading lesson…