
CDS3001-3
Authored by Ganesan 100377
Computers
University

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
1. What is the characteristics of atomicity?
1. What is the characteristics of atomicity?
Use communication links.
One processor as coordinator which handles all requests.
All operations associated are executed to completion or none are performed.
When responses are received from all processes, then process can enter its CS.
2.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
2. Most of the web applications are usign ________ architecture.
2. Most of the web applications are usign ________ architecture.
Master-slave
Two-tier
Three-tier
Peer-to-Peer
3.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
3. The request and release of resources are ___________
3. The request and release of resources are ___________
command line statements
interrupts
system calls
special programs
4.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
4. Which of the following is not a valid deadlock prevention scheme?
4. Which of the following is not a valid deadlock prevention scheme?
Request and all required resources be allocated before execution.
Never request a resource after releasing any resource.
Number the resources uniquely and never request a lower numbered resource than the last one requested.
Release all resources before requesting a new resource.
5.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
5. Which of the following is true with respect to deadlock avoidance?
5. Which of the following is true with respect to deadlock avoidance?
The Bakery algorithm is used to deal with deadlock avoidane.
When a process is created in a deadlock, it must declare its minimum claim.
The avoidance strategy depends on additional information about short-term resource needs.
With the deadlock avoidance approach, the system is always kept in a safe state.
6.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
6. Which one of the following is the deadlock avoidance algorithm?
6. Which one of the following is the deadlock avoidance algorithm?
Round-robin
Banker’s
Elevator
Karn’s
7.
MULTIPLE CHOICE QUESTION
20 sec • 1 pt
7. Which of the following condition is required for a deadlock to be possible?
7. Which of the following condition is required for a deadlock to be possible?
Mutual Exclusion
A process may hold allocated resources while awaiting assignment of other resources.
No resources can be forciby removed from a process holding it.
All of the above
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports

Continue with Google

Continue with Email

Continue with Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?
Similar Resources on Wayground
15 questions
Data Mining - Classification Mining
Quiz
•
University
10 questions
Quiz CodeIgniter 4
Quiz
•
University
15 questions
PROBLEM SOLVING USING R UNIT I MCQS
Quiz
•
University
11 questions
SegInfo Aula4
Quiz
•
University
10 questions
PYTHON_CHAPTER 6
Quiz
•
University
10 questions
CS1010 Lab 02
Quiz
•
University
9 questions
CHAPTER 5 ONLINE QUIZ
Quiz
•
University
15 questions
Digital Etiquette
Quiz
•
4th Grade - University
Popular Resources on Wayground
15 questions
Fractions on a Number Line
Quiz
•
3rd Grade
20 questions
Equivalent Fractions
Quiz
•
3rd Grade
25 questions
Multiplication Facts
Quiz
•
5th Grade
54 questions
Analyzing Line Graphs & Tables
Quiz
•
4th Grade
22 questions
fractions
Quiz
•
3rd Grade
20 questions
Main Idea and Details
Quiz
•
5th Grade
20 questions
Context Clues
Quiz
•
6th Grade
15 questions
Equivalent Fractions
Quiz
•
4th Grade