MAHA BARATHI ENGINEERING COLLEGE IL-9, SALEM-CHENNAI HIGHWAY, A.VASUDEVANUR, CHINNASALEM (TK), KALLAKURICHI (DT) 606 201 Approved by AICTE, New Delhi & Affiliated to Anna University, Chennai 2(f) & 12(B) status of UGC, New Delhi wuwambec.acin | Ph: 04151-25633, 257333 | E-mail: mbecl23@gmail.com DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK IL YEAR IV SEMESTER CS 3451 OPERATING SYSTEM REGULATION 2021 Academic Year 2022 -2023 Prepared by Mrs.P.Jeevitha, M.E., AP/CSEQUESTION BANK SUBJECT : CS3451- OPERATING SYSTEM UNITT INTRODUCTION | (Computer System - Elements and organization; Operating System Overview - Objectives ar [Functions - Evolution of Operating System; Operating System Structures — Operating Syste! Eurvices - User Operating System Interface - System Calls ~ System Programs - Design and Implementation - Structuring methods. PART A Q.No BT | Competence Questions Level 1. | What are the objectives of operating system? BTL1__|Remember ‘2. | What are the advantages of peer-to-peer systems BTL1__|Remember 3._| What is the purpose of system programs/system calls? BTL2_|Understand 4._| How does an interrupt differ from a trap? BTL1_|Remember &._| What are disadvantages of multi-processor systems?( BTL1 | Analyze 6. Defend timesharing differ from multiprogramming? If so, how? BTL5 |Understand 7._| Why API's need to be used rather than system call? BTL1 |Remember 8. | Compare and contrast DMA and cache memory Compare BTL2 |Remember 9. | Distinguish between batch systems and time sharing systems BTL4 |Analyze 10. | What are privileged instructions? BTL1 [Remember 71, | What do you mean by system calls? BTLt_|Apply 72,_| Define: process BTL4 [Analyze 73, | What is process control block? BTL2 _|Understand 74, | What is scheduler? BTL2_ [Understand 75. | Define inter process communication. BTL1__|Remember <6--| Taentify the difference between mainframe and desktop operating} BTL3_ [Apply system. 17. What is bootstrap program? BTL1_|Remember 78. | Mustrate the different interrupt clauses. BTL2 _|Understand 79.1 Distinguish between hard real ime systems and soft real time | BTL4 [Analyze 20. SSAC The Use of fork and exeo system calls. BTL2 _|Understand Zi] What are the three main purposes of an operating system? BTL! [Remember 2a | What is the purpose of system calls? BTL1__|Remember 33 | What is an Operating system? BTL1__|Remember Fa | List the services provided by an ‘Operating System? BTL1 |Remember |The Kemel? BTL1__|Remember 26] Whatis the | 26 | What are the five major categories of System Calls? BTL1_|Remember | PART—B [ 7. I Explain different operating system structures with neat sketch. BTLS_ | Evaluate 2. | Explain the various types of system calls with examples. BTL5S | Evaluate 3. | What are the advantages and disadvantages of using the same a system call interface for both files and devices. BTL1 |Remé ‘4. | Discuss in detail about Distributed systems. | | BTL6 | Create %. | Demonstrate the three methods for passing parameters to the OS) pTL2 | Understand | oe 8. | Explain how protection is provided for the hardware resources by | orig [evaluate the operating system, F 7 I List the various services provided by operating system BTL1 [Remember PART-C 1, | Demonstrate the three methods for passing parameters to the OS|ptL2 |Understand with example 2.| Explain how protection is provided for the hardware resources by the operating system. BTLS [Evaluate 3. | List the various services provided by operaling syslems. | " Scena BTL1_|Remember 4 | With neat sketch, discuss about computer system overview. BTL6_| Create 5 | Give reasons why caches are useful. What problems do they solve and cause? If a catch can be made as large as the BTL6 | Create device for which it is catching why not make it that large and eliminate the device. 6 7 Discuss the functionality of system boot with respect to an BTLs | Evaluate operating system. Zilia - . Discuss the essential properties of the following types of BTLS | Evaluate systems, i) Time sharing systems ii) Multiprocessor systems iii) Distributed systemsUNIT IT- PROCESS MANAGEMENT ommunieation; CPU Scheduling - Scheduling criteria - Scheduling algorithms: Threads Comme = Process Concept - Process Scheduling - Operations on Processes - Inter-process) Synchronization hardware — Semaphores — Mutex - Class Monitors; Deadlock - Methods for han avoidance, Deadlock detection, Recovery from deadlock. lultithread Models - Threading issues; Process Synchronization - The Critical-Section problem) al problems of synchronization g deadlocks, Deadlock prevention, Deadloc! PART-A ) 1. T Compare and contrast Single-threaded and muli-threaded BTL2 | Understand process. 2. | priority inversion is a condition that occurs in real time systems — | BTL4 | Analyze Analyzing on this statement. 3- | Distinguish between CPU bounded, /O bounded processes. BTL4 | Analyze 4. | What resources are required to Creating threads? (Nov/Dec 2016 | BTL1_| Remember 5. | Under what circumstances user level threads are better than the | BTL1 | Remember kernel level threads? 6. | What is the meaning of the term busy waiting? BTL1_| Remember 7._| List out the data fields associated with process control blocks. BTL1_| Remember B.__| Define the term ‘Dispatch Latency BTL1_| Remember 9 | Whatis the concept behind strong semaphore and spinlock? BTL1_| Remember 10. | What is a thread? BTL1_| Remember 11. | what are the benefits of multithreaded programming? BTL2__| Understand 12. | Distinguish between user-level threads and kernel-level threads? | BTL1 | Remember Under what circumstances is one type better than the other? 73. | What are the different ways in which a thread can be cancelled? | aq | remember 14. | Distinguish between preemptive and nonpreemptive Scheduling. | BTL4 | Analyze 15. | vhat are the various scheduling criteria for CPU scheduling? BTL1_| Remember 16. | what are the requirements that a solution to the critical section | BTL1 | Remember problem must satisfy? 17. | What is a semaphore? BTL1_| Remember 18. | Define Deadlock. BTL1_| Remember 19. | List two programming examples of multithreading giving improved | BTL4 | Analyze performance over a single-threaded solution. 20. | what are the conditions under which a deadlock situation may | BTL1_ | Remember arise?BTL1 deadlocks? ‘What are the methods for handling BTL1 BRN i 2 What is resource-allocation graph? ir i - ads ‘Can a multithreaded solution using multiple user ee thread bie achieve better performance on a multiprocessor syste BTL4 Remember 24 single processor system? Define process? BTL1 25 Describe the actions taken by a kernel to contextswitch between BTLS | Evaluate 26 kernel level threads What are the 3 different types of scheduling queues? BTL1 Remember PART-B&C ‘Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. In answering the questions, use non-preemptive scheduling and base} all decisions on the information you have at the time the decision must be made. Process Arrival Time Burst Time P1008 P2 0.44 P3101 1 Find the average tumaround time for these processes with the FCFS scheduling algorithm? b. Find the average turnaround time for these C212.2 BTL-1 processes with the SJF scheduling algorithm? 6. The SJF algorithm is supposed to improve performance, but notice that we chose to run process P1 at time 0 because we did not know that two shorter processes would arrive soon. Find what is the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remembering that processes P1 and P2 are waiting during this idle time, so their waiting time may increase. This algorithm could be known as future-knowledge scheduling BTLt Remember State critical section problem? Discuss three solutions to solve the critical section problem BTL6 Create Elaborate the actions taken by the kernel to context-switch between processes. BTL6 Create Consider the following resource-allocation policy. Requests and releases for resources are allowed at any time. If a request for resources cannot be satisfied because the resources are not available, then we check any processes that are blocked, waiting for resources. If they have the desired resources, then these resources are taken away from them and are given to the requesting process. The vector of resources for which the waiting process is waiting is increased to include the resources that were BTLé Create taken away. For example, consider a system with three resourceTypes and the vector Available iniliaized to (4.2.2). If process PO asks for (2,2,1), it gets them. If P1 asks for (1,0,1), it gets them. Then, if PO asks for (0,0,1), itis blocked (resource not available). If 2 now asks for (2,0,0), it gets the available one (1,0,0) and one that was allocated to PO (since PO is blocked). PO's Allocation vector goes down to (1,2, 1), and its Need vector goes up to (10,1). a, Predict whether deadlock occurs? If so, give an example. If not, which necessary condition cannot occur? b. Predict whether indefinite blocking occurs? 5, | Distinguish among short-term, medium-term and fong-term ‘scheduling with suitable example BTL4 Analyze 6. | Write about erilical regions and monitors, ental conan 7, _| Consider the following page reference string 7, 0, 1,2, 0,3,0,4, 2, 3, 0,3, 2, 1,2, 0, 1, 7,0, 1 How many page faults would occur | BTL1 |Remember {or the following replacement algorithms, assuming three frames that all frames are initially empty? 8. | How can deadlock be detected? BTL4 | Analyze 9. | Write notes about multiple-processor scheduling and realtime scheduling BTLS Evaluate UNIT Ill MEMORY MANAGEMENT Main Memory - Swapping - Contiguous Memory Allocation - Paging - Structure of the Page Table - Segmentation, Segmentation with paging; Virtual Memory - Demand Paging ~ Copy on Write - Page Replacement - Allocation of Frames ~Thrashing. PART—A 7. | What is the difference between user-level instructions and BTL1 | Remember privileged instructions? 2. | Define: Belady's anomaly? BTL1 | Remember 3. | What is the purpose of paging the page table? BTL1 | Remember 4, | Why page sizes are always power of 2? BTL1 | Remember 5. | List two differences between logical and physical addresses. BTL2_| Understand 6. | Define demand paging in memory management. BTL2__| Understand > 7. | What are the steps required to handle a page fault in demand BTL6 | Create paging? 8. | What do you meant by thrashing? BTL1 | Remember 9 | Explain dynamic loading BTL2_| Understand710 [ Define Overiays. ETL | fonenber 71 | Define swapping BTELEe| Reena ; 12 | what is Demand Paging? BTL1_| Remember ) 13 | What is pure demand paging? BTL3_| Apply 14 | Oullne about vital memory. BTL2_| Understand 15 | Define lazy swapper. BTL1 | Remember 16 | Evaluating the maximum numberof pages needed Ifa system | BTLS | Evaluate ‘supports 16 bit address line and 1K page size. 7_| Whal you mean by compaction? In which situation is app BTLt | Remember 18 | Whatis a Pure Demand Paging? BTL5 | Evaluate 19 | Consider a logical aderess space of 64 pages of 1024 words | BTL3 [Apply each, mapped onto a physical memory of 32 frames. ‘a. How many bits are ther the logical address? b. How many bits are there in the physical address? 20 | Define 0 level page. BTL4_| Analyze PART-B&C | Explain about given memory management techniques. () Partitioned allocation (ji) P trar Ic buffe nec zation (i) Paging and translation look-aside buffer BTLS [Evaluate 2, | Elaborate about the free ‘Space management on I/O buffering and blocking BILE |Create © 3. | When page faults will occur? Describe the actions taken by operating system during page faut erie | Vaden 4. | When to page fauit occur? Consider the reference sti 1284,2.1,56,2.1,23,7632,1,2,36, 8112 | Understand ‘How many page fault and fault rate occur for the FIFO, LRU and optimal replacement algorithms, assuming one, two, three, four | page frames? 5. | Discus situation under which the most frequently used page replacement algorithm generates fewer page faults than the least recently used page BTLS |Evaluate ‘replacement algorithm. Also discus under the which circumstances the opposite holds. 6. | Ina variable parition scheme, the operating system has to Keep track of allocated and free space. Suggest a means of achieving this. Describe the eects of new allocations and process amis levahste terminations in your suggested scheme.(5) val 7, | Discus the given Memory Management techniques with dagram: Paging and Traslation look- aside Buffer (6) BTL1_ [Remember 5 | explain rity about the hardware implementation of page table, | BTL Understand 8. | Explain briefly about Page replacement BTL4 [AnalyzeConsider the following page reference string: Bris |Analyze 4.2,3,2,5,6,3,4,6,3,7.3,1,5,3,6,3,4,2,4,3,4,5.5, 1. Indicate page fault and calculate total number of page faults and successful ration for FIFO, and LRU algorithm. Assume there are four frames and initially all the frames are empty. UNIT IV - STORAGE MANAGEMENT lass Storage system — Disk Structure - Disk Scheduling and Management, File-System Interface| File concept - Access methods - Directory Structure - Directory organization - File syste! jounting - File Sharing and Protection; File System Implementation - File System Structure rectory implementation - Allocation Methods - Free Space Management; I/O Systems — Ii jardware, Application V/O interface, Kernel /O subsystem. PART —A 1. | Distinguish file from dictionary. 2. | Why it is important to scale up system bus and device speed as | BTL4 | Analyze CPU speed increases? 3. | Define C-SCAN scheduling BTL1_| Remember How does DMA increase system concurrency? BTLi_ | Remember 5. | Why rotational latency is not considered in disk scheduling? BTLi_ [Remember 6. | Why rotational latency is not considered in disk scheduling? BTL1_ | Remember 7. | List the various file attributes BTL1 | Remember 8._| What is HSM? Where it is used? BTL1_| Remember 9. | What are the functions of Virtual File System (VFS) layer in file | BTL1 | Remember system implementation? 10. | What is a file? BTL1_| Remember 11. | What are the various file operations? BTL1_| Remember 12. | What are the informations associated with an open file? BTL1_| Remember 13, [Define Directory. BTL1_| Remember 14._[List the operations that can be performed on a directory BTL1_| Remember 15, [Determine the most common schemes for defining the logical BTLS | Evaluate feemrs of adirectory . 16. ar how an index file is used to speed up the access in direct-| BTL4 | Analyze iccess files? 17. [List disadvantages of using a single directory BTL4_| Analyze 18._LList the advantages of two-level directory. BTL4_| Analyze 19. [Discover the ways to overcome the disadvantages of two-level BTL4 | Analyze rectory? 20. What are the allocation methods of a disk space? BTL1_| Remember21__ [What is Access Control List? BTL1_| Remember 22 Pefine Equal Allocation. BTL1_| Remember 23 iat is the cause of Thrashing? How does the system detect BTL1 | Remember thrashing? Once it detects thrashing, what can the system do to liminate this problem? 24 ifthe average page faulls service time of 25 ms and a memory \ccess time of 100ns.Calculate the BLS | Evaluate lective access time. 25 Whatis Belady’s Anomaly? BTL1_| Remember 26 What are the advantages of Contiguous Alloc BTL1_| Remember 27__ What are the drawbacks of Contiguous Allocation of Disk Space? | BTL1 | Remember 28 inat are the advantages of Linked Allocation BTL1 | Remember 29 What are the disadvantages of Linked Allocation? BTL1_| Remember 30 What are the various Disk-Scheduling Algorithms BTL1_| Remember a hat problems could occur ifa system allowed a file system tobe | BTL1 | Remember Imounted simultaneously at more than one location? 32 ly must the bit map for file allocation be kept on mass storage | BTL2 | Understand ather than in main memory? PART-B 1. Explain about directory structure? BTLS [Evaluate 2. nat are files and explain the access methods for files? BTL1_| Remember 3. [Explain about kernel 1/0 subsystem and transforming V/O to BTLS [Evaluate iardware operations. 4. [Explain about RAID in detail BTLS [Evaluate 5. [Compare the functionalities of FCFS, SSTF, C-SCAN and C-LOOK| sta | Analyze ith example. 6. Explain about file system mounting in deta BTLS [Evaluate 7. [Explain about free space management with example BTL4 | Analyze 8. Discuss in detail about file allocation methods. What are the BTL | Create possible structures for directory? Discuss themin detail 3 jhat are the various disk space allocation methods. Explain in BTLS | Evaluate fetail. (Apr/May 2018) 10. _ilustrate the functions of file and file implementation. BTL25 | eae ueUnit 5 - VIRTUAL MACHINES AND MOBILE OS - Virtual Machines — History, Benefits and Features, Building Blocks, Types of tual Machines and their Implementations, Virtualization and Operating-System Components; Mobile OS - iOS and Android PART—A 1. [What is tos sdk? BTL1_ [Remember 2: | What is media layer in iOS? BTL1_| Remember 3. | what is Android? BTL1_| Remember 4. | Why OS js a virtual machine? BTL2_| Understand 5. | What are the two types of virtual machine? BTL1_| Remember 8. | Write the benefits and features BTLS | Evaluate 7. |What is Trap and Emulate ? BTL1_| Remember 8. | Difference between Type’ and Types2 Hypervisor BTL4 | Analyze 9. | Write the Android provides a set of core application. BTLS | Evaluate 10. BTL1 | Remember What are the important blocks in Android? ‘- | Comparison of android OS Vs iphone OSfeatures BTL4 | Analyze e 12. | what is Zygote? BTL1_| Remember PART -B T. Explain the architecture of iOS . Discus media and service layers. | BTL4 | Analyze clearly, 2. | Explain in detail about the Android architecture and its BTL4 | pris components. 3. [Define the Hypervisor, Explain dfferent between Typet and Type2 | BTLS [Evaluate IHypervisor. ; BTL4 | Analyze 4 | What is virtual machine? Explain benefits and features of VM. yas 5. | Discus Android fle management. BILE [Create