0

Operating System

Description: OS
Number of Questions: 15
Created by:
Tags: OS Operating System
Attempted 0/15 Correct 0 Score 0

Which of the following operating systems is a combination of processors and a special software that are inside another device, such as the electronic ignition system on cars?

  1. Desktop OS

  2. Embedded OS

  3. Workstation OS

  4. Server OS

  5. Mainframe OS


Correct Option: B
Explanation:

This operating system is a combination of processors and a special software that are inside another device, such as the electronic ignition system on cars.

Which of the following techniques is used in process management and involves moving a part or a complete process from the main memory to disk to execute ready processes by the CPU?

  1. Hashing

  2. Multitasking

  3. Multithreading

  4. Swapping

  5. Overloading


Correct Option: D
Explanation:

This option is correct.

_______ is also called full virtualisation with dynamic recompilation.

  1. Paravirtualisation

  2. Emulation

  3. Native virtualisation

  4. Hashing

  5. Semaphores


Correct Option: B
Explanation:

This type of software virtualisation is also called full virtualisation with dynamic recompilation.

_______ deals with the selection of a page in memory to be replaced after a page fault occurs and a new page must be brought in.

  1. Placement policy

  2. Replacement policy

  3. Fetch policy

  4. Cleaning policy

  5. Page fault


Correct Option: B
Explanation:

This policy in memory management deals with the selection of a page in memory to be replaced after a page fault occurs and a new page must be brought in.

_____ decides when a modified page should be written out to secondary memory.

  1. Frame locking

  2. Page buffering

  3. Fetch policy

  4. Cleaning policy

  5. Replacement policy


Correct Option: D
Explanation:

This operation in memory management decides when a modified page should be written out to the secondary memory.

Which of the following scheduling criterias of algorithms specifies that the CPU would be busy 100% of the time, so as to waste 0 CPU cycles?

  1. Throughput

  2. CPU utilisation

  3. Turnaround time

  4. Waiting time

  5. Response time


Correct Option: B
Explanation:

This scheduling criteria of algorithms specifies that the CPU would be busy 100% of the time, so as to waste 0 CPU cycles.

____ is dependent on some defined criterion and uses the main memory to hold the information.

  1. Pre-fetch

  2. Demand fetch

  3. Selective fetch

  4. Instruction fetch

  5. Operand fetch


Correct Option: C
Explanation:

This is dependent on some defined criterion and uses the main memory to hold the information.

_______ forms a set of n-bit registers, one for each block in the set to be considered.

  1. Reference matrix

  2. Approximate method

  3. Counters

  4. Register stack

  5. Queues


Correct Option: D
Explanation:

This implementation method forms a set of n-bit registers, one for each block in the set to be considered.

_______ is the fetching of a block when it is needed and is not already in the cache, i.e. to fetch the required block on a miss.

  1. Pre-fetch

  2. Selective fetch

  3. Demand fetch

  4. Cache miss

  5. Cache hit


Correct Option: C
Explanation:

This type of fetching is the fetching of a block when it is needed and is not already in the cache.

Which of the following is a condition in concurrency control which occurs when multiple processes or threads read and write data items, so that the final result depends on the order of execution of instructions in the multiple processes?

  1. Critical section

  2. Mutual exclusion

  3. Race conditions

  4. Concurrency

  5. Deadlock


Correct Option: C
Explanation:

This is the condition in concurrency control which occurs when multiple processes or threads read and write data items, so that the final result depends on the order of execution of instructions in the multiple processes.

_______ specifies that once a process holds a resource, it cannot be taken away by another process or the kernel.

  1. Mutual exclusion

  2. No preemption

  3. Hold and wait

  4. Circular wait

  5. Counters


Correct Option: B
Explanation:

This condition specifies that once a process holds a resource, it cannot be taken away by another process or the kernel.

Which of the following states must be occupied by a process when it is newly created?

  1. Blocked state

  2. Ready state

  3. Suspend state

  4. Exit state

  5. Running state


Correct Option: B
Explanation:

Ready state must be occupied by a process when it is newly created.

Which of the following information is not included inside a process which is an active entity and is more than a program code?

  1. Contents of the processors registers

  2. Value of the variables

  3. Current value of program counter (PC)

  4. The process stack

  5. The size of the process


Correct Option: E
Explanation:

This information is not included inside a process which is an active entity and is more than a program code.

In which of the following types of I/O control strategies is I/O performed under the control of an I/O handling procedure?

  1. Program-controlled I/O

  2. Interrupt-controlled I/O

  3. Direct memory access

  4. Cache memory organisation

  5. Stacks


Correct Option: A
Explanation:

This type of I/O control strategy is the one in which I/O is performed under the control of an I/O handling procedure.

_____ removes the block that has been in the cache for the longest time.

  1. LRU algorithm

  2. Random replacement algorithm

  3. First in first out replacement algorithm

  4. Linear search algorithm

  5. Binary search algorithm


Correct Option: C
Explanation:

This type of algorithm in memory management removes the block that has been in the cache for the longest time.

- Hide questions