MC7204 OPERATING SYSTEMS

Size: px
Start display at page:

Download "MC7204 OPERATING SYSTEMS"

Transcription

1 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 Processes process concept process scheduling operation on processes co-operating processes Inter process communication CPU Scheduling Scheduling criteria Scheduling algorithms Multiple-processor Scheduling. PART A 1. Explain goals of operating system. 2. What is a control program? 3. Why is virtual memory support needed in multi-programmed operating systems? 4. Differentiate multi-programming from time sharing. 5. Define distributed system. 6. What do you mean by graceful degradation in a multiprocessor system? 7. What are the different issues to be considered for developing operating system for handheld systems? 8. State the challenges in the Real Time operating systems. What is meant by hard and soft real time systems? 9. Draw the system structure of any one operating system. 10. What is the purpose of system call? 11. Differentiate program from process. 12. What is Process Control Block (PCB)? 13. Define context switch. How a context of a process is represented in the PCB of a process? 14. Define Inter Process Communication (IPC). 15. What are the uses of job queues, ready queues and device queues? 16. Distinguish between short term and long term scheduling. 17. What is preemptive and non-preemptive scheduling? 18. Write the circumstances in which non-preemptive scheduling do occur. 19. What is a dispatcher? 20. Highlight the working of multilevel feedback queue scheduling algorithm. PART B 1. Discuss the operating system components and their functionalities. (16) 2. (i) Assume you have the following jobs to execute with one processor, with the jobs arriving in the order i Burst time Use FCFS, SJF, RR scheduling (quantum=20) and calculate the average waiting time for the processes. Also calculate the turnaround time for process P3 in each case. (12) (ii) Write a short note on the scheduling criteria. (4)

2 3. Explain the different services provided by an operating system that helps the programmers to ease their programming task and the services provided for enhancing the system performance. (16) 4. (i) Describe different states of a process and Process Control Block (PCB) with neat diagram. (8) (ii) Explain different type of job scheduler with necessary diagram. (8) 5. Consider the following scenario of the jobs to be executed with one processor: P i Burst time (ms) Arrival time (ms) P P P P P Suppose a system uses RR scheduling with a quantum of 15 ms. (i) Create a Gantt chart illustrating the execution of these processes. (7) (ii) What is the turnaround time of P3 (4) (iii)what is the average wait time for the processes? (5) 6. What is Inter Process Communication? Explain how IPC is done. (16) 7. List out the reasons for providing an environment that allows process cooperation and illustrate the concept of cooperating processes. (6 + 10) 8. Distinguish between preemptive and non-preemptive scheduling. List the CPU scheduling algorithms and explain them. (16) 9. (i) State reasons why time shared operating systems are more complex than multiprogrammed operating systems. (4) (ii) Discuss the essential properties of distributed, clustered and real-time operating systems. (12) 10. (i) Differentiate symmetric and asymmetric multiprocessing systems. (6) (ii) Calculate the average waiting time for the following set of processes using SJF preemption and non-preemption scheduling. (10) Process Arrival Time Burst Time P1 0 7 P2 1 3 P3 2 8 P4 3 5

3 11. (i) Given below are the arrival and the burst times of different processes. Schedule these processes according to: (1) SJF algorithm (2) RR Scheduling (Time Quantum=3 ms), (3) FCFS Scheduling. (10) Process Arrival Time Burst Time P1 0 8 P2 1 4 P3 2 9 P4 3 5 (ii) How do clustered systems differ from multiprocessor systems? (6) 12. Assume the following processes arrive for execution at the time indicated and also mention with the length of the CPU-burst time given in milliseconds. Job Burst time (ms) Arrival time (ms) Priority P P P P P (i) Give a Gantt chart illustrating the execution of these processes using FCFS, Round Robin (quantum = 8), SJF (non-preemptive) and Priority (preemptive). (4) (ii) Calculate the average waiting time and average turnaround time for each of the above scheduling algorithm. (12)

4 UNIT II PROCESS SYNCHRONIZATION 9 Process Synchronization Critical Section problem Semaphores Classical problems of synchronization critical regions Monitors Deadlock Characterization Deadlock handling Deadlock Prevention Deadlock avoidance Deadlock Detection Deadlock Recovery Threads Multithreading Models. PART A 1. What do you mean by race condition? 2. State the critical section problem. 3. What is mutual exclusion? 4. What is bounded waiting? 5. What is a semaphore? 6. Write the pseudo code for Wait and Signal semaphore operations. 7. What is the difference between binary and counting semaphore? 8. Differentiate monitor and semaphore. 9. Define deadlock. 10. List two examples of deadlocks that are not related to a computer system environment. 11. List out the necessary simultaneous conditions for deadlock. 12. Mention the methods that ensure that deadlocks cannot occur. 13. What is a safe state? 14. What is the difference between deadlock prevention and avoidance? 15. How do you detect deadlock in a system of single instance of each resource type? 16. Differentiate deadlock and starvation. Give an example. 17. What is a thread? 18. What do you mean by multithreading? 19. What are the advantages of multithreading? 20. What are user level threads? What is the drawback of user level threads? PART B 1. (i) What is a critical section problem? What are the requirements to be satisfied by any solution to this problem? (6) (ii) Explain the working of the different critical section solution algorithms applicable to two processes at a time. (10) 2. (i) What is semaphore? Explain its usage and implementation. (10) (ii) What is a binary semaphore? Explain. (6) 3. Write short notes on: (ii) Critical regions. (8) (ii) Monitors. (8) 4. (i) Discuss how different types of classical problems of synchronization can be solved by using semaphore. (10)

5 (ii) Show that the implementation of a semaphore with a waiting queue may result in deadlock with an example. (6) 5. (i) What is deadlock? Discuss the conditions for deadlock and the methods for handling deadlocks. (9) (ii) Draw a Resource Allocation Graph for the following scenario where P is set of processes, R is set of resources and E is request edge set and also check whether deadlock exists. P = {P1, P2, P3}, R = {R1, R2, R3, R4} and E = {P1ÆR1, P2ÆR3, R1ÆP2, R2ÆP1, R3ÆP3, P3ÆR2}. (7) 6. (i) A system is composed of 4 processes {P1, P2, P3, P4} and 3 types of serially reusable resources {R1, R2, R3}. The number of units of the resources are C = < 3, 2, 2 > Process P1 holds 1 unit of R1 and requests 1 unit of R2 Process P2 holds 2 units of R2 and requests 1 unit each of R1 and R3 Process P3 holds 1 unit of R1 and requests 1 unit of R2 Process P4 holds 2 units of R3 and requests 1 unit of R1 Show the reusable resource graph to represent this system state. Show the reduced form of the graph. Which, if any, of the processes are deadlocked in this state? (8) (ii) What are the different methods to recover from deadlock? Explain. (8) 7. (i) What is the purpose of resource allocation graph? Explain with an example. (6) (ii) Is cycle a sufficient condition for a deadlock in multiple instance single request system? Justify. (4) (iii)discuss the methods used to prevent Hold and Wait condition in deadlocks. (6) 8. Describe the deadlock avoidance algorithms (Banker s Algorithms) and use it to solve the following. Assume a system with 4 resource types (R1, R2, R3, R4) of 6, 4, 4, 2 instances. The maximum claim and the allocation status are as below. Find if the system is in safe state. Also find out if a resource request of P1 for (1, 1, 0, 1) be granted. (16) Maximum claim R1 R2 R3 R4 P P P P P Current allocation R1 R2 R3 R4 P P P P P

6 9. In the following system: Max Needed R1 R2 R3 P P P Allocated Resources R1 R2 R3 R1 R2 R3 P P P Total allocated Total exist R1 R2 R (i) Is the current allocation state safe? (8) (ii) Would the following requests be granted to the current state? (1) Process P1 requests (1, 1, 0). (4) (2) Process P3 requests (0, 1, 0). (4) 10. (i) Write short note on Multithreading. (6) (ii) Use the Banker s algorithm and for the following snapshot of the system Allocated Max Available A B C D ABCD ABCD P P P P P (1) Compute the need matrix. (2) Is the system in a safe state? (3) If a request from process P1 arrives for (0, 3, 2, 0), can the request be granted immediately? (10)

7 UNIT III MEMORY MANAGEMENT 9 Memory Management Swapping Contiguous Memory allocation Paging Segmentation Virtual Memory Demand paging Page Replacement Thrashing PART A 1. Mention any two differences between logical and physical addresses. 2. What are overlays? 3. What do you understand by swap in and swap out of a process? 4. What is fragmentation? 5. Define paging. 6. Why are page sizes always in powers of 2? 7. Calculate the number of bits in the logical and physical address for a system with logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames. 8. Consider a paging system with the page table stored in memory. If a memory reference takes 100 nanoseconds, how long does a paged memory reference take? If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there.) 9. Mention the use of page table length register. 10. What is inverted page table? 11. Differentiate paging and segmentation. 12. Consider logical memory architecture (byte-addressable memory) with 24-bit logical addresses, maximum segment size of 2 MB and page size of 512 bytes. Find the number of bits used to designate segments, pages and page offset. 13. What is virtual memory? 14. How is a lazy swapper useful? 15. Define page fault. 16. Differentiate demand paging and swapping. 17. Calculate the effective access time (EAT) in nanoseconds if an average page fault service time is 25 milliseconds and a memory access time is 100 nanoseconds. 18. Write about the schemes developed for performing counting based page replacement. 19. Define thrashing. 20. What is the cause of thrashing? How does the system detect thrashing? PART B 1. (i) A memory manager for a variable-sized partition strategy has a free list of blocks of size 700, 300, 1000, 2100, 1500 and 1020 bytes. What blocks will be selected to honor the request (in order) for 1512, 910, 386 using best-fit, first fit and worst-fit policy. (6) (ii) With an example, explain multiple partitioned, contiguous memory allocation. What are the drawbacks of this method? (10)

8 2. (i) Implement following memory allocation policies with given data and show the final state of the memory along with time units: (8) (1) FCFS (2) First Fit. Available memory : 35 units, OS : 10 units, User process : 25 units Time of arrival Processing times Memory required (ii) Explain the segmented memory management technique. (8) 3. Discuss in detail about paging and its hardware support. (16) 4. (i) What is the difference between contiguous and noncontiguous memory allocation? (4) (ii) What is the purpose of TLB in paging hardware? (4) (iii)explain the different page table structure available for paging schem e. (8) 5. Explain demand paging memory management scheme with necessary diagrams. (16) 6. What is the need for page replacement policies? Explain the various page replacement policies highlighting the merits and demerits of each policy with suitable examples. (16) 7. Consider the following page reference string 4, 0, 2, 0, 3, 1, 4, 2, 3, 0, 3, 2. Calculate the number of page faults using FIFO and LRU replacements for the frame size of 3 and 4. Find if the algorithms suffer from Belady s anomaly. (16) 8. Consider the following page-reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults would occur for the following replacement algorithms? Assuming four frames and all frames are initially empty. (16) (i) LRU replacement (ii) FIFO replacement (iii)optimal replacement 9. (i) Explain the concepts in working-set model with an example reference string. (8) (ii) What is the advantage of Copy-on-Write pages? (4) (iii)discuss how stack is used for LRU implementation. (4) 10. Explain: (i) Cause of Thrashing. (8) (ii) Page-fault frequency. (8)

9 UNIT IV DISK SCHEDULING AND DISTRIBUTED SYSTEMS 9 Disk Structures Disk Scheduling File Systems Interface File concepts Access methods Directory Structures File System Implementation File Systems structures Directory Implementation Allocation Methods Free Space management Distributed File systems Naming and Transparency Remote File Accesses Stateful Versus Stateless Service File replication PART A 1. What is constant linear velocity and constant angular velocity? 2. State the factors that decide the performance of any disk scheduling algorithm. 3. Define seek time and rotational latency. 4. What is the purpose of CSCAN scheduling? 5. What is a file? 6. List the attributes of a file. 7. List the steps performed by the file manager when the opencall is issued. 8. Define a source and executable file. 9. What is the difference between sequential file access and direct file access? 10. What is a directory? 11. Can different users have files with the same name? How? 12. What is the advantage and disadvantage of two-level directory structure? 13. What is an acyclic graph directory structure? 14. What is the significance of virtual file system layer in a file system implementation? 15. How the directory structure is implemented using hash table? 16. What is the significance of multilevel index in indexed allocation? 17. State the different methods of implementing the free-space list. 18. What is distributed file system? 19. Differentiate location transparency and location independence. 20. How file replication is useful in distributed file systems? PART B 1. Discuss the different disk scheduling approaches with examples. (16) 2. (i) Assume the present position of read/write head is at track 75, moving towards 199 (the highest numbered track) and the disk request queue contains read/write requests for sectors on tracks 84, 159, 111, 90, 180 respectively. What is the total number of head movements in FSCS, SCAN, and LOOK strategies? (10) (ii) Discuss the criteria used for selecting a disk scheduling strategy. (6) 3. Suppose that the head of a moving head disk with 200 tracks, 0 to 199, is currently serving a request at 123 and has just finished a request at track 145. The queue of request is kept in FIFO order 83, 157, 97, 167, 94, 149, 102, 175, 120. What is the total number of head movement needed to specify these requests for (i) SSTF (ii) SCAN (iii) C-SCAN disk scheduling algorithms? (16)

10 4. A hard disk having 500 cylinders, numbered from 0 to 499. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests in FIFO order is 86, 170, 413, 474, 448, 209, 22, 250, 130. What is the total distance that the disk arm moves to satisfy all the pending requests, for each of the following disk scheduling algorithm? (i) SSTF (ii) SCAN (iii) FCFS (iv) LOOK (16) 5. (i) Discuss in detail the file attributes and file operations. (10) (ii) Write a short note on actions to be performed during a file operation if links exist in the directory structure. (6) 6. Describe the most common schemes for defining the logical structure of a directory. (16) 7. Explain the implementation of file system with different space allocation schemes. (16) 8. Write short notes on (i) File access methods (8) (ii) Free space management. (8) 9. Write short notes on (i) Naming and transparency (8) (ii) Stateful versus stateless service (8) 10. Describe in detail the implementation of caching in a distributed file system. (16)

11 UNIT V CASE STUDIES 9 Linux System design Principles process management File Systems Windows Vista Systems Structures Process management memory management Android OS Virtual machine OS. PART A 1. Brief the features of Linux operating system. 2. Write the main components of a Linux system. 3. State the purpose of fork system call. 4. What is argument vector and environment vector in Linux process environment? 5. What is context of a process? 6. How Linux provides support for threads? 7. What is the need of an inode? 8. What is journaling in Linux? 9. List the features of Windows Vista Operating System. 10. What is the significance of the Hardware Abstraction Layer (HAL)? 11. List the functions of I/O manager. 12. Discuss the purpose of object manager. 13. What is the role of virtual memory manager? 14. How single user multitasking is implemented in Windows Vista? 15. Discuss the use of windows virtual address map. 16. What do you mean by windows paging? 17. What is the use of Dalvik Virtual Machine? 18. Brief the runtime environment of Android OS. 19. What are the different classifications of virtual machines? 20. List the advantages and disadvantages of virtual machines? PART B 1. Discuss in detail the design principles of Linux operating system. (16) 2. Describe elaborately the process management in Linux system. (16) 3. Write short notes on (i) Linux virtual file system. (8) (ii) Linux proc file system. (8) 4. Write short notes on (i) Linux ext2fs file system (10) (ii) Journaling (6) 5. Explain in detail the evolution, versions and features of Windows Vista. (16) 6. Explain the system architecture of Windows Vista operating system. (16) 7. Describe the process management in Windows Vista operating system. (16) 8. Explain the memory management in Windows Vista operating system. (16) 9. Discuss the layered architecture of Android operating system. (16) 10. Explain virtual machine operating systems in detail. (16)

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

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM

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

More information

SNS COLLEGE OF ENGINEERING

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

More information

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

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

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

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

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

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

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

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

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

More information

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

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

More information

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

INSTITUTE OF AERONAUTICAL ENGINEERING

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

More information

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK

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

More information

Operating System(16MCA24)

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

More information

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

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

More information

Exam Guide COMPSCI 386

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

More information

CSI3131 Final Exam Review

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

More information

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

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

More information

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

More information

( 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

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

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

More information

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

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

More information

COMP 3361: Operating Systems 1 Final Exam Winter 2009

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

More information

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

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

More information

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

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

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

More information

Main Points of the Computer Organization and System Software Module

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

More information

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

More information

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

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

More information

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

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

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

More information

Indian Institute of Technology, Kharagpur

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

More information

Fall COMP3511 Review

Fall COMP3511 Review Outline Fall 2015 - COMP3511 Review Monitor Deadlock and Banker Algorithm Paging and Segmentation Page Replacement Algorithms and Working-set Model File Allocation Disk Scheduling Review.2 Monitors Condition

More 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

Q 1. (10 Points) Assume that a process executes the following pseudo codes:

Q 1. (10 Points) Assume that a process executes the following pseudo codes: CS630: Operating System Design Second Exam, Spring 2014 Q 1. (10 Points) Assume that a process executes the following pseudo codes: #4 #5 #6 #7 #10 main (int argc, char *argv[ ]) { int I, *input; n = argc

More information

CS6401- Operating System QUESTION BANK UNIT-IV

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

More information

Chapter 6: CPU Scheduling

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

More information

Department of 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

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 FINAL EXAMINATION APRIL 30, 2006 ANSWER ALL OF THE QUESTIONS BELOW.

OPERATING SYSTEMS FINAL EXAMINATION APRIL 30, 2006 ANSWER ALL OF THE QUESTIONS BELOW. OPERATING SYSTEMS FINAL EXAMINATION APRIL 30, 2006 Name ANSWER ALL OF THE QUESTIONS BELOW. 1. Indicate which of the statements below are true or false and EXPLAIN your answer in ONE SENTENCE. a) A multi-level

More information

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

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

More information

Prepared by Heena Patel(Asst. Prof) Page 1

Prepared by Heena Patel(Asst. Prof) Page 1 UNIT-1 Operating System Concept 1. Define an operating system. What is primary goal of OS? 2. What is an OS? 3. What do you mean by multitasking? Give names of OS having this feature. 4. What do you mean

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

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

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

More information

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

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

More information

(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

Solution for Operating System

Solution 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 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

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

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

More information

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

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

More information

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

1. a. Show that the four necessary conditions for deadlock indeed hold in this example.

1. a. Show that the four necessary conditions for deadlock indeed hold in this example. Tutorial 7 (Deadlocks) 1. a. Show that the four necessary conditions for deadlock indeed hold in this example. b. State a simple rule for avoiding deadlocks in this system. a. The four necessary conditions

More information

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

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

More information

Properties of Processes

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

More information

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

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

CPU Scheduling Algorithms

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

More information

CPSC/ECE 3220 Summer 2017 Exam 2

CPSC/ECE 3220 Summer 2017 Exam 2 CPSC/ECE 3220 Summer 2017 Exam 2 Name: Part 1: Word Bank Write one of the words or terms from the following list into the blank appearing to the left of the appropriate definition. Note that there are

More information

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web: Ph:

Delhi Noida Bhopal Hyderabad Jaipur Lucknow Indore Pune Bhubaneswar Kolkata Patna Web:     Ph: Serial :. T_CS_A_Operating System_ Delhi Noida Bhopal yderabad Jaipur Lucknow Indore une Bhubaneswar Kolkata atna Web: E-mail: info@madeeasy.in h: - CLASS TEST - COMUTER SCIENCE & IT Subject : Operating

More information

Announcements. Final Exam. December 10th, Thursday Patrick Taylor Hall. Chapters included in Final. 8.

Announcements. Final Exam. December 10th, Thursday Patrick Taylor Hall. Chapters included in Final. 8. CSC 4103 - Operating Systems Fall 2009 Lecture - XXV Final Review Announcements * You should have received your grades as well as graded papers for: - Homework 1-4 - Quiz 1-3 - Midterm If not, please see

More information

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

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

More information

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

CS4411 Intro. to Operating Systems Final Fall points 12 pages

CS4411 Intro. to Operating Systems Final Fall points 12 pages CS44 Intro. to Operating Systems Final Exam Fall 5 CS44 Intro. to Operating Systems Final Fall 5 points pages Name: Most of the following questions only require very short answers. Usually a few sentences

More information

Chapter 5: CPU Scheduling

Chapter 5: CPU Scheduling COP 4610: Introduction to Operating Systems (Fall 2016) Chapter 5: CPU Scheduling Zhi Wang Florida State University Contents Basic concepts Scheduling criteria Scheduling algorithms Thread scheduling Multiple-processor

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

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

QUESTION BANK UNIT I : 2 Marks

QUESTION BANK UNIT I : 2 Marks QUESTION BANK UNIT I : 2 Marks 1. What is an opearting system? 2. What are operating system services? 3. Describe the operating system operations? 4. Describe the operating system functions? 5. Explain

More 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

CS350: Final Exam Review

CS350: Final Exam Review University of Waterloo CS350: Final Exam Review Gwynneth Leece, Andrew Song, Rebecca Putinski Winter, 2010 Intro, Threads & Concurrency What are the three views of an operating system? Describe them. Define

More information

LECTURE 3:CPU SCHEDULING

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

More information

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

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

More information

CS370 Operating Systems

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

More information

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

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

More information

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

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

More information

CS370 Operating Systems

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

Final Review. Quiz-5 Solutions. Tevfik Koşar

Final Review. Quiz-5 Solutions. Tevfik Koşar CSE 421/521 - Operating Systems Fall 2011 Lecture - XXVII Final Review Quiz-5 Solutions Tevfik Koşar University at Buffalo December 8 th, 2011 1 2 a) r2 happens before p4 : b) p1 happens before r3 : c)

More information

Today: Protection! Protection!

Today: Protection! Protection! Today: Protection! Goals of Protection Domain of Protection Access Matrix Implementation of Access Matrix Revocation of Access Rights Capability-Based Systems Language-Based Protection Lecture 27, page

More information

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

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

More information

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

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

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

More information

CPSC/ECE 3220 Summer 2018 Exam 2 No Electronics.

CPSC/ECE 3220 Summer 2018 Exam 2 No Electronics. CPSC/ECE 3220 Summer 2018 Exam 2 No Electronics. Name: Write one of the words or terms from the following list into the blank appearing to the left of the appropriate definition. Note that there are more

More information

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

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

More information

CSE 153 Design of Operating Systems

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

More information

St. Joseph College of Engineering

St. Joseph College of Engineering St. Joseph College of Engineering Sriperumbudur, Chennai 600 602117 EVEN SEMESTER (2016-2017) Name of the Department : INFORMATION TECHNOLOGY Year /Semester : II /IV Name of the Faculty: MISS. ADLIN.S

More information

Assignment 3 (Due date: Thursday, 10/15/2009, in class) Part One: Provide brief answers to the following Chapter Exercises questions:

Assignment 3 (Due date: Thursday, 10/15/2009, in class) Part One: Provide brief answers to the following Chapter Exercises questions: Assignment 3 (Due date: Thursday, 10/15/2009, in class) Your name: Date: Part One: Provide brief answers to the following Chapter Exercises questions: 4.7 Provide two programming examples in which multithreading

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

Midterm Exam. October 20th, Thursday NSC

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

More information

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

SNS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

SNS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING SNS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6401-OPERATING SYSTEM TWO MARK QUESTIONS WITH ANSWERS 1. What is meant by Mainframe Systems? UNIT -1 OPERATING SYSTEM OVERVIEW

More 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

1993 Paper 3 Question 6

1993 Paper 3 Question 6 993 Paper 3 Question 6 Describe the functionality you would expect to find in the file system directory service of a multi-user operating system. [0 marks] Describe two ways in which multiple names for

More information

Today: Protection. Sermons in Computer Science. Domain Structure. Protection

Today: Protection. Sermons in Computer Science. Domain Structure. Protection Sermons in Simplicity Performance Programming as Craft Information is Property Stay Broad Ack: Tom Anderson, U. Washington Today: Protection Goals of Protection Domain of Protection Access Matrix Implementation

More information

Chapter 5 CPU scheduling

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

More information

UNIT I. Introduction to OS& System Structures

UNIT I. Introduction to OS& System Structures SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Operating Systems(16CS512) Year &Sem: II-B.Tech& II-Sem Course & Branch:

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

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

OPERATING SYSTEMS SOLVED PAPER JUNE

OPERATING SYSTEMS SOLVED PAPER JUNE OPERATING SYSTEMS SOLVED PAPER JUNE - 2013 1(a) List and explain services provided by an operating system that are design to make using computer system more convenient for users. (8 Marks) OPERATING SYSTEM

More information

CPU Scheduling CHAPTER. Exercises

CPU Scheduling CHAPTER. Exercises 5 CHAPTER 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 this chapter,

More information