Project: Using Simple Formulas
Suppose you work for a technology company and you are taki...
Computers and Technology, 19.03.2021 20:20, maddihamidou
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.
Question # 1
File Upload
Upload your spreadsheet.
Answers: 2
Computers and Technology, 22.06.2019 05:20, ashcormu11
Write a program called assignment3 (saved in a ļ¬le assignment3.java) that computes the greatest common divisor of two given integers. one of the oldest numerical algorithms was described by the greek mathematician, euclid, in 300 b. c. it is a simple but very eāµective algorithm that computes the greatest common divisor of two given integers. for instance, given integers 24 and 18, the greatest common divisor is 6, because 6 is the largest integer that divides evenly into both 24 and 18. we will denote the greatest common divisor of x and y as gcd(x, y). the algorithm is based on the clever idea that the gcd(x, y) = gcd(x ! y, y) if x > = y and gcd(x, y) = gcd(x, y ! x) if x < y. the algorithm consists of a series of steps (loop iterations) where the ālargerā integer is replaced by the diāµerence of the larger and smaller integer. this continues until the two values are equal. that is then the gcd.
Answers: 3
Computers and Technology, 24.06.2019 00:30, rustjallison9928
Asecurity policy is a a. set of guidlines b. set of transmission protocols c. written document d. set of rules based on standards and guidelines
Answers: 2
Computers and Technology, 24.06.2019 08:00, Maxxboogie
Can someone work out the answer as it comes up in one of my computer science exams and i don't understand the cryptovariables
Answers: 1
History, 03.05.2020 14:23
Mathematics, 03.05.2020 14:23