Practice Question
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- 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
- 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)
- 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)
- 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
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- 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
- 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
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- 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.
The video presents a solved example of the C-SCAN disk scheduling algorithm. The instructor analyzes a specific scenario where the disk head is at track 45, moving positively, with a queue of requests: 40, 67, 11, 240, 87. The goal is to determine the service order and total seek distance. The instructor explains that C-SCAN moves the head to the end of the disk, jumps to the beginning, and continues in the same direction. He calculates the total distance by summing the movement from the current position to the end, the jump to the start, and the movement to the final request.
Chapters
0:00 – 2:00 00:00-02:00
The instructor reads the problem statement visible on the screen: "Consider the situation in which the disk read/write head is currently located at track 45 (of tracks 0-255) and moving in the positive direction." He lists the track requests: 40, 67, 11, 240, 87. He identifies the algorithm as C-SCAN. He explains the movement: the head moves in the positive direction, servicing requests 67, 87, and 240. He notes that it must reach the end of the disk, track 255. He begins the calculation by finding the distance from the current position (45) to the end (255), writing "255 - 45 = 210" on the board. He emphasizes that C-SCAN goes to the end of the disk, unlike C-LOOK which stops at the last request.
2:00 – 4:10 02:00-04:10
The instructor completes the calculation for the total seek distance. He explains that after reaching track 255, the head jumps to track 0. He writes "255" to represent this jump distance (from 255 to 0). Then, the head services the remaining requests (11, 40) moving positively from 0. The last request serviced is 40. He calculates the distance from 0 to 40 as 40. He sums the three components: 210 (45 to 255) + 255 (255 to 0) + 40 (0 to 40) = 505. He writes "505" and circles it, selecting option (C). He briefly contrasts this with C-LOOK, drawing a diagram where the head goes to 240 then jumps to 11, but confirms the question asks for C-SCAN.
The lesson effectively demonstrates the application of the C-SCAN algorithm to a disk scheduling problem. By breaking down the movement into three distinct phases—moving to the disk end, jumping to the start, and servicing remaining requests—the instructor clarifies how to calculate the total seek distance. The key takeaway is that C-SCAN treats the disk as a circular list but services requests linearly from one end to the other, ensuring a jump from the maximum track to the minimum track.

