1051 MCQ3

1052 MCQ3

1053 MCQ3

1054 MCQ3

1055 MCQ3

1056 MCQ3

1057 MCQ3

1058 MCQ3

1059 MCQ3

1060 MCQ3

1061 MCQ3

1062 MCQ3

1063 MCQ3

1064 MCQ3

1065 MCQ3

1066 MCQ3

1067 MCQ3

1068 MCQ3

1069 MCQ3

1070 MCQ3

1071 MCQ3

1072 MCQ3

1073 MCQ3

1074 MCQ3

1075 MCQ3

1076 MCQ3

1077 MCQ3

1078 MCQ3

1079 MCQ3

1080 MCQ3

1081 MCQ3

1082 MCQ3

1083 MCQ3

1084 MCQ3

1085 MCQ3

1086 MCQ3

1087 MCQ3

1088 MCQ3

1089 MCQ3

1090 MCQ3

1091 MCQ3

1092 MCQ3

1093 MCQ3

1094 MCQ3

1095 MCQ3

1096 MCQ3

1097 MCQ3

1098 MCQ3

1099 MCQ3

1100 MCQ3

a. Process
b. Instruction
c. Procedure
2. The task of subdividing memory between the O/S and processes is
performed automatically by the O/S and is called:
a. Protection
b. Relocation
c. Memory Management
d. All of the above
3. The concept of virtual memory is based on one or both of two basic
techniques:
a. Overlaying and relocation
b. Segmentation and paging
c. Segmentation and partitioning
d. None of the above
4. An actual location in main memory is called a(n):
a. Relative address
b. Logical address
c. Absolute address
d. None of the above
5. The simplest way to break a deadlock is to :
a. preempt a resource
b. rollback
c. kill one of the processes
d. lock one of the processes
6. Virtual memory is:
a.simple to implement
b.used in all major commercial operating systems
c. less efficient in utilization of memory
d.useful when fast I/O devices are not available
7. ___________ is a technique of temporarily removing inactive programs from
the memory of computer system :
a.Swapping
b.Spooling
c. Semaphore
d.
Scheduler
8. Virtual memory can be implemented with :
Segmentation
Paging
None
all of the above

a.
b.
c.
d.

9. The type of memory that allows for very effective multiprogramming and
relieves
the user of memory size constraints is referred to as:
a. Real memory
b. Virtual memory
c. Main memory
d. All of the above

10. Which of the following loader is executed when a system is first turned on
or
restarted
a. Boot loader
b.
Compile and Go loader
c. Bootstrap loader
d.
Relating loader
11. LRU page replacement policy is
a. Last Replaced Unit b. Last Restored Unit.
c. Least Recently Used d.Least Required Unit.
12. Which of the following is not a fundamental process state: a. ready b.
terminated c. executing d. blocked
13. In terms of frequency of execution, the short-term scheduler is usually the
one
that executes:
a. Most frequently
b. Least frequently
c. About the same as the
other schedulers
d. None of the above
14. The scheduling in which CPU is allocated to the process with least CPUburst time
is called
a.Priority Scheduling b. Shortest job first Scheduling
c. Round Robin Scheduling d. Multilevel Queue Scheduling
15. Which of the following approaches do not require knowledge of the system
state?:
a. deadlock detection b. deadlock
prevention
c. deadlock avoidance d. none of the above.
16. Which scheduling policy is most suitable for a time-shared operating
system:
a. Shortestjob First
b. Elevator
c. Round-Robin
d. First-Come-First-Serve.
17. A set of techniques that allow to execute a program which is not entirely in
memory is called :
a. demand paging b.
virtual memory
c. auxiliary memory d.
secondary memory

18. ___________ is a technique of improving the priority of process waiting in

Queue
for CPU allocation
a. Starvation
b. Ageing
c. Revocation
d.Relocation
19. ________ is the time required by a sector to reach below read/write head
a. Seek Time
b. Latency Time
c. Access time d. None
20. Page stealing
a. is a sign of efficient system
b. is taking page frames other working sets
c.
should be the tuning goal
d.
is taking larger disk spaces for pages paged out
21. Before proceeding with its execution, each process must acquire all the
resources
it needs is called
a. hold and wait
b. No pre-emption
c. circular wait
d. starvation
22. SSTF stands for
a. Shortest-Seek-time-first scheduling
small-time-first
c. simple-seek-time-first
small-simple-time-first
scheduling

b. small
d.

23. Which amongst the following is not a valid page replacement policy
a. LRU policy (Least Recently Used)
b. FIFO policy (First in first out)
c. RU policy (Recurrently used)
d. Optimal page replacement policy
24. The concept associated with determining the number of processes that will
be
resident in main memory is referred to as:
a. A cleaning policy
b. The page fault frequency
c. Load Control
d. None of the above
25. A reference to a memory location independent of the current assignment of
data
to memory is called a(n):
a. Relative address
b. Logical address
c. Absolute address
d. None of the above

26. The problem of internal fragmentation can be lessened in systems

employing a
fixed-partition memory management scheme by using:
a. Random size partitions
b. Equal size partitions
c. Unequal size partitions
d. None of the above
27. The practice in which a program and data are organized in such a way that
various modules can be assigned the same region of memory is called:
a. Overlaying
b. Sharing
c. Relocation
d. None of the above

28. The fetch policy that exploits the characteristics of most secondary memory
devices, such as disks, which have seek time and rotational latency is called:
a. Demand paging
b. Prepaging
c. Swapping
d. None of the above

29. The replacement policy that is impossible to implement because it would

require
the O/S to have perfect knowledge of future events is called the:
a. Optimal policy
b. Least recently used (LRU) policy
c. Clock policy
d. None of the above
30. Which of the following scheduling policies allow the O/S to interrupt the
currently
running process and move it to the Ready state?
a. Preemptive
b. Non-Preemptive
c. First-come-first-served
d. None of the above
31. The replacement policy that treats the page frames allocated to a process
as a circular buffer is called ______________.
a. FCFS
b.FIFO

32. The expansion of nested macro calls follows

a. FIFO rule
b. LIFO rule
c. LILO rule
d. priority rule.
33. The blocking factor of a file is
a. The number of blocks accessible to a file
b. The number of blocks allocated to a file
c. The number of logical records in one physical record
d. None of the above
34. A critical section is a program segment
a. which should run in a certain specified amount of time
b. which avoids
deadlocks
c. where shared resources are accessed
d. which must be enclosed by a pair of semaphore operations, P and V.
35. The following is not a layer of IO management module
a. PIOCS (Physical Input Output Control System)
b. LIOCS (Logical Input Output Control System)
c. FS (File System)
d. MCS (Management Control System)
36. The memory allocation scheme subject to external fragmentation is
a. Segmentation
b. swapping
c. pure demand paging d. multiple fixed contiguous partitions
37. Page fault frequency in an operating system is reduced when the
a. processes tend to the I/O-bound
b. size of pages is reduced
c. processes tend to be CPU-bound
d. locality of reference is applicable to the process
38. In which of the following page replacement policies Baladys anomaly
occurs
a. FIFO
b. LRU
c. LFU
d. NRU
39. In the Dynamic Partitioning technique of memory management, the
placement
algorithm that chooses the block that is closest in size to the request is called:
a. Best-fit
b. First-fit
c. Next-fit
d. All of the above

40. The page table for each process maintains:

a. The frame location for each page of the process
b. The page location for each frame of the process
c. The physical memory location of the process
d. None of the above
Which of the following refers to the associative memory?
A.
B.
C.
D.

the address of the data is generated by the CPU

the address of the data is supplied by the users
there is no need for an address i.e. the data is used as an address
the data are accessed sequentially

To avoid the race condition, the number of processes that may be

simultaneously inside their critical section is
A. 8
B. 1
C. 16
D. 0
A system program that combines the separately compiled modules of a
program into a form suitable for execution
A. assembler
B. linking loader
C. cross compiler
D. load and go
Process is
A. program in High level language kept on disk
B. contents of main memory
C. a program in execution
D. a job in secondary memory
In UNIX the status of the process may be ?
A. running
B. Orphan
C. Zombie
D. All the above
The PID of kernel process is?
A. Undefined
B. 0
C. 1
D. 3
The commands used to compare the files is known as?
A. comp
B. du
C. cmp
D. ccp

Which commands is used with the vi editor to save file and remain in the
editing mode?
A. :q
B. q!
C. :w
D. :x
Which command is used to extract specific columns from the file?
A. cat
B. grep
C. cut
D. past
A set of techniques that allow to execute a program which is not entirely in
memory is called
A. Demand paging
B. Virtual Memory
C. Auxiliary Memory
D. Secondary Memory

1a
2c
3b
4c
5c
6b
7a
8d
9b
10 c
11 c
12 d
13 a
14 b
15 d
16 c
17 b
18 b
19 b
20 b
21 a
22 a
23 c
24 c
25 b
26 c
27 a
28 b
29 a
30 a
31 c
32 b
33 c
34 c
35 d
36 a
37 d
38 a
39 a
40 a
41 C
42 b
43 B
44 C
45 D

46 B
47 C
48 C
49 C
50 b