CoS 3rd year Operating System final exam time allowed 1:45 hr
Name _________________________IDno_______________
I. Choose the correct answer for the following question
1. What is a reusable resource?
a. that can be used by one process at a time and is not depleted by that use
b. that can be used by more than one process at a time
c. that can be shared between various threads
d. none of the mentioned
2. Which of the following condition is required for a deadlock to be possible?
a. mutual exclusion
b. a process may hold allocated resources while awaiting assignment of other resources
c. no resource can be forcibly removed from a process holding it
d. all of the mentioned
3. Which one of the following is the deadlock avoidance algorithm?
a. banker’s algorithm c. elevator algorithm
b. round-robin algorithm d. karn’s algorithm
4. Which one of the following is a visual (mathematical) way to determine the deadlock occurrence?
a. resource allocation graph c. inversion graph
b. starvation graph d. none of the mentioned
5. The circular wait condition can be prevented by ____________
a. using thread c. defining a linear ordering of resource
b. using pipes types
d. All of the mentioned
6. Which of following is not a condition of Deadlock?
a. Mutual Exclusion c. Hold and Wait
b. No Preemption d. Race Condition
7. Which of the following is not a method in deadlock handling
a. Deadlock prevention c. Deadlock recovery
b. Deadlock detection d. Deadlock distribution
8. Program always deals with ___________
a. logical address c. physical address
b. absolute address d. relative address
9. The page table contains ____________
a. base address of each page in physical c. page size
memory d. None of the mentioned
b. page offset
10. The address loaded into the memory address register of the memory is referred to as ____________
a. physical address c. neither physical nor logical
b. logical address d. Both A and B
11. External fragmentation exists when?
a. The total memory is insufficient to satisfy a request
b. Enough total memory exists to satisfy a request but it is not contiguous
c. A request cannot be satisfied even when the total memory is free
d. None of the mentioned
12. Physical memory is broken into fixed-sized blocks called ________
a. frames c. sectors
b. pages d. files
13. Which one of the following is the address generated by CPU?
a. physical address c. logical address
b. absolute address d. none of the mentioned
14. In contiguous memory allocation ____________
a. each process is contained in a single contiguous section of memory
b. all processes are contained in a single contiguous section of memory
c. the memory space is contiguous
d. none of the mentioned
15. Binding of instructions and data to memory addresses can be done at ____________
a. Compile time c. Execution time
b. Load time d. All of the mentioned
16. Methods for Handling Deadlocks
a. Allow the system to enter a deadlock state and then recover
b. Ignore the problem and pretend that deadlocks never occur in the system
c. Ensure that the system will never enter a deadlock state
d. All of the above
17. During Starvation
a. a process can’t proceed c. it is possible to get the resource
b. the request of the process is never d. all of the above
satisfied
18. ___________Resource is one that can be taken away from the process owning it with no ill effects
a. pre-imputable c. consumable
b. non pre imputable d. all of the above
19. One of the following is example of reusable resources
a. CPU c. I/O devices
b. main memory d. data structures
e. all of the above
20. One of the following is Issues in sharing memory
a. Transparency c. Relocation
b. Efficiency d. All of the above
21. Which of the following is contiguous memory allocation
a. Direct placement c. Partitioning
b. Overlays d. All of the above
22. Which one is true about Static Partitioning?
a. Main memory is divided into fixed number of partitions during system start-up
b. Programs are queued to run in the smallest available partition.
c. This technique uses
d. Absolute loading
e. All of the above
23. Hardware device that maps virtual to physical address
a. I/O device CPU c. RAM
b. Memory management unit d. NONE
24. _______refers to the unused memory that the management system cannot allocate
a. Fragmentation c. Partition
b. Compaction d. none of the above
25. _____is small but fast memory close to processor
a. Cache c. Hard dosl
b. RAM d. All of the above
26. _____ is the concept in which a process is copied into the main memory from the secondary
memory according to the requirement.
a. Paging c. Segmentation
b. Demand paging d. Swapping
27. Swap space exists in ____________
a. primary memory c. cpu
b. secondary memory d. none of the mentioned
28. Memory that uses secondary storage so that it seems like an entire program is running from RAM
a. Cache Memory c. Flash Memory
b. Virtual Memory d. Registers
29. Virtual memory is used
a. when the RAM is not enough to contain all of the programs and data currently being used
b. every other time a program is used
c. as a secondary storage medium for long term storage of documents
d. when the CPU is getting overheated
30. What is the primary purpose of virtual memory in a computer system?
a. To extend CPU processing power c. To improve hard disk speed
b. To provide an illusion of larger physical d. To reduce memory latency
memory
31. Page fault occurs when
a. When a requested page is in memory c. When a page is corrupted
b. When a requested page is not in d. When an exception is thrown
memory
32. Where is Virtual Memory Located?
a. RAM c. Compact Disk
b. Flash Drive d. Hard Disk
33. A software component of Virtual memory is known as __________
a. Memory management unit c. Memory manager
b. Virtual memory manager d. All of the above.
34. A memory that is larger than the real memory of the computer system is ______
a. RAM c. Disk
b. ROM d. Virtual Memory
35. Allocate physical memory is not a function of virtual memory manager
a. True b. False
36. While executing a program, if the program references a page which is not available in the main
memory then it is known as?
a. Demand Paging c. page fault
b. Frame Fault d. processor fault
37. If a process is executing in its critical section, then no other processes can be executing in their
critical section. This condition is called
a. mutual exclusion c. synchronous exclusion
b. critical exclusion d. asynchronous exclusion
38. A software program that serves as an interface between the user of a computer and computer
hardware is called
a. Application software c. Compiler
b. Utility system d. Operating system
39. The primary functions of an operating system to the convenience of the user are
a. To control the planning, monitoring, c. (d) To control and coordinate computer
and the performance of CPU. memory.
b. To manage all data files in a computer d. All of the above
system.
40. Which of the following allows running two or more tasks or programs simultaneously?
a. Multithreading
b. Multiprocessing
c. Multitasking
d. Multicomputing
