Deck 26: Process Control and Memory Management

Question 1

A process stack does not contain

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

Answer 1

PID of child process

Question 2

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

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

Answer 2

wait

Question 3

The address of the next instruction to be executed by the current process is provided by the

A)CPU registers
B)Program counter
C)Process stack
D)Pipe

Answer 3

Program counter

Question 4

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

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

Question 5

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

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

Question 6

The state of a process is defined by:

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

Question 7

Which of the following is not the state of a process?

A)New
B)Old
C)Waiting
D)Running

Question 8

The Process Control Block is:

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

Question 9

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

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

Question 10

The degree of multiprogramming is:

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 11

A single thread of control allows the process to perform:

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 12

The objective of multiprogramming is to :

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

Question 13

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

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 14

A system is in the safe state if

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 15

The circular wait condition can be prevented by

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

Question 16

Which one of the following is the deadlock avoidance algorithm?

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

Question 17

What is the drawback of banker's algorithm?

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 18

To avoid deadlock

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 19

If the wait for graph contains a cycle :

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 20

All unsafe states are :

A)deadlocks
B)not deadlocks
C)fatal
D)none of the mentioned

Question 21

Physical memory is broken into fixed-sized blocks called ________

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

Question 22

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

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

Question 23

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

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

Question 24

_____ is the concept in which a process is copied into main memory from the secondary memory according to the requirement.

A)Paging
B)Demand paging
C)Segmentation
D)Swapping

Question 25

Linux uses a time-sharing algorithm

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