SYLLABUS OPERATING SYSTEMS (CIC-305) Applicable from Batch admitted in Academic Session 2021-22 Onwards UNITI Introduction: What is an Operating System, Simple Batch Systems, Multiprogrammed Batches Systems, Time Sharing Systems, Personal-Computer Systems, Parallel systems, Distributed Systems, Real-Time Systems, OS ~ A Resource Manager Processes: Introduction, Process states, Process management, Interrupts, Interprocess Commuicu‘ion Threads: Introduction, Thread States, Thread Operation, Threading Models >: + Scheduling: Scheduling levels, preemptive vs no preemptive gclu duting, priocities, scheduling objective, scheduling criteria, scheduling algorithms, chednting, real time scheduling. [No. of Hrs. 12] UNIT IL Process Synchronization: Mutual exclusion, software solution to Mutual exclusion problem, hardware solution to Mutual exelusion problem, semaphores, Critical section problems. Case study on Dining philosopher problem, Barber shop problem ete. Memory Organization & Management: Memory Organization, Memory Hierarchy, Memory Management Strategies, Contiguous versus non- Contiguous memory allocation, Partition Management Techniques, Logical versus Physical Address space, swapping, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand Paging, Thrashing, Demand Segmentation, and Overlay Concepts. (No. of Hrs. 13] UNIT Ui Deadlocks: Examples of deadlock, resource concepts, necessary conditions for deadlock, deadlock solution, deadlock prevention, deadlock avoidance with Bankers algorithms, deadlock detection, deadlock recovery. Device Management: Disk Scheduling Strategies, Rotational Optimization, System Consideration, Caching and Buffering. (No. of Hrs. 13] UNITIV File System: Introduction, File Organization, Logical File System, Physical File System, File Allocation strategy, Free Space Management, File Access Control, Data ‘Access Techniques, Data Integrity Protection, Case study on file system viz FATS2, NTFS, ExtZ/Ext3 etc, [No. of Hrs. 12]SYLLABUS OPERATING SYSTEM (AIDS/AIML-301) tructions Applicable from Batch admitted in Academic Session 2021-22 Onwards Pero UNIT! pert fron Introduction: Operating system and function, livolution of operating system, Batch, Every uni Interactive, Time Sharing and Real Time System, System protection. Operating System question} Structure: System Components, System structure, Operating System Services. CPU Scheduling: Scheduling Concept, process scheduling strategies: First-Come, Introd: First-Served (FCFS) Scheduling, Shortest-Job-Next (SJN) Scheduling, Priority . nee RA Scheduling, Shortest Remaining Time, Round Robin (RR) Scheduling, Multiple ribute Level Queues Scheduling, Performance Criteria of Scheduling Algorithm, Evolution, ao ‘Multiprocessor Scheduling. (No, of Hrs. 10) Tn 34 UNIT I mentat Concurrent Processes: Process concept, Principle of Concurrency, Producer Consumer Virtus Problem, Critical Section problem, Semaphores, Binary and counting semaphores, P() Scan and VO operations, Classical problems in Concurrency, Inter Process Communication, Process Generation, Process Scheduling. Deadlocks: Examples of deadlock, resource concepts, necessary conditions for deadlock, deadlock solution, deadlock prevention, deadlock avoidance with Bankers algorithms, deadlock detection, deadlock recovery. [No. of Hrs. 10] UNIT IH Memory Organization & Management: Memory Organization, Memory Hierarchy, Memory Management Strategies, Contiguous versus non- Contiguous memory allocation, Partition Management Techniques; Logical versus Physical Address space, swapping, Paging, Segmentation, Segmentation with Paging Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand Paging, Thrashing, Demand Segmentation, and Overlay Concepts. {No. of Hrs. 10] UNIT IV Dea VO Device and the organization: 1/0 Device and the organization of the LO jock function, VO Buffering, Disk 1/0, Disk Scheduling Algorithms, File system: File 1° Concepts, attributes, operations, File organization and Access mechanism, disk space Des allocation methods, Directory structure, free disk space management, File sharing, *#* Implementation issues. Case studies: Unix system, Windows XP. __[No. of Hrs. 101 Kil A ni e dotnotes.xyz‘ards Batch, ystem Come, riority iItiple. ution, 10] Hock, ‘hms, 5. 10] rehy. mory ace, mand nand - 10) vO ace ing 10] OPERATING SYSTEM (ETCS-304) structions to Paper Setters MM. 75 L. Question No. I should be mpulsory and cover the entire syllabus. This question should {ive or short answer type questions. It should be of 25 marks. t from Que 11 No. 1, rest of the paper shall consist of four units as per the syllabus. ory unit should hate two questions, However, student may be asked to attempt only 1 om each unit, Each question should be of 12.5 marks. 2 ques . UNIT-I an Operating System, Simple Batch Systems, Multiprogrammed ime-Sharing Systems, Personal-computer systems, Parallel systems, tems, Real-Time Systems, OS - A Resource Manager. Introduction: What atch tem: stributed Memory Organization & Management: Memory Organization, Memory Hierarchy, smory Management Strategies, Contiguous versus non-Contiguous memory allocation, tition Management Techniques, Logical versus Physical Address space, swapping, Paging, - gmentation, Segmentation with Paging tua] Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, nce of Demand Paging, Thrashing, Demand Segmentation, and Overlay Concepts. [11] (T2][R2][R3) [No. of hrs. 10] UNIT-IL cesses: Introduction, Process states, process management, Interrupts, Interprocess nunication ui fhread: ntroduction; Thread states, Thread Operation, Threading Models. Processor Scheduling: Scheduling levels, pre emptive vano pre emptive scheduling scheduling objective, scheduling criteria, scheduling algorithms, demand real time scheduling. oritie veduli Process Synehranization: Mutual exclusion, software solution to Mutual'exclusion jon to Mutual exclusion problem, semaphores, Critical section ‘blems. Case study cn Dining philosopher problem, Barber shop problem ete. [T1I[T2]{{R3] [No. of hrs. 10] UNIT-IIT Deadlocks: Examples of deadlock, resource concepts, necessary conditions Yor deadlock, idlock selution, deadlock prevention, deadlock avoidance with Bankers algorithms, Idlock detection, deadlock recovery. Device Management: Disk Scheduling Strategies, Rotational Optimization, System asideration, Caching and Buffering. [TII{T2IER1) (No. of hrs. 10] UNIT-IV File System: Introduction, File Organization, Logical File System, Vhysical File System, e Allocation strategy, Free Space Management, File Access Control, Data Access Jhniquee, Data Integrity Protection, Case study on file system viz FAL32, NTFS, Ext2/ 1B ete. [TI] (T2}(R4}{RS} (No. of hrs. 10] EEEND TERM EXAMINATION [JULY 2023) SIXTH SEMESTER [B.TECH] OPERATING SYSTEMS [ETCS-304] ‘Time: 3 Hrs. Max. Marks: 75 luding @. No. 1 which is compulsory. Note: Attempt five questions in all Select one question from c: Q.1. Attempt any Five Q.1. (a) What is the meaning of the term busy waiti : . y waiting? What other of waiting are there in an operating system? Can busy waiti -altogether? Explain your answer. ene ine ewer weg be ws Q.1 (b) What is multiprogramming operating system? How it is di from Multiprocessing. Explain. if eget Bio ft be Gitiarent Qu (6) Explain Process Control Block with the help of suitable diagram in detail. Q.1 (@) Explain race condition Q.1 (e) What are the four conditions that must be present for a deadlock to be possible? Q.1 ( What are various file attributes? UNIT-I Q2. (a) Explain the layered approach of Operating System? What are main task of OS? ©) Q2. (b) Given Memory Partitions of 100K,500K.200K.300K and 600K (in order), how would each of the first fit, best fit, and worst fit algorithms place processes of 212K, 417K, 112K and 426K (in order]? Which algorithms make the most efficient use of memory? 6.5) Q.3 (a) Explain the difference between logical and physical addresses. () Q3 (b)Why are pages sizes always power of 2? ®) 3 (c) Consider there are 4 frames allocated to a process and the page reference string is: ch unit (x5 =25) ith suitable example? 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 for the FIFO and LRU page replacement algorithms. 65 UNIT -I Qu. (a) Consider the following set of processes with the CPU sie se arrival e in milliseconds. Process Arrival Time Burst Time A 0 wW B 1 7 Cc 2 9 D 3 4 E 4 BT Draw the Gantt chart & find: , i ining i i or ces ‘ith the Shortest Remainin; }) Average waiting time for these processes wi ° i imme! first, Round Robin (Time quantum = 8ms) & FCFS scheduling algorithm. dotnotes.xyzorcs Tres ( Tee ee ET ess: SUSE SIE ete wwees oe ce ee” fp rege See wee For (LAS ees ee ee dotnotes.xyz inSx oceas RQ MOON WTR SEMSSUST ~~ TREN PWS Wr Woy MEOW ATENG SANNENM SS RET ERASE Sy re WARS reas WD eS — ORD SOHN’ Ke URES AE AER ong ETS Se PRAM EET —S WAT THEN HE CHW yannnanne ANAM eed the CPU to be ® one of the ouher ot OF sve the control gs context qeitehing TENE aapommp tere AOE HAAN na niosks W te (1.2 PTO 1 task to be jg the CPU Se whe vw &L Sixth Semester, Operating System 8 (a part of CPU scheduling information) « to locate memory of proce: er save area The processor it is running on Q.1.d) What is starvat problem? n? What are the possille solutions to solve this n computer science, starvation is a problem encountered in concurrent z where a process is perpetually denied necessary resources to process its work. may be caused by errore in a scheduling or mutual exclusion algorithm, but caused by resource leaks, and ean be intentionally caused via a denial-f ack such as a fork bomb. " on is similar to deadlock in that it causes a process td freeze, Two or more ecome deadlocked when each of them is doing nothing while waiting for a ce occupied by another program in the same set. On the other hand, a process is in 1 when it is waiting for a resource that is continuously given to other processes cvation-freedom is a stronger guarantee than the absence of deadlock: a mutual on algorithm that must choose to let ane of two processes into a critical section and picks one erbitrarily is deadlock-free, but not starvation-free. Possible solution: A possible solution to starvation is to use a scheduling algorithm proity queue that also uses the aging technique. Agingis @ technique of gradually Ecing the priority of processes that wait in the system for a long time. Q.1.(e) Explain race condition with suitable example? eee pace conditions are most commonly associated with computer science. tn computer memory or storage, a race condition may oceur if commands ‘toread and write f inege amount of data are received at almost the same instant, and the machine 3 ree Sfp overwrite some or all of the old data while that old data is still being ead. v 0, then decrement S; UPS) increment S In time-sharing systems, “waiting” is implemented by the operating system, whic: may put processes on a wait-list for later execution. In hardware, “waiting” may bi accomplished by busy-waiting or by some form of explicit signaling, such as toke passing. dotnotes.xyz SI be p 1 the p 2 they proce dead! resou 3 resou could finish 4 proce chain resou « J deny exam capat chang on>nSECOND TERM SIXTH ee eaa ret TAPRIL- 2016] OPERATING SYSTEM [B.TECH] Time : 1.30 Hrs. * SYSTEM [ETCS- 304] Note: Attempt Q no. I which is compulsory and ae ry and any two mor é Q.1.(a) Explain seek time " me , 1 a i , n nd rotational latency in disk scheduling? ‘Ans : Seek Time: Seck time i ees 2S ime is the tims °1 vg track where the data is to be readlerevite, Bathe dil i nat "© gninimum average seek time is better. se she tik eceeusling lapel ad er Rotational Li : aoa at Latency: Rotational Latency is the time taken by the desired sector of i ling alae ae position so that it can access the read/write heads. So the disk a Ne ls rithm that gives minimum rotational latency is better . .1.(b) What are the fo} i } ‘ ee ur conditions that must be present for a deadlock to ich ‘Ans: Deadlock Conditions a 1, Mutual Exclusion: The resourees involved must be un-shareable; otherwise, the processes would not be prevented from using the resource when necessary. 2. Hold and wait or partial allocation: The processes must hold the resources they have already been allocated ‘while waiting for other (requested) resources. Ifthe process had to release its resources when a new yesource or resources were requested, deadlock could not occur pecause the process would not prevent others from using resources that it controlled. 3, No preemption: The processes must nothave resources taken away while that resource is being used. Otherwise, deadlock could not occur since the operating system could simply take enough resources from running processes to enable any process to finish. 4, Resource waiting or cireular w Acircular chain of processes, with each process holding resources ‘which are currently being requested by the next process in the thain, cannot exist. If it does, the eycle theorem (which states that “a cycle in the resource graph is necessary for deadlock to occur”) indicated that deadlock could orcas Q.1.(e) What are various file attributes? ‘Ans: File attributes are settings associated with computer files that grant or deny certain rights to how @ user or the operating system can access that file. For example, IBM ‘compatible computers running MS-DOS or Microsoft Windows have capabilities of having read, archive, system, ‘and hidden attributes. Read-only - Allows a fil ing can be written to le to be read, but nothi the file or changed. ‘Tells Windows Backup to backup the file. Archive - * System - system file. / sHidden - File will not be shown when doing @ regular dir from DOS. Q.1.@) Explain the term caching and buffering? Ans: Buffering: ffer). Preloading data into ageryred fee off oe (the bul OO eee12-2016 Sixth Semester, Operating System * It temporarily stores input or output data in an attempt to better match wy, speeds of two devices such as a fast CPU and a slow disk drive + Buffer may be used in between when moving data between two processes with, ‘a computer. Data is stored in buffer as it is retrieved frora one processes or just bef, itis sent to another process. « With spooling, the disk is used as a very large buffer. Usually complete jobs ar, queued on disk to be completed later. 5 Itis mostly used for input, output, and sometimes temporary storage of data either - when transfer of data takes place or data that may be modified in a non-sequenti manner. Caching: + Caching transparently stores data in component called Cache, so that future request for that data can be served faster. * A special high-speed storage mechanism. It can be either a reserved section of main memory or an independent high-speed storage device. + The data that is stored within a cache might be values that have been computed —_—_“® earlier or duplicates of original values that are stored elsewhere. E.g: Memory Caching, | 5. CI Disk Caching, Web Caching(used in browser), Database Caching ete. __ suc Acache's sole purpose is to reduce accesses to the underlying slower storage. Qs Q.2.(a) Adisk with 1000 cylinders, numbered 0 to 999, compute the number = of tracks the disk arms must move to satisfy the entire request in the disk I queue. Assume the last request serviced was at track 345 and head is moving [ towards track 0. The queue in FIFO order contains request for the following tracks :123,874,692,845,475,105,376. Perform the computation for the following scheduling algorithms- © _() FIFO (2) SSTF (3) SCAN _(4) C-SCAN (5) LOOK (6) C-LOOK | ‘Ans: (1) FIFO - 2013 i ‘The tracks traveled to will be 345,123, 874, 692, 475, 105 and 376 making the total Use ha distance 222+751+182+217+370+271=2013. az (2) SSTF - 1298 ae The tracks traveled to will be 345, 376, 475, 692, 874, 123 and 105 making the 3 total distance 529+769=1298 diniesses (3) SCAN - 1219 ay The tracks traveled to will be 345,123, 105, 0, 376, 175, 692 and 874 making tht 1, total distance 345+874 =1219 (4) C-SCAN - 1967 The tracks traveled to will be 345,123, 105, 0, 999, 874, 692, 475 and 376 makiti the total distance 345+999+623 =1967 (5) LOOK - 1009 The tracks traveled to will be 345, 123, 105, 376, 475, 692 and 874 making total distance 240+769=1009 2. (6) C-LOOK - 1507 St The tracks traveled to will be 345, 123, 105, 874, 692, 475 and 376 making ™ Se total distance 240+769+498=1507 N dotnotes.xyz ee a it