System-software-and-computing-concepts-ct123-3-1-mcq-practise-operating-system
.pdf
School
Asia Pacific University of Technology and Innovation**We aren't endorsed by this school
Course
BSCIT 1
Subject
Computer Science
Date
Jan 11, 2025
Pages
18
Uploaded by ChiefKomodoDragon4864
System-Software-and-Computing-Concepts-CT123-3-1 MCQPRACTISE (OPERATING SYSTEM)system software and computing concepts (Asia Pacific University of Technology andInnovation)Scan to open on StudocuStudocu is not sponsored or endorsed by any college or universitySystem-Software-and-Computing-Concepts-CT123-3-1 MCQPRACTISE (OPERATING SYSTEM)system software and computing concepts (Asia Pacific University of Technology andInnovation)Scan to open on StudocuStudocu is not sponsored or endorsed by any college or universityDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
Operating System Overview1.What is the primary purpose of an operating system?oa) To provide internet accessob) To integrate hardware resources and make them available to usersoc) To install softwareod) To play media files2.Which of the following is a basic service provided by an operating system?oa) Virus scanningob) Hardware integration and resource managementoc) Email managementod) Document editing3.What is the term for the part of the operating system that is always loaded into memory?oa) Bootloaderob) Kerneloc) Shellod) Command processor4.What does 'multitasking' in an operating system refer to?oa) The ability to run multiple operating systems simultaneouslyob) The concurrent execution of multiple programs on a single CPUoc) The ability to connect to multiple networksod) The ability to store multiple files5.Which component of the operating system manages file creation, deletion, and manipulation?oa) Command processorob) File management systemoc) Process schedulerod) Memory manager6.What is 'bootstrapping' in the context of operating systems?oa) The process of installing new softwareob) The process of starting the computer and loading the operating systemoc) The process of backing up dataod) The process of updating the system7.In a multitasking operating system, what is a 'time slice'?oa) A period during which a program can execute before the next programis scheduledob) The total time taken to boot the systemoc) The time taken to install an applicationod) The time taken to shut down the system8.Which type of operating system is designed for real-time applications where timeconstraints are critical?oa) Batch processing systemsob) Real-time systemsoc) Distributed systemsod) Mainframe systems9.What is the role of the 'shell' in an operating system?oa) To manage hardware resourcesob) To provide a user interface and command processorDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oc) To manage network connectionsod) To allocate memory10.What is the function of the 'memory manager' in an operating system?oa) To manage network trafficob) To manage the allocation and deallocation of memoryoc) To manage file permissionsod) To manage user accountsProcess Control and Scheduling11.What is a 'process' in the context of operating systems?oa) A software installationob) An executing programoc) A user login sessionod) A network connection12.Which scheduling algorithm allocates the CPU based on the shortest remaining time first?oa) First-Come, First-Served (FCFS)ob) Round Robinoc) Shortest Job Next (SJN)od) Multilevel Queue13.What is a 'context switch'?oa) The process of switching from one operating system to anotherob) The process of transferring control from one process to anotheroc) The process of logging out a userod) The process of installing software14.Which scheduling algorithm is designed to prevent starvation?oa) First-Come, First-Served (FCFS)ob) Round Robinoc) Shortest Job First (SJF)od) Priority Scheduling15.In the context of process management, what is a 'thread'?oa) A user commandob) An individually executable part of a processoc) A network packetod) A file in the systemMemory Management16.What is the primary purpose of memory management in an operating system?oa) To manage user accountsob) To control access to network resourcesoc) To allocate and deallocate memory to programsod) To manage file storage17.What is 'virtual memory'?oa) The memory located on a USB driveob) An illusion of a large memory created by using disk storageoc) The memory in the CPU cacheod) A type of read-only memoryDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
18.Which memory allocation algorithm allocates the smallest free block that is sufficient for the process?oa) First Fitob) Best Fitoc) Worst Fitod) Next Fit19.What is 'fragmentation' in the context of memory management?oa) The process of backing up dataob) The process of dividing memory into fixed-size blocksoc) The inefficient use of memory where small, unused spaces are leftod) The process of defragmenting the hard drive20.What does 'paging' refer to in memory management?oa) Dividing memory into fixed-size pagesob) Allocating memory to user processesoc) Swapping data between the CPU and the hard driveod) Managing the virtual memoryFile Management and Security21.What is the purpose of a file management system in an operating system?oa) To manage network connectionsob) To manage user loginsoc) To organize, store, retrieve, and manipulate filesod) To control access to hardware devices22.What is a 'directory' in the context of file management?oa) A command used to delete filesob) A file that contains a list of other files and their attributesoc) A program used to manage user accountsod) A type of system memory23.Which file management feature helps recover files in case of a system crash?oa) File compressionob) File auditingoc) File journalingod) File encryption24.What is the main purpose of security and protection services in an operating system?oa) To speed up the systemob) To protect the OS and users from unauthorized access and actionsoc) To manage user accountsod) To manage file storage25.Which security feature prevents unauthorized access to the system?oa) File compressionob) User authenticationoc) Disk defragmentationod) Task schedulingNetwork and Communication Services26.What is the role of the TCP/IP protocol suite in an operating system?Downloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oa) To manage user accountsob) To enable network communication and data transferoc) To manage file storageod) To control hardware devices27.Which network application allows users to remotely access another computer?oa) Emailob) Web servicesoc) Remote loginod) Streaming multimedia28.What is a 'VPN' in the context of network services?oa) Virtual Private Networkob) Very Powerful Networkoc) Virtual Processing Nodeod) Verified Public Network29.What is the primary purpose of communication services in an operating system?oa) To manage user loginsob) To facilitate communication between software and the OSoc) To control hardware devicesod) To manage file storage30.Which component of system administration support is responsible for setting group policies?oa) Network administrationob) System configurationoc) Software installationsod) BackupsConceptual Questions1.What is a process in the context of an operating system?oa) A software packageob) A program in executionoc) A type of hardwareod) A user command2.Which of the following is not a valid process state?oa) Newob) Readyoc) Scheduledod) Terminated3.What is the role of the CPU scheduler?oa) To allocate memoryob) To select the next process to runoc) To manage filesod) To manage network connections4.Which of the following is a non-preemptive scheduling algorithm?oa) Round Robinob) Shortest Job First (SJF)oc) Multilevel Queueod) Multilevel Feedback Queue5.What does the term 'time slice' refer to in the context of CPU scheduling?Downloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oa) The total time a process runsob) The amount of time a process is allowed to run before being preemptedoc) The time taken to complete an I/O operationod) The time taken to switch between processes6.Which scheduling algorithm is designed to minimize the average waiting time?oa) First-Come, First-Served (FCFS)ob) Shortest Job First (SJF)oc) Round Robinod) Priority Scheduling7.What is a process control block (PCB)?oa) A data structure that contains information about a processob) A type of process stateoc) A scheduling algorithmod) A memory management technique8.In which scheduling algorithm are processes permanently assigned to a queue based on their priority?oa) Round Robinob) Multilevel Queueoc) Shortest Job First (SJF)od) Priority Scheduling9.Which of the following can cause a running process to become blocked?oa) Completion of an I/O operationob) Requesting an I/O operationoc) Reaching its maximum allowable time for uninterrupted executionod) Completion of the process10.What is the primary goal of CPU scheduling?oa) To minimize memory usageob) To maximize CPU utilizationoc) To maximize the number of processesod) To minimize network latency11.If a process moves from the running state to the ready state, which of the following might have caused this transition?oa) Process completionob) Waiting for I/O completionoc) Time slice expirationod) Process creation12.In a Multilevel Queue scheduling algorithm, processes are classified into queues based on which of the following?oa) Process priorityob) Process burst timeoc) Process arrival timeod) Process memory requirementsAdditional Conceptual Questions21.What is the purpose of the 'aging' technique in Priority Scheduling?oa) To prevent starvationob) To increase CPU utilizationDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oc) To minimize turnaround timeod) To reduce waiting time22.Which of the following best describes the Round Robin scheduling algorithm?oa) Processes are assigned to the CPU in the order they request it.ob) Processes are assigned to the CPU based on the shortest burst time.oc) Processes are assigned to the CPU in a circular manner with a fixed time slice.od) Processes are assigned to the CPU based on their priority.23.In the context of CPU scheduling, what is 'throughput'?oa) The total time taken to complete a single processob) The number of processes completed in a unit of timeoc) The total waiting time for all processesod) The average turnaround time for all processes24.What is 'turnaround time' in CPU scheduling?oa) The time taken for a process to complete execution after it starts runningob) The total time taken from process submission to process completionoc) The time taken for a process to wait in the ready queueod) The time taken for a process to perform I/O operations25.Which scheduling algorithm could potentially cause starvation if not managed properly?oa) First-Come, First-Served (FCFS)ob) Round Robinoc) Shortest Job First (SJF)od) Priority Scheduling26.What is 'context switching' in CPU scheduling?oa) The process of switching from one CPU to anotherob) The process of storing and restoring the state of a CPU so that a process can resume executionoc) The process of changing the state of a process from ready to runningod) The process of moving a process from blocked to ready state27.Which of the following is a benefit of using the Round Robin scheduling algorithm?oa) It minimizes the average waiting time.ob) It provides a fair allocation of CPU time to all processes.oc) It reduces the context switching overhead.od) It guarantees the shortest turnaround time.28.In the context of CPU scheduling, what is 'burst time'?oa) The total time taken to complete a processob) The time taken by a process for its CPU executionoc) The time taken for I/O operationsod) The time taken for process creation29.Which scheduling algorithm uses a queue to manage the processes waiting for CPU time?oa) First-Come, First-Served (FCFS)ob) Shortest Job First (SJF)oc) Round Robinod) Priority Scheduling30.In a Multilevel Feedback Queue scheduling algorithm, why are processes moved between queues?Downloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oa) To balance the load among different queuesob) To ensure higher priority processes get more CPU timeoc) To prevent starvation by moving processes that use too much CPU timeto lower priority queuesod) To minimize memory usageConceptual Questions1.What is virtual memory?oa) Physical memory used by the systemob) Memory that appears to be larger than the physical memoryoc) Temporary storage on the hard diskod) Memory reserved for the operating system2.Which memory management technique breaks physical memory into fixed-sized blocks?oa) Segmentationob) Pagingoc) Swappingod) Partitioning3.What is the purpose of a page table in the paging memory management scheme?oa) To store data permanentlyob) To keep track of pages in physical memoryoc) To schedule processesod) To manage file systems4.What is a page fault?oa) A memory access errorob) When a process tries to use a page not currently in memoryoc) A segmentation errorod) An error in virtual memory allocation5.What does 'demand paging' refer to?oa) Loading all pages of a process at onceob) Loading pages into memory only when they are neededoc) Swapping entire processes between memory and diskod) Allocating memory segments on demand6.In demand paging, what is a 'pager'?oa) A hardware componentob) A software component that decides which pages to bring into memoryoc) A type of memory management unitod) A process scheduler7.Which of the following algorithms is not used for page replacement?oa) First In First Out (FIFO)ob) Least Recently Used (LRU)oc) Optimalod) Shortest Job First (SJF)8.What is segmentation in memory management?oa) Dividing memory into fixed-size blocksob) Dividing memory into variable-sized segmentsoc) Swapping pages between memory and diskod) Allocating memory dynamicallyDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
9.Which of the following best describes 'thrashing'?oa) High CPU utilization due to frequent context switchesob) High page replacement activity leading to low CPU utilizationoc) Low memory usage due to efficient pagingod) High memory usage with minimal page faults10.What is the difference between demand paging and demand segmentation?oa) Paging divides memory into fixed-sized pages, segmentation into variable-sized segmentsob) Segmentation is faster than pagingoc) Paging uses a page table, segmentation uses a segment tableod) Both a and cCalculation-Based Questions11.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.oa) 12ob) 14oc) 15od) 1612.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.oa) 7ob) 8oc) 9od) 1013.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.oa) 10ob) 11oc) 12od) 1314.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.oa) 9ob) 10oc) 11od) 1215.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.oa) 6ob) 7oc) 8od) 916.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.oa) 8ob) 9oc) 10Downloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
od) 1217.In the Optimal page replacement algorithm, how is the page to be replaced selected?oa) The oldest page in memoryob) The page that will not be used for the longest period of timeoc) The page that was used most recentlyod) The page with the lowest priorityAdditional Conceptual Questions21.What is the main advantage of the Optimal page replacement algorithm?oa) It is easy to implementob) It provides the lowest possible page fault rateoc) It requires minimal hardware supportod) It does not require future knowledge of the reference string22.What is Belady’s Anomaly?oa) The phenomenon where increasing the number of frames increases the number of page faultsob) The phenomenon where decreasing the number of frames decreases the number of page faultsoc) The phenomenon where the oldest page is replaced firstod) The phenomenon where the most frequently used page is replaced first23.Which page replacement algorithm suffers from Belady’s Anomaly?oa) FIFOob) Optimaloc) LRUod) Random24.What is the purpose of a frame in the context of paging?oa) To store a process in secondary memoryob) To store a fixed-size block of physical memoryoc) To store variable-sized segmentsod) To swap processes between memory and disk25.Which of the following describes the FIFO page replacement algorithm?oa) It replaces the page that will not be used for the longest period of timeob) It replaces the oldest page in memoryoc) It replaces the page that has not been used recentlyod) It replaces the page with the highest priority26.What is the Least Recently Used (LRU) page replacement algorithm?oa) An algorithm that replaces the page that will not be used for the longest period of timeob) An algorithm that replaces the oldest page in memoryoc) An algorithm that replaces the page that has not been used for the longest periodod) An algorithm that replaces the page with the lowest priority27.Which of the following is true about page faults?oa) They occur when a page is found in memoryob) They occur when a page is not found in memoryoc) They are always harmful to system performanceod) They never occur in a well-optimized systemDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
28.What is a victim page in the context of page replacement?oa) A page that is frequently accessedob) A page that is selected for replacementoc) A page that is newly loaded into memoryod) A page that causes a page fault29.Which memory management scheme allows sharing of segments among processes?oa) Pagingob) Segmentationoc) Swappingod) Partitioning30.What is the main disadvantage of the FIFO page replacement algorithm?oa) It is difficult to implementob) It requires future knowledge of the reference stringoc) It suffers from Belady’s Anomalyod) It requires complex hardware supportConceptual Questions1.What is a process?oa) A static programob) A program in executionoc) A type of hardwareod) A user command2.Which of the following is a resource required by a process to complete its task?oa) CPU timeob) Memoryoc) Filesod) All of the above3.What does a process state diagram illustrate?oa) The structure of a processob) The various states a process can be inoc) The number of processes in the systemod) The memory usage of a process4.Which state does a process enter after it is created?oa) Runningob) Readyoc) Blockedod) Terminated5.In which state does a process use the CPU to execute its instructions?oa) Readyob) Runningoc) Blockedod) Terminated6.What causes a running process to move to the blocked state?oa) Completion of executionob) Request for I/O operationoc) Allocation of CPUod) Creation of a new processDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
7.What is the role of the process control block (PCB)?oa) To schedule processesob) To store information about a specific processoc) To manage memoryod) To handle I/O operations8.Which of the following is not a possible transition between process states?oa) Ready → Runningob) Ready → Newoc) Blocked → Readyod) Running → Blocked9.What information is contained in a PCB?oa) Process stateob) Program counteroc) Memory limitsod) All of the above10.What does the program counter in a PCB indicate?oa) The current state of the processob) The next instruction to be executedoc) The priority of the processod) The memory allocated to the processCalculation-Based Questions11.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?oa) 4ob) 5oc) 7od) 1012.Assuming a process P1 is in the ready state and is assigned the CPU, which state will it move to?oa) Blockedob) Runningoc) Terminatedod) New13.In a system with n CPUs, what is the maximum number of processes that can be in the running state?oa) 1ob) noc) n+1od) 2n14.If a process P2 has been running for its maximum allowable time slice and needs more CPU time, which state will it move to?oa) Blockedob) Readyoc) Terminatedod) New15.In a system with a ready queue and a device queue, where is a process placed if itissues an I/O request while running?Downloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oa) Ready queueob) Device queueoc) Job queueod) Terminated queue16.Calculate the total turnaround time for a process P3 that moves through the states: Ready (2ms), Running (5ms), Blocked (3ms), Running (4ms).oa) 9msob) 10msoc) 12msod) 14ms17.If a process P4 completes its execution, which state will it move to?oa) Blockedob) Terminatedoc) Readyod) New18.In a system with 8 processes, if 3 are in the blocked state and 2 are running, how many are in the ready state?oa) 1ob) 2oc) 3od) 419.If a process P5 moves from the blocked state to the ready state, what event mighthave occurred?oa) Process terminationob) I/O operation completionoc) Process creationod) Memory allocation20.If a process P6 is aborted due to an invalid instruction, which state will it move to?oa) Blockedob) Terminatedoc) Readyod) NewAdditional Conceptual Questions21.What is the difference between a process and a thread?oa) A process is a unit of work, while a thread is a lightweight processob) A thread is a program, while a process is a part of a threadoc) Both are the sameod) A process is a parent, while a thread is a child22.What is the purpose of process scheduling?oa) To manage memory allocationob) To allocate CPU time to processesoc) To manage I/O devicesod) To handle user input23.What is a cooperating process?oa) A process that does not need to interact with other processesob) A process that affects or is affected by other processesDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
oc) A process that is in the ready stateod) A process that is in the blocked state24.What is the main advantage of allowing cooperating processes?oa) Increased CPU utilizationob) Easier memory managementoc) Faster computation speedod) Simplified process creation25.Which of the following is a type of thread?oa) User threadob) System threadoc) Kernel threadod) All of the above26.What is a process table?oa) A table that stores data for all files in the systemob) A table that stores information about all processes in the systemoc) A table that stores user credentialsod) A table that stores hardware information27.In the process state diagram, which state comes immediately after the new state?oa) Runningob) Readyoc) Blockedod) Terminated28.What event can cause a process to move from the ready state to the running state?oa) Process creationob) I/O requestoc) CPU allocationod) Process termination29.What is the main function of a scheduler dispatcher?oa) To create new processesob) To move processes between the ready and running statesoc) To manage memory allocationod) To handle I/O operations30.What is a mini lightweight process that can execute independently of other parts of the process?oa) A processob) A threadoc) A subroutineod) A functionConceptual Questions1.What is the main goal of disk scheduling algorithms?oa) To increase disk sizeob) To reduce seek time and rotational latencyoc) To improve user interfaceod) To manage network connections2.Which of the following is a disk scheduling algorithm?oa) FCFSDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
ob) LRUoc) SJFod) Round Robin3.What is the simplest disk scheduling algorithm?oa) SSTFob) SCANoc) FCFSod) C-LOOK4.In FCFS disk scheduling, requests are serviced in what order?oa) Order of priorityob) Order of arrivaloc) Shortest seek timeod) Random order5.Which disk scheduling algorithm services the request closest to the current head position?oa) FCFSob) SSTFoc) SCANod) C-SCAN6.What does SCAN disk scheduling algorithm also known as?oa) Elevator algorithmob) Circular algorithmoc) Linear algorithmod) Priority algorithm7.Which of the following disk scheduling algorithms involves the disk arm moving in one direction and then reversing at the end?oa) FCFSob) SSTFoc) SCANod) LOOK8.In the C-SCAN algorithm, what happens when the disk arm reaches the end of the disk?oa) It reverses direction and continues servicing requestsob) It stops servicing requests and jumps back to the beginningoc) It reverses direction without servicing requestsod) It continues servicing requests in the same direction9.What is the key difference between SCAN and C-SCAN disk scheduling algorithms?oa) SCAN services requests in a circular manner, while C-SCAN does notob) C-SCAN services requests only in one directionoc) SCAN services requests only at the ends of the diskod) C-SCAN stops at the last request and reverses direction10.Which disk scheduling algorithm is a variant of the SCAN algorithm and stops at the last request?oa) LOOKob) SSTFoc) FCFSod) C-LOOKDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
Calculation-Based Questions11.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.oa) 640ob) 720oc) 540od) 46012.Calculate the total seek time using SSTF for the same queue of requests and starting position.oa) 236ob) 320oc) 420od) 30013.Using the same queue and starting position, calculate the total seek time using SCAN assuming the head initially moves towards 0.oa) 200ob) 252oc) 300od) 35014.Calculate the total seek time using C-SCAN for the same queue and starting position.oa) 382ob) 420oc) 300od) 35015.Using the same queue and starting position, calculate the total seek time using LOOK assuming the head initially moves towards 0.oa) 208ob) 252oc) 300od) 35016.Calculate the total seek time using C-LOOK for the same queue and starting position.oa) 322ob) 420oc) 300od) 35017.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.oa) 54ob) 38oc) 50od) 6018.Using the same queue and starting position, calculate the total seek time using FCFS.oa) 68ob) 134oc) 80Downloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
od) 6019.Calculate the total seek time using SCAN for the same queue and starting position assuming the head initially moves towards 0.oa) 58ob) 64oc) 72od) 4020.Using the same queue and starting position, calculate the total seek time using LOOK assuming the head initially moves towards 0.oa) 38ob) 52oc) 60od) 66Additional Conceptual Questions21.What is 'rotational latency' in the context of disk scheduling?oa) The time it takes for the disk arm to move to the correct cylinderob) The time it takes for the desired sector to rotate under the disk headoc) The time it takes to read a block of data from the diskod) The time it takes to write a block of data to the disk22.What does 'seek time' refer to?oa) The time it takes for the disk to start spinningob) The time it takes for the disk arm to move to the desired cylinderoc) The time it takes to transfer data to/from the diskod) The time it takes for the disk to stop spinning23.In disk scheduling, what is 'disk bandwidth'?oa) The amount of data that can be transferred in a given time periodob) The number of requests the disk can handle simultaneouslyoc) The number of sectors the disk can read per minuteod) The total number of bytes transferred divided by the total time between the first request and the last transfer24.Which of the following scheduling algorithms can lead to starvation if new requests keep arriving?oa) FCFSob) SSTFoc) SCANod) C-LOOK25.What is the primary disadvantage of the FCFS disk scheduling algorithm?oa) It is too complex to implementob) It can cause the "convoy effect" leading to long wait timesoc) It does not guarantee the shortest seek timeod) It requires preemption of processes26.Which disk scheduling algorithm is designed to prevent the starvation problem found in SSTF?oa) FCFSob) SCANoc) C-SCANod) LOOKDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739
27.What is the difference between LOOK and C-LOOK algorithms?oa) LOOK services requests in a circular manner, while C-LOOK does notob) C-LOOK services requests only in one directionoc) LOOK stops at the last request before reversing direction, while C-LOOK continues to the end of the diskod) C-LOOK stops at the last request before reversing direction, while LOOK continues to the end of the disk28.Which disk scheduling algorithm works like the SCAN algorithm but with the disk arm reversing direction without servicing requests?oa) FCFSob) SSTFoc) C-SCANod) LOOK29.What is 'seek time' in disk scheduling?oa) The time taken to transfer data to/from the diskob) The time taken for the disk to rotate to the desired sectoroc) The time taken for the disk arm to move to the correct cylinderod) The time taken for the disk to stop spinning30.Which disk scheduling algorithm can be compared to an elevator going up and down servicing requests?oa) FCFSob) SSTFoc) SCANod) C-LOOKDownloaded by Prachee Mahato (prachee.2063@gmail.com)lOMoARcPSD|39067739