Question:

Objective: To implement resource allocation and demonstrate deadlock avoidance using the Banker's algorithm. Specification: The program simulates resource allocation to requesting processes and demonstrates deadlock avoidance with the Banker's algorithm. A menu controls the operations, and each choice calls the appropriate procedure, where the choices are: 1) Enter parameters 2) Run the Banker's algorithm to determine a safe sequence 3) Quit program and free memory Instructions: ? The program uses a claim graph consisting of processes, multi-unit resources, request edges, allocation edges, and claim edges to represent the state of allocated resources to processes. ? The graph can be represented by a set of arrays: o Resource vector: an m-element vector, where m is the number of resources and each entry resource[j] records the total number of units of resource j. o Available vector: an m-element vector, where m is the number of resources and each entry available[j] records the number of units of resource j that are available. o Max claims array: an nxm-element array, where m is the number of resources and n is the number of processes, and each entry maxclaim[i][j] contains an integer that records the maximum number of units of resource j that process i may ever request. o Allocation array: an nxm-element array, where m is the number of resources and n is the number of processes, and each entry allocation[i][j] contains an integer that records the number of units of resource j that process i has actually been allocated. o Need array: an nxm array, where m is the number of resources and n is the number of processes, and each entry need[i][j] contains an integer that records the number of units of resource j that process i may need in the future.

Is. [TED T} Which of the following are effective tools for managing software complexity? (Points : 4} {5' Dynamic and static binding (3' Inheritance and polymorphism '33 Encapsulation and instantiation IE3 Simulation and debugging I4. UGO T} Which statement is true of a class object whose class is derived public from a base class'? [Points : 4} If? The derived class object is also a base class object. @ The base class object is also a derived class object. (3' The derived class object has no relation to an object of its base class. {'3' It must have the same scope resolution of any and all the objects of its base class. 15. UGO T} ffa class has a pure virtual function, then _ [Points : 4} {'3' that class is an abstract class If? it is a derived class with multiple base classes if! any class derived from it cannot redene or override that function if?! it automatically has a virtual destructor is. [TCO T} Polymorphism means . [Points : 4} if?! having the ability to use the same expression to denote different operations IE? having multiple objects of the same class (If? that a derived class has more than one base class '3' creating new objects and classes from existing objects and classes 1?. I'L'I'CG B} What is the general syntax of the namespace denition statement? [Points : 4} l3 namespace namespace_name { members } if} using namespace namespace_name If} using namespace namespace_name; {{j. namespace std{ members } A. Differentiate between object and class. Demonstrate all components of a class diagram by 6 considering a model for a customer order from a retail catalog. b. Explain various elements of Use Case Diagram. Illustrate a Use case Diagram for Courseware 6 Management System