Operating System Overview

1. What is the primary purpose of an operating system?

o a) To provide internet access
o b) To integrate hardware resources and make them available to users
o c) To install software
o d) To play media files
2. Which of the following is a basic service provided by an operating system?
o a) Virus scanning
o b) Hardware integration and resource management
o c) Email management
o d) Document editing
3. What is the term for the part of the operating system that is always loaded into
memory?
o a) Bootloader
o b) Kernel
o c) Shell
o d) Command processor
4. What does 'multitasking' in an operating system refer to?
o a) The ability to run multiple operating systems simultaneously
o b) The concurrent execution of multiple programs on a single CPU
o c) The ability to connect to multiple networks
o d) The ability to store multiple files
5. Which component of the operating system manages file creation, deletion, and
manipulation?
o a) Command processor
o b) File management system
o c) Process scheduler
o d) Memory manager
6. What is 'bootstrapping' in the context of operating systems?
o a) The process of installing new software
o b) The process of starting the computer and loading the operating system
o c) The process of backing up data
o d) The process of updating the system
7. In a multitasking operating system, what is a 'time slice'?
o a) A period during which a program can execute before the next program
is scheduled
o b) The total time taken to boot the system
o c) The time taken to install an application
o d) The time taken to shut down the system
8. Which type of operating system is designed for real-time applications where time
constraints are critical?
o a) Batch processing systems
o b) Real-time systems
o c) Distributed systems
o d) Mainframe systems
9. What is the role of the 'shell' in an operating system?
o a) To manage hardware resources
o b) To provide a user interface and command processor
 o c) To manage network connections
o d) To allocate memory
10. What is the function of the 'memory manager' in an operating system?
o a) To manage network traffic
o b) To manage the allocation and deallocation of memory
o c) To manage file permissions
o d) To manage user accounts

Process Control and Scheduling

11. What is a 'process' in the context of operating systems?

o a) A software installation
o b) An executing program
o c) A user login session
o d) A network connection
12. Which scheduling algorithm allocates the CPU based on the shortest remaining
time first?
o a) First-Come, First-Served (FCFS)
o b) Round Robin
o c) Shortest Job Next (SJN)
o d) Multilevel Queue
13. What is a 'context switch'?
o a) The process of switching from one operating system to another
o b) The process of transferring control from one process to another
o c) The process of logging out a user
o d) The process of installing software
14. Which scheduling algorithm is designed to prevent starvation?
o a) First-Come, First-Served (FCFS)
o b) Round Robin
o c) Shortest Job First (SJF)
o d) Priority Scheduling
15. In the context of process management, what is a 'thread'?
o a) A user command
o b) An individually executable part of a process
o c) A network packet
o d) A file in the system

Memory Management

16. What is the primary purpose of memory management in an operating system?

o a) To manage user accounts
o b) To control access to network resources
o c) To allocate and deallocate memory to programs
o d) To manage file storage
17. What is 'virtual memory'?
o a) The memory located on a USB drive
o b) An illusion of a large memory created by using disk storage
o c) The memory in the CPU cache
o d) A type of read-only memory
 18. Which memory allocation algorithm allocates the smallest free block that is
sufficient for the process?
o a) First Fit
o b) Best Fit
o c) Worst Fit
o d) Next Fit
19. What is 'fragmentation' in the context of memory management?
o a) The process of backing up data
o b) The process of dividing memory into fixed-size blocks
o c) The inefficient use of memory where small, unused spaces are left
o d) The process of defragmenting the hard drive
20. What does 'paging' refer to in memory management?
o a) Dividing memory into fixed-size pages
o b) Allocating memory to user processes
o c) Swapping data between the CPU and the hard drive
o d) Managing the virtual memory

File Management and Security

21. What is the purpose of a file management system in an operating system?

o a) To manage network connections
o b) To manage user logins
o c) To organize, store, retrieve, and manipulate files
o d) To control access to hardware devices
22. What is a 'directory' in the context of file management?
o a) A command used to delete files
o b) A file that contains a list of other files and their attributes
o c) A program used to manage user accounts
o d) A type of system memory
23. Which file management feature helps recover files in case of a system crash?
o a) File compression
o b) File auditing
o c) File journaling
o d) File encryption
24. What is the main purpose of security and protection services in an operating
system?
o a) To speed up the system
o b) To protect the OS and users from unauthorized access and actions
o c) To manage user accounts
o d) To manage file storage
25. Which security feature prevents unauthorized access to the system?
o a) File compression
o b) User authentication
o c) Disk defragmentation
o d) Task scheduling

Network and Communication Services

26. What is the role of the TCP/IP protocol suite in an operating system?
 o a) To manage user accounts
o b) To enable network communication and data transfer
o c) To manage file storage
o d) To control hardware devices
27. Which network application allows users to remotely access another computer?
o a) Email
o b) Web services
o c) Remote login
o d) Streaming multimedia
28. What is a 'VPN' in the context of network services?
o a) Virtual Private Network
o b) Very Powerful Network
o c) Virtual Processing Node
o d) Verified Public Network
29. What is the primary purpose of communication services in an operating system?
o a) To manage user logins
o b) To facilitate communication between software and the OS
o c) To control hardware devices
o d) To manage file storage
30. Which component of system administration support is responsible for setting
group policies?
o a) Network administration
o b) System configuration
o c) Software installations
o d) Backups

Conceptual Questions

1. What is a process in the context of an operating system?

o a) A software package
o b) A program in execution
o c) A type of hardware
o d) A user command
2. Which of the following is not a valid process state?
o a) New
o b) Ready
o c) Scheduled
o d) Terminated
3. What is the role of the CPU scheduler?
o a) To allocate memory
o b) To select the next process to run
o c) To manage files
o d) To manage network connections
4. Which of the following is a non-preemptive scheduling algorithm?
o a) Round Robin
o b) Shortest Job First (SJF)
o c) Multilevel Queue
o d) Multilevel Feedback Queue
5. What does the term 'time slice' refer to in the context of CPU scheduling?
 o a) The total time a process runs
o b) The amount of time a process is allowed to run before being preempted
o c) The time taken to complete an I/O operation
o d) The time taken to switch between processes
6. Which scheduling algorithm is designed to minimize the average waiting time?
o a) First-Come, First-Served (FCFS)
o b) Shortest Job First (SJF)
o c) Round Robin
o d) Priority Scheduling
7. What is a process control block (PCB)?
o a) A data structure that contains information about a process
o b) A type of process state
o c) A scheduling algorithm
o d) A memory management technique
8. In which scheduling algorithm are processes permanently assigned to a queue
based on their priority?
o a) Round Robin
o b) Multilevel Queue
o c) Shortest Job First (SJF)
o d) Priority Scheduling
9. Which of the following can cause a running process to become blocked?
o a) Completion of an I/O operation
o b) Requesting an I/O operation
o c) Reaching its maximum allowable time for uninterrupted execution
o d) Completion of the process
10. What is the primary goal of CPU scheduling?
o a) To minimize memory usage
o b) To maximize CPU utilization
o c) To maximize the number of processes
o d) To minimize network latency

11. If a process moves from the running state to the ready state, which of the
following might have caused this transition?
o a) Process completion
o b) Waiting for I/O completion
o c) Time slice expiration
o d) Process creation
12. In a Multilevel Queue scheduling algorithm, processes are classified into queues
based on which of the following?
o a) Process priority
o b) Process burst time
o c) Process arrival time
o d) Process memory requirements

Additional Conceptual Questions

21. What is the purpose of the 'aging' technique in Priority Scheduling?

o a) To prevent starvation
o b) To increase CPU utilization
 o c) To minimize turnaround time
o d) To reduce waiting time
22. Which of the following best describes the Round Robin scheduling algorithm?
o a) Processes are assigned to the CPU in the order they request it.
o b) Processes are assigned to the CPU based on the shortest burst time.
o c) Processes are assigned to the CPU in a circular manner with a fixed
time slice.
o d) Processes are assigned to the CPU based on their priority.
23. In the context of CPU scheduling, what is 'throughput'?
o a) The total time taken to complete a single process
o b) The number of processes completed in a unit of time
o c) The total waiting time for all processes
o d) The average turnaround time for all processes
24. What is 'turnaround time' in CPU scheduling?
o a) The time taken for a process to complete execution after it starts running
o b) The total time taken from process submission to process completion
o c) The time taken for a process to wait in the ready queue
o d) The time taken for a process to perform I/O operations
25. Which scheduling algorithm could potentially cause starvation if not managed
properly?
o a) First-Come, First-Served (FCFS)
o b) Round Robin
o c) Shortest Job First (SJF)
o d) Priority Scheduling
26. What is 'context switching' in CPU scheduling?
o a) The process of switching from one CPU to another
o b) The process of storing and restoring the state of a CPU so that a
process can resume execution
o c) The process of changing the state of a process from ready to running
o d) The process of moving a process from blocked to ready state
27. Which of the following is a benefit of using the Round Robin scheduling
algorithm?
o a) It minimizes the average waiting time.
o b) It provides a fair allocation of CPU time to all processes.
o c) It reduces the context switching overhead.
o d) It guarantees the shortest turnaround time.
28. In the context of CPU scheduling, what is 'burst time'?
o a) The total time taken to complete a process
o b) The time taken by a process for its CPU execution
o c) The time taken for I/O operations
o d) The time taken for process creation
29. Which scheduling algorithm uses a queue to manage the processes waiting for
CPU time?
o a) First-Come, First-Served (FCFS)
o b) Shortest Job First (SJF)
o c) Round Robin
o d) Priority Scheduling
30. In a Multilevel Feedback Queue scheduling algorithm, why are processes moved
between queues?
 o a) To balance the load among different queues
o b) To ensure higher priority processes get more CPU time
o c) To prevent starvation by moving processes that use too much CPU time
to lower priority queues
o d) To minimize memory usage

Conceptual Questions

1. What is virtual memory?

o a) Physical memory used by the system
o b) Memory that appears to be larger than the physical memory
o c) Temporary storage on the hard disk
o d) Memory reserved for the operating system
2. Which memory management technique breaks physical memory into fixed-sized
blocks?
o a) Segmentation
o b) Paging
o c) Swapping
o d) Partitioning
3. What is the purpose of a page table in the paging memory management scheme?
o a) To store data permanently
o b) To keep track of pages in physical memory
o c) To schedule processes
o d) To manage file systems
4. What is a page fault?
o a) A memory access error
o b) When a process tries to use a page not currently in memory
o c) A segmentation error
o d) An error in virtual memory allocation
5. What does 'demand paging' refer to?
o a) Loading all pages of a process at once
o b) Loading pages into memory only when they are needed
o c) Swapping entire processes between memory and disk
o d) Allocating memory segments on demand
6. In demand paging, what is a 'pager'?
o a) A hardware component
o b) A software component that decides which pages to bring into memory
o c) A type of memory management unit
o d) A process scheduler
7. Which of the following algorithms is not used for page replacement?
o a) First In First Out (FIFO)
o b) Least Recently Used (LRU)
o c) Optimal
o d) Shortest Job First (SJF)
8. What is segmentation in memory management?
o a) Dividing memory into fixed-size blocks
o b) Dividing memory into variable-sized segments
o c) Swapping pages between memory and disk
o d) Allocating memory dynamically
 9. Which of the following best describes 'thrashing'?
o a) High CPU utilization due to frequent context switches
o b) High page replacement activity leading to low CPU utilization
o c) Low memory usage due to efficient paging
o d) High memory usage with minimal page faults
10. What is the difference between demand paging and demand segmentation?
o a) Paging divides memory into fixed-sized pages, segmentation into variable-
sized segments
o b) Segmentation is faster than paging
o c) Paging uses a page table, segmentation uses a segment table
o d) Both a and c

Calculation-Based Questions

11. Given the reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1, with 3

frames, calculate the number of page faults using FIFO.
o a) 12
o b) 14
o c) 15
o d) 16
12. Using the same reference string (7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1),
calculate the number of page faults using the Optimal algorithm.
o a) 7
o b) 8
o c) 9
o d) 10
13. Calculate the number of page faults using the LRU algorithm for the reference
string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1, with 3 frames.
o a) 10
o b) 11
o c) 12
o d) 13
14. For a reference string 1, 3, 0, 3, 5, 6, 3, 5, 6, 1, 2, 3, 0, 4, 5, 6, with 4 frames,
calculate the number of page faults using FIFO.
o a) 9
o b) 10
o c) 11
o d) 12
15. Using the same reference string (1, 3, 0, 3, 5, 6, 3, 5, 6, 1, 2, 3, 0, 4, 5, 6), calculate
the number of page faults using the Optimal algorithm.
o a) 6
o b) 7
o c) 8
o d) 9
16. Calculate the number of page faults using the LRU algorithm for the reference
string 1, 3, 0, 3, 5, 6, 3, 5, 6, 1, 2, 3, 0, 4, 5, 6, with 4 frames.
o a) 8
o b) 9
o c) 10
 o d) 12
17. In the Optimal page replacement algorithm, how is the page to be replaced
selected?
o a) The oldest page in memory
o b) The page that will not be used for the longest period of time
o c) The page that was used most recently
o d) The page with the lowest priority

Additional Conceptual Questions

21. What is the main advantage of the Optimal page replacement algorithm?
o a) It is easy to implement
o b) It provides the lowest possible page fault rate
o c) It requires minimal hardware support
o d) It does not require future knowledge of the reference string
22. What is Belady’s Anomaly?
o a) The phenomenon where increasing the number of frames increases the
number of page faults
o b) The phenomenon where decreasing the number of frames decreases the
number of page faults
o c) The phenomenon where the oldest page is replaced first
o d) The phenomenon where the most frequently used page is replaced first
23. Which page replacement algorithm suffers from Belady’s Anomaly?
o a) FIFO
o b) Optimal
o c) LRU
o d) Random
24. What is the purpose of a frame in the context of paging?
o a) To store a process in secondary memory
o b) To store a fixed-size block of physical memory
o c) To store variable-sized segments
o d) To swap processes between memory and disk
25. Which of the following describes the FIFO page replacement algorithm?
o a) It replaces the page that will not be used for the longest period of time
o b) It replaces the oldest page in memory
o c) It replaces the page that has not been used recently
o d) It replaces the page with the highest priority
26. What is the Least Recently Used (LRU) page replacement algorithm?
o a) An algorithm that replaces the page that will not be used for the longest
period of time
o b) An algorithm that replaces the oldest page in memory
o c) An algorithm that replaces the page that has not been used for the
longest period
o d) An algorithm that replaces the page with the lowest priority
27. Which of the following is true about page faults?
o a) They occur when a page is found in memory
o b) They occur when a page is not found in memory
o c) They are always harmful to system performance
o d) They never occur in a well-optimized system
 28. What is a victim page in the context of page replacement?
o a) A page that is frequently accessed
o b) A page that is selected for replacement
o c) A page that is newly loaded into memory
o d) A page that causes a page fault
29. Which memory management scheme allows sharing of segments among
processes?
o a) Paging
o b) Segmentation
o c) Swapping
o d) Partitioning
30. What is the main disadvantage of the FIFO page replacement algorithm?
o a) It is difficult to implement
o b) It requires future knowledge of the reference string
o c) It suffers from Belady’s Anomaly
o d) It requires complex hardware support

Conceptual Questions

1. What is a process?
o a) A static program
o b) A program in execution
o c) A type of hardware
o d) A user command
2. Which of the following is a resource required by a process to complete its task?
o a) CPU time
o b) Memory
o c) Files
o d) All of the above
3. What does a process state diagram illustrate?
o a) The structure of a process
o b) The various states a process can be in
o c) The number of processes in the system
o d) The memory usage of a process
4. Which state does a process enter after it is created?
o a) Running
o b) Ready
o c) Blocked
o d) Terminated
5. In which state does a process use the CPU to execute its instructions?
o a) Ready
o b) Running
o c) Blocked
o d) Terminated
6. What causes a running process to move to the blocked state?
o a) Completion of execution
o b) Request for I/O operation
o c) Allocation of CPU
o d) Creation of a new process
 7. What is the role of the process control block (PCB)?
o a) To schedule processes
o b) To store information about a specific process
o c) To manage memory
o d) To handle I/O operations
8. Which of the following is not a possible transition between process states?
o a) Ready → Running
o b) Ready → New
o c) Blocked → Ready
o d) Running → Blocked
9. What information is contained in a PCB?
o a) Process state
o b) Program counter
o c) Memory limits
o d) All of the above
10. What does the program counter in a PCB indicate?
o a) The current state of the process
o b) The next instruction to be executed
o c) The priority of the process
o d) The memory allocated to the process

Calculation-Based Questions

11. If a system has 4 CPUs and 10 processes, what is the minimum number of
processes that can be in the ready, running, and blocked states combined?
o a) 4
o b) 5
o c) 7
o d) 10
12. Assuming a process P1 is in the ready state and is assigned the CPU, which state
will it move to?
o a) Blocked
o b) Running
o c) Terminated
o d) New
13. In a system with n CPUs, what is the maximum number of processes that can be
in the running state?
o a) 1
o b) n
o c) n+1
o d) 2n
14. If a process P2 has been running for its maximum allowable time slice and needs
more CPU time, which state will it move to?
o a) Blocked
o b) Ready
o c) Terminated
o d) New
15. In a system with a ready queue and a device queue, where is a process placed if it
issues an I/O request while running?
 o a) Ready queue
o b) Device queue
o c) Job queue
o d) Terminated queue
16. Calculate the total turnaround time for a process P3 that moves through the
states: Ready (2ms), Running (5ms), Blocked (3ms), Running (4ms).
o a) 9ms
o b) 10ms
o c) 12ms
o d) 14ms
17. If a process P4 completes its execution, which state will it move to?
o a) Blocked
o b) Terminated
o c) Ready
o d) New
18. In a system with 8 processes, if 3 are in the blocked state and 2 are running, how
many are in the ready state?
o a) 1
o b) 2
o c) 3
o d) 4
19. If a process P5 moves from the blocked state to the ready state, what event might
have occurred?
o a) Process termination
o b) I/O operation completion
o c) Process creation
o d) Memory allocation
20. If a process P6 is aborted due to an invalid instruction, which state will it move
to?
o a) Blocked
o b) Terminated
o c) Ready
o d) New

Additional Conceptual Questions

21. What is the difference between a process and a thread?

o a) A process is a unit of work, while a thread is a lightweight process
o b) A thread is a program, while a process is a part of a thread
o c) Both are the same
o d) A process is a parent, while a thread is a child
22. What is the purpose of process scheduling?
o a) To manage memory allocation
o b) To allocate CPU time to processes
o c) To manage I/O devices
o d) To handle user input
23. What is a cooperating process?
o a) A process that does not need to interact with other processes
o b) A process that affects or is affected by other processes
 o c) A process that is in the ready state
o d) A process that is in the blocked state
24. What is the main advantage of allowing cooperating processes?
o a) Increased CPU utilization
o b) Easier memory management
o c) Faster computation speed
o d) Simplified process creation
25. Which of the following is a type of thread?
o a) User thread
o b) System thread
o c) Kernel thread
o d) All of the above
26. What is a process table?
o a) A table that stores data for all files in the system
o b) A table that stores information about all processes in the system
o c) A table that stores user credentials
o d) A table that stores hardware information
27. In the process state diagram, which state comes immediately after the new state?
o a) Running
o b) Ready
o c) Blocked
o d) Terminated
28. What event can cause a process to move from the ready state to the running
state?
o a) Process creation
o b) I/O request
o c) CPU allocation
o d) Process termination
29. What is the main function of a scheduler dispatcher?
o a) To create new processes
o b) To move processes between the ready and running states
o c) To manage memory allocation
o d) To handle I/O operations
30. What is a mini lightweight process that can execute independently of other parts
of the process?
o a) A process
o b) A thread
o c) A subroutine
o d) A function

Conceptual Questions

1. What is the main goal of disk scheduling algorithms?

o a) To increase disk size
o b) To reduce seek time and rotational latency
o c) To improve user interface
o d) To manage network connections
2. Which of the following is a disk scheduling algorithm?
o a) FCFS
 o b) LRU
o c) SJF
o d) Round Robin
3. What is the simplest disk scheduling algorithm?
o a) SSTF
o b) SCAN
o c) FCFS
o d) C-LOOK
4. In FCFS disk scheduling, requests are serviced in what order?
o a) Order of priority
o b) Order of arrival
o c) Shortest seek time
o d) Random order
5. Which disk scheduling algorithm services the request closest to the current head
position?
o a) FCFS
o b) SSTF
o c) SCAN
o d) C-SCAN
6. What does SCAN disk scheduling algorithm also known as?
o a) Elevator algorithm
o b) Circular algorithm
o c) Linear algorithm
o d) Priority algorithm
7. Which of the following disk scheduling algorithms involves the disk arm moving
in one direction and then reversing at the end?
o a) FCFS
o b) SSTF
o c) SCAN
o d) LOOK
8. In the C-SCAN algorithm, what happens when the disk arm reaches the end of
the disk?
o a) It reverses direction and continues servicing requests
o b) It stops servicing requests and jumps back to the beginning
o c) It reverses direction without servicing requests
o d) It continues servicing requests in the same direction
9. What is the key difference between SCAN and C-SCAN disk scheduling
algorithms?
o a) SCAN services requests in a circular manner, while C-SCAN does not
o b) C-SCAN services requests only in one direction
o c) SCAN services requests only at the ends of the disk
o d) C-SCAN stops at the last request and reverses direction
10. Which disk scheduling algorithm is a variant of the SCAN algorithm and stops
at the last request?
o a) LOOK
o b) SSTF
o c) FCFS
o d) C-LOOK
Calculation-Based Questions

11. Calculate the total seek time using FCFS for the following queue of requests: 98,
183, 37, 122, 14, 124, 65, 67. The disk head starts at 53.
o a) 640
o b) 720
o c) 540
o d) 460
12. Calculate the total seek time using SSTF for the same queue of requests and
starting position.
o a) 236
o b) 320
o c) 420
o d) 300
13. Using the same queue and starting position, calculate the total seek time using
SCAN assuming the head initially moves towards 0.
o a) 200
o b) 252
o c) 300
o d) 350
14. Calculate the total seek time using C-SCAN for the same queue and starting
position.
o a) 382
o b) 420
o c) 300
o d) 350
15. Using the same queue and starting position, calculate the total seek time using
LOOK assuming the head initially moves towards 0.
o a) 208
o b) 252
o c) 300
o d) 350
16. Calculate the total seek time using C-LOOK for the same queue and starting
position.
o a) 322
o b) 420
o c) 300
o d) 350
17. If the current position of the disk head is 40, and the request queue is 10, 22, 20,
2, 40, 6, calculate the total seek time using SSTF.
o a) 54
o b) 38
o c) 50
o d) 60
18. Using the same queue and starting position, calculate the total seek time using
FCFS.
o a) 68
o b) 134
o c) 80
 o d) 60
19. Calculate the total seek time using SCAN for the same queue and starting
position assuming the head initially moves towards 0.
o a) 58
o b) 64
o c) 72
o d) 40
20. Using the same queue and starting position, calculate the total seek time using
LOOK assuming the head initially moves towards 0.
o a) 38
o b) 52
o c) 60
o d) 66

Additional Conceptual Questions

21. What is 'rotational latency' in the context of disk scheduling?

o a) The time it takes for the disk arm to move to the correct cylinder
o b) The time it takes for the desired sector to rotate under the disk head
o c) The time it takes to read a block of data from the disk
o d) The time it takes to write a block of data to the disk
22. What does 'seek time' refer to?
o a) The time it takes for the disk to start spinning
o b) The time it takes for the disk arm to move to the desired cylinder
o c) The time it takes to transfer data to/from the disk
o d) The time it takes for the disk to stop spinning
23. In disk scheduling, what is 'disk bandwidth'?
o a) The amount of data that can be transferred in a given time period
o b) The number of requests the disk can handle simultaneously
o c) The number of sectors the disk can read per minute
o d) The total number of bytes transferred divided by the total time
between the first request and the last transfer
24. Which of the following scheduling algorithms can lead to starvation if new
requests keep arriving?
o a) FCFS
o b) SSTF
o c) SCAN
o d) C-LOOK
25. What is the primary disadvantage of the FCFS disk scheduling algorithm?
o a) It is too complex to implement
o b) It can cause the "convoy effect" leading to long wait times
o c) It does not guarantee the shortest seek time
o d) It requires preemption of processes
26. Which disk scheduling algorithm is designed to prevent the starvation problem
found in SSTF?
o a) FCFS
o b) SCAN
o c) C-SCAN
o d) LOOK
27. What is the difference between LOOK and C-LOOK algorithms?
o a) LOOK services requests in a circular manner, while C-LOOK does not
o b) C-LOOK services requests only in one direction
o c) LOOK stops at the last request before reversing direction, while C-LOOK
continues to the end of the disk
o d) C-LOOK stops at the last request before reversing direction, while
LOOK continues to the end of the disk
28. Which disk scheduling algorithm works like the SCAN algorithm but with the
disk arm reversing direction without servicing requests?
o a) FCFS
o b) SSTF
o c) C-SCAN
o d) LOOK
29. What is 'seek time' in disk scheduling?
o a) The time taken to transfer data to/from the disk
o b) The time taken for the disk to rotate to the desired sector
o c) The time taken for the disk arm to move to the correct cylinder
o d) The time taken for the disk to stop spinning
30. Which disk scheduling algorithm can be compared to an elevator going up and
down servicing requests?
o a) FCFS
o b) SSTF
o c) SCAN
o d) C-LOOK