(Greedy Algorithms) Suppose you are given n tasks j={j1,j2,...jn}.Each task jl has two parts -a preprocessing phase which takes pl unites and a main phase which takes fl units of time. There are n machines that can esecute the main phase of the jobs in parallel. However, the preprocessing phases need to be execute sequentially on a special machine. The completion time of any schedule is the earliest time when all tasks have finished execution. Design a greedy algorithm which produces a schedule the minimizes the completion time. Here, you need to give formal proof of correctness

(Greedy Algorithms) Suppose you are given n tasks j={j1,j2,...jn}.Each task jl has two parts -a preprocessing phase which takes pl unites and a main phase which takes fl units of time. There are n machines that can esecute the main phase of the jobs in parallel. However, the preprocessing phases need to be execute sequentially on a special machine. The completion time of any schedule is the earliest time when all tasks have finished execution. Design a greedy algorithm which produces a schedule the minimizes the completion time. Here, you need to give formal proof of correctness

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Related questions

Q: USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be…

A: Solution of above problem with help of Python language is given below: Note: Below Python code is…

Q: Implement SRTF (SJF with preemption) scheduling algorithm in C programming. NOTE: Please do not…

A: In this question we have to write the code to implement SRTF with preemption in C program.Let's code…

Q: sequen shape form of a spiral, it can be in a nesting process and repeated into infinity. It is…

A: given; the hurricane speed formula is Fn=Fn-1 + Fn-2 we get the following value For 15th speed we…

Q: n computer science, the dining philosophers’ problem is an example problem often used in concurrent…

A: The Dining Philosophers Problem is a classic problem in computer science that illustrates the…

Q: Algorithm 8: Computing the power of a number Input:r, is a real number a E R, n is an integer…

A: Answer : The primary operation in this program are ;

Q: Design a recursive version of dynamic programming algorithm (Top-down) to construct the actual…

A: The objective of the question is to design a top-down dynamic programming algorithm to solve the…

Q: Use back substitution method to compute the following recursive function. Note that final results…

A: Given recursive function is, f(n)=4f(n/2)+n3 Back substitution method means substituting the f(n/2)…

Q: d of the number with the decimal portrayal of integer d+1. For instance, 1912 becomes 21023 in the…

A: Here have to determine about the length of n subsequent programming problem statement.

Q: Sudoku is a popular logic puzzle that uses a 9 by 9 array of squares that are organized into 3 by 3…

A: import java.util.Scanner; public class SudokuPuzzle { private int board [][]; private int…

Q: Consider the following code snippet [Pseudocode]: Method func) { PRINT "This is not an main…

A: Answer 1. The code will show compile time error. Answer 2. The code will show compile time error.

Q: Write a recursive Fibonacci function that computes the Fibonacci number for input n and prints each…

A: Given : a recursive Fibonacci function that computes the Fibonacci number for input n and prints…

Q: Do Left Factoring to the production above! b. Continue to eliminate forms of Left Recursion!

A: a. Doing Left Factoring X → Pc | Pd | XZ | Qp | Qop P → aB Q → Z Y → cX | dY | YY Z → a | b

Q: Implement the Greedy Algorithm discussed for the problem below, in C++. Using C++, implement the…

A: Algorithm: Policemen catches thief Initialize current lowest indices of the policemen in pol and…

Q: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the simultaneous…

A: Given: (Weiss 7.40): The following divide-and-conquer algorithm is proposed for finding the…

Q: Write a recursive function that takes an array and a callback function and returns True if any value…

A: The required function is shown below. const someRecursive = (arr, callback) => { if…

Q: Question 9 Na I need help with this homework question please. Analyze the following pseudocode and…

A: - We need to analyse the algorithm and give its Big-O notation.

Q: Consider the given code below and the clock cycles are given. Identify all the stalls that are…

A: Clock cycles:- A clock cycle, or simply a "cycle," is a single electronic pulse of a CPU. During…

Q: - Write a program (C language .C or Python .py) to implement JohnsonTrotter algorithm and count the…

A: Python uses English keywords in the code. Indentation is very important the python code. It supports…

Q: Getting an error with my code. Below I have included a screenshot Instruction: DESCRIPTION In…

A: The output of the given program is in the format: i = Randarray[i] The correct output format is:…

Q: Mathematics is a very crucial subject in our life. It gives a power to calculate the daily things.…

A: Input-Output format: The first line of input will contain a single integer TT, denoting the number…

Q: Recursion can be direct or indirect. It is direct when a function calls itself and it is indirect…

A: Recursion can be direct or indirect. It is direct when a function calls itself and it is indirect…

Q: (a) A composite number is a positive integer that has at least one divisor other than 1 and itself.…

A: Combinational circuit, there are four inputs A,B,C, and D, only one output Z

Q: a) Devise a recursive algorithm to nd a2n , where the inputs to the algorithm consist of a which is…

A: A iterative algorithm will use loop statements, such as a loop, while a loop or loop action while…

Q: Write a recursive function that outputs the sequence of steps needed to solve the puzzle with n…

A: The current situation is to develop a c++ program that solves the puzzle game Tower of Hanoi using…

Q: C++ Only: Karan has N items in his store (numbered 1 to N); And in i Each valid (1 <= I<= N). the…

A: Introduction: In this question, we are asked to write a C++ program to get the minimum number…

Q: Dynamic Programming) Recall the rod cutting problem. We are given a non-negative integer n and an…

A: Introduction: A naive solution to this problem is to generate all configurations of different…

Q: Group scheduling Scheduling tasks to actors (people, CPUs, machines etc) is a problem that one…

A: Scheduling tasks to actors like people, machines, or CPUs is a common problem faced in various…

Q: (b) The Fibonacci numbers for n-0, 1,.. are defined as follows. fib (0)-0 fib (1)-1: fib (n)-fib (n-…

A: Fibonacci series: fib(n) = fib(n-1) + fib(n-2) → for n > 1fib(n) = 1→ for n = 0, 1 Fibonacci can…

Q: Jack and Jill’s parents decide to make their children do some house chores. So they list a set of…

A: Answer:

Q: Task(2): Write a MATLAB code that generates Unit Step Function.

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

Q: USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be…

A: The Answer is

Question

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

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

Introduction to Greedy Algorithm

VIEW

Step 1: Minimum Completion Time

VIEW

Step 2: Expanding the Numerator and denominator

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Follow-up Questions

Read through expert solutions to related follow-up questions below.

Follow-up Question

Design greedy algorith please

Solution

by Bartleby Expert

SEE SOLUTION

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

USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be solved using Greedy Algorithm Strategy. Jack and Jill’s parents decide to make their children do some house chores. So they list a set of activities that can be completed in a whole day. In order to complete each activity a certain amount of time (in hours) is required. The parents randomly call each of their children several times separately to choose from the given activities. In each call the children choose an activity based on the following conditions: In each call, each of them chooses one activity Jack has to choose an activity that has not been selected yet. Jill, being very little, should choose an activity that Jack has already chosen so that she can help her older brother because she cannot do such tasks by herself. Jack does not like doing chores, so he decides he would choose the activity that requires the shortest amount of time to complete among the remaining activities.…
Question: Solve this using python Brian has recently started teaching dance. Today, he will be teaching Ballet. For this, he needs to divide the people attending his dance class into pairs. Usually in Ballet, the dance pairs consist of one girl and one boy. But Brian doesn't find this convention very interesting. He is rather more concerned about the IQ of people who are members of the same pair. Precisely, if the sums of digits of the IQ score of the two people forming a pair are co-prime, then the pair will be awkward according to Brian. For example, IQ scores 12 (1+2=3) and 22 (2+2=4) form an awkward pair. The IQ scores of all the people attending the Ballet class are pairwise distinct. The lowest IQ is L and the largest IQ is R. Moreover, there are exactly R-L+1 people attending the Ballet class. Brian wants to know the number of ways in which an awkward pair can be formed modulo 109+7. Sample Input: 1 15 27 Sample Output: 46
5. Poorly Executed Mitosis by CodeChum Admin A mitosis program has gone out of hand and now does abnormal cell duplication. Rather than scrapping the project, the researchers decided to observe and predict the cell duplication using a program. We are tasked to create a program that predicts the state of a cell after n iterations. The program would ask the user for 3 inputs: Base integer Initial factor Number of times to process It works like this: The initial factor is multiplied with the base integer The product of step 1 would be multiplied again with the base integer We keep on doing this depending on the number of times to process. Example: Base integer = 3 Initial factor = 2 Number of times to process = 3 Process: 1.) 2 x 3 = 6 2.) 6 x 3 = 18 3.) 18 x 3 = 54 Therefore, the output would above would be 54. Instructions: In the code editor, you are provided with a main() function that asks the user for the 3 integer inputs required for this program and calls the…
Solution for: Python
Please do it on your own , do not get the answer from chegg
Recursion can be direct or indirect. It is direct when a function calls itself and it is indirect recursion when a function calls another function that then calls the first function. To illustrate solving a problem using recursion, consider the Fibonacci series: - 1,1,2,3,5,8,13,21,34...The way to solve this problem is to examine the series carefully. The first two numbers are 1. Each subsequent number is the sum of the previous two numbers. Thus, the seventh number is the sum of the sixth and fifth numbers. More generally, the nth number is the sum of n - 2 and n - 1, as long as n > 2.Recursive functions need a stop condition. Something must happen to cause the program to stop recursing, or it will never end. In the Fibonacci series, n < 3 is a stop condition. The algorithm to use is this: 1. Ask the user for a position in the series.2. Call the fib () function with that position, passing in the value the user entered.3. The fib () function examines the argument (n). If n < 3…
USE PYTHON LANGUAGE. READ INPUT FROM FILE (NAME THE FILE "input.txt') The problem needs to be solved using Greedy Algorithm Strategy. Problem: . Each activity has a time interval- i.e. a start and a finish time. The activities can be distributed between M people. Implement a greedy algorithm to find the total number of activities that can be completed by M people. The following conditions must be met when writing the code: One person cannot do activities with overlapping time intervals, so each person can do only one activity at a given time interval. Each activity can be completed by only one person. The input will contain N and M, and then N lines with the start time and finish time in the format given below: N M S₁ F₁ S₂ F₂ ……. Sn Fn You have to read input from a file. The output will contain the total number of activities that can be completed. Sample input and output are given below. Name your input file “input.txt”. Make sure to try out different input examples to…
B Exercise Timings parSapply() Running the dice game is embarrassingly parallel. These types of simulations usually (but not always) produce a good speed-up. As before, we can use microbenchmark() or system.time(). For simplicity, we'll use system.time() in this exercise. Instructions The play() function has been defined in your workspace. We'll assume that we want to play one hundred thousand games. Set no_of_games to 1e5. • Use system.time() to time play() being repeatedly called in serial. • Call sapply() with 1:no_of_games and the play() wrapper function. • Assign the result to serial. • Wrap this call in system.time() to time it. • Create a 4 core cluster object and export the play() function to it. • Use system.time() to time play() being repeatedly called in parallel. • Rework the code you used to create serial, but make it work in parallel. < script.R 1 # Set the number of games to play no_of_games <- 1e5 23 J 4 5 6 7 8 9 10 982LZ 11 12 13 # Time serial version system.time…
Please help Report - I/II. Do not copy other solutions. Please write your own words to avoid doing same with others.
I have seen some programs for these has been assignment but can this Assignment be programmed any other way? Thank you Memory Management Programming Assignment implement and test the GET-MEMORY algorithm This algorithm uses the Next-Fit(First-Fit-With-A-Roving-Pointer) technique. implement and test the FREE-MOMORY algorithm Implement the “GET_MEMORY” and “FREE_MEMORY” algorithms. Comprehensive testing must be done for each algorithm. Following are sample run results for each: GET_MEMORY IS RUNNING……… Initial FSB list FSB# Location Size 1 7 4 2 14 10 3 30 20 . . . . . . Rover is 14 ---------------------------------------------------------------------------- Allocation request for 5 words Allocation was successful Allocation was in location 14 FSB# Location Size 1 7 4 2 19 5 3 30 20 . . . . . . Rover is 30 ---------------------------------------------------------------------------- Allocation request for 150 words Allocation was not successful . . .…
Please try to solve it in one hour
a) Design an efficient algorithm to solve this problem , and analyze its complexity [Important instruction: Create an arbitrary list of 10 lectures starting times and their corresponding ending times to provide full explanation of how your proposed algorithm should work step by step] b) Implement your efficient algorithm using Python