PESIT SOUTHCAMPUS. Question Bank

Size: px
Start display at page:

Download "PESIT SOUTHCAMPUS. Question Bank"

Transcription

1 Faculty:Sudhakar No. Of Hours:2 Question Bank UNIT : INTRODUCTION TO OPERATING SYSTEMS & THEIR CLASSIFICATION Objective: The main objective of this chapter is to study the Operating system basics & Classifications.. Give the features of symmetric and asymmetric multiprocessing system. 4* 2. Explain the concept of virtual machines. With a neat sketch explain the working of a virtual machine.(dec-2) 3. Explain the distinguishing features of i. Real time system ii) Multiprocessor system 4. What is the purpose of command interpreter? Why is it usually separate from the Kernel? *. Explain the different view points that are used to understand the role of an operating system. june/july 3. What is operating system? What are functions of operating system? 7. What are multiprocessor systems? Give advantages. 8. What is the main difficulty that a programmer must overcome in writing an operating system for real time environment? Define Operating system. Discuss it s role with user and system viewpoint. 9. 2) 0. Explain the following terms and their working with diagram a. Buffering b) Spooling c) Time sharing d) Distributed system e) Real-time x. Why dual mode operation in operating system is required? june/july Compare tightly coupled systems with loosely coupled systems. * 3. Explain graceful degradation and fault tolerance in a multiprocessor system. (DEC20) 4. Describe differences between symmetric and asymmetric multiprocessing. What are three advantages and one disadvantage of multiprocessor systems?. Explain distinguished features of i) Time-sharing system ii) Parallel processing. Write a brief note on different operating system structures.(dec- * * 7. Explain different sub components of an operating system. 8. Bring out the requirements of i. Real time operating systems (ii) Distributed operating systems 9. What is an Operating System? Justify the statement Operating System can be viewed as a government, resource allocator and a control program. List the OS responsibilities in connection, with a process management and 20. memory management. (DEC 20) What is the main advantage for an operating-system designer of using a virtual- 2. machine architecture? What is the main advantage for a user? Define essential properties of the following types of Operating system: 22. i) Batch operating system ii) Interactive operating system iii) Time sharing operating system iv) Real time operating system v. Distributed operating system Distinguish among the following terminologies associated with the operating system and 2* 23. explain each of them in detail. i) Multiprogramming systems. ii) Multitasking systems. (iii) Multiprocessor systems. 24. The main functions of an OS are: i.) Process Management ii.) Memory Management iii.) Input/ Output Manag 0CS

2 iv.) Storage/ File system management 27. When a computer is first turned on or started, a special type of absolute loader called 2. i. Compile and go loader ii) boot loader iii) bootstrap loader iv) relating loader 2. The operating system manages i. M emory ii) processes ii) Disk and the I/O devices iv) all of the above UNIT : OPERATING SYSTEM STRUCTURES Objective: The Operating System provides certain services to programs and to the users of those programs in order to make their tasks easier. The services differ from the operating system to another, but we identify and explore some common classes of these services.. List out services provided by the Operating Systems? 2. What are client server systems & Peer-to-Peer systems? 3. What is the purpose of the system calls & system programs? 4. Explain the layered approach of the operating system. Write short notes on operating system components.. What is the purpose of command interpreter? Why is it usually separate from kernel? What is the main difficulty that a programmer must overcome in writing an operating system 7. for real time environment? 8. Define spooling and the need for it. Explain its working with necessary diagrams. 4* * 9. What is the meaning of overlapped CPU and I/O operation? Explain. 0.Distinguish between : i) Process and Program ii) Multiprogramming and multiprocessing. What are system calls? Explain different categories of system calls? * * 2. What are the five major activities of an operating system in regard to file management 3. What are the five major activities of an operating system in regard to process management? 4. What are the three major activities of an operating system in regard memory management. What are the three major activities of an operating system in regard to secondary storage management. Explain the functions of the following: i. System Calls ii) System programs iii) Command Interpreter 7.What is virtual machine? Explain the just-in-time (JIT) compiler, used in java virtual machine. (DEC 20) 8. Explain the layered approach to the structuring of an operating system along with the relevant diagram 9. List out and explain briefly the various services that the operating system provides to programs and users 20.Briefly explain the common classes of services provided by the various Operating systems for helping the user and for ensuring the efficient operation of the system. 2. Explain the different system components of an operating system. * * 2 22.Briefly explain the clustered systems and real time systems (Dec-2) 4* * 23.What is virtual machine? Explain the just-in-time (JIT) compiler, used in java virtual machine. 0CS3 -

3 24.Explain the salient feature of i) distributed operating system ii) real time operating system. june/july 3 2.List out and explain briefly the various services that the operating system provides to programs and users Which is not the function of the Operating System? 2. i. Memory management ii. Disk management iii. Application management iv. Virus Protection 27.Throughput in case of multiprogramming is. 28.Multiprogramming degenerates to system if there is no proper mix of CPU and I/O bound jobs. 29.A operating system is an operating system which requires a timely response from a computer system. 30.An OS is the interface between &. Suppose the architecture of a computer system is layered into the following four layers -. Operating systems software 2. users applications software 3. hardware 4. programming environment software 3. Which of the following is a logical sequence of the four layers from bottom to top? a., 2, 3, 4 b., 3, 4, 2 c. 3,, 4, 2 UNIT 2: PROCESS, INTER PROCESS COMMUNICATION, THREADS & CPU SCHEDULING Objective: This Chapter will give details of how OS is responsible for Creation and deletion of both users And system processes, the scheduling of processes, providing mechanisms for synchronization communication and deadlock handling for processes. Also you can study how to improve both utilization of CPU and speed of computer's Response for the users, different scheduling algorithms. * 0. What are different differences between user level threads & Kernel supported threads? 4* 2. What is Scheduler? What is a dispatcher? 3. Give the information that is kept in process control block 4. What are threads?. Differentiate between long term and short term scheduler.. Explain the hard real time system. (DEC20) 7. What is co-operating process? 8. Write short note on CPU scheduling criteria. 9. Explain different types of CPU Schedulers. 0.Differentiate the following with examples i. Preemptive and non preemptive scheduling ii) I/O bound and CPU bound iii)scheduler and dispatcher.differentiate Pre-emptive and Non-preemptive scheduling giving the application of each of them 2.What is the criterion used to select the time quantum in case of round-robin scheduling algorithm? Explain it with a suitable example. 3.Explain multilevel feedback queue scheduling with example. 4.Differentiate between a process and a program. Describe the life cycle of a process *.What is a process? What is a state diagram, explain states of a process. Also write the structure of a * process control block.( Dec-2) *.Write short note on algorithm evaluation 7. Describe the process states with the help of process transition diagram * (DEC 20) * 0CS3-4* 4 4* 4* x3* *

4 8.Explain the concept of process. also describe the contents of a process control block(pcb) * 9.What resources are used when a thread is created? How do they differ from those used when a process is created? 20.Define the actions taken by a kernel to context switch: a. among threads b. among processes 2.With illustration explain how processes are created and executed in an operating system (june / july 3) 22.What are co-operating processes? Describe the mechanism of inter process communication * using shared memory in a producer-consumer problem 23.What is co-operating process? Explain. 7* 24.What is interprocess communication? Explain 7* 2.Explain the benefits of multithreaded programming. (DEC 20) 2.Discuss the three common ways of establishing relationship between user and kernel threads (Dec 2) 27.Explain process states with a diagram. What is the need for a context switch? 28.Explain the role of long term scheduler, medium term scheduler and short tem scheduler in O.S 29.Explain the PCB in detail 8 30.Explain how process are created and terminated. 8 3.Discuss the different types of schedulers, giving the advantage and limitation of each. 32.Describe interprocess communication with regard to direct communication and indirect communication. 33.For the following set of process find the average waiting time using Gantt chart for i> SJF ii> Priority scheduling process Burst time Priority p p2 3 4 p3 8 3 p4 2 p 2 The process has arrived in the order p2, p, p4, p3 and p. 34.What is the difference between a preemptive and non-preemptive scheduling algorithms? Explain FCFS scheduling algorithm. Find the average turnaround time and average waiting time for the processes given in the table below. Process CPU burst time(in ms) P 24 P2 3 P3 3 3.Consider the following data with burst time given in milliseconds: i> SJF ii> Priority scheduling process Burst time Priority p 0 3 p2 p3 2 3 p4 4 p 2 The process has arrived in the order p, p2, p3, p4, p all at time 0. a. Draw Gantt charts for the execution of these processes using FCFS, SJF, a nonpreemptive priority and RR (quantum=) scheduling. b. What is the turnaround time and waiting time of each process for each of the scheduling algorithm. 3.What 2 advantages do threads have over multiple processes? What major disadvantages do 0 they have? Suggest one application that would benefit from the use of threads. 0CS3-7

5 37.What do you mean by process and process state? Give the state diagram corresponding to process states and explain 38. Suppose the following jobs arrive for processing at the times indicated, each job will run the listed amount of time. Job arrival time burst time i) Give a Gantt chart illustrating the execution of these jobs using the non preemptive FCFS and SJF scheduling algorithms. ii) what is turn around time and wait time of each job for the above algorithms? iii) compute average turn around time if the CPU is left idle for the first unit and then SJF scheduling is used.(job q and job 2 will wait during this time)` 39.Consider the following set of processes with their arrival and burst times as shown Process A.T B.T P0 0 0HR P 0 0HR P2 02HR P3 2 0HR Compute the turn around time and waiting time of each job using the following scheduling algorithms. i. FCFS ii) S.J.F iii) Round-Robin ( choose time quantum=) 40.For the following set of processes, find the average waiting time & average turn around time using GANTT Chart for I > FCA II> SJF preemptive. III> SJF non-preemptive. Process Arrival time (in sec) Burst Time(in sec) P 0 4 P2 2 P3 2 P What are threads? how do they differ from a process? Explain the difference in process level switching and thread level switching 42.Distinguish between symmetric and asymmetric communication between processes. 43.Define CPU utilization, throughput, turnaround time, waiting time and response time 0 44.Explain the different types of scheduling algorithms. 4.Five batch jobs A,B,C,D and E arrive at a computer centre at almost at the same time. They 2* have estimated running times of 0,,2,4 and 8 minutes. Their priorities are 3,,2, and 4 respectively, with being the highest priority. For each of the following scheduling algorithm determine the turn around time of each process and waiting time of each process. Ignore process switching overhead. Mention which algorithm results in minimal average waiting time. i) Round Robin ii) Priority scheduling iii) First come first served iv) Shortest job first. For case i) assume that system is multiprocessing and each job gets its fair share of the CPU.(time quantum 2 minutes). For cases (ii),(iii) and (iv) assume that only one job runs at a time, until it finishes. All jobs are completely CPU bound. 4.Define CPU utilization, throughput, turnaround time, waiting time and response time 0 0CS3-8

6 47. Explain the different types of scheduling algorithms 48. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is. FCFS scheduling algorithm 2 Round robin scheduling algorithm 3 Shorest job - first scheduling algorithm 4 None of the above 49. In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem is Starvation of low priority processes which may never execute, is resolved by. Terminating the process. 2 Aging 3 Mutual Exclusion 4 Semaphore 0. Which of the following is a criterion to evaluate a scheduling algorithm? CPU Utilization: Keep CPU utilization as high as possible. 2 Throughput: number of processes completed per unit time. 3 Waiting Time: Amount of time spent ready to run but not running. 4 All of the above. With the round robin CPU scheduling in a time-shared system. Using very large time slice degenerates in to first come first served algorithm 2 Using extremely small time slices improve performance 3 Using extremely small time slices degenerate in to last in first out algorithm 4 Using medium sized time slices leads to shortest request time first algorithm 2. Given the following processes and burst times Process Burst Time P 3 P2 P3 23 P4 3 P 3 P 3 P Calculate the average wait time when each of the below scheduling algorithms is used?? Non Pre-Emptive, First Come, First Serve? Round Robin? Shortest Job First Assume that a quantum of is being used. 3. What is a scheduler? Illustrate any two types of scheduling using GANTT chart 0 4. How can Round Robin be made to mimic FCFS scheduling algorithm?.the context of a process is the union of it s. a. region tables, u area, system level context b. register context, pregion tables, user level context c. system-level context, register context, user-level context d. process table, user-level context, register context. Which of the following is NOT a part of a process control block : a. Values of CPU registers b. P U s c h e d

7 0CS3-9

8 UNIT 3 & 4: PROCESS SYNCRHONATION AND DEADLOCKS Objective: Upon completion of this chapter you will be able to define how data consistency is maintained, Study of Semaphores, use and its implementation, Classical problems of synchronization, Deadlock and methods for handling deadlocks.. What is critical section? What requirement should be satisfied for a solution to the critical section problem? 2. What are classical problems of synchronization? 3. Explain the terms critical section and mutual exclusion. 4. Write a note on safe state. Explain starvation. Differentiate deadlock and starvation. Explain the terms critical section and mutual exclusion. What is semaphore? Explain how it can be used to solve the producer consumer problem (Dec 2) What are semaphores? Explain how it can be used to implement mutual exclusion 9. Define resource allocation graph with an example and show how it can be used for dead lock link detection 0. What are monitors? Explain.. Explain the critical section problem 2. Define Test and Set instruction and implement mutual exclusion, using test and set. (DEC 20) 3. Explain the readers/writers problem 4. What are the three requirements to be met by a solution to the critical section problem? * Explain.. What are the necessary conditions for deadlock to occur?. Explain the resource allocation graph 7.What is the term busy waiting? What other kinds of waiting are there in an OS? Can busy waiting be avoided altogether? Explain. 8. Suggest the methods for deadlock recovery * 9. What is a semaphore and a counting semaphore? Explain how a semaphore can be used so 7* that statement S of process P is always executed first, and only then statement S2 of process P2 is executed. 20. What is a deadlock? Explain how resource allocation graph can be used to check for deadlock in a system. 2. Write an algorithm to implement critical section problem for multiple processes 22.What is critical section problem? Explain the requirements to satisfied by any solution to critical section 4* problem. (June/july 3) 4* 23. Explain the synchronizing protocol of a classical readers/writers problem. Write a symbolic program code to implement any one of the above protocol. 24. What are called as co-operating processes? Explain the necessity of mutual exclusion with an example. 2. Explain the methods for deadlock prevention 2. What is a semaphore? Explain the role of semaphore in solving mutual exclusion problem 27. Given 3 processes A,B and C, three resources x,y and z and following events, i) A requests x ii) A requests y iii) B requests y iv) B requests z v) C requests z vi) C requests x vii) C requests y Assume that requested resources should always be allocated to the request process if it is available. Draw the resource allocation graph for the sequences. And also mention whether it is a deadlock? If it is, how to recover the deadlock. 28. Explain the deadlock avoidance algorithm Lists any 4 examples of deadlock that are not related to the computer systems. (DEC20) 0CS3-0 4* 4* 4* 4 4 7*

9 30. State Dining Philosopher s problem and give a solution for the same, using semaphores. Write the structure for philosopher i. 3. What is deadlock? Explain the necessary conditions for its occurrence. 32. Give a scheme for detecting and recovering deadlock 33. What is critical section problem? Write a solution to n process critical section problem. 34. Define deadlock. List and elaborate the necessary condition for deadlock to occur. 3.Explain the safety algorithm used in Banker s algorithm, with suitable data 2* structures. (DEC20) 3.Sleeping-barber and sleeping-customers problem: A barber shop consists of a waiting room with N chairs (chair[],chair[2],.chair[n]) and the barber room containing the barber chair (chair[0]). If there are no customers to be served, the barber goes to sleep. If a customer enters the shop and all the chairs are occupied, then the new customer goes to sleep. If the barber is busy, but the waiting chairs are available, then the new customer occupies the next free chair to maintain the queue. If the barber is asleep, the customer wakes up the barber and occupies the barber chair. Assume chair[0] in one of the critical sections and all waiting chairs are another critical section. Also assume only one of the following abstract functions are available: i> Haircut(); //barber busy in his work ii> Customers-shift-to-next-chair() //after haircut customer gets up from barber chair and all other customers shift by one position to the next chair towards the barber chair. iii> Customer-occupies-free-chair() // new customer occupies the next free chair or if no customers are waiting then directly occupies the barber chair. Write an abstract C-program to coordinate the barber and customers in this problem, using semaphores with atomic operations wait() and signal(). Assume suitable data structures for abstract implementation. (DEC20) 37. With regard to process synchronisation describe what is meant by race conditions? 38. Describe an approach of mutual exclusion that does not require busy waiting Explain how Banker s algorithm is used in deadlock avoidance with an example. 40.Banker s algorithm is an example of avoidance. 4.Mutex is a Semaphore. 42. What is critical section problem and what are the requirements that need to be satisfied by any solution to critical section problem? Give a solution to a 2 process critical section problem. 43. Write and explain Banker s algorithm for deadlock avoidance 44. What is critical section problem? Give a software solution to critical section problem in multiple 2* processes. 4. What is the difference between deadlock prevention and deadlock avoidance methods of 2* dealing with a dead lock problem? Explain the different approaches towards a dead lock detection problem when i) there is a single instance of a resource type ii) Multiple instances of a resource type 4. Write and explain deadlock detection algorithm and explain how it differs from Banker s 2* algorithm. 47. What is deadlock? Explain the various methods for dealing with deadlock problem 2* 48. Mention any hardware machine instruction you know of which can be used to implement the 2* wait-s function for binary semaphore S. Demonstrate how the specific instruction could be used to implement the desired function. State the disadvantages of the above method and 0CS3 -

10 49. suggest a more efficient method of implementing semaphore operations. Explain banker s algorithm using the example given below A system has processes, p,p2,p3,p4 and p.there are 3 types of resources r,r2 and r3.there are 0 instances of r, instances of r2 and 7 instances of r3. At time t0, the situation is as follows; Process allocation of maximum requirement of r r2 r3 r r2 r3 P P P P P Is the system in a safe state at time t0? Suppose now a time t, process p2 requests one additional instance of resource type r and 2 instances of resource type r3, supposing the request if granted will the system be in a safe state? 2* 0.Explain necessary and sufficient conditions for deadlock to occur. (Dec-2) 4*. Consider the following snapshot of a system Process allocation Max Available A B C D 2 0 P0 A B C D A B C D P P P P P Answer the following questions using Bankers Algorithm.What is the content of array need 2.Is the system in a safe state?? 3.If a request from process P arrives for (0,4,2,0) can the request be immediately granted??. E 0CS3 UNIT : MEMORY MANAGEMENT Objective: In this unit you will be able to define How memory can be shared and managed so that CPU can be utilized in a better way and system response time is improved, how multiprogramming is achieved & how different processes in an OS are protected and controlled access can be provided to programs and data. Here we includes different file operations and secondary storage management.. What is storage hierarchy? 4 2. Differentiate among the following terminologies. 4* i) global vs local allocation equal vs ii) proportional allocation 0CS3-2

11 3. What is virtual memory? Explain 4. Suppose we have a demand paged memory. The page table is held in registers. it takes 8ms to service a page fault if an empty page is available or the replaced page is not modified, and 20ms if the replaced page is modified. memory access time is 00ns. Assume that the page to be replaced is modified 70% of the time. what is the maximum acceptable page fault rate for an effective access time of no more than 200ns?. What is demand paging? Explain. What is segmentation? Explain. what is demand segmentation? 7. What are the different access methods? Explain. 8. Explain the difference between Physical and logical address 9. Explain with neat diagram internal and external fragmentation. 0. Describe the action taken by the operating system when a page fault occurs.. Write short notes on swap space management. 2. What is dynamic storage allocation problem? Mention the names of different methods used to solve the above problem 3. Consider a logical address space of 8 pages of 024 words each, mapped on to a physical memory of 32 frames. i. how many bits are there in the logical address? ii) How many bits are there in the physical address? 4. Explain in detail the implementation of paging. What is fragmentation? Explain its types and disadvantages *. Write a note on file types and file structures * 7. What is virtual memory and give its advantages * 8. What is fragmentation? Explain its types and disadvantages. jun/july 3 9. Explain the tem locality of reference and elaborate on its usefulness in presenting thrashing. * 20. List the operations that can be performed on directory * 2. What is page fault and how it is handled? 22. What is thrashing and explain its cause. 23. Explain the buddy-system, used for managing free memory assigned to kernel process. (DEC20) 24. Assume a computer with a memory size of 2K, initially empty. Requests are received for 0 blocks of memory of K, 2K, 3K and 20K. Show how the buddy system would deal with each request, showing the memory layout at each stage and the status of the lists at the end. After allocating all the processes, what would be the effect of the 2K process terminating and returning its memory? 2. Explain the locality model and the working set model 8 2. Describe the LRU page replacement algorithm, assuming there are 3 frames and the page reference string is Find the number of page faults. 27. Differentiate between External fragmentation and internal fragmentation 28. Explain with the help of supporting diagram how TLB improves the performance of a demand paging system. 29. What are the differences between internal fragmentation and external fragmentation? explain external fragmentation with an example 30. Differentiate between the following 0 a. Paging and Segmentation b) Page table and segment table 3. Explain any two page replacement algorithms 32. Explain the best fit, first fit and worst fit algorithm 33. Discuss the following page replacement algorithm with an example. i> Optimal ii> LRU 34. Differentiate between global and local replacement algorithms 0

12 0CS3-3

13 3.Explain the following sequence of memory references from a 40 word program. 0 0,,04,70,73,309,8,24,24,434,48,34. (Dec 202) 3. Consider the following page reference string,2,3,4,2,,,,2,,2,3,7,,3,2,,2,3, Find out the number of page faults if there are 4 page frames, using the following page replacement algorithm i) LRU ii) FIFO iii) Optimal 37. Consider following sequence of memory reference from a 40-byte program 0 0,,04,70,73,309,8,24,24,434,48,34 i) Give reference string assume page size of 00 bytes ii) Find Page fault rate assuming 200 bytes of Physical memory available using FIFO, LRU, Optimal replacement algorithms 38. Explain segmented memory management 39. Explain paging scheme of memory management. What hardware support is needed for its implementation? 40. Explain different disk scheduling techniques with example. How are their performance measured? 4. Discuss the following page replacement algorithm with an example i) Optimal ii) LRU 42. A virtual memory system has the following specification: 0 Size of the virtual address space=4k Size of the physical address space=4k Page size=2 Virtual page# physical frame# i) 7 find all the virtual addresses that will generate a page fault compute the main memory addresses for the following virtual addresses. 24,3784,020, The available space list of a computer memory is specified as follows: 2* Start address block address in words Determine the available space list after allocating the space for the stream of requests consisting of the following block sizes: 2,00,20,200,00,0 Use i) FIRST FIT ii) BEST FIT and iii) WORST FIT algorithms. Your answer should be in terms of the given available space list format only 2* 2* 44. What is dynamic storage allocation? Explain the commonly used strategies 3* for dynamic storage allocation. (DEC20) 4. What is paging? explain with an example 8 4. Define.Thrashing 2.Beladys anomaly 3.Effective access time in demand paging 47. A process references pages A, B, C, D, E in the following order A. B, C, D, A, E, B, C, E, D Assuming that the replacement algorithm is LRU and FIFO, find out the number of page faults during the sequence of references, starting with an empty main memory 0CS3-4

14 With 3 frames. 48. Belady s enomaly is a behavior of which which page replacement algorithm. FIFO 2. Optimal 3. LRU Circular FIFO The time taken by the disk arm to locate the specific address of a sector for getting information is called. Rotational Latency 2 Seek Time 3 Search Time 4 Response Time Paging is. virtual memory system. 2. Memory management scheme 3.Allocation of memory 4. Deadlock prevention. Assume a computer with a memory size of 2K, initially empty. Requests are received for blocks of memory of K, 2K, 3K and 20K. Show how the buddy system would deal with each request, showing the memory layout at each stage. After allocating all the processes, what would be the effect of the 2K process terminating and returning its memory? 2. Why is page replacement necessary? Explain any 3 page replacement algorithms. 3.The purpose of virtual memory system is to a. Allow multiprocessing b. Allow multiprogramming c. Allow batch processing d. A llow execution of a program that requires larger memory than the size of the physical main memory UNIT : FILE SYSTEM AND ITS IMPLEMENTATION 0 0 Objective: The main objective of this unit is to study the basic concepts of file system and how different types of files are implemented as well as of different access methods of files.. Explain the various file access methods 2. Explain the terms: sequential file access and tree structured directories * 3. Define file and directory. Give one implementation of file directory. 4. Explain the terms: file types, file operations and file attributes. An operating system supplies system calls to allow you to COPY, DELETE and RENAME a file. Discuss the differences between using COPY/DELETE and RENAME to give a file new name? 3*4. Explain the methods used to implement the directory. 7. Explain free space management technique. 8. When the UNIX filling system opens a file, its i-node is copied into memory. It has been suggested, that with memory getting cheaper that if n processes open the same file then 8 n copies of the I-node could be held in memory. Is this a good idea? Give your reasons. 9. Write a note on directory structure organization 0.Define file system. Explain the different directory structure..name the different file allocation methods. Explain the linked allocation of file 8 0 0CS3 -

15 implementation with merits and demerits. 2. List the common file types along with its extensions and functions. (DEC20) 3.When a file is removed, the blocks it occupies are simply placed back onto the free list. Can you see any problems with this? If so, how would you overcome them and what problems, if any, would now exist and how would you resolve these 4. How do the modern OS concurrently support multiple types of file system? Explain its implementation, in detail. (DEC20).Explain the linked allocation of disk space with a neat diagram. how does it compare with contiguous allocation.discuss the various methods of allocation of disk space for file system. 7.Describe the windows NT file system and mention its special features. 8.Name the different file allocation and file access methods and clearly differentiate between them. Bring out the relative problems of contiguous allocation methods and explain how these problems are solved in linked allocation method. Bring out its relative demerits, if any 9.File system NTFS stands for. New type file system 2. Never Terminated file system 3. New technology file system 4. Non terminated 20. Every file in a filing system has a set of attributes (read only, date created etc.). Assume a filing system allows an attribute of temporary, meaning the creating process only uses the file during the time it is executing and has no need for the data thereafter. Assume the process is written correctly, so that it deletes the file at the end of its execution. Do you see any reason for an operating system to have temporary file attribute? Give your reasons. 2. An operating system supplies system calls to allow you to COPY, DELETE and RENAME a file. Discuss the differences between using COPY/DELETE and RENAME to give a file new name? 22. Define file system. Explain the various file allocation methods with suitable examples Which of the following statements is not true? a. A directory is a special type of file b. A directory is used to store file attributes c. A directory is used to store file data d. A directory is used to store file access information UNIT 7: MASS STORAGE MANAGEMENT AND PROTECTION AND SECURITY 0 4* Objective: The main objective of this chapter is to study the secondary storage management and how protection and security is provided by the operating system, what are the different mechanisms used and the different types of threats that a program has to face.. What are file protection methods? 2. What are the different access methods? Explain. 3. Explain the difference between protection and security 4. What are the problems encountered during protection?. What is access matrix? Explain its implementation. What are the goals of protection? 7. Discuss the different file protection schemes. 8. Write a note on Internet use policy. 9. What is a Hacker? What are the arguments for and against hacking? 0.Explain various questions that arise in revocation of access rights. (DEC20).Differentiate between protection and security in file system. How they are implemented? 0CS3-4 *

16 2.Discuss the various ethical issues relating to information Technology. 2* 3.Explain the terms WORMS and VIRUSES with reference to system threats 0 4.Discuss the different methods used to solve the problem of security at the operating system level..briefly explain the various kinds of program threats and system threats..what is access matrix? Explain how the access matrix can be implemented effectively. 7.Explain different methods used to solve the problem of security at the operating system level 8.Discuss the various ethical issues relating to information Technology. 2* 9.Explain sector slipping, with an example. (DEC20) 4* 20.Describe the SSTF disk scheduling algorithm using the following data. The dist head is * initially at position-cylinder 3.the cylinder sequence of requests is 98, 83, 37, 22, 4, 24,. 7. find the total head movement. 2.Assume the disk queue, with request fun I/O to block on cylinders as 80,30,,00,2,90,4, and 0. If the disk head is initially at cylinder 3, illustrate the disk movements, using the SSTF scheduling algorithm. Also calculate the total head movement. (DEC20) 22.Explain the disk structure 8 23.Explain the following disk scheduling algorithm with examples. iii) SSTF ii) SCAN iii)look Comment on the selection of these scheduling methods. 24.With respect to disk management, explain the following : i) Boot Block ii) Bad Block concepts. 2.Suppose that a disk drive has 000 cylinders, numbered 0 to the drive currently services a request at cylinder 43, and the previous request was at cylinder 2. the queue of pending request in FIFO order is 8,470,93,774,948,09,022,70,30. Starting from the current position, what is the total distance(in cylinders) that the disk arm moves to satisfy all pending requests, for each of the following algorithms i)fcfs ii) SSFT iii) SCAN iv) LOOK v) C-SCAN. 2.What are the different disk scheduling algorithms explain. 27.The queue of requests in FIFO is 8,47,9,77,94,0,02,7,30 0 What is the total head movement needed to satisfy the requests for the following Scheduling algorithms FCFS, SJF, SCAN, LOOK, C-SCAN. 28.What is disk scheduling? Explain FCFS and SCAN disk scheduling algorithms. 29.Suppose that the head of moving head disk with 200 tracks numbered 0 to 99 is currently 8 serving the request at track 43 and has just finished a request at track 2. If the queue request is kept in FIFO order, 8, 47, 9, 77, 94, 0, 02, 7, 30 What is the total head movement to satisfy these requests for i) FCFS II) SSTF disk scheduling algorithm. 30. Which file system does Windows 9 typically use? FAT 2 FAT32 3 NTFS 4 LMFS 3. Given a disk with 200 tracks, where track requests are received in the following order, 8, 39, 8, 90, 0, 0, 38, 84. The starting position for the arm is track 00. Calculate the number of tracks crossed when the following algorithms are used First Come First Serve Shortest Seek First 0CS3-7 0

17 The elevator algorithm starting in the direction UP. 32. Briefly explain, in which of the following cases can the algorithms listed above augment its performance? A process is reading 0,000 blocks with consecutive disk addresses. A process is reading 0,000 blocks with random disk addresses. A process is creating child processes to read 0,000 blocks with random addresses. Processes are communicating with each other by writing and reading blocks to disk. 33. Explain any 4 disk scheduling algorithms with a neat diagram. UNIT 8: CASE STUDY LINUX OPERATING SYSTEM 8 0 Objective: The main objective of this chapter is to study History and development of Linux, Linux-process management and memory management, File systems, network structure and security.. What are components of Linux systems? 2. Explain Module management in Linux 3. What are 3 layers implemented in Linux kernel. 4. Explain the Windows NT-design principles. Explain the networking in Windows NT. Explain Windows-NT architecture 7. What are main features of UNIX? 8. Explain the process management in UNIX? 9. Explain security mechanism of Linux.

18 0.Write a short note on Design principle of Linux system..what are the three main bodies of code in LINUX implementation? explain 2.Explain password mechanism in LINUX. 3.Explain Interprocess communication in Linux System 4.Explain Network structure, security in Linux system.explain Design Principles of Linux System 8.Explain interface and memory management in Unix 7.Distinguish between fork() and clone() system call. Also customize the clone() system call to fork() functionality, with suitable modifications/settings. (DEC20) 8.Explain block, fragments, inode and mapping of a file descriptor to an inode in UNIX-OS 9.What are the three classes of devices in LINUX? Explain the overall structure of 2* the device-driver system in LINUX. (DEC20) 20.Discuss the features of LINUX operating system. 2.Discuss the memory management with reference to Linux. 22.Explain the three main components of a Linux system with a neat figure 23.Unix Operating System is an. Time Sharing Operating System 2 Multi-User Operating System 3 Multi-tasking Operating System 4 All the Above Note: * indicates questions appeared in previous exam papers.

Department of Computer applications. [Part I: Medium Answer Type Questions]

Department of Computer applications. [Part I: Medium Answer Type Questions] Department of Computer applications BBDNITM, Lucknow MCA 311: OPERATING SYSTEM [Part I: Medium Answer Type Questions] UNIT 1 Q1. What do you mean by an Operating System? What are the main functions of

More information

MC7204 OPERATING SYSTEMS

MC7204 OPERATING SYSTEMS MC7204 OPERATING SYSTEMS QUESTION BANK UNIT I INTRODUCTION 9 Introduction Types of operating systems operating systems structures Systems components operating systems services System calls Systems programs

More information

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW

CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS UNIT I OPERATING SYSTEMS OVERVIEW CLASS: II YEAR / IV SEMESTER CSE SUBJECT CODE AND NAME: CS6401 OPERATING SYSTEMS SYLLABUS UNIT I OPERATING SYSTEMS OVERVIEW Computer System Overview-Basic Elements, Instruction Execution, Interrupts, Memory

More information

QUESTION BANK UNIT I

QUESTION BANK UNIT I QUESTION BANK Subject Name: Operating Systems UNIT I 1) Differentiate between tightly coupled systems and loosely coupled systems. 2) Define OS 3) What are the differences between Batch OS and Multiprogramming?

More information

Chendu College of Engineering & Technology

Chendu College of Engineering & Technology Chendu College of Engineering & Technology (Approved by AICTE, New Delhi and Affiliated to Anna University) Zamin Endathur, Madurantakam, Kancheepuram District 603311 +91-44-27540091/92 www.ccet.org.in

More information

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM Part-A SYED AMMAL ENGINEERING COLLEGE 1. What is an Operating system? CS6401- OPERATING SYSTEM QUESTION BANK UNIT-I 2. List the services provided by an Operating System? 3. What is the Kernel? 4. What

More information

SNS COLLEGE OF ENGINEERING

SNS COLLEGE OF ENGINEERING SNS COLLEGE OF ENGINEERING Coimbatore. Department of Computer Science and Engineering Question Bank- Even Semester 2015-2016 CS6401 OPERATING SYSTEMS Unit-I OPERATING SYSTEMS OVERVIEW 1. Differentiate

More information

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad COMPUTER SCIENCE AND ENGINEERING QUESTION BANK OPERATING SYSTEMS

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad COMPUTER SCIENCE AND ENGINEERING QUESTION BANK OPERATING SYSTEMS INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING QUESTION BANK Title Code Regulation Structure Coordinator Team of Instructors OPERATING SYSTEMS A50510

More information

CHAPTER NO - 1 : Introduction:

CHAPTER NO - 1 : Introduction: Sr. No L.J. Institute of Engineering & Technology Semester: IV (26) Subject Name: Operating System Subject Code:21402 Faculties: Prof. Saurin Dave CHAPTER NO - 1 : Introduction: TOPIC:1 Basics of Operating

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Year and Semester : II / IV Subject Code : CS6401 Subject Name : Operating System Degree and Branch : B.E CSE UNIT I 1. Define system process 2. What is an

More information

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 INFORMATION TECHNOLOGY TUTORIAL QUESTION BANK Course Name Course Code Class Branch OPERATING SYSTEMS ACS007 IV Semester

More information

INSTITUTE OF AERONAUTICAL ENGINEERING

INSTITUTE OF AERONAUTICAL ENGINEERING INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING TUTORIAL QUESTION BANK Course Title Course Code Regulation Course Structure Course Coordinator

More information

Operating System(16MCA24)

Operating System(16MCA24) PESIT- Bangalore South Campus Hosur Road (1km Before Electronic city) Bangalore 560 100 Department of MCA COURSE INFORMATION SHEET Operating System(16MCA24) 1. GENERAL INFORMATION Academic Year: 2017 Semester(s):I

More information

Operating Systems Comprehensive Exam. Spring Student ID # 3/16/2006

Operating Systems Comprehensive Exam. Spring Student ID # 3/16/2006 Operating Systems Comprehensive Exam Spring 2006 Student ID # 3/16/2006 You must complete all of part I (60%) You must complete two of the three sections in part II (20% each) In Part I, circle or select

More information

Operating Systems Comprehensive Exam. Spring Student ID # 3/20/2013

Operating Systems Comprehensive Exam. Spring Student ID # 3/20/2013 Operating Systems Comprehensive Exam Spring 2013 Student ID # 3/20/2013 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,

More information

Main Points of the Computer Organization and System Software Module

Main Points of the Computer Organization and System Software Module Main Points of the Computer Organization and System Software Module You can find below the topics we have covered during the COSS module. Reading the relevant parts of the textbooks is essential for a

More information

CSE 421/521 - Operating Systems Fall Lecture - XXV. Final Review. University at Buffalo

CSE 421/521 - Operating Systems Fall Lecture - XXV. Final Review. University at Buffalo CSE 421/521 - Operating Systems Fall 2014 Lecture - XXV Final Review Tevfik Koşar University at Buffalo December 2nd, 2014 1 Final Exam December 4th, Thursday 11:00am - 12:20pm Room: 110 Knox Chapters

More information

Techno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions:

Techno India Batanagar Department of Computer Science & Engineering. Model Questions. Multiple Choice Questions: Techno India Batanagar Department of Computer Science & Engineering Model Questions Subject Name: Operating System Multiple Choice Questions: Subject Code: CS603 1) Shell is the exclusive feature of a)

More information

Department of Information Technology Operating Systems Question Bank YEAR/SEM:III/V

Department of Information Technology Operating Systems Question Bank YEAR/SEM:III/V UNIT-I PART-A 1. Define Operating system?give any two example? (NOV,APRIL-2014) 2. Define Multiprogramming and Multitasking? 3. What are the advantages of Multiprocessor system? 4. What are the services

More information

B. V. Patel Institute of Business Management, Computer &Information Technology, UTU

B. V. Patel Institute of Business Management, Computer &Information Technology, UTU BCA-3 rd Semester 030010304-Fundamentals Of Operating Systems Unit: 1 Introduction Short Answer Questions : 1. State two ways of process communication. 2. State any two uses of operating system according

More information

CSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008.

CSC Operating Systems Spring Lecture - XII Midterm Review. Tevfik Ko!ar. Louisiana State University. March 4 th, 2008. CSC 4103 - Operating Systems Spring 2008 Lecture - XII Midterm Review Tevfik Ko!ar Louisiana State University March 4 th, 2008 1 I/O Structure After I/O starts, control returns to user program only upon

More information

Operating Systems Comprehensive Exam. Spring Student ID # 2/17/2011

Operating Systems Comprehensive Exam. Spring Student ID # 2/17/2011 Operating Systems Comprehensive Exam Spring 2011 Student ID # 2/17/2011 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,

More information

Exam Guide COMPSCI 386

Exam Guide COMPSCI 386 FOUNDATIONS We discussed in broad terms the three primary responsibilities of an operating system. Describe each. What is a process? What is a thread? What parts of a process are shared by threads? What

More information

COMP 3361: Operating Systems 1 Final Exam Winter 2009

COMP 3361: Operating Systems 1 Final Exam Winter 2009 COMP 3361: Operating Systems 1 Final Exam Winter 2009 Name: Instructions This is an open book exam. The exam is worth 100 points, and each question indicates how many points it is worth. Read the exam

More information

Operating Systems Comprehensive Exam. Fall Student ID # 10/31/2013

Operating Systems Comprehensive Exam. Fall Student ID # 10/31/2013 Operating Systems Comprehensive Exam Fall 2013 Student ID # 10/31/2013 You must complete all of Section I You must complete two of the problems in Section II If you need more space to answer a question,

More information

Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering)

Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering) A. Multiple Choice Questions (60 questions) Subject: Operating System (BTCOC403) Class: S.Y.B.Tech. (Computer Engineering) Unit-I 1. What is operating system? a) collection of programs that manages hardware

More information

CS 571 Operating Systems. Midterm Review. Angelos Stavrou, George Mason University

CS 571 Operating Systems. Midterm Review. Angelos Stavrou, George Mason University CS 571 Operating Systems Midterm Review Angelos Stavrou, George Mason University Class Midterm: Grading 2 Grading Midterm: 25% Theory Part 60% (1h 30m) Programming Part 40% (1h) Theory Part (Closed Books):

More information

R13 SET - 1 2. Answering the question in Part-A is compulsory 1 a) Define Operating System. List out the objectives of an operating system. [3M] b) Describe different attributes of the process. [4M] c)

More information

CSI3131 Final Exam Review

CSI3131 Final Exam Review CSI3131 Final Exam Review Final Exam: When: April 24, 2015 2:00 PM Where: SMD 425 File Systems I/O Hard Drive Virtual Memory Swap Memory Storage and I/O Introduction CSI3131 Topics Process Computing Systems

More information

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK CS 1253-Operating Systems 1 KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Year /Sem Sub.Code/Sub.Name : II / IV : CS1253 / OPERATING SYSTEMS UNIT 1 PROCESSES AND THREADS

More information

Final Exam Preparation Questions

Final Exam Preparation Questions EECS 678 Spring 2013 Final Exam Preparation Questions 1 Chapter 6 1. What is a critical section? What are the three conditions to be ensured by any solution to the critical section problem? 2. The following

More information

( D ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Semaphore (C) Monitor (D) Shared memory

( D ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Semaphore (C) Monitor (D) Shared memory CS 540 - Operating Systems - Final Exam - Name: Date: Wenesday, May 12, 2004 Part 1: (78 points - 3 points for each problem) ( C ) 1. In UNIX a utility which reads commands from a terminal is called: (A)

More information

( B ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Shared memory (C) Semaphore (D) Monitor

( B ) 4. Which is not able to solve the race condition? (A) Test and Set Lock (B) Shared memory (C) Semaphore (D) Monitor CS 540 - Operating Systems - Final Exam - Name: Date: Monday, May 12, 2003 Part 1: (80 + 8 (bonus) points - 4 points for each problem) ( C ) 1. In an operating system a utility which reads commands from

More information

MARUTHI SCHOOL OF BANKING (MSB)

MARUTHI SCHOOL OF BANKING (MSB) MARUTHI SCHOOL OF BANKING (MSB) SO IT - OPERATING SYSTEM(2017) 1. is mainly responsible for allocating the resources as per process requirement? 1.RAM 2.Compiler 3.Operating Systems 4.Software 2.Which

More information

ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far.

ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far. Midterm Exam Reviews ALL the assignments (A1, A2, A3) and Projects (P0, P1, P2) we have done so far. Particular attentions on the following: System call, system kernel Thread/process, thread vs process

More information

CHAPTER 2: PROCESS MANAGEMENT

CHAPTER 2: PROCESS MANAGEMENT 1 CHAPTER 2: PROCESS MANAGEMENT Slides by: Ms. Shree Jaswal TOPICS TO BE COVERED Process description: Process, Process States, Process Control Block (PCB), Threads, Thread management. Process Scheduling:

More information

Midterm Exam. October 20th, Thursday NSC

Midterm Exam. October 20th, Thursday NSC CSE 421/521 - Operating Systems Fall 2011 Lecture - XIV Midterm Review Tevfik Koşar University at Buffalo October 18 th, 2011 1 Midterm Exam October 20th, Thursday 9:30am-10:50am @215 NSC Chapters included

More information

Course Description: This course includes the basic concepts of operating system

Course Description: This course includes the basic concepts of operating system Operating Systems Course Title: Operating Systems Full Marks:60+ 20+20 Course No: CSC259 Pass Marks: 24+8+8 Nature of the Course: Theory + Lab Credit Hrs: 3 Course Description: This course includes the

More information

Chapter 5: CPU Scheduling

Chapter 5: CPU Scheduling Chapter 5: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Operating Systems Examples Algorithm Evaluation Chapter 5: CPU Scheduling

More information

Chapter 6: CPU Scheduling

Chapter 6: CPU Scheduling Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Operating System Third Year CSE( Sem:I) 2 marks Questions and Answers UNIT I

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Operating System Third Year CSE( Sem:I) 2 marks Questions and Answers UNIT I DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Operating System Third Year CSE( Sem:I) 2 marks Questions and Answers UNIT I 1. What is an Operating system? An operating system is a program that manages

More information

Operating Systems: Quiz2 December 15, Class: No. Name:

Operating Systems: Quiz2 December 15, Class: No. Name: Operating Systems: Quiz2 December 15, 2006 Class: No. Name: Part I (30%) Multiple Choice Each of the following questions has only one correct answer. Fill the correct one in the blank in front of each

More information

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur-603203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Academic Year: 2015-16 QUESTION BANK - EVEN SEMESTER Year & Semester : II year & IV sem Section

More information

CSE 153 Design of Operating Systems

CSE 153 Design of Operating Systems CSE 153 Design of Operating Systems Winter 2018 Midterm Review Midterm in class on Monday Covers material through scheduling and deadlock Based upon lecture material and modules of the book indicated on

More information

Department of CSIT ( G G University, Bilaspur ) Model Answer 2013 (Even Semester) - AR-7307

Department of CSIT ( G G University, Bilaspur ) Model Answer 2013 (Even Semester) - AR-7307 Department of CSIT ( G G University, Bilaspur ) Model Answer 2013 (Even Semester) - AR-7307 Class: MCA Semester: II Year:2013 Paper Title: Principles of Operating Systems Max Marks: 60 Section A: (All

More information

Properties of Processes

Properties of Processes CPU Scheduling Properties of Processes CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait. CPU burst distribution: CPU Scheduler Selects from among the processes that

More information

Architectural Support. Processes. OS Structure. Threads. Scheduling. CSE 451: Operating Systems Spring Module 28 Course Review

Architectural Support. Processes. OS Structure. Threads. Scheduling. CSE 451: Operating Systems Spring Module 28 Course Review Architectural Support CSE 451: Operating Systems Spring 2012 Module 28 Course Review Ed Lazowska lazowska@cs.washington.edu Allen Center 570 Privileged instructions what are they? how does the CPU know

More information

Operating Systems (Classroom Practice Booklet Solutions)

Operating Systems (Classroom Practice Booklet Solutions) Operating Systems (Classroom Practice Booklet Solutions) 1. Process Management I 1. Ans: (c) 2. Ans: (c) 3. Ans: (a) Sol: Software Interrupt is generated as a result of execution of a privileged instruction.

More information

EXAMS CS604- OPERATING SYSTEMS

EXAMS CS604- OPERATING SYSTEMS MUHAMMAD FAISAL MIT 4 th Semester Al-Barq Campus (VGJW01) Gujranwala faisalgrw123@gmail.com Solved Reference MCQ s For Final TERM EXAMS CS604- OPERATING SYSTEMS Question No: 1 ( Marks: 1 ) - Please choose

More information

OPERATING SYSTEMS. Sharafat Ibn Mollah Mosharraf TOUCH-N-PASS EXAM CRAM GUIDE SERIES. Students. Special Edition for CSEDU

OPERATING SYSTEMS. Sharafat Ibn Mollah Mosharraf TOUCH-N-PASS EXAM CRAM GUIDE SERIES. Students. Special Edition for CSEDU Special Edition for CSEDU Students TOUCH-N-PASS EXAM CRAM GUIDE SERIES OPERATING SYSTEMS Prepared By Sharafat Ibn Mollah Mosharraf CSE, DU 12 th Batch (2005-2006) Includes DU OS Final Exam Questions of

More information

ROEVER ENGINEERING COLLEGE, PERAMBALUR DEPARTMENT OF INFORMATION TECHNOLOGY OPERATING SYSTEMS QUESTION BANK UNIT-I

ROEVER ENGINEERING COLLEGE, PERAMBALUR DEPARTMENT OF INFORMATION TECHNOLOGY OPERATING SYSTEMS QUESTION BANK UNIT-I systems are based on time-sharing systems ROEVER ENGINEERING COLLEGE, PERAMBALUR DEPARTMENT OF INFORMATION TECHNOLOGY OPERATING SYSTEMS QUESTION BANK UNIT-I 1 What is an operating system? An operating

More information

Maximum CPU utilization obtained with multiprogramming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait

Maximum CPU utilization obtained with multiprogramming. CPU I/O Burst Cycle Process execution consists of a cycle of CPU execution and I/O wait Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling Algorithm Evaluation CPU

More information

Review. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling

Review. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling Review Preview Mutual Exclusion Solutions with Busy Waiting Test and Set Lock Priority Inversion problem with busy waiting Mutual Exclusion with Sleep and Wakeup The Producer-Consumer Problem Race Condition

More information

CPU Scheduling Algorithms

CPU Scheduling Algorithms CPU Scheduling Algorithms Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating Systems Concepts with Java, by Silberschatz, Galvin, and Gagne (2007).

More information

King Fahd University of Petroleum and Minerals. Write clearly, precisely, and briefly!!

King Fahd University of Petroleum and Minerals. Write clearly, precisely, and briefly!! 1 King Fahd University of Petroleum and Minerals Information and Computer Science Department ICS 431: Operating System FINAL EXAM DO NOT OPEN UNTIL INSTRUCTED TO DO SO!!!! Write clearly, precisely, and

More information

Operating Systems (1DT020 & 1TT802)

Operating Systems (1DT020 & 1TT802) Uppsala University Department of Information Technology Name: Perso. no: Operating Systems (1DT020 & 1TT802) 2009-05-27 This is a closed book exam. Calculators are not allowed. Answers should be written

More information

Unit 3 : Process Management

Unit 3 : Process Management Unit : Process Management Processes are the most widely used units of computation in programming and systems, although object and threads are becoming more prominent in contemporary systems. Process management

More information

Lecture 17: Threads and Scheduling. Thursday, 05 Nov 2009

Lecture 17: Threads and Scheduling. Thursday, 05 Nov 2009 CS211: Programming and Operating Systems Lecture 17: Threads and Scheduling Thursday, 05 Nov 2009 CS211 Lecture 17: Threads and Scheduling 1/22 Today 1 Introduction to threads Advantages of threads 2 User

More information

(b) External fragmentation can happen in a virtual memory paging system.

(b) External fragmentation can happen in a virtual memory paging system. Alexandria University Faculty of Engineering Electrical Engineering - Communications Spring 2015 Final Exam CS333: Operating Systems Wednesday, June 17, 2015 Allowed Time: 3 Hours Maximum: 75 points Note:

More information

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou ( Zhejiang University

CPU Scheduling. Operating Systems (Fall/Winter 2018) Yajin Zhou (  Zhejiang University Operating Systems (Fall/Winter 2018) CPU Scheduling Yajin Zhou (http://yajin.org) Zhejiang University Acknowledgement: some pages are based on the slides from Zhi Wang(fsu). Review Motivation to use threads

More information

Indian Institute of Technology, Kharagpur

Indian Institute of Technology, Kharagpur 1 Indian Institute of Technology, Kharagpur End-Spring Semester 2017-18 Date of Examination: 24-04-2018 Session: AN (2-5 pm) Duration: 3 hrs Subject No.: CS31702 Subject: COMPUTER ARCHITECTURE AND OPERATING

More information

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5 OPERATING SYSTEMS CS3502 Spring 2018 Processor Scheduling Chapter 5 Goals of Processor Scheduling Scheduling is the sharing of the CPU among the processes in the ready queue The critical activities are:

More information

Lecture 9: Midterm Review

Lecture 9: Midterm Review Project 1 Due at Midnight Lecture 9: Midterm Review CSE 120: Principles of Operating Systems Alex C. Snoeren Midterm Everything we ve covered is fair game Readings, lectures, homework, and Nachos Yes,

More information

Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms

Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts. Scheduling Criteria Scheduling Algorithms Operating System Lecture 5 / Chapter 6 (CPU Scheduling) Basic Concepts Scheduling Criteria Scheduling Algorithms OS Process Review Multicore Programming Multithreading Models Thread Libraries Implicit

More information

Lecture 2 Process Management

Lecture 2 Process Management Lecture 2 Process Management Process Concept An operating system executes a variety of programs: Batch system jobs Time-shared systems user programs or tasks The terms job and process may be interchangeable

More information

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 TED (10)-3071 (REVISION-2010) Reg. No.. Signature. FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- OCTOBER, 2012 OPERATING SYSTEM (Common to CT and IF) (Maximum marks: 100) [Time: 3 hours

More information

UNIT:2. Process Management

UNIT:2. Process Management 1 UNIT:2 Process Management SYLLABUS 2.1 Process and Process management i. Process model overview ii. Programmers view of process iii. Process states 2.2 Process and Processor Scheduling i Scheduling Criteria

More information

Unit In a time - sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the

Unit In a time - sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the Unit - 5 1. In a time - sharing operating system, when the time slot given to a process is completed, the process goes from the RUNNING state to the (A) BLOCKED state (B) READY state (C) SUSPENDED state

More information

CPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science

CPU Scheduling. Rab Nawaz Jadoon. Assistant Professor DCS. Pakistan. COMSATS, Lahore. Department of Computer Science CPU Scheduling Rab Nawaz Jadoon DCS COMSATS Institute of Information Technology Assistant Professor COMSATS, Lahore Pakistan Operating System Concepts Objectives To introduce CPU scheduling, which is the

More information

CS3733: Operating Systems

CS3733: Operating Systems CS3733: Operating Systems Topics: Process (CPU) Scheduling (SGG 5.1-5.3, 6.7 and web notes) Instructor: Dr. Dakai Zhu 1 Updates and Q&A Homework-02: late submission allowed until Friday!! Submit on Blackboard

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 10 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Chapter 6: CPU Scheduling Basic Concepts

More information

1. Draw and explain program flow of control without and with interrupts. [16]

1. Draw and explain program flow of control without and with interrupts. [16] Code No: R05310503 Set No. 1 1. Draw and explain program flow of control without and with interrupts. [16] 2. Explain the following transitions: (a) Blocked Blocked/Suspended. (b) Blocked/Suspended Ready/Suspended.

More information

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

(MCQZ-CS604 Operating Systems)

(MCQZ-CS604 Operating Systems) command to resume the execution of a suspended job in the foreground fg (Page 68) bg jobs kill commands in Linux is used to copy file is cp (Page 30) mv mkdir The process id returned to the child process

More information

UNIT I PROCESSES AND THREADS

UNIT I PROCESSES AND THREADS 2 MARKS QUESTIONS AND ANSWERS 16 MARKS QUESTION BANK 1.What is an operating system? UNIT I PROCESSES AND THREADS An operating system is a program that manages the computer hardware. it act as an intermediate

More information

CSE 4/521 Introduction to Operating Systems. Lecture 27 (Final Exam Review) Summer 2018

CSE 4/521 Introduction to Operating Systems. Lecture 27 (Final Exam Review) Summer 2018 CSE 4/521 Introduction to Operating Systems Lecture 27 (Final Exam Review) Summer 2018 Overview Objective: Revise topics and questions for the final-exam. 1. Main Memory 2. Virtual Memory 3. Mass Storage

More information

CS6401- Operating System QUESTION BANK UNIT-IV

CS6401- Operating System QUESTION BANK UNIT-IV Part-A QUESTION BANK UNIT-IV 1. What is a File? A file is a named collection of related information that is recorded on secondary storage. A file contains either programs or data. A file has certain structure

More information

FCM 710: Architecture of Secure Operating Systems

FCM 710: Architecture of Secure Operating Systems FCM 710: Architecture of Secure Operating Systems Practice Exam, Spring 2010 Email your answer to ssengupta@jjay.cuny.edu March 16, 2010 Instructor: Shamik Sengupta Multiple-Choice 1. operating systems

More information

LECTURE 3:CPU SCHEDULING

LECTURE 3:CPU SCHEDULING LECTURE 3:CPU SCHEDULING 1 Outline Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time CPU Scheduling Operating Systems Examples Algorithm Evaluation 2 Objectives

More information

Course Syllabus. Operating Systems

Course Syllabus. Operating Systems Course Syllabus. Introduction - History; Views; Concepts; Structure 2. Process Management - Processes; State + Resources; Threads; Unix implementation of Processes 3. Scheduling Paradigms; Unix; Modeling

More information

Chapter 5 CPU scheduling

Chapter 5 CPU scheduling Chapter 5 CPU scheduling Contents Basic Concepts Scheduling Criteria Scheduling Algorithms Multiple-Processor Scheduling Real-Time Scheduling Thread Scheduling Operating Systems Examples Java Thread Scheduling

More information

1. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.

1. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. 1. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. What will be the ratio of page faults for the following replacement algorithms - FIFO replacement

More information

Mid Term from Feb-2005 to Nov 2012 CS604- Operating System

Mid Term from Feb-2005 to Nov 2012 CS604- Operating System Mid Term from Feb-2005 to Nov 2012 CS604- Operating System Latest Solved from Mid term Papers Resource Person Hina 1-The problem with priority scheduling algorithm is. Deadlock Starvation (Page# 84) Aging

More information

Student Name:.. Student ID... Course Code: CSC 227 Course Title: Semester: Fall Exercises Cover Sheet:

Student Name:.. Student ID... Course Code: CSC 227 Course Title: Semester: Fall Exercises Cover Sheet: King Saud University College of Computer and Information Sciences Computer Science Department Course Code: CSC 227 Course Title: Operating Systems Semester: Fall 2016-2017 Exercises Cover Sheet: Final

More information

PROCESSES & THREADS. Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA Charles Abzug

PROCESSES & THREADS. Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA Charles Abzug PROCESSES & THREADS Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA 22807 Voice Phone: 540-568-8746; Cell Phone: 443-956-9424 E-mail: abzugcx@jmu.edu OR CharlesAbzug@ACM.org

More information

CPU Scheduling: Objectives

CPU Scheduling: Objectives CPU Scheduling: Objectives CPU scheduling, the basis for multiprogrammed operating systems CPU-scheduling algorithms Evaluation criteria for selecting a CPU-scheduling algorithm for a particular system

More information

CPU Scheduling. The scheduling problem: When do we make decision? - Have K jobs ready to run - Have N 1 CPUs - Which jobs to assign to which CPU(s)

CPU Scheduling. The scheduling problem: When do we make decision? - Have K jobs ready to run - Have N 1 CPUs - Which jobs to assign to which CPU(s) CPU Scheduling The scheduling problem: - Have K jobs ready to run - Have N 1 CPUs - Which jobs to assign to which CPU(s) When do we make decision? 1 / 31 CPU Scheduling new admitted interrupt exit terminated

More information

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition

Chapter 6: CPU Scheduling. Operating System Concepts 9 th Edition Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time

More information

CPU Scheduling. CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections )

CPU Scheduling. CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections ) CPU Scheduling CSE 2431: Introduction to Operating Systems Reading: Chapter 6, [OSC] (except Sections 6.7.2 6.8) 1 Contents Why Scheduling? Basic Concepts of Scheduling Scheduling Criteria A Basic Scheduling

More information

CIS 21 Final Study Guide. Final covers ch. 1-20, except for 17. Need to know:

CIS 21 Final Study Guide. Final covers ch. 1-20, except for 17. Need to know: CIS 21 Final Study Guide Final covers ch. 1-20, except for 17. Need to know: I. Amdahl's Law II. Moore s Law III. Processes and Threading A. What is a process? B. What is a thread? C. Modes (kernel mode,

More information

1995 Paper 10 Question 7

1995 Paper 10 Question 7 995 Paper 0 Question 7 Why are multiple buffers often used between producing and consuming processes? Describe the operation of a semaphore. What is the difference between a counting semaphore and a binary

More information

OPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs:

OPERATING SYSTEMS. UNIT II Sections A, B & D. An operating system executes a variety of programs: OPERATING SYSTEMS UNIT II Sections A, B & D PREPARED BY ANIL KUMAR PRATHIPATI, ASST. PROF., DEPARTMENT OF CSE. PROCESS CONCEPT An operating system executes a variety of programs: Batch system jobs Time-shared

More information

AC59/AT59/AC110/AT110 OPERATING SYSTEMS & SYSTEMS SOFTWARE DEC 2015

AC59/AT59/AC110/AT110 OPERATING SYSTEMS & SYSTEMS SOFTWARE DEC 2015 Q.2 a. Explain the following systems: (9) i. Batch processing systems ii. Time sharing systems iii. Real-time operating systems b. Draw the process state diagram. (3) c. What resources are used when a

More information

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)

CPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process

More information

Processes The Process Model. Chapter 2 Processes and Threads. Process Termination. Process States (1) Process Hierarchies

Processes The Process Model. Chapter 2 Processes and Threads. Process Termination. Process States (1) Process Hierarchies Chapter 2 Processes and Threads Processes The Process Model 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling Multiprogramming of four programs Conceptual

More information

Chapter 5: CPU Scheduling. Operating System Concepts 8 th Edition,

Chapter 5: CPU Scheduling. Operating System Concepts 8 th Edition, Chapter 5: CPU Scheduling Operating System Concepts 8 th Edition, Hanbat National Univ. Computer Eng. Dept. Y.J.Kim 2009 Chapter 5: Process Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms

More information

Processes The Process Model. Chapter 2. Processes and Threads. Process Termination. Process Creation

Processes The Process Model. Chapter 2. Processes and Threads. Process Termination. Process Creation Chapter 2 Processes The Process Model Processes and Threads 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling Multiprogramming of four programs Conceptual

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2019 Lecture 8 Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ POSIX: Portable Operating

More information

COSC243 Part 2: Operating Systems

COSC243 Part 2: Operating Systems COSC243 Part 2: Operating Systems Lecture 17: CPU Scheduling Zhiyi Huang Dept. of Computer Science, University of Otago Zhiyi Huang (Otago) COSC243 Lecture 17 1 / 30 Overview Last lecture: Cooperating

More information

Operating System Design

Operating System Design Module 6: Operating System Design Stage 1 Semester 2 Module Title Module Number/Reference 6 Module Status (Mandatory/Elective) Module ECTS credit 5 Module NFQ level (only if applicable) Pre-requisite Module

More information