Question 421 :
In socket programming, client sends request to the server using which primitive?
- Socket
- Connect
- Send
- Receive
Question 422 :
_____________ is a physical clock synchronization Algorithm
- Cristian
- vector
- Lamport
- Ring
Question 423 :
________ Property of Distributed System offers services according to standard rules that describe the syntax and semantics of those services
- Openness
- Transparency
- Reliabilty
- Scalability
Question 424 :
Whatapp service uses which type of communication-
- Transient Synchronous communication
- Transient asynchronous communication
- Persistent synchronous communication
- Persistent asynchronous communication
Question 425 :
For each critical section (CS) execution, maekawa’s algorithm requires ___________ messages per CS execution and the Synchronization delay in the algorithm is ____________.
- √N , T
- 2√N , T
- 3√N , T
- 3√N , 2T
Question 426 :
Replication should be used when which of the following exist?
- When transmission speeds and capacity in a network prohibit frequent refreshing of large tables.
- When using many nodes with different operating systems and DBMSs and database designs.
- The application's data can be somewhat out-of-date.
- When using some nodes with selected operating system.
Question 427 :
Transparency that allows movement of resources and clients within a system is called ______.
- Concurrency
- Performance
- Replication
- Mobility
Question 428 :
X.500 is a
- directory services
- naming services
- Replication services
- Consistency services
Question 429 :
In global google sysytem The user can expect query result in
- 0.7 seconds
- 0.4 seconds
- 0.2 seconds
- 0.8 seconds
Question 430 :
A request, at the risk of server duplicating execution is _________.
- Never Reissue
- Always Reissue
- Reissue a request on acknoledgment
- Reissue a request on no acknoledgment
Question 431 :
In distributed systems, a logical clock is associated with
- each instruction
- each process
- each register
- none of the mentioned
Question 432 :
In Suzuki Kasami algorithm, __________ is guaranteed because there is only one token in the system and a site holds the token during the CS execution.
- Mutual Exclusion
- Performance
- Stability
- Scalability
Question 433 :
Which are the two complementary deadlock-prevention schemes using timestamps?
- The wait-die - wound-wait scheme
- The wait-n-watch scheme
- The wound-wait scheme
- The wait-wound - wound-wait scheme
Question 434 :
To manage replicated data, Front end provides transperancy
- by hiding fact that data is replicated.
- by issuing requests.
- by ensuring about data consistency.
- by contacting managers.
Question 435 :
A distributed locking protocol by which a resource can be protected against simultaneous access by a collection of processes that are distributed across-
- Multiple Processors
- Multiple Machines
- Shared memory
- Remote Procedure Call
Question 436 :
The file once created can not be changed is called ________
- immutable file
- mutex file
- mutable file
- Mutual exclusive file
Question 437 :
If processes p and q both receive messages m and m', then p receives m before m' if and only if q receives m before m'.The order delivery is called______________
- Absolute ordering
- Consistent ordering
- Causal ordering
- FIFO ordering
Question 438 :
A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.
- 1
- 2
- 3
- 4
Question 439 :
A typical _________ program creates some remote objects, makes references to these objects accessible, and waits for clients to invoke methods on these objects.
- Server
- Client
- Thread
- Concurrent
Question 440 :
Hide the failure and recovery of a resource is known as which transparency
- Failure
- Location
- Migration
- Relocation
Question 441 :
In NFS, all client-server communication is done through
- RPC
- RMI
- Message Oriented Communication
- Streams
Question 442 :
________consistency is fine if clients always access the same replica.
- Data-centric
- Client centric
- Eventual
- Entry
Question 443 :
Which transparency deals with providing efficient access to the system by hiding the implementation details.
- Location Tranparency
- Access Tranparency
- Network Tranparency
- Failure Tarnsparency
Question 444 :
What are the characteristics of transaction semantics?
- The users of this model are interested in the atomicity property for their transaction
- Suitable for applications that are concerned about coherence of data
- Easy to implement in a single processor system
- Write-back enhances access performance
Question 445 :
TCP is reliable _______ protocol which supports reliable point to point communication in distributed system.
- network
- transport
- communication
- system
Question 446 :
To organise file systems on disk _______________
- they are split into one or more partitions
- information about files is added to each partition
- they are made on different storage spaces
- they are made on same storage spaces
Question 447 :
What is not true about Persistent Communication
- Message submitted for transmission is stored by communication system for as long as it takes to deliver it to receiver
- Not necessary for receiver to be executing at the time message submission
- Not necessary for sender to continue execution after submitting a message
- Sender and receiver has to be active simultaneously
Question 448 :
The following statement 'Please give me load' is an example of which policy?
- Receiver initiated
- Sender Initiated
- Load estimation
- Load predication
Question 449 :
Which cache location gives Maximum performance gain for file systems
- Server’s main memory
- Client’s main memory
- Server’s Disk
- Client’s disk
Question 450 :
State whether the following statements are correct for the characteristics of monitor i) The local data variables are accessible not only by the monitors’ procedures but also by the external procedure. ii) A process enters the monitor by invoking one of its procedures. iii) Only one process may be excluded in the monitor at a time.
- i and ii only
- ii and iii only
- i and iii only
- All i, ii and iii