QCM : Operating Systems Fundamentals — 10 questions

Questions et réponses du QCM

1. What is the primary purpose of the fork() system call in process management?

To create a new process by copying the current one
To terminate a process
To replace the current process image with a new program
To synchronize processes

To create a new process by copying the current one

Explication

The fork() system call creates a new process by duplicating the calling process. The new process is called the child process, and it has a separate address space. This is fundamental for process creation in UNIX/Linux systems.

2. What function in Unix-like operating systems is used to create a new process by cloning the parent process?

exec()
clone()
fork()
init()

fork()

Explication

The `fork()` system call creates a new process by duplicating the calling process. `exec()` replaces the process image, so it's not used for creating processes, whereas `clone()` is a lower-level system call used in some systems like Linux, and `init()` is the first process started by the kernel.

3. Which page replacement algorithm approximates the Least Recently Used (LRU) strategy by using reference bits?

Optimal page replacement
Clock algorithm
Random replacement
FIFO (First-In, First-Out)

Clock algorithm

Explication

The Clock algorithm uses reference bits to keep track of page usage and approximates the LRU strategy. It cycles through pages, clearing reference bits and replacing pages that are not recently used, providing a good balance between complexity and performance.

4. Which page replacement algorithm approximates Least Recently Used (LRU) by using a reference bit?

FIFO
Clock
Optimal
Random

Clock

Explication

The Clock algorithm uses a reference bit to approximate LRU by giving each page a 'clock hand' movement, simplifying the management of page replacements. FIFO simply replaces the oldest page, and optimal requires future knowledge, which is impractical.

5. In the context of synchronization mechanisms, what condition must be avoided to prevent deadlock?

Preemption
Mutual exclusion
Circular wait
Resource allocation

Circular wait

Explication

Circular wait is a condition where a set of processes are waiting for each other in a circular chain, which leads to deadlock. Avoiding circular wait is essential to prevent deadlocks in concurrent systems.

6. In memory management, the Translation Lookaside Buffer (TLB) is primarily used to:

Cache page table entries for faster address translation
Store physical addresses of all pages in memory
Perform page replacement decisions
Manage process scheduling and states

Cache page table entries for faster address translation

Explication

The TLB is a cache for page table entries, enabling faster translation from virtual to physical addresses by storing recent translations. It does not store all addresses or manage scheduling.

7. What characterizes a deadlock in operating systems?

It occurs only when processes share files.
It is caused when resources are allocated without restrictions.
It involves mutual exclusion, hold-and-wait, no preemption, and circular wait conditions.
It can be resolved automatically by the operating system at any time.

It involves mutual exclusion, hold-and-wait, no preemption, and circular wait conditions.

Explication

A deadlock occurs under the four necessary conditions: mutual exclusion, hold-and-wait, no preemption, and circular wait, which together prevent processes from proceeding.

8. Which hardware feature is primarily responsible for signaling events or needs for attention in an operating system?

Cache
Interrupts
Registers
Privilege modes

Interrupts

Explication

Interrupts are signals from hardware or software that inform the processor of events needing immediate attention, crucial for asynchronous event handling.

9. Who is credited with authorship of the influential book 'Operating System Concepts', which is widely used in teaching operating systems?

Abraham Silberschatz
Andrew S. Tanenbaum
Dennis Ritchie
Ken Thompson

Abraham Silberschatz

Explication

Abraham Silberschatz is the author of 'Operating System Concepts', a seminal textbook widely used in education for teaching the fundamentals of operating systems.

10. In the evolution of modern operating systems, which of the following represents the correct chronological order from earliest to most recent?

Mechanical, vacuum tube, transistor, integrated, distributed/virtualized
Transistor, vacuum tube, mechanical, integrated, distributed/virtualized
Mechanical, transistor, vacuum tube, distributed, integrated
Vacuum tube, mechanical, transistor, distributed, integrated

Mechanical, vacuum tube, transistor, integrated, distributed/virtualized

Explication

The correct historical order of OS evolution is from mechanical systems to vacuum tube, then transistor, integrated circuits, and finally distributed and virtualized systems, reflecting technological advancements over time.

Révisez avec les flashcards

Mémorisez les réponses avec 10 flashcards sur Operating Systems Fundamentals.

Process — creation method?

fork() and exec() system calls

Processes — definition?

Units of execution identified by PID.

Thread — resource sharing?

Share address space within a process

Voir les flashcards →

Approfondir avec la fiche

Consultez la fiche de révision complète sur Operating Systems Fundamentals.

Voir la fiche →

Cours similaires

Introduction aux documents et sécurité en construction

Bases de données

Introduction à l'Informatique et IA

Introduction aux marchés publics et réglementations du bâtiment

Bases de données

Gestion des imprimantes Windows et PDF

Introduction aux bases de données relationnelles

Bases de données

Maîtrise des Boucles en Programmation

Programmation

Crée tes propres QCM

Importe ton cours et l'IA génère des QCM avec corrections en 30 secondes.

Générateur de QCM