Answer:b) Hybrid kernel
Explanation:The kernel is an important part of OS and manages the operations of a computer and its hardware. There are many types of kernels such as microkernel, monolithic kernel, Hybrid Kernel etc. In microkernel, user and kernel services are run in separate address space. This reduces the size of the Kernel which in turn, reduces the size of Operating System but reduces the speed of execution. In monolithic kernel, both user services and kernel services are kept in the same address space. Consequently, the execution of the process will be faster in Monolithic Kernels. A hybrid kernel is a combination of the features and benefits of both microkernel and monolithic kernel. And the Windows kernel is a hybrid kernel
Answer:b) Kernel is not the first part of an operating system that was loaded into memory when booting up a computer.
Explanation:Kernel is the first program of the operating system that was loaded into memory when booting up a computer.
Answer: a) System calls
Explanation:System call serves as an interface between the operating system and user programs. When a user program needs to access the operating system's kernel, it makes a system call. The kernel system can only be accessed using system calls.
Answer:a) A process is newly created and is waiting for the CPU.
Explanation:A newly created process is in a ready state and is waiting for the CPU in order to execute it.
When a process is unable to run because it is waiting for some other task to be completed, it is said to be in a wait/block state.
When a process is using the CPU, it is said to be in a running state.
Answer:d) All of the above.
Explanation:A process can be killed by all of the above methods. A process exits normally when it completes its task successfully. On account of fatal error while running, the process may exit abnormally. And it can also be terminated forcefully by another process.
Answer:b) Logical address
Explanation:Physical Address is the actual address of the data inside the memory. The user never deals with the Physical Address directly. It uses a virtual address or logical address generated by the CPU to access physical address inside the memory. It is the memory management unit, MMU that translates logical addresses to physical addresses that corresponds to RAM or main memory. So, a logical address does not exist physically but is only used for reference to access the physical address.
Answer:b) Swapping
Explanation:Thrashing is a state where the CPU spends most of its time swapping pages between the main memory and virtual memory, rather than executing instructions. Thrashing results in performance problem in OS since CPU spends less time on actual productive work and spend more time swapping.
Answer:a) A page is not found in the main memory
Explanation:Page fault occurs when a program accesses a page that is mapped in the virtual address space, but not loaded in physical memory. The page fault causes an exception that notifies the operating system to retrieve the "pages" from the secondary memory into the main memory.
Answer:d) Banker’s
Explanation:Banker’s algorithm is a deadlock avoidance algorithm and not a scheduling algorithm.
Scheduling algorithms tell the CPU which will be the next process to have CPU time based on particular scheduling algorithms. The main objective of Scheduling algorithm is to maximize the CPU utilization. Some of the widely used scheduling algorithms are
- First-Come, First-Served (FCFS) Scheduling
- Shortest-Job-Next (SJN) Scheduling
- Priority Scheduling
- Shortest Remaining Time
- Round Robin(RR) Scheduling
- Multiple-Level Queues Scheduling
Answer:c) Overlays are used to overcome the limitation of physical memory.
Explanation:Overlay is a technique that allows a program to run despite it is bigger than the size of the physical memory. Using this technique, only those instructions and data are kept inside the main memory that is needed at any given time.
Answer: a) Execution of a process that may not be completely in the memory
Explanation:Virtual memory is a part of the secondary storage but gives the user an illusion that it is a part of the main memory. It allows running big applications with low main memory and increases the degree of multiprogramming in systems. Virtual memory frees up RAM by swapping data that has not been used recently over to a storage device, such as a hard drive.
Answer:b) paging
Explanation:Paging divides each process in the form of pages. These pages are brought into the main memory only when they are required otherwise they reside in the secondary storage.
Answer:d) All of the above
Answer:a) Virtual memory
Explanation:In paging, a process is divided into fixed-size contiguous block known as pages and is stored on the secondary storage
Answer:b) Pre-emptive
Explanation:Pre-emptive is the most suitable scheduling scheme for the real time operating system
A Real-time system requires producing the result urgently and preemptive scheduling allows a real-time process to preempt a process currently running in the kernel.
Answer:a) Prevent deadlock
Explanation:Banker’s algorithm is a deadlock avoidance algorithm. It manages resources allocation. It is also called as deadlock detection algorithm.
It is named as Banker's algorithm because the banks use the same technique to allocate money and provide loans to their customers so that they never run out of money.
Answer:b) Starvation
Explanation:Starvation is a situation where all the low priority processes get blocked, and the high priority processes execute. Unlike Deadlock, starvation is a long waiting but not an infinite process. Every starvation doesn’t necessarily cause a deadlock. And Starvation basically happens due to uncontrolled priority and resource management.
Answer:b) Program counter
Explanation:Program counter is one of the attributes of a process where it stores address of the next instruction to be executed by the process.
Answer:b) Defining a linear ordering of resource types
Explanation:The circular wait condition can be prevented by defining a linear ordering of resource types. This means that we must number all resources and a process has to access the resource in an increasing or decreasing order.
For example, all resources are given an integer value in an increasing order, suppose a process acquired a resource R4 in an increasing order, this process will only have access to additional resources which has a higher integer value than the allocated resource such as R5, R6. And if that process wants a resource with a lesser integer value such as R3 or R2, it must first free the acquired resource before taking the new resource.
Answer:a) FCFS
Explanation:First Come First Server (FCFS) is a scheduling algorithm, where a process that request the CPU first will be executed first. Hence, it schedules processes and requests according to their arrival time.