SWARNANDHRA

COLLEGE OF ENGINEERING AND TECHNOLOGY

AUTONOMOUS
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING
B. Tech VII Semester Cycle-II Objective Question Bank
OPERATING SYSTEMS
UNIT-III
1. If a process is executing in its critical section, then no other processes are allowed to
execute in the critical sections is called as
(A) Mutual exclusion (B) progress (C) kernel (D) bounded waiting

2. Which is an integer variable, a part from initialization, is accessed only through two
standard atomic operations: wait & signal is called as
(A) Critical Section (B) Semaphore (C) Monitor (D) None

3. Which is a semaphore with an integer value that can range only between 0 & 1, is called as
(A) Critical Section (B) Monitor (C) Binary Semaphore (D) None

4. Which is a programming language construct that provides equivalent functionality to that

of semaphores but is easier to control is
(A) Mail box (B) process (C) monitors (D) none

5. A critical section is a program segment

(A) Which should run in a certain specified time (B) Which avoids Executing
(C) where shared resources are accessed (D) none

6. Semaphore are used to solve the problem of

(A) Race condition (B) process synchronization
(C) Mutual exclusion (D) Both B, C

7. Mutual exclusion problem occurs

(A) Between two disjoint processes that do not interact

(B) Among processes that share resources
(C) Among processes that do not use the same resource
(D) None of the above

8. Critical region is

(A) A part of the operating system which is not allowed to be accessed by any process
(B) A set of instructions that access common shared resource which exclude one another in
time
(C) The set of primitive functions upon which the rest of operating system functions are built
up
(D) None of the above
9. A solution to the Dining Philosophers Problem which avoids deadlock is

(A) Ensure that all philosophers pick up the left fork before the right fork
(B) Ensure that all philosophers pick up the right fork before the left fork
(C) Ensure that one particular philosopher picks up the left fork before the right fork, and that
all other philosophers pick up the right fork before the left fork
(D) None of the above

10. Consider the methods used by processes P1 and P2 for accessing their critical sections
whenever needed, as given below. The initial values of shared boolean variables S1 and S2
are randomly assigned.

Method Used by P1 Method Used by P2

while (S1 == S2) ; while (S1 != S2) ;
Critica1 Section Critica1 Section
S1 = S2; S2 = not (S1);

Which one of the following statements describes the properties achieved?

(A) Mutual exclusion but not progress (B) Progress but not mutual exclusion
(C) Neither mutual exclusion nor progress (D) Both mutual exclusion and progress

11. Process synchronization can be done on

(A) hardware level (B) software level (C) both (a) and (b) (D) none of the mentioned

12. A monitor is a module that encapsulates

(A) shared data structures (B) procedures that operate on shared data structure
(C) synchronization between concurrent procedure invocation (D) all of the mentioned

13. Mutual exclusion can be provided by the

(A) Mutex locks (B) binary semaphores
(C) both (a) and (b) (D) none of the mentioned

14. To enable a process to wait within the monitor,

(A) a condition variable must be declared as condition
(B) condition variables must be used as boolean objects
(C) semaphore must be used
(D) all of the mentioned

15. Which process can be affected by other processes executing in the system?
(A) cooperating process (B) child process (C) parent process (D) init process

16. 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
(A) dynamic condition (B) race condition
(C) essential condition (D) critical condition

17. Bounded waiting implies that there exists a bound on the number of times a process is
allowed to enter its critical section :
(A) after a process has made a request to enter its critical section and before the request is
granted
(B) when another process is in its critical section
(C) before a process has made a request to enter its critical section
(D) None of these

18. A minimum of _____ variable(s) is/are required to be shared between processes to solve
the critical section problem.
(A) one (B) two (C) three (D) four

19. A situation where several processes access and manipulate the same data concurrently
and the outcome of the execution depends on the particular order in which access takes place
is called :
(A) data consistency (B) race condition (C) aging (D) starvation

20. The segment of code in which the process may change common variables, update tables,
write into files is known as:
(A) program (B) critical section (C) non – critical section (D) synchronizing

21. 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

22. Spinlocks are :

(A) CPU cycles wasting locks over critical sections of programs

(B) locks that avoid time wastage in context switches

(C) locks that work better on multiprocessor systems

(D) All of these

23. An un-interruptible unit is known as :

(A) single (B) atomic (C)static (D) None of these

24. The Test And Set instruction is executed :

(A) After a particular process (B) periodically

(C) atomically (D) None of these

25. The main disadvantage of spinlocks is that :

(A) they are not sufficient for many process (B)they require busy waiting
(C) they are unreliable sometimes (D) they are too complex for programmers

26. The wait operation of the semaphore basically works on the basic _______ system call.

(A) stop() (B) hold() (C) block () (D) wait ()

27. If the semaphore value is negative :

(A) its magnitude is the number of processes waiting on that semaphore

(B) it is invalid

(C) no operation can be further performed on it until the signal operation is performed on it

(D) None of these

28. The code that changes the value of the semaphore is :

(A) remainder section code (B) non – critical section code

(C) critical section code (D) None of these

29. What will happen if a non-recursive mutex is locked more than once ?

(A) Starvation (B) Signaling (C) Aging (D) Deadlock

30. A mutex :

(A) Must be accessed from only one process (B) is a binary mutex

(C) Can be accessed from multiple processes (D) None of these

31. Semaphores are mostly used to implement:

(A) System calls (B) System protection (C) IPC mechanisms (D) None of these

32. Spinlocks are intended to provide __________ only.

(A) Mutual Exclusion (B) Bounded Waiting (C) Aging (D)Progress

33. .............. Refers to a situation in which a process is ready to execute but is continuously
denied access to a processor in deference to other processes.

(A) Synchronization (B) Mutual Exclusion

(C) Dead lock (D) Starvation

34. A procedure defined within a ________ can access only those variables declared locally
within the _______ and its formal parameters.
(A) process, semaphore (B) process, monitor
(C) semaphore, semaphore (D) monitor, monitor

35. If no process is suspended, the signal operation:

(A) puts the system into a deadlock state (B) suspends some default process’ execution
(C) nothing happens (D) the output is unpredictable

36. The two atomic operations permissible on semaphores are : (choose two)
(A) wait, signal (B) stop (C) hold (D) None

37. A P operation on a semaphore is also called a(n) _____ operation.

(A) Down (B) left (C) right (D)up

38. A V operation on a semaphore is also called a(n) _____ operation.

(A)up (B) down (C) index (D)left

39. Who proposed the synchronization structure called a monitor?

(A) Niklaus Wirth and David Gries (B) Brian Kernighan and P. J. Plauger

(C) Tony Hoare and Per Brinch Hansen (D) None

40. Peterson’s solution is a classic solution to the critical section problem

(A) Software-based (B) Hardware-based (C) Both (D) None

UNIT-IV

1. Page fault occurs when

(A) The page is corrupted by application software (B) The page is in main memory
(C) The page is not in memory (D) One tries to divide a number

2. Which of the following page replacement algorithm suffers from belady’s anomaly ?
A) Optimal replacement (B) L.R.U (C) F.I.F.O (D)F.I.F.0
&L.R.U

3. The first fit, best fit and worst fit algorithm can be used for
(A) Contiguous allocation of memory (B) Linked allocation of memory
(C) Indexed allocation of memory (D) Hash allocation

4. An address generated by CPU is known as________address

(A) Logical (B) Zero (C) Physical (D)True

5. Virtual memory is
(A) An extremely large main memory (B)An extremely large secondary memory
(C) An illusion of an extremely large memory (D)A type of memory used in super
computer

6. The run time mapping from virtual to physical address is done by____
(A) Compiler (B) o.s (C) cpu (D) memory management
unit

7.______algorithm fits process unit into the hole that is large enough to hold the process
and closes in size to the requirements of that process
(A) first fit (B) best fit (C) worst fit (D)zero fit

8._____algorithem fits the process into the largest available hole

(A) first fit (B) best fit (C) worst fit (D)zero fit
9. Virtual memory is commonly implemented by____
(A) demand paging (B) loading (C) linking (D)routing

10. _____ is a technique to solve the problems of internal fragmentation

(A) swapping (B) segmentation (C) loading (D)paging

11. Replace the page that has that has not been used for the longest period of time. This
is_______
(A) F I F O (B) L R U (C) optimal algorithm (D)L F U

12. Which algorithm searches the list of holes and allocate the first memory area that is large
enough
(A) first fit (B) best fit (C) worst fit (D)zero fit

13. To implement LRU which data structure is used

(A) queue (B) tree (C) stack (D)list

14. Which is a technique to solve the problems of internal fragmentation

(A) swapping (B) segmentation (C) loading (D)paging

15. The page replacement policy that sometimes leads to more page faults when the size of
the memory is increased is
(A) FIFO (B) LRU (C) SJF (D)None

16. In page memory system if the page is increased then the internal fragmentation generally
(A) Becomes less (B) Becomes more (C) constant (D) None

17. Memory management unit is

(A) Software B) Hardware (C) Firmware (D) Can’t Say

18. When total memory is available to satisfy the requirement of the process is not contiguous
it is called _________ fragmentation?
(A) External (B) Internal (C) Max (D) Min

19. When the space with in the block is unused by the process residing in that block it is
called _____ fragmentation
(A) External (B) Internal (C) Maximum (D) Minimum

20. Which is a technique to solve the problems of external fragmentation

(A) Swapping (B) Segmentation (C) Loading (D) Paging

21. Shuffle memory contents to place all free memory together in one large block to some
external fragmentation is
(A) Compaction (B) Controlling (C) Paging (D) None

22. Dividing physical memory into fixed sized blocks is called as

(A) Frames (B) Pages (C) Blocks (D)None

23. Dividing logical memory into blocks of same size is called

(A) Frames (B) Pages (C) Blocks (D)None
24. T L B stands for
(A) Translation Lock Buffer (B) Translation Look-ahead Buffer
(C) Translation Look-aside Buffer (D)None

25.Each inverted page –table entry is a pair of

(A) <process, page number> (B) <process, paging>
(C) <process, page offset> (D)<process-id, page number>

26.The segment base contains which address in physical memory

(A) Starting Address (B) Ending Address (C) Middle Address (D)Length

27. The segment limit specifies the

(A) Starting Address (B) Ending Address (C) Middle Address
(D)Segment Length

28. Replace the page that will not be used for the longest period of time
(A) FIFO (B) optimal (C) LRU (D)None

29. The page replacement algorithm that replaces the oldest page is
(A) FIFO (B) optimal (C) LRU (D)None

30. The valid-invalid bit in the page table entry is used for
(A) page is in main memory (B) page is not in main memory
(C) Both a&b (D)None

31. Which is used as an index into page table in paging hardware

(A) page offset (B) page block (C) page field (D)page number

32. Overlay is
(A) A part of an operating system (B) A specific memory location (C) A single
contiguous memory that was used in the olden days for running large programs by swapping
(D) overloading the system with many user files

33. Fragmentation is
(A) Dividing the secondary memory into equal sized fragments (B) Dividing the main
memory into equal-sized fragments (C) fragments of memory words used in a page (D)
fragments of memory words unused in a page

34. Memory protection is of no use in a

(A) Single user system (B) non-multiprogramming system (C) non-
multitasking system (D) None of the above

35. The size of the virtual memory depends on the size of the
(A) Data bus (B) Main memory (C) Address bus (D) none of the above

36. In partitioned memory allocation scheme, the

(A) Best fit algorithm is always better than the first fit algorithm
(B) First fit algorithm is always better than the Best fit algorithm
(C) Superiority of the first fit and best fit algorithms depend on the sequence of memory
requests
(D) None of the above

37. The essential contents in each entry of a page table is/are

(A) Virtual page number (B) page frame number (C) Both virtual page number and
page frame number (D) Acess right information

38. Thrasing
(A) Reduces page I/O (B) Decreases the degree of multiprogramming
(C) Implies excessive page I/O (D) Improves the system performance

39. Which of the following is true?

(A) Overlays are used to increase the physical memory
(B) Overlays are used to increase the logical address space
(C) When overlays are used; the size of a process is not limited to the size of physical
memory
(D) Overlays are used whenever the physical address space is smaller than the logical address
space

40. Dirty bit for a page in a page table

(A) Helps avoid unnecessary writes on a paging device
(B) Helps maintain LRU information
(C) Allows only read on a page
(D) None of the above

UNIT - 3 KEY

A B C C C
D B 8. B 9. C 10. A
11. C 12. D 13. C 14. A 15. A
16. B 17. A 18. B 19. B 20. B
21. B 22. D 23. B 24. C 25. B
26. C 27.A 28. C 29. D 30. A
31. C 32. B 33. D 34. D 35. C
36. A 37. A 38. A 39. C 40. A

UNIT – 4 KEY

C C A A C
D 7. B 8. C 9. A 10. B
11. B 12. A 13. C 14. B 15.A
16. B 17. B 18. A 19. B 20.D
21. A 22. A 23. B 24. C 25. D
26. A 27. D 28. B 29. A 30. C
31. D 32. C 33. D 34. D 35. C
36. C 37. B 38. C 39. C 40. A