CS604 Quiz#2 Solution and discussion


  • Cyberian's Gold

    Using hardware solution to synchronization for complex problems, introduce a new synchronization tool know as _______________.

    1. TestAndSet
    2. Semaphore (Page 111)
    3. Swap
    4. Trap

  • Cyberian's Gold

    The main memory is usually divided into partitions, one for __________ and other for __________.

    1. Operating System, User processes
    2. Operating system, CPU
    3. Processes, Virtual Memory
    4. Base Register, Limit Register

  • Cyberian's Gold

    The integer value of ________semaphores can range over an unrestricted integer domain.

    Counting (Page 117)
    ►Binary
    ►Mutex
    ►Bounded buffer


  • Cyberian's Gold

    The integer value of _________ semaphores can not be greater than 1.
    ►Counting
    Binary (Page 117)
    ►Mutex
    ►Bounded buffer


  • Cyberian's Gold

    Secondary storage memory devices have ____ memory.
    ►Volatile
    Permanent and non volatile Click here for detail
    ►Temporary
    ►None of the


  • Cyberian's Gold

    Object files and libraries are combined by a ------------- program to produce the executable binary
    ► Compiler
    ► Linker
    ► Text editor
    Loader Click here for detail


  • Cyberian's Gold

    In Swapping technique of Memory Management, the total amount transfer time is directly proportional to the ___________.

    1. amount of memory swapped
    2. amount of space on backing store
    3. space on main memory
    4. all the given options are correct

  • Cyberian's Gold

    In order to remove the problem like busy waiting, some high level synchronization constructs are defined. What
    are they?

    Critical regions and Monitors (Page 124)


  • Cyberian's Gold

    In deadlock detection and recovery algorithm, a deadlock exists in the system if and only if the wait for graph
    contains a _____________

    Cycle (Page 147)
    ► Graph
    ► Edge
    ► Node


  • Cyberian's Gold

    External Fragmentation takes place in ______________

    Select correct option:

    1. Multi programming with Variable Tasks (MVT)
    2. Multi programming with Fixed Tasks (MFT)
    3. Multi-tasking
    4. Paging

  • Cyberian's Gold

    Each page is a power of -------- bytes long in paging scheme.
    ► 2
    ► 3
    4 (Page 167)
    ► 5


  • Cyberian's Gold

    ----------holds the smallest legal physical memory address for a process CS604
    Or
    Which register holds the smallest legal physical memory address for a process?

    Base register (Page 13)
    ► Limit register
    ►Status register
    ►None of the given options


  • Cyberian's Gold

    ---------------keep in memory only those instructions and data that are needed at any given time. CS604

    ►Fragmentation
    ►Paging
    ►Swapping
    Overlays (Page 156)


  • Cyberian's Gold

    1. The collection of process that is waiting on the disk to be brought into the memory for execution forms the _______

    Input queue = Correct Option

    Output queue

    Both of the

    None of the above

    1. _____is used due to un-used space in fixed size blocks/ pages.

    Internal fragmentation = Correct Option

    External fragmentation

    Paging

    MVT

    1. Fragmentation when using ICMP for path MTU should be avoided.

    Select correct option:

    True = Correct Option

    False

    Static routing

    1. Secondary storage memory devices have ____ memory.

    Volatile

    Permanent and non volatile = Correct Option

    Temporary

    None of the

    1. _____is caused due to un-used in physical memory.

    Internal fragmentation = Correct Option

    External fragmentation

    Paging

    MVT

    1. The set of all physical address corresponding to the logical address is a _____of the process

    Logical address space

    Process address space

    Physical address space = Correct Option

    None of the These

    1. Addresses generated relative to part of program, not to start of physical memory are

    Relocatable = Correct Option

    Virtual

    Symbolic

    Physical

    1. In deadlock detection and recovery algorithm exists in the system if and only if the wait for graph contains a _______.

    Cycle = Correct Option

    Graph

    Edge

    Node

    1. Object files and library are combined by a ____ program to produce the executable binary

    Compiler

    Linker

    Text editor

    Loader = Correct Option

    1. The run-time mapping from virtual to physical address is done by a piece of hardware in the CPU, called the _______

    Memory management unit (MMU) = Correct Option

    CPU scheduler

    Registers

    None of the above


  • Cyberian's Gold

    Addresses generated relative to part of program, not to start of physical memory are CS604

    Relocatable = Correct Option
    Virtual
    Symbolic
    Physical


  • Cyberian's Gold

    If a system is not in a safe state, there can be NO deadlocks. CS604

    True ()134

    e93754a5-b3c7-4656-8fad-5ff452175252-image.png


Log in to reply
 

Quiz 100% Result Quiz 100% Result
| |