Please answer the following Operating Systems Question, Correctly and Completely: Suppose four cars each approach an intersection from four different directions simultaneously. Each corner of the intersection has a stop sign. Assume that traffic regulations require that when two cars approach adjacent stop signs at the same time, the car on the left must yield to the car on the right. Thus, as four cars each drive up to their individual stop signs, each waits (indefinitely) for the car on the left to proceed. Is this anomaly a communication deadlock? Is it a resource deadlock? * Please answer correctly and I will provide a Thumbs Up. Thanks.

An industrial robot that places components on a printed circuit board has FIVE failsafe sensors. The robot should keep functioning unless any of the following conditions arise: If sensor A and sensor B are activated at the same time the system shuts down. If sensor B and sensor C are activated at the same time the system shuts down. If sensor C and sensor D are activated at the same time the system shuts down. If sensor D and sensor E are activated at the same time the system shuts down. X=Robot State (a) Write and complete the truth table for this design and write system. the resulting Boolean equation for this

In a robotic laboratory of one university, the lab members are testing mobile robots. Each robot has a radio transmitter that it uses to communicate with a base station, and they find that if the robots get too close to one another, then there are problems with interference among the transmitters. So a problem arises: how to plan the motion of the robots in such a way that each robot gets to its intended destination, but in the process the robots don’t come close enough together to cause interference problems. This problem could be modeled as: suppose that we have an undirected graph G=(V,E), representing the floor plan of a building, and there are two robots initially located at nodes a and b in the graph. The robot at node a wants to travel to node c along a path in G, and the robot at node b wants to travel to node d. This is accomplished by means of a schedule: at each time step, the schedule specifies that one of the robots moves across a single edge, from one node to a…

Consider the following network: a.) Find the shortest path from node 1 to node 8 using Dijkstra’s algorithm. Write the length of the shortest path as well as the edges that compose it. b.) Write an integer programming formulation to find the second-shortest path from 1 to 8 in this network. (Hint: if the shortest path is not available, the second-shortest path becomes the shortest path.)

2. Forces are expressed as complex numbers and at a static point multiple forces will sum to zero. Compute the tension in a cable that is being pulled to the right as (T * 12 +Tj)and being pulled to the left as( -T * 12 + Tj). It T = 1000 lbs, what weight will it support with the weight pulling down at in the -i direction. W = sum ( tension vectors)

dsfr

A service station has both self-service and full-service islands. On each island, there is a single regular unleaded pump with two hoses. Let X denote the number of hoses being used on the self-service island at a particular time, and let Y denote the number of hoses on the full-service island in use at that time. The joint pmf of X and Y appears in the accompanying tabulation. p(x, y) 0 1 2 0 0.10 0.05 0.01 x 1 0.06 0.20 0.07 2 0.06 0.14 0.31 (a) What is P(X = 1 and Y = 1)? P(X = 1 and Y = 1) = | (b) Compute P(X ≤ 1 and Y < 1). P(X ≤1 and Y < 1) = (c) Give a word description of the event { X0 and Y + 0 }. One hose is in use on one island. One hose is in use on both islands. At least one hose is in use at both islands. At most one hose is in use at both islands. Compute the probability of this event. P(X +0 and Y 0) = [ (d) Compute the marginal pmf of X. x 0 Px(x) Compute the marginal pmf of Y. y Py(y) 0 Using Px(x), what is P(X ≤ 1)? P(X ≤ 1) = = 1 2 1 2

On the Christmas eve, Santa Claus will start working to deliver gifts to the lovely kids. Different from previous years that he secretly delivered the gifts, this year, he indeed wants to openly deliver the gifts to the kids and wish them a merry Christmas when delivering the gifts. However, the kids each have very different sleep schedules. Kid i is awake only in a single closed time interval [ai, bi]. Santa doesn’t want to disturb the sleeping kids, so each time he will find an awake kid, give the gift to the kid, wish the kid a merry Christmas, and talk with the kid until he/she falls asleep.  However, Santa does want to meet and talk with as many kids as possible. Design a greedy algorithm which takes as input the number of kids n, and the n lists of intervals [ai, bi], and outputs the maximum number of kids m that Santa can talk to. You are expected to write the pseudocode of your algorithm.

In the desert there is a jail. After rebellion the single guard has been immobilized. He watched helplessly how prisoners left one by one with different speed in different directions. Later he free himself and took a motobike with extra seat. Now he can follow footprints and pick up one prisoner at a time and bring them back to jail. Each prisoner moves with constant individual speed v_i and left the jail at time t_i. In which order the guard should bring the prisoners back in order to minimize the time?

in1 in2 out 1 1 0 1 2 1 2 1 1 2 2 0 2. Can you perform the task above using a radial basis function network with a basis function given as follows: øj (X) = ||X − µ; ||², j = 1,2