1. What is the primary function of an operating system?

- A) Manage hardware resources

- B) Execute user applications

- C) Both A and B

- D) None of the above

Answer: C) Both A and B

2. What is the purpose of the kernel in an operating system?

- A) User interface

- B) Memory management

- C) File management

- D) Application execution

Answer: B) Memory management

3. Which scheduling algorithm provides the best turnaround time?

- A) First-Come, First-Served (FCFS)

- B) Shortest Job Next (SJN)

- C) Round Robin (RR)

- D) Priority Scheduling

Answer: B) Shortest Job Next (SJN)

4. What is a deadlock in the context of operating systems?

- A) A program that runs indefinitely

- B) A state where two or more processes are unable to proceed

- C) A memory allocation error

- D) A scheduling algorithm
 Answer: B) A state where two or more processes are unable to proceed

5. What is the purpose of virtual memory?

- A) To increase physical RAM

- B) To allow multitasking

- C) To provide a large, contiguous memory space

- D) All of the above

Answer: D) All of the above

6. Which file system is commonly used in Linux?

- A) NTFS

- B) FAT32

- C) Ext4

- D) HFS+

Answer: C) Ext4

7. What is the role of a device driver in an operating system?

- A) Manage file systems

- B) Control input and output devices

- C) Allocate memory

- D) Schedule processes

Answer: B) Control input and output devices

8. What is a system call?

- A) A call to a function in a user application

 - B) A request made by an application to the operating system kernel

- C) A hardware interrupt

- D) A network communication protocol

Answer: B) A request made by an application to the operating system kernel

9. What is the purpose of the FAT (File Allocation Table) in file systems?

- A) Manage permissions

- B) Track file locations on disk

- C) Control access to files

- D) Encrypt file contents

Answer: B) Track file locations on disk

10. What is the function of the I/O scheduler in an operating system?

- A) Manage input devices

- B) Schedule input and output operations for efficiency

- C) Allocate CPU resources

- D) Manage file permissions

Answer: B) Schedule input and output operations for efficiency

11. BIOS is used?

a. By operating system

b. By compiler

c. By interpreter

d. By application software
Answer: a) By operating system

12. What is the mean of the Booting in the operating system?

a. Restarting computer

b. Install the program

c. To scan

d. To turn off

Answer: a) Restarting computer

13. When does page fault occur?

a. The page is present in memory.

b. The deadlock occurs.

c. The page does not present in memory.

d. The buffering occurs.

Answer: c) The page does not present in memory.

14. Banker's algorithm is used?

a. To prevent deadlock

b. To deadlock recovery

c. To solve the deadlock

d. None of these
Answer: a) To prevent deadlock

15. What is bootstrapping called?

a. Cold boot

b. Cold hot boot

c. Cold hot strap

d. Hot boot

Answer: a) Cold boot

16. Which of the following is a condition that causes deadlock?

a. Mutual exclusion

b. Hold and wait

c. Circular wait

d. No preemption

e. All of these

Answer: e) All of these

17. Who provides the interface to access the services of the operating system?

a. API

b. System call

c. Library

d. Assembly instruction
Answer: b) System call

18. Where are placed the list of processes that are prepared to be executed and waiting?

a. Job queue

b. Ready queue

c. Execution queue

d. Process queue

Answer: b) Ready queue

19. Which conditions must be satisfied to solve a critical section problem?

a. Bounded Waiting

b. Progress

c. Mutual Exclusion

d. All of these.

Answer: d) All of these

20. Which of the following "semaphore" can take the non-negative integer values?

a. Binary Semaphore

b. Counting Semaphore

c. Real Semaphore

d. All of the these

Answer: b) Counting Semaphore

21. Explain the concept of system calls in operating systems.

Answer: System calls provide a way for user-level processes to request services from the
operating system kernel.

22. Describe the different types of operating system structures.

Answer: Operating system structures include simple structure, layered approach,

microkernel, and modules.

23.What are the different process states in an operating system, and explain each state
briefly?

Answer: Process states include new, ready, running, waiting, and terminated. Each state
represents a different stage of the process lifecycle.

24. Compare and contrast the scheduling algorithms: First Come First Served (FCFS) and
Round Robin (RR).

Answer: FCFS schedules processes based on their arrival time, while RR allocates a fixed
time slice to each process in a circular manner.

25.What is the critical section problem in process synchronization, and how can it be
solved using Mutex Locks?

Answer: The critical section problem involves ensuring that only one process executes a
critical section at a time. Mutex locks provide mutual exclusion to ensure only one process
accesses the critical section at a time.
26. Discuss the necessary conditions for deadlock occurrence in an operating system.
Answer:Deadlock occurs when four necessary conditions are met: mutual exclusion, hold
and wait, no preemption, and circular wait.

27. Explain the concept of demand paging in virtual memory management.

Answer: Demand paging is a technique where pages are loaded into memory only when
they are demanded by the executing process, reducing unnecessary page swaps.

28. Describe the difference between contiguous memory allocation and paging in memory
management.

Answer: Contiguous memory allocation allocates a continuous block of memory to a

process, while paging divides memory into fixed-size blocks called pages.

29.What are the primary operations performed on files in a file system, and how do they
differ from each other?

Answer: File operations include creation, deletion, reading, writing, and updating. Each
operation manipulates the content and metadata of files in the file system.

30. Discuss the concept of disk scheduling in storage management and its significance.

Answer: Disk scheduling involves determining the order in which disk I/O requests are
serviced. It's essential for optimizing disk performance by minimizing seek time and
maximizing throughput.

31.Which scheduling algorithm may result in starvation of low priority processes?

a) Round Robin (RR)

b) Shortest Job Next (SJN)

c) Priority Scheduling

d) First Come First Serve (FCFS)

Answer: c) Priority Scheduling

32.What is the main purpose of a shell in an operating system?

a) User interface

b) Hardware management

c) Memory allocation

d) File system management

Answer: a) User interface

33.Which memory management technique allows for dynamic allocation of memory

segments?

a) Paging

b) Swapping

c) Segmentation

d) Fragmentation

Answer: c) Segmentation

34.What does GUI stand for in the context of operating systems?

a) Graphical User Interface

b) Global User Interface

c) General Utility Interface

d) Graphical Utility Integration

Answer: a) Graphical User Interface

35.Which of the following is not a component of a process control block (PCB)?

a) Process ID

b) Program Counter

c) CPU Registers

d) File Allocation Table

Answer: d) File Allocation Table

36.Which of the following is a characteristic of a multi-user operating system?

a) Supports only one user at a time

b) Cannot run multiple applications simultaneously

c) Allows concurrent access by multiple users

d) Runs only on single-core processors

Answer: c) Allows concurrent access by multiple users

37.Which scheduling algorithm aims to minimize the average waiting time?

a) First Come First Serve (FCFS)

b) Shortest Job Next (SJN)

c) Round Robin (RR)

d) Shortest Remaining Time First (SRTF)

Answer: d) Shortest Remaining Time First (SRTF)

38.In virtual memory management, what is the term used for the portion of a process

that is currently in main memory?

A) Page

b) Segment

c) Frame

d) Offset

Answer: c) Frame

39.Which memory management technique allows processes to be divided into fixed-size

blocks?

A) Paging

b) Swapping

c) Segmentation

d) Fragmentation

Answer: a) Paging
40.Which of the following is not a valid process state in process management?

a) Waiting

b) Running

c) Terminated

d) Suspended

Answer: d) Suspended

41.Which of the following scheduling algorithms may result in starvation of low priority

processes?

a) Round Robin (RR)

b) Shortest Job Next (SJN)

c) Priority Scheduling

d) First Come First Serve (FCFS)

Answer: c) Priority Scheduling