86.

87.

91.

Consider a fully associative cache with 8 cache blocks (numbered 0-7) and the following
sequence of memory block requests : 4, 3, 25, 8, 19, 6, 25, 8, 16, 35, 45, 22, 8, 3, 16, 25, 7 if
LRU replacement policy is used ,which cache block will have memory block 77

ங்க @ 5

© 6 o 7

Two shared resources R: and Rz are used by processes Pi and Pz. Each process has a certain
priority for accessing each resource. Let Ty denote the priority of P; for accessing R;. A process
Pi can snatch a resource Rk from process P; if Tix is greater than ‏ضرا‎ Given the following :

1 Tu>Ta

1] Tu>Tz
111 TuIV மடில
Which of the following conditions ensures that Py and Pz can never deadlock?
(ಗ) TandIV (೫) 11೩84 111
(0 18೧611 (D) None of the above
Dijkstra’s banking algorithm in an OS, solves the problem of :
(ಗಿ) Deadlock avoidance 3 (18) Deadlock recovery
(C) Mutual exclusion (D) Context switching
In real-time OS, which of the following is the most suitable scheduling scheme?
(2) Round Robin (B) First Come First Serve
(ര Preemptive (D) Random Scheduling
A linker :
(&) Is not necessary with variable partitions (B) Must be run after the loader
(0) Creates a load module (D) Is not needed with a good compiler
A firewall :

(ಗ) Is a computer or router that sits between the trusted and untrusted

(B) It limits network access between the two security domains, maintains and logs all
connections

(C) A firewall may need to allow http to pass

(D) All of these

A sender is employing public key cryptography to send a secret message to a receiver. Which
one of the following statements is TRUE?

(ಗ) Sender encrypts using receivers public key

(B) Sender encrypts using his own public key

(C) Receiver decrypts using senders public key

(D) Receiver decrypts using his own public key

13 140/2016
[7.7.೧.]