COMPUTER SCIENCE ILLUMIN.-TEXT
COMPUTER SCIENCE ILLUMIN.-TEXT
6th Edition
ISBN: 2810016866372
Author: Dale
Publisher: JONES+BART
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 12, Problem 41E

Explanation of Solution

Spreadsheet to track expenses:

Step 1: Design a spreadsheet as shown below.

The below spreadsheet contains columns like “Day”, “Mileage cost”, “Flight cost”, “Hotel cost”, “Taxi cost”, and “Total amount”.

Screenshot of the spreadsheet

In the above spreadsheet,

  • The days are listed from “D6” to “D10”.
  • The car mileage costs are listed in the cells from “E6” to “E10”.
  • The flight costs are listed in the cells from “F6” to “F10”.
  • The hotel costs are listed in the cells from “G6” to “G10”.
  • The taxi costs are listed in the cells from “H6” to “H10”.

Step 2: Computing total amount spent for each day

Screenshot of the spreadsheet

In the above spreadsheet,

  • The total amount spent for each day is calculated by adding all the costs.
  • The cell “I6” contains the formula “SUM (E6:H6)”.
  • The cell “I7” contains the formula “SUM (E7:H7)”.
  • The cell “I8” contains the formula “SUM (E8:H8)”.
  • The cell “I9” contains the formula “SUM (E9:H9)”.
  • The cell “I10” contains the formula “SUM (E10:H10)”.

After calculating, the spreadsheet looks like the below screenshot.

Screenshot of the spreadsheet

Step 3: Computing total car mileage cost

Car mileage cost is calculated by adding all the amount that was spend for all days.

Screenshot of the spreadsheet

In the above spreadsheet, the cell “E11” contains the formula “SUM (E6:E10)” which adds all the values that are given in the range of cells...

Blurred answer
Students have asked these similar questions
Using the notation

you can select multipy options
For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education