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.

Algorithm

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?

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)

Page There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds wwere extremely limited that time. It was possible to establish only a surface track. Moreover, it turned out that the station could be only a dead-end one (see picture) and due to lack of available space it could have only one track. 5, 4, 3, 2, 1 1, 2, 3, 4, 5 Station The local tradition is that every train arriving from the direction A continues in the direction B with coaches reorganized in some way. • Assume that the train arriving from the direction A has NS 1000 coaches numbered in increasing order 1, 2, . N. • The chieffor train reorganizations must know whether it is possible to marshal coaches continuing in the direction B so that their order will be a, a2. . aN. Help him and write a program that decides whether it is possible to get the required order of coaches. • You can assume that single coaches can be disconnected from…

My colleague, Dr. Strange tells me that there is an alternate universe where Sydney buses are never cancelled and they always run on time; in fact, bus timetables specify to the second the exact arrival and departure time of each bus on each stop. Sadly, in this alternate reality there are no free transfers (i.e., you need to pay for the full fare of every bus you ride) and different bus lines charge different fees (but the good news is that the fee is flat and does not depend on distance travelled). A travel plan is a sequence of stop-time pairs where stop is a location of a bus stop and time is when we arrive at that stop. The plan is feasible if for any two consecutive pairs (a, t) and (b, t′) in the plan there exists a bus that departs after t and arrives at b at exactly t′. That is, a travel plan does not allow us to walk between stops. Assuming that no two buses arrive at the same time at the same stop, a feasible plan uniquely identifies the bus lines that we need to take to…

In many races competitors wear a RFID tag on their shoes or bibs. When the racer crosses a sensor a computer logs the racer’s number along with the current time. Sensors can be placed along the course to accurately calculate the racer’s finish time or pace and also to verify that the racer crossed key checkpoints. Consider such a system in use for a half-marathon running race, which is 13.1 miles. In this problem there are only three sensors: at the start, at the 7-mile point, and at the finish line.Here is sample data for three racers. The first line is the gun time in the 24-hour time format (HH MM SS). The gun time is when the race begins. Subsequent lines are recorded by sensors and contain the sensor ID (0=start, 1=midpoint, 2=finish) followed by the racer’s number followed by the time stamp. The start time may be different than the gun time because sometimes it takes a racer a little while to get to the starting line when there is a large pack. 08 00 000,100,08 00 000,132,08 00…

A robot system has a protective barrier enclosing the work cell area. The total time for the system to cometo a full halt after power is removed is 4 seconds, and an additional distance of 1.2 meter is required because of the height of the guard gate would allow operators to reach over it.Determine the minimum distance from the guard gate to the closed part of the robot work envelope, in meters NOTE: 1 meter = 1,000 millimeters