Operating  System Viva

Operating System Viva

University

15 Qs

quiz-placeholder

Similar activities

OOP 1 Undiksha

OOP 1 Undiksha

12th Grade - University

13 Qs

PARC Linux Basic Part 2

PARC Linux Basic Part 2

University

20 Qs

Adobe Photoshop

Adobe Photoshop

University

10 Qs

basisdata1

basisdata1

University

20 Qs

After Effect Intoduction

After Effect Intoduction

10th Grade - University

15 Qs

Google Aptitude Test

Google Aptitude Test

KG - University

10 Qs

Memory-Mobo-Hard/Software

Memory-Mobo-Hard/Software

University

18 Qs

tik kelas 7

tik kelas 7

1st Grade - University

15 Qs

Operating  System Viva

Operating System Viva

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

Rejimoan R

Used 2+ times

FREE Resource

AI

Enhance your content in a minute

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

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

CPU scheduling is the basis of ___________

multiprogramming operating systems

larger memory sized systems

multiprocessor systems

none of the mentioned

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

What is the task of exec family?

replaces the current process image with a new process image.

to execute the process

to create the process

None of above

3.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which page replacement algorithm is efficient?

Having more average waiting time

Having more turn around time

Having less turn around time

Having less average waiting time

4.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

Inter process communication is achieved through

Shared memory

Pipe

Buffer

Shared memory and Pipe

5.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

when the page referenced by the CPU is not found in the main memory then it is called as:

page hit

page fault

paging

segmentation

6.

MULTIPLE CHOICE QUESTION

10 sec • 1 pt

The wait operation of the semaphore basically works on the basic _______ system call.

stop()

block()

hold()

wait()

7.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?

2

3

4

1

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?