OS Part 2 1

1. 1Which one of the following is the address generated by CPU?

   1. Alogical address
   2. Bphysical address
   3. Cabsolute address
   4. Dnone of the above
2. 2What is the ready state of a process?

   1. Awhen process is scheduled to run after some execution
   2. Bnone of the above
   3. Cwhen process is using CPU
   4. Dwhen process is unable to run until some task has been completed
3. 3Mutual exclusion can be provided by the:

   1. Anone of the above maint
   2. Bmutex locks
   3. Cboth
   4. Dbinary semaphores
4. 4What is a long-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
5. 5Operating system maintains the page table for

   1. Aeach process
   2. Beach thread
   3. Ceach instruction
   4. Deach address
6. 6If a page number is not found in the TLB, then it is known as a:

   1. ATLB miss
   2. Bbuffer miss
   3. CTLB hit
   4. Dpage fault
7. 7Part of a program where the shared memory is accessed and which should be executed invisibly, is called:

   1. Asemaphores
   2. Bmutual exclusion
   3. Ccritical section
   4. Ddirectory
8. 8In memory systems, boundary registers?

   1. Atrack the beginning and ending of programs
   2. Btrack page boundaries
   3. Care only necessary with fixed partitions
   4. Dare used for temporary program variable storage
9. 9The resource vector defines

   1. Atotal amount of resources required for all processes
   2. Btotal amount of each resource in the system
   3. Ctotal amount of each resource allocated to all processes
   4. Dtotal amount of each resource NOT allocated to any process
10. 10When each process in the set is blocked awaiting for resource seized by another blocked process

    1. Ait is a deadend
    2. Bit is a deadlock
    3. Cit is a softlock
    4. Dit is a mortallock

11. 11The number of resources requested be a process:

    1. Amust exceed the total number of resources available in the system
    2. Bmust always be equal to the total number of resources available in the system
    3. Cmust not exceed the total number of resources available in the system
    4. Dmust always be less than the total number of resources available in the system
12. 12What is interprocess communication?

    1. Acommunication between two process
    2. Bcommunication between two threads of same process
    3. Cnone of the above
    4. Dcommunication within the process
13. 13The degree of multi-programming is:

    1. Athe number of processes executed per unit time
    2. Bthe number of processes in the I/O queue
    3. Cthe number of processes in the ready queue
    4. Dthe number of processes in memory
14. 14This matrix defines the amount of resources of type j requested by process i

    1. AAllocation matrix
    2. BResource matrix
    3. CRequest matrix
    4. DClaim matrix
15. 15To 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
16. 16Which process can be affected by other processes executing in the system?

    1. Ainit process
    2. Bcooperating process
    3. Cchild process
    4. Dparent process
17. 17Which of the following registers are used by the processor to exchange data with memory?

    1. AMAR and MBR
    2. BPC and IR
    3. CProgram status word
    4. DI/OAR and I/OBR
18. 18Which of the following registers are used by the processor to exchange data with input/output module?

    1. AMAR and MBR
    2. BPC and IR
    3. CProgram status word
    4. DI/OAR and I/OBR
19. 19The main disadvantage of this technique: consumes a lot of processor time, because every word

    1. ADirect memory access (DMA)
    2. BManual memory access
    3. CInterrupt-driven I/O
    4. DProgrammed I/O
20. 20The processor issues an I/O command to a module and then go on to some other useful work. The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor. The described technique is:

    1. ADirect memory access (DMA)
    2. BManual memory access
    3. CInterrupt-driven I/O
    4. DProgrammed I/O
21. 21Which of the following is not a technique possible for I/O operations?

    1. ADirect memory access (DMA)
    2. BManual memory access
    3. CInterrupt-driven I/O
    4. DProgrammed I/O
22. 22If a page table entry is not in main memory, then it is known as a:

    1. Apage fault
    2. Bbuffer miss
    3. CTLB hit
    4. DTLB miss
23. 23We have
    
Ts = average (system) access time

    T1 = access time of M1 (cache)
    
T2 = access time of M2 (main memory)
    
T3 = access time of M3 (disk)
    
H1 = hit ratio, fraction of time reference is found i M1
    
H2 = hit ratio, fraction of time reference is found i M2
    
The average time to access an item, in case the item in disk is:

    1. ATs = H1*T1 + H2*T2 + (1-H2)*T3
    2. BTs = H1*T1 + (1-H1)*(H1*T1 + H2*(T1 + T2) + (1 - H2)*(T2 + T3))
    3. CTs = H1*T1 + (1-H1)*H2*(T2 + T3)
    4. DTs = H1*T1 + (1-H1)*(H2*(T1 + T2) + (1 - H2)*(T1 + T2 + T3))
24. 24This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks:

    1. Areplacement algorithm
    2. Bwrite policy
    3. Ccache size
    4. Dlocality of reference
25. 25In operating system security and protection, Data integrity is:

    1. AConcerned with the proper verification of the identity of users and the validity of messages or data
    2. BAssuring that users cannot read data for which access is unauthorized
    3. CProtection of data from unauthorized modification
    4. DConcerned with protecting the system against interruption

Beschreibung

2 Digital Technologies Quiz am OS Part 2 1, erstellt von Bekinston Talgio am 03/07/2019.

Autor

Bekinston Talgio

Sprache

English

Aufrufe

0

Schlagwörter

digital technologies2

Bewertung

Noch keine Bewertungen

Bewerte dieses Quiz

Bewerte dieses Quiz

Mehr zu Processes, Threads and Communication