Q.

NO
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37

38

39

40
41

42
43

44
45
46
47
48
49
50
51

52
53
54
55
56

57

58
59

60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76

77
78

79

80
 QUESTION
What is an operating system?
To access the services of operating system, the interface is provided by the ___________
Which one of the following error will be handle by the operating system?
What is the main function of the command interpreter?
Which was the first Microsoft Operating System?
Operating System is also known as
What is the name of the program that controls the overall functions of computers?
.________ operating system is the most widely used for personal computers.
A Microsoft Windows is ….. a(n)
The primary purpose of an operating system is a …
Which of the following is used to obtain OS services:
Which is the service not provided by an OS
The first UNIX operating system was written in
DOS stands for
Which of the following is an example of operating system?
Full form of MS-DOS is
Which of the following is not an operating system?
BIOS is used?
What is the mean of the Booting in the operating system?
When you delete a file in your computer, where does it go?
Which of the process transition is invalid?
The process in which of the following state will be in secondary memory?
Process means, program which is in execution
The main function of dispatcher is:
The address of the next instruction to be executed by the current process is provided by the __________
A Process Control Block(PCB) does not contain which of the following?
The state of a process is defined by __________
Which of the following is not the state of a process?
What is a Process Control Block?
Which of the following do not belong to queues for processes?
When the process issues an I/O request __________
What will happen when a process terminates?
What is a long-term scheduler?
What is a medium-term scheduler?
What is a short-term scheduler?
The primary distinction between the short term scheduler and the long term scheduler is __________
The only state transition that is initiated by the user process itself is __________
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 __________

In a multiprogramming environment __________

Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to
the __________
Which process can be affected by other processes executing in the system?
When several processes access the same data concurrently and the outcome of the execution depends on the
particular order in which the access takes place, is called?
Process synchronization can be done on __________
If a process is executing in its critical section, then no other processes can be executing in their critical section. This
condition is called?
What are the two kinds of semaphores?
What is a mutex?
A binary semaphore is a semaphore with integer values ____________
Semaphores are mostly used to implement ____________
The bounded buffer problem is also known as ____________
 In the bounded buffer problem, there are the empty and full semaphores that ____________
In the bounded buffer problem ____________
To ensure difficulties do not arise in the readers – writers problem _______ are given exclusive access to
the shared object.
The dining – philosophers problem will occur in case of ____________
A deadlock free solution to the dining philosophers problem ____________
 A monitor is a type of ____________
A monitor is characterized by ____________
 A procedure defined within a ________ can access only those variables declared locally within the
_______ and its formal parameters.

 The monitor construct ensures that ____________

What are the operations that can be invoked on a condition variable?

Which is the process of invoking the wait operation?

The layer between the hardware and the user program is
What is command interpreter called
What is the full form of BIOS
What is the mean of the Booting in the operating system?
Bootstrapping is also called?
Which of the following is a single-user operating system?
Who provides the interface to access the services of the operating system?
Linux operating system is
Which of the following does not interrupt the running process?
Which of the following is system software?
What type of scheduling is round-robin scheduling?
Which of the following "semaphore" can take the non-negative integer values?
Which of the following scheduling policy reduces process flow time?
Which of the following mechanisms is a locking mechanism?
The bounded buffer problem is also known as
The dining – philosophers problem will occur in case of
The segment of code in which the process may change common variables, update tables, write into files is known
as
A monitor is a type of
When several processes access the same data concurrently and the outcome of the execution depends on the particular
order in which the access takes place, is called
If a process is executing in its critical section, then no other processes can be executing in their critical section. This
property is called
 A
collection of programs that manages hardware resources
System calls
power failure
to get and execute the next user-specified command
MS-DOX
Printer
Browser
Linux
Operating system
To make the most efficient use of computer hardware
Library functions
File system manipulation
Pascal
Disk Operating Signal
MS Word
Microsystem Disk Operating System
Windows
By operating system
Restarting computer
Taskbar
Run --> Ready
ready
always true
swapping a process to disk
CPU registers
Code
the final activity of the process
New
Process type variable
Job Queue
It is placed in an I/O queue
It is removed from all queues
It selects which process has to be brought into the ready queue
It selects which process has to be brought into the ready queue
It selects which process has to be brought into the ready queue
The length of their queues
block

Blocked state

the processor executes more than one process at a time

Running state
cooperating process

dynamic condition
hardware level

mutual exclusion
mutual & counting
is a binary mutex
1
System calls
Readers – Writers problem
count the number of empty and full buffers
there is only one buffer

readers
5 philosophers and 5 chopsticks
necessarily eliminates the possibility of starvation
semaphore
 a set of programmer defined operators

process, semaphore

only one process can be active at a time within the monitor

wait & signal

suspended until another process invokes the signal operation

Operating environment
Prompt
Basic input and output subsystem
a)  Restarting computer
a)  Cold boot
a)  Windows
a)  API
a)  Private operating system
a)  Timer interrupt
a)  Operating system
a)  Linear data scheduling
a)  Binary Semaphore
a)  FCFS
a)  Semaphore
a)  Readers–Writers problem
a)  5 philosophers and 10 chopsticks

Program
a)  Semaphore

a)  Dynamic condition

Mutual exclusion
 B
system service provider to the application programs
API
lack of paper in printer
to provide the interface between the API and application program
MS-DOS
Database
An application program
Unix
Graphic program
To allow people to use the computer
System calls
Memory management
Java
 Disk Operating System
MS DOS
Microsimple Disk Operating System
Linux
By compiler
Install the program
Hard disk
wait--> ready
new
always false
assigning ready process to the CPU
Program counter
Stack
the activity just executed by the process
Old
Data Structure
PCB queue
It is placed in a waiting queue
It is removed from all, but the job queue
It selects which process has to be executed next and allocates CPU
It selects which process has to be executed next and allocates CPU
It selects which process has to be executed next and allocates CPU
The type of processes they schedule
wakeup

Ready state

the programs are developed by more than one person

Ready state
child process

race condition
software level

critical exclusion
binary & counting
must be accessed from only one process
-1
IPC mechanisms
 Dining – Philosophers problem
count the number of empty and full memory spaces
there are n buffers ( n being greater than one but finite)

writers
4 philosophers and 5 chopsticks
does not necessarily eliminate the possibility of starvation
 low level synchronization construct
an identifier

 process, monitor
n number of processes can be active at a time within the monitor (n
being greater than 1)
 hold & wait
 waiting for another process to complete before it can itself call the
signal operation
System environment
Kernel
Basic interrupt subsystem
b) Install the program
b) Cold hot boot
b) MAC
b) System call
b) Windows operating system
b) Device
b) Compiler
b) Non-linear data scheduling
Counting Semaphore
LIFO
b) PCB
b) Dining – Philosophers problem
b) 5 philosophers and 5 chopsticks

b) Critical section
b) Low level synchronization construct

b) Race condition

Critical exclusion
 C
link to interface the hardware and application programs
Library
connection failure in the network
to handle the files in operating system
Windows 7
System Software
Operating System
Windows
Word Processing
To keep system programmer employed
Both A & B
Process scheduling
Programming C
 Disk Orientation System
MS Excel
Microsoft Disk Operating System
Oracle
By interpreter
To scan
Recycle bin
Wait/ Block --> Run
run
may be true
suspending some of the processes when CPU load is high
Process stack
Bootstrap program
the activity to next be executed by the process
Waiting
A secondary storage section
Device Queue
It is placed in the ready queue
Its process control block is de-allocated
It selects which process to remove from memory by swapping
It selects which process to remove from memory by swapping
It selects which process to remove from memory by swapping
The frequency of their execution
dispatch

Suspended state

more than one process resides in the memory

Suspended state
parent process

essential condition
both hardware and software level

synchronous exclusion
counting & decimal
can be accessed from multiple processes
0.8
System protection
Producer – Consumer problem
count the number of empty and full queues
 there are infinite buffers

readers and writers

3 philosophers and 5 chopsticks
eliminates any possibility of any kind of problem further
high level synchronization construct
the number of variables in it

semaphore, semaphore

the queue has only one process in it at a time

signal & hold

stopped until the next process in the queue finishes execution

Operating system
Shell
Basic interface subsystem
To scan
c) Cold hot strap
c) Ms-Dos
c) Library
c) Open source
c) Power failure
c) Utilities
Preemptive scheduling
Real Semaphore
SJF
c) Mutex
Producer – Consumer problem
3 philosophers and 5 chopsticks

Non – critical section

) High level synchronization construct

c) Essential condition

Synchronous exclusion
 D ANSWER
all of the mentioned OptionD
Assembly instructions OptionA
all of the mentioned OptionD
none of the mentioned OptionA
Windows 8 OptionB
Hardware OptionC
File Manager OptionC
Machintosh OptionC
Database program OptionA
To make computer easier to use OptionA
None of the above OptionB
compilation of a program OptionD
Programming C OptionC
Disk Orientaional Signal OptionB
MS Access OptionB
 Microsort Disk Operating System OptionC
DOS OptionC
By application software OptionA
To turn off OptionA
None of these OptionC
None of the above OptionC
wait/block OptionB
may be false OptionA
bring processes from the disk to main memory OptionB
Pipe OptionB
Data OptionC
the current activity of the process OptionD
Running OptionB
A Block in memory OptionB
Ready Queue OptionB
It is placed in the Job queue OptionA
Its process control block is never de-allocated OptionA
None of the mentioned OptionA
None of the mentioned OptionC
None of the mentioned OptionB
None of the mentioned OptionC
none of the mentioned OptionA

Terminated state OptionB

a single user can execute many programs at the
same time OptionC

Terminated state OptionB

init process OptionA

critical condition OptionB

none of the mentioned OptionC

asynchronous exclusion OptionA

decimal & binary OptionB
none of the mentioned OptionB
0.5 OptionA
None of the mentioned OptionB
None of the mentioned OptionC
none of the mentioned OptionA
the buffer size is bounded OptionB

 none of the mentioned OptionB

6 philosophers and 5 chopsticks OptionA
none of the mentioned OptionB
none of the mentioned OptionC
all of the mentioned OptionA

monitor, monitor OptionD

all of the mentioned OptionA

 continue & signal OptionA

 none of the mentioned OptionA

None Option c
Command Option c
Basic interprocess subsystem OptionA
d) To turn off OptionA
d) Hot boot OptionA
d) None of these Option c
d) Assembly instruction OptionB
d) All of these Option c
d) Scheduler process OptionD
d) All of the above OptionD
d) Non-preemptive scheduling Option c
a)  All of the these OptionB
All of the these Option c
d) Binary Semaphore Option c
d) None of the mentioned OptionA
d) 6 philosophers and 5 chopsticks OptionB

d) Synchronizing OptionB
d) None of the mentioned Option c

d) Critical condition OptionB

Asynchronous exclusion OptionA