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

Size: px
Start display at page:

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

Transcription

1 BCA-3 rd Semester 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 to user view. 3. List any four components of computer system. 4. Give any two differences between distributed operating system with real time operating system. 5. Give any two examples of mobile operating system. 6. Give a brief description of batch operating system. 7. Draw a diagram of memory layout for a multiprogramming system. 8. Name an operating system service that keep the track of users and resource utilization. 9. Which are the two operations performed in file system manipulation? 10. Give at least four services of operating system. 11. What is the importance of protection and security service of operating system? 12. How multiprogramming increases CPU utilization? 13. What does job pool consists? 14. Why CPU is never idle in multiprogramming system? 15. Differentiate between hard real time system and soft real time system. 16. Give at least one case where operating system is designed to maximize resource utilization. 17. What act as an intermediary between User and Hardware of Computer? Define it. Long Answer Questions : 1. Why we need Operating System? Explain it with reference to the responsibilities of Operating System. 2. Explain operating system structure in detail. 3. State any five classifications of operating system and explain any two of them. 4. Discuss any four services of operating system. 5. Describe components of computer system with the help of diagram. 6. Discuss the way in which operating system provides communication services. 7. Describe batch operating system and distributed operating system in detail. Ms. Anita Gianchandani Page 1

2 Select appropriate answer from the given options. 1. Operating System is responsible for A. Providing resources that are required by the user or applications B. Providing initial set-ups C. Services that is required for the communication over the network D. All of the above 2. Operating System ensures that all users get sufficient A. Processor time B. Throughput C. Turnaround time D. Response time 3. Which of the following operating system works on First Come First Served manner? A. Distributed Operating System B. Batch Operating System C. Time Sharing Operating System D. Multi programming Operating System 4. Which service of operating system keeps track of which users use how much and what kinds of computer resources? A. Program Execution B. I/O operations C. File-system manipulation D. Accounting 5. File system manipulation is responsible for A. Creating, deleting and naming files B. Detecting errors C. Allocating resources D. Executing programs 6. Which operating system allows many users to share the computer simultaneously A. Time-shared operating system B. personal operating system C. Batch Operating system D. Multiprogrammed operating system. 7. Operating System records the that leads to the error condition. A. Parallel events B. Event Handler C. Sequence Of events D. jobs in pool 8. Which of the following is the software layer nearest to the hardware? A.Operating System Ms. Anita Gianchandani Page 2

3 B. Application Program C. Compiler D. Loader 9. Operating System schedules the operations in order. A. Input, Data, Output B. Input, Output, Data C. Data, Input, Output D. Data, Output, Input Unit: 2 Process and Process Management Short Questions : 1. Give at least two differences between the following: a) Program and process. b) I/O bound process and CPU bound process. c) Job queue, Ready queue and Device queue. d) Long term and Short term Scheduler. 2. State one use of heap in the process when a process is loaded in memory. 3. In which state a process is when it is ready to be assigned to processor. 4. What is the need of program counter in Process Control Block? 5. State any three events that can occur after a CPU is allocated to the process. 6. Which information of process control block includes information about process priorities and pointers to scheduling queues? 7. Identify the task that includes switching the CPU to another process requires saving the state of the old process and loading the saved state for the new process. 8. Which two possibilities exist in terms of execution if a process creates a new process? 9. State at least two reasons why a parent terminates the execution of one of its children. 10. Name the phenomenon in which if a process terminates (either normally or abnormally), then all its children must also be terminated. Long Questions : 1. Discuss process control block with all its information. 2. Differentiate between long term scheduler and short term scheduler. 3. Explain context switch with the help of diagram. 4. Write a note on CPU-I/O burst cycle. 5. Describe scheduling criteria. 6. Compare and contrast FCFS and SJF scheduling algorithms. 7. Discuss process creation with possibilities of execution and address space. 8. Explain process states with the help of diagram. Ms. Anita Gianchandani Page 3

4 9. Explain the differences in the degree to which the following scheduling algorithms discriminate in favour of short processes: a. FCFS b. RR Practical Based Questions. 1. Assume you have the following five jobs to execute with one processor, with the jobs Arriving in the order listed in Table given below. Use FCFS, SJF and Priority non-pre-emptive scheduling algorithm. Process Burst Time Priority P P2 4 3 P3 8 1 P4 4 2 P5 6 6 a) Create a Gantt (timeline) chart illustrating the execution of these processes? b) What is the average turnaround time? c) What is the average waiting time? 2. Consider the following set of process, with the length of CPU burst time given in milliseconds: Process Burst Time Priority P1 4 3 P2 7 1 P P P5 3 4 The process are assumed to have arrived at time 0. Draw the Gantt chart illustrating the execution of these processes using FCFS, SJF, Priority scheduling (Small number implies higher priority), RR Scheduling (Time slice=2 ms). 3. Illustrate with an example the relationship between contexts switch and time slice. 4. Illustrate with an example how low priority processes suffer starvation. Select appropriate answer from the given options. 1. In Unix, Which system call creates the new process? A. fork B. create C. new 2. A process stack does not contain A. function parameters B. local variables C. return addresses D. PID of child process Ms. Anita Gianchandani Page 4

5 3. The address of the next instruction to be executed by the current process is provided by the A. CPU registers B. program counter C. process stack D. pipe 4. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called A. job queue B. ready queue C. execution queue D. process queue 5. The interval from the time of submission of a process to the time of completion is termed as A. waiting time B. turnaround time C. response time D. throughput 6. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first? A. first-come, first-served scheduling B. shortest job scheduling C. priority scheduling 7. In priority scheduling algorithm A. CPU is allocated to the process with highest priority B. CPU is allocated to the process with lowest priority C. equal priority processes cannot be scheduled 8. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of A. all process B. currently running process C. parent process D. init process 9. The number of processes completed per unit time is known as. A. Output B. Throughput C. Efficiency D. Capacity 10. The Process Control Block is : A. Process type variable B. Data Structure C. a secondary storage section Ms. Anita Gianchandani Page 5

6 D. a Block in memory 11. Which of the following do not belong to queues for processes? A. Job Queue B. PCB queue C. Device Queue D. Ready Queue 12. When the process issues an I/O request : A. It is placed in an I/O queue B. It is placed in a waiting queue C. It is placed in the ready queue D. It is placed in the Job queue 13. What is a long-term scheduler? A. It selects which process has to be brought into the ready queue B. It selects which process has to be executed next and allocates CPU C. It selects which process to remove from memory by swapping 14. The context of a process in the PCB of a process does not contain : A. the value of the CPU registers B. the process state C. memory-management information D. context switch time 15. Which of the following state transitions is not possible? A. blocked to running B. ready to running C. blocked to ready D. running to blocked 16. A parent process calling system call will be suspended until children processes terminate. A. wait B. fork C. exit D. exec 17. In UNIX, each process is identified by its : A. Process Control Block B. Device Queue C. Process Identifier 18. In UNIX, the return value for the fork system call is for the child process and for the parent process. A. A Negative integer, Zero B. Zero, A Negative integer C. Zero, A nonzero integer D. A nonzero integer, Zero 19. The child process can : (choose two) Ms. Anita Gianchandani Page 6

7 A. be a duplicate of the parent process B. never be a duplicate of the parent process C. have another program loaded into it D. never have another program loaded into it 20. The child process completes execution, but the parent keeps executing, then the child process is known as : A. Orphan B. Zombie C. Body D. Dead 21. The initial program that is run when the computer is powered up is called : A. boot program B. bootloader C. initializer D. bootstrap program 22. Which module gives control of the CPU to the process selected by the short-term scheduler? A. dispatcher B. interrupt C. scheduler 23. A process stack does not contain A. function parameters B. local variables C. return addresses D. PID of child process Unit: 3 Deadlocks Short Answer Questions. 1. List the sequence of utilization of resources by a process under the normal operation. 2. Which system calls are used for request and release of resources if the resources are as follows: a)device b)memory c)file 3. State the ways to determine a deadlock in the system. 4. Identify a condition for deadlock when There must exist a process that is holding at least one resource and is waiting to acquire additional resources that are currently being held by other processes. 5. What is the prevention technique used to ensure that circular wait does not hold? 6. State two side effects for preventing deadlock. 7. List three types of edges used in resource allocation graph. Ms. Anita Gianchandani Page 7

8 8. Give one example for each sharable and non-sharable resource. 9. A system has 2 disk drive, 5 printers and 8 scanners and a process needs 5 scanners, 3 printers and 1 disk drives. 10. What is no pre-emption condition for deadlock characterization? Long Answer Questions : 1. Discuss necessary condition for deadlock characterization. 2. Describe protocol used for preventing hold and wait condition. 3. Explain mutual exclusion and no pre-emption for deadlock prevention. 4. Discuss resource allocation graph for deadlock avoidance. 5. Give a real life example to explain no pre-emption technique prevention. 6. Discuss resource allocation sequence under the normal operation of system. 7. System calls are used for request and release of resources. Elaborate the statement. Practical/Scenario based questions. 1. Consider a system consisting of four resources of the same type that are shared by three processes, each of which needs at most two resources. Show that the system is deadlock free. 2. Consider a system consisting of m resources of the same type, being shared by n processes. Resources can be requested and released by processes only one at a time. Show that the system is deadlock-free if the following two conditions hold: a) The maximum need of each process is between 1 and m resources b) The sum of all maximum needs is less than m + n Select appropriate answer from the given options. 1. A set of processes is deadlock if A. each process is blocked and will remain so forever B. each process is terminated C. all processes are trying to kill each other 2. The circular wait condition can be prevented by A. defining a linear ordering of resource types B. using thread C. using pipes D. all of the mentioned 3. If the wait for graph contains a cycle : A. then a deadlock does not exist B. then a deadlock exists C. then the system is in a safe state D. either b or c 4. A computer system has 6 tape drives, with n processes competing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is : A. 2 B. 3 C. 4 Ms. Anita Gianchandani Page 8

9 D A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock : A. can never occur B. may occur C. has to occur 6. The request and release of resources are. A. command line statements B. interrupts C. system calls D. special program 7. The number of resources requested by a process : A. must always be less than the total number of resources available in the system B. must always be equal to the total number of resources available in the system C. must not exceed the total number of resources available in the system D. must exceed the total number of resources available in the system 8. For Mutual exclusion to prevail in the system : A. at least one resource must be held in a non-sharable mode B. the processor must be a uniprocessor rather than a multiprocessor C. there must be at least one resource in a sharable mode D. All of these 9. For a Hold and wait condition to prevail : A. A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it B. A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes C. A process must hold at least one resource and not be waiting to acquire additional resources 10. Deadlock prevention is a set of methods : A. to ensure that at least one of the necessary conditions cannot hold B. to ensure that all of the necessary conditions do not hold C. to decide if the requested resources for a process have to be given or not D. to recover from a deadlock Unit: 4 Memory Management Short Answer Questions. 1. State at least one difference between compile time, load time and execution time binding. 2. What is instruction cycle? 3. Differentiate logical address space with physical address space. Ms. Anita Gianchandani Page 9

10 4. Which hardware device is responsible for mapping of virtual to physical address space? 5. What is roll in and roll out? 6. In swapping total transfer time is directly proportional to amount of memory swapped. What this statement states? 7. State the three common strategies used to select a free memory hole from the set of available memory hole. 8. What is internal and external fragmentation? 9. What are the two parts in which logical address is divided into? 10. What is the purpose of page table? 11. State at least two difference between page table and frame table. 12. What is Translation look aside buffer? 13. Why Translation look aside buffer must be erased? 14. What is TLB miss and TLB hit? 15. State the purpose of segmentation? 16. What each segment consist of? Long Answer Questions : 1. Discuss dynamic linking and dynamic loading. 2. What is the need of base and limit registers? 3. Describe dynamic relocation with relocation register. 4. Explain swapping with the help of diagram. 5. Discuss contiguous memory allocation with its disadvantages. 6. Describe basic method of paging with proper example. 7. Why paging and segmentation are required? Practical/Scenario based questions: Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K, 417K, 112K, and 426K (in order)? Which algorithm makes the most efficient use of memory? Select appropriate answer from the given options. 1. CPU fetches the instruction from memory according to the value of A. program counter B. status register C. instruction register D. program status word 2. Which one of the following is the address generated by CPU? A. physical address B. absolute address C. logical address D. d) none of the mentioned 3. Run time mapping from virtual to physical address is done by A. memory management unit B. CPU C. PCI Ms. Anita Gianchandani Page 10

11 4. Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called A. fragmentation B. paging C. mapping 5. The address of a page table in memory is pointed by A. stack pointer B. page table base register C. page register D. program counter 6. Program always deals with A. logical address B. absolute address C. physical address D. relative address 7. The page table contains A. base address of each page in physical memory B. page offset C. page size D. d) none of the mentioned 8. What is compaction? A. a technique for overcoming internal fragmentation B. a paging technique C. a technique for overcoming external fragmentation D. a technique for overcoming fatal error 9. Operating System maintains the page table for A. each process B. each thread C. each instruction D. each address 10. In segmentation, each address is specified by : A. a segment number B. an offset C. a value D. a key 11. Each entry in a segment table has a : A. segment base B. segment peak C. segment limit D. segment value 12. The segment base contains the : A. starting logical address of the process Ms. Anita Gianchandani Page 11

12 B. starting physical address of the segment in memory C. segment length 13. The offset d of the logical address must be : A. greater than segment limit B. between 0 and segment limit C. between 0 and the segment number D. greater than the segment number 14. Physical memory is broken into fixed-sized blocks called. A. frames B. pages C. backing store 15. The size of a page is typically : A. varied B. power of 2 C. power of Address Binding is : A. going to an address in memory B. locating an address with the help of another address C. binding two addresses together to form a new address in a different memory space D. a mapping from one address space to another 17. Binding of instructions and data to memory addresses can be done at : A. Compile time B. Load time C. Execution time D. All of these 18. Dynamic loading is : A. loading multiple routines dynamically B. loading a routine only when it is called C. loading multiple routines randomly Unit: 5 Virtual Memory Management Short Answer Questions 1. State at least one advantage of using virtual memory. 2. In which way virtual memory is implemented? 3. Give one use of demand segmentation. 4. What is page fault? 5. What happens if we increase the degree of multiprogramming in page replacement? 6. Which two major problems must be replaced to implement demand paging? Ms. Anita Gianchandani Page 12

13 7. Define: Belady s anamoly 8. Which two implementations are feasible in LRU Replacement algorithm? Long Answer Questions 1. When do page faults occur? Describe the actions taken by the operating system when a page fault occurs. 2. How virtual memory benefits to a system and user? 3. Discuss demand paging in detail. 4. Explain the need for Page Replacement. 5. Discuss the following algorithm in detail: a. First In First Out b. Optimal Page Replacement c. Least Recently Used Select appropriate answer from the given options. 1. Because of virtual memory, the memory can be shared among A. processes B. threads C. instructions 2. is the concept in which a process is copied into main memory from the secondary memory according to the requirement. A. Paging B. Demand paging C. Segmentation D. Swapping 3. Swap space exists in A. primary memory B. secondary memory C. CPU 4. When a program tries to access a page that is mapped in address space but not loaded in physical memory, then A. segmentation fault occurs B. fatal error occurs C. page fault occurs D. no error occurs 5. In FIFO page replacement algorithm, when a page must be replaced A. oldest page is chosen B. newest page is chosen C. random page is chosen 6. Which algorithm chooses the page that has not been used for the longest period of time whenever the page required to be replaced? A. first in first out algorithm Ms. Anita Gianchandani Page 13

14 B. additional reference bit algorithm C. least recently used algorithm D. counting based page replacement algorithm 7. Virtual memory allows : A. execution of a process that may not be completely in memory B. a program to be larger than the physical memory C. a program to be larger than the secondary storage D. execution of a process without being in physical memory 8. Virtual memory is normally implemented by. A. demand paging B. buses C. virtualization D. All of these 9. A page fault occurs when : A. a page gives inconsistent data B. a page cannot be accesses due to its absence from memory C. a page is invisible D. All of these 10. When a page fault occurs, the state of the interrupted process is : A. disrupted B. invalid C. saved 11. When a process begins execution with no pages in memory : A. process execution becomes impossible B. a page fault occurs for every page brought into memory C. process causes system crash 12. When the page fault rate is low : A. the turnaround time increases B. the effective access time increases C. the effective access time decreases D. a and b 13. Which of the following page replacement algorithms suffers from Belady s Anomaly? A. Optimal replacement B. LRU C. FIFO D. Both optimal replacement and FIFO 14. In question 2, if the number of page frames is increased to 4, then the number of page transfers : A. decreases B. increases C. remains the same Ms. Anita Gianchandani Page 14

15 15. A process refers to 5 pages, A, B, C, D, E in the order : A, B, C, D, A, B, E, A, B, C, D, E. If the page replacement algorithm is FIFO, the number of page transfers with an empty internal store of 3 frames is : A. 8 B. 10 C. 9 D A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is : A. LRU B. LFU C. FIFO 17. A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements : P : Increasing the number of page frames allocated to a process sometimes increases the page fault rate Q : Some programs do not exhibit locality of reference Which of the following is TRUE? A. Both P and Q are true, and Q is the reason for P B. Both P and Q are true, but Q is not the reason for P C. P is false but Q is true D. Both P and Q are false 18. When a page is selected for replacement, and its modify bit is set : A. the page is clean B. the page has been modified since it was read in from the disk C. the page is dirty D. a and b 19. The aim of creating page replacement algorithms is to : A. replace pages faster B. increase the page fault rate C. decrease the page fault rate D. to allocate multiple pages to processes 20. A FIFO replacement algorithm associates with each page the A. time it was brought into memory B. size of the page in memory C. page after and before it D. All of these 21. Optimal page replacement algorithm is : A. Replace the page that has not been used for a long time B. Replace the page that has been used for a long time C. Replace the page that will not be used for a long time Ms. Anita Gianchandani Page 15

16 22. LRU page replacement algorithm associates with each page the A. time it was brought into memory B. the time of that page s last use C. page after and before it D. All of these 23. For 3 page frames, the following is the reference string : How many page faults does the LRU page replacement algorithm produce? A. 10 B. 15 C. 11 D The two methods how LRU page replacement policy can be implemented in hardware are : (choose two) A. Counters B. RAM C. Stack D. Registers 25. When using counters to implement LRU, we replace the page with the : A. smallest time value B. largest time value C. greatest size D. None of the mentioned Ms. Anita Gianchandani Page 16

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

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

More information

Addresses in the source program are generally symbolic. A compiler will typically bind these symbolic addresses to re-locatable addresses.

Addresses 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 information

General Objectives: To understand the process management in operating system. Specific Objectives: At the end of the unit you should be able to:

General 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 information

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

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

More information

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

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

More information

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

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

More information

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

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

More information

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

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

More information

ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management

ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective. Part I: Operating system overview: Memory Management ECE 7650 Scalable and Secure Internet Services and Architecture ---- A Systems Perspective Part I: Operating system overview: Memory Management 1 Hardware background The role of primary memory Program

More information

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

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

More information

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

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

More information

Subject Teacher: Prof. Sheela Bankar

Subject Teacher: Prof. Sheela Bankar Peoples Empowerment Group ISB&M SCHOOL OF TECHNOLOGY, NANDE, PUNE DEPARTMENT OF COMPUTER ENGINEERING Academic Year 2017-18 Subject: SP&OS Class: T.E. computer Subject Teacher: Prof. Sheela Bankar 1. Explain

More information

Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science

Virtual Memory. CSCI 315 Operating Systems Design Department of Computer Science Virtual Memory CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture have been largely based on those from an earlier edition of the course text Operating

More information

MC7204 OPERATING SYSTEMS

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

More information

QUESTION BANK UNIT I

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

More information

SNS COLLEGE OF ENGINEERING

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

More information

Chendu College of Engineering & Technology

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

More information

Operating Systems. Overview Virtual memory part 2. Page replacement algorithms. Lecture 7 Memory management 3: Virtual memory

Operating Systems. Overview Virtual memory part 2. Page replacement algorithms. Lecture 7 Memory management 3: Virtual memory Operating Systems Lecture 7 Memory management : Virtual memory Overview Virtual memory part Page replacement algorithms Frame allocation Thrashing Other considerations Memory over-allocation Efficient

More information

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

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

More information

Chapters 9 & 10: Memory Management and Virtual Memory

Chapters 9 & 10: Memory Management and Virtual Memory Chapters 9 & 10: Memory Management and Virtual Memory Important concepts (for final, projects, papers) addressing: physical/absolute, logical/relative/virtual overlays swapping and paging memory protection

More information

CHAPTER NO - 1 : Introduction:

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

More information

Dr. Rafiq Zakaria Campus. Maulana Azad College of Arts, Science & Commerce, Aurangabad. Department of Computer Science. Academic Year

Dr. Rafiq Zakaria Campus. Maulana Azad College of Arts, Science & Commerce, Aurangabad. Department of Computer Science. Academic Year Dr. Rafiq Zakaria Campus Maulana Azad College of Arts, Science & Commerce, Aurangabad Department of Computer Science Academic Year 2015-16 MCQs on Operating System Sem.-II 1.What is operating system? a)

More information

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

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

More information

Operating Systems. Figure: Process States. 1 P a g e

Operating Systems. Figure: Process States. 1 P a g e 1. THE PROCESS CONCEPT A. The Process: A process is a program in execution. A process is more than the program code, which is sometimes known as the text section. It also includes the current activity,

More information

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

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

More information

Operating Systems (Classroom Practice Booklet Solutions)

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

More information

CHAPTER 2: PROCESS MANAGEMENT

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

More information

Unit 3 : Process Management

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

More information

Memory Management. 3. What two registers can be used to provide a simple form of memory protection? Base register Limit Register

Memory 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 information

Exam Guide COMPSCI 386

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

More information

Virtual Memory Outline

Virtual Memory Outline Virtual Memory Outline Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating Kernel Memory Other Considerations Operating-System Examples

More information

Processes. CS 475, Spring 2018 Concurrent & Distributed Systems

Processes. 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 information

(MCQZ-CS604 Operating Systems)

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

More information

PAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo

PAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo PAGE REPLACEMENT Operating Systems 2015 Spring by Euiseong Seo Today s Topics What if the physical memory becomes full? Page replacement algorithms How to manage memory among competing processes? Advanced

More information

SPOS MODEL ANSWER MAY 2018

SPOS MODEL ANSWER MAY 2018 SPOS MODEL ANSWER MAY 2018 Q 1. a ) Write Algorithm of pass I of two pass assembler. [5] Ans :- begin if starting address is given LOCCTR = starting address; else LOCCTR = 0; while OPCODE!= END do ;; or

More information

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

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

More information

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

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

More information

CPU scheduling. Alternating sequence of CPU and I/O bursts. P a g e 31

CPU 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 information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I

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

More information

stack Two-dimensional logical addresses Fixed Allocation Binary Page Table

stack Two-dimensional logical addresses Fixed Allocation Binary Page Table Question # 1 of 10 ( Start time: 07:24:13 AM ) Total Marks: 1 LRU page replacement algorithm can be implemented by counter stack linked list all of the given options Question # 2 of 10 ( Start time: 07:25:28

More information

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

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

More information

Operating Systems Unit 6. Memory Management

Operating Systems Unit 6. Memory Management Unit 6 Memory Management Structure 6.1 Introduction Objectives 6.2 Logical versus Physical Address Space 6.3 Swapping 6.4 Contiguous Allocation Single partition Allocation Multiple Partition Allocation

More information

Memory Management. To improve CPU utilization in a multiprogramming environment we need multiple programs in main memory at the same time.

Memory Management. To improve CPU utilization in a multiprogramming environment we need multiple programs in main memory at the same time. Memory Management To improve CPU utilization in a multiprogramming environment we need multiple programs in main memory at the same time. Basic CPUs and Physical Memory CPU cache Physical memory

More information

Ch 4 : CPU scheduling

Ch 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 information

Chapter 8 & Chapter 9 Main Memory & Virtual Memory

Chapter 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 information

Basic Memory Management

Basic Memory Management Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester 10/15/14 CSC 2/456 1 Basic Memory Management Program must be brought into memory and placed within a process for it

More information

Chapter 9: Virtual Memory

Chapter 9: Virtual Memory Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 2018 L20 Virtual Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 Questions from last time Page

More information

CS3733: Operating Systems

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

More information

Chapter 8: Memory Management. Operating System Concepts with Java 8 th Edition

Chapter 8: Memory Management. Operating System Concepts with Java 8 th Edition Chapter 8: Memory Management 8.1 Silberschatz, Galvin and Gagne 2009 Background Program must be brought (from disk) into memory and placed within a process for it to be run Main memory and registers are

More information

Virtual Memory COMPSCI 386

Virtual Memory COMPSCI 386 Virtual Memory COMPSCI 386 Motivation An instruction to be executed must be in physical memory, but there may not be enough space for all ready processes. Typically the entire program is not needed. Exception

More information

Announcement. Exercise #2 will be out today. Due date is next Monday

Announcement. Exercise #2 will be out today. Due date is next Monday Announcement Exercise #2 will be out today Due date is next Monday Major OS Developments 2 Evolution of Operating Systems Generations include: Serial Processing Simple Batch Systems Multiprogrammed Batch

More information

CS 143A - Principles of Operating Systems

CS 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 information

UNIT - IV. What is virtual memory?

UNIT - IV. What is virtual memory? UNIT - IV Virtual Memory Demand Paging Process creation Page Replacement Allocation of frames Thrashing- File Concept - Access Methods Directory Structure File System Mounting File Sharing Protection.

More information

Chapter 8: Memory Management. Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging

Chapter 8: Memory Management. Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging Chapter 8: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 1 Background Memory management is crucial in better utilizing one of the most important

More information

UNIT I OVERVIEW OF OPERATING SYSTEMS

UNIT I OVERVIEW OF OPERATING SYSTEMS UNIT I OVERVIEW OF OPERATING SYSTEMS Introduction - overview of operating system concepts - Process management and Scheduling, Memory management: partitioning, paging, segmentation, virtual memory, Device

More information

Unit-03 Deadlock and Memory Management Unit-03/Lecture-01

Unit-03 Deadlock and Memory Management Unit-03/Lecture-01 1 Unit-03 Deadlock and Memory Management Unit-03/Lecture-01 The Deadlock Problem 1. A set of blocked processes each holding a resource and waiting to acquire a resource held by another process in the set.

More information

Operating Systems. Memory Management. Lecture 9 Michael O Boyle

Operating Systems. Memory Management. Lecture 9 Michael O Boyle Operating Systems Memory Management Lecture 9 Michael O Boyle 1 Memory Management Background Logical/Virtual Address Space vs Physical Address Space Swapping Contiguous Memory Allocation Segmentation Goals

More information

Page Replacement. 3/9/07 CSE 30341: Operating Systems Principles

Page Replacement. 3/9/07 CSE 30341: Operating Systems Principles Page Replacement page 1 Page Replacement Algorithms Want lowest page-fault rate Evaluate algorithm by running it on a particular string of memory references (reference string) and computing the number

More information

Virtual Memory III. Jo, Heeseung

Virtual Memory III. Jo, Heeseung Virtual Memory III Jo, Heeseung Today's Topics What if the physical memory becomes full? Page replacement algorithms How to manage memory among competing processes? Advanced virtual memory techniques Shared

More information

CS6401- OPERATING SYSTEM

CS6401- 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 information

Chapter 8: Virtual Memory. Operating System Concepts Essentials 2 nd Edition

Chapter 8: Virtual Memory. Operating System Concepts Essentials 2 nd Edition Chapter 8: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 8: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating

More information

III B.Sc[IT] [ ] Semester V Core:Operating systems - 512C Multiple Choice Questions.

III 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 information

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

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

More information

MYcsvtu Notes. Unit - 1

MYcsvtu 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 information

Memory Management. CSCI 315 Operating Systems Design Department of Computer Science

Memory Management. CSCI 315 Operating Systems Design Department of Computer Science Memory Management CSCI 315 Operating Systems Design Department of Computer Science Notice: The slides for this lecture are based on those from Operating Systems Concepts, 9th ed., by Silberschatz, Galvin,

More information

Performance of Various Levels of Storage. Movement between levels of storage hierarchy can be explicit or implicit

Performance of Various Levels of Storage. Movement between levels of storage hierarchy can be explicit or implicit Memory Management All data in memory before and after processing All instructions in memory in order to execute Memory management determines what is to be in memory Memory management activities Keeping

More information

Memory Management Cache Base and Limit Registers base limit Binding of Instructions and Data to Memory Compile time absolute code Load time

Memory Management Cache Base and Limit Registers base limit Binding of Instructions and Data to Memory Compile time absolute code Load time Memory Management To provide a detailed description of various ways of organizing memory hardware To discuss various memory-management techniques, including paging and segmentation To provide a detailed

More information

1 PROCESSES PROCESS CONCEPT The Process Process State Process Control Block 5

1 PROCESSES PROCESS CONCEPT The Process Process State Process Control Block 5 Process Management A process can be thought of as a program in execution. A process will need certain resources such as CPU time, memory, files, and I/O devices to accomplish its task. These resources

More information

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

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

More information

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

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

More information

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM

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

More information

Basic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1

Basic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1 Basic Memory Management Program must be brought into memory and placed within a process for it to be run Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester Mono-programming

More information

Memory management. Requirements. Relocation: program loading. Terms. Relocation. Protection. Sharing. Logical organization. Physical organization

Memory 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 information

OPERATING SYSTEMS. COMS W1001 Introduction to Information Science. Boyi Xie

OPERATING 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 information

Chapter 9: Virtual Memory. Operating System Concepts 9 th Edition

Chapter 9: Virtual Memory. Operating System Concepts 9 th Edition Chapter 9: Virtual Memory Silberschatz, Galvin and Gagne 2013 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped Files Allocating

More information

Chapter 5: CPU Scheduling

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

More information

Operating Systems. Designed and Presented by Dr. Ayman Elshenawy Elsefy

Operating 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 information

Process- Concept &Process Scheduling OPERATING SYSTEMS

Process- Concept &Process Scheduling OPERATING SYSTEMS OPERATING SYSTEMS Prescribed Text Book Operating System Principles, Seventh Edition By Abraham Silberschatz, Peter Baer Galvin and Greg Gagne PROCESS MANAGEMENT Current day computer systems allow multiple

More information

Operating System Concepts

Operating System Concepts Chapter 9: Virtual-Memory Management 9.1 Silberschatz, Galvin and Gagne 2005 Chapter 9: Virtual Memory Background Demand Paging Copy-on-Write Page Replacement Allocation of Frames Thrashing Memory-Mapped

More information

Process Description and Control. Chapter 3

Process Description and Control. Chapter 3 Process Description and Control Chapter 3 Contents Process states Process description Process control Unix process management Process From processor s point of view execute instruction dictated by program

More information

CS604 Final term Paper Fall (2012)

CS604 Final term Paper Fall (2012) CS604- Operating Systems Solved Subjective From Final term Papers 10 July,2013 MC100401285 Moaaz.pk@gmail.com Mc100401285@gmail.com PSMD01 CS604 Final term Paper Fall (2012) 1. Write the names of common

More information

CS370 Operating Systems

CS370 Operating Systems CS370 Operating Systems Colorado State University Yashwant K Malaiya Fall 2016 Lecture 33 Virtual Memory Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ How does the virtual

More information

Operating System - Overview

Operating System - Overview Unit 37. Operating System Operating System - Overview An Operating System (OS) is an interface between a computer user and computer hardware. An operating system is a software which performs all the basic

More information

Part Three - Memory Management. Chapter 8: Memory-Management Strategies

Part Three - Memory Management. Chapter 8: Memory-Management Strategies Part Three - Memory Management Chapter 8: Memory-Management Strategies Chapter 8: Memory-Management Strategies 8.1 Background 8.2 Swapping 8.3 Contiguous Memory Allocation 8.4 Segmentation 8.5 Paging 8.6

More information

OPERATING SYSTEMS: Lesson 4: Process Scheduling

OPERATING SYSTEMS: Lesson 4: Process Scheduling OPERATING SYSTEMS: Lesson 4: Process Scheduling Jesús Carretero Pérez David Expósito Singh José Daniel García Sánchez Francisco Javier García Blas Florin Isaila 1 Content Process creation. Process termination.

More information

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

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

More information

Even in those cases where the entire program is needed, it may not all be needed at the same time (such is the case with overlays, for example).

Even in those cases where the entire program is needed, it may not all be needed at the same time (such is the case with overlays, for example). Chapter 10 VIRTUAL MEMORY In Chapter 9, we discussed various memory-management strategies used in computer systems. All these strategies have the same goal: to keep many processes in memory simultaneously

More information

MARUTHI SCHOOL OF BANKING (MSB)

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

More information

Lecture 2 Process Management

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

More information

TDIU25: Operating Systems II. Processes, Threads and Scheduling

TDIU25: Operating Systems II. Processes, Threads and Scheduling TDIU25: Operating Systems II. Processes, Threads and Scheduling SGG9: 3.1-3.3, 4.1-4.3, 5.1-5.4 o Process concept: context switch, scheduling queues, creation o Multithreaded programming o Process scheduling

More information

Chapter 8 Memory Management

Chapter 8 Memory Management 1 Chapter 8 Memory Management The technique we will describe are: 1. Single continuous memory management 2. Partitioned memory management 3. Relocatable partitioned memory management 4. Paged memory management

More information

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter

Lecture Topics. Announcements. Today: Uniprocessor Scheduling (Stallings, chapter ) Next: Advanced Scheduling (Stallings, chapter Lecture Topics Today: Uniprocessor Scheduling (Stallings, chapter 9.1-9.3) Next: Advanced Scheduling (Stallings, chapter 10.1-10.4) 1 Announcements Self-Study Exercise #10 Project #8 (due 11/16) Project

More information

Final Exam Preparation Questions

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

More information

PESIT SOUTHCAMPUS. Question Bank

PESIT 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 information

Chapter 9: Memory Management. Background

Chapter 9: Memory Management. Background 1 Chapter 9: Memory Management Background Swapping Contiguous Allocation Paging Segmentation Segmentation with Paging 9.1 Background Program must be brought into memory and placed within a process for

More information

Operating Systems. Computer Science & Information Technology (CS) Rank under AIR 100

Operating Systems. Computer Science & Information Technology (CS) Rank under AIR 100 GATE- 2016-17 Postal Correspondence 1 Operating Systems Computer Science & Information Technology (CS) 20 Rank under AIR 100 Postal Correspondence Examination Oriented Theory, Practice Set Key concepts,

More information

Page Replacement Algorithms

Page Replacement Algorithms Page Replacement Algorithms MIN, OPT (optimal) RANDOM evict random page FIFO (first-in, first-out) give every page equal residency LRU (least-recently used) MRU (most-recently used) 1 9.1 Silberschatz,

More information

Some popular Operating Systems include Linux, Unix, Windows, MS-DOS, Android, etc.

Some popular Operating Systems include Linux, Unix, Windows, MS-DOS, Android, etc. 1.1 Operating System Definition An Operating System (OS) is an interface between a computer user and computer hardware. An operating system is a software which performs all the basic tasks like file management,

More information

Virtual Memory CHAPTER CHAPTER OBJECTIVES. 8.1 Background

Virtual Memory CHAPTER CHAPTER OBJECTIVES. 8.1 Background Virtual Memory 8 CHAPTER In Chapter 7, we discussed various memory-management strategies used in computer systems. All these strategies have the same goal: to keep many processes in memory simultaneously

More information