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

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

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

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

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

Concurrency: Deadlock and Starvation. Chapter 6

* What are the different states for a task in an OS?

Main Points of the Computer Organization and System Software Module

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

(MCQZ-CS604 Operating Systems)

Mon Sep 17, 2007 Lecture 3: Process Management

CHAPTER NO - 1 : Introduction:

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

Process Description and Control. Chapter 3

2. The system of... generally ran one job at a time. These were called single stream batch processing.

Mid Term from Feb-2005 to Nov 2012 CS604- Operating System

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

Operating System Study Notes Department of Computer science and Engineering Prepared by TKG, SM and MS

MARUTHI SCHOOL OF BANKING (MSB)

CS604 Final term Paper Fall (2012)

Chapter 3: Process Concept

Chapter 3: Process Concept

Process Description and Control. Chapter 3

IT 540 Operating Systems ECE519 Advanced Operating Systems

Chapter 3: Process Concept

Chapter 13: I/O Systems

Operating Systems Overview. Chapter 2

Process Description and Control

3.1 Introduction. Computers perform operations concurrently

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

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

Deadlock. Pritee Parwekar

Processes. Process Management Chapter 3. When does a process gets created? When does a process gets terminated?

Process Concepts. CSC400 - Operating Systems. 3. Process Concepts. J. Sumey

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

OPERATING SYSTEM : RBMCQ0402. Third RavishBegusarai.

CS370 Operating Systems Midterm Review

Chapter 3: Processes. Operating System Concepts 8 th Edition,

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

PROCESS SYNCHRONIZATION

SMD149 - Operating Systems

Chapter 2 Processes and Threads. Interprocess Communication Race Conditions

Chapter 3 Processes. Process Concept. Process Concept. Process Concept (Cont.) Process Concept (Cont.) Process Concept (Cont.)

Sample Questions. Amir H. Payberah. Amirkabir University of Technology (Tehran Polytechnic)

Noorul Islam College Of Engineering, Kumaracoil MCA Degree Model Examination (October 2007) 5 th Semester MC1642 UNIX Internals 2 mark Questions

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

Solved MCQs on Operating System Principles. Set-1

Chapter 13: I/O Systems

QUESTION BANK UNIT I

Processes Prof. James L. Frankel Harvard University. Version of 6:16 PM 10-Feb-2017 Copyright 2017, 2015 James L. Frankel. All rights reserved.

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

CSI3131 Final Exam Review

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

What is an Operating System? A Whirlwind Tour of Operating Systems. How did OS evolve? How did OS evolve?

CPSC 341 OS & Networks. Processes. Dr. Yingwu Zhu

Processes and More. CSCI 315 Operating Systems Design Department of Computer Science

CSC 4320 Test 1 Spring 2017

Concurrency: Deadlock and Starvation

Deadlock. Concurrency: Deadlock and Starvation. Reusable Resources

Jan 20, 2005 Lecture 2: Multiprogramming OS

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

Processes, PCB, Context Switch

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

Running. Time out. Event wait. Schedule. Ready. Blocked. Event occurs

Lecture 15: I/O Devices & Drivers

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

Major Requirements of an OS

CHAPTER 3 - PROCESS CONCEPT

Threads. Threads The Thread Model (1) CSCE 351: Operating System Kernels Witawas Srisa-an Chapter 4-5

Module 1. Introduction:

PROCESS STATES AND TRANSITIONS:

OS 1 st Exam Name Solution St # (Q1) (19 points) True/False. Circle the appropriate choice (there are no trick questions).

Chapter 3: Processes. Operating System Concepts 8th Edition,

Process Concept. Chapter 4: Processes. Diagram of Process State. Process State. Process Control Block (PCB) Process Control Block (PCB)

Chapter 4: Processes

PROCESS CONTROL BLOCK TWO-STATE MODEL (CONT D)

Process Description and Control. Chapter 3

Chapter 3: Processes. Chapter 3: Processes. Process in Memory. Process Concept. Process State. Diagram of Process State

Module 12: I/O Systems

REVIEW OF COMMONLY USED DATA STRUCTURES IN OS

Module 12: I/O Systems

CS370 Operating Systems

Processes. Operating System Concepts with Java. 4.1 Sana a University, Dr aimen

Process. Program Vs. process. During execution, the process may be in one of the following states

Diagram of Process State Process Control Block (PCB)

Processes and Non-Preemptive Scheduling. Otto J. Anshus

Chapter 3: Processes. Operating System Concepts 9 th Edition

ENGR 3950U / CSCI 3020U UOIT, Fall 2012 Quiz on Process Synchronization SOLUTIONS

CS-537: Midterm Exam (Spring 2001)

Chapter 4: Processes. Process Concept

Computer System Overview

PROCESS MANAGEMENT. Operating Systems 2015 Spring by Euiseong Seo

OPERATING SYSTEMS: Lesson 4: Process Scheduling

Device-Functionality Progression

Chapter 12: I/O Systems. I/O Hardware

EECS 482 Introduction to Operating Systems

Linux Operating System

Chapter 3: Processes

Part Two - Process Management. Chapter 3: Processes

PESIT Bangalore South Campus Hosur road, 1km before Electronic City, Bengaluru Department of Electronics and Communication Engineering

Chapter 3: Processes. Operating System Concepts Essentials 2 nd Edition

Transcription:

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) collection of programs that manages hardware resources b) system service provider to the application programs c) link to interface the hardware and application programs d) all of the mentioned 2. To access the services of operating system, the interface is provided by the a) system calls b) API c) library d) assembly instructions 3. Which one of the following error will be handle by the operating system? a) power failure b) lack of paper in printer c) connection failure in the network d) all of the mentioned 4. The main function of the command interpreter is a) to get and execute the next user-specified command b) to provide the interface between the API and application program c) to handle the files in operating system d) none of the mentioned 5. By operating system, the resource management can be done via a) time division multiplexing b) space division multiplexing c) both (a) and (b) d) none of the mentioned 6. If a process fails, most operating system write the error information to a

a) log file b) another running process c) new file d) none of the mentioned 7. The systems which allows only one process execution at a time, are called a) uniprogramming systems b) uniprocessing systems c) unitasking systems d) none of the mentioned 8. In operating system, each process has its own a) address space and global variables b) open files c) pending alarms, signals and signal handlers d) all of the mentioned 9. A process can be terminated due to a) normal exit b) fatal error c) killed by another process d) all of the mentioned 10. What is the ready state of a process? a) when process is scheduled to run after some execution b) when process is unable to run until some task has been completed c) when process is using the CPU d) none of the mentioned 11. What is interprocess communication? a) communication within the process b) communication between two process c) communication between two threads of same process d) none of the mentioned 12. 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 d) none of the mentioned 13. A process stack does not contain a) function parameters b) local variables c) return addresses d) PID of child process 14. Which system call returns the process identifier of a terminated child? a) wait b) exit c) fork d) get 15. 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 16. 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 Answer: a 17. 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 d) None of these Answer: a 18. What is a medium-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 d) None of these 19. What is a short-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 d) None of these Answer: b 20. The primary distinction between the short term scheduler and the long term scheduler is : a) The length of their queues b) The type of processes they schedule c) The frequency of their execution d) None of these 21. 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 d) Terminated state Answer: b 22. In a multi-programming environment : a) the processor executes more than one process at a time b) the programs are developed by more than one person c) more than one process resides in the memory d) a single user can execute many programs at the same time 23. Suppose that a process is in Blocked state waiting for some I/O service. When the service is completed, it goes to the : a) Running state b) Ready state c) Suspended state d) Terminated state

Answer: b 24. Which of the following does not interrupt a running process? a) A device b) Timer c) Scheduler process d) Power failure 25. Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n). a) Shared Memory Segments b) Entry Section c) Race condition d) Process Synchronization 26. 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 Answer: a 27. Which process can affect of be affected by other processes executing in the system? a) cooperating process b) child process c) parent process d) init process 28. If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called a) mutual exclusion b) critical exclusion c) synchronous exclusion d) asynchronous exclusion 29. Which one of the following is a synchronization tool? a) thread b) pipe c) semaphore d) socket

30. A semaphore is a shared integer variable a) that can not drop below zero b) that can not be more than zero c) that can not drop below one d) that can not be more than one 31. Process synchronization can be done on a) hardware level b) software level c) both (a) and (b) d) none of the mentioned 32. A monitor is a module that encapsulates a) shared data structures b) procedures that operate on shared data structure c) synchronization between concurrent procedure invocation d) all of the mentioned 33. What is the reusable resource? a) that can be used by one process at a time and is not depleted by that use b) that can be used by more than one process at a time c) that can be shared between various threads d) none of the mentioned 34. Which of the following condition is required for deadlock to be possible? a) mutual exclusion b) a process may hold allocated resources while awaiting assignment of other resources c) no resource can be forcibly removed from a process holding it d) all of the mentioned 35. Which one of the following is the deadlock avoidance algorithm? a) banker s algorithm b) round-robin algorithm c) elevator algorithm d) karn s algorithm

36. For effective operating system, when to check for deadlock? a) every time a resource request is made b) at fixed time intervals c) both (a) and (b) d) none of the mentioned 37. To avoid deadlock a) there must be a fixed number of resources to allocate b) resource allocation must be done only once c) all deadlocked processes must be aborted d) inversion technique can be used 38. An un-interruptible unit is known as : a) single b) atomic c) static d) None of these Answer: b 39. Semaphore is a/an to solve the critical section problem. a) hardware for a system b) special program for a system c) integer variable d) None of these 40. CPU fetches the instruction from memory according to the value of a) program counter b) status register c) instruction register d) program status word 41. A memory buffer used to accommodate a speed differential is called a) stack pointer b) cache c) accumulator d) disk buffer

42. Which one of the following is the address generated by CPU? a) physical address b) absolute address c) logical address d) none of the mentioned 43. Run time mapping from virtual to physical address is done by a) memory management unit b) CPU c) PCI d) none of the mentioned 44. 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 d) none of the mentioned 45. Program always deals with a) logical address b) absolute address c) physical address d) relative address 46. Operating System maintains the page table for a) each process b) each thread c) each instruction d) each address 47. Because of virtual memory, the memory can be shared among a) processes b) threads c) instructions d) none of the mentioned 48. 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 49. The pager concerns with the a) individual page of a process b) entire process c) entire thread d) first page of a process 50. Swap space exists in a) primary memory b) secondary memory c) CPU d) none of the mentioned 51. 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 d) none of the mentioned 52. is a unique tag, usually a number, identifies the file within the file system. a) File identifier b) File name c) File type d) none of the mentioned 53. To create a file a) allocate the space in file system b) make an entry for new file in directory c) both (a) and (b) d) none of the mentioned 54. By using the specific system call, we can a) open the file b) read the file c) write into the file d) all of the mentioned

55. File type can be represented by a) file name b) file extension c) file identifier d) none of the mentioned 56. Mapping of file is managed by a) file metadata b) page table c) virtual memory d) file system 57. file system fragmentation occurs when a) unused space or single file are not contiguous b) used space is not contiguous c) unused space is non-contiguous d) multiple files are non-contiguous 58. If one or more devices use a common set of wires to communicate with the computer system, the connection is called. a) CPU b) Monitor c) wirefull d) bus Answer : d 59. A is a collection of electronics that can operate a port, a bus, or a device. a) controller b) driver c) host d) bus Answer : a 60. An I/O port typically consists of four registers status, control, and registers. a) system in, system out b) data in, data out c) flow in, flow out d) input, output Answer : b 61. The register is read by the host to get input.

a) flow in b) flow out c) data in d) data out Answer : c 62. The register is written by the host to send output. a) status b) control c) data in d) data out Answer : d 63. The hardware mechanism that allows a device to notify the CPU is called. a) polling b) interrupt c) driver d) controlling Answer : b