Internal Question Bank

Operating System
[BCA-402]

Multiple Choice Questions

1. Where the operating system is placed in memory?
(a) Either low or high memory (depending on the location of the interrupt vector)
(b) In the low memory (c) In the high memory (d) None of the mentioned.
2. FCFS scheduling is particularly troublesome for _______
(a) Operating Systems (c) Multiple processors Systems
(b) Time sharing Systems (d) Multiprogramming Systems
3. A deadlock avoidance algorithm dynamically examines the _____ to ensure that a circular wait
condition can never exist.
(a) Operating System (c) Resource
(b) System storage state (d) Resource Allocation State
4. The operating System is responsible for-
(a) Bad-block recovery (c) Booting from disk
(b) Disk Initialization (d) All of the mentioned
5. 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
6. The information about all open files is kept in—
(a) File table (b) Directory table (c) Open-file table (d) System table
7. Which of the following is not an operating System-?
(a) Windows (b) Linux (c) Oracle (d) DOS
8. What is the full name of FAT?
(a) File attribute table (c) File allocation table
(b) Font attribute table (d) Format allocation table
9. What is the mean of booting in the operating system-?
(a) Restarting Computer (b) Install the program (c) To scan (d) To turn off
10. What does page fault occur?
(a) The page is present in memory (c) The deadlock occurs
(b) The page is not present in memory (d) The buffering occurs
11. If a page is not found in translation look aside buffer, then it is known as-
(a) TLB miss (b) Buffer miss (c) TLB hit (d) All of the mentioned
12. Which of the following is the condition that causes deadlock?
(a) Mutual Exclusion (b) Hold and wait (c) No-preemption (d)All of these
13. Where are placed the list of processes that are prepared to be executed and waiting?
(a) Job Queue (b) Ready Queue (c) Execution Queue (d) Process Queue
14. What type of scheduling is round robin scheduling?
(a) Linear-data scheduling (c) Non-linear scheduling
(b) Preemptive scheduling (d) Non-preemptive scheduling
15. Which conditions must be satisfied to solve a critical section problem?
(a) Bounded Waiting (b) Progress (c) Mutual Exclusion (d) All of these
16. What type of memory stores data in a swap space on a hard drive?
(a) Secondary memory (b) Virtual memory (c) Low memory (d) RAM
17. Which method is best among file allocation methods.
 (a) Linked (b) Contiguous (c) Indexed (d) None of these
18. What is the paging in the operating system?
(a) Memory management scheme (c) Network management scheme
(b) Internet management scheme (d) None of these
19. Which of the following is not a type of directory structure?
(a) Acyclic graph directory structure (c) Single level directory structure
(b) Tree directory structure (d) Stack directory structure
20. Which of the following scheduling algorithm is non-preemptive scheduling?
(a) SJF Scheduling (b) Round Robin Scheduling (c) SRTF (d) None of these
21. Which of the following algorithm is used to avoid deadlock?
(a) Dynamic programming algorithm (c) Primality algorithm
(b) Banker’s Algorithm (d) Deadlock Algorithm
22. Which of the following method is used to improve the main memory utilization?
(a) Swapping (b) Operating System (c) Memory Stack (d) None of these
23. Buffer is a –
(a) Permanent area (b) Temporary Area (c) Small Area (d) Large Area
24. SSTF stands for-
(a) Shortest Signal Time First (c) Shortest Seek Time First
(b) System Seek Time First (d) System shortest time First
25. The PCB is identified by a –
(a) Binary number (b) Real number (c) Store block (d) Integer Process ID
26. Which of the following method is used to prevent threads or processes from accessing a single
resource?
(a) PCB (b) Semaphore (c) Job Scheduler (d) Non-contiguous Memory Allocation
27. Which of the following mechanisms is a locking mechanism?
(a) Semaphore (b) PCB (c) Mutex (d) Binary Semaphore
28. A thread is a –
(a) Light weight process (c) Heavy –weight process
(b) Multi-process (d) I/O process
29. In Unix, name the system call which creates the new process.
(a) Fork (b) New (c) Create (d) Creation
30. The information about all files is kept in ____.
(a) Operating System (c) Swap space
(b) Separate directory structure (d)None of the mentioned

Short Answer Questions

1. What is fragmentation problem? Describe the external and internal fragmentation.
2. (a) Under what circumstances does page fault occur?
(b) Describe the action taken by the operating system when page fault occurs.
3. Describe the critical section problem with suitable example.
4. Explain how memory can dynamically be allocated using first fit, best fit and worst fit strategies.
5. What are Process Control Blocks (PCBs)? Why these are used by operating system. Also explain the
structure of PCB.
6. Explain the structure of a disk with the help of a diagram.
 Long Answer Questions
1. What is deadlock? Explain four necessary conditions for deadlock to occur with suitable example.
Describe different methods for prevention and avoidance of deadlock.
2. Consider the following reference string:
1,2,3,4,2,1,6,5,1,2,3,7,6,3,2,1,2,3,6
How many page faults will occur for?
(a) LRU Replacement
(b) FIFO Replacement
(c) Optimal Replacement
Note: Initial all frames are empty. Best to assume 5 frames.
3. (a) Explain the performance criteria for scheduling algorithms.

(b) Consider the following processes-

Process Arrival Time Burst Time(ms)
P1 0 8
P2 1 4
P3 2 9
P4 3 5
Calculate the average waiting time and TAT by SJF preemptive and SJF non-preemptive scheduling.
4. Explain any four-
(a) Process States
(b) Swapping
(c) Threads
(d) Time Sharing System
(e) Virtual Memory
5. Explain the linked allocation method for a file. List the merits and drawbacks of this method. How does
an indexed allocation solve the problems of linked allocation scheme?
6. Describe paging and segmentation techniques of memory management in detail.