All 40 MCQs was so easy and mostly from Past papers
Question of 2 Markx:-
- 1. Suggest some way to reduce the External Fragmentation?
- 2. Define Lazy Swapping with respect to Virtual Memory?
- 3. Let us consider an example of frame allocation;
Number of frame = 64
Number of processes = 3
Process size: p0 = 10 pages, p1 = 40 pages, p2 = 127 pages
How many free frames will be put in free frame list by using fixed allocation?
- 4. How process become “Zombie” during Execution?
Question of 3 Markx:-
- 1. What are three different Stages / time when the address can be bound to instruction and data?
- 2. Name two registers used for Segmentation concept and what they represent?
- 3. What is the problem hard link creates in tern of referential naming? How does on solve it?
- 4. Concept of I/O Bound and CPU Bound?
Question of 5 Markx:-
- 1. If a process has not enough pages. The page fault rate is very high. This leads to low CPU utilization. The operating system needs to increase the degree of multiprogramming because it monitors the CPU utilization. When another process added, will it increase the throughput of the system
- 2. What is Swap Space? Briefly explain it.
- Other 2 Questions I forget 🙁