Question 1

Which one of the following is the address generated by CPU?

Accepted Answer

A) physical address 
B) absolute address 
C) logical address 
D) none of the mentioned 
A) physical address 
B) absolute address 
C) logical address 
D) none of the mentioned C

Question 2

Operating System maintains the page table for

Accepted Answer

A) each process 
B) each thread 
C) each instruction 
D) each address 
A) each process 
B) each thread 
C) each instruction 
D) each address A

Question 3

What is compaction?

Accepted Answer

A) a technique for overcoming internal fragmentation 
B) a paging technique 
C) a technique for overcoming external fragmentation 
D) a technique for overcoming fatal error 
A) a technique for overcoming internal fragmentation 
B) a paging technique 
C) a technique for overcoming external fragmentation 
D) a technique for overcoming fatal error C

Question 4

A problem encountered in multitasking when a process is perpetually denied necessary resources is called

Accepted Answer

A) deadlock 
B) starvation 
C) inversion 
D) aging 
A) deadlock 
B) starvation 
C) inversion 
D) aging

Question 5

Process are classified into different groups in

Accepted Answer

A) shortest job scheduling algorithm 
B) round robin scheduling algorithm 
C) priority scheduling algorithm 
D) multilevel queue scheduling algorithm 
A) shortest job scheduling algorithm 
B) round robin scheduling algorithm 
C) priority scheduling algorithm 
D) multilevel queue scheduling algorithm

Question 6

Which one of the following can not be scheduled by the kernel?

Accepted Answer

A) kernel level thread 
B) user level thread 
C) process 
D) none of the mentioned 
A) kernel level thread 
B) user level thread 
C) process 
D) none of the mentioned

Question 7

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

Accepted Answer

A) resource allocation graph 
B) starvation graph 
C) inversion graph 
D) none of the mentioned 
A) resource allocation graph 
B) starvation graph 
C) inversion graph 
D) none of the mentioned

Question 8

The page table contains

Accepted Answer

A) base address of each page in physical memory 
B) page offset 
C) page size 
D) none of the mentioned 
A) base address of each page in physical memory 
B) page offset 
C) page size 
D) none of the mentioned

Question 9

Which one of the following is the deadlock avoidance algorithm?

Accepted Answer

A) banker's algorithm 
B) round-robin algorithm 
C) elevator algorithm 
D) karn's algorithm 
A) banker's algorithm 
B) round-robin algorithm 
C) elevator algorithm 
D) karn's algorithm

Question 10

The address of a page table in memory is pointed by

Accepted Answer

A) stack pointer 
B) page table base register 
C) page register 
D) program counter 
A) stack pointer 
B) page table base register 
C) page register 
D) program counter

Question 11

A memory buffer used to accommodate a speed differential is called

Accepted Answer

A) stack pointer 
B) cache 
C) accumulator 
D) disk buffer 
A) stack pointer 
B) cache 
C) accumulator 
D) disk buffer

Question 12

Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

Accepted Answer

A) fragmentation 
B) paging 
C) mapping 
D) none of the mentioned 
A) fragmentation 
B) paging 
C) mapping 
D) none of the mentioned

Question 13

The circular wait condition can be prevented by

Accepted Answer

A) defining a linear ordering of resource types 
B) using thread 
C) using pipes 
D) all of the mentioned 
A) defining a linear ordering of resource types 
B) using thread 
C) using pipes 
D) all of the mentioned

Question 14

To avoid deadlock

Accepted Answer

A) there must be a fixed number of resources to allocate 
B) resource allocation must be done only once 
C) all deadlocked processes must be aborted 
D) inversion technique can be used 
A) there must be a fixed number of resources to allocate 
B) resource allocation must be done only once 
C) all deadlocked processes must be aborted 
D) inversion technique can be used

Question 15

Which of the following condition is required for deadlock to be possible?

Accepted Answer

A) mutual exclusion 
B) a process may hold allocated resources while awaiting assignment of other resources 
C) no resource can be forcibly removed from a process holding it 
D) all of the mentioned 
A) mutual exclusion 
B) a process may hold allocated resources while awaiting assignment of other resources 
C) no resource can be forcibly removed from a process holding it 
D) all of the mentioned

Question 16

CPU fetches the instruction from memory according to the value of

Accepted Answer

A) program counter 
B) status register 
C) instruction register 
D) program status word 
A) program counter 
B) status register 
C) instruction register 
D) program status word

Question 17

In paging the user provides only ________, which is partitioned by the hardware into ________ and ______.

Accepted Answer

A) one address, page number, offset 
B) one offset, page number, address 
C) page number, offset, address 
D) none of these 
A) one address, page number, offset 
B) one offset, page number, address 
C) page number, offset, address 
D) none of these

Question 18

Program always deals with

Accepted Answer

A) logical address 
B) absolute address 
C) physical address 
D) relative address 
A) logical address 
B) absolute address 
C) physical address 
D) relative address

Question 19

A system is in the safe state if

Accepted Answer

A) the system can allocate resources to each process in some order and still avoid a deadlock 
B) there exist a safe sequence 
C) both (a) and (b) 
D) none of the mentioned 
A) the system can allocate resources to each process in some order and still avoid a deadlock 
B) there exist a safe sequence 
C) both (a) and (b) 
D) none of the mentioned

Question 20

What is the reusable resource?

Accepted Answer

A) that can be used by one process at a time and is not depleted by that use 
B) that can be used by more than one process at a time 
C) that can be shared between various threads 
D) none of the mentioned 
A) that can be used by one process at a time and is not depleted by that use 
B) that can be used by more than one process at a time 
C) that can be shared between various threads 
D) none of the mentioned

Which one of the following is the address generated by CPU?

Operating System maintains the page table for

What is compaction?

A problem encountered in multitasking when a process is perpetually denied necessary resources is called

Process are classified into different groups in

Which one of the following can not be scheduled by the kernel?

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

The page table contains

Which one of the following is the deadlock avoidance algorithm?

The address of a page table in memory is pointed by

A memory buffer used to accommodate a speed differential is called

Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

The circular wait condition can be prevented by

To avoid deadlock

Which of the following condition is required for deadlock to be possible?

CPU fetches the instruction from memory according to the value of

In paging the user provides only __, which is partitioned by the hardware into and .

Program always deals with

A system is in the safe state if

What is the reusable resource?

Operating Systems

Operating System and Process Management: Part A

Memory Management, Content Delivery, and Thread Models

Operating Systems and Disk Management

Filters

Exam 3: Operating System and Process Management: Part B

Which one of the following is the address generated by CPU?

Operating System maintains the page table for

What is compaction?

A problem encountered in multitasking when a process is perpetually denied necessary resources is called

Process are classified into different groups in

Which one of the following can not be scheduled by the kernel?

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

The page table contains

Which one of the following is the deadlock avoidance algorithm?

The address of a page table in memory is pointed by

A memory buffer used to accommodate a speed differential is called

Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called

The circular wait condition can be prevented by

To avoid deadlock

Which of the following condition is required for deadlock to be possible?

CPU fetches the instruction from memory according to the value of

In paging the user provides only ________, which is partitioned by the hardware into ________ and ______.

Program always deals with

A system is in the safe state if

What is the reusable resource?

Operating Systems

Operating System and Process Management: Part A

Memory Management, Content Delivery, and Thread Models

Operating Systems and Disk Management

Filters

In paging the user provides only __, which is partitioned by the hardware into and .