Create a Money data structure that is made up of amount and currency.

(a) Write a constructor for this data structure

(b) Create accessors for this data structure

(c) Write operations convert-money (takes a Money object and a currency symbol and returns the Money object of the requested currency), add-money and subtract-money (add and subtract Money objects possibly from different currencies and return a Money object with currency of the first Money object argument)

 

Posted Date: 3/28/2013 3:43:38 AM | Location : United States

Ask an Expert

Related Discussions:- Create accessors for this data structure, Assignment Help, Ask Question on Create accessors for this data structure, Get Answer, Expert's Help, Create accessors for this data structure Discussions

Write discussion on Create accessors for this data structure
Your posts are moderated

Write your message here..

Related Questions

System defined data types, System defined data types:- These are data t... System defined data types:- These are data types that have been defined by the compiler of any program. The C language contains 4 basic data types:- Int, float,  char and doubl

Signals, How does cpu''s part tming and controls generate and controls sign... How does cpu''s part tming and controls generate and controls signls in computer?

What is algorithms optimality, What is algorithm's Optimality? Optimali... What is algorithm's Optimality? Optimality  is  about  the  complexity  of  the  problem  that  algorithm  solves.  What  is  the  minimum amount  of  effort  any  algorithm  w

Total impedent of the circuit, an electrical student designed a circuit in... an electrical student designed a circuit in which the impedence in one part of a series circuit is 2+j8 ohms and the impedent is another part of the circuit is 4-j60 ohm mm program

Numerical - algorithm, Q. What is the smallest value of n such that an algo... Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n

Graph with n vertices will absolutely have a parallel edge, A graph with n ... A graph with n vertices will absolutely have a parallel edge or self loop if the total number of edges is greater than n-1

Sorting on several keys, Thus far, we have been considering sorting depend ... Thus far, we have been considering sorting depend on single keys. However, in real life applications, we may desire to sort the data on several keys. The simplest instance is that

What is binary search, What is binary search?   Binary search is most ... What is binary search?   Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)

Sorting, explain quick sort algorithm explain quick sort algorithm

Explain avl tree, AVL tree An AVL tree is a binary search tree in which... AVL tree An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and right subtrees are again