Darw a flowchart that inputs country someone is visiting, Data Structure & Algorithms

Regis lives in Brazil and frequently travels to USA, Japan and Europe. He wants to be able to convert Brazilian Reais into US dollars, European euros and Japanese yen. Conversion formula is:

  Currency value = number of Reais X conversion rate

For instance, if Regis is going to USA and wants to take 1000 Reais (and exchange rate is 0.48) then he would input USA, 1000 and 0.48 and output would be: 480 US dollars.

Write an algorithm, using a flowchart that inputs country he is visiting, exchange rate and amount in Brazilian Reais he is taking. Output will be value in foreign currency and name of the currency.

 

Posted Date: 9/11/2013 3:25:52 AM | Location : United States







Related Discussions:- Darw a flowchart that inputs country someone is visiting, Assignment Help, Ask Question on Darw a flowchart that inputs country someone is visiting, Get Answer, Expert's Help, Darw a flowchart that inputs country someone is visiting Discussions

Write discussion on Darw a flowchart that inputs country someone is visiting
Your posts are moderated
Related Questions
Q. A Binary tree comprises 9 nodes. The preorder and inorder traversals of the tree yield the given sequence of nodes: Inorder :          E     A    C    K    F     H    D

Q. Give the algorithm for the selection sort. Describe the behaviours of selection sort when the input given is already sorted.

Memory Allocation Strategies If it is not desirable to move blocks of due storage from one area of memory to another, it must be possible to relocate memory blocks that have be

Explain an efficient way of storing two symmetric matrices of the same order in memory. A n-square matrix array is said to be symmetric if a[j][k]=a[k][j] for all j and k. For

important points on asymptotic notation to remember

Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.

How divide and conquer technique can be applied to binary trees?  As the binary tree definition itself separates a binary tree into two smaller structures of the similar type,

Write an algorithm to add an element at the end of circular linked list.   Algorithm to Add the Element at the End of Circular Linked List. IINSENDCLL( INFO, LINK, START, A

In the book the following methods are presented: static void selectionSort(Comparable[] list) static void insertionSort(Comparable[] list) static boolean linearSearch(Comparable

Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t