(A) Shared page addresses
(B) Page addresses
(C) One Dimensional logical addresses
(D) Two Dimensional Logical Addresses
Related Posts 👇
-
According to the ring algorithm links between processes are:
(A) Bidirectional
(B) Unidirectional
(C) Both of the above
(D) None of the above
-
In distributed systems election algorithms assumes that:
(A) A unique priority number is associated with each active process in system
(B) There is no priority number associated with any process
(C) Priority of the processes is not required
(D) None of the above
-
In distributed systems transaction coordinator:
(A) Starts the execution of transaction
(B) Breaks the transaction into number of sub transactions
(C) Coordinates the termination of the transaction
(D) All of the above
-
In the token passing approach of distributed systems, processes are organized in a ring structure:
(A) Logically
(B) Physically
(C) Both of the above
(D) None of the above
-
For proper synchronization in distributed systems:
(A) Prevention from the deadlock is must
(B) Prevention from the starvation is must
(C) Both of the above
(D) None of the above
-
A process can enter into its critical section:
(A) Anytime
(B) When it receives a reply message from its parent process
(C) When it receives a reply message from all other processes in the system
(D) None of the above
-
If timestamps of two events are same then the events are?
(A) Concurrent
(B) Non-concurrent
(C) Monotonic
(D) Non-monotonic
-
In distributed systems, a logical clock is associated with?
(A) Each process
(B) Each instruction
(C) Each register
(D) All of the above