Operating  System Viva

Operating System Viva

University

15 Qs

quiz-placeholder

Similar activities

Memory Management - Paging & segmentation

Memory Management - Paging & segmentation

12th Grade - University

15 Qs

Chapter 9 : Virtual Memory

Chapter 9 : Virtual Memory

University

20 Qs

Apache Spark

Apache Spark

University

10 Qs

Chapter 8 - Memory Management Strategies

Chapter 8 - Memory Management Strategies

University

15 Qs

Operating System by Baba

Operating System by Baba

University

12 Qs

Page Replacement Algorithms

Page Replacement Algorithms

University

15 Qs

PEP OS INPUT

PEP OS INPUT

University

20 Qs

Operating System Gate and placement Questions

Operating System Gate and placement Questions

University

20 Qs

Operating  System Viva

Operating System Viva

Assessment

Quiz

Computers

University

Hard

Created by

Rejimoan R

Used 2+ times

FREE Resource

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

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?