LLD - Design — Elevator SystemWhich of the following best describes the LOOK disk scheduling algorithm?AIt moves the head to the end of the disk before reversing directionBIt always services the request closest to the current head positionCIt moves the head only as far as the last request in each direction before reversingDIt services requests in the order they arrive without reorderingCheck Answer
Step-by-Step SolutionSolution:Step 1: Understand LOOK algorithm behaviorLOOK moves the head only up to the last request in the current direction, then reverses.Step 2: Compare with SCANUnlike SCAN, LOOK does not go to the disk's end if no requests are there.Final Answer:It moves the head only as far as the last request in each direction before reversing -> Option CQuick Check:LOOK limits head movement to last request in direction [OK]Quick Trick: LOOK stops at last request before reversing direction [OK]Common Mistakes:MISTAKESConfusing LOOK with SCAN going to disk endAssuming LOOK services requests randomlyThinking LOOK always services closest request first
Master "Design — Elevator System" in LLD9 interactive learning modes - each teaches the same concept differentlyLearnWhyDeepArchTryChallengeDesignRecallScale
More LLD Quizzes Behavioral Design Patterns — Part 1 - State pattern - Quiz 8hard Behavioral Design Patterns — Part 1 - Why behavioral patterns define object interaction - Quiz 4medium Behavioral Design Patterns — Part 2 - When to use which behavioral pattern - Quiz 11easy Behavioral Design Patterns — Part 2 - Mediator pattern - Quiz 12easy Design — Elevator System - Why elevator design tests state machines - Quiz 15hard Design — Elevator System - Multiple elevator coordination - Quiz 4medium Design — Library Management System - Requirements and use cases - Quiz 11easy Design — Library Management System - Class design (Book, Member, Librarian, Loan) - Quiz 11easy Design — Tic-Tac-Toe Game - Win condition checking - Quiz 3easy Design — Tic-Tac-Toe Game - Extensibility (NxN board, multiple players) - Quiz 1easy