Question 1

Process are classified into different groups in
A)shortest job scheduling algorithm
B)round robin scheduling algorithm
C)priority scheduling algorithm
D)multilevel queue scheduling algorithm

Accepted Answer

In the multilevel queue scheduling algorithm, processes are classified into different groups based on specific criteria such as process priority, type of process (system process, interactive, batch, etc.). Each group is placed in its own queue, and scheduling is performed among the queues, often based on a fixed priority.

Question 2

In multilevel feedback scheduling algorithm
A)a process can move to a different classified ready queue
B)classification of ready queue is permanent
C)processes are not classified into groups
D)none of the mentioned

Accepted Answer

In a multilevel feedback scheduling algorithm, a process can indeed move between different classified ready queues based on its behavior and requirements (e.g., CPU burst time). This dynamic adjustment allows the system to better manage processes, providing flexibility in handling various process needs.

Question 3

Which one of the following can not be scheduled by the kernel?
A)kernel level thread
B)user level thread
C)process
D)none of the mentioned

Accepted Answer

The kernel is not aware of user-level threads and does not schedule them directly. User-level thread management is done by a thread library at the user level, not by the kernel.

Question 4

What is the reusable resource?
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

Accepted Answer

Reusable resources are those that can be used by one process at a time and are not depleted by that use, allowing them to be used again by other processes.

Question 5

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

Accepted Answer

All the mentioned conditions (mutual exclusion, hold and wait, no preemption) are required for a deadlock to be possible in a system.

Question 6

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)both (a) and (b)
D)none of the mentioned

Accepted Answer

A system is considered to be in a safe state if it can allocate resources to each process in some order (a safe sequence) and still avoid a deadlock, meaning both (a) and (b) are correct.

Question 7

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

Accepted Answer

Defining a linear ordering of resource types is a method to prevent the circular wait condition, which is one of the necessary conditions for deadlock. By ensuring that all resources are requested in a predetermined order, circular wait situations can be avoided.

Question 8

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

Accepted Answer

The banker's algorithm is a deadlock avoidance algorithm designed to allocate resources to processes in a way that avoids deadlock. It simulates the allocation of resources to each process, ensuring that at least one safe sequence exists for all processes to complete without entering a deadlock state.

Question 9

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

Accepted Answer

The banker's algorithm has several drawbacks, including the difficulty for processes to know in advance the maximum resources they will need, the dynamic nature of process numbers, and the assumption that resources, once available, do not disappear. These limitations make the banker's algorithm less practical for real-world systems where these conditions often do not hold.

Question 10

For effective operating system, when to check for deadlock?
A)every time a resource request is made
B)at fixed time intervals
C)both (a) and (b)
D)none of the mentioned

Accepted Answer

Deadlock detection can be performed both every time a resource request is made and at fixed time intervals, depending on the system's requirements and the specific deadlock detection algorithm implemented.

Question 11

A problem encountered in multitasking when a process is perpetually denied necessary resources is called
A)deadlock
B)starvation
C)inversion
D)aging

Accepted Answer

Starvation occurs in a multitasking environment when a process is perpetually denied the necessary resources to proceed; it's essentially when a process is always put at the end of the queue and never gets its turn because other processes are continuously prioritized over it.

Question 12

Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
A)resource allocation graph
B)starvation graph
C)inversion graph
D)none of the mentioned

Accepted Answer

A resource allocation graph is a visual representation used in computer science to illustrate the allocation of various types of resources among competing processes, helping to detect the presence of deadlocks by identifying cycles in the graph.

Question 13

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

Accepted Answer

The answer of To avoid deadlock
A)there must be a fixed...

Question 14

CPU fetches the instruction from memory according to the value of
A)program counter
B)status register
C)instruction register
D)program status word

Accepted Answer

The CPU fetches the instruction from memory according to the value of the program counter. The program counter holds the address of the next instruction to be executed, guiding the CPU on where to fetch the next instruction from memory.

Question 15

A memory buffer used to accommodate a speed differential is called
A)stack pointer
B)cache
C)accumulator
D)disk buffer

Accepted Answer

A cache is a memory buffer used to accommodate a speed differential between the CPU and slower memory or storage devices.

Question 16

Which one of the following is the address generated by CPU?
A)physical address
B)absolute address
C)logical address
D)none of the mentioned

Accepted Answer

The logical address is generated by the CPU during a program's execution.

Question 17

Run time mapping from virtual to physical address is done by
A)memory management unit
B)cpu
C)pci
D)none of the mentioned

Accepted Answer

The Memory Management Unit (MMU) is responsible for the runtime mapping of virtual addresses to physical addresses in a computer system, facilitating tasks such as virtual memory management and memory protection.

Question 18

Memory management technique in which system stores and retrieves data from secondary storage for use in main memory is called
A)fragmentation
B)paging
C)mapping
D)none of the mentioned

Accepted Answer

Paging is a memory management scheme that eliminates the need for contiguous allocation of physical memory. This technique allows the physical address space of a process to be noncontiguous, which makes it easier to store and retrieve data from secondary storage for use in main memory.

Question 19

The address of a page table in memory is pointed by
A)stack pointer
B)page table base register
C)page register
D)program counter

Accepted Answer

The Page Table Base Register (PTBR) holds the base address of the page table in memory, allowing the system to locate the page table for the currently running process.

Question 20

Program always deals with
A)logical address
B)absolute address
C)physical address
D)relative address

Accepted Answer

Programs deal with logical addresses during their execution, where the logical address is a reference to a memory location independent of the current assignment of data to memory. Translation from logical to physical address is handled by the memory management unit (MMU) of the operating system.

Quiz 3: Operating System and Process Management: Part B

Process are classified into different groups in

In multilevel feedback scheduling algorithm

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

What is the reusable resource?

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

A system is in the safe state if

The circular wait condition can be prevented by

Which one of the following is the deadlock avoidance algorithm?

What is the drawback of banker's algorithm?

For effective operating system, when to check for deadlock?

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

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

To avoid deadlock

CPU fetches the instruction from memory according to the value of

A memory buffer used to accommodate a speed differential is called

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

Run time mapping from virtual to physical address is done by

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

The address of a page table in memory is pointed by

Program always deals with