Practice Question (Gate 1993)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/HPSC-PGT-COMPUTER-SCIENCE/computer-system-organisation/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. HPSC Interview Preparation: Interview Preparation
  2. Python Language: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis, DSA using Python
  3. Data Structure & Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Sorting Algorithms, Minimum Spanning Trees, Time Complexity Analysis, Graph Theory, Shortest Path Algos
  4. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  5. Computer System & Organisation: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer
  6. 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, Transaction Management, Concurrency Control
  7. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling
  8. Digital Logic & Circuits: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  9. Theory Of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Pushdown Automata & CFG, Turing Machines, Moore & Mealy Machines
  10. 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
  11. Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management, Data Warehousing & Mining
  12. Introduction to Emerging Trends: Emerging Tech Trends
  13. Digital Society & Cyber Law: Society, Law & Ethics
  14. HPSC PGT Previous Year Paper:
  15. HPSC Assistant Professor Previous Year Paper:
  16. Live Sessions: HPSC Live Sessions, EMRS TGT/PGT Live Class
  17. Full Mock Test:
  18. HPSC PGT - MOCK Test Series:
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…