DEPT OF INFORMATION TECHNOLOGY OPERATING SYSTEMS IT204 / CS202
|
|
- Ann Bond
- 5 years ago
- Views:
Transcription
1 DEPT OF INFORMATION TECHNOLOGY OPERATING SYSTEMS IT204 / CS202 QUESTION BANK UNIT I PART A 1. Explain the main structural elements of a computer. 2. Explain the instruction fetch and execute cycle. 3. How interrupts are accommodated in an instruction cycle? 4. What is an interrupt? How is it handled by OS? 5. Give different I/O Communication techniques. 6. Explain memory hierarchy. 7. In virtually all systems that include DMA modules, DMA access to main memory is given higher priority than processor access to main memory. Why? 8. What is reentrant procedure? 9. What is an OS? 10. What are the functions of OS? 11. What do you mean by utility software? Give an example. 12. What do you mean by application software? Give an example. 13. Define system software. 14. List the services provided by OS? 15. Explain the role of OS as resource manager. 16. What do you mean by kernel? 17. Explain serial processing. 18. What are the problems faced by serial processing systems? 19. Explain batch processing. 20. What is JCL? Give two commands of JCL. 21. What is a monitor? 22. What is resident Monitor? Give its memory layout. 23. Explain multiprogrammed batch system. 24. What are the advantages of multiprogramming? 25. What do mean by time sharing systems? 26. Compare batched multiprogramming systems and time sharing systems. 27. Comment on operating systems design hierarchy. 28. What is a monolithic kernel? 29. Briefly write about microkernel architecture. 30. Define Symmetric Multiprocessing. 31. What are the characteristics symmetric multiprocessor? 32. List the advantages of SMP over uniprocessor architecture. 33. What are the developments that triggered the need for multitasking on PCs.
2 34.Briefly explain kernel/supervisor mode and user mode. PART B 1.Explain in detail how interrupts are processed. 2.Define the essential properties of the following operating systems: a) Batch b)interactive c)time sharing d)real time e)network f)parallel g)distributed h)clustered 3.Explain the different I/O communication techniques. 4.Discuss about the evolution of operating systems. 5. Give an overview of operating systems design hierarchy. 6.Explain the characteristics of modern operating systems. 7.Clearly explain about memory hierarchy and compare the performance of a simple two level memory. 8.A computer consists of a CPU and an I/O device D connected to main memory M via a shared bus with a data bus width of one word.the CPU can execute a maximum of 106 instructions per second.an average instruction requires 5 machine cycles, 3 of which use memory bus.a memory read/write operation uses one machine cycle.suppose that the CPU is continuously executing background programs that require 95% of its instruction execution rate but not any I/O instructions.assume that one processor cycle equals one bus cycle.now suppose that very large blocks of data are to transferred between M and D. a)if programmed I/O is used and each one word I/O transfer requires the CPU to execute two instructions, estimate the maximum I/O data transfer rate, in words per second possible through D. b)estimate the same rate if DMA transfer is used. UNIT II PART A 1. What is a process? 2. List the events that lead to process creation. 3. Write about the different process states, giving the 5 state process model. 4. List atleast 4 reasons for process termination. 5. What is the need for the suspend state? 6. When a process tries to write onto a read-only file, what happens? 7. Explain when does a transition from Blocked state to Blocked/Suspend state occur and vice versa. 8. Explain when does a transition from Ready state to Ready/Suspend state occur and vice versa. 9. What are the reasons for process suspension? 10. What does it mean to preempt a process?
3 11. What is a PCB? 12. What is a process image? 13. Explain the role of PCB? 14. What is a less privileged mode? 15. What is a more privileged mode? 16. List the steps involved in process creation. 17. What is a mode switch? 18. What is a process switch? 19. What is the difference between a process switch and a mode switch? 20. What is the difference between interrupt and trap? Give example. 21. Write note on Non process Kernel. 22. Write note on executing OS functions within user process? 23. What is a process based OS? 24. Define Thread. 25. What is multithreading? 26. What resources are typically shared by all of the threads of a process? 27. List reasons why a mode switch between threads may be cheaper than a mode switch between processes. 28. Give 4 examples of use of threads in a single user multiprocessing system. 29. List advantages of ULTs over KLTs. 30. What are the disadvantages of microkernel design over monolithic design. 31. What are the disadvantages of microkernel based OS? 32. List the operations that are associated with threads? 33. What is thread synchronization? 34. Explain the relationship between threads and processes? 35. What is SMP? 36. Briefly explain about symmetric multiprocessor organization. 37. What is a microkernel? 38. What are the benefits of microkernel organization? 39. What is Monolithic OS? 40. What is the basic form of communication between processes or threads in microkernel based OS? PART B 1. Explain in detail the single thread and multithread process model with diagrams. 2. Compare user level and kernel level threads with necessary diagrams. 3. Compare Master/Slave and SMP architecture. 4. Explain how micro kernel architecture differs from layered kernel architecture. 5. a)explain the various reasons involved in process creation and termination. b) Compare mode switching and process switching in detail. 6. With neat diagram explain the five states involved in process model.
4 7. Explain the various control tables with respect to operating system structure. 8. With suitable diagrams, explain the various elements reside in a process image. 9. a) Draw a queueing diagram for the 7 state process model. b) In the discussion of ULT and KLT, it was pointed out that a disadvantage of ULTs is that when a ULT executes a system call not only is that thread blocked but all of the threads with in the process are blocked. Why it is so? UNIT III PART A 1. What is the difference between multiprogramming and multiprocessing? 2. What is critical section? 3. Explain mutual exclusion briefly. 4. What is meant by deadlock? 5. What is meant by starvation? 6. What does livelock mean? 7. List the requirements for mutual exclusion? 8. What is concurrency? 9. What is the basic requirement for the execution of concurrent processes? 10. What is the difference between competing processes and cooperating processes? 11. What is critical resource? 12. What is busy waiting? Give an example. 13. Write the three types of communications between processes. 14. List the three major complications that concurrent processing add to an operating system. 15. What is synchronization? 16. Demonstrate the use testandset instruction for implementing mutual exclusion. 17. What are the disadvantages of hardware support of mutual exclusion. 18. What is a semaphore? 19. Explain how semaphores may be inspected/manipulated? 20. What do you mean by weak and strong semaphore? 21. State producer/consumer problem. 22. What is a monitor? 23. What conditions are generally associated with readers and writers problem? 24. What are the three conditions that must be present for deadlock to be possible? 25. What are the four conditions that create deadlock? 26. Give example for reusable and consumable resource. 27. How can the hold and wait condition be prevented? 28. List two ways in which no-preemption condition can be prevented. 29. How the circular wait condition be prevented? 30. What is the difference among the dead lock avoidance, prevention and detection? 31. What is safe and unsafe state?
5 32. Define turnaround time, waiting time, and response time. 33. What do you mean by scheduling? 34. What are the types of scheduling? Give example. 35. Write the difference between preemptive and non preemptive scheduling? 36. Briefly describe the three types of processor scheduling. 37. Briefly explain FCFS scheduling. 38. Briefly explain Round robin scheduling. 39. Briefly explain SPN scheduling. 40. Briefly explain SRTF scheduling. 41. Briefly explain HRRN scheduling. 42. Briefly explain Feedback scheduling. PART B 1. Consider the following set of processes with the length of CPU burst time given in ms. Process Burst time Priority P1 8 3 P2 3 1 P3 4 4 P4 2 2 P5 6 5 Processes are assumed to have arrived in the order P1, P2, P3, P4 & P5 and all at time 0. i. Draw 4 Gantt charts illustrating the execution of these processes using FCFS,SJF nonpreemptive, RR(quantum =2) scheduling. ii. What is turnaround time, waiting time, average waiting time of each process for each of the scheduling? 2. a)explain Dekkar s algorithm for solving mutual exclusion problem. b)consider a system with a total of 150 units of memory, allocated to three processes as shown: Process Max Hold Apply banker s algorithm to determine it would be safe to grant each of the following requests.if yes, indicate a sequence of terminations that could be guaranteed possible.if no, show the reduction of the resulting allocation table. i.a fourth process arrives with maximum memory need of 60 and initial need of 25 units. ii. A fourth process arrives with maximum memory need of 60 and initial need of 35 units. 3. a)explain Peterson s algorithm for solving mutual exclusion problem. b)m processes share N resource units that can be reserved and released only one at a time.the maximum need of each process does not exceed M, and the sum of all the
6 maximum needs is less than M+N.Show that a deadlock cannot occur. 4. a)how will you achieve mutual exclusion through hardware support. b)what is a binary semaphore?explain the algorithm for implementing infinite buffer producer/consumer problem using binary semaphore. 5. a)explain the use of semaphore for process co-ordination. b)is busy waiting always less efficient in terms of processor utilization than blocking wait? Explain. 6. a)explain mutual exclusion using semaphore. b)apply deadlock detection algorithm to the following and show the results. Available = Request = Allocation = Clearly explain with the help of an algorithm, how the infinite buffer producer/consumer problem may be solved using semaphore. 8. Clearly explain with the help of an algorithm, how the finite buffer producer/consumer problem may be solved using semaphore. 10.Consider the following snapshot of a system.there are no current outstanding queued unsatisfied requests. available r1 r2 r3 r Current allocation maximum demand still needs Process r1 r2 r3 r4 r1 r2 r3 r4 r1 r2 r3 r4 P P P P P a)compute what each process still might request. b)is the system currently in safe or unsafe state? Why? c)is the system currently deadlocked? Why or Why not? d)which processes, if any, are or may become deadlocked? e)if a request for P3 arrives for (0,1,0,0), can that request be safely granted immediately? In what state ( deadlocked, safe,unsafe) would immediately granting that whole request leave the system?which processes, if any are or may become deadlocked if this whole request is granted immediately? IV UNIT PART A 1.What do you mean by address binding?
7 2.With an example, explain overlays. 3.What do you mean by swapping? 4.What requirements are memory management intended to satisfy? 5.Why is the capability to relocate processes desirable? 6.Why is it not possible to enforce memory protection at compile time? 7.What are some reasons to allow two or more processes to all have access to a particular region of memory? 8.In a fixed partitioning scheme, what are the advantages of using unequal size partitions? 9.What is the difference between internal and external fragmentation? 10.Given memory partitions of 100KB,500KB,200KB,300KB,and 600KB in that order, how would each of the first-fit,best-fit, and worst-fit algorithms place the processes of 212KB,417KB,112KB,and 426KB(in order)?which algorithm makes most efficient use of memory? 11.Describe first-fit allocation algorithm. 12.Describe best-fit allocation algorithm. 13.What are the distinctions among logical, relative, and physical addresses? 14.What is the difference between a page and a frame? 15.What is the difference between a page and a segment? 16.Consider a logical address space of 8 pages of 1024 words each, mapped onto a physical memory of 32 frames. a)how many bits are in the logical address? b)how many bits are in the physical address? 17.Consider a paging system with the page table stored in memory.if a memory reference takes 200 nanoseconds,how long does a paged memory reference take? 18.What is the effect of allowing two entries in a page table to point to the same page frame in memory? 19.Consider the segment table: segment base length What are the physical addresses for the following logical addresses? a)0430 b) Consider the segment table: segment base length
8 What are the physical addresses for the following logical addresses? a)0430 b) What is the difference between simple paging and virtual memory paging? 22.Explain LRU page replacement algorithm. 23.Explain FIFO page replacement algorithm 24.Consider the following page reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6 How many page fault would occur for LRU page replacement algorithm assuming 3 frames? 25. Consider the following page reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1 How many page faults would occur for FIFO page replacement algorithm assuming 4 frames? 26.What is Belady s anomaly?give an example. 27.Explain thrashing? 28.Why is the principle of locality crucial to the use of virtual memory? 29.What elements are typically found in page table entry? Briefly define each element. 30.What is the purpose of a translation lookaside buffer? 31.What is the relationship between FIFO and clock page replacement algorithm? 32.What is accomplished by page buffering? 33.What is the difference between resident set and working set? 34.What is the difference between demand cleaning and precleaning? 35.What is compaction? 36.What is a buddy system? PART B 1.With the help diagrams and tables, explain dynamic partitioning memory management techniques.what are the advantages and disadvantages of this scheme? 2.What is meant by relocation?with the help diagrams, clearly explain the need for relocation and its implementation.give the details of hardware support. 3.a)Explain the buddy system in detail. b)consider a buddy system in which a particular block under the current allocation has an address of i.if the block size is 4, what is the binary address of its buddy? ii.if the block size is 16, what is the binary address of its buddy? 4.a)Explain simple paging technique, giving details of page table and address translation. b)consider the two dimensional array A: int A[][] = new int[100][100]; where A[0][0] is stored at location 200, in a paged memory system with pages of size 200.A small process resides in page 0(locations 0 to 199) for manipulating the A matrix;thus, every instruction fetch will be from page 0.
9 For 3 page frames, how many page faults are generated by the following array initialization loops, using LRU replacement, and assuming page frame has the process in it, and the other two are initially empty: i. for(int j=0;j<=100;j++) for(int i=0;i<=100;i++) A[i][j]=0; ii. for(int i=0; i <=100;i++) for(int j=0;j<=100;j++) A[i][j]=0; 5.a) What do you mean by page fault?explain the response of the operating system to a page fault in detail. b)assuming a page size of 4Kbytes and that a page table entry takes 4 bytes, how many levels of page tables would be required to map a 64bit address space, if the top level page table fits into a single page? 6.A process has 4 page frames allocated to it.the time of the last loading of the page frame, the time of the last access to the page in each page frame, the virtual page number in each frame, and the referenced ( R ) and modified (M) bits for each frame are as shown( the times are clock ticks from the process start at time 0 to the event). Virtual page Number Page Frame Time loaded Time referenced R bit M bit A page fault to virtual page 4 has occurred.which page frame will have its contents replaced for each of the following memory management policies?explain why in each case. a)fifo b)lru c)clock d)optimal 7.A process has 4 page frames allocated to it.the time of the last loading of the page frame, the time of the last access to the page in each page frame, the virtual page number in each frame, and the referenced ( R ) and modified (M) bits for each frame are as shown( the times are clock ticks from the process start at time 0 to the event). Virtual page Number Page Frame Time loaded Time referenced R bit M bit
10 Given the above state of memory, consider the following virtual page reference string: 4,0,0,0,2,4,2,1,0,3,2 How many page faults would occur if the working set policy were used with a window size of 4 instead of a fixed allocation?show clearly when each page fault would occur. 8.a)Explain how address translation is implemented in a two level paging system. b)with the help of a flow chart, explain the operation of paging and translation lookaside buffer. 9)a)Explain the principles of combined paging and segmentation scheme. b)consider a page reference string for a process with a working set of M frames, initially all empty.the page reference string is of length P with N distinct page numbers in it.for any page replacement algorithm, i. What is a lower bound on the number of page faults? ii. What is an upper bound on the number of page faults? 10.Consider a system with memory mapping done on a page basis and using single level page table.assume that the necessary page table is always in memory. a)if a memory reference takes 200ns, how long does a paged memory reference take? b)now, an MMU is added that imposes an overhead of 20ns on a hit or miss.if we assume that 85% of all memory references hit in the MMU TLB, what is the effective access time? c)explain how the TLB hit rate affects the EMAT? V UNIT PART A 1.What is block-oriented devices? 2.Explain DMA. 3.What is buffereing? 4.Compare data rates between Floppy disks and hard drive. 5.What is buffer swapping? 6.Explain CSCAN method. 7.What is Nstep SCAN and FSCAN. 8.What is disk cache? 9.Explain file management system. 10.What is indexed sequential file? 11.What is hashed file? 12.Explain variable length blocking. 13.What is NTFS? 14.Explain indexed file allocation. 15.What is INODE? 16.What is the difference between logical I/O and device I/O?
11 17.What is the importance of double buffer than single buffer.? 18.What delay elements are involved in disk read/write? 19.What is the typical disk sector size? 20.What criteria are important in choosing file organizations? 21.Why is the average search time to find a record in a file less for an indexed sequential file than for a sequential file? 22.List the three blocking methods. 23.List and briefly define three file allocation methods. 24.What are typical access rights that may be granted or denied to a particular user for a particular file.? 25.What is the difference between a file and database. 26.What is seek time? 27.What is rotational delay? 28.Explain stream oriented devices? 29.Explain double buffer and circular buffering? 30.Explain SSTF algorithm? 31.What is the difference between FSCAN and CSCAN? 32.What is tape drive? 33.Explain device driver? 34.What is the difference between indexed and indexed sequential file? 35.What is pile file method? 36. Explain why SSTF scheduling tends to favor middle cylinders over the innermost and outermost cylinders. PART B 1. Discuss the evolution of I/O functions. 2. Explain the following I/O organizations model. a.local peripheral device. b.communications port. c.file system. 3 Explain the various I/O buffer schemes? 4 What are the various disk scheduling polices? Explain. 5 Explain the design and performance considerations of disk cache. 6 a)explain the basic file system architecture. b) The disk rotates at 7,200 RPM, i)what is the average rotational latency of this disk drive? ii)what seek distance can be covered in the time that you found for part a? 7 Explain the various file organizations methods in detail with diagrams. 8 What are the various record blocking methods? Explain in detail. 9 What are the various file allocation methods? Explain in detail?
12 10 Write notes on File directories. 11. Suppose that a disk drive has 5,000 cylinders, numbered 0 to The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86,1470,913,1774,948,1509,1022,1750,130. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms? a.fcfs b.sstf c.scan d.lock e.c-scan f..c-look 12.Compare the performance of C-SCAN and SCAN scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival of a request and the completion of the request s service), the variation in response time, and the effective bandwidth.how does performance depend on the relative sizes of seek time and rotational latency?
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 informationDEPARTMENT 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 informationMC7204 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 informationQUESTION 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 informationSNS 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 informationINSTITUTE 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 informationCLASS: 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 informationCHAPTER 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 informationFinal 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 informationCSI3131 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 informationSYED 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 informationINSTITUTE 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 informationDepartment 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 informationINSTITUTE 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 informationMain 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 informationKINGS 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 informationR13 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 informationCSc33200: Operating Systems, CS-CCNY, Fall 2003 Jinzhong Niu December 10, Review
CSc33200: Operating Systems, CS-CCNY, Fall 2003 Jinzhong Niu December 10, 2003 Review 1 Overview 1.1 The definition, objectives and evolution of operating system An operating system exploits and manages
More informationFollowing are a few basic questions that cover the essentials of OS:
Operating Systems Following are a few basic questions that cover the essentials of OS: 1. Explain the concept of Reentrancy. It is a useful, memory-saving technique for multiprogrammed timesharing systems.
More information2. The system of... generally ran one job at a time. These were called single stream batch processing.
Set 1 1. Which of the following is/ are the part of operating system? A) Kernel services B) Library services C) Application level services D) All of the above 2. The system of... generally ran one job
More informationChendu 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 informationTechno 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 informationOperating 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 informationExam 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 informationCSE 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 informationOperating 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 informationOperating 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 informationSolved MCQs on Operating System Principles. Set-1
Solved MCQs on Operating System Principles Set-1 1. Which of the following is/ are the part of operating system? A) Kernel services B) Library services C) Application level services D) All of the above
More information(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 informationB. 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 informationCourse 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 informationOperating 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 informationArchitectural 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 informationCSC 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 informationLast Class: Synchronization Problems. Need to hold multiple resources to perform task. CS377: Operating Systems. Real-world Examples
Last Class: Synchronization Problems Reader Writer Multiple readers, single writer In practice, use read-write locks Dining Philosophers Need to hold multiple resources to perform task Lecture 10, page
More informationPESIT SOUTHCAMPUS. Question Bank
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..
More informationOperating 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( 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 informationUnit 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 informationCOMP 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 informationCS 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 informationOperating 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 informationI/O Management and Disk Scheduling. Chapter 11
I/O Management and Disk Scheduling Chapter 11 Categories of I/O Devices Human readable used to communicate with the user video display terminals keyboard mouse printer Categories of I/O Devices Machine
More informationVALLIAMMAI 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 informationOPERATING 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 information1. 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 informationCS 143A - Principles of Operating Systems
CS 143A - Principles of Operating Systems Operating Systems - Review of content from midterm to final Prof. Nalini Venkatasubramanian nalini@ics.uci.edu Deadlocks System Model Resource allocation graph,
More informationCSE 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 informationa. A binary semaphore takes on numerical values 0 and 1 only. b. An atomic operation is a machine instruction or a sequence of instructions
CSE 306 -- Operating Systems Spring 2002 Solutions to Review Questions for the Final Exam 1. [20 points, 1 each] rue or False, circle or F. a. A binary semaphore takes on numerical values 0 and 1 only.
More informationFall COMP3511 Review
Outline Fall 2015 - COMP3511 Review Monitor Deadlock and Banker Algorithm Paging and Segmentation Page Replacement Algorithms and Working-set Model File Allocation Disk Scheduling Review.2 Monitors Condition
More informationMemory management. Requirements. Relocation: program loading. Terms. Relocation. Protection. Sharing. Logical organization. Physical organization
Requirements Relocation Memory management ability to change process image position Protection ability to avoid unwanted memory accesses Sharing ability to share memory portions among processes Logical
More informationOPERATING SYSTEM : RBMCQ0402. Third RavishBegusarai.
OPERATING SYSTEM : A MCQ BOOK Code: RBMCQ0402 RavishBegusarai www.ravishbegusarai.wordpres.com Third Edition @RAVISHBEGUSARAI Core Operating System 1) An optimal scheduling algorithm in terms of minimizing
More informationFor The following Exercises, mark the answers True and False
1 For The following Exercises, mark the answers True and False 1. An operating system is an example of application software. False 2. 3. 4. 6. 7. 9. 10. 12. 13. 14. 15. 16. 17. 18. An operating system
More information2 nd Half. Memory management Disk management Network and Security Virtual machine
Final Review 1 2 nd Half Memory management Disk management Network and Security Virtual machine 2 Abstraction Virtual Memory (VM) 4GB (32bit) linear address space for each process Reality 1GB of actual
More informationMemory Management. 3. What two registers can be used to provide a simple form of memory protection? Base register Limit Register
Memory Management 1. Describe the sequence of instruction-execution life cycle? A typical instruction-execution life cycle: Fetches (load) an instruction from specific memory address. Decode the instruction
More informationSistemas Operacionais I. Valeria Menezes Bastos
Sistemas Operacionais I Valeria Menezes Bastos Operating Systems: Internals and Design Principles Chapter 1 Computer System Overview Eighth Edition By William Stallings Summary Basic Elements Evolution
More informationCS350: Final Exam Review
University of Waterloo CS350: Final Exam Review Gwynneth Leece, Andrew Song, Rebecca Putinski Winter, 2010 Intro, Threads & Concurrency What are the three views of an operating system? Describe them. Define
More informationSubject: 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( 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 informationIndian 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 informationStudent 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 informationCS6401- OPERATING SYSTEM
1. What is an Operating system? CS6401- OPERATING SYSTEM QUESTION BANK UNIT-I An operating system is a program that manages the computer hardware. It also provides a basis for application programs and
More informationOperating Systems. Designed and Presented by Dr. Ayman Elshenawy Elsefy
Operating Systems Designed and Presented by Dr. Ayman Elshenawy Elsefy Dept. of Systems & Computer Eng.. AL-AZHAR University Website : eaymanelshenawy.wordpress.com Email : eaymanelshenawy@yahoo.com Reference
More informationMaximum 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 informationDesign of Operating System
Design of Operating System Architecture OS protection, modes/privileges User Mode, Kernel Mode https://blog.codinghorror.com/understanding-user-and-kernel-mode/ a register of flag to record what mode the
More informationOperating Systems. Designed and Presented by Dr. Ayman Elshenawy Elsefy
Operating Systems Designed and Presented by Dr. Ayman Elshenawy Elsefy Dept. of Systems & Computer Eng.. AL-AZHAR University Website : eaymanelshenawy.wordpress.com Email : eaymanelshenawy@yahoo.com Reference
More informationDepartment 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 informationOperating Systems, Fall
EXAM: Thu 22.10. 9.00 CK112 Operating Systems: Wrap-up Fall 2009 Tiina Niklander Questions both in English and Finnish. You may answer in Finnish, Swedish or English. No additional material allowed. You
More informationChapter 8 & Chapter 9 Main Memory & Virtual Memory
Chapter 8 & Chapter 9 Main Memory & Virtual Memory 1. Various ways of organizing memory hardware. 2. Memory-management techniques: 1. Paging 2. Segmentation. Introduction Memory consists of a large array
More informationDEPARTMENT 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 informationMEMORY MANAGEMENT/1 CS 409, FALL 2013
MEMORY MANAGEMENT Requirements: Relocation (to different memory areas) Protection (run time, usually implemented together with relocation) Sharing (and also protection) Logical organization Physical organization
More informationCIS 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 informationMemory Management Virtual Memory
Memory Management Virtual Memory Part of A3 course (by Theo Schouten) Biniam Gebremichael http://www.cs.ru.nl/~biniam/ Office: A6004 April 4 2005 Content Virtual memory Definition Advantage and challenges
More informationScheduling of processes
Scheduling of processes Processor scheduling Schedule processes on the processor to meet system objectives System objectives: Assigned processes to be executed by the processor Response time Throughput
More informationMemory Management. Chapter 4 Memory Management. Multiprogramming with Fixed Partitions. Ideally programmers want memory that is.
Chapter 4 Memory Management Ideally programmers want memory that is Memory Management large fast non volatile 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms
More informationAddresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses.
1 Memory Management Address Binding The normal procedures is to select one of the processes in the input queue and to load that process into memory. As the process executed, it accesses instructions and
More informationCMPS 111 Spring 2003 Midterm Exam May 8, Name: ID:
CMPS 111 Spring 2003 Midterm Exam May 8, 2003 Name: ID: This is a closed note, closed book exam. There are 20 multiple choice questions and 5 short answer questions. Plan your time accordingly. Part I:
More informationECE 3055: Final Exam
ECE 3055: Final Exam Instructions: You have 2 hours and 50 minutes to complete this quiz. The quiz is closed book and closed notes, except for one 8.5 x 11 sheet. No calculators are allowed. Multiple Choice
More informationChapter-6. SUBJECT:- Operating System TOPICS:- I/O Management. Created by : - Sanjay Patel
Chapter-6 SUBJECT:- Operating System TOPICS:- I/O Management Created by : - Sanjay Patel Disk Scheduling Algorithm 1) First-In-First-Out (FIFO) 2) Shortest Service Time First (SSTF) 3) SCAN 4) Circular-SCAN
More informationANNAI MATHAMMAL SHEELA ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK CS6401 OPERATING SYSTEMS
ANNAI MATHAMMAL SHEELA ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK CS6401 OPERATING SYSTEMS PREPARED BY K.KAVITHA, ASP/CSE 2 Marks CS6401-OPERATING SYSTEM UNIT -1 OPERATING
More informationOPERATING 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 informationINSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad - 500 043 COMPUTER SCIENCE AND ENGINEERING DEFINITIONS AND TERMINOLOGY Course Name : OPERATING SYSTEMS Course Code : ACS007 Program
More informationQUESTION BANK UNIT I : 2 Marks
QUESTION BANK UNIT I : 2 Marks 1. What is an opearting system? 2. What are operating system services? 3. Describe the operating system operations? 4. Describe the operating system functions? 5. Explain
More informationUNIT 3. PROCESS MANAGEMENT
This document can be downloaded from www.chetanahegde.in with most recent updates. 1 UNIT 3. PROCESS MANAGEMENT 3.1 PROCESS A process can be defined in several ways: A program in execution An instance
More informationCPSC/ECE 3220 Summer 2017 Exam 2
CPSC/ECE 3220 Summer 2017 Exam 2 Name: Part 1: Word Bank Write one of the words or terms from the following list into the blank appearing to the left of the appropriate definition. Note that there are
More informationDistributed Deadlock Detection
Distributed Deadlock Detection Two Local Wait-For Graphs Global Wait-For Graph Deadlock Detection Centralized Approach Each site keeps a local wait-for graph The nodes of the graph correspond to all the
More informationSNS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
SNS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6401-OPERATING SYSTEM TWO MARK QUESTIONS WITH ANSWERS 1. What is meant by Mainframe Systems? UNIT -1 OPERATING SYSTEM OVERVIEW
More informationGLOSSARY. access method The method that is used to find a file, a record, or a set of records. address space The range of addresses available
Z04_STAL6329_06_SE_GLOS.QXD 2/28/08 3:20 AM Page 785 GLOSSARY access method The method that is used to find a file, a record, or a set of records. address space The range of addresses available to a computer
More informationCSC 716 Advanced Operating System Fall 2007 Exam 1. Answer all the questions. The maximum credit for each question is as shown.
CSC 716 Advanced Operating System Fall 2007 Exam 1 Answer all the questions. The maximum credit for each question is as shown. 1. (15) Multiple Choice(3 points for each): 1) Which of the following statement
More informationOPERATING SYSTEMS SOLVED PAPER JUNE
OPERATING SYSTEMS SOLVED PAPER JUNE - 2013 1(a) List and explain services provided by an operating system that are design to make using computer system more convenient for users. (8 Marks) OPERATING SYSTEM
More informationMYcsvtu Notes. Unit - 1
Unit - 1 An Operating system is a program that manages the computer hardware. It also provides a basis for application programs and acts as an intermediary between a user of a computer and the computer
More informationChapter 5 Concurrency: Mutual Exclusion and Synchronization
Operating Systems: Internals and Design Principles Chapter 5 Concurrency: Mutual Exclusion and Synchronization Seventh Edition By William Stallings Designing correct routines for controlling concurrent
More informationChapter 4 Memory Management
Chapter 4 Memory Management 4.1 Basic memory management 4.2 Swapping 4.3 Virtual memory 4.4 Page replacement algorithms 4.5 Modeling page replacement algorithms 4.6 Design issues for paging systems 4.7
More informationCS450/550 Operating Systems
CS450/550 Operating Systems Lecture 4 memory Palden Lama Department of Computer Science CS450/550 Memory.1 Review: Summary of Chapter 3 Deadlocks and its modeling Deadlock detection Deadlock recovery Deadlock
More informationROEVER 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 informationFundamentals of Operating Systems 2015
Unit : 1 Introduction of Operating Systems, File Systems and Management Short Questions:- 1. What act as an intermediary between User and Hardware of Computer? Define it. 2. What is the significance of
More informationIII B.Sc[IT] [ ] Semester V Core:Operating systems - 512C Multiple Choice Questions.
1 of 24 8/12/17, 3:21 PM Dr.G.R.Damodaran College of Science (Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Reaccredited at the 'A' Grade Level by the NAAC and ISO 9001:2008
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2017 Lecture 9 Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 CPU Scheduling: Objectives CPU scheduling,
More informationFundamentals of Operating Systems (COMP355/L) A Student's Manual for Practice Exercises
Fundamentals of Operating Systems (COMP355/L) A Student's Manual for Practice Exercises Text Book: Operating System Concepts 9 th Edition Silberschatz, Galvin and Gagne 2013 1 Practice Exercises #1 Chapter
More informationOperating 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