0

Operating System (UGC/NET)

Description: AOS
Number of Questions: 15
Created by:
Tags: AOS Operating Systems with Case Study of Unix
Attempted 0/15 Correct 0 Score 0

The paging activity in which a process having less number of frames than required or when a process is executing with a minimum set of frames allocated to it is _____________.

  1. demand paging

  2. FIFO page replacement algorithm

  3. thrashing

  4. optimal page replacement algorithm

  5. virtual memory


Correct Option: C
Explanation:

This paging activity is the one in which a process having less number of frames than required or when a process is executing with a minimum set of frames allocated to it.

The operation performed on a file in which the file attributes are not changed but the file has a reduced size because the user deletes information in the file is _______________.

  1. truncating a file

  2. deleting a file

  3. reading a file

  4. writing a file

  5. creating a file


Correct Option: A
Explanation:

This is the operation performed on a file in which the file attributes are not changed but the file has a reduced size because the user deletes information in the file.

The type of fetch that is dependent upon some defined criterion and makes use of main memory rather than the cache to hold the information is called __________________.

  1. pre-fetch

  2. selective fetch

  3. demand fetch

  4. always fetch

  5. pre-cleaning


Correct Option: B
Explanation:

This type of fetch is dependent upon some defined criterion and makes use of main memory rather than the cache to hold the information.

____________ is the directory structure in which directory is a tree of height two with the master file directory at the root having user directories as descendants.

  1. Single level directory

  2. Two-level directory

  3. Tree structure directories

  4. Directory

  5. File


Correct Option: C
Explanation:

This directory structure is the one in which directory is a tree of height two with the master file directory at the root having user directories as descendants.

The approach in multiple processor scheduling in which multiple virtual CPUs are used instead of multiple physical CPUs is ______________.

  1. contention scope

  2. symmetric multithreading

  3. processor affinity

  4. load balancing

  5. pull migration


Correct Option: B
Explanation:

This approach in multiple processor scheduling is the one in which multiple virtual CPUs are used instead of multiple physical CPUs.

The type of memory mapping in cache where the cache consists of normal high speed random access memory and each location in the cache holds the data is _____________.

  1. II set-associative mapping

  2. I direct mapping

  3. III sector mapping

  4. fully associative mapping

  5. cleaning policy


Correct Option: B
Explanation:

This type of memory mapping in cache is the one in which the cache consists of normal high speed random access memory and each location in the cache holds the data.

The condition required for deadlock to occur states that each process is waiting to obtain a resource which is held by another process is ______________.

  1. mutual exclusion

  2. hold and wait

  3. no preemption

  4. circular wait

  5. livelock


Correct Option: D
Explanation:

This condition for deadlock to occur states that each process is waiting to obtain a resource which is held by another process.

The process state of UNIX operating system which states that the process is ready to run, but the swapper must swap the process into main memory before the kernel can schedule it to execute is ______________.

  1. swapped

  2. preempted

  3. ready to run, in memory

  4. created

  5. sleeping


Correct Option: A
Explanation:

This process state of UNIX operating system states that the process is ready to run, but the swapper must swap the process into main memory before the kernel can schedule it to execute.

The type of scheduling that is intended to pick the quickest and fastest little job that needs to be done by the CPU is __________.

  1. FCFS

  2. round-robin

  3. SJF

  4. multilevel queue

  5. priority


Correct Option: C
Explanation:

This type of scheduling is intended to pick the quickest and fastest little job that needs to be done by the CPU. In this of scheduling, each job is assigned a priority and the job with the highest priority gets scheduled first.

The type of threads that require non-blocking system call, i.e. a multithreaded kernel, otherwise the entire process will be blocked in the kernel even if there are runable threads left in the processes, are _________________.

  1. kernel level threads

  2. user level threads

  3. ready

  4. running

  5. blocked


Correct Option: B
Explanation:

This type of threads require non-blocking system calls, i.e. a multithreaded kernel.

The type of computing which is used in a system that requires to complete a critical task within a guaranteed amount of time is _______________.

  1. soft real time systems

  2. hard real time systems

  3. multilevel feedback queue scheduling

  4. round-robin scheduling

  5. multiple processor scheduling


Correct Option: B
Explanation:

This type of computing is used in a system that requires to complete a critical task within a guaranteed amount of time.

The type of buffering that consists of a queue having finite length and thus, can have 'N' messages reside in it is _____________.

  1. zero capacity

  2. unbounded capacity

  3. bounded capacity

  4. bounded waiting

  5. mutual exclusion


Correct Option: C
Explanation:

This type of buffering consists of a queue having finite length and thus, can have 'N' messages reside in it.

The type of allocation that divides primary memory into multiple memory partitions, usually contiguous areas of memory and is required for multiprogramming, is

  1. single partition allocation

  2. multiple partition allocation

  3. paging

  4. fragmentation

  5. swapping


Correct Option: B
Explanation:

This type of allocation divides primary memory into multiple memory partitions, usually contiguous areas of memory and is required for multiprogramming.

The part of Process Control Block which is particularly a register that holds the address of next instruction to be executed is ________________.

  1. process state

  2. CPU registers

  3. program counter

  4. CPU scheduling information

  5. memory management information


Correct Option: C
Explanation:

This part of Process Control Block is particularly a register that holds the address of next instruction to be executed.

The method of relocating processes in memory so that the fragmented holes are converted into contiguous holes in memory is _______________

  1. swapping

  2. compaction

  3. segmentation

  4. program counter

  5. MAR


Correct Option: B
Explanation:

This is a method of relocating processes in memory so that the fragmented holes are converted into contiguous holes in memory.

- Hide questions