Sheet-5 (OS)
Master the Fundamentals of Operating Systems
Test your knowledge of key concepts in operating systems with this comprehensive quiz. Covering essential topics like deadlocks, resource management, and interprocess communication, this quiz is perfect for students and professionals alike.
Participate to:
- Enhance your understanding of operating systems
- Prepare for exams or interviews
- Challenge yourself and track your progress
A set of processes is _______ when each process in the set is blocked awaiting an event that can only be triggered by another blocked process in the set.
Spinlocked
Stagnant
Preempted
Deadlocked
Examples of _______ include processors, I/O channels, main and secondary memory, devices, and data structures such as files, databases, and semaphores.
Regional resources
Joint resources
Reusable resources
Consumable resources
With _______ only one process may use a resource at a time and no process may access a resource unit that has been allocated to another process.
Hold and wait
Mutual exclusion
No preemption
Circular wait
A closed chain of processes exists, such that each process holds at least one resource needed by the next process in the chain is the condition of _______
No preemption
Mutual exclusion
Circular wait
Hold and wait
Once the processes have progressed into the _______, those processes will deadlock.
Fatal region
Regional resources
Spinlock
Hold and wait
The strategy of deadlock _______ is to design a system in such a way that the possibility of deadlock is excluded.
Prevention
Detection
Diversion
Avoidance
The _______ condition can be prevented by requiring that a process request all of its required resources at one time and blocking the process until all requests can be granted simultaneously.
Mutual exclusion
Hold and wait
Circular wait
No preemption
The fastest form of interprocess communication provided in UNIX is _______.
Shared memory
Message
Pipe
Semaphore
The _______ condition can be prevented by defining a linear ordering of resource types.
Hold and wait
No preemption
Mutual exclusion
Circular wait
Requested resources are granted to processes whenever possible with _______.
Preemption
Deadlock detection
Mutual exclusion
Deadlock avoidance
One of the most significant contributions of UNIX to the development of operating systems is the _______.
Semaphore
Shared memory
Message
Pipe
A _______ is a software mechanism that informs a process of the occurrence of asynchronous events.
Signal
Message
Mailbox
Kernel
The most common technique used for protecting a critical section in Linux is the _______.
Signal
Atomic bitmap operation
Atomic integer operation
Spinlock
The _______ allows multiple threads to have simultaneous read-only access to an object protected by the lock.
Barrier
Condition variable
Readers/writer lock
Mutex
The _______ is useful in sending a signal to a thread indicating that a particular event has occurred.
Mutex object
Emaphore object
Event object
Waitable timer object
Deadlock is permanent because none of the events is ever triggered
True
False
All deadlocks involve conflicting needs for resources by two or more processes
True
False
Interrupts, signals, messages, and information in IO buffers are all examples of reusable resources
True
False
A useful tool in characterizing the allocation of resources to processes is the resource allocation graph
True
False
For deadlock to occur, there must not only be a fatal region, but also a sequence of resource requests that has led into the fatal region
True
False
An indirect method of deadlock prevention is to prevent the occurrence of a circular wait
True
False
If access to a resource requires mutual exclusion then mutual exclusion must be supported by the OS
True
False
The OS may preempt the second process and require it to release its resources if a process requests a resource that is currently held by another process
True
False
Deadlock avoidance requires knowledge of future process resource requests
True
False
An unsafe state is one in which there is at least one sequence of resource allocations to process that does not result in a deadlock
True
False
An atomic operation executes without interruption and without interference
True
False
Deadlock avoidance is more restrictive than deadlock prevention
True
False
The dining philosophers problem can be representative of problems dealing with the coordination of shared resources which may occur when an application includes concurrent threads of execution
True
False
A signal is similar to a hardware interrupt but does not employ priorities
True
False
A mutex is used to ensure that only one thread at a time can access the resource protected by the mutex
True
False
{"name":"Sheet-5 (OS)", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge of key concepts in operating systems with this comprehensive quiz. Covering essential topics like deadlocks, resource management, and interprocess communication, this quiz is perfect for students and professionals alike.Participate to:Enhance your understanding of operating systemsPrepare for exams or interviewsChallenge yourself and track your progress","img":"https:/images/course7.png"}
More Quizzes
Sheet-3 (OS)
3015270
Quiz 6
18945
CECS 326 Final Part 3
251210
Operating Systems
7443
Operating System
1050
Operating Systems Quiz CTS Students CLub
16825
CS 332 Practice Exam
361821
Distributed midterm practice
12615
OS Practice Day 1
24120
Operating Systems - Quiz(Unit 1) Batch-II
10517
OS Final Day 2
22110
Operating System
10526