Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For each of the following sums, just write YES if it will produce an optimal solution or NO if it won't. For example, for the sum 200, it will produce an optimal solution.

Suppose you have coins of denominations 1,3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For each of the following sums, just write YES if it will produce an optimal solution or NO if it won't. For example, for the sum 200, it will produce an optimal solution.

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

Similar questions

A linear program is given as follows: Minimize x1+x2+x3 subject to 2x1 – 6x2 + 3x3 ≥ 50 3x1 + 4x2 -x3 ≥ 40 4x1 – x2 + 5x3 ≥ 60 x1, x2 ≥ 0 Solve the problem using a linear programming solver (e.g., linprog in python). What is the optimum solution? What are the values of x1, x2 and x3 for this optimum solution? Instructions: Submit the following The new form of the problem (if you have changed the form) for linear programming solver input Code to solve the problem Answers of questions ‘a’ and ‘b’
Write a program that takes five students' quizzes in a course. Consider each student has given ten quizzes. Find Best student Worst student Average studen t nt
You are given nn points in the plane: (x1,y1),(x2,y2),...,(xn,yn). On the page , in English, give an algorithm that determines if there is a circle on which all of the points lie. In English, write your algorithm to determine if there is a circle on which points(x_1, y_1), (x_2, y_2), . . ., (x_n, y_n) lie. Algorithm:
Given a rod of length n inches and an array of prices that contains prices of all pieces of size smaller than n. Determine the maximum value obtainable by cutting up the rod and selling the pieces. For example, if length of the rod is 8 and the values of different pieces are given as following, then the maximum obtainable value is 22 (by cutting in two pieces of lengths 2 and 6) length 1 2 3 4 5 6 7 8 price | 1 5 8 9 10 17 17 20 And if the prices are as following, then the maximum obtainable value is 24 (by cutting in eight pieces of length 1 Please provide the solution in the assembly programming language and please use both recursion and dynamic programing method to solve the problem.
X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution.
Sabrina is on a game show and is presented with a drawer containing 10 red socks, 10 blue socks, 10 green socks, and 10 yellow socks. Sabrina is to take socks out of the drawer and put them in a bag. She will win $1 for every sock she puts in the bag, as long as the bag does not contain 5 or more socks of one color and 5 or more socks of another color. For example, if she takes 5 red, 4 blue, 3 green, and 2 yellow socks, she would win $14. However, if she took 5 red, 5 blue, 3 green, and 2 yellow socks, she would not win anything because there are two colors (red and blue) that have 5 or more socks each. What is the most money that Sabrina can win? Enter your answer as a single integer only (no words, no dollar signs). A/ What is the minimum number n such that if n socks are removed from the drawer and put into a bag, that the bag will necessarily contain at least 5 socks of one color and at least 5 socks of another color? Enter n as a single integer, no words.
I need to write a program for a Lion Hunt. The program should calculate the number of hours it will take a group of hunters to find the lion in the worst case scenario. We asumme that The lion has b b Hiding spots where 2 ≤ b ≤ 10 , 000 2 ≤ b ≤ 10 , 000 . We assume that there are s s Hunters where 1 ≤ s ≤ 1 , 000 1 ≤ s ≤ 1 , 000 . We assume that there are g g number of hunters, who need to be in a group to travel safely where 1 ≤ g ≤ s 1 ≤ g ≤ s . We assume that it takes a group 1 hour to search any of The lions hiding spots The input consists of a single line containing three integers ?, ? and ?, where 2≤?≤1000 is the number of hiding spots in the jungle. 1≤ e. Sample input/output is shown in attached photo
We want to buy the car depending on its cost for 10 years. Here is the algorithm for deciding which car to buy dependir a price of OMR 4.000 per liter of gas and usage of 15,000 kilometers per year. For each car, compute the total cost as follows: annual fuel consumed = annual miles driven / fuel efficiency %3D annual fuel cost = price per gallon x annual fuel consumed operating cost = 10 x annual fuel cost total cost = purchase price + operating cost If total cost1 total cost2 Choose car2. Else Choose car1 or car2 Use these sample values: Car 1: purchase price: OMR 25,000, fuel efficiency: 10 kms/liter, Car 2: purchase price: OMR 20,000, fuel efficiency: 15 kms/liter What is the outcome of the algorithm. O a. Choose car 2 O b. Choose car 1 O c. Choose car1 or car2 O d. Choose car1 and car2
consider a jewler who shows a collection of diamonds to a person. all diamonds have different integer ounce weights and are laid out in a single row on the table. what is the largest weight amount of diamonds that the person can take, provided that the person cannot select adjacent diamonds? use standard pseudocode notation similar to python to write a dynamic programming bottom up algorithm that solves this problem for any n number of diamonds.
X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution. You…
In a hypothetical study of population dynamics, scientists have been tracking the number of rabbits and foxes on an island. The number of rabbits and foxes are determined once a year using high resolution infrared cameras and advanced computer vision methods.Each year, the number of rabbits and foxes are found to change by the following equations: $$ {\Delta}R = round( kr*R - krf*R*F ) $$ $$ {\Delta}F = round( -kf*F + kfr*R*F ) $$ where $ {\Delta}r $ and $ {\Delta} f $ are the changes in number of rabbits and foxes by the end of that year; and R and F are the population sizes at the end of the previous year. kr, krf, kf, kfr are coefficients that depend on the species of rabbits and foxes.With these dynamics, the scientists realize that one or both species can become extinct on the island. At the end of each year, if there are fewer than 2 animals of a kind, the scientists transfer rabbits and/or foxes to make sure there are at least 2 of each kind.Write a function…
One day, an elf jumps out at you from behind a garbage can and proposes a wager. He says that if the weather in Leipzig, Germany tomorrow is sunny, he'll give you $20, if it's cloudy (but dry) he'll give you $1, but if neither of those are the case you owe him $15. Helpfully, he also provides you data that indicates that the probability of sunny weather in Leipzig tomorrow is 40% and cloudy-but-dry is 10%. How much do you expect to win or lose from this wager (if you accept it)? A)Win $15.60 B)Lose $6.00C)Lose $7.50D)Win $0.60E)Win $4.00