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

Similar documents
SNS COLLEGE OF ENGINEERING

MC7204 OPERATING SYSTEMS

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM

QUESTION BANK UNIT I

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

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK

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

CHAPTER NO - 1 : Introduction:

Chendu College of Engineering & Technology

Operating System(16MCA24)

CSI3131 Final Exam Review

PESIT SOUTHCAMPUS. Question Bank

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

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Final Exam Preparation Questions

INSTITUTE OF AERONAUTICAL ENGINEERING

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

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


Main Points of the Computer Organization and System Software Module

Chapter 6: CPU Scheduling

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

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

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

Exam Guide COMPSCI 386

Contents. 1.1 What Operating Systems Do Computer-System Organization Computer-System Architecture 12. Operating-System Structures


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

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

CS6401- OPERATING SYSTEM

CS350: Final Exam Review

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

St. Joseph College of Engineering

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

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

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

CS6401- Operating System QUESTION BANK UNIT-IV

UNIT I. Introduction to OS& System Structures

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

MARUTHI SCHOOL OF BANKING (MSB)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING 2 MARKS AND 11 MARKS FOR ALL UNITS UNIT I

DEPT OF INFORMATION TECHNOLOGY OPERATING SYSTEMS IT204 / CS202

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

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

COMP 3361: Operating Systems 1 Final Exam Winter 2009

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

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

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

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

Chapter 5: CPU Scheduling

CPU Scheduling: Objectives

CHAPTER 2: PROCESS MANAGEMENT

CS370 Operating Systems

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

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

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

Institute of Engineering & Management. Course:CS603- Operating System. Course pre-requisites

Indian Institute of Technology, Kharagpur

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

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

ANNAI MATHAMMAL SHEELA ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING QUESTION BANK CS6401 OPERATING SYSTEMS

LECTURE 3:CPU SCHEDULING

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

SNS COLLEGE OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Chapter 5 CPU scheduling

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

CS370 Operating Systems

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

FCM 710: Architecture of Secure Operating Systems

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

CPU Scheduling Algorithms

QUESTION BANK UNIT I : 2 Marks

Retrieval Exercises for CS 3733 Operating Systems. Instructor: Dr. Turgay Korkmaz Department Computer Science The University of Texas at San Antonio

FCM 710: Architecture of Secure Operating Systems

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

JBIET. Dept of IT. Operating Systems III B.Tech -I Sem. Department of Information Technology

SAZ4B/SAE5A Operating System Unit : I - V

CPU Scheduling. Basic Concepts. Histogram of CPU-burst Times. Dispatcher. CPU Scheduler. Alternating Sequence of CPU and I/O Bursts

OPERATING SYSTEMS SOLVED PAPER JUNE

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

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

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

Midterm Exam. October 20th, Thursday NSC

Chapter 5: CPU Scheduling

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

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

Lecture 2 Process Management

3 rd Year V Semester

OPERATING SYSTEMS CS3502 Spring Processor Scheduling. Chapter 5

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

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

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

VALLIAMMAI ENGINEERING COLLEGE

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

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

Sistemas Operacionais I. Valeria Menezes Bastos

UNIT I PROCESSES AND THREADS

Contents. 1.1 What Operating Systems Do Computer-System Organization Computer-System Architecture 12. Operating-System Structures

Operating Systems : Overview

Transcription:

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 of operating system? 5. Differentiate symmetric multiprocessing and asymmetric multiprocessing? (APRIl-2016) 6. What is the function of command Interpreter? (APRIL-2016) 7. Give the Differences among short-term,medium Term and Long-Term scheduling?(nov-2013) 8. What is the purpose of system calls and system programs? (APRIL-2014) 9. What is the functions of System Programs? (NOV-2014) 10. Diagram of process state? 11. Explain about PCB? 12. What are the possibilities when a new process is created? 13. What are the ways to provide IPC? 14. Differentiate Mainframe and Desktop systems? (Nov-2015) 15. What is meant by Process Scheduling? (NOV-2015) 16. List the main differences between operating systems for mainframe and personal computers?(nov -2013) 17. What is batch processing system? (APRIl-2015) 18. Mention the types of System Calls? (APRIl-2015) PART- B 1. Explain : a)distributed Systems (NOV-2015) b)real-time Systems (APRIL-2015) 2. Discuss in detail the various types of System Calls. (APRIl-2015) 3. Discuss in detail Special Purpose Systems? (NOV-2013) 4. Discuss the different operating system services for the user and for the efficient running of the system. 5. Write short notes on (NOV-2013) a) MultiProcessor Systems b) Clustered Systems (NOV-2013,2014) 6. What are the featues of virtual machine and client/server based Operating Systems?(NOV-2014) Prepared by M.Manjula/AP/IT/RGCET Page 1

7. Explain in detail about the process scheduling. (NOV-2015) 8. Describe in detail about the Interprocess Communication. 9. Briefly explain the major functions of an Operating system? (APRIL-2014) 10. a)explain storage hierarchy in a computer system? (APRIl-2016) b)explain the concept of caching? (APRIL-2016) 10.Explain the layered structure of an Operating Systems? (APRIl-2016) UNIT-II PART- A 1. What are the benefits of multithreaded programming? 2. What are the issues of threading? 3. Draw the CPU-I/O Burst cycle? 4. What are two differences between user-level threads and kernel level threads?under what circumstances is one type better than the other? (NOV-2013,2014) 5. Define preemptive scheduling and nonpreemptive scheduling? (NOV-2014) 6. what are the scheduling criteria? 7. What advantage is there in having different time-quantum sizes on different levels of a multilevel queuing system? (NOV-2013) 8. Define hard realtime and soft real time systems? 9. Explain semaphores? (APRIL-2016,Nov-2015) 10. What is context Switch? (APRIl-2016) 11. What is meant by bounded-buffer problem? 12. Specify any four issues considered with multithreaded programs? (APRIl-2015) 13. State any two classic problems of Synchronization? (APRIL-2015) 14. Write the syntax of a monitor? 15. What are threads? (NOV-2015) 16. Define deadlock 11. Define starvation? 12. What do you meant by Critical Region? (APRIl-2014) 13. List the different CPU scheduling algorithms? (APRIL-2014) PART-B 1. Explain how dining philosophers problem to be solved using Monitors? (NOV-2015) Prepared by M.Manjula/AP/IT/RGCET Page 2

2. Discuss in detail about Semaphores and their Implementation? (NOV-2013,Nov-2015) 3. Consider the following set of processes,with the length of the CPU burst time given in milliseconds: (NOV-2013) Process Burst time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 5 2 The processes are assumed to have arrived in the order P1,P2,P3,P4,P5 all at time 0. a) Draw Gantt charts Illustrating the execution of these processes using a RR Scheduling? b) What is the turn around time of each process? c) What is the waiting time of each process? 4. Describe in detail about the classic problems of synchronization. 5. Explain in detail about the critical section problem? (APRIL-2014) 6. Explain the Producer consumer problem with bounded buffer using either message passing or semaphores? (NOV-2014) 7. Explain in detail about Various CPU scheduling algorithms? (APRIl-2015,Nov-2015,APRIL-2014) 8. Explain the classical problems of synchronization and draw the gant charts of the process using SJF,FCFS,RR scheduling with suitable examples? (NOV-2014) 9. What are the benefits of threads and explain the models of multithreading? 10. Explain the concept of process scheduling in detail? (APRIl-2014,2016) 11. Explain the concept of Transaction atomicity? (APRIl-2016) UNIT- III PART- A 1. What are the four necessary conditions for a deadlock? 2. What is resource allocation graph? 3. What is two phase locking Protocol? (NOV-2013) 4. What are the methods for handling deadlock? 5. Define Deadlock Avoidance? (NOV-2014) 6. Define deadlock prevention and deadlock avoidance? Prepared by M.Manjula/AP/IT/RGCET Page 3

7. What are the three major activities of an operating system with regard to memory management?(nov-2013) 8. List two ways to recover from deadlock? 9. List the three methods of resource preemption? 10. What is meant by overlays and swapping? 11. Explain about page table? 12. Mention the advantages of indexed allocation over contiguous allocation? (APRIL-2016) 13. How are the effects of thrashing limited? (APRIL-2016) 14. Consider a logical address space of eight pages of 1024 words each,mapped onto a physical memory of 32 frames.how many bits are there in logical address? (NOV-2014) 15. Difference between Paging and segmentation? 16. What is Demand Paging and its advantages. How can we calculate EAT for demand paging? 17. Define Paging? (APRIl-2015) 18. What is meant by Deadlock? (NOV-2015) 19. What is virtual memory? (NOV-2015,APRIL-2014) 20. List the various page replacement algorithms used for page Replacement? (APRIl-2014) 21. Write the strategies used to select a free hole from the set of available holes in the memory?(april-2015) PART-B 1. Describe in detail about the deadlock avoidance? (APRIL-2015) 2. Explain in detail about swapping? 3. Explain the paging model of physical memory with a neat diagram? 4. Explain : a) segmentation (NOV-2015) b) segmentation with paging (APRIL-2014) 5. a) Consider the following page reference string: (NOV-2013) 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.How many page faults would occur for the LRU replacement algorithmd,assuming one,two,three,four,five,six or seven frames? b) Discuss in detail about deadlock Prevention? (NOV-2013,2014,APRIL-2015,NOV-2015) 6. Describe in detail about Demand paging? (APRIL-2015) a)give 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 uses of memory? (NOV-2013) b) Explain paging hardware with TLB with a neat Diagram? (NOV-2013) Prepared by M.Manjula/AP/IT/RGCET Page 4

7. Explain in detail about the page replacement techniques. (APRIL-2014,2015) 8. Discuss the address translation scheme for converting virtual address to physical address used in Hierarchical page table and hashed page tables? (NOV-2014) 9. a) Discuss the Thrashing? (NOV-2014) 10. Explain the segmentation and paging scheme in deatail? (APRIL-2016) 11. Explain the linked allocation method in a disk? (APRIl-2016) 12. Explain Storage Management? (NOV-2015) UNIT- IV PART-A 1. What is file? What are the two parts of file system? 2. Define the term per process table and system wide table? 3. What are the access methods used in File system? 4. What are the five major activities of an Operating system in regard to file mangement? (NOV-2013) 5. List ways to share files between directories in Operating Systems? (NOV-2013) 6. What are the operations to be performed on directory structure? 7. How the users can be classified in connection with each file? 8. Name the different types of schema for defining the logical structure of directory. 9. List out the types of free space management? (APRIL-2014) 10. What Problems could occur if a file system to be mounted simultaneously at more than one location?(nov-2014) 11. Define buffering and spooling? 12. In the context of disk Scheduling.Define Seek time? (NOV-2014) 13. Compare blocking and non-blocking I/O? (APRIL-2016) 14. What is data Striping? (APRIL-2016) 15. What are the different types of disk scheduling methods? 16. List any four File Access Methods? (APRIl-2015,NOV-2015,APRIL-2014) 17. Give any four free-space management Approaches? (APRIL-2105) 18. Define sector sparing. 19. What is Swapping? (NOV-2015) 20. Define Single-level directory structure.give one Example? (APRIL-2014) PART-B Prepared by M.Manjula/AP/IT/RGCET Page 5

1. Explain in detail about the directory structure? (NOV-2015) 2. Suppose that a disk drive has 5000 cylinders,numbered 0 to 4999.the drive is currently serving a request at cylinder 125.The queue of pending requests,in FIFO order,is 86,1470,913,1774,948,1509,1022,1750,130 starting from the current head position,what is the total distance (in cylinders)that the disk arm moves to satisfy all the pending requests,for (NOV-2013) a) SCAN b) LOOK c) C-SCAN Algorithms 3. a) Discuss the layered file system approach with a neat diagram? (NOV-2013) b)explain any three structures used for file system implementation? (NOV-2013) 4. Discuss in detail about File sharing. 5. Explain any three structures used for File system implementation? (APRIL-2015) 6. Describe in detail about the Kernel I/O subsystem. 7. Discuss the silent features of file system and Directory Structure? (NOV-2014) 8. Discuss in detail about Disk Scheduling algorithm with Example? (APRIl,NOV-2015) 9. Write a detailed note on Swap-Space management? (APRIL,NOV-2014) 10. State the various attributes of a file and their purpose.discuss the various file operations? (APRIl-2014) 11. Explain the polling and Interrupt mechanism in I/O hardware? (APRIL-2016) 12. Explain the different RAID levels in detail? (APRIL-2016) UNIT- V PART- A 1. What are the components of a Linux system? 2. What are the items present in the registration tables of kernel modules? 3. What are the items in process identity? 4. Define environment vector. 5. Draw the memory layout for ELF programs. 6. What are the security mechanisms used in Linux? 7. State any four commercially supported Linux versions? (APRIL-2015) 8. List any four features of NTFS? (APRIL-2015) 9. What is conflict resolution mechanism in Linux? Prepared by M.Manjula/AP/IT/RGCET Page 6

10. What is the use of attribute definition table? 11. Define PAM. 12. What is soft in real-time scheduling?? (NOV-2013) 13. What do you mean by a handle in XP? (NOV-2013) 14. Discuss Inter-Process Commmunication? (NOV-2014,2015,APRIL-2014) 15. What is meant by kernel in Linux system? (APRIL,NOV-2014) 16. What is dynamic Routing? (APRIL-2016) 17. What is the principle involved in deadlock detection? (APRLl-2016) 18. What is Synchronization? (NOV-2015) PART-B 1. Discuss in detail about the Physical memory management in LINUX. 2. Explain the following in details: (NOV-2014) a) Security measures in Linux systems b) Process Management in Linux systems with examples? (APRIL-2014) 3. With a neat diagram give the architecture of Windows XP and explain? (APRIL-2015,NOV-2015) 4. Compare and contrast the Linux Sysem with Windows XP system? (NOV-2014) 5. Discuss in detail the Virtual File system in Linux? (NOV-2013) 6. a) Write notes on windows XP Registry? (NOV-2013) b)write about NTFS meta data in windows XP? (NOV-2013) 7. Explain in detail about the process management in Linux. 8. Explain the deadlock prevention scheme in detail? (APRIL-2016) 9. Explain in detail about the IPC and security in Windows XP. 10. How does memory management performed in LINUX operating system?explain? (APRIL-2015) 11. Describe in detail about the file and I/O management in Linux? 12. Discuss on the Kernel Architectures? (NOV-2015) 13. Explain the architectures of LINUX operating system with a neat block diagram of the System Kernel?(APRIL-2014) Prepared by M.Manjula/AP/IT/RGCET Page 7

Prepared by M.Manjula/AP/IT/RGCET Page 8