OS Part 1 3

1. 1The code that changes the value of the semaphore is:

   1. Anon-critical section code
   2. Bremainder section code
   3. Cnone of the above
   4. Dcritical section code
2. 2The two kinds of semaphores are: (Several answers)

   1. Amutex
   2. Bcounting
   3. Cbinary
   4. Ddecimal
3. 3"Circular wait" condition for deadlock is defined as:

   1. AOnly one process may use a resource at a time
   2. BNo resource can be forcibly removed from process holding it
   3. CProcess holds a resource while awaiting for other resource
   4. DEach process holds resource needed by next process in chain
4. 4Banker’s algorithm for resource allocation deals with:

   1. Adeadlock prevention
   2. Bmutual exclusion
   3. Cdeadlock recovery
   4. Ddeadlock avoidance
5. 5What is compaction?

   1. Aa paging technique
   2. Ba technique for overcoming fatal error
   3. Ca technique for overcoming internal fragmentation
   4. Da technique for overcoming external fragmentation
6. 6Process is:

   1. Aa job in secondary memory
   2. Ba unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
   3. Ccontents of main memory
   4. Dprogram in high level language kept on disk
7. 7A single thread of control allows the process to perform:

   1. Aboth
   2. Bonly one task at a time
   3. Cmultiple tasks at a time
   4. Dnone
8. 8When the memory allocated to a process is slightly larger than a process, then:

   1. Aboth will occur
   2. Bexternal fragmentation occurs
   3. Cinternal fragmentation occurs
   4. Dnone of the above
9. 9A problem encountered in multitasking when a process is perpetually denied necessary resources is called:

   1. Astarvation
   2. Bdeadlock
   3. Caging
   4. Dinversion
10. 10The memory allocation scheme subject to "internal fragmentation" is:

    1. Asegmentation
    2. Bvirtual memory segmentation
    3. Cfixed partitioning
    4. Dpure demand paging

11. 11Which one is deadlock avoidance algorithm?

    1. Adining philosophers problem
    2. Belevator algorithm
    3. Cbanker’s algorithm
    4. Dround-robin algorithm
12. 12What is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks?

    1. Avirtual memory
    2. Bsegmentation
    3. Cpaging
    4. Dpartition
13. 13Variable-length block of data that resides in secondary memory is called:

    1. Anone of the above
    2. Bframes
    3. Csegments
    4. Dpages
14. 14The memory allocation scheme subject to "external fragmentation" is:

    1. Asegmentation
    2. Bswapping
    3. Cmultiple contiguous fixed partitioning
    4. Dpure demand paging
15. 15Four necessary conditions for deadlock to exist are: mutual exclusion, no-preemption, circular wait and

    1. Arace condition
    2. Bdeadlock avoidance
    3. Chold and wait
    4. Dstarvation
16. 16A binary semaphore is semaphore with integer values: (Several answers)

    1. A1
    2. B0
    3. C-1
    4. D0.5
17. 17Program always deals with:

    1. Alogical address
    2. Bphysical address
    3. Crelative address
    4. Dabsolute address
18. 18The systems which allows only one process execution at a time, are called

    1. Auniprogramming systems
    2. Bunitasking systems
    3. Cuniprocessing sysems
    4. Dunicasting systems
19. 19Swapping:

    1. Aallows many programs to use memory simultaneously
    2. Ballows each program in turn to use the memory
    3. Cdoes not work with overlaying
    4. Dnone of the above
20. 20When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access take place, is called:

    1. Adynamic condition
    2. Brace condition
    3. Ccritical condition
    4. Dessential condition
21. 21If a page table entry is present in the TLB, then it is known as a:

    1. Abuffer miss
    2. BTLB miss
    3. Cpage fault
    4. DTLB hit
22. 22With paging there is no _____ fragmentation

    1. Aeither type of
    2. Bnone of the above
    3. Cexternal
    4. Dinternal
23. 23The address of a page table in memory is pointed by:

    1. Apage table base register
    2. Bstack pointer
    3. Cpage register
    4. Dprogram counter
24. 24What is a medium-term scheduler?

    1. Ait selects which process has to be executed next and allocates CPU
    2. Bnone of the above
    3. Cit selects which process has to be brought into the ready queue
    4. Dit selects which process has to remove from memory by swapping
25. 25"No preemption" condition for a deadlock is defined as:

    1. AOnly one process may use a resource at a time
    2. BNo resource can be forcibly removed from process holding it
    3. CProcess holds a resource while awaiting for other resource
    4. DEach process holds resource needed by next process in chain

Description

2 Digital Technologies Quiz on OS Part 1 3, created by Bekinston Talgio on 03/07/2019.

Author

Bekinston Talgio

Language

English

Views

0

History

Created on 3 Jul 2019 · updated on 3 Jul 2019

Tags

digital technologies2

Rating

No ratings yet

Rate this quiz

Rate this quiz

More on Processes, Threads and Communication