Q.No.4: Draw a Resource Allocation Graph (RAG) for a given scenario and find that whether it contains a deadlock or not. Find all cycles in the RAG. Resources: Printer (R1), Hard Disk (R2), CPU (R3) and RAM (R4) Processes: MS Excel (P1), MS Word (P2), Media Player (P3) and Calculator (P4) ·       Resources: Printer = 1, Hard Disks = 2, CPU = 1, RAM = 1 ·       MS Excel Holds Printer and wait for CPU and RAM. ·       MS Word holds Hard Disk and RAM and waits for Printer and CPU. ·       Media Player waits for Hard Disk. ·       Calculator holds CPU. Write cycles in RAG if any?

A medical Centre can have many doctors. A doctor can be scheduled for many appointments but may not have any scheduled appointment at all. A patient can schedule request for one or more appointments. However, every appointment is about only one patient. As a result of every appointment, there must be a bill. One payment is applied to exactly 1 bill, and 1 bill can be paid off over time by several payments. A bill can be outstanding, having nothing yet paid on it at all. One patient can make many payments, but a single payment is made by only 1 patient. Some patients are insured by an insurance company. If they are insured, they can only carry insurance with one company. An insurance company can have many patients carry their policies. For patients that carry insurance, the insurance company will make payments, each single payment is made by exactly 1 insurance company. (Hint: final ERD must include 7 tables.) a) Identify the entities with attributes and keys (primary and foreign keys).…

Consider a computer system with three users: Alice, Bob, and Cyndy. Alice owns the file alicerc, and Bob and Cyndy can read it. Cyndy can read and write the file bobrc, which Bob owns, but Alice can only read it. Only Cyndy can read and write the file cyndyrc, which she owns. Assume that the owner of each of these files can execute it. Create the corresponding access control matrix. Cyndy gives Alice permission to read cyndyrc, and Alice removes Bob's ability to read alicerc. Show the new access control matrix

Q3. We have a classification problem with four classes of input vector. The four classes are Class1: {[1 1], [1 2]}; Class 2: {[2 -1], [2 0]}; Class 3: {[-1 2], [-2 1]}; Class 4: {(-1 -1], [-2 - ( 2]}.Design a perceptron network to solve this problem.

An operating system has processes P1, P2, P3, and P4 and resources R1 (one resource), R2 (one resource), R3 (two resources), and R4 (three resources). The notation (1, 1), (2, 2), (1, 2) means that P1 requests R1, then P2 requests R2, then P1 requests R2. Note that the first two requests produce allocation edges on the resource allocation graph, but the third request produces a request edge on the graph because R2 is already allocated to P2. Draw the resource allocation graph after each sequence of requests. State whether the graph contains a cycle. If it does, state whether it is a deadlock cycle. *(a) (1, 1), (2, 2), (1, 2), (2, 1) *(b) (1, 4), (2, 4), (3, 4), (4, 4) (c) (1, 1), (2, 1), (3, 1), (4, 1) (d) (3, 3), (4, 3), (2, 2), (3, 2), (2, 3) (e) (1, 2), (1, 3), (1, 4), (2, 2), (2, 3), (2, 4) (f) (2, 1), (1, 2), (2, 3), (3, 3), (2, 2), (1, 3) (g) (2, 1), (1, 2), (2, 3), (3, 3), (2, 2), (1, 3), (3, 1) (h) (1, 4), (2, 3), (3, 3), (2, 1), (3, 4), (1, 3), (4, 4), (3, 1), (2, 4) (i) (1,…

Consider an airport management system. Each airport has a unique id (e.g. Montreal:YUL). Let us introduce the types AIRPORT and CITY . We also introduce variable airports that contains associations between airport id’s and their corresponding host cities. A possible state of the system is shown below:airports ={YUL → Montreal,LCY → London_UKLHR → London_UK,MIL → Milan,SFO → San_Francisco,SDQ → Santo_Domingo}1. (PROGRAMMING) Define global variable airports in Common LISP and populate it with the above data. Demonstrate that the variable indeed contains the ordered pairs as shown above.2. Provide a declaration of variable monitored that holds all airport id’s.3. What kind of variable is airports? Provide a formal definition together with any and all applicable properties.4. Describe what data structure you would deploy to model variable airports. Note that you may not use a Dictionary. Should this be an ordered or an unordered structure? Discuss.5. Provide a formal specification of the…

Given the following UML diagram: Student - studentID: String + getStudentID(): String + toString(): String Person - lastName: String - firstName: String - dateOfBirth: Date - address: Address + getName(): String + getDOB(): Date + getAddress(): Address + toString(): String Professor - employeeID: String +getEmployelD(): String +toString(): String Write an implementation for the class Professor. DO NOT include or implement any constructor for this class. There are no abstract methods/classes in this example. toString method will return any simple String that contains firstName and employeelD only; no less, no more!! Assume firstName was defined as protected in class Person. You are not allowed to add implementation for any class or methods other than what is listed in the question statement.

Need a implementation plan for this :   Our aim is to take increase toy paratrooper flight time with the parachutes provided and find suitable alternatives to reduce its descent through the most feasible means. The justification for increased flight time being if we were to take these model paratroopers to represent actual paratroopers' lower descent speeds will provide safer landings and more maneuverable descents. We learned through observation that our paratrooper's initial descent is practically freefall and extremely erratic which gives us our main point of optimization. Our only variables which we can alter are wind resistance provided by said parachute, elevation, conditions(temperature) within a margin, and weight. We will make alterations where it is possible to reach our goal of a practical lower descent speed and thereby an increase in descent time and more stable, safe flight for our toy paratroopers.

q18

Consider navigating the maze shown below. 3. 4. (z) 1. S 2. A 5. N L M G B F H 6. D 7. P 2 8. G 2 4 C E P 2 2 2 A S The maze is represented as a graph with edge costs as shown on the edges. The edge cost is 1 for all edges where the cost is not shown. Let S be the initial state and G be the goal state. List the first 8 vertices expanded by Uniform Cost Search (enter the single letter label of a node). B FL K 2 2 J 2 D H