REASONING TEST QUESTIONS N ANSWERS

BRIGHTWAYS SOFTWARE SOLUTION
REASONING TEST D
1. For effective swapping binding of instructions and data should be done at
a. load time b. compile time c. execution time
2. Which memory management scheme does not support multi-programming
a. Single Partition allocation b. Multiple partition allocation
c. Paging d. Segmentation
3. The address space of one process is protected from other processes using ………… and ………… registers in multiple partition schemes

4. Which memory management technique causes no external fragmentation
a. Multiple partition with fixed partitions b. Paging c. Segmentation

5. ……………. is used to solve the problem of external causes in multiple partition scheme

6. ……………. is the memory management scheme which allows the memory occupied by a process to be non-contiguous

7. ……………. Is not eliminated by Paging

8. Which scheduling algorithm is inherently preemptive
a. FCFS b. SJF c. RR d. Priority Scheduling
9. Total time taken by a process to complete execution is
a. waiting time b. turn-around time c. response time d. throughput
10. The time spent by a process in the ready queue is
a. waiting time b. turn-around time c. response time d. throughput
11. Swapping is done by
a. long term scheduler b. medium term scheduler c.short term scheduler
12. The optimal scheduling algorithm is
a. FCFS b. SJF c. RR d. Multi-level queue scheduling
13. The performance of RR algorithm depends heavily on
a. size of the process b. The I/O bursts of the process
c. The CPU bursts of the process d. The size of the time quantum
14. The technique of gradually increasing the priority of a process that wait in a system for a long time is known as
a. Blocking b. Starvation c. Aging d. Convoy effect
15. When all other processes wait for one big process to get off the CPU the phenomenon is called
a. Starvation b. blocking c. convoy effect d. aging
16. The memory management scheme which allows the execution of a process which is partially loaded into physical memory is
a. Virtual memory b. Segmentation c. Paging
17. The page replacement algorithm which replaces the page which will not be used for a longest period of time is
a. LRU b. FIFO c. Optional page replacement d. Second change algorithm





18. The page replacement algorithm which gives the lowest page fault rate is
a. LRU b. FIFO c. Optional page replacement d. Second change algorithm

19. The ………. Bit attached to each entry in the page table is used to determine that the associated page is in memory

20. A ………….. is generated when a process tries to access a page which is not in memory

21. When a process is rolled back as a result od deadlock the difficulty which arises is
a. Starvation b. system throughput c. Low device utilization
22. Necessary conditions for a system to be in deadlock are
a. mutual exclusion b. Hold and wait c. No pre-emption
d. Circular wait e. All of the above
23. If the resource allocation graph for a system ( with multiple instances for resource types) has a cycle
a. The system is not deadlocked b. The system may be deadlocked
c. the system is not deadlocked
24. If the resource allocation graph for a system ( with single instances for each resource types) has a cycle then
a. system is deadlocked b. system may be deadlocked
c. the system is not deadlocked
25. Two disadvantages of deadlock prevention schemes are
a. low device utilization b. reduce system through put c. starvation












ANSWERS OF REASONING TEST D
1. C 2. A 3. Base and limit
4. b 5. Compaction 6. Paging
7. Internal Fragmentation 8. C 9. B
10. A 11. B 12. B
13. D 14. C 15. C
16. A 17. C 18. C
19. Valid- invalid 20. Page-fault 21. A
22. E 23. B 24. A
25. A and B 26. 27.