ostest

1. 1In the blocking send, blocking receive

   1. Aboth sender and receiver are blocked until message is delivered
   2. Bnone of the above
   3. Cthe sending process sends the message and resumes operation
   4. Dthe sending process sends the message while receiver is blocked
2. 2The table _____ contains the base address of each page in physical memory

   1. Aprocess
   2. Bmemory
   3. Cpage
   4. Dframe
3. 3A state is safe, if:

   1. Athe system can allocate resources to each process in some order and still avoid
      deadlock
   2. B● the system does not crash due to deadlock occurrence
   3. C● the state keeps the system protected and safe
   4. D● all of the above
4. 4In fixed sized partition, the degree of multiprogramming is bounded by ____
   

   1. Athe memory size
   2. B● all of the above
   3. C● the number of partitions
   4. D● the CPU utilization
5. 5. _____ is generally faster than_____
   

   1. A● worst fit, best fit
   2. B● best fit, first fit
   3. Cfirst fit, best fit
   4. Dnone of the above
6. 6The two atomic operations permissible on semaphores are: (several answer)

   1. Await
   2. Bsignal
   3. Chold
   4. Dstop
7. 7.This resource can be safely used by only one process at a time and is not depleted
   by that use:

   1. Arefurbished resource
   2. Breplenishing resource
   3. Creusable resource
   4. Drefreshing resource
8. 8Which of the following condition is required for the deadlock to be possible?

   1. Amutual exclusion
   2. Ball of the above
   3. Cno resource can be forcibly removed from a process holding it
   4. Da process may hold allocated resources while awaiting assignment of other
      resources
9. 9The ________ is used as an index into the page table

   1. Apage number
   2. Bpage offset
   3. Cframe bit
   4. Dframe offset
10. 10Suppose that a process is in “Blocked” state waiting for some I\O service. When a
    service is completed, it goes to the:
    

    1. AReady state
    2. BRunning state
    3. CTerminated state
    4. DSuspended state

11. 11A problem encountered in multitasking when a process is perpetually denied
    necessary resources is called:
    

    1. Astarvation
    2. Bdeadlock
    3. Caging
    4. Dinversion
12. 12The memory allocation scheme subject to “internal fragmentation” is:

    1. Asegmentation
    2. Bvirtual memory segmentation
    3. Cfixed partitioning
    4. Dpure demand paging
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 partitionings
    4. Dpure demand paging
15. 15When 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
16. 16With paging there is no _____ fragmentation
    

    1. Aeither type of
    2. Bnone of the above
    3. Cexternal
    4. Dinternal
17. 17Mutual exclusion means that:

    1. Aif a process is executing in its critical section, then other processes must be
       executing in their critical section
    2. Bif a process is executing in its critical section, then all the resources of the system
       must be blocked until it finishes exclusion
    3. Cif a process is executing in its critical section, then no other process must be
       executing in their critical sections
    4. Dnone of the above
18. 18The segment of code in which the process may change common variables, update
    tables, write into files known as:
    

    1. Acritical section
    2. Bprogram
    3. Cnon-critical section
    4. Dmutual exclusion
19. 19Semaphores:

    1. Aare used for memory management
    2. Bsynchronize critical resources to prevent deadlock
    3. Care used to do I/O
    4. Dsynchronize critical resources to prevent contention
20. 20Interprocess communication:
    

    1. Aallows process to synchronize activity
    2. Bis never necessary
    3. Cis usually done via disk drives
    4. Dis required for all processes
21. 21A task in a blocked state

    1. Ais running
    2. Bis executable
    3. Cmust still be placed in the run queues
    4. Dis waiting for same temporarily unavailable resources
22. 22The systems which allows only one process execution at a time, are called:

    1. Aunitasking systems
    2. Buniprocessing systems
    3. Cuniprogramming systems
    4. Dnone of the above
23. 23Which one of the following is the address generated by CPU?
    

    1. Alogical address
    2. Bphysical address
    3. Cabsolute address
    4. Dnone of the above
24. 24To avoid the race condition, the number of processes that may be
    simultaneously inside their critical section is:
    

    1. A10
    2. B0
    3. C1
    4. D2
25. 25The figure below illustrates a partial program execution

    

    1. ALoad 3 to AC from the memory
    2. BAdd 3 to AC from the memory
    3. CStore 3 to AC from the memory
    4. DAdd 2 to AC from the memory
26. 26Choose the micro-instructions that reflect instruction execution stage shown
    in the figure below

    

    1. AIR -> MAR 941
       M -> MBR 0002
       MBR ->AC 0005
    2. BPC -> MAR 301
       M -> I/OBR 5941
       I/OBR 5941
    3. CIR -> MAR 941
       M -> MBR 0002
       MBR -> AC 0002
    4. DPC -> MAR 302
       M -> MBR 2941
       MBR -> IR 2941
27. 27The following figure demonstrates:

    

    1. AInterrupts; fast I/O wait
    2. BInterrupts; slow I/O wait
    3. CNo interrupts
    4. DInterrupts; long I/O wait
    5. EInterrupts; short I/O wait
28. 28As one goes down the memory hierarchy

    

    1. Aincreasing frequency of access to the memory by the processor
    2. Bincreasing cost per bit
    3. Cdecreasing access time
    4. Dincreasing capacity
29. 29The figure a) demonstrates the program timing diagram for:
    

    

    1. AInterrupts; fast I/O wait
    2. B.Interrupts; slow I/O wait
    3. CNo interrupts
    4. DInterrupts; long I/O wait
    5. EInterrupts; short I/O wait
30. 30‘Lost signals, duplicate signals received’. This is

    1. AImproper synchronization
    2. BNondeterminate program operation
    3. CDeadlocks
    4. DFailed mutual exclusion

Descripción

Test sobre ostest, creado por Bekinston Talgio el 02/07/2019.

Autor

Bekinston Talgio

Idioma

English

Visitas

1

Etiquetas

2

Valoración

Aún sin valoraciones

Valora este test

Valora este test

Más sobre Processes, Threads and Communication