0% found this document useful (0 votes)
5 views2 pages

Operating System MCQ and Answers Guide

Uploaded by

gitansh874
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
5 views2 pages

Operating System MCQ and Answers Guide

Uploaded by

gitansh874
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

OPERATING SYSTEM – ANSWER SHEET

SECTION A – MCQ Answers

1) c 2) a 3) d 4) c 5) b 6) a

SECTION B – One line answers

7) OS is system software that manages hardware and software resources.

8) A system call is a request from a program to the OS for a service.

9) Laser printer.

10) Thrashing is excessive paging due to lack of memory.

11) mkdir directory_name

12) Logical address space is the range of addresses generated by the CPU.

SECTION C – 4 Mark Answers

13) Process states: New, Ready, Running, Waiting, Terminated. (Explanation)

14) PCB stores: PID, state, PC, registers, memory info, scheduling info.

15) FCFS: Jobs served in order of arrival. (Example description)

16) Deadlock conditions: Mutual exclusion, hold & wait, no preemption, circular wait.

17) Internal fragmentation: unused space inside allocated block. External: free space broken into small
pieces.

18) Paging: divides memory into fixed-size pages; avoids external fragmentation.

19) Swapping: moving processes between RAM and disk.

20) File attributes: name, type, size, location, protection, timestamps.

21) Sequential access: data accessed in order. Direct access: random access using address.

22) Input redirection (<) takes input from file. Output redirection (>) sends output to file.

SECTION D – 8 Mark Answers

23) Virtual memory: allows execution of large programs by using disk as extension of RAM.
Working: paging, page table, page fault handling, demand paging.

24) Segmentation: divides program into logical segments.

Working: segment table, base & limit, address translation (segment no + offset).

25) Deadlock handling:

Prevention: remove one of four conditions.

Avoidance: Banker's algorithm.

Detection: detect cycles in resource allocation graph.

Recovery: terminate process or preempt resources.

You might also like