1_____ Counting Semaphore is used to ensure Mutual Exclusion 2 ____ Mutual Exclu

Question

1_____ Counting Semaphore is used to ensure Mutual Exclusion

2 ____ Mutual Exclusion can be implemented through semaphore, monitor but not message passing.

3 ____ The address used to identify an application in a computer host using TCP/IP

communication protocol is called IP address

4 ____ Critical Section is the shared data NOT the code which modify or access

the share data (shared among processes or threads).

5 ____ Mutual Exclusion can be implemented using Counting Semaphore with initial Semaphore value = N>1.

6 ____ Compared with TCP, UDP requires OS kernel do less work and not need kernel IP Processing Module

7 ____ Race Condition means multiple processes that share data wait each other in a “deadlock” situation.

8 ____ Compare TCP and UDP communication, TCP is like sending a letter through post system, while UDP is like making a phone call.

9 ____ Window NT with domain controller is one type of Network Operating System.

10 ____ System Call will be performed by software API library and most will not invoke OS kernel.

11 ____ In Public Key system, receiver has three keys: its own private key, public key and sender private key

12_____Binary Semaphore can have more than two values

13_____Message Passing can enable process to process communication but can not ensure Mutual Exclusion

14_____Shared memory is a private memory segment of the process that made shmget() system call so other process cannot access it.

15____ Monitor can be used to ensure mutual exclusion and synchronization among multiple threads

16____ Message Passing among process or thread is the foundation of networking.

17 ____ OS Design Principle include Reliability, Fairness, Flexibility but not Scalability.

18 ____ In Public Key based Digital Signature scheme, receiver side use two keys to process incoming message:

its own private key and its own public key

19____ In Public Key based encryption scheme, sender use two keys to encrypt the message: its own public key and receiver’s private key.

20 ____Deadlock means: Some of the agents ( process or thread) that shared data may never get chance to access the shared data.

21 ____The following scenarios is Race Condition: in an application, agents (process or thread) using shared data compete to access the shared data and the computing result is agent execution scheduling dependent.

Explanation / Answer

1. T (set N = 1) 2. F (depends on algorithm..) 3. T 4. T 5. F (must be 1) 6. T (UDP is less programmatically intense) 7. F (simply means output depends on timing of events and can go bad due to that) 8. F (other way) 9. T 10. F (system call is internal to OS) 11. F (public only) 12. F (0/1...) 13. F 14. F (it is shared) 15. T 16. T 17. F 18. T 19. F (only private) 20. F (deadlock means that two processes wait trying to access each other's locks, they might get the data, we have to break the deadlock somehow) 21. T Pls rate :)

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.