OPERATING SYSTEM

SR.
QUESTIONS ANS
NO.
CHAPTER NO. 04
On movable head system, the time need to position read/write head on
desired track is………..
A. Seek time
1 A
B. Rotational Delay
C. Access time
D. Transfer time
The Disk controller initially takes for beginning of the sector to reach the
head is known as………
A. Seek time
2 B
B. Rotational Delay
C. Transfer time
D. Access time
The…….contains two main components, the initial startup time and time
taken to traverse the tracks that have to be crossed once to access arm up
A. Seek time
3 A
B. Rotational Delay
C. Access time its speed.
D. Transfer time
The…….policy is to select disk 1/O request that needs minimum movement
of disk arm from its current position.
A. Last in First Out
4 B
B. Shortest Seek Time First
C. Priority by Process
D. Random Scheduling
In ………policy, when last track has been visited in one direction, the arm
is return to opposite end of the disk and scan begins again.
A. Last in First Out
5 D
B. Shortest Seek Time First
C. SCAN
D. Circular SCAN
SSTF stands for………….
A. Shortest Seek Time First
6 B. Smallest Seek Time First A
C. Simple Seek Time First
D. None of these
Total Time to prepare disk drive mechanism for block of data to be read from
is its…..
A. Seek Time
7 C
B. Access Time
C. Latency plus Seek Time
D. Response Time
……….is the time required by a sector to reach below read/write head.
A. Seek Time
8 B. Latency Time C
C. Access time
D. None
 OPERATING SYSTEM
Suppose the given disk request sequence (track numbers) for a disk with 100
tracks: 45, 20, 90,10,50,60,80, 25 and 70. The initial position of the R/W
head is on track 50. The additional distance that will be traversed by the R/W
head when the Shortest Seek Time First (SSTF) algorithm is used compared
to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves
9 C
towards 100 when it starts execution) is………….tracks.
A. 8
B. 9
C. 10
D. 11
Which of following is crucial time while accessing data from the disk?
A. Seek time
10 B. Rotational time A
C. Transmission time
D. Waiting time
The head of magnetic disk are attached to a………… that moves all the
heads as unit.
A. Spindle
11 B
B. Diskarm
C. assembles
D. cylinders
The set of tracks that are at one arm position make up a……
A. Magnetic disks
12 B. electrical disks C
C. assemblies
D. cylinders.
The time required for desired sector to rotate to disk is called:
A. Positional time
13 B. random access time D
C. seek time
D. rotational latency
Consider a disk queue with request for I/O to blocks on cylinders: 98,183,37,
122,14,124,65,67 Considering FCFS disk scheduling, the total number if
head movements is, if the disk is initially at 53
14 A. 600 B
B. 640
C. 630
D. 620
Consider a disk queue with request for I/0 to blocks on cylinders:
98,183,37,122,14,124,65,67 Considering SSTF disk scheduling, the total
number if head movements is, if the disk is initially at 53.
15 A. 224 C
B. 245
C. 236
D. 240
SSTF algorithm, just like SJF………………. of some requests.
A. may cause starvation
16 B. will cause starvation A
C. doesn't cause starvation
D. causes aging
 OPERATING SYSTEM
In ……… algorithm, the disk arm starts at one end of the disk and moves
17 toward the other end, servicing the requests till the other end of the disk. At inva
the other end, the direction is reversed and servicing continues.
In the _ algorithm, disk arm goes as far as the final request in each direction,
then reverses direction immediately without going to the end of disk.
A. LOOK
18 A
B. SCAN
C. C-SCAN
D. C-LOOK
Which of following are major activities of an operating system in connection
to secondary storage management?
A. Free space management
19 D
B. storage management
C. disk scheduling
D. all of these
Which of following disk scheduling strategies is likely to give best
throughput?
A. Farthest Cylinder first
20 B
B. Nearest Cylinder first
C. FCFS
D. Elevator algorithm
Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time
the disk arm is at cylinder 100, and there is a queue of disk access requests
for cylinders 30,85,90,100,105, 110, 135 and 145. If Shortest-Seek Time
First (SSTF) is being used for scheduling the disk access, the request for
21 cylinder 90 is serviced after servicing …………….number of requests. C
A. 1
B. 2
C. 3
D. 4
Consider a typical disk that rotates at 15000 RPM and has a transfer rate of
50 x 106 bytes/sec/ If average seek time of disk is twice the average
rotational delay and the controller's transfer time is 10 times the disk transfer
time, the average time (in millisecond.) to read or write a 512 byte sector of
22 the disk is B
A. 6.0
B. 6.1
C. 6.5
D. 6.3
Using the SCAN (elevator) disk scheduling algorithm, determine how far
the disk head moves servicing the following outstanding requests:
150,19,20,900 and 99. Assume the disk's head is currently over track 100
and moving toward smaller track numbers. Also, assume that all of these
23 track requests have already been received.
A. 962 tracks
B. 1064 tracks
C. 1681 track
D. None of these
Disk and Drum Scheduling involves deciding:
24
A. which disk should be accessed next
 OPERATING SYSTEM
B. the order in which disk access request must be serviced
C. the physical location where files should be accessed in the disk
D. none of these
Sector interleaving in disk is performed by……
A. Operating System
25 B. Disk Manufacturer B
C. The disk controller
D. None of these
Consider a disk with 16384 bytes per track having rotation time 16 msec and
average seek time is 40 msec. What is the time in msec to read a block of
1024 bytes from this disk?
26 A. 57 msec B
B. 49 msec
C. 17 msec
D. 48 msec
A disk drive has 100 cylinders numbered 0 to 99. Disk request comes to the
disk driver for cylinders: 12,26,24,4,42, 8 and 50. The driver is currently
serving at cylinder 24 a seek takes 6 msec per cylinder moved. How much
seek time is needed for SSTF algorithm
27 D
A. 0.98 msec
B. 0.39 msec
C. 0.74 msec
D. 0.42 msec
Consider a disk queue with request for 1/O to blocks on cylinders: 98, 183,
37,122,14,124,65, 67 Assume the disk head is currently serving at 53 and
moving towards cylinder 0. The total number of disk head movements using
SSTF and SCAN w In
28
A. 236 and 252 cylinders A
B. 640 and 236 cylinders
C. 235 and 640 cylinders
D. None
Which of following term is not related to disk scheduling?
A. Transfer time
29 B. waiting time B
C. seek time
D. rotational latency
The methods or an algorithm which are used to increase the performance of
disk storage subsystem is called……
A. Disk performing
30 B
B. Disk Scheduling
C. Disk extending
D. Disk storage
The………. policy selects the disk I/0 request that requires the least
movement of disk arm from its current position.
A. FCFS
31 B
B. SSTF
C. SCAN
D. C-LOOK
The sum of the seek time and rotational delay is called the……
32 C
A. Reached time
 OPERATING SYSTEM
B. Arrived time
C. Access Time
D. Common time
CHAPTER NO. 06
In………. year the open handset alliance was announced.
A. 2005
33 B. 2006 D
C. 2008
D. 2007
When did Google purchased Android?
A. 2007
34 B. 2005 B
C. 2008
D. 2010
………is a piece of code used in android but not in open source.
A. virtual keypad code
35 B. Wi-Fi driver code B
C. audio driver
D. power management code
………… is not a part of Androids native libraries.
A. SQLite
36 B. Web kit C
C. Dalvik
D. OpenGL
The………operating system is used as base of Android stack.
A. XML
37 B. Linux B
C. Windows 8.1
D. Java
The .apk extension stands for………
A. Application package kit
38 B. Application program kit C
C. Android package kit
D. None of these
The built-in database used in android environment is……
A. SQLit
39 B. Apache A
C. Oracle
D. MySQL
Once installed on device, each Android application lives in……
A. device memory
40 B. external memory C
C. security sandbox
D. None of these
The Android framework is written in……… language.
A. C
41 B. C++ C
C. JAVA
D. .Net
42 Android libraries are written in the language……… B
 OPERATING SYSTEM
A. C
B. C and C++
C. only java
D. C, C++ and Java
Which company had released the 1st android phone?
A. Samsung
43 B. LG D
C. HTC
D. Google
Android is released under…….license
A. Apache license
B. Android is freeware so it's under GPL license
44 A
C. Android is freeware, it is under Apache license but only the kernel
is under GPL license
D. None of these
………. is a type of kernel used in Android.
A. Micro kernel
45 B. Monolithic kernel D
C. Hybrid kernel
D. none of these
Where all you can use Android?
A. Phones and Tablets
B. Phones, Tablets and TVs
46 B
C. watches, phones, tablets, laptops, traffic controllers and TVs
D. cars, watches, phones, tablets, laptops, robots, washing machines,
traffic controllers, head phones ,goggles and TCVs
The android version……… was used in most no. of devices till now as on
January, 2016
A. 4.3 Jellybean
47
B. 2.3.3 Gingerbread
C. 4.4 Kitkat
D. 5.1 Lollipop
The languages…………… are used to build android applications.
A. only java
48 B. Java or C A
C. Only c or C++
D. java or C Or C++
The Android web browser is based on
A. Internet Explorer
49 B. Google Chrome C
C. Web Kit
D. Safari
……… is a Linux kernel version used in Android?
A. 2.6
50 B. 3.x B
C. 2.4
D. 2.5
The latest android version…………… was released as of October, 2016
51 A. Lollipop C
B. Kit Kat
 OPERATING SYSTEM
C. Nought
D. N-Preview
The term DDMS in Android stands for………………
A. Dalvik memory server
52 B. Device memory server D
C. Dalvik monitoring services
D. Dalvik debug monitoring services
Which one of following is not nickname of a version of Android
A. Kit Kat
53 B. Lollipop C
C. Muffin
D. Gingerbread
………… is not one of three major components of APK.
A. Dalvik Executable
54 B. Native libraries D
C. Resources
D. Web Kit
…………….Program converts Java byte code into Dalvik byte code.
A. Android interpretive complier
55 B. .dex Compiler B
C. Dalvik Converter
D. None of these
Android application must be signed……….
A. After installation
56 B. Before installation B
C. Never
D. Within two weeks
……….. File Specifies the layout of your screen.
A. Layout
57 B. Manifest A
C. String XML
D. R
…………. company bought android.
A. Apple
58 B. No company C
C. Nokia
D. Google
Android is……
A. Desktop OS
59 B. PL C
C. Mobile OS
D. Database
Android doesn't support………..format
A. MP4
60 B. MPEG C
C. AVI
D. MIDI
Android supports………features.
61 A. Multitasking D
B. Bluetooth
 OPERATING SYSTEM
C. Video calling
D. All of these
Google Play is also known as
A. Android Market
62 B. Android purchase C
C. android store
D. none of these
CHAPTER NO. 05
Which one of following is not an approach to handling deadlocks?
A. Deadlock Prevention
63 B. Deadlock Avoidance D
C. Deadlock detection and recovery
D. virtual memory
Bankers Algorithm is used to………
A. Rectify deadlock
64 B. prevent deadlock B
C. avoid deadlock
D. detects deadlock
For effective utilization of operating system, when to check for deadlock?
A. Every time a resource is requested
65 B. at fixed time intervals A
C. both a and b
D. None of these
Which of following is a visual (mathematical approach to determine
occurrence of deadlock?
A. RAG
66 A
B. Starvation graph
C. Inversion graph
D. None of these
The number of resources requested by the process…….
A. must always be less than the total number of resources available in
the system
B. must always be equal to total number of resource available in the
67 C
system
C. must not exceed the total number of resources available in the
system
D. must exceed the total number of resource available
With a single resource, a deadlock occurs
A. if there are more than two processes competing for that resource.
68 B. if there are only two processes competing for that resource. D
C. if there is single process completing for that resource.
D. none of these options mentioned.
A state of system is safe if system can allocate resources to each process (up
to its maximum) in some order and still avoid deadlock then……
A. deadlocked state is unsafe
69 D
B. unsafe state may lead to deadlock
C. deadlock state is subset of unsafe states
D. all of these
Consider a system having 'm' resource of same type. These resources are
70 C
shared or utilized by three processes A, B, C which have peak time demands
 OPERATING SYSTEM
of 3, 4, 6 respectively the minimum value of 'm' that deadlock will never
occur is…….
A. 11
B. 12
C. 13
D. 14
The situation in which two running processes wanted to access resources
acquired by each other with neither of them releasing earlier acquired
resources is called……
71 A. Deadlock A
B. Circular wait
C. Mutual exclusion
D. Banker’s algorithm
……is used to represent deadlock in operating system.
A. Mutual exclusion
72 B. DRAG
C. Deadlock
D. Circular wait
The crude method to avoid deadlock is…….
A. Create new process
73 B. kill one of the processes D
C. keep waiting for processes to complete
D. ignore it
……….. helps us to know in advance before a resource is allocated to
process, whether it can lead to deadlock or it can certainly manage to avoid
A. PCB
74
B. Ostrich algorithm
C. Bankers algorithm
D. DRAG
…………means the state od resource allocation will lead to deadlock
and……… means it will avoid deadlock.
A. Safe state, Unsafe state
75
B. primary state, secondary state
C. useful state, un-useful state
D. Unsafe state, Safe state
A direct method to prevent deadlock is to prevent occurrence of
A. Hold and Wait
76 B. Circular Wait B
C. No Preemption
D. Mutual Exclusion
In order to……deadlock don't grant the incremental resource request to the
process if the allocation leads to deadlock in future.
A. Detect
77 C
B. prevent
C. avoid
D. delete
It is fair to expect that the processes must declare in advance their maximum
claim resources needed in…….
78
A. Internal resources
B. Swappable resources
 OPERATING SYSTEM
C. process resources
D. main memory
……is convenient when applied to resources whose state can be saved and
restored latter easily while preventing deadlock.
A. Request all resources
79 C
B. Resource ordering
C. Preemption
D. Finding safe path
In……some resources, such as read-only files may allow for simultaneous
access for readers but only exclusive access for writers.
A. Mutual exclusion
80 B
B. hold and wait
C. no preemption
D. circular wait
……….is one of the approaches in avoiding deadlock in operating system.
A. Hold and Wait
81 B. Process termination denial B
C. resource allocation denial
D. Application
Deadlock avoidance requires knowledge of future……
A. Resources
82 B. Process B
C. Program
D. Application
A condition of policy that must be present for deadlock to be possible is….
A. Mutual exclusion
83 B. Hold and wait
C. No pre-emption
D. All of these
All deadlocks involve conflicting needs of resources by:
A. One or more processes
84 B. three or more processes C
C. two or more processes
D. None
An operating system contains 3 user processes, each requires 2 units of
resource R. The minimum number of units of R such that no deadlock will
ever arise is…
85 A. 4 A
B. 3
C. 5
D. 6
Which of following is used to remove deadlock?
A. Preemption
86 B. Mutual exclusion
C. Circular wait
D. None of these
……… Techniques can be used to resolve conflicts, like competition for
resources and to synchronize processes so that they can cooperate.
87 C
A. Busy waiting
B. Deadlocks
 OPERATING SYSTEM
C. Mutual Exclusion
D. Starvation
………problem is solved by Dijkstra's Bankers algorithm.
A. Deadlock prevention
88 B. deadlock avoidance B
C. deadlock detection
D. deadlock recovery
To avoid deadlock…….
A. There must be fixed no. of resources must be allocated
89 B. Resource allocation must be done only once A
C. all deadlocked processes must be aborted
D. Inversion techniques used.
Request and Release of resources are………….
A. Command line statements
90 B. interrupts C
C. System calls
D. Special programs
If no cycle exist in a resource allocation graph then…………
A. System will not be in safe state
91 B. system is in safe state B
C. both a & b
D. None of these
a wait for graph in operating system is directed graph is used for………
A. Deadlock prevention
92 B. deadlock avoidance B
C. resource preemption
D. deadlock detection
It is not possible to have deadlock involving single process because…….
A. This holds mutual exclusion, hold and wait and no preemption
conditions.
93
B. This follows directly from hold and wait condition
C. Single process not always in safe state
D. None of these
***UNIVERSITY MODEL QUESTIONS***

SR.
QUESTIONS ANS
NO.
An interface between the running program and an operating system is
termed as .
1) (A) Application Program
(B) Operating System C
(C). System call
(D) All of these
CPU performance is measured through
(A) Throughput
2) (B) MHz A
(C) Flaps
(D) None of above
3) Which of following is open source operating system D
 OPERATING SYSTEM
(A) MS-DOS
(B) Windows
(C) Mac OS
(D) Linux
is acronym for simultaneous peripheral operation online that uses
disk as large buffer for reading from input devices and storing output
files.
4) (A) Batch processing B
(B) Spooling
(C) Time-sharing
(D). Resource accounting
Paging eliminates
(A)Swapping
5) (B) fragmentation B
(C) memory space
(D) None of these
When power button of a computer is turned on process is
occur.
(A) shutdown
6) B
(B) booting
(C) spooling
(D) cooling
A program in execution is called
(A) Process
7) (B) Instruction A
(C) Procedure
(D) Function
One of the operating system service that indicates whether
program is terminated normally or abnormally is
8) (A) Resource allocation B
(B) Program execution
(C) I/O management
(D)None
The swaps processes in and out of the memory.
A) Memory manager
9) B) CPU A
C) CPU manager
D) User
Which of followings error does operating system handles?
(A) power failure
10) (B) paper out of printer D
(C) network failure
(D) All of these
Which of following is not operating system?
(A) Batch
11) (B) File manipulation B
(C) Time-sharing
(D) Real-time
 OPERATING SYSTEM
An operating system that have accesses more than one program
simultaneously from memory is .
12) (A) Spooling C
(B) Batch
(C) Multi-programming
(D) Time-sharing
Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first?
(A) first come first served scheduling
13) A
(B) shortest job scheduling
(C) priority scheduling
(D) none of above
A running program needs input and as the program completes its
execution it produces results. The function of operating system that
handles this task is
14) (A) Process management B
(B) I/O management
(C) Memory management
( D) None
Operating System maintains the page table for
(A) each process
15) (B) each thread A
(C) each instruction
(D) each address
In Shortest Job First(Non preemptive) the burst time for job1 is 18,
job2 is 2, job3 is 2 and job4 is 6 then the average turn around time is

16) (A)11
A
(B)12
(C) 13
(D) 14
The policy selects the disk I/O request that requires the least
movement of disk arm from its current position.
17) (A) FCFS
B
(B) SSTF
(C) SCAN
(D) C-LOOK
In which of the following scheduling algorithm, the average waiting time for
the process to start execution is often quite long.
(A) Shortest-Job-First-Scheduling
18) (B) First-Come-First-Serve B
(C) Priority Scheduling
(D) None of these
In scheduling system, the currently executing program can be
removed from CPU at any time.
19) B
(A)Non preemptive scheduling
(B) Preemptive scheduling
 OPERATING SYSTEM
(C) Priority scheduling
(D) None of these
Memory management technique in which system stores and retrieves data
from secondary storage for use in main memory is called?
(A) fragmentation
20) B
(B) paging
(C) mapping
(D) none of the mentioned
Which of the following scheduler allocate processes belonging to ready
queue to CPU for immediate processing.
(A) Mid term scheduler
21)
(B) Long term scheduler C
(C) Short term scheduler
(D) System scheduler
is a type of kernel used in Android.
(A) Micro kernel
22) (B) Monolithic kernel B
(C). Hybrid kernel
(D) none of these
The number of processes completed per unit time is known as
(A) Output
23) (B) Throughput
B
(C) Efficiency
(D) Capacity
Which of the following condition is required for a deadlock to be possible?
(A) mutual exclusion
(B) a process may hold allocated resources while awaiting assignment of
24) other resources D
(C) no resource can be forcibly removed from a
process holding it
(D) all of the mentioned
A memory management technique in which user has complete control
over the entire memory space is
(A) MVT
25) D
(B) MFT
(C) Resident monitor
(D) bare machine
What is a Process Control Block?
(A) Process type variable
26) (B)Data Structure
B
(C) A secondary storage section
(D) A Block in memory
Which of the term is not related to disk scheduling?
(A) transfer time
27) (B) waiting time B
(C) seek time
(D) rotational latency
28) The Android web browser is based on . C
 OPERATING SYSTEM
(A) Internet Explorer
(B) Google Chrome
(C) Web Kit
(D)Safari
holds the address of next instruction to execute.
(A) Program curser
29) (B) Program instruction C
(C) Program counter
(D) None of these
A solution to the problem of indefinite blockage of low-priority processes
is

30) (A) starvation

B
(B) aging
(C) segmentation
(D) ready queue
suffers from external fragmentation.
(A)Segmentation
31) (B)Paging A
(C)Swapping
(D) None of these
Waiting time is
(A) the total time in blocked and waiting queue.
32) (B) the total time spent in the running state. C
(C) the total time spent in the ready queue.
(D) the total time from completion till the submission of a process.
is not a part of Androids native libraries.
( A) SQLite
33) (B) Web kit C
(C) Dalvik
(D) OpenGL
A technique to remove an inactive program from memory temporarily is
known as
(A) Paging
34) B
(B) Swapping
(C) Deleting
(D) Editing
The Round Robin scheduling algorithm is
(A) Preemptive
35) (B) Nonpreemptive
A
(C) either Preemptive or Nonpreemptive
(D) All of these
In priority scheduling algorithm
(A) CPU is allocated to the process with highest priority
36) (B) CPU is allocated to the process with lowest priority
A
(C) Equal priority processes can not be scheduled
(D) None of these
37) In Android Architecture, layer below System Libraries and Android runtime B
 OPERATING SYSTEM
is (It is also known as lowest layer)
(A)Applications
(B) Linux Kernel
(C) Applications Frameworks
(D) System Libraries and Android runtime
If the quantum time of round robin algorithm is very large, then it is
equivalent to
(A) Shortest job first
38)
(B) First-in-First-Out B
(C) Priority scheduling
(D) None of these
Shortest Job First is
(A) CPU scheduling algorithm
39) (B) Memory Management algorithm
(C) Disk Scheduling algorithm
A
(D) None of these
Memory fragmentation results in
(A) Stack Overflow
40) (B) Page Fault
D
(C) Better utilization of memory
(D) Poor utilization of memory
Program always deals with
(A) Logical Address
41) (B) Physical Address
A
(C) Absolute Address
(D) Relative Address
reduces external fragmentation.
(A) MVT
42) (B) MFT
C
(C) Paging
(D) Segmentation
A memory block assign to a process is larger than the memory required
for the process then occurs.
(A) Internal fragmentation
43)
(B) External fragmentation
(C) Total fragmentation A
(D) None of these
Android supports
(A) Bluetooth
44) (B) Wifi D
(C) 4G/3G/2G
(D) All of these
A multiprogramming system with fixed number of task is known as
(A) MVT
45) (B) MFT
B
(C) Paging
(D) Segmentation
 OPERATING SYSTEM
Fence register is used for
(A) CPU protection
46) (B) File protection
C
(C) Memory protection
(D) None of these
In segmentation, each address is specified by
A) a segment number & offset
47) B) an offset & value
C) a value & segment number A
D) a key & value
Swapping requires a
(A) motherboard
48) (B) keyboard
D
(C) monitor
(D) backing store
An optimal scheduling algorithms in terms of minimizing the average
waiting time of a given set of processes is
(A)FCFS Scheduling algorithm
49) C
(B) Round robin scheduling algorithm
(C) Shortest Job first scheduling algorithm
(D) None of above
The page table contains
(A) base address of each page in physical memory
50) (B) page offset A
(C) page size
(D) none of the mentioned
Logical address is generated by
(A) CPU
51) (B) Main memory A
(C) Address register
(D) I/O Unit
Physical memory is broken into fixed-sized blocks called
(A) frames
52) (B) pages
A
(C) backing store
(D) none of these
A solution to the problem of external fragmentation is
(A) compaction
53) (B) larger memory space
A
(C) smaller memory space
(D) None of these
In movable head system, the time required to position read/write head on
desired track is
54) (A) Seek time A
(B) Rotational Delay
(C) Access time
(D) Transfer time.
55) In Algorithm, when last track has been visited in one direction, D
 OPERATING SYSTEM
the arm is return to opposite end of the disk and scan begins again.
(A) Last in First Out
(B) Shortest Seek Time First
(C) SCAN
(D) Circular SCAN
CPU scheduling is the basis of
(A) multiprocessor systems
56) (B) multiprogramming operating systems B
(C) larger memory sized systems
(D) none of these
SSTF stands for
(A) Shortest Seek Time First
57) (B) Smallest Seek Time First A
(C) Simple Seek Time First
(D) None of these
Which of following are major activities of an operating system in connection
to secondary storage management?
58) (A) Free space management D
(B)Storage management
(C) Disk scheduling
(D) All of these
Sector interleaving in disk is performed by
(A) Operating System
59) (B) Disk Manufacturer A
(C)The disk controller
(D) None of these
Which of the following disk scheduling algorithm is also known as Elevator
algorithm.
60) (A) FCFS C
(B) SSTF
(C) SCAN
(D) None of these
Disk and Drum Scheduling involves deciding:
(A) Which disk should be accessed next
61) (B) The order in which disk access request must be serviced B
(C) The physical location where files should be accessed in the disk
(D) None of these.
What is the drawback of banker’s algorithm
(A) in advance processes rarely know how much resource they will need
62) (B) the number of processes changes as time progresses D
(C) resource once available can disappear
(D) all of the mentioned
Which of following term is not related to disk scheduling?
(A)Transfer time
63) B
(B) Waiting time
(C) Seek time
 OPERATING SYSTEM
(D) Rotational latency
The sum of the seek time and rotational delay is called the
(A) Reached time
64) (B) Arrived time C
(C) Access Time
(D) Common time
The actual time required to transfer data from disk to main memory, this
time is called as
65) (A)Transfer time A
(B) Waiting time
(C) Seek time
(D) Rotational latency
A deadlock situation can arise if which of the following conditions hold
simultaneously in a system.
(A) Mutual exclusion
66)
(B) Hold and Wait D
(C) No pre-emption
(D) All of these
Bankers algorithm for resource allocation deals with
(A) deadlock prevention
67) (B) deadlock avoidance
B
(C) deadlock recovery
(D) None of these
If no cycle exists in the resource allocation graph
(A) then the system will not be in a safe state
68) (B) then the system will be in a safe state
B
(C) all of the mentioned
(D) none of the mentioned
If we preempt a resource from a process, the process cannot continue
with its normal execution and it must be
69) (A) aborted
(B) terminated C
(C) rolled back
(D) queued
Deadlock can be described more précised in terms of a directed graph called
a
(A) System resource allocation graph
70) (B) Bar graph A
(C) pie chart
(D) Line graph
In order to the deadlock do not grant an incremental resource
request to a process if this allocation might lead to deadlock.
(A) Prevent
71) B
(B) Avoid
(C) Detect
(D) Delete
is a closed chain of processes exists, such that each process holds
72) D
at least one resource needed by the next process in the chain.
 OPERATING SYSTEM
(A) Mutual Exclusion
(B) Hold and Wait
(C) Preemption
(D) Circular Wait
For effective utilization of operating system, when to check for deadlock?
(A)every time a resource is requested
73) (B) at fixed time intervals
C
(C) both A and B
(D) none of these
To avoid deadlock
(A) there must be a fixed number of resources to allocate
74) (B) resource allocation must be done only once A
(C) all deadlocked processes must be aborted
(D) inversion technique can be used
If preemption is required to deal with deadlocks, which of the following
issues need to be addressed:
(A) select a victim
75)
(B) Rollback D
(C) Starvation
(D) All of these
The operating system is used as base of Androids stack.
(A) XML
76) (B) Linux B
(C) Windows 8.1
(D) (D) Java
The built-in database used in android environment is .
(A) SQLite
77) (B) Apache A
(C) Oracle
(D) MySQL
Which one of following is not nickname of a version of Android?
(A) Kit Kat
78) (B) Lollipop C
(C) Muffin
( D) Gingerbread
Google Play is also popularly known as
(A)Android Market
79) (B) Android purchase A
(C) Android store
( D)None of These
The .apk extension stands for
(A) Application package
80) (B) Application program kit A
(C) Android package
(D) None of these
The process that are residing in main memory and are ready and
81) B
waiting to execute are kept on a list called
 OPERATING SYSTEM
(A) job queue
(B) ready queue
(C) execution queue
(D) process queue
The interval from the time of submission of a process to the time of
completion is termed as
(A) waiting time
82) B
(B) turnaround time
(C) response time
(D) throughput
Major problem with priority scheduling is
A) Definite blocking
83) (B) Low priority C
(C) Starvation
(D) None of these
Which of the following criteria to evaluate a scheduling algorithm?
(A) CPU utilization
84) (B) Throughput D
(C) waiting time
(D) All of these
A CPU bound program might have
(A) a few long CPU bursts
85) (B) a few short CPU bursts A
(C) many short CPU bursts
(D) None of above
A scheduler which selects processes from secondary storage device is called
(A) Short term scheduler
86) (B) long term scheduler C
(C) medium term scheduler
(D) None of these
Difference between turnaround time and burst time is called
(A)response time
87) (B)waiting time B
(C)recurring time
(D)None of these
Which are the following is not an approach to handling
deadlock? (A)Deadlock prevention
88) (B) Deadlock avoidance
D
(C) Deadlock detection and recovery
(D) Virtual Memory
In FCFS scheduling algorithm, turn around time of job1 is 18, job2 is 20
, job3 is 22 and job4 is 28 then average waiting time is
(A) 16
89) B
(B) 15
(C) 14
(D) 13
Total memory space in enough to satisfy a request or to store a process
90) B
but memory is not contiguous then occurs.
 OPERATING SYSTEM
(A)Internal fragmentation
(B) External fragmentation
(C) Total fragmentation
(D)None of these
Page offset is combined with address to define physical
memory address.
(A) Base
91) A
(B) memory
(C) Logical
(D) None of these
eliminates internal fragmentation.
(A)Paging
92) (B) Segmentation B
(C) Swapping
(D) none of these
Run time mapping from virtual to physical address is done by
(A) Memory management unit
93) (B) CPU A
(C) PCI
(D) None of the mentioned
The address of a page table in memory is pointed by
(A) stack pointer
94) (B) page table base register B
(C) page register
(D) program counter
Android is
(A) web server
95) (B) web browser C
(C)operating system
(D) None of these
Android is specially developed for
(A) Laptops
96) (B) Desktops C
(C) Mobile devices
(D) None of these
A system is in the safe state if
(A) the system can allocate resources to each process in some order and still
avoid a deadlock
97) A
(B) there exist a safe sequence
(C) all of the mentioned
(D) none of the mentioned
Which one of the following is a visual ( mathematical ) way to determine the
deadlock occurrence?
(A) resource allocation graph
98) A
(B) starvation graph
(C) inversion graph
(D) none of the mentioned
The data structures available in the Banker’s algorithm are
99) D
(A) Available
 OPERATING SYSTEM
(B) Need
(C) Allocation
(D) All of the mentioned
A wait-for graph in operating system is a directed graph is used for
(A) Deadlock prevention
100) (B) Deadlock avoidance C
(C) Deadlock detection
(D) resource preemption
What is operating system?
a) collection of programs that manages hardware resources
1 b) system service provider to the application programs D
c) link to interface the hardware and application programs
d) all of the mentioned
To access the services of operating system, the interface is provided by the

a) System calls
2 A
b) API
c) Library
d) Assembly instructions
Which one of the following is not true?
a) kernel is the program that constitutes the central core of the operating
system
b) kernel is the first part of operating system to load into memory during
3 booting C
c) kernel is made of various modules which can not be loaded in
running operating system
d) kernel remains in the memory during the entire computer
session
What is the main function of the command interpreter?
a) to get and execute the next user-specified command
4 b) to provide the interface between the API and application program A
c) to handle the files in operating system
d) none of the mentioned
If a process fails, most operating system write the error information to a

a) log file
5 A
b) another running process
c) new file
d) none of the mentioned
Which of the following do not belong to queues for processes?
a) Job Queue
6 b) PCB queue B
c) Device Queue
d) Ready Queue
When the process issues an I/O request
a) It is placed in an I/O queue
7 b) It is placed in a waiting queue A
c) It is placed in the ready queue
d) It is placed in the Job queue
8 Which module gives control of the CPU to the process selected by the A
 OPERATING SYSTEM
short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
The processes that are residing in main memory and are ready and
waiting to execute are kept on a list called
a) job queue
9 B
b) ready queue
c) execution queue
d) process queue
Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first?
a) first-come, first-served scheduling
10 A
b) SHORTEST job scheduling
c) priority scheduling
d) none of the mentioned
In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
11 b) CPU is allocated to the process with lowest priority A
c) Equal priority processes can not be scheduled
d) None of the mentioned
Process are classified into different groups in
a) shortest job scheduling algorithm
12 b) round robin scheduling algorithm D
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Round robin scheduling falls under the category of
a) Non-preemptive scheduling
13 b) Preemptive scheduling B
c) All of the mentioned
d) None of the mentioned
The portion of the process scheduler in an operating system that
dispatches processes is concerned with
a) assigning ready processes to CPU
14 A
b) assigning ready processes to waiting queue
c) assigning running processes to blocked queue
d) all of the mentioned
What is FIFO algorithm?
a) first executes the job that came in last in the queue
15 b) first executes the job that came in first in the queue B
c) first executes the job that needs minimal processor
d) first executes the job that has maximum processor needs
What is Scheduling?
a) allowing a job to use the processor
16 b) making proper use of processor A
c) all of the mentioned
d) none of the mentioned
What is a reusable resource?
17 A
a) that can be used by one process at a time and is not depleted by that use
 OPERATING SYSTEM
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
Which of the following condition is required for a deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment
18 D
of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned
A system is in the safe state if
a) the system can allocate resources to each process in some order and
still avoid a deadlock
19 A
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned
The circular wait condition can be prevented by _
a) defining a linear ordering of resource types
20 b) using thread A
c) using pipes
d) all of the mentioned
To avoid deadlock
a) there must be a fixed number of resources to allocate
21 b) resource allocation must be done only once A
c) all deadlocked processes must be aborted
d) inversion technique can be used
The swaps processes in and out of the memory.
a) Memory manager
22 b) CPU A
c) CPU manager
d) User
In a system that does not support swapping
a) the compiler normally binds symbolic addresses (variables) to
relocatable addresses
23 b) the compiler normally binds symbolic addresses to physical addresses A
c) the loader binds relocatable addresses to physical addresses
d) binding of symbolic addresses to physical addresses normally takes place
during execution
CPU fetches the instruction from memory according to the value of

a) program counter
24 A
b) status register
c) instruction register
d) program status word
A memory buffer used to accommodate a speed differential is called

a) stack pointer
25 B
b) cache
c) accumulator
d) disk buffer
26 Which one of the following is the address generated by CPU? C
 OPERATING SYSTEM
a) physical address
b) absolute address
c) logical address
d) none of the mentioned
Memory management technique in which system stores and retrieves data
from secondary storage for use in main memory is called?
a) Fragmentation
27 B
b) Paging
c) mapping
d) none of the mentioned
The address of a page table in memory is pointed by
a) stack pointer
28 b) page table base register B
c) page register
d) program counter
The page table contains _
a) base address of each page in physical memory
29 b) page offset A
c) page size
d) none of the mentioned
Physical memory is broken into fixed-sized blocks called
a) frames
30 b) pages A
c) backing store
d) none of the mentioned
Logical memory is broken into blocks of the same size called
a) frames
31 b) pages B
c) backing store
d) none of the mentioned
Every address generated by the CPU is divided into two parts. They are

a) frame bit & page number

32 B
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
The is used as an index into the page table.
a) frame bit
33 b) page number B
c) page offset
d) frame offset
The size of a page is typically
a) varied
34 b) power of 2 B
c) power of 4
d) none of the mentioned
The operating system maintains a table that keeps track of
how many frames have been allocated, how many are there, and how
35 C
many are available.
a) page
 OPERATING SYSTEM
b) mapping
c) frame
d) memory
Smaller page tables are implemented as a set of
a) queues
36 b) stacks D
c) counters
d) registers
he page table registers should be built with
a) very low speed logic
37 b) very high speed logic B
c) a large memory space
d) none of the mentioned
For every process there is a
a) page table
38 b) copy of page table A
c) pointer to page table
d) all of the mentioned
In segmentation, each address is specified by
a) a segment number & offset
39 b) an offset & value A
c) a value & segment number
d) a key & value
In paging the user provides only which is partitioned by the
hardware into and
a) one address, page number, offset
40 A
b) one offset, page number, address
c) page number, offset, address
d) none of the mentioned
Each entry in a segment table has a
a) segment base
41 b) segment peak A
c) segment value
d) none of the mentioned
The segment base contains the
a) starting logical address of the process
42 b) starting physical address of the segment in memory B
c) segment length
d) none of the mentioned
The protection bit is 0/1 based on
a) write only
43 b) read only C
c) read – write
d) none of the mentioned
If one or more devices use a common set of wires to communicate
with the computer system, the connection is called
a) CPU
44 D
b) Monitor
c) Wirefull
d) Bus
 OPERATING SYSTEM
A is a collection of electronics that can operate a port, a
bus, or a device.
a) controller
45 A
b) driver
c) host
d) bus
Each request requires that the system consider the

to decide whether the current request can be satisfied or must wait to

avoid a future
46 possible deadlock. A
a) resources currently available
b) processes that have previously been in the system
c) resources currently allocated to each process
d) future requests and releases of each process
Given a priori information about the number of resources of
each type that maybe requested for each process, it is possible to construct
an algorithm that ensures that the system will never enter a deadlock state.
47 a) minimum C
b) average
c) maximum
d) approximate
A deadlock avoidance algorithm dynamically examines the
t
o ensure that a circular wait condition can never exist.
48 a) resource allocation state A
b) system storage state
c) operating system
d) resources
A state is safe, if
a) the system does not crash due to deadlock occurrence
b) the system can allocate resources to each process in some order and
49 B
still avoid a deadlock
c) the state keeps the system protected and safe
d) all of the mentioned
A system is in a safe state only if there exists a
a) safe allocation
50 b) safe resource C
c) safe sequence
d) all of the mentioned
The data structures available in the Banker’s algorithm are

a) Available
51 D
b) Need
c) Allocation
d) All of the mentioned
The address generated by the CPU is referred to as
a) Physical address
52 B
b) Logical address
c) Neither physical nor logical
 OPERATING SYSTEM
d) None of the mentioned
The address loaded into the memory address register of the memory is
referred to as
a) Physical address
53 A
b) Logical address
c) Neither physical nor logical
d) None of the mentioned
The size of a process is limited to the size of
a) physical memory
54 b) external storage A
c) secondary storage
d) none of the mentioned
If execution time binding is being used, then a process be swapped to a
different memory space.
a) has to be
55 D
b) can never
c) must
d) may
The consists of all processes whose memory images are in the
backing store or in memory and are ready to run.
a) wait queue
56 B
b) ready queue
c) cpu
d) secondary storage
The major part of swap time is time.
a) waiting
57 b) transfer B
c) execution
d) none of the mentioned
Swap space is allocated
a) as a chunk of disk
58 b) separate from a file system A
c) into a file system
d) all of the mentioned
Which process can be affected by other processes executing in the system?
a) cooperating process
59 b) child process A
c) parent process
d) init process
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?
60 a) dynamic condition B
b) race condition
c) essential condition
d) critical condition