Operating Systems Quiz

Operating Systems Quiz

University

18 Qs

quiz-placeholder

Similar activities

Week 5: Test your understanding part 1

Week 5: Test your understanding part 1

University

20 Qs

Introduction to Networking

Introduction to Networking

University

15 Qs

The AI Shield

The AI Shield

University

15 Qs

Digital Etiquette

Digital Etiquette

4th Grade - University

15 Qs

Microsoft Excel

Microsoft Excel

KG - Professional Development

20 Qs

Quiz on List and Tuples

Quiz on List and Tuples

University

16 Qs

Sistem Informasi Manajemen

Sistem Informasi Manajemen

University

20 Qs

Data Structure & Algo - Prelim Long Quiz

Data Structure & Algo - Prelim Long Quiz

University

21 Qs

Operating Systems Quiz

Operating Systems Quiz

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

Pushpendra Pateriya

Used 3+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

18 questions

Show all answers

1.

MULTIPLE SELECT QUESTION

2 mins • 1 pt

Which of the following statements is/are TRUE with respect to deadlocks?

Circular wait is a necessary condition for the formation of deadlock.

In a system where each resource has more than one instance, a cycle in its wait for graph indicates the presence of a deadlock.

If the current allocation of resources to processes leads the system to unsafe state, then deadlock will necessarily occur.

In the resource-allocation graph of a system, if every edge is an assignment edge, then the system is not in deadlock state.

2.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested and released only one at a time. The largest value of K that will always avoid deadlock is ____.

1

2

3

4

3.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

A system has 6 identical resources and N processes competing for them. Each process can request at most 2 resources. Which one of the following values of N could lead to a deadlock?

1

2

3

6

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is NOT a concept of Operating Systems?

Process Concepts and CPU Scheduling

Synchronization and Concurrency

Deadlocks

Divide and Conquer Method

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is a correct statement about memory management in Operating Systems?

Memory management is responsible for managing the execution of processes.

Memory management ensures that each process gets a fair share of CPU time.

Memory management is responsible for allocating and deallocating memory to processes.

Memory management is only required in multi-user operating systems.

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is NOT a function of a file system in Operating Systems?

Managing files and directories

Providing a way to store and retrieve data

Controlling access to files and protecting them from unauthorized access

Managing the execution of processes

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following is a correct statement about CPU scheduling in Operating Systems?

CPU scheduling is responsible for managing the execution of processes.

CPU scheduling ensures that each process gets a fair share of memory.

CPU scheduling is only required in single-user operating systems.

CPU scheduling is responsible for allocating and deallocating memory to processes.

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers