WB JECA MCA Operating System Previous Year Questions (PYQs) – Page 3 of 4

15. If only one process can be able to access a particular resource at a time, then it is known as ______________.

(A) Mutual execution   (B) Mutual exclusion   (C) Multiple execution   (D) Multiple exclusion

16. Resource allocation graph is used to represent ______________.

(A) deadlock   (B) virtual memory   (C) main memory   (D) scheduling

17. Banker’s algorithm for resource allocation deals with ______________.

(A) mutual exclusion   (B) mutual inclusion   (C) deadlock recovery   (D) deadlock avoidance

18. Page fault means ______________.

(A) required page is available in main memory   (B) required page is not available in main memory   (C) segment number   (D) reduce page I/O

19. ___________ is a technique to move a process from main memory to secondary memory.

(A) Deadlock   (B) Synchronization   (C) Caching   (D) Swapping

20. Demand paging is considered as ______________.

(A) fetching a page when not needed   (B) switching between two processes   (C) fetching a page only when needed   (D) switching between two threads

21. Thrashing means a condition having ______________.

(A) minimum paging   (B) optimized paging   (C) synchronized paging   (D) excessive paging

22. A counting semaphore is initialized to 15. Then, 4 wait operations and 2 signal operations are completed on this semaphore. The resulting value of the semaphore is ____________.

(A) 11   (B) 13   (C) 17   (D) 19

23. What do you mean by fork()? Choose the correct option.

(A) Starvation   (B) Creation of new task   (C) Demand paging   (D) Semaphore

24. In file management, FAT means ______________.

(A) Feature Access Table   (B) File Access Table   (C) Fault Allocation Table   (D) File Allocation Table