Question 1

The objective of multiprogramming is to :

Accepted Answer

A) Have some process running at all times 
B) Have multiple programs waiting in a queue ready to run 
C) To minimize CPU utilization 
D) None of the mentioned 
A) Have some process running at all times 
B) Have multiple programs waiting in a queue ready to run 
C) To minimize CPU utilization 
D) None of the mentioned A

Question 2

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 A

Question 3

The __________ is used as an index into the page table.

Accepted Answer

A) frame bit 
B) page number 
C) page offset 
D) frame offset 
A) frame bit 
B) page number 
C) page offset 
D) frame offset B

Question 4

The degree of multiprogramming is:

Accepted Answer

A) the number of processes executed per unit time 
B) the number of processes in the ready queue 
C) the number of processes in the I/O queue 
D) the number of processes in memory 
A) the number of processes executed per unit time 
B) the number of processes in the ready queue 
C) the number of processes in the I/O queue 
D) the number of processes in memory

Question 5

Linux uses a time-sharing algorithm

Accepted Answer

A) to pair preemptive scheduling between multiple processes 
B) for tasks where absolute priorities are more important than fairness 
C) all of the mentioned 
D) none of the mentioned 
A) to pair preemptive scheduling between multiple processes 
B) for tasks where absolute priorities are more important than fairness 
C) all of the mentioned 
D) none of the mentioned

Question 6

The Process Control Block is:

Accepted Answer

A) Process type variable 
B) Data Structure 
C) A secondary storage section 
D) A Block in memory 
A) Process type variable 
B) Data Structure 
C) A secondary storage section 
D) A Block in memory

Question 7

The entry of all the PCBs of the current processes is in:

Accepted Answer

A) Process Register 
B) Program Counter 
C) Process Table 
D) Process Unit 
A) Process Register 
B) Program Counter 
C) Process Table 
D) Process Unit

Question 8

Which system call returns the process identifier of a terminated child?

Accepted Answer

A) wait 
B) exit 
C) fork 
D) get 
A) wait 
B) exit 
C) fork 
D) get

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

Physical memory is broken into fixed-sized blocks called ________

Accepted Answer

A) frames 
B) pages 
C) backing store 
D) none of the mentioned 
A) frames 
B) pages 
C) backing store 
D) none of the mentioned

Question 11

A Process Control Block(PCB) does not contain which of the following :

Accepted Answer

A) Code 
B) Stack 
C) Bootstrap program 
D) Data 
A) Code 
B) Stack 
C) Bootstrap program 
D) Data

Question 12

The number of processes completed per unit time is known as __________

Accepted Answer

A) Output 
B) Throughput 
C) Efficiency 
D) Capacity 
A) Output 
B) Throughput 
C) Efficiency 
D) Capacity

Question 13

If the wait for graph contains a cycle :

Accepted Answer

A) then a deadlock does not exist 
B) then a deadlock exists 
C) then the system is in a safe state 
D) either deadlock exists or system is in a safe state 
A) then a deadlock does not exist 
B) then a deadlock exists 
C) then the system is in a safe state 
D) either deadlock exists or system is in a safe state

Question 14

A single thread of control allows the process to perform:

Accepted Answer

A) only one task at a time 
B) multiple tasks at a time 
C) only two tasks at a time 
D) all of the mentioned 
A) only one task at a time 
B) multiple tasks at a time 
C) only two tasks at a time 
D) all of the mentioned

Question 15

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) all of the mentioned 
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) all of the mentioned 
D) none of the mentioned

Question 16

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 17

A process stack does not contain

Accepted Answer

A) Function parameters 
B) Local variables 
C) Return addresses 
D) PID of child process 
A) Function parameters 
B) Local variables 
C) Return addresses 
D) PID of child process

Question 18

What is the drawback of banker's algorithm?

Accepted Answer

A) in advance processes rarely know that how much resource they will need 
B) the number of processes changes as time progresses 
C) resource once available can disappear 
D) all of the mentioned 
A) in advance processes rarely know that how much resource they will need 
B) the number of processes changes as time progresses 
C) resource once available can disappear 
D) all of the mentioned

Question 19

Logical memory is broken into blocks of the same size called _________

Accepted Answer

A) frames 
B) pages 
C) backing store 
D) none of the mentioned 
A) frames 
B) pages 
C) backing store 
D) none of the mentioned

Question 20

The state of a process is defined by:

Accepted Answer

A) the final activity of the process 
B) the activity just executed by the process 
C) the activity to next be executed by the process 
D) the current activity of the process 
A) the final activity of the process 
B) the activity just executed by the process 
C) the activity to next be executed by the process 
D) the current activity of the process

Exam 26: Process Control and Memory Management

The objective of multiprogramming is to :

The circular wait condition can be prevented by

The __________ is used as an index into the page table.

The degree of multiprogramming is:

Linux uses a time-sharing algorithm

The Process Control Block is:

The entry of all the PCBs of the current processes is in:

Which system call returns the process identifier of a terminated child?

Which one of the following is the deadlock avoidance algorithm?

Physical memory is broken into fixed-sized blocks called ________

A Process Control Block(PCB) does not contain which of the following :

The number of processes completed per unit time is known as __________

If the wait for graph contains a cycle :

A single thread of control allows the process to perform:

A system is in the safe state if

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

A process stack does not contain

What is the drawback of banker's algorithm?

Logical memory is broken into blocks of the same size called _________

The state of a process is defined by:

Operating System

Operating System and Software

Operating System and Computer Basics: Formatting, Clipboard, Radio Buttons, Bankers Algorithm, and More

Computer Software and Operating System

Processor and Memory Fundamentals

Computer Architecture and Memory

Computer Science and Information Technology on Raid, Middleware, and CPU Scheduling

Understanding Process Scheduling in Operating Systems

Operating System and Process Management

Process Scheduling and Synchronization in Multi-Programming Environment

Process Management and Interprocess Communication in Unix

Semaphores, Spinlocks, and Monitors: Understanding Synchronization in Operating Systems

Concurrency Control and Deadlock Prevention in Operating Systems

Deadlock and Resource Allocation in Computer Systems

Memory Management and Swapping Techniques

Memory Management in Operating Systems

Understanding Paging and Memory Management in Operating Systems

Understanding Virtual Memory and Page Replacement Algorithms

Virtual Memory, Segmentation, and Disk Management

Disk Management and I/O Subsystem

Linux Kernel and System Structures

Thread Management and Synchronization in Operating Systems

Operating System Concepts: System Calls, Threads, and Signals

Operating System and Thread Pool

Operating System and Memory Management

Linux Kernel, File Systems, Bootloaders and Distributions

Filters