UNIT I. Introduction to OS& System Structures

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

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT I


CHAPTER NO - 1 : Introduction:

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK

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

Chendu College of Engineering & Technology

MC7204 OPERATING SYSTEMS

SNS COLLEGE OF ENGINEERING

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

CSI3131 Final Exam Review

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

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

Operating System(16MCA24)

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

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

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

Main Points of the Computer Organization and System Software Module

3 rd Year V Semester

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

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

QUESTION BANK UNIT I

CONTENTS. Computer-System Structures

INSTITUTE OF AERONAUTICAL ENGINEERING

SYED AMMAL ENGINEERING COLLEGE CS6401- OPERATING SYSTEM

PESIT SOUTHCAMPUS. Question Bank

Operating System Design


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

SAZ4B/SAE5A Operating System Unit : I - V

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

OS Assignment II. The process of executing multiple threads simultaneously is known as multithreading.

Last Class: Deadlocks. Today

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

Processor : Intel Pentium D3.0 GigaHtz

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING UNIT-1

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

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

Last Class: Synchronization Problems. Need to hold multiple resources to perform task. CS377: Operating Systems. Real-world Examples

COURSE PLAN Regulation: R11 FACULTY DETAILS: Department::

DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK. UNIT I PART A (2 marks)

Midterm Exam. October 20th, Thursday NSC

VALLIAMMAI ENGINEERING COLLEGE

CSE 153 Design of Operating Systems

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

CS307 Operating Systems Introduction Fan Wu

Overview of Data Structures, Algorithm Analysis

PROCESSES & THREADS. Charles Abzug, Ph.D. Department of Computer Science James Madison University Harrisonburg, VA Charles Abzug

Deadlock. Disclaimer: some slides are adopted from Dr. Kulkarni s and book authors slides with permission 1

Teaching and Examination Scheme: PAPER HRS TH TU PR TH PR OR TW TOTAL

Answer the following questions PART II

EXAMS CS604- OPERATING SYSTEMS

The Deadlock Problem (1)

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) UNIT-I

Operating Systems (1DT020 & 1TT802)

MARUTHI SCHOOL OF BANKING (MSB)

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) Essay Answer (10 mark) Questions

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

Scheduling. The Basics

Deadlock. Concurrency: Deadlock and Starvation. Reusable Resources

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

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

MODERN OPERATING SYSTEMS. Third Edition ANDREW S. TANENBAUM. Chapter 6 Deadlocks

UNIT:2. Process Management

Solution for Operating System

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

CS604- Operating Systems Solved MCQS From Midterm Papers

CTP203 Operating Systems Syllabus

CPSC/ECE 3220 Summer 2018 Exam 2 No Electronics.

Lecture 9: Midterm Review

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

UNIT I Review Computer Networks and the Internet

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

CS Mid term Exam Maximum points 100; Maximum time allowed: 75 minutes

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

QUESTION BANK UNIT I : 2 Marks

COMP 300E Operating Systems Fall Semester 2011 Midterm Examination SAMPLE. Name: Student ID:

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

Sistemas Operacionais I. Valeria Menezes Bastos

FCM 710: Architecture of Secure Operating Systems

Operating Systems: William Stallings. Starvation. Patricia Roy Manatee Community College, Venice, FL 2008, Prentice Hall

OPERATING SYSTEMS. Deadlocks

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

CSc33200: Operating Systems, CS-CCNY, Fall 2003 Jinzhong Niu December 10, Review

More on Synchronization and Deadlock

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

Last Class: Synchronization Problems!

CS140 Operating Systems and Systems Programming Midterm Exam

Operating System MC Exercises

CSE Operating Systems

Review. Preview. Three Level Scheduler. Scheduler. Process behavior. Effective CPU Scheduler is essential. Process Scheduling

VALLIAMMAI ENGINEERING COLLEGE

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

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Exam Guide COMPSCI 386

CSE 120 Principles of Operating Systems Spring 2017

CSE 120 Principles of Operating Systems

CSE 120. Fall Lecture 8: Scheduling and Deadlock. Keith Marzullo

OPERATING SYSTEMS INTERNALS AND DESIGN PRINCIPLES. William Stallings SIXTH EDITION. Pearson Education International. Prentice Hall

Syllabus CSCI 405 Operating Systems Fall 2018

Transcription:

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: B.Tech CSE Regulation: R16 UNIT I Introduction to OS& System Structures 1. A) Define Operating System and explain the various types of Operating Systems? 5M B) Explain Functions of Operating Systems? 5M 2. A) Explain Operating System Structures? 5M B) Explain System Programs? 5M 3. Explain Computer System Organization? 10M 4. A) Explain Distributed Systems? 5M B) Explain difference between Uni programming and Multi Programming? 5M 5. A) Explain Operating System Services. 5M B) Explain System calls. 5M 6. Explain about Computer System architecture? 10M 7. Explain Computing Environments? 10M 8. A) Write about Storage Management? 5M B) Explain Process Management? 5M 9. A) Explain difference between Multitasking and Multi Programmin? 5M B) Write about Memory management? 5M 10. Explain about different types of System calls? 10M (16CS512) OPERATING SYSTEMS Page 1

UNIT II Process Management& Process Scheduling 1. A) Define Process? Explain process State diagram? 5M B) Explain about process schedulers? 5M 2. Explain Multi-Threading models. 10M 3. Explain CPU Scheduling Algorithms with examples? 10M 4. A) Explain about Scheduling Criteria. 4M B) Evaluate FCFS CPU Scheduling algorithm for given Problem 6M Process Time 24 3 5 6 5. Evaluate SJF CPU Scheduling algorithm for given Problem 10M Process Time 8 4 9 5 Arrival Time 0 1 2 3 6. Evaluate Round CPU Scheduling algorithm for given Problem 10M Time slice =3 ms. Process Time 10 5 18 6 Arrival Time 5 3 0 4 7. Write about Inter Process Communication? 10M 8. A) Explain about Operations on process? 5M B) Write about Threads? 5M 9. A) Write the difference between user level thread and kernel level thread? 5M B) Write about Single & Multithreaded Process? 5M 10. Define the following: A) Process. 3M B) Program. 3M C) Process Control Block. 4M (16CS512) OPERATING SYSTEMS Page 2

UNIT III Process Coordination& Deadlocks 1. What is critical section problem? Explain with example? 10M 2. What is Semaphore? Expain producer consumer problem using semaphore? 10M 3. Define process synchronization and explain Peterson solution algorithms? 10M 4. What is Monitor? Expain with any example using monitor? 10M 5. Explain the solution for Dining-Philosophers Problem 10M 6. A) What are the methods for handling deadlock. 6M B) write about deadlock and starvation? 4M 7. A) Explain about Deadlock Avoidance? 6M B) Explain how recovery from deadlock? 4M 8. Explain Dead lock detection (Banker s Algorithm) with Example? 10M 9. Write about Deadlock Prevention Methods? 10M 10. Discuss about the following A) Semaphore 5M B) Monitor 5M (16CS512) OPERATING SYSTEMS Page 3

UNIT IV Memory Management, Virtual Memory Management, File system 1. Discuss about page replacement algorithms with example 10M 2. A) What is MFT? Explain with Example 5M B) What is MVT? Explain with Example 5M 3. A) What is Segmentation? Explain with Example. 5M B) Explain about Paging.? 5M 4. A) what is swapping with respect to memory management? explain 5M B) What is file sharing and explain about it. 5M 5. Brief explains about free space management? 10M 6. Write short notes on A) Demand paging 3M B) File sharing 3M C) Page replacement 4M 7. Write short notes on A) File attributes 3M B) File Operations 3M C) Page fault 4M 8. Discuss about directory structures with examples 10M 9. A) Explain about file access methods 7M B) What is thrashing. Explain. 3M 10. A)Explain Dynamic memory partition allocation with Example. 5M B) What is contiguous memory allocation? Explain it. 5M (16CS512) OPERATING SYSTEMS Page 4

UNIT V Protection & Security 1. A) Define Protection Domain with Example. 5M B) Explain about protection Matrix with Example. 5M 2. A) Discuss about cryptography process. 5M B) Explain about Digital Signature. 5M 3. A) Define Protection & Security. 5M B) Explain about Access Control List with Example. 5M 4. Write about Insider Attacks. 10M 5. Write short notes on A) Threats 5M B) Intruders 5M 6. Explain about various Authentication Techniques. 10M 7. A) Write in detail about goals of protection. 5M B) Explain based protection with example. 5M 8. A)What is access matrix? 5M B) Explain the implementation of access matrix. 5M 9. A)Explain about Trusted Platform Model. 5M B) Write short notes One-Way Functions 5M 10. what is secret key and public key cryptography? Explain 10M (16CS512) OPERATING SYSTEMS Page 5