Create a flowchart, pseudocode or actual code for the following problem: you are given an n positive integer. Your task is to pay n forints by using the greedy algorithm. The algorithm is simple: you always need to choose the highest possible currency available. The algorithm must print out the used currencies right after each other. The usable currencies: 1,2,5,10,20,50,100,200,500,1000,2000,5000,10000,20000 Example: n=1479. Output: 1000, 200, 200, 50, 20, 5, 2, 2

Create a flowchart, pseudocode or actual code for the following problem: you are given an n positive integer. Your task is to pay n forints by using the greedy algorithm. The algorithm is simple: you always need to choose the highest possible currency available. The algorithm must print out the used currencies right after each other. The usable currencies: 1,2,5,10,20,50,100,200,500,1000,2000,5000,10000,20000 Example: n=1479. Output: 1000, 200, 200, 50, 20, 5, 2, 2

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

The manager of Mama Calari’s Pizza Palace wants a program that calculates and displays the number of pizza slices into which a circular pizza can be divided. The manager will enter the radius of the entire pizza. For this exercise, use 14.13 as the area of a pizza slice, and use 3.14 as the value of pi. Desk-check your solution’s algorithm using 10 as the pizza’s radius; then desk-check it using 8. (Hint: For the first desk-check, the number of pizza slices should be a little over 22.)
Java code Ever wondered how change is disbursed to customers in certain stores? In country X the following notes exists 200,100,50,20,10 and following coins: 5, 1, 50c, 10c, 5c. For the sake of this exercises let us only consider change below 50 see below example: Sample run 1: Enter item name: Apples Enter QTY of Apples: 2 Enter price per item N$: 3.25 Amount tendered N$: 50 Your change is: N$ 43.50 Disbursed as follows: 2 x N$20; 0 x N$10; 0 x N$5; 3 x N$1; 1 x 50c; 0 x 10c; 0 x 5c [Hint: make use of % and / operators to determine the values needed]
Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! Thank you!
Suppose that the first number of a sequence is x, where x is a non-zero positive integer. We define the following sequence: a0 = x, an+1 = an/2 if an is even, and an+1 = 3 ∗ an + 1 if an is odd. In such a sequence, there exists an integer k such that ak = 1. Write a program sequence.cc that prompts the user to enter the value of x, the program outputs the integer k such that ak = 1, the numbers a0, a1, a2, . . . , ak, the largest number of the sequence a0, a1, a2, . . . , ak, and the position of the largest number in the sequence. For example, if x = 75, then k = 14, the numbers a0, a1, a2, . . . , a14, respectively, are 75, 226, 113, 340, 170, 85, 256, 128, 64, 32, 16, 8, 4, 2, 1, the largest is 340, at position 3. Your program should prompt the user to run it repeatedly until she/he wants to quite. Please use break and continue statements. And loop and while statement! make sure k is identified in the output and don't use arrays for the program. thank you very much!!
Write an algorithm and C program for the following programdefinition: Calculate the weekly gross pay for a series of casual workers, using thefollowing information:a) For each worker there is a line of data with the following fields, separated byblanks - employee number (integer), number of shifts (integer), base wage rate(real) and one real number per shift, representing the number of hours worked.b) Your program should process as many data lines as there are present.c) Gross pay is total hours × base wage rate if the total hours are less than orequal to 15. If the total hours are greater than 15, but less than or equal to 25 thereis a 5% premium on base wage rate (for all hours worked). If the total hours aregreater than 25 there is a 10% premium.d) The gross pay should be rounded to the nearest cent.e) Produce a columnar report, with appropriate headings, showing employeenumber, total hours and gross pay.f) Determine, by hand calculation, what the correct results should befor this…
Write a python program that computes the zakat, obligatory charity, on camels. The program asks the user to input the number of camels, and then the zakat is calculated based on the following table: Rule for computing the zakat of 121 camels or more: You need to find the combinations of 40 camels and 50 camels that will minimize the number of “left over” camels not being “counted” in the zakat. For example, for 130 camels, we have (2*40) + (1*50)=130, with no left overs, and hence, the zakat consists of 2 bint Laboun and 1 Hiqqah. When we have 145 camels, we have the following scenarios: 1. (140) + (250) = 140 with 5 camels left over, 2. (240) + (150) = 130 with 15 camels left over, 3. (340) + (050) = 120 with 25 camels left over. Therefore, in this case the zakat is 1 bint Laboun and 2 Hiqqah, following the first scenario. Important Notes: Make sure that the input value is a positive integer. If not, the program must print the following message: Wrong input. Number should be an…
You are asked to develop a program to create an intelligent food menu pricing algorithm to solve this problem for restaurant owners. This algorithm will take maximum capacity (MC), current customers (CC), staff shortage (SS), and the original menu items information as input. Based on some conditions, menu items prices will vary from one customer to another. Here are the pricing conditions: The food items in a menu can be categorized into four types: Famous (F): items that customers always order. Regular (R): items that customers frequently order. Limited (L): items that customers rarely order. If restaurant busyness is or below 50% then Famous items are priced at their base price. Regular items are priced with a discount of 20% of their base price. Limited items are priced with a discount of 50% of their base price. If restaurant busyness is more than 50% then Famous items are priced with an increase relative to the restaurant’s busyness. For example, if the restaurant is 75%…
ask the user for an amount (number of cents) to make change for and then use the greedy solution to compute and output the numbers of coins of each kind required to make that amount of change. use coins of the following denominations: dollar, half-dollar, quarter, dime, nickel, and penny. The code must be in JAVA
Given two integers N and M, where N is the number of friends sitting in a clockwise manner in a circle and M is the number of cakes. The task is to calculate the left number of cakes after distributing i cakes to i’th friend. The distribution of cakes will stop if the count of cakes is less than the required amount. Answer IN Python Only.
In Python Write a function shampoo_instructions() with parameter num_cycles. If num_cycles is less than 1, print "Too few.". If more than 4, print "Too many.". Else, print "N : Lather and rinse." num_cycles times, where N is the cycle number, followed by "Done.".Sample output with input: 2 1 : Lather and rinse. 2 : Lather and rinse. Done. Hint: Define and use a loop variable. ''' Your solution goes here ''' user_cycles = int(input())shampoo_instructions(user_cycles)
use JAVA to write the code. : Euclid’s algorithm for finding the greatest common divisor (gdc) of two numbers The algorithm: given two numbers, n1 and n2: Divide n1 by n2 and let r be the remainder. If the remainder r is 0, the algorithm is finished and the answer is n2. (If the remainder is 1, the numbers are mutually prime and we are done-see below.) Set n1 to the value of n2, set n2 to the value of r, and go back to step 1. Entering 0 for one of the values is bad. It should work for the other value, but you have to figure out which is OK and which is bad. Catch this problem as it happens and make the user enter another value until they enter an acceptable one. Give an appropriate error message if this happens.
C++ Given an integer num, repeatedly add all its digits until the result has only one digit, and return it. Example 1: Input: num = 38 Output: 2 Explanation: The process is 38 --> 3 + 8 --> 11 11 --> 1 + 1 --> 2 Since 2 has only one digit, return it. Example 2: Input: num = 0 Output: 0 Constraints: 0 <= num <= 231 - 1 Follow up: Could you do it without any loop/recursion in O(1) runtime? //code here class Solution {public: int addDigits(int num) { }}; //