Requirements --> You have a store that sells lemons and oranges. Oranges are $.30 each and lemons are $.15 each. Your solution to this problem should get from the user the numbers of oranges and lemons he/she wants and outputs the total amount of money they owe you.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Algorithm writing
Instructions:
Algorithms are a generic way of describing a
solution to a computational problem without
use of any specific programming language
syntax. It cannot be executed on a real
computer, but it can model and resemble real
programming code. Natural language is used
whenever details are unimportant or
distracting.
Your algorithm:
Must be unambiguous (exact)..are the steps
numbered? .do we always know where to go next
or are we left hanging?
Must be correct (solves the problem)...are the
'requirements' being met?
Must come to an end (terminate)...how do we
know when to end this?
Must be general (for all cases).. .can we input
any data & still solve the problem?
Must be at the right level of detail... . will a
computer (in general) understand what we are
asking it to do?
Requirements --> You have a store that sells
lemons and oranges. Oranges are $.30 each and
lemons are $.15 each. Your solution to this
problem should get from the user the numbers
of oranges and lemons he/she wants and
outputs the total amount of money they owe
you.
Transcribed Image Text:Algorithm writing Instructions: Algorithms are a generic way of describing a solution to a computational problem without use of any specific programming language syntax. It cannot be executed on a real computer, but it can model and resemble real programming code. Natural language is used whenever details are unimportant or distracting. Your algorithm: Must be unambiguous (exact)..are the steps numbered? .do we always know where to go next or are we left hanging? Must be correct (solves the problem)...are the 'requirements' being met? Must come to an end (terminate)...how do we know when to end this? Must be general (for all cases).. .can we input any data & still solve the problem? Must be at the right level of detail... . will a computer (in general) understand what we are asking it to do? Requirements --> You have a store that sells lemons and oranges. Oranges are $.30 each and lemons are $.15 each. Your solution to this problem should get from the user the numbers of oranges and lemons he/she wants and outputs the total amount of money they owe you.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Avoiding deadlock
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education