MCA115 Operating System MCA Question Bank : bbdnitm.ac.in

Name of the Institute : Babu Banarasi Das National Institute of Technology & Management
Degree : MCA
Department : Computer Applications
Subject Code/Name : (MCA-115) Operating System
Year : 1st
Semester : 1st
Document Type : Question Bank
Website : bbdnitm.ac.in

Download Model/Sample Question Paper :https://www.pdfquestion.in/uploads/bbdnitm.ac.in/3149-MCA-T115-OPERATING-SYSTEM.pdf

BBDNITM Operating System Question Bank

Unit 1

1. Primary Purpose of OS is :
a) To make efficient use of computer resources
b) To allow People to use the computer
c) To keep system Programmers employed
d) To make computer easier to use

Related : Babu Banarasi Das National Institute of Technology & Management BCA505 Optimization Techniques BCA Question Bank : www.pdfquestion.in/3174.html

2. Which of the following OS work in time critical environment :
a) Batch OS
b) Time Sharing OS
c) Real Time OS
d) Distributed OS

3. Which is not true about Distributed OS :
a)Collection of computer systems dispersed remotely
b)Loosely couple systems
c)Processors vary in size and functions
d)Do share a global clock and memory

4. Architectural support for multi programming is provided by :
a) Spooling
b) DMA
c) Time slicing
d) None

5. System call :
a)Provides information between process and operating system
b)Provides information between input output and memory
c)Provides information between peripheral and computer
d)Provides information to the system

6. Which is false regarding process :
a)A running instance of a program.
b)A passive entity
c)Status is maintained in PCB
d)Only one process can run or any processor at a time but many can be ready and waiting

7. Which selects for among the processes that are ready to execute and allocate CPU to one of them :
a)Long term scheduler
b)Short term scheduler
c)Medium term scheduler
d)None

8. Which is the preemptive Scheduling algorithm :
a) FCFS
b) Round Robin
c) SJF
d) None

9. RR Scheduling is the preemptive version of :
a)FCFS
b)FILO
c)SRTF
d)None

10. Throughput governs :
a) Efficiency of CPU
b) User Services
c) System Performances
d) None

11. Turn amount time is :
a)Time to implement one interaction between user and process
b)Time between submission of request by user and formulation of process response to it
c)Time since in submission for processing to the time its results become available to the user
d)None

12. Response time is :
a)Time to complete a job
b)Time between submission of request by user and formulation of process response to it
c)Time since in submission for processing to the time its results become available to the user
d)None

13. Primary concern of batch processing is Avoiding :
a)CPU idle time
b)Resource utilization
c)Resource Sharing
d)Meeting deadline

14. Spooling is introduced in :
a)Batch OS
b)Multi Programming OS
c)Real Time OS
d)Distributed OS

15. Time sharing is associated with :
a)Batch OS
b)Time Sharing OS
c)Real Time OS
d) None

Unit 2

1. PCB is associated with
a) Thread
b) Program
c) Process
d) None

2. Waiting time is
a) Amount of time a process waits in ready queue
b) Interval from time of submission to time of its completion
c) Interval from the time last character of a program is entered to the time last result appears on the terminal
d) None

3. FCFS is
a) Preemptive
b) Non Preemptive
c) Not Applicable
d) None

4. Convey effect is shown in
a) FCFS Scheduling
b) SRTF Scheduling
c) RR Scheduling
d) Multilevel queue Scheduling

5. When time quantum is too large then RR Scheduling gets change to
a) FCFS Scheduling
b) SJF Scheduling
c) Priority based Scheduling
d) Multilevel queue Scheduling

6. Static and dynamic scheduling is a part of
a) Hard RT Scheduling
b) Soft RT Scheduling
c) Multiple Processor Scheduling
d) None

7. ___________is not and algorithmic evaluation method?
a) Deterministic Modeling
b) System Modeling
c) Queuing Modeling
d) Simulations Modeling

8. _________Selects from among the processes that are spooled to disc for execution?
a) Long term scheduler
b) Short term scheduler
c) Medium term scheduler
d) None

9. ______ is not used during process termination?
a) exit
b) wait
c) abort
d) fork

10. Which is false about threads?
a) Basic unit of CPU utilization
b) A thread must be in exactly one task
c) Threads are depended on one another
d) each thread has its own stack and PC

11. Which threads are faster to switch among them
a) user level thread
b) kernel level thread
c) shared threads
d) None

12. Mail boxes are associated with
a) Direct communication
b) Indirect communication
c) Both a) and b)
d) None

Unit 3

1 ___ is one that can affect or be affected by the other processes executing in the system.
a) Thread
b) Cooperative Process
c) Independent Process
d) None
2. A Critical Section is a program Segment
a) Which should run in a certain specified amount of time
b) Which avoids deadlock
c) Where shared resources are accessed
d) Which must be enclosed by a pair of semaphore operations, P and V

3. To Solve Critical Section Problem for n Processes which of the following method is used?
a) Bakery Algorithm
b) Bankers Algorithm
c) Monitors
d) None

4. Deadlock is not characterized by:
a) Mutual Exclusion
b) Hold and wait
c) No Prevention
d) Circular Wait

5. At a particular time, the value of counting semaphore is 7 . The 20 P Operations and 15 V Operations were complete on this semaphore .The resulting value of semaphore is :
a) 42
b) 2
c) 7
d)12

6. Consider a System having M resources of same type which are shared by 3 Processes A, B, C having Maximum demand of 3, 4, 6 respectively. For what value of M deadlock will not occur?
a) 7
b) 10
c) 13
d) 15

7. A Computer has 6 tape drives with n Processes competing for them .Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free.
a) 2
b) 3
c) 4
d) 1

8. The Directed graph used for deadlock detection is
a) Deadlock graph
b) Assignment graph
c) Wait for graph
d) None

9. Which of the following is not the method of recovering from deadlock?
a) Process Termination
b) Resource Preemption
c) Wait for graph
d) Segmentation

10. Spinlock is a type of
a) Semaphore
b) Critical Region
c) Monitor
d) None