Pintos
Mastering Operating Systems and Process Management
Test your knowledge on operating systems concepts, focusing on process management, resource allocation, and memory management. This quiz covers a range of questions that will challenge your understanding of essential OS principles.
Key Features:
- 19 engaging questions
- Multiple-choice format
- Score and review completed quiz
Which of the following statements are true about Banker's algorithm?
A safe state implies that a deadlock can never occur in any future state.
Banker's algorithm checks the Coffman conditions to find deadlocks.
Banker's algorithm guarantees freedom from starvation.
Banker's algorithm requires a priori knowledge of the resource demands of every involved process.
Which of the following statements are true?
Different thread belonging to the same process share memory with each other
Contiguous allocation for secondary storage works well for read-only media
Each thread must have its own stack
Journalling file systems allows interrupted disk operations to be rolled-back, thereby avoiding inconsistencies on disk even in case of sudden power failure
Different threads belonging to the same process share memory with each other
Threads can only be implemented by the operating system
Which of the following are classical scheduling algorithms?
Shortest-job first scheduling
Burst-first scheduling
Priority scheduling
Timer scheduling
Which of the following operations will result in a system call for a normal operating system?
Reading the value of a variable stored on the stack
Creating a new file
Allocating memory on the heap
Performing a jump (JMP) instruction
Which of the following concepts relate to multiprocessor scheduling?
Segmentation
Task migration
Hard vs soft affinity
Co-scheduling
Which of these parameters will affect the effective access time (EAT) of demand paging?
Page fault rate (probability of page fault)
Segment table length
Time to swap page in from disk
Disk size
Which of the following statements are true about deadlocks?
If there is only a single instance of every resource, a cycle in the resource allocation graph means that there is a deadlock.
All four Coffman conditions must be met for there to be a deadlock.
Banker's algorithm is used to detect and remove deadlocks.
Banker's algorithm guarantees freedom from starvation.
Which of the following statements (relating to memory management) are true?
TLB is short for Transitive Local Buffer.
A page fault is a critical failure that the OS cannot recover from.
Paging and segmentation can be combined.
Belady's page replacement algorithm requires knowing the future memory access pattern.
Which of the following properties are true for semaphores?
The wait and signal operations are atomic.
They guarantee freedom from deadlock.
They can be used to solve the critical section problem.
They can only be implemented on a system with special hardware.
Which of the following are algorithms that can be used for process scheduling?
Shortest-job-first
Round Robin
Priority inversion
First-come, first-served
Burst-first
Priority
Which of the following information would typically be stored in the Process Control Block (PCB) for a process?
The process state
The process file
The program counter
The process ID
Which of the following memory management tasks can be performed by the MMU?
Memory protection
Page table lookup
Page replacement
TLB lookup
Which of the following events will take place when switching from one process (old) to another (new)?
Changing the set of currently open files to match with the new process.
Copying data from the process control block (PCB) of the new process into the interrupt vector table.
Storing CPU register states into the PCB of the old process.
Updating registers relating to memory management (e.g., bade adress pointer).
Which of the following events will always trigger an interrupt (hardware or software)?
A user program requesting to read data from a file.
A user program requesting to read data from main memory.
A key being pressed on the keyboard.
A byte being transferred from disk to main memory.
Which of the following mechanics will prevent deadlocks?
Only use safe resources
Always acquire resources according to a globally defined order
Ensure that ∀j : Rj ≥ i D(i, j), where Rj is the number of instances of resource j and D(i, j) is the maximum demand of resource type j from process I
Only request a resource when it is really needed
Which of the terms below refer to methods used for allocation of disk space for a file?
Virutal allocation
Indexed allocation
Segment allocation
Contiguous allocation
{"name":"Pintos", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge on operating systems concepts, focusing on process management, resource allocation, and memory management. This quiz covers a range of questions that will challenge your understanding of essential OS principles.Key Features:19 engaging questionsMultiple-choice formatScore and review completed quiz","img":"https:/images/course8.png"}