OS Part 1 2

1. 1A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem?

   1. Atwo
   2. Bthree
   3. Cone
   4. Dfour
2. 2This resource can be created and destroyed

   1. Aresumable resource
   2. Brestartable resource
   3. Cconsumable resource
   4. Dfinite resource
3. 3Fixed-length block of data in secondary memory is called:

   1. Anone of the above
   2. Bframes
   3. Csegments
   4. Dpages
4. 4A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executing, is known as?

   1. AMultitasking
   2. BSemaphore
   3. CMutual exclusion
   4. Dmultiprogramming
5. 5Every address generated by the CPU is divided into two parts:

   1. Aframe offset
   2. Bpage number
   3. Cframe bit
   4. Dpage offset
6. 6Segmentation suffers from external fragmentation?

   1. AVerdadero
   2. BFalso
7. 7For each process OS creates and manages:

   1. AProcess control block
   2. BProgram code
   3. CProgram
   4. DThread control block
8. 8What is a trap/exception?

   1. Auser generated interrupt caused by an error
   2. Bfailure of the system
   3. Chardware generated interrupt caused by an error
   4. Dsoftware generated interrupt caused by an error
9. 9What is the reusable resource:

   1. Anone of the above
   2. Bthat can be used by more than one process at a time
   3. Cthat can be used by one process at a time and is not depleted by that use
   4. Dthat can be shared between various threads
10. 10Interprocess communication:

    1. Anone of the above
    2. Ballows the processes to only synchronize their actions without communication
    3. Callows processes to communicate and synchronize their actions when using the same address space
    4. Dallows processes to communicate and synchronize their actions without using the same address space

11. 11Which of the following transitions is not possible?

    1. Ablocked to running
    2. Brunning to blocked
    3. Cblocked to ready
    4. Dready to running
12. 12Any program, no matter how small, will occupy an entire partition results in:

    1. Ainternal fragmentation
    2. Bsegmentation
    3. Cpaging
    4. Dexternal fragmentation
13. 13This matrix defines requirements of processes i for the resources j

    1. AAllocation matrix
    2. BResource matrix
    3. CRequest matrix
    4. DClaim matrix
14. 14Several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called a(n) _____

    1. AEntry section
    2. Brace section
    3. Cshared memory segments
    4. Dprocess synchronization
15. 15The context of a process in the PCB of a process DOES NOT contain:

    1. Acontext switch time
    2. Bthe process state
    3. Cmemory-management information
    4. Dthe value of the CPU registers
16. 16External fragmentation will not occur when:

    1. Ano matter which algorithm is used, it will always occur
    2. Bfirst fit is used
    3. Cbest fit is used
    4. Dnext fit is used
17. 17A deadlock avoidance algorithm dynamically examines the _____, to ensure that a circular wait condition can never exist

    1. Aresources
    2. Boperating system
    3. Cresource allocation state
    4. Dsystem storage state
18. 18The process control block is:

    1. Aprocess type variable
    2. Bdata structure
    3. Cblock in memory
    4. Dsecondary storage section
19. 19This illustrates the progress of two processes competing for two resources:

    1. Ajoint process diagram
    2. Bjoint ingres diagram
    3. Cjoint regress diagram
    4. Djoint progress diagram
20. 20In a multiprogramming environment:

    1. Athe programs are developed by more than one person
    2. Bmore than one process resides in the memory
    3. Csingle user can execute many programs at the same time
    4. Dthe processor executes more than one process at a time
21. 21When high priority task is indirectly preempted by medium priority task effectively inverting the relative priority of the two tasks, the scenario is called:

    1. Apriority exchange
    2. Bpriority inversion
    3. Cpriority removal
    4. Dpriority modification
22. 22Main memory is broken into fixed-sized blocks called _____

    1. Anone of the above
    2. Bpages
    3. Cframes
    4. Dsegments
23. 23The first fit, best fit and worst fit are strategies to select a

    1. Aprocess from a queue to put in memory
    2. Ball of the above
    3. Cfree hole from a set of available holes
    4. Dprocessor to run the next process
24. 24The Banker’s algorithm is referred to as

    1. Adenial of service
    2. Bresource allocation denial
    3. Cloan allocation denial
    4. Dresource allocation refusal
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

Descripción

2 Digital Technologies Test sobre OS Part 1 2, creado por Bekinston Talgio el 03/07/2019.

Autor

Bekinston Talgio

Idioma

English

Visitas

0

Etiquetas

digital technologies2

Valoración

Aún sin valoraciones

Valora este test

Valora este test

Más sobre Processes, Threads and Communication