PROBLEM #8 The cashier at the counter of a Super Store, Mr.
Khazaanchi has the following
bundles of rupee cash notes with him:
Rs. 1, 2, 5, 10, 50, 100, 500, 1000
A customer comes at his counter with various items that he
has shopped. Mr. Khazaanchi totals
the item prices and tells the customer his total amount
payable. The customer gives Mr. Khazanchi
some amount of cash. Find the total number of rupee notes of
each denomination (i.e. 1, 2, 5, 10,
50, 100, 500, 1000) Mr. Khazaanchi will have to give to the
withdrawer ensuring that the total
number of rupee notes are minimum.
- 1 Answers
- 6174 Views
- AR, ARJ, I also Faced
- E-Mail Answers
Answer Posted / aga
guyz plzz i need helpp .. just one day left to subbmit
assignment plz help
| Is This Answer Correct ? | 7 Yes | 1 No |
Post New Answer View All Answers
1+1/2!+1/3!+...+1/n!
Write a (n) algorithm that sorts n distinct integers, ranging in size between 1 and kn inclusive, where k is a constant positive integer. (Hint: Use a kn-element array.)
Performance Algorithm A performs 10n2 basic operations and algorithm B performs 300 lg n basic operations. For what value of n does algorithm B start to show its better performance?
A suduco given & u hv 2 check if it is incomplete(blanks left),or correct or incorrect
Teta-Omeg-Big-Oh Show that f(n) = n2 + 3n3 is ;(n3).
Code for Small C++ Class to Transform Any Static Control into a Hyperlink Control?
write a function that allocates memory for a single data type passed as a parameter.the function uses the new operator and return a pointer to the allocated memory.the function must catch and handle any exception during allocation
Code for Two Classes for Doing Gzip in Memory?
Write a C/C++ program that connects to a MySQL server and displays the global TIMEZONE.
Code for Easily Using Hash Table?
How to Split Strings with Regex in Managed C++ Applications?
Definition of priority queue was given. We have to implement the priority queue using array of pointers with the priorities given in the range 1..n. The array could be accessed using the variable top. The list corresponding to the array elements contains the items having the priority as the array index. Adding an item would require changing the value of top if it has higher priority than top. Extracting an item would require deleting the first element from the corresponding queue. The following class was given: class PriorityQueue { int *Data[100]; int top; public: void put(int item, int priority); // inserts the item with the given priority. int get(int priority); // extract the element with the given priority. int count(); // returns the total elements in the priority queue. int isEmpty(); // check whether the priority queue is empty or not. }; We had to implement all these class functions.
Write a C++ program without using any loop (if, for, while etc) to print prime numbers from 1 to 100 and 100 to 1 (Do not use 200 print statements!!!)
write a program to calculate the amount of investment after a period n years if the principal investors was p and interest is calculated using compound interest,formular=a=p(1+r)^n
write a program that reverses the input number of n.Formulate an equation to come up with the answer.
