Monitor is an Interprocess Communication (IPC) technique which can be described as
| A. |
It is higher level synchronization primitive and is a collection of procedures, variables, and data structures grouped together in a special package .
|
| B. |
It is a non-negative integer which apart from initialization can be acted upon by wait and signal operations
|
| C. |
It uses two primitives, send and receive which are system calls rather than language constructs.
|
| D. |
It consists of the IPC primitives implemented as system calls to block the process when they are not allowed to enter critical region to save CPU time.
|
|
Option: D Explanation : Click on Discuss to view users comments. |
In a distributed computing environment, distributed shared memory is used which is
| A. | Logical combination of virtual memories on the nodes. |
| B. | Logical combination of physical memories on the nodes. |
| C. | Logical combination of the secondary memories on all the nodes. |
| D. | All of the above |
|
Option: D Explanation : Click on Discuss to view users comments. |
Equivalent logical expression for the Well Formed Formula (WFF), ~(∀ x)F[x] is
| A. | (∀ x) ~F[x] |
| B. | ~( ∃ x) F[x] |
| C. | ( ∃ x)~ ( F[x]) |
| D. | (∀ x)F[x] |
|
Option: C Explanation : Click on Discuss to view users comments. |
An A * algorithm is a heuristic search technique which
| A. | is like a depth-first search where most promising child is selected for expansion |
| B. |
generates all successor nodes and computes an estimate of distance (cost) from start node to a goal node through each of the successors. It then chooses the successor with shortest cost.
|
| C. |
saves all path lengths (costs) from start node to all generated nodes and chooses shortest path for further expansion.
|
| D. | None of the above |
|
Option: B Explanation : Click on Discuss to view users comments. |
