subject

Project: Using Simple Formulas Suppose you work for a technology company and you are taking a business trip to Japan to purchase some parts. The Japanese use yen for their currency. When you arrive in Japan, the manufacturers have listed the prices in yen. To figure out how much you are spending, you will need to convert the prices in yen to U. S. dollars. You know that one U. S. dollar equals 105.06 yen at the time of your trip, so you use your spreadsheet to make this conversion. You enter a price in one cell and in another cell, you enter a formula that multiplies the price by 105.06. In this way, you can quickly see how much an item costs in U. S. dollars.
Objectives
Create a spreadsheet to convert foreign currency to U. S. dollars.
Directions
Part 1: Select ten foreign currencies and find the current exchange rate. Since currency exchange rates change often, you will need to look up the exchange rates. You can call a bank or look for foreign currency exchange rates on the Internet or in a newspaper.

Part 2: Create a spreadsheet that lists the ten currencies you chose. For each currency, enter an amount and create a formula to convert it to U. S. dollars. Make sure to include dollar signs in the appropriate cells.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 17:20
What do you need to know & understand about global expansion.
Answers: 2
question
Computers and Technology, 21.06.2019 23:30
Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.
Answers: 3
question
Computers and Technology, 23.06.2019 00:00
How do we use the sumif formula (when dealing with different formats) ?
Answers: 1
question
Computers and Technology, 23.06.2019 02:30
Three out of five seniors remain undecided about a college major at the end of their senior year.
Answers: 3
You know the right answer?
Project: Using Simple Formulas Suppose you work for a technology company and you are taking a busi...
Questions
question
Computers and Technology, 25.09.2019 19:00
Questions on the website: 13722363