TCO #2– Given a simple business problem, design a solution algorithm that uses arithmetic expressions and built-in functions.

Assignment:
Your goal is to solve the following simple programming exercise. You have been contracted by a local restaurant to design an algorithm determining the total meal charges. The algorithm should ask the user for the total food purchase and the tip percent. Then, the algorithm will calculate the amount of a tip, a 7% sales tax, and the total meal charge (including tip). The food purchase, sales tax, tip amount, and total meal charge will need to be displayed to the customer.

Be sure to THINK about the logic and design first (IPO chart and pseudocode), then code the Visual Logic command line processing. Display all output using currency formatting (built-in Visual Logic function).

Advanced (optional): use a constants for the 7% sales tax.

Rubric:
When completed staple the following documents together neatly in 1,2,3,4 order:
•This instruction sheet first
•The IPO Chart, second
•The Pseudocode, third
•The Flowchart and output example last.

Point distribution for this application:
Meal Purchase
Document:
Points possible:
Points received
IPO Chart
6

Pseudocode
6

Flowchart
8

Total Points
20

IPO Chart:

Input
Processing
Output
Enter Total Food Purchase Price

Calculate Food price
Add Tip %* Total Food Purchased
Add 7% tax * Total Food Purchased

Total Meal Charge

Pseudocode:

Begin mealPurchase

Total Food Purchased
Imput total Purchased Food Amount
Please enter the amount for tip percent
Imput tip percent
Set total tip = tip percent/ 100
Set total tip=total tip *
Total food purchased amount
Set total tax= sales tax/100
Set total tax= total tax* = total food purchased amount

...INFORMATION TECHNOLOGY ASSIGNMENT
ON ALGORITHM
Done by
Densil Hamilton
INTRODUCTION
This Assignment was done to show the methods of algorithm. It outlines the meaning of algorithm and steps to be carried out to complete a give problem. Examples were also shown for the methods of representing algorithm.
What is an Algorithm?
An algorithm consists of a set of explicit and unambiguous finite steps which, when carried out for a given set of initial conditions, produce the corresponding output and terminate in finite time. (How to Solve it by Computer, RG Dromey, Prentice Hall UK, 1982)
This is done by a series of steps:
1. Input: there are zero or more quantities which are externally supplied;
2. Output: at least one quantity is produced;
3. Definiteness: each instruction must be clear and unambiguous;
4. Finiteness: if we trace out the instructions of an algorithm, then for all cases the algorithm will terminate after a finite number of steps;
5. Effectiveness: every instruction must be sufficiently basic that a person using only pencil and paper can in principle carry it out. It is not enough that each operation is definite, but it must also be feasible.
WAYS OF REPRESENTING ALGORITHMS
Two ways of represent an algorithm are:
Flowcharts
Pseudo Code
FLOWCHARTS
This is a...

...two types of charges such as positive and negative charges. Like matter, charges cannot also be created or destroyed, but rather transferred from one object to another. Rubbing materials together is the easiest way in order to charge them wherein one object will become negatively charged and the other one will become positively charged. Electric charges can be characterized by repulsion between two positivecharges or two negative charges, and can also be attraction between a positive charge and a negative charge. In this experiment, we were able to determine the presence of electrostatic charges with the use of an electroscope. It is performed by using three different kinds of rod (plastic, glass, and PVC), each rubbed with silk cloth, flannel cloth, and fur cloth. The observations we have done brought about the idea that the rods and cloths that attracted confirmed the presence of opposite charges in them while the rods and cloths that repelled confirmed the presence of similar charges in them.
INTRODUCTION
All matter contains positive and negative charges. Under normal circumstances, an object is “electrically neutral” which means that the number of positive charges that the object has is equal to the number of negative charges it has. An...

...Algorithms Homework – Fall 2000
8.1-1 Using Figure 8.1 as a model, illustrate the operation of PARTITION on the array A =
13 19 9 5 12 8 7 4 11 2 6 21
i j j
6 19 9 5 12 8 7 4 11 2 13 21
i i j j
6 2 9 5 12 8 7 4 11 19 13 21
i ………………………… j
return 11, SPLIT = and
8.1-2 What value of q does PARTITION return when all elements in the array A[p…r] have the same value?
q = (p+r)/2, where p = index 0, and r = highest index
8.1-3 Give a brief argument that the running time of PARTITION on a subarray of size n is (n).
In the worst case, PARTITION must move the j pointer by one element (to the 2nd to last element), and the i pointer all the way to j, making a comparison at each element along the way. Since there are n comparisons made, the running time is (n)
In the average (and best) case, PARTITION must move the j pointer to an element at or near the half-way point in the array and the i pointer all the way to j, making a comparison at each element along the way. Once again there are n comparisons made and the running time is (n)
8.2-1 Show that the running time of QUICKSORT is (n lg n) when all elements of array A have the same value.
T(n) =...

...In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length. Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity).
Algorithm analysis is an important part of a broader computational complexity theory, which provides theoretical estimates for the resources needed by any algorithm which solves a given computational problem. These estimates provide an insight into reasonable directions of search for efficient algorithms.
In theoretical analysis of algorithms it is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. Big O notation, Big-omega notation and Big-theta notation are used to this end. For instance, binary search is said to run in a number of steps proportional to the logarithm of the length of the list being searched, or in O(log(n)), colloquially "in logarithmic time". Usually asymptotic estimates are used because different implementations of the same algorithm may differ in efficiency. However the efficiencies of any two "reasonable" implementations of a given algorithm...

...Algorithm
is a list of instructions for carrying out some process step by step
Flowchart
is a diagram representing the logical sequence in which a combination of steps or operations is to be performed
Types of Flowcharts
Program Flowchart – describes graphically in detail the logical operations and steps within a program and sequence in which these steps are to be executed for the transformation of data to produce the needed output
System Flowchart – is a graphic representation of the procedures involved in converting data on input media to data in output form
Flowcharting Symbols
[pic]
Basic Control Structure
SEQUENCE – process is executed from one to another in a straight forward manner
SELECTION – a choice is provided between two alternatives based on conditions outcome as either TRUE or FALSE
ITERATION – or loop, enables certain operations/tasks/instructions to repeat. These tasks are repeated based on conditions outcome as either TRUE or FALSE
Sequence
[pic]
Examples
The length of a rectangle is equal to 5cm and its width is equals to 3cm. Create a flowchart that will display the area and perimeter of the rectangle.
Given three numbers A=3, B=6, C=9, and D=5. Draw a flowchart to compute and print out the sum, average, and product of the given values.
Selection
[pic]
Examples
Create a flowchart for a program that will accept two inputted values. And based on the inputted values the program will display the...

...for a detailed explanation of this day with samples), I recommend that you consume the following ratio of Carbs/Protein/Fat:
35-45% Carbs: 227-292 gm a day
35-45% Protein: 227-292 gm a day
20-25% Fat: 57-72 gm a day
On your "higher carb days" (see below for a detailed explanation of this day with samples), I recommend that you consume the following ratio of Carbs/Protein/Fat:
50-55% Carbs: 324-357 gm a day
25-35% Protein: 162-227 gm a day
15-20% Fat: 43-57 gm a day
Low Carb Day (Sun-Tues, Thurs-Friday)
Meal 1:
• Starchy carb
• Lean, complete protein
Samplemeal: High Protein Oatmeal (oatmeal and whey protein) and/or Protein Shake
This meal should be approximately 648 calories (25% of total daily calories), with carbs = 57-73 gm, protein = 57-73 gm, and fat = 14-18 gm.
Meal 2:
• Starchy carb
• Lean, complete protein
Samplemeal: Baked potato and Baked Fish (halibut, etc.)
This meal should be approximately 648 calories (25% of total daily calories), with carbs = 57-73 gm, protein = 57-73 gm, and fat = 14-18 gm.
Meal 3:
• Starchy carb
• Fibrous carb
• Lean, complete protein
Samplemeal: brown rice, steamed veggies, chicken breast
This meal should be approximately 519 calories (20% of total daily calories), with carbs = 45-58 gm, protein = 45-58 gm, and...

...PART A
Courts all over the world have set precedence’s of treating directors as trustees which means in the performance of their assigned legal and corporate duties, they stand in a fiduciary relation to the shareholders of the company. A director as a trustee shall act in the best of his ability to benefit the company and not in furtherance of his own interest.
Each of the four directors of the company stand in a fiduciary position to the company and thus liable for their acts of omission and commission to the shareholders of the company. They did not take adequate safeguards while deciding to invest a relatively huge sum of $20 million in a completely new business venture.
Section 232(2) and (3) of the Corporations Act has provided the followings:
An officer including a director of a corporation shall be duty bound to act with honesty of intentions as well as actions while exercising his powers vested while discharging his duties. This has been well documented in the case of Australian Growth ResourcesCorporation Pty Ltd v. Van Reesma (1988) 13 ACLR 261.Arthur who has already acquired stakes in Weaves Pty Limited should have disclosed his position to the Board of directors of Chance ltd. He was in a position to influence the Board and thus acted with sufficient and provable dishonesty. He is liable to be prosecuted under s.233.
It has been an established fact that if certain business decisions are taken and they don’t serve any rational purpose for the betterment...

...A
TERM
PAPER
ON
“Blowfish Encryption Algorithm“BLOWFISH ENCRYPTION ALGORITHM”
WRITTEN BY
NDIFON, PATRICK MANYOR
10/50050
COMPUTER SCIENCE
UNIVERSITY OF CALABAR
SUBMITTED TO
DR. F.U. OGBAN
COURSE LECTURER
IN PARTIAL FUFILMENT OF THE COURSE REQUIREMENT
CSC4211
SEPTEMBER 2014
TABLE OF
CContentsONTENTS
1. Introduction
2. Origin/Founder
3. Algorithm/Data Structures
4. Category/Performance:
5. Pseudocode
6. Implementation: C++, Java
7. Compare: Associated algorithm
8. Summarize
9. Conclusion
10. References
BLOWFISH ENCRYPTION ALGORITHM
General
Designers
Bruce Schneier
First published
1993
Successors
Twofish
Cipher detail
Key sizes
32–448 bits
Block sizes
64 bits
Structure
Feistel network
Rounds
16
Best public cryptanalysis
Four rounds of Blowfish are susceptible to a second-order differential attack (Rijmen, 1997);[1] for a class of weak keys, 14 rounds of Blowfish can be distinguished from a pseudorandom permutation (Vaudenay, 1996).
1. INTRODUCTION
The need for information security has resulted in many Encryption algorithms being developed. This term paper is aimed at analyzing one of those algorithms; the ‘Blowfish Encryption Algorithm’. What is an algorithm? One might ask. What is encryption? Before we can fully understand the ‘Blowfish Encryption Algorithm’, we must first understand briefly what...

4970 Words |
42 Pages

Share this Document

{"hostname":"studymode.com","essaysImgCdnUrl":"\/\/images-study.netdna-ssl.com\/pi\/","useDefaultThumbs":true,"defaultThumbImgs":["\/\/stm-study.netdna-ssl.com\/stm\/images\/placeholders\/default_paper_1.png","\/\/stm-study.netdna-ssl.com\/stm\/images\/placeholders\/default_paper_2.png","\/\/stm-study.netdna-ssl.com\/stm\/images\/placeholders\/default_paper_3.png","\/\/stm-study.netdna-ssl.com\/stm\/images\/placeholders\/default_paper_4.png","\/\/stm-study.netdna-ssl.com\/stm\/images\/placeholders\/default_paper_5.png"],"thumb_default_size":"160x220","thumb_ac_size":"80x110","isPayOrJoin":false,"essayUpload":false,"site_id":1,"autoComplete":false,"isPremiumCountry":false,"userCountryCode":"US","logPixelPath":"\/\/www.smhpix.com\/pixel.gif","tracking_url":"\/\/www.smhpix.com\/pixel.gif","cookies":{"unlimitedBanner":"off"},"essay":{"essayId":35461477,"categoryName":"Organizations","categoryParentId":"3","currentPage":1,"format":"text","pageMeta":{"text":{"startPage":1,"endPage":3,"pageRange":"1-3","totalPages":3}},"access":"premium","title":"Sample Solution Algorithm to Determine Meal Charges","additionalIds":[17,7,93,2],"additional":["Literature","Education","Education\/Greek System","Awards \u0026 Events"],"loadedPages":{"html":[],"text":[1,2,3]}},"user":null,"canonicalUrl":"http:\/\/www.studymode.com\/essays\/Sample-Solution-Algorithm-To-Determine-Meal-897376.html","pagesPerLoad":50,"userType":"member_guest","ct":10,"ndocs":"1,500,000","pdocs":"6,000","cc":"10_PERCENT_1MO_AND_6MO","signUpUrl":"https:\/\/www.studymode.com\/signup\/","joinUrl":"https:\/\/www.studymode.com\/join","payPlanUrl":"\/checkout\/pay","upgradeUrl":"\/checkout\/upgrade","freeTrialUrl":"https:\/\/www.studymode.com\/signup\/?redirectUrl=https%3A%2F%2Fwww.studymode.com%2Fcheckout%2Fpay%2Ffree-trial\u0026bypassPaymentPage=1","showModal":"get-access","showModalUrl":"https:\/\/www.studymode.com\/signup\/?redirectUrl=https%3A%2F%2Fwww.studymode.com%2Fjoin","joinFreeUrl":"\/essays\/?newuser=1","siteId":1,"facebook":{"clientId":"306058689489023","version":"v2.8","language":"en_US"}}