Distributed Computing System MCQ
1. In distributed system, each processor has its own ___________
a) local memory
b) clock
c) both local memory and clock
d) none of the mentioned.
2. If one site fails in distributed system then ___________
a) the remaining sites can continue operating
b) all the sites will stop working
c) directly connected sites will stop working
d) none of the mentioned
3. Network operating system runs on ___________
a) server
b) every system in the network
c) both server and every system in the network
d) none of the mentioned
p
4. Which technique is based on compile-time program transformation for accessing remote
data in a distributed-memory parallel system?
a) cache coherence scheme
b) computation migration
Ap
c) remote procedure call
at
d) message passing
H
5. Logical extension of computation migration is ___________
a) process migration
b) system migration
le
c) thread migration
d) data migration
rp
6. Processes on the remote systems are identified by ___________
a) host ID
Pu
b) host name and identifier
c) identifier
d) process ID
7. Which routing technique is used in a distributed system?
a) fixed routing
b) virtual routing
c) dynamic routing
d) all of the mentioned
8. In distributed systems, link and site failure is detected by ___________
a) polling
b) handshaking
c) token passing
d) none of the mentioned
9. The capability of a system to adapt the increased service load is called ___________
a) scalability
b) tolerance
c) capacity
d) none of the mentioned
10. Internet provides _______ for remote login.
a) telnet
b) http
c) ftp
d) rpc
11. What is Inter process communication?
a) allows processes to communicate and synchronize their actions when using the same
address space
b) allows processes to communicate and synchronize their actions without using the same
address space
c) allows the processes to only synchronize their actions without communication
d) none of the mentioned.
12. Message passing system allows processes to __________
a) communicate with one another without resorting to shared data
b) communicate with one another by resorting to shared data
c) share data
d) name the recipient or sender of the message.
p
13. Which of the following two operations are provided by the IPC facility?
a) write & delete message
b) delete & receive message
c) send & delete message
d) receive & send message.
Ap
at
14. Messages sent by a process __________
H
a) have to be of a fixed size
b) have to be a variable size
c) can be fixed or variable sized
le
d) None of the mentioned
15. The link between two processes P and Q to send and receive messages is called
rp
__________
a) communication link
Pu
b) message-passing link
c) synchronization link
d) all of the mentioned.
16. Which of the following are TRUE for direct communication?
a) A communication link can be associated with N number of process(N = max. number of
processes supported by system)
b) A communication link can be associated with exactly two processes
c) Exactly N/2 links exist between each pair of processes(N = max. number of processes
supported by system)
d) Exactly two link exists between each pair of processes.
17. In indirect communication between processes P and Q __________
a) there is another process R to handle and pass on the messages between P and Q
b) there is another machine between the two processes to help communication
c) there is a mailbox to help communication between P and Q
d) none of the mentioned.
18. In the non blocking send __________
a) the sending process keeps sending until the message is received
b) the sending process sends the message and resumes operation
c) the sending process keeps sending until it receives a message
d) none of the mentioned
19. In the Zero capacity queue __________
a) the queue can store at least one message
b) the sender blocks until the receiver receives the message
c) the sender keeps sending and the messages don’t wait in the queue
d) none of the mentioned.
20. The Zero Capacity queue __________
a) is referred to as a message system with buffering
b) is referred to as a message system with no buffering
c) is referred to as a link
d) none of the mentioned
21. In distributed system, each processor has its own ___________
a) local memory
b) clock
c) both local memory and clock
p
d) none of the mentioned
a) the remaining sites can continue operating
b) all the sites will stop working
Ap
22. If one site fails in distributed system then ___________
at
c) directly connected sites will stop working
d) none of the mentioned
H
23. Network operating system runs on ___________
a) server
le
b) every system in the network
c) both server and every system in the network
rp
d) none of the mentioned
24. Which technique is based on compile-time program transformation for accessing
Pu
remote data in a distributed-memory parallel system?
a) cache coherence scheme
b) computation migration
c) remote procedure call
d) message passing
25. Logical extension of computation migration is ___________
a) process migration
b) system migration
c) thread migration
d) data migration
26. Processes on the remote systems are identified by ___________
a) host ID
b) host name and identifier
c) identifier
d) process ID
27. In distributed systems, link and site failure is detected by ___________
a) polling
b) handshaking
c) token passing
d) none of the mentioned
28. The capability of a system to adapt the increased service load is called
___________
a) scalability
b) tolerance
c) capacity
d) none of the mentioned
29. Internet provides _______ for remote login.
a) telnet
b) http
c) ftp
p
d) rpc
a) 128; 128 or 256
b) 64; 128 or 192
c) 256; 128, 192, or 256
Ap
Q.30 AES uses a ____________ bit block size and a key size of __________ bits.[2m]
at
d) 128; 128, 192, or 256
H
Q.31 Like DES, AES also uses Feistel Structure. [2m]
a) True
b) False
le
Q.32 How many rounds does the AES-192 perform? [2m]
rp
a) 10
b) 12
Pu
c) 14
d) 16
Q.33 What is the expanded key size of AES-192? [2m]
a) 44 words
b) 60 words
c) 52 words
d) 36 words
Q.34 The 4×4 byte matrices in the AES algorithm are called[2m]
a) States
b) Words
c) Transitions
d) Permutations
Q.35. In AES the 4×4 bytes matrix key is transformed into a keys of size
__________[1m]
a) 32 words
b) 64 words
Q.36In distributed systems, a logical clock is associated with ______________[2m]
a) each instruction
b) each process
c) each register
d) none of the mentioned
Q.37 If timestamps of two events are same, then the events are ____________[2m]
a) concurrent
b) non-concurrent
c) monotonic
d) non-monotonic
Q.38 If a process is executing in its critical section ____________[2m]
a) any other process can also execute in its critical section
b) no other process can execute in its critical section
c) one more process can execute in its critical section
d) none of the mentioned
p
Q.39 A process can enter into its critical section ____________[2m]
a) anytime
Ap
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 mentioned
at
Q.40 For proper synchronization in distributed systems ____________[1m]
H
a) prevention from the deadlock is must
b) prevention from the starvation is must
c) prevention from the deadlock & starvation is must
le
d) none of the mentioned
rp
Q.41. In distributed system each processor has its own[1m]
a) local memory
Pu
b) clock
c) both local memory and clock
d) none of the mentione
Q.42 If one site fails in distributed system[1m]
a) the remaining sites can continue operating
b) all the sites will stop working
c) directly connected sites will stop working
d) none of the mentioned
Q. 43What are the characteristics of tightly coupled system? [1m]
i) Same clock, usually shared memory
ii) Communication is via this shared memory
iii) Multiprocessors
iv) Different clock
a) i
b) i, ii and ii
c) ii and iii
d) i, iii and iv
Q. 44What are the characteristics of tightly coupled system? [1m]
i) Different clock
ii) Use communication links
iii) Same clock
iv) Distributed systems
Q.45 What are the characteristics of mutual exclusion using centralized approach? [1m]
a) One processor as coordinator which handles all requests
b) It requires request, reply and release per critical section entry
c) The method is free from starvation
d) All of the mentioned
Q.46 What are the parts of a global unique identifier? [1m]
p
a) Local unique timestamp
b) Remote timestamp
c) Clock number
d) All of the mentioned
Ap
at
H
c) 54 words
d) 44 words
le
Q.47 There is an addition of round key before the start of the AES round algorithms.
[1m]
rp
a) True
b) False
Pu
Q.48How many modes of operation are there in in DES and AES? [1m]
a) 4
b) 3
c) 2
d) 5
Q.49 Which one of the following modes of operation in DES is used for operating short
data? [1m]
a) Cipher Feedback Mode (CFB)
b) Cipher Block chaining (CBC)
c) Electronic code book (ECB)
d) Output Feedback Modes (OFB)
Q.50Which of the following statements are true[1m]
i) In the CBC mode, the plaintext block is XORed with previous ciphertext block before
encryption
ii) The CTR mode does not require an Initialization Vector
iii) The last block in the CBC mode uses an Initialization Vector
iv) In CBC mode repetitions in plaintext do not show up in ciphertext
p
Ap
at
H
le
rp
Pu
