1. Design an efficient algorithm to solve the following scheduling problem. Provide a pseudo-code and a worst case complexity analysis for your algorithm.You are given a set of n jobs with a processing time t; and a weight w; for each job. Youwant to order the jobs so as to minimize the weighted some of the completion times,Žw,C, .i=1Example: Suppose there are two jobs, the first takes time ti = 1 and has weight wi = 10,while the second takes time t2 = 3 and has weight w2 = 2. Then doing job 1 first would yielda weighted completion time of 10x1 + 2x4 = 18, while doing job 2 first yields the largerweighted completion time of 10x4 + 2x3 = 46.

Answered: Image /qna-images/answer/ece1418f-023f-44a3-8d5b-2a9d23a83b93.jpg

Design an efficient algorithm to solve the following scheduling problem. Provide a pseudo- code and a worst case complexity analysis for your algorithm. You are given a set of n jobs with a processing time t; and a weight w; for each job. You want to order the jobs so as to minimize the weighted some of the completion times, Żw,C, . Example: Suppose there are two jobs, the first takes time ti = 1 and has weight wi = 10, while the second takes time t2 = 3 and has weight w2 = 2. Then doing job 1 first would yield a weighted completion time of 1Ox1 + 2x4 = 18, while doing job 2 first yields the larger weighted completion time of 10x4 + 2x3 = 46.

Design an efficient algorithm to solve the following scheduling problem. Provide a pseudo- code and a worst case complexity analysis for your algorithm. You are given a set of n jobs with a processing time t; and a weight w; for each job. You want to order the jobs so as to minimize the weighted some of the completion times, Żw,C, . Example: Suppose there are two jobs, the first takes time ti = 1 and has weight wi = 10, while the second takes time t2 = 3 and has weight w2 = 2. Then doing job 1 first would yield a weighted completion time of 1Ox1 + 2x4 = 18, while doing job 2 first yields the larger weighted completion time of 10x4 + 2x3 = 46.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Show that we can solve the telescope scheduling problem in O(n) time even if the list of n…

A: Dear Student, The answer to your question is given below -

Q: Design a dynamic programming algorithm for the following problem. Find the maximum total sale price…

A: Given the rod of length n inches and the array of prices that includes prices of all the pieces of…

Q: Problem 5. Let S be a perhaps multi-set of n integers. Give an algorithm to determine whether 5 has…

A: Task : Given the multiset S and value k. The task is to find the algorithm to determine whether S…

Q: Zenthe first known correct software solution to the critical-section problem for two processes was…

A: The answer is

Q: Problem 3. Let n be an integer. Write dynamic programming algorithm which determines in how many…

A: Dynamic programming Dynamic programming is mostly an enhancement over simple recursion. Dynamic…

Q: Consider the two algorithms: Algorithm A, whose time complexity is O(n²) and Algorithm B, whose time…

A: A measure known as time complexity indicates how long an algorithm takes to execute in relation to…

Q: Consider the following part of a function (assume n>=1 and m>=1 and n and m are inputs to the…

A: The time complexity can be defined as the total amount of time taken by an algorithm to complete the…

Q: Consider the following algorithm: int f(n) /* n is a positive integer */ if (n =1. That is,…

A: Dear learner, hope you are doing well, I will try my best to answer this question. Thank You!!

Q: Many scheduling problems can be solved using greedy algorithms. A classic problem is as follows:…

A: A greedy algorithm is a problem-solving approach that makes locally optimal choices at each step in…

Q: In this report, you'll work with the following algorithm. You will model it with a state machine,…

A: Note: since your contain multiple question having multiple sub-part . but we can answer only one…

Q: A dynamic program is designed that fills in a 1D table of size n by solving the following…

A: In this question we have to discuss about the time complexity of a dynamic programming algorithm…

Q: A team sport game has m players in a team and a tournament can have n competing teams. Team T1 ranks…

A: The question is asking to design an algorithm to determine if two teams can be ranked based on their…

Q: Suppose that we reach a point in algorithm where we then to decide to execute one of set of steps if…

A: Conditional statements, such as "if-else" constructs, are fundamental components of programming and…

Q: There are n different sizes of boxes, from 1 to n. There is an unlimited supply of boxes of each…

A: Hi there, Please find your solution below, I hope you would find my solution useful and helpful.…

Q: 3. Suppose that you have a computational problem A, input to A can be transformed to the input to…

A: Dear Student, Here we need to find whether the argument lower bound of is nlogn is true or not ,…

Q: Many scheduling problems can be solved using greedy algorithms. A classic problem is as follows:…

A: It is possible to invent several greedy algorithms for the problem.

Q: Let A = {a1, a2, ..., an} and be a set of n positive integer and let T be another integer. Design a…

A: The objective of the question is to design a dynamic programming algorithm that can determine…

Q: der a system of three independent, periodic real-time tasks: T1= (4, 3), T2 = (12,7), and T3 = (8,…

A: It is defined as the task scheduling algorithms in which the systems must satisfy the deadlines of…

Q: Suppose there is a circle. There are n petrol pumps on that circle. You are given two sets of data.…

A: Suppose there is a circle. There are n petrol pumps on that circle. You are given two sets ofdata.1.…

Question

1. Design an efficient algorithm to solve the following scheduling problem. Provide a pseudo-
code and a worst case complexity analysis for your algorithm.
You are given a set of n jobs with a processing time t; and a weight w; for each job. You
want to order the jobs so as to minimize the weighted some of the completion times,
Žw,C, .
i=1
Example: Suppose there are two jobs, the first takes time ti = 1 and has weight wi = 10,
while the second takes time t2 = 3 and has weight w2 = 2. Then doing job 1 first would yield
a weighted completion time of 10x1 + 2x4 = 18, while doing job 2 first yields the larger
weighted completion time of 10x4 + 2x3 = 46.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Devise a divide-and-conquer algorithm that multiplies a matrix A and a matrix B (both of them are n-by-n) in time O(nlo927).This improves over the naive O(n³) algorithm we learned in high school. Your answer should be a clear exposition of the steps needed to perform the multiplication, and also a proof of its runtime. If it helps feel free to assume that n is a power of 2.
In each of the problems below compute the average case time complexity (or expected time) of the given code. State your answer using asymptotic notation. Show your work for this problem by stating what the different cases are, the probability of each case, and how long each case takes. Also show the calculation of the expected time. a) def foo (n): #randomly choose a number between 0 and n-1 in constant time k np.random.randint (n) if k np. sqrt (n): for i in range(n): print (i) print('Never mind...') else: b) def bogosearch (numbers, target): """search by randomly guessing. numbers is an array of n numbers""" n = len (numbers) while True: #randomly choose a number between 0 and n-1 in constant time guess = np.random.randint (n) if numbers [guess] == target: return guess In this part, you may assume that the numbers are distinct and that the target is in the array. Hint: if 0 < b < 1, then 1p.bp-1 (1-b)². =
For the following function, select the most appropriate time complexity in terms of n: def rate(n): i = 0 total = 0 while in: j= n while j > 1: total + j j // = 2 i += 1 return total IMPORTANT: The penalty scheme for this question is 50, 100%. Select one: O a. Time complexity = O(n) O b. Time complexity = O(n^2) O c. Time complexity = O(2n) O d. Time complexity = O(log n) e. Time complexity = O(n log n) Check
Consider the following functions as time complexities of some algorithms. (a) First write the worst-case runtime of each algorithm in Big-O notation. (b) Then arrange functions from low to high (Consider their Big-O notations as you arrange them; as n grows, the function that grows slower should come sooner than the one that grows faster). (c) Arbitrary, select TWO of arrangements in part (b) and for each one of them justify why you have chosen such an ordering for the corresponding function. Provide formal proof. For example if fl<=f2<= f3<= f4<=f5 you may choose to formally justify why (1) fl<=f2 and why (2) f4<=f5 . fI(n)=n², f2(n)=210 nlogn, f3(n)=3", f4(n)=n, f5(n)=1, f6(n)=5*logn, f7(n)= n", f8(n)=4 n*n, f9(n)=2log(n³)
A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate?
Write an efficient algorithm for the following problem, and describe your reasoning. Determine the Time complexity and if you cannot find any polynomial time algorithm, then give a backtracking algorithm. Problem: Tower of Hanoi with Every Tower having some Disks Input: Each of the three towers contains roughly n/3 disks. Tower A contains floor(n/3) largest disks. Tower C contains ceiling(n/3) smallest disks. Tower B contains the remaining disks. The disks at each tower are already sorted according to the typical Tower of Hanoi rule. Output: A set of moves that transfers all the n disks to C maintaining the Tower of Hanoi rule that after each move, the smaller disks at a tower will always be above the larger ones.
please answer with proper explanation and step by step solution.