Let us suppose that there are n jobs (J1, J2, … Jn) each of which takes a unit of time to be processed by a machine and there is just one single machine to process the jobs. Let us suppose that (d1, d2, d3, …dn) are the deadlines in units of times to complete the jobs and (p1, p2, p3, …pn) are the profits earned if the jobs are processed within the deadline. The objective is obviously to select those jobs and complete them within their deadlines so that maximum profit is earned. Design a greedy method to obtain the optimal sequence of jobs that will earn maximum profits. Demonstrate it on the case where there are four jobs, with n = 4, deadlines given by (d1 = 2, d2 = 1, d3 = 3, d4 = 1) and profits earned as (p1 = 100, p2 = 20, p3 = 50, p4 = 40).

Let us suppose that there are n jobs (J1, J2, … Jn) each of which takes a unit of time to be processed by a machine and there is just one single machine to process the jobs. Let us suppose that (d1, d2, d3, …dn) are the deadlines in units of times to complete the jobs and (p1, p2, p3, …pn) are the profits earned if the jobs are processed within the deadline. The objective is obviously to select those jobs and complete them within their deadlines so that maximum profit is earned. Design a greedy method to obtain the optimal sequence of jobs that will earn maximum profits. Demonstrate it on the case where there are four jobs, with n = 4, deadlines given by (d1 = 2, d2 = 1, d3 = 3, d4 = 1) and profits earned as (p1 = 100, p2 = 20, p3 = 50, p4 = 40).

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 12PE

See similar textbooks

Similar questions

1. A set of integers are relatively prime to each other if there is no integer greater than 1 that divides all the elements. Furthermore, in Number Theory, it is known that the Euler function,ϕ (n), expresses the number of positive integers less than n that are relatively prime with n. Choose the alternative that has the correct value of ϕ(n) for every n below. A) ϕ(5) = 4 B) ϕ(6) = 2 C) ϕ(10) = 3 D) ϕ(14) = 6 E) ϕ(17) = 16
I just want to Find the minimum path sum in matrix. The minimum path is sum of all elements from first row to last row where you are allowed to move only down or diagonally to left or right. You can start from any element in first row.Program should be in C language. First we ask the user for the number of rows and columns of the matrix, and then we generate a matrix of random numbers between 0 and 9 according to this number of rows and columns, and we find the smallest total path in this matrix. The rules are stated above. Example outputs : Enter number of rows (0 to exit): 3Enter number of columns: 5 9 7 8 [3] 88 6 [1] 2 34 7 5 [0] 8 Minimum sum:4 Enter number of rows (0 to exit): 5Enter number of columns: 7 6 4 8 9 1 [0] 33 0 5 9 [3] 4 23 0 8 1 [1] 3 34 2 0 7 [0] 9 37 5 9 9 3 [0] 3 Minimum sum: 4 Enter number of rows (0 to exit): 5Enter number of columns: 10 5 1 6 4 9 8 [0] 3 0 18 4 7 2 8 4 [2] 5 3 76 7 7 2 9 6 6 [0] 8 43 2 2 6 1 9 4 [2] 6 72 8 0 7 6 6 6 [1] 2 9 Minimum…
PYTHON Call expressions, such as square(2), apply functions to arguments. When executing call expressions, we create a new frame in our diagram to keep track of local variables: Evaluate the operator, which should evaluate to a function. Evaluate the operands from left to right. Draw a new frame, labeling it with the following: A unique index (f1, f2, f3, ...) The intrinsic name of the function, which is the name of the function object itself.For example, if the function object is func square(x)[parent=Global], the intrinsic name is square. The parent frame ([parent=Global]) Bind the formal parameters to the argument values obtained in step 2 (e.g. bind x to 3). Evaluate the body of the function in this new frame until a return value is obtained. Write down the return value in the frame. If a function does not have a return value, it implicitly returns None. In that case, the “Return value" box should contain None. Let's put it all together! Draw an environment diagram for the…
Part 2: Binary Arithmetic One of the most common operations we perform on binary numbers (and all numbers) is addition. It can be cumbersome to convert your binary numbers to decimal just to add them and convert them back, so instead we will be learning how to add binary numbers directly. Binary addition works the same way as decimal addition, with the added restriction that each digit can only go up to 1. Let's consider the possibilities for adding the values of any 2 single digits together: 0 + 0 0 + 1 1 + 0 1 + 1 0 1 1 10 (remember that 10 in binary represents the number 2) In that last case, the result is larger than a single digit. When adding larger binary numbers, that means we have to carry the 1 over to the next column. This presents us with another new case: what happens if we have 1 + 1 + carried 1? In that case, the result is 11, which means that column's result is 1, and we carry 1 to the next column. Below is an example of adding two binary numbers that shows all…
Problem Statement: Consider a permutation of numbers from 1 to N written on a paper. Let’s denote the product of its element as ‘prod’ and the sum of its elements as ‘sum’. Given a positive integer N, your task is to determine whether ‘prod’ is divisible by ‘sum’ or not. Input Format: First input will be an integer T. It depicts a number of test cases. Followed by the value for each test case. Each test case will contain an integer N (1<= N <=10^9). It is nothing but the length of the permutation. Output Format: For each test case, print “YEAH” if ‘prod’ is divisible by ‘sum’, otherwise print “NAH”..
Question Description Consider the following C function: long func(long x, long y, long z) { long ti = x + 3; long t2 - 2 + ti; long t3 - y + 5; long t4 = y = 33; long t5 - t3 + 14; long rval t2 + t5; return rval; } Show that the assembly code below is a correct translation of this program, by (a) giving an expres- sion for the value func() returns, and (b) filling in the table below the assembly code, showing the contents of each register in terms of x, y and z after each of the first six instructions is executed. The first row shows register contents before the first instruction. Remember that the sequence of assembly instructions may not correspond exactly to the C code, as the compiler may rearrange things to minimize the number of instructions and registers
Problem Statement: Consider an input string PAL of letters ‘P’, ‘A’, and ‘L’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called PAL_TAB. The number of each of these letters is unknown. We have a function, called SWAP(PAL, i, j), which places the ith letter in the jth entry of string PAL and the jth letter in the ith entry of PAL. Note that SWAP(PAL, i, j) is defined for all integers i and j between 0 and length(PAL) – 1, where length(PAL) is the number of letters of PAL. 1. Using our algorithmic language, write an algorithm, called Sort_PAL, which sorts the letters in the array PAL_TAB in a way that all P’s appear first, followed by all A’s, and followed by all L’s. The algorithm Sort_PAL should have one parameter: The array PAL_TAB. Also, your solution is correct only if the four constraints below are satisfied: - Constraint 1: Each letter (‘A’, ‘L’, or ‘P’) is evaluated only once. - Constraint 2: The function SWAP(PAL, i, j) is…
Please show all work (4) A lottery ticket has the numbers 1 through 25 listed on it. The user it asked to circle five numbers for their bet. Assuming the user can only use a number once in any bet, how many different combinations are there?
Write a C++ function to find the norm of a matrix. The norm is defined as the square root of the sum of squares of all elements in the matrix Note: the use of pointers is not allowed and code should be simple.The user should input the matrix he wants.We cannot initialize the matrix on our own.
C++ Given a positive integer, N, the ’3N+1’ sequence starting from N is defined as follows: If N is an even number, then divide N by two to get a new value for N If N is an odd number, then multiply N by 3 and add 1 to get a new value for N. Continue to generate numbers in this way until N becomes equal to 1 For example, starting from N = 3 the complete ’3N+1’ sequence would be: 3, 10, 5, 16, 8, 4, 2, 1 Write code to ask the user to enter a positive integer (N) in the main() function. Write a function sequence() that receives the integer value N and display the ‘3N+1’ sequence starting from the integer value that was received (entered by the user). The function must also count and return the numbers that the sequenceconsists of. The returned value must be displayed from the main() function.
Mc2. WRITE PYTHON FUNCTION THAT: You need to write the function which takes the index of the last point in the path sent, current, as well as the path, as arguments and returns the index of the next point to send. To write this function, remember the equations for the slope (m) of a line given two points on the line, and the offset (c) of a line give one point and the slope: y = mx +c. If you know the slope and offset, then whenever you are given a point (x1,y1) you can determine whether it lies on the line or not by evaluating r = y1-m*x1-c. This (y=mx+c) will be zero for a point on the line, and non-zero otherwise! The easiest way to see if you are on a straight line is to use the first two points to calculate m and c, then sum the value of r for the third, fourth, etc. until you reach a point where the sum of r exceeds some threshold value. That is, when the points have accumulated too much error from a straight line. You can use 0.1 as your default value of the threshold.…
Calculating the Ackermann's function At the lectures we saw recursive functions. One of the most known recursive functions is Ackermann's function. In the basic form, this is a function of three arguments, but in the literature, we often use a derivative with two arguments: Péter and Robinson. !!!!!!!!!!!!!!!!!!USING A PEN AND PAPER!!!!!!!!!!!!!!! Compute the a (3, 3), write the solution on a paper.Scan the paper and jpg files (each sheet into a separate file). Archive all files into the zip archive and submit this file as a solution to the task!