[SOLVED] Cash Register program using Greedy Algorithm in Java with full source code

By Anonymous -
Program Formal Description:


  1. The driver class should initially fill the register with 0x$100, 0x$50, 10x$20, 20x$10, 20x$5, 0x$2, 50x$1, 80x$0.25, 50x$0.10, 20x$0.05, 100x$0.01
  2. The program should ask the user the following:
    1. Make a sale
    2. make change
    3. print balances
    4. exit
  3. For a sale: the program class should prompt for the cost and how much of each type of currency were given
  4. If the register can not make the correct change, print an appropriate message
  5. For making change: the program should ask which currency is being provided and how much of that currency, then it should output what currency is being given
    1. example, make change, provide 4 quarters, register gives 1x$1
    2. example, make change, provide 50 dimes, register gives 1x$5 OR 5x$1 OR 4x$1, 4x$0.25
  6. For print balances, just show what is currently in the register of every currency
  7. Calculate Big-Oh for all 3 processes
  8. Calculate actual operations for making a sale and print out (don't forget to include the cost of using any data structures, if you can't calculate the exact cost, use the big-oh value of what you are doing), include comments every time you change the operation count about what is causing the count to go up by that amount.


Note: don't forget to clear the counter after the sale is completed, so the next sale starts its operation count at zero.

Get your solution 

Buy now

Comments

Post a Comment

Popular posts from this blog

[SOLVED] Tape for a Turing Machine using Doubly-linked List in Java with full source code

By Anonymous -
Tape for a Turing Machine (Doubly-linked List) Short exercise in which you will code part of an existing project. In this case, you will be working with a doubly-linked list. To make this topic more interesting, the list that you work on will be part of a Turing Machine. A Turing Machine is a kind of very simple, abstract computing device that was introduced in the 1930's by Alan Turing as a way of studying computation and its limitations. The classes that you need for the lab are in a package named turing. You will define a new class named Tape in this package. You can find the Java source in the code directory. You should copy this directory into an Eclipse project. There will be errors, since the existing classes depend on the Tape class, which you have not yet written. Don't forget the Javadoc comments. A Class for Turing Machine Tapes A Turing machine works on a "tape" that is used for both input and output. The tape is made up of little squares called cell...
Read more

[SOLVED] ICT285 Databases TMA 2017 Assignment 1 | Relational Algebra, Database Design & Implementation

By Anonymous -
Relational Algebra A database records information about athletes competing at the Olympics. An athlete competes for a particular country in one or more events. Events take place at a scheduled day and time in a particular venue. The result (rank) is recorded for all athletes in the final of the event. The medal (gold, silver or bronze) is also recorded for the medal winners in the event. Note that we are not considering team sports or heats in this example – only individuals competing in the finals. The schema for this database is as follows: (Note that primary keys are shown underlined, foreign keys in bold). ATHLETE ( AthleteNo , AthleteName, CountryName) COUNTRY ( CountryName , NumberOfCompetitors) EVENT (EventName, ScheduledStart, VenueName ) VENUE (VenueName, City, Capacity) FINAL ( AthleteNo , EventName , Rank, Medal) Provide relational algebra (NOT SQL) queries to find the following informaList the name and country of all athletes. List the event name and scheduled...
Read more