CS CS Operating Systems & Memory Management

Question 1

What is a deadlock in operating systems?

Accepted Answer

A situation where two or more processes wait indefinitely for resources held by each other

Answer

A process that consumes 100% CPU without terminating

Answer

A memory allocation error causing a page fault

Answer

A kernel panic caused by a device driver

Question 2

Which page replacement algorithm replaces the page that will not be used for the longest time in the future?

Accepted Answer

OPT (Optimal)

Answer

FIFO (First-In, First-Out)

Answer

LRU (Least Recently Used)

Answer

Clock Algorithm

Question 3

What is the difference between a process and a thread?

Accepted Answer

A process is an independent execution unit with its own memory space, while threads share memory within a process

Answer

A thread has its own memory space while a process shares memory with others

Answer

Threads cannot run in parallel on multi-core CPUs

Answer

Processes are lighter weight than threads

Question 4

What does a context switch entail in an operating system?

Accepted Answer

Saving the state of a running process and restoring the state of another so the CPU can switch tasks

Answer

Switching the CPU from user mode to kernel mode

Answer

Allocating a new memory page for a process

Answer

Flushing the disk write cache to storage

Question 5

In virtual memory, what is a 'page fault'?

Accepted Answer

An interrupt triggered when a process accesses a page not currently loaded in physical memory

Answer

A hardware error in the physical RAM chips

Answer

A bug in a process that causes an illegal memory write

Answer

An overflow of the page table beyond available address space

Question 6

Which CPU scheduling algorithm provides the best average waiting time for a given set of processes?

Accepted Answer

Shortest Job First (SJF)

Answer

Round Robin

Answer

First-Come First-Served (FCFS)

Answer

Priority Scheduling