OPERATING SYSTEMS MCQ

1. The PCB of a process does not contain ________

a) Contents of the CPU register
b) Program Code
c) Program Counter
d) Process State

2. Which system call returns the process identifier of a terminated child?

a) Wait
b) Fork
c) Exit
d) Close

3. Which data structure is used for the ready queue?

a) Stack
b) Queue
c) Linked list.
d) Tree

4. The list of process waiting at an I/O device are in _________

a) Ready queue
b) Job queue
c) Device queue
d) Waiting queue

5. Consider the 3 processes shown in the table:

Process Arrival time Time units required
P1 0 5
P2 1 7
P3 5 4
The completion order of the 3 processes under the policies FCFS and Round Robin
scheduling with CPU quantum of 2 units is:
a) FCFS: P1, P2, P3 RR: P1, P2, P3
b) FCFS: P1, P2, P3 RR: P1, P3, P2
c) FCFS: P1, P3, P2 RR: P1, P2, P3
d) FCFS: P1, P3, P2 RR: P1, P3, P2

6. How to avoid starvation of processes?

a) Include aging in the priority scheme.
b) Include the number of resources in resource pre-emption.
c) Randomly select processes for resource allocation
d) Randomly select processes for CPU allocation
7. There are 200 tracks on a dick platter and the pending requests have come in the order:
36, 69, 167, 76, 42, 51, 126, 12 and 199. Assume the arm is located at the 100th track
and moving towards track 200. If the sequence of disc access is 126, 167, 199, 12, 36, 42,
51, 69 and 76 then which disc access scheduling policy is used?
a) SCAN
b) Shortest Seek Time First
c) C-SCAN
d) FCFS

8. When the time slice of Round Robin scheduling is large, its behaviour is similar to _____
a) FCFS
b) Shortest job first
c) Priority scheduling
d) Shortest remaining time first

9. If a resource pre-emption is used to eliminate deadlock, the process holding it so far has
to be ______
a) Aborted
b) Queued
c) Rolled back.
d) Terminated

10. A virtual memory system has an address space of 8K words, a memory space of 4K
words, and page and block sizes of 1K words. Find the number of page faults using LRU
policy. For the following page references. 1 0 2 4 6 2 1 5 7 0 0
a) 5
b) 7
c) 9
d) 10

11. Which is true with reference to working set model for page replacement?
a) It refers to static page replacement algorithm.
b) If refers to local page replacement algorithm
c) If dynamically provides frames for the process as per its needs.
d) Its increases thrashing.

12. Which is not an OS service?

a) Program execution
b) Networking
c) Error detection
d) Security
13. The Basic Input Output System (BIOS) resides in
a) RAM
b) ROM
c) The CPU
d) Memory Cache

14. The Banker’s algorithm is used.

a) To rectify deadlock
b) To detect deadlock
c) To prevent deadlock
d) To solve deadlock

15. First-in-First-Out (FIFO) scheduling is

a) Non-Preemptive Scheduling
b) Preemptive Scheduling
c) Fair Share Scheduling
d) Deadline Scheduling

16. The interval from the time of submission of a process to the time of completion is
termed as
a) Waiting time
b) Turnaround time
c) Response time
d) Throughput

17. What is a Process Control Block?

a) Process type variable
b) A data structure to store information of a process.
c) A secondary storage selection
d) A block in memory

18. A computer system has 6 tape drives, with n process competing for them. Each process
may need 3 tape drives, The maximum value of n for which the system guaranteed to
be dead look free is
a) 1
b) 2
c) 3
d) 4

19. The address of a page table in memory is pointed by ____________

a) stack pointer
b) page table base register
c) page register
d) program counter
20. Consider the computer with 8 Mbytes of main memory and a 128 K cache. The cache
block size is 4K. It uses a direct mapping scheme for cache management. How many
different main memory blocks can map into a given physical cache block?
a) 2048
b) 8
c) 64
d) 256

21. A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because.
a) It reduces the memory access time to read or write a memory location.
b) It helps to reduce the size of page table needed to implement the virtual address
space of a process.
c) It is required by the translation lookaside buffer.
d) It helps to reduce the number of page faults in page replacement algorithms.

22. The time taken to move the disk arm to the desired cylinder is called the
a) positioning time
b) random access time
c) seek time
d) rotational latency

23. In the ______ algorithm, the disk arm starts at one end of the disk and moves toward
the other end, servicing requests till the other end of the disk. At the other end, the
direction is reversed and servicing continues.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK

24. An SJF algorithm is simply a priority algorithm where the priority is ____________
a) the predicted next CPU burst
b) the inverse of the predicted next CPU burst
c) the current CPU burst
d) anything the user wants

25. Robin robin scheduling falls under the category of

a) Dead Lock
b) Demand Paging
c) Non-Preemptive Scheduling
d) Preemptive Scheduling
26. Which one of the following is the Dead Lock Avoidance algorithm?
a) Banker’s algorithm
b) Roubin Robin algorithm
c) Elevator algorithm
d) Karn’s algorithm

27. The aim of creating Page Replacement algorithm is to

a) Replaces pages faster.
b) Increases the page fault rate.
c) Decrease the page fault rate.
d) To allocate multiple pages to process

28. What are the two methods of the LRU page replacement policy that can be
implemented in hardware?
a) Counters
b) RAM & Registers
c) Stack & Counters
d) Registers

29. Virtual memory is normally implemented by ________

a) demand paging
b) buses
c) virtualization
d) paging

30. Process is ___________

a) Program is high level language kept on disk.
b) Contents of main memory
c) A program in execution
d) A job in secondary memory

31. With paging there is no ____________ fragmentation.

a) Internal
b) External
c) Demand
d) Segmentation

32. In pages memory system, if the size is increased, then the internal fragmentation
generally _________
a) Becomes less.
b) Becomes more.
c) Remains constant
d) Remains equal
33. Memory management techniques is which system stores & retrieves data from
secondary storage for use in main memory is called _______
a) fragmentation
b) Paging
c) Mapping
d) Relocating

34. If a process needs I/O to or from a disk, and if drive or controller is busy then _____
a) The request will be placed in the queue of pending requests for that drive.
b) The request will not be processed and will be ignored completely.
c) The request will be not placed.
d) The request placed.

35. The process that are residing in main memory and are ready and waiting to execute
are kept on a list called _______
a) Job queue
b) Ready queue
c) Execution queue
d) Process queue

36. To avoid dead lock __________

a) There must be a fixed number of resources to allocate.
b) Resource allocation must be done only once.
c) All dead locked process must be aborted
d) Inversion technique can be used.

37. The function key that needs to be pressed to enter in safe mode while rebooting a
windows system is.
a) F1
b) F2
c) F8
d) F9

38. What is the default web browser of windows operating system?

a) Internet Explorer
b) Safari
c) Opera
d) Chrome

39. Windows system call CreatePipe() falls into __________ category of system calls.
a) Process control
b) Device manipulation
c) Protection
d) Communication
40. The list of processors waiting for a particular I/O device is called a _________
a) Device
b) I/O
c) Job
d) Ready

41. Degree of multiprogramming is controlled by _________ scheduler.

a) Long term
b) Short term
c) Medium term
d) Very short term

42. The time taken by the dispatcher to stop one process and start another running is
known is as the ___________
a) Dispatch latency
b) Waiting time
c) Turnaround time
d) Response time

43. External fragmentation occurs in ____________

a) Paging
b) Segmentation
c) Both paging & segmentation
d) Nether paging nor segmentation

44. The page replacement algorithm which suffers with belady’s anomaly is ________
a) FCFC
b) LRU
c) LFU
d) Optimal

45. _________ scheduling performs better for systems that place a heavy load on the disk
a) FCFS
b) SSTF
c) SCAN
d) C-SCAN

46. To keep track off free disk space, the system maintains a
a) Free-space
b) Disk-allocation
c) File-allocation
d) Empty-space
47. In RR scheduling, a rule of thumb is that ____ % of the CPU bursts should be shorter
than the time quantum.
a) 20
b) 50
c) 80
d) 90

48. The operating system maintains a ______ table that keeps track of how many frames
have been allocated, how many are there, and how many are available.
a) Memory
b) Mapping
c) Page
d) Frame

49. In real time operating system ____________

a) process scheduling can be done only once.
b) all processes have the same priority.
c) kernel is not required.
d) a task must be serviced by its deadline period.

50. In Unix, which system call creates the new process?

a) Create
b) Fork
c) New
d) none of the mentioned

51. who decide the starting address of the segment in physical memory?
a) Segment descriptor
b) Operating system
c) Base address
d) Local descriptor