Fundamentals of Operating Systems (COMP355/L) A Student's Manual for Practice Exercises
|
|
- Patricia Morton
- 5 years ago
- Views:
Transcription
1 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
2 Practice Exercises #1 Chapter 1 Introduction Page 2 Practice Exercises #1 Introduction STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: define an operating system, define the tasks of an operating system and its elements Questions 1. What is an operating system? 2. What are the operating system goals? 3. What are the main components of a computer system?
3 Practice Exercises #1 Chapter 1 Introduction Page 3 4. What are the three main purposes of an operating system? 5. We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system to forsake this principle and to waste resources? Why is such a system not really wasteful? 6. What is the main difficulty that a programmer must overcome in writing an operating system for a real-time environment?
4 Practice Exercises #1 Chapter 1 Introduction Page 4 7. How does the distinction between kernel mode and user mode function as a rudimentary form of protection (security) system? 8. Which of the following instructions should be privileged? a. Set value of timer. b. Read the clock. c. Clear memory. d. Issue a trap instruction. e. Turn off interrupts. f. Modify entries in device-status table. g. Switch from user to kernel mode. h. Access I/O device. 9. Some early computers protected the operating system by placing it in a memory partition that could not be modified by either the user job or the operating system itself. Describe two difficulties that you think could arise with such a scheme.
5 Practice Exercises #1 Chapter 1 Introduction Page Some CPUs provide for more than two modes of operation. What are two possible uses of these multiple modes? 11. Timers could be used to compute the current time. Provide a short description of how this could be accomplished.
6 Practice Exercises #1 Chapter 1 Introduction Page Answer to the following questions: a. Give two reasons why caches are useful. b. What problems do they solve? c. What problems do they cause? d. If a cache can be made as large as the device for which it is caching (for instance, a cache as large as a disk), why not make it that large and eliminate the device?
7 Practice Exercises #2 Chapter 2 Operating-System Structures Page 7 Assignment #2 Operating-System Structures STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: To describe the services an operating system provides to users, processes, and other systems To discuss the various ways of structuring an operating system To explain how operating systems are installed and customized and how they boot Exercises 1. What are the fundamental approaches for users to interface with the operating system. Explain these approaches briefly. 2. What is the purpose of system calls?
8 Practice Exercises #2 Chapter 2 Operating-System Structures Page 8 3. What are the five major activities of an operating system with regard to process management? 4. What are the three major activities of an operating system with regard to memory management? 5. What are the three major activities of an operating system with regard to secondarystorage management?
9 Practice Exercises #2 Chapter 2 Operating-System Structures Page 9 6. What is the purpose of the command interpreter? Why is it usually separate from the kernel? 7. What system calls have to be executed by a command interpreter or shell in order to start a new process? 8. What is the purpose of system programs?
10 Practice Exercises #2 Chapter 2 Operating-System Structures Page What is the main advantage of the layered approach to system design? 10. List five services provided by an operating system, and explain how each creates convenience for users. In which cases would it be impossible for user-level programs to provide these services? Explain your answer.
11 Practice Exercises #2 Chapter 2 Operating-System Structures Page Why do some systems store the operating system in firmware, while others store it on disk? 12. How could a system be designed to allow a choice of operating systems from which to boot? What would the bootstrap program need to do? 13. What is the bootstrap program?
12 Practice Exercises #2 Chapter 2 Operating-System Structures Page Operating systems provide an environment for execution of programs and services to programs and users. Fill in the following table with the appropriate OS service description. # Operating System Services Description 1. User interface 2. Program execution 3. I/O operations 4. File-system manipulation 5. Communications 6. Error detection 7. Resource allocation 8. Accounting 9. Protection and security
13 Practice Exercises #3 Chapter 3 Processes Page 13 Assignment #3 Processes STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: To introduce the notion of a process -- a program in execution, which forms the basis of all computation To describe the various features of processes, including scheduling, creation and termination, and communication To explore inter-process communication using shared memory and message passing Exercises 1. What is a process? 2. What are the main components of a process?
14 Practice Exercises #3 Chapter 3 Processes Page What is the difference between a program and a process? 4. What are the used technics for loading executable files? 5. What are the process states? 6. What is a process control block (PCB)?
15 Practice Exercises #3 Chapter 3 Processes Page A PCB contains many pieces of information associated with a specific process. State some of these pieces of information?
16 Practice Exercises #3 Chapter 3 Processes Page What is the objective of multiprogramming? 9. What is the objective of time sharing? 10. How the objective of time sharing can be met? 11. What is a job queue?
17 Practice Exercises #3 Chapter 3 Processes Page What is a ready queue? Where is stored? What does it contain? 13. What is a queueing diagram? Describe it briefly. 14. Describe process scheduling.
18 Practice Exercises #3 Chapter 3 Processes Page What is the difference between I/O-bound and CPU-bound processes? 16. How the number of the I/O-bound and CPU-bound processes should selected by the longterm scheduler? Justify your answer.
19 Practice Exercises #3 Chapter 3 Processes Page Fill in the following table with the words "high" or "low". Process Type Spent Time on I/O Spent Time on Computations I/O-bound process CPU-bound process
20 Practice Exercises #4 Chapter 4 CPU Scheduling Page 20 Assignment #4 CPU Scheduling STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: introduce CPU scheduling, which is the basis for multiprogrammed operating systems describe various CPU-scheduling algorithms discuss evaluation criteria for selecting a CPU-scheduling algorithm for a particular system examine the scheduling algorithms of several operating systems Exercises 1. How many processes can run at a time in a single-processor system? 2. What is the objective of multiprogramming?
21 Practice Exercises #4 Chapter 4 CPU Scheduling Page A process is executed until it must wait, typically for the completion of some I/O request. a. What happens in such situation in a simple computer system? b. What happens in such situation in a multiprogramming system? 4. Almost all computer resources are scheduled before use. The CPU is, of course, one of the primary computer resources. How scheduling is assured? 5. Process execution consists of some operations. a. What are they? b. How are they organized?
22 Practice Exercises #4 Chapter 4 CPU Scheduling Page Let's consider the Histogram of CPU-burst durations depicted in the following figure: (Source: Operating System Concepts 9 th Edition) a. What is the type of the Histogram of CPU-burst durations? b. Describe short and long CPU bursts.
23 Practice Exercises #4 Chapter 4 CPU Scheduling Page 23 c. Describe the distribution of short and long CPU bursts in I/O-bound and CPUbound programs. d. What is the importance of this distribution?
24 Practice Exercises #4 Chapter 4 CPU Scheduling Page Let's consider the case when the CPU becomes idle. a. From where the operating system must select one of the processes? b. What is the role of short-term scheduler?
25 Practice Exercises #4 Chapter 4 CPU Scheduling Page Under which circumstances, CPU-scheduling decisions may take place? When there is a choice for scheduling? 9. When can we say that the scheduling scheme is nonpreemptive or cooperative?
26 Practice Exercises #4 Chapter 4 CPU Scheduling Page When can we say that the scheduling scheme is preemptive? 11. Explain nonpreemptive scheduling. 12. What are the disadvantages of preemptive scheduling? Give some examples.
27 Practice Exercises #4 Chapter 4 CPU Scheduling Page What is a dispatcher? What are its functions? 14. What is a dispatch latency? 15. What are the criteria for comparing CPU scheduling algorithm?
28 Practice Exercises #4 Chapter 4 CPU Scheduling Page Explain how the criteria for comparing CPU scheduling algorithm should be manipulated?
29 Practice Exercises #4 Chapter 4 CPU Scheduling Page What is CPU scheduling? 18. State the most important scheduling algorithms in a system with a single processor.
30 Practice Exercises #5 Chapter 5 Deadlocks Page 30 Assignment #5 Deadlocks STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: identify system resources, identify system resources types, define deadlock conditions Exercises 1. A system consists of a finite number of resources to be distributed among a number of competing processes. The resources are partitioned into several types. State some examples of these types. 2. A system consists of a finite number of resources to be distributed among a number of competing processes. The resources are partitioned into several types. State some examples of these types. Each consisting of some number of identical instances. State an example of these instances. 3. If a process requests an instance of a resource type, then the allocation of any instance of the type will satisfy the request. If it will not, then what can you conclude?
31 Practice Exercises #5 Chapter 5 Deadlocks Page What are the events with which we are mainly concerned when we are with deadlocks? 5. When can we say that a set of processes is in a deadlock state? 6. What type of resources can we have in a system? 7. When a deadlock situation can arise?
32 Practice Exercises #6 Chapter 5 Deadlocks Page 32 Assignment #6 Deadlock Avoidance Safe State STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: define the conditions of safe and unsafe system apply the safe and unsafe conditions to examine and identify the state of the system (safe or unsafe), define deadlock conditions Reminder A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid a deadlock. More formally, a system is in a safe state only if there exists a safe sequence. A sequence of processes is a safe sequence for the current allocation state if, for each, the resource requests that can still be satisfied by the currently available resources plus the resources held by all, with. In this situation, if the resources that needs are not immediately available, then, can wait until all have finished. When they have finished, can obtain all of its needed resources, complete its designated task, return its allocated resources, and terminate. When, terminates, can obtain its needed resources, and so on. If no such sequence exists, then the system state is said to be unsafe. Exercises Figure 1 Safe, unsafe, and deadlock state spaces
33 Practice Exercises #6 Chapter 5 Deadlocks Page 33 Exercises 1. Consider a system with 12 magnetic tape drives and three processes:. The maximum needs by these processes is depicted in the following table. Suppose that, at time, these are holding number of tape drives depicted in this table (Thus, there are 3 free tape drives). Processes Maximum Needs Current Needs at Current Needs at a. Explain the state of the system (safe or unsafe) at time. Justify your answer and fill in the following table. Processes Maximum Needs Current Needs at Allocated Resources at Available Resources at Available Tapes: At time, the system is in state
34 Practice Exercises #6 Chapter 5 Deadlocks Page 34 b. System at time Suppose that, at time process requests and is allocated one more tape drive (3). Processes Maximum Needs Current Needs at Allocated Resources at Available Resources at Available Tapes: At time, the system is in state c. What can you deduce?
35 Practice Exercises #6 Chapter 5 Deadlocks Page 35 Exercises 2. Consider a system with 12 magnetic tape drives and three processes:. The maximum needs by these processes is depicted in the following table. Suppose that, at time, these are holding number of tape drives depicted in this table (Thus, there are 3 free tape drives). Processes Maximum Needs Current Needs at Current Needs at d. System at time At time, the system is in a safe state. The sequence satisfies the safety condition. Process can immediately be allocated all its tape drives and then return them (the system will then have 5 available tape drives); then process can get all its tape drives and return them (the system will then have 10 available tape drives); and finally process can get all its tape drives and return them (the system will then have all 12 tape drives available). Processes Maximum Needs Current Needs at Will need Available Resources after allocation (3-2)+4= (5-5)+10= (10-7)+9=12 Available Tapes: 3 The sequence t time, the system is in safe state e. System at time Suppose that, at time process requests and is allocated one more tape drive (3). Processes Maximum Needs Current Needs at Will need (max current) current Available Resources after allocation (available-wneed)+max (2-2)+4= needs 5 so cannot be satisfied needs 6 so cannot be satisfied Available Tapes: 2 The sequence t time, the system is in unsafe state
36 Practice Exercises #6 Chapter 5 Deadlocks Page 36 (*) The system is no longer in a safe state. At this point, only process, can be allocated all its tape drives. When it returns them, the system will have only 4 available tape drives. Since process, is allocated 5 tape drives but has a maximum of 10, it may request 5 more tape drives. Since they are unavailable, process must wait. Similarly, process may request an additional 6 tape drives and have to wait, resulting in a deadlock. f. What can you deduce? The mistake was in granting the request from process for one more tape drive. If we had made wait until either of the other processes had finished and released its resources, then we could have avoided the deadlock.
37 Practice Exercises #6 Chapter 5 Deadlocks Page 37 Assignment #7 Banker's Algorithm STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: Apply Banker's algorithm (Deadlock-avoidance algorithm) Apply Safety Algorithm for finding out whether or not a system is in a safe state Apply Resource-Request Algorithm which determines if requests can be safely granted. Exercises 1. Consider the following snapshot at for a system that has the following resources depicted in the following table: # of Instances Resource # of Instances And the following processes de depicted in the following table: Processes Current Allocation Maximum Need Current Need (Max- Current) Work+Allocation (According to sequence) (shown A B C A B C A B C in order) Total A B C Total F 3 T = F 4 T = F 2 T = F 1 T = Current Available = =102 Work=Available= 102 Current Available= =102 Work=Available=102
38 Practice Exercises #6 Chapter 5 Deadlocks Page 38 : =314 : =534 : =835 : =946 The system is safe at because there is a safety sequence 2. Can the request (1,0,1) by be granted at? Justify your answer. (True) ( (True) ( Available=Available- = =001 = - = =000 = = =313 Work=Available= 001 Processes Current Allocation Maximum Need Current Need (Max- Current) A B C A B C A B C (shown in order) Work+Allocation (According to sequence) Total A B C F 3 T = F 4 T = F 2 T = F 1 T = The request (1,0,1) by can be granted at because the system will remain safe. The safety sequence is
39 New Exercise Practice Exercises #6 Chapter 5 Deadlocks Page Consider the following snapshot at for a system that has the following resources depicted in the following table: # of Instances Resource # of Instances And the following processes de depicted in the following table: Processes Current Allocation Maximum Need Current Need (Max- Current) Work+Allocation (According to sequence) (shown A B C A B C A B C in order) Total A B C Total F F F F Current Available = =334 Work=Available= 334 Current Available= =102 Work=Available=102
40 Practice Exercises #6 Chapter 5 Deadlocks Page requests [3,3,0] Processes Current Allocation Maximum Need Current Need (Max- Current) Work+Allocation (According to sequence) (shown A B C A B C A B C in order) Total A B C F F F F Total Current Available = =215 Work=Available= 215
41 Practice Exercises #7 Chapter 5 Deadlocks Page 41 Assignment #7 Resource-Allocation and Wait-for Graphs STUDENT LEARNING OUTCOMES: Upon completion of this assignment, a successful student will be able to: examine and investigate deadlock detection algorithms, identify the different used methods to detect deadlocks, apply deadlock detection algorithms and methods to determine the presence of deadlocks identify the conditions which should be provided in order to draw the corresponding wait-for graph use wait-for graph to determine the presence or the absence of deadlocks in a system Reminder Deadlock Detection Algorithm If all resources have only a single instance, then we can define a deadlock detection algorithm that uses a variant of the resource-allocation graph, called a wait-for graph. We obtain this graph from the resource-allocation graph by removing the resource nodes and collapsing the appropriate edges. As before, a deadlock exists in the system if and only if the wait-for graph contains a cycle. To detect deadlocks, the system needs to maintain the wait-for graph and periodically invoke an algorithm that searches for a cycle in the graph. An algorithm to detect a cycle in a graph requires an order of operations, where n is the number of vertices in the graph. 1. We propose that all resources have only a single instance, then we can define a deadlock detection algorithm that uses a variant of the resource-allocation graph, called a wait-for graph. a. What are the conditions which should be verified in order to draw this Resource-Allocation Graph the corresponding Wait-for Graph. b. If the conditions are verified, draw the corresponding Wait-for Graph c. Write the cycles. Observations Wait-For Graph (WFG) is the same as the RAG with the resource elements stripped out.
42 Practice Exercises #7 Chapter 5 Deadlocks Page 42 The cycles can be seen more clearly in this form of the graph. There is deadlock in the system if and only if there exists a cycle or a knot in the wait-for-graph. With about half the number of nodes and edges, the WFG requires only about half the storage of a SRAG. However, WFGs can only be used for SRAGs with single-instance resources. Resources for SRAGs can have any number of instances; However, one cannot create WFGs from these. Exercises 1. We propose the following resource-allocation graph, and we also propose that all resources have only a single instance. Resource-Allocation Graph a. State the conditions which should be provided in order to draw the corresponding wait-for graph?
43 Practice Exercises #7 Chapter 5 Deadlocks Page 43 b. If these condition are provided draw the corresponding wait-for graph? c. State the cycles if they exist. d. What can you conclude?
44 Practice Exercises #7 Chapter 5 Deadlocks Page We propose the following resource-allocation graph, and we also propose that all resources have only a single instance. Resource-Allocation Graph a. State the conditions which should be provided in order to draw the corresponding wait-for graph? b. If these condition are provided draw the corresponding wait-for graph?
45 Practice Exercises #7 Chapter 5 Deadlocks Page 45 c. State the cycles if they exist. d. What can you conclude?
Introduction CHAPTER. Review Questions
1 CHAPTER Introduction Review Questions Section 1.1 1.1 What are the four components of a computer system? 1.2 Provide at least three resources the operating system allocates. 1.3 What is the common name
More informationSo far. Next: scheduling next process from Wait to Run. 1/31/08 CSE 30341: Operating Systems Principles
So far. Firmware identifies hardware devices present OS bootstrap process: uses the list created by firmware and loads driver modules for each detected hardware. Initializes internal data structures (PCB,
More informationCPU scheduling. Alternating sequence of CPU and I/O bursts. P a g e 31
CPU scheduling CPU scheduling is the basis of multiprogrammed operating systems. By switching the CPU among processes, the operating system can make the computer more productive. In a single-processor
More informationDeadlocks. Operating System Concepts - 7 th Edition, Feb 14, 2005
Deadlocks Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock 7.2 Silberschatz,
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 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 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. Prescribed Text Book. Operating System Principles, Seventh Edition. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne
OPERATING SYSTEMS Prescribed Text Book Operating System Principles, Seventh Edition By Abraham Silberschatz, Peter Baer Galvin and Greg Gagne 1 DEADLOCKS In a multi programming environment, several processes
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 informationChapter 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 informationOPERATING SYSTEMS. Deadlocks
OPERATING SYSTEMS CS3502 Spring 2018 Deadlocks Chapter 7 Resource Allocation and Deallocation When a process needs resources, it will normally follow the sequence: 1. Request a number of instances of one
More information1.2 We have stressed the need for an operating system to make efficient use. of the computing hardware. When is it appropriate for the operating
Chapter 1 Introduction Practice Exercises 1.1 What are the three main purposes of an operating system? 1.2 We have stressed the need for an operating system to make efficient use of the computing hardware.
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 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 informationDepartment 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 informationUniversity of Babylon / College of Information Technology / Network Department. Operating System / Dr. Mahdi S. Almhanna & Dr. Rafah M.
Chapter 6 Methods for Handling Deadlocks Generally speaking, we can deal with the deadlock problem in one of three ways: We can use a protocol to prevent or avoid deadlocks, ensuring that the system will
More informationCPU Scheduling: Part I ( 5, SGG) Operating Systems. Autumn CS4023
Operating Systems Autumn 2017-2018 Outline 1 CPU Scheduling: Part I ( 5, SGG) Outline CPU Scheduling: Part I ( 5, SGG) 1 CPU Scheduling: Part I ( 5, SGG) Basic Concepts Typical program behaviour CPU Scheduling:
More informationCS370: System Architecture & Software [Fall 2014] Dept. Of Computer Science, Colorado State University
Frequently asked questions from the previous class survey CS 370: SYSTEM ARCHITECTURE & SOFTWARE [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University OpenMP compiler directives
More informationFrequently asked questions from the previous class survey
CS 370: OPERATING SYSTEMS [CPU SCHEDULING] Shrideep Pallickara Computer Science Colorado State University L14.1 Frequently asked questions from the previous class survey Turnstiles: Queue for threads blocked
More informationDeadlock. Chapter Objectives
Deadlock This chapter will discuss the following concepts: The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection
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 informationChapter 7: Deadlocks. Operating System Concepts 8 th Edition,
Chapter 7: Deadlocks, Silberschatz, Galvin and Gagne 2009 Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance
More informationIntroduction to Deadlocks
Unit 5 Introduction to Deadlocks Structure 5.1 Introduction Objectives 5.2 System Model 5.3 Deadlock Characterization Necessary Conditions for Deadlock Resource-Allocation Graph. 5.4 Deadlock Handling
More informationIntroduction CHAPTER. Practice Exercises. 1.1 What are the three main purposes of an operating system? Answer: The three main puropses are:
1 CHAPTER Introduction Practice Exercises 1.1 What are the three main purposes of an operating system? Answer: The three main puropses are: To provide an environment for a computer user to execute programs
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 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 informationChapter 7: Deadlocks. Operating System Concepts 9 th Edition
Chapter 7: Deadlocks Silberschatz, Galvin and Gagne 2013 Chapter 7: Deadlocks System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection
More informationChapter 7: Deadlocks. Operating System Concepts 8 th Edition,! Silberschatz, Galvin and Gagne 2009!
Chapter 7: Deadlocks Operating System Concepts 8 th Edition,! Silberschatz, Galvin and Gagne 2009! Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling
More informationSolution for Operating System
Solution for Operating System May 2016 Index Q.1) a). 2 b). 3 c).3-5 d).5-7 Q.2) a). 7-13 b). 13-14 Q.3) a). 15-17 b). 18-19 Q.4) a). N.A b). N.A Q.5) a). 19-25 b). N.A Q.6) a). 26 b). 27-28 c). N.A d).
More informationChapter 7 : 7: Deadlocks Silberschatz, Galvin and Gagne 2009 Operating System Concepts 8th Edition, Chapter 7: Deadlocks
Chapter 7: Deadlocks, Silberschatz, Galvin and Gagne 2009 Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance
More informationUNIT: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 informationChapter 7: Deadlocks. Operating System Concepts 8 th Edition,
Chapter 7: Deadlocks, Silberschatz, Galvin and Gagne 2009 Chapter Objectives To develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks To present a number
More informationChapter 7: Deadlocks. Operating System Concepts with Java 8 th Edition
Chapter 7: Deadlocks 7.1 Silberschatz, Galvin and Gagne 2009 Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock
More informationScheduling. The Basics
The Basics refers to a set of policies and mechanisms to control the order of work to be performed by a computer system. Of all the resources in a computer system that are scheduled before use, the CPU
More informationChapter 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 informationChapter 8: Deadlocks. The Deadlock Problem
Chapter 8: Deadlocks System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock Combined Approach to Deadlock
More informationChapter 7: Deadlocks. Chapter 7: Deadlocks. The Deadlock Problem. Chapter Objectives. System Model. Bridge Crossing Example
Silberschatz, Galvin and Gagne 2009 Chapter 7: Deadlocks Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 L16 Deadlocks, Main Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Where we are: Deadlocks
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 informationChapter 8: Deadlocks. Operating System Concepts with Java
Chapter 8: Deadlocks System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock Combined Approach to Deadlock
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 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 informationCSE 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 informationThe Deadlock Problem
Deadlocks The Deadlock Problem A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set. Example System has 2 disk drives. P1 and P2 each
More informationRoadmap. Tevfik Ko!ar. CSC Operating Systems Fall Lecture - III Processes. Louisiana State University. Processes. September 1 st, 2009
CSC 4103 - Operating Systems Fall 2009 Lecture - III Processes Tevfik Ko!ar Louisiana State University September 1 st, 2009 1 Roadmap Processes Basic Concepts Process Creation Process Termination Context
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 informationMultiprogramming. Evolution of OS. Today. Comp 104: Operating Systems Concepts 28/01/2013. Processes Management Scheduling & Resource Allocation
Comp 104: Operating Systems Concepts Management Scheduling & Resource Allocation Today OS evolution Introduction to processes OS structure 1 2 Evolution of OS Largely driven by desire to do something useful
More informationCh 4 : CPU scheduling
Ch 4 : CPU scheduling It's the basis of multiprogramming operating systems. By switching the CPU among processes, the operating system can make the computer more productive In a single-processor system,
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 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 informationOPERATING SYSTEMS. COMS W1001 Introduction to Information Science. Boyi Xie
1 OPERATING SYSTEMS COMS W1001 Introduction to Information Science Boyi Xie 2 Announcement Homework 1 is available Grace days A total of 5 days for 5 HWs If all grace days have been used, 50% of the points
More informationOPERATING SYSTEM. Functions of Operating System:
OPERATING SYSTEM Introduction: An operating system (commonly abbreviated to either OS or O/S) is an interface between hardware and user. OS is responsible for the management and coordination of activities
More informationFour Components of a Computer System. Operating System Concepts 7 th Edition, Jan 12, 2005
Introduction Four Components of a Computer System 1.2 Silberschatz, Galvin and Gagne 2005 Computer System Organization Computer-system operation One or more CPUs, device controllers connect through common
More informationChapter 7: Deadlocks
Chapter 7: Deadlocks Chapter 7: Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from
More informationCS370 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 informationOperating System Concepts Ch. 5: Scheduling
Operating System Concepts Ch. 5: Scheduling Silberschatz, Galvin & Gagne Scheduling In a multi-programmed system, multiple processes may be loaded into memory at the same time. We need a procedure, or
More informationComp 204: Computer Systems and Their Implementation. Lecture 9: Deadlock
Comp 204: Computer Systems and Their Implementation Lecture 9: Deadlock 1 Today Deadlock Definition Resource allocation graphs Detecting and dealing with deadlock 2 Deadlock When two trains approach each
More informationTwo hours. Question ONE is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE. Date: Friday 25th January 2013 Time: 14:00-16:00
Two hours Question ONE is COMPULSORY UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Operating Systems Date: Friday 25th January 2013 Time: 14:00-16:00 Please answer Question ONE and any TWO other
More informationTopic 4 Scheduling. The objective of multi-programming is to have some process running at all times, to maximize CPU utilization.
Topic 4 Scheduling The objective of multiprogramming is to have some process running at all times, to maximize CPU utilization. The objective of time sharing is to switch the CPU among processes so frequently.
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 informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 Lecture 8 Threads and Scheduling Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How many threads
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 informationOperating Systems. Introduction & Overview. Outline for today s lecture. Administrivia. ITS 225: Operating Systems. Lecture 1
ITS 225: Operating Systems Operating Systems Lecture 1 Introduction & Overview Jan 15, 2004 Dr. Matthew Dailey Information Technology Program Sirindhorn International Institute of Technology Thammasat
More informationOperating System Review
COP 4225 Advanced Unix Programming Operating System Review Chi Zhang czhang@cs.fiu.edu 1 About the Course Prerequisite: COP 4610 Concepts and Principles Programming System Calls Advanced Topics Internals,
More informationCS3733: 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 informationGeneral Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to:
F2007/Unit5/1 UNIT 5 OBJECTIVES General Objectives: To understand the process management in operating system Specific Objectives: At the end of the unit you should be able to: define program, process and
More informationIntroduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras
Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 05 Lecture 18 CPU Scheduling Hello. In this lecture, we
More informationChapter 13: I/O Systems
Chapter 13: I/O Systems Chapter 13: I/O Systems I/O Hardware Application I/O Interface Kernel I/O Subsystem Transforming I/O Requests to Hardware Operations Streams Performance 13.2 Silberschatz, Galvin
More informationProperties 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 informationUNIT-3 DEADLOCKS DEADLOCKS
UNIT-3 DEADLOCKS Deadlocks: System Model - Deadlock Characterization - Methods for Handling Deadlocks - Deadlock Prevention. Deadlock Avoidance - Deadlock Detection - Recovery from Deadlock DEADLOCKS Definition:
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 informationSystem Model. Types of resources Reusable Resources Consumable Resources
Deadlocks The Deadlock Problem System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection Recovery from Deadlock System Model Types
More informationChapter 7: Deadlocks. Operating System Concepts 9 th Edition
Chapter 7: Deadlocks Silberschatz, Galvin and Gagne 2013 Chapter 7: Deadlocks System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection
More informationIntroduction. CS3026 Operating Systems Lecture 01
Introduction CS3026 Operating Systems Lecture 01 One or more CPUs Device controllers (I/O modules) Memory Bus Operating system? Computer System What is an Operating System An Operating System is a program
More informationEastern Mediterranean University School of Computing and Technology Department of Information Technology. ITEC202 Operating Systems
Page 1 of 8 ITEC202 Operating Systems, Midterm Exam Eastern Mediterranean University School of Computing and Technology Department of Information Technology ITEC202 Operating Systems ITEC 202 Midterm Examination
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 informationProcesses. CS 475, Spring 2018 Concurrent & Distributed Systems
Processes CS 475, Spring 2018 Concurrent & Distributed Systems Review: Abstractions 2 Review: Concurrency & Parallelism 4 different things: T1 T2 T3 T4 Concurrency: (1 processor) Time T1 T2 T3 T4 T1 T1
More informationChapter 1: Introduction. Operating System Concepts 9 th Edit9on
Chapter 1: Introduction Operating System Concepts 9 th Edit9on Silberschatz, Galvin and Gagne 2013 Chapter 1: Introduction 1. What Operating Systems Do 2. Computer-System Organization 3. Computer-System
More informationRoadmap. Safe State. Deadlock Avoidance. Basic Facts. Safe, Unsafe, Deadlock State. Tevfik Koşar. CSC Operating Systems Spring 2007
CSC 4103 - Operating Systems Spring 2007 Roadmap Lecture - IX Deadlocks - II Deadlocks Deadlock Avoidance Deadlock Detection Recovery from Deadlock Tevfik Koşar Louisiana State University February 15 th,
More informationChapter 7: Deadlocks. Operating System Concepts 9 th Edition
Chapter 7: Deadlocks Silberschatz, Galvin and Gagne 2013 Chapter 7: Deadlocks System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection
More informationUnit 2 : Computer and Operating System Structure
Unit 2 : Computer and Operating System Structure Lesson 1 : Interrupts and I/O Structure 1.1. Learning Objectives On completion of this lesson you will know : what interrupt is the causes of occurring
More informationCSE 120. Fall Lecture 8: Scheduling and Deadlock. Keith Marzullo
CSE 120 Principles of Operating Systems Fall 2007 Lecture 8: Scheduling and Deadlock Keith Marzullo Aministrivia Homework 2 due now Next lecture: midterm review Next Tuesday: midterm 2 Scheduling Overview
More informationChapter 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 informationProcesses and More. CSCI 315 Operating Systems Design Department of Computer Science
Processes and More CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture have been largely based on those accompanying the textbook Operating Systems Concepts,
More informationChapter 6: CPU Scheduling
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne Histogram of CPU-burst Times 6.2 Silberschatz, Galvin and Gagne Alternating Sequence of CPU And I/O Bursts 6.3 Silberschatz, Galvin and Gagne CPU
More informationChapter 7: Deadlocks. Operating System Concepts 9 th Edition
Chapter 7: Deadlocks Silberschatz, Galvin and Gagne 2013 Chapter 7: Deadlocks System Model Deadlock Characterization Methods for Handling Deadlocks Deadlock Prevention Deadlock Avoidance Deadlock Detection
More informationChapter 1: Introduction. Operating System Concepts 8 th Edition,
Chapter 1: Introduction Operating System Concepts 8 th Edition, Silberschatz, Galvin and Gagne 2009 Operating-System Operations Interrupt driven by hardware Software error or system request creates exception
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 informationUNIT 4 DEADLOCKS 4.0 INTRODUCTION
UNIT 4 DEADLOCKS Deadlocks Structure Page Nos 4.0 Introduction 69 4.1 Objectives 70 4.2 Deadlocks 70 4.3 Characterisation of a Deadlock 71 4.3.1 Mutual Exclusion Condition 4.3.2 Hold and Wait Condition
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 informationProcess Description and Control. Chapter 3
Process Description and Control 1 Chapter 3 2 Processes Working definition: An instance of a program Processes are among the most important abstractions in an OS all the running software on a computer,
More informationLecture 2 - Fundamental Concepts
Lecture 2 - Fundamental Concepts Instructor : Bibhas Ghoshal (bibhas.ghoshal@iiita.ac.in) Autumn Semester, 2015 Bibhas Ghoshal IOSY 332C & IOPS 332C: OS Autumn Semester, 2015 1 / 43 Lecture Outline Operating
More informationRicardo Rocha. Department of Computer Science Faculty of Sciences University of Porto
Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Slides based on the book Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter B. Galvin and Greg Gagne,
More informationPrinciples of Operating Systems CS 446/646
Principles of Operating Systems CS 446/646 1. Introduction to Operating Systems a. Role of an O/S b. O/S History and Features Serial processing Simple batch systems Multiprogrammed batch systems Time-sharing
More informationVALLIAMMAI ENGINEERING COLLEGE
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK II SEMESTER CP7204 Advanced Operating Systems Regulation 2013 Academic Year
More informationOperating System Support
Operating System Support Objectives and Functions Convenience Making the computer easier to use Efficiency Allowing better use of computer resources Layers and Views of a Computer System Operating System
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 informationOperating- System Structures
Operating- System Structures 2 CHAPTER Practice Exercises 2.1 What is the purpose of system calls? Answer: System calls allow user-level processes to request services of the operating system. 2.2 What
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 informationOperating Systems. Lecture 07: Resource allocation and Deadlock Management. Elvis C. Foster
Operating Systems Lecture 7: Resource allocation and Deadlock Management Lecture 3 started the discussion of process management, with the emphasis on CPU scheduling. This lecture continues that discussion
More information