Practice Question (Gate 1993)

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/BIHAR-POLYTECHNIC-LECTURER-COMPUTER-SCIENCE/paper-1-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. Discrete Mathematics: Permutation, Combination and Probability / क्रमचय, संचय एवं प्रायिकता, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  2. Digital Logic: Digital Systems & Boolean Basics, Boolean Expression, Boolean Minimization, Logic Gates & Hardware, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep
  3. Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Pipelining, Multiprocessors
  4. Programming: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  5. Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  6. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  7. Theory of Computation: Grammar, Regular Language Properties, Moore & Mealy Machines, Turing Machines
  8. 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, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  9. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  10. Database Management Systems: 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, ORDBMS, NoSQL
  11. 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, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
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…