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.

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…

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)

Correct answer will be upvoted else Multiple Downvoted. Computer science.     You should stop precisely one of these boards, at any subsequent you wish. Then, at that point, the boards adjoining it get stopped one second after the fact, the boards nearby those get stopped 2 seconds after the fact, etc. At the end of the day, in the event that you stop board x, board y (for all substantial y) would be stopped precisely |x−y| seconds after the fact.    For instance, assume there are 4 boards, and the 3-rd board is stopped when the digit 9 is on it.    The board 1 stops 2 seconds after the fact, so it has the digit 1;    the board 2 stops 1 second after the fact, so it has the digit 0;    the board 4 stops 1 second after the fact, so it has the digit 0.    The subsequent 4-digit number is 1090. Note that this model isn't ideal for n=4.    When all boards have been stopped, you compose the digits showed on them from left to right, to frame a n digit number (it can comprise of driving…

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?

To reduce traffic congestion in downtown Winburg, Indiana, the mayor convinces the city toset up a public transportation system. Bus-only lanes are to be established, and commuterswill be encouraged to “park and ride”; that is, to park their cars in suburban parking lots andthen take buses from there to work and back at cost of one dollar per ride. Each bus is tohave a fare machine that accepts only one dollar bills. Passengers insert a bill into the slotsas they enter the bus. Sensors inside the fare machine scan the bill, and the software in themachine uses an image recognition algorithm to decide whether the passenger has indeedinserted a valid dollar bill into the slot. It is important that the fare machine be accuratebecause, once the news gets out that any piece of paper will do the trick, fare income willplummet to effectively zero. Conversely, if the machine regularly rejects valid dollar bills,passengers will be reluctant to use the buses. In addition, the fare machine must be…

1. The following diagram shows the number of minutes needed to travel between various intersections in the city of Ottawa along one-way streets. What is the fastest route from the intersection at node A to the intersection at node K? Formulate and solve as a network flow program. You may use a computer program such as LINDO for the solution. 1 23 B 23 21 17 14 K 10 10 18 21 18 14 27 14 10 11 H. 20 19 33 16 10 L. 16 14 2.

Help , practice

When purifying drinking water you can use a so-called membrane filtration. In an experiment one wishes to examine the relationship between the drop across a membrane and the flux (flow per area) through the membrane. We observe the following 10 related values of pressure (x) and flux (y): pressure 2 3 4 5 6 7 8 9. 10 Pressure (x) 1.02 2.08 2.89 4.01 5.32 5.83 7.26 7.96 9.11 9.99 Flux (y) 1.15 0.85 1.56 1.72 4.32 5.07 5.00 5.31 6.17 7.04 Copy this into R to avoid typing in the data: D <- data.frame( pressure=c(1.02,2.08,2.89,4.01,5.32,5.83,7.26,7.96,9.11,9.99), flux=c(1.15,0.85,1.56,1.72,4.32,5.07,5.00,5.31,6.17,7.04)