Consider the software that runs in an Automated Teller Machine (ATM) machine. One task that must be able to be performed is to determine the type (denomination) of currency and the numbers of bills (aka "banknotes" for those of you not from North America) for each type dispensed. A requirement is that our ATM use the fewest number of bills that it can to dispense the specified amount of money. It only dispenses fifties, twenties, tens, fives, and ones. Design and implement program that writes out what bills would be dispensed if this machine existed for the amount of money that was asked for by the user. No flowchart required for this part of the assignment, but.Before you begin coding -- write test cases! Test Cases In the comments at the top of your file, list 3 test cases that you came up with. Something like this but choose your own examples. You should write your test cases in such a way that, if they all pass, you can be fairly confident your program will work all the time. These test cases will count towards your "documentation" grade for this assignment.

Consider the software that runs in an Automated Teller Machine (ATM) machine. One task that must be able to be performed is to determine the type (denomination) of currency and the numbers of bills (aka "banknotes" for those of you not from North America) for each type dispensed. A requirement is that our ATM use the fewest number of bills that it can to dispense the specified amount of money. It only dispenses fifties, twenties, tens, fives, and ones. Design and implement program that writes out what bills would be dispensed if this machine existed for the amount of money that was asked for by the user. No flowchart required for this part of the assignment, but.Before you begin coding -- write test cases! Test Cases In the comments at the top of your file, list 3 test cases that you came up with. Something like this but choose your own examples. You should write your test cases in such a way that, if they all pass, you can be fairly confident your program will work all the time. These test cases will count towards your "documentation" grade for this assignment.

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

Similar questions

Consider a real estate company that owns homes on a very long street. Each home on that street is for sale and each home has a, potentially, different integer price in dollars from any other home on the street. What is the largest number of homes a potential buyer can buy, provided that the buyer cannot purchase (immediately) neighboring homes? Using standard pseudo-code notation (it can be similar to Python, for example), write a dynamic programming algorithm (bottom-up) that solves this problem for any n number of homes on such a street.
Create a program in Python that takes a user's inputted set of data points, x and y values, until the user enters q to quit. The program should then ask the user for any x value and then have a y value returned, where the y value is the best estimate, using linear interpolation/extrapolation, from the nearest x value. The user should be able to repeatedly interpolate or extrapolate until they enter q.
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Please write a python program with explanation data structure& algorithm and time &space complexity Given a list of [personName, accessTime], for each person, return the earliest 1-hour interval in which he has swipe badges 3 or more times, e.g.[A, 0], [A, 5], [A, 59], [A, 60] ,[A, 61]return [A, 0], [A, 5], [A, 59], [A, 60] not [A, 5], [A, 59], [A, 60] ,[A, 61]
Write a Python program to generate data that uses the sum of a random variable (which has a Gaussian distribution) and a 4th-degree polynomial equation (3x4+x3+3x2+4x+5). Using least squares polynomial fit, curve the generated data using a model until your model can accurately predict all values
Your task is to implement Depth-first search algorithm to solve the problem of placing 8 Queens on a chess board so none can “take” each other.• A code framework, supporting videos and html documentation of the provided code-base will be provided via Moodle in assignments section.• The implementation should accept one command-line argument at the time it is invoked for the starting position of the first queen.o It will be tested with a range of values for that input.o If the input is not an integer in the range of 0-7 it should report “Invalid Input” and exit. • You will be supplied with a partially completed file ‘main.c’ which contains the code need to read the command line and sets up the initial working candidate within the code framework.o Your task is to complete the code to implement depth-first search. o Your code must finish with a call to the function PrintFinalSolutionAndExit(); when a valid final solution stored in the variable “workingCandidate”. please solve full…
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you ll in the values is the correct one.
Write a python program based on the discussion we had on the last day of class, to train a network with two hidden layers each with 5 neurons. Finish the gradient computation we did in class, and implement a steepest decent search for a network which minimizes the cost function. Once you believe that your network is trained, compute the value of n(1, 1) and see what you get. Bonus: If you easily get this to work, then try to generalize to K neurons in each of the two hidden layers. Does the training work better with more neurons?
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide-and-conquer algorithm in the problem. Make sure all test cases return expected outputs. Hint: Apply bisection method/modules Output FormatOutput contains a line with two space-separated integers W_a and W_b.- W_a is the maximum matchups won by Hamiltonia- W_b is the maximum matchups won by Burrgadia. Sample Input 03 554402410 Sample Output 03 0 Sample Input 15 4833485183 Sample Output 12 2 Sample Input 27 81028121912601319851 Sample Output 27 0 The actual code """Solves a test case Parameters:a : int - number of leaders in Hamiltoniab : int - number of leaders in Burrgadias_i : array-like - rap proficiencies of Hamiltonia's leadersr_j : array-like - rap proficiencies of Burrgadia's leaders Returns:win_a : int - number of…
Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux. a) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit, is there anything smarter we could do? (b) Simulated annealing requires a very small amount of memory, just enough to store two states: the current state and the proposed next state. Suppose we had enough memory to hold two million states. Propose a modification to simulated annealing that makes productive use of the additional memory. In particular, suggest something that will likely perform better than just running simulated annealing a million times consecutively with random restarts. [Note: There are multiple correct answers here.] (c) Gradient ascent search is prone to local optima just like hill climbing.…