Practice Question (Gate 1993)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/digital-computer-organization-and-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. About Course: About the Course
  2. Paper 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. 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
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. Paper 2 | Theory Of Computation: 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
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…