What problem is solved by Dijkstra's banker's algorithm?
Options
A. mutual exclusion
B. deadlock recovery
C. deadlock avoidance
D. cache coherence
E. None of the above
Correct Answer
deadlock avoidance
Explanation
The Banker's algorithm is a resource allocation & deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of pre-determined maximum possible amounts of all resources, and then makes a "safe-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
More questions
1. The newline character is always included between
A. Gateways are assumed to know correct routes; hosts begin with minimal routing information and learn new routes from gateways.
B. Layered protocols are designed so that layer n at the destination receives exactly the same object sent by layer n at the source.
C. Application programs as well as all protocol software from the Internet layer upward use only IP addresses; the network interface layer handles physical addresses.
3. Your network contains NetWare 4.0 Servers. You have successfully installed Client Service for NetWare on Windows 2000 Professional computers, and Gateway Service for NetWare on Windows 2000 Server Computers. You recently added a new Windows 2000 Server computer to the network and installed Gateway Service for NetWare on it. However, the server is unable to connect to any NetWare servers. What should you do on the new Windows 2000 Server computer to resolve this problem?
Options
A. Enable NWLink NetBIOS
B. Configure the NWLink IPX/SPX/ NetBIOS Compatible Transport Protocol to use the correct Ethernet frame type