C-Look Scheduling

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/MCA-ENTRANCE-EXAM/operating-system/disc-scheduling/look-c-look-algos/asset-c-look-scheduling 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 explanation of the C-LOOK disk scheduling algorithm, positioning it within the context of other scheduling methods like SCAN, LOOK, and C-SCAN. The lecture begins by defining C-LOOK through on-screen text, stating that it functions similarly to how LOOK relates to SCAN. Specifically, the disk arm in C-LOOK does not travel to the physical end of the disk; instead, it services the last request in the current direction and then jumps to the last request at the other end. This mechanism is designed to prevent extra delays caused by unnecessary traversal to the disk's physical limits. The instructor then breaks down the pros and cons, noting that C-LOOK offers more uniform wait times and better response times compared to LOOK. However, it incurs higher overhead to find the last request and is generally not recommended for high-load scenarios. The visual aids help clarify these abstract concepts for students.

Chapters

  1. 0:00 – 1:55 00:00-01:55

    The instructor starts by reading the definition of C-LOOK from the slide, emphasizing its relationship to C-SCAN. He then draws a diamond-shaped diagram on the whiteboard to visually connect the four algorithms: SCAN, LOOK, C-SCAN, and C-LOOK, illustrating their structural similarities. Following this, he draws a large circle to represent the disk platter and sketches a line inside it to demonstrate the head movement. He points to the "Advantage" section, highlighting that C-LOOK provides more uniform wait times and better response times compared to LOOK. He then moves to the "Disadvantage" section, explaining that the overhead to find the last request and return to the initial position is higher, making it unsuitable for cases with more load. Throughout the video, he uses hand gestures to emphasize the movement of the disk arm and the logic behind the algorithm's efficiency. He specifically underlines the text regarding overhead and load conditions to stress the limitations of the algorithm in heavy usage scenarios.

The lecture effectively bridges the gap between theoretical definitions and practical visualization. By drawing diagrams and referencing specific slide text, the instructor clarifies how C-LOOK optimizes disk access by avoiding full traversals, while also acknowledging the computational cost involved in managing request boundaries.

Loading lesson…