Master Computers and Technology with Fun Quizzes & Brain Teasers!
Suppose you have one machine and a set of n jobs a1,a2,...an to process on that machine. Each job a, has a processing time tj, a profit p, and a deadline d,. The machine can process only one job at a time, and job a, must run uninterrupted for t, consecutive time units. If job aj is completed by its deadline d,, you receive profit p,, but if it is completed after its deadline, you receive a profit of 0. Give an algorithm to find the schedule that obtains the maximum amount of profit, assuming that all processing times are integers between 1 and n. What is the running time of your algorithm?
I just need the SQL statements for these problems:1.)Insert into the PADDLING table the trip ID, trip name, state, distance, maximum group size, and season from the TRIP table for only those trips having type PADDLING.2.) For all trips located in Connecticut (CT), increase the maximum group size by two.3.)Insert a new trip into the PADDLING table. The trip ID is 43, the trip name is Lake Champlain Tour, the state is Vermont (VT), the maximum group size is 12, the distance is 16, and the season is Summer.4.)Delete the trip in the PADDLING table with the trip ID 23.