Objective Question Bank

Unit-III
Q.No Btl Question A B C D Answer
1 1 The Circular Wait A)Defining B)Using C)Using Pipes D) All Of The A
Condition Can Be A Linear Thread Mentioned.
Prevented By Ordering
Of
Resource
Types
2 1 Which One Of The A)Banker B)Round- C) Elevator D)Karn’s A
Following Is The ’s Robin Algorithm Algorithm
Deadlock Avoidance Algorith Algorithm
Algorithm? m

3 1 A Problem Encountered In Deadlock. Starvation Inversion Aging B

Multitasking When A
Process Is Perpetually
Denied Necessary
Resources Is Called
4 1 Which One Of The Resource Starvation Inversion Graph None Of The A
Following Is A Visual Allocation Graph Mentioned
(Mathematical) Way To Graph
Determine The Deadlock
Occurrence?

5 1 To Avoid Deadlock Resource All Inversion There Must Be D

Allocatio Deadlocke Technique Can A Fixed Number
n Must d Be Used. Of Resources To
Be Done Processes Allocate
Only Must Be
Once Aborted

6 2 The Request And Release Interrupt System Calls Special C

Of Resources Are Command s Programs.
___________ Line
Statement
s
7 2 For A Deadlock To Arise, Mutual No Hold And Wait All Of The D
Which Of The Following Exclusion Preemptio Mentioned
Conditions Must Hold n
Simultaneously?

8 1 For Sharable Is Required Maybe Or Is Not Required None Of The C

Resources, Mutual May Not Mentioned
Exclusion Be
____________ Required

1
9 4 The Disadvantage Of A Low Cpu Very High Low None Of The C
Process Being Allocated Utilization Resource Resource Mentioned
All Its Resources Before Utilization Utilization
Beginning Its Execution Is
____________

10. 1 . If The Resources Are Deadlock System Aging Starvation D

Always Preempted From Crash
The Same Process
__________ Can Occur.
Deadlock

11. 2 What Is The Solution The The Number Resource All Of The B
To Starvation? Number Of Of Preemption Be Mentioned.
Resources Rollbacks Done Instead
Must Be Must Be
Included In Included In
Resource The Cost
Preemption Factor
Unit-IV
Which One Of The Physic
Following Is The al Absolut
None Of The
12. 2 Address Generated By Addres e Logical Address C
s Address Mentioned
Cpu?

13. 2 Memory Management Fragment Paging Mapping None Of The B

Technique In Which ation Mentioned
System Stores And
Retrieves Data From
Secondary Storage For
Use In Main Memory Is
Called?

14. 4 Program Always Deals Logical Absolute Physical Address Relative Address. A
With ____________ Address Address

15. 2 Swapping Requires A Mother Keyboard Backing Store. Monitor C

_________ Board

16. 4. The _________ Time Context – Waiting Execution All Of The A

In A Swap Out Of A Switch. Mentioned
Running Process And
Swap In Of A New
Process Into The
Memory Is Very High.

2
17. 3 Physical Memory Is Broken Backing Pages Frames None Of The C
Into Fixed-Sized Blocks Store Mentioned.
Called ________

18. 3 Logical Memory Is Broken Frames Pages Backing Store None Of The B
Into Blocks Of The Same Mentioned.
Size Called _________

19. 3 The __________ Is Used Page Frame Bit Page Offset Frame Offset A
As An Index Into The Page Number
Table.

20. 2 The Size Of A Page Is Power Of 4 Varied Power Of 2 None Of The C

Typically ____________ Mentioned.

21. 1 For Every Process Copy Of Page Table Pointer To Page All Of The B
There Is A Page Table Table Mentioned.
__________

22. 2 With Paging There Is No Internal External Either None Of The B

________ Fragmentation Type Of Mentioned.

23. 3 The Protection Bit Is 0/1 Write Only Read Only Read – None Of The C
Based On ____________ Write Mentioned.

24 2 The ___________ Swaps Memory Cpu Cpu Manager User A

Processes In And Out Of Manager.
The Memory

25. 4 The ___________ Must Programmer System System Designer None Of The A
Design And Program The Architect. Mentioned
Overlay Structure.

26. 3 What Is Dynamic Loading Loading Loading None Of The B

Loading? Multiple A Multiple Mentioned.
Routines Routine Routines
Dynamica Only Randoml
lly When It y
Is Called

3
27. 2 What Is The A Used An Cpu Utilization All Of The B
Advantage Of Routine Is Unused Increases Mentioned
Dynamic Loading Used Routine Is
Multiple Never
Times Loaded

28. 2 The Three Major Methods Contiguous Linked Indexed All Of The D
Of Allocating Disk Space Mentioned
That Are In Wide Use Are
_____________
29. 1 On Systems Where There Boot Bootstrap Process Control File Control A
Are Multiple Operating Loader Block Block
System, The Decision To
Load A Particular One Is
Done By _____________

30. 1 The Vfs (Virtual File A) Size B) C) Timings D) File D

System) Activates File Command System
System Specific Operations s Types
To Handle Local Requests
According To Their
_______.

Unit-V
31. 1 One Difficulty Of A) Finding B) C) Costly D) Time Taking. A
Contiguous Allocation Is Space For A Inefficient
_____________ New File.

32. 1 _______ And A) First Fit, B) Worst C) Best Fit, D) None Of The A
________ Are The Best Fit. Fit, First Worst Fit Mentioned
Most Common Fit
Strategies Used To
Select A Free Hole
From The Set Of
Available Holes.

33. 1 _______ And ________ A) First Fit, B) Worst Fit, C) Best Fit, D) None A
Are The Most Common Best Fit First Fit Worst Fit Of The
Strategies Used To Select Mentione
A Free Hole From The Set d
Of Available Holes.

34. 2 The First Fit And Best Fit A) Internal B) C) Starvation D) All Of The B
Algorithms Suffer From Fragmentati External Mentioned
_____________. on Fragment
ation

35. 1 What Will Happen In The A) Each B) The C) All Of The D) None Of The A
Two Level Directory User Has System Mentioned Mentioned
Doesn’t Its
4
 Structures? His/Her Own Master
Own User File
File Directory
Directory.

36. 2 Which Of The Following A) B) Local C) Global & D) D

Are The Types Of Path Relative & Global Relative Absolute &
Names?. & Local Relative

37. 3 In Distributed File System A) Protected. B) Local C) Private D) Remote D

________________
Directories Are Visible
From The Local Machine..

38. 2 The Machine Containing A) Master, B) C) Server, D) None Of The C

The Files Is The _______ Slave. Memor Client Mentioned
And The Machine Wanting y, User
To Access The Files Is The
______

39. 3. Each Set Of Operations For A) Program B) Code C) Transaction D) All Of The C
Performing A Specific Task Mentioned
Is A _________

40. 2. Protection Is Only Provided A) Lower. B) C) Higher D) None A

At The _____ Level. Central Of The
Mentioned

41. 1 What Is The Main Problem A) Their B) Their C) Their D) All Of The B
With Access Control Lists? Maintenanc Length Permissions Mentioned
e

42. 1 An Absolute Path Name A) Leaf. B) Stem C) Current D) Root D

Begins At The Directory
_____________

43. 1. A Relative Path Name A) Leaf B)St C) Current D) Root C

Begins At The em Directory
_____________

44. 2 With A Shared File A) Actual B) There C) The Changes D) The Changes D
_____________ File Exists Are Two Made By One Made By One
5
 Copies Of Person Are Not Person Are
The File Reflected To The Reflected To The
Other Other.

45. 1 Some Directory A) Fill Up B) C) D) Speed D

Information Is Kept The Cache Increase Decrease Up Access
In Main Memory Free Free Space
Or Cache To Space In In
___________ Secondary Secondary
Storage Storage

46. 2 In The World Wide Web, A) B) Plugin C) D) Player C

A ____ Is Needed To Gain Laptop Browser
Access To The Remote
Files, And Separate
Operations Are Used To
Transfer Files..

47. 4 When A User Refers To A A) System B) His C) Both D) Every C

Particular File? Mfd Is Own Ufd Mfd And Directory Is
Searched. Is Not Ufd Are Searched
Searched Searched

48. 1 The Directory Can Be A) Symbol B) Partition C) Swap Space D) Cache A

Viewed As A _________ Table
That Translates File
Names Into Their
Directory Entries.

49. 2 _______ Tend To A) Cpus. B) C) Programs D) I/O B

Represent A Major Disks
Bottleneck In System
Performance.
A) Cpus

50. 2. The Deletion Of A Link A) B) C) Does Not D) None C

________ The Original Deletes Affects Affect Of The
File.. Mentione
d