Table 2: Onigiri Land Tickets PriceTicket TypeBablesAdult/TeenChild/Senior CitizenNormal priceRM 0.00RM 45.00RM 25.00OLSP cardRM 0.00 + Free mealRM 35.00RM 15.00You are required to design an algorithm, to calculate the amount ofticket price payable by Onigiri Land visitors. Your algorithm should beable to calculate the total amount of ticket price payable for anentire family or a group at one time.For example Calculate total amount for a family of one child, oneteen, and two adultsIn order to do this right, you need to get input from the user asfolows:How many number of tickets the buyer requires?• Does the buyer own an OLSP card?a) Draw a flowchart to represent your algorithm.b) Write o pseudocode to represent your algorithm.O EIACAdd a caption... InstagramYouAll Media12/24/21, 4:18 PMYour company is developing a ticketing system for a newamusement park called Onigiri Land. The Onigiri Land tickets arecategorised by age group category shown in Table 1 below. Thosewith privilege card (OLSP) has different tickets price as shown inTable 2Table 1: Onigiri Land Age CategoryCategoryAge GroupBabies0 to 3Child4 to 12 years oldTeen13 to 20 years oldAdult21 to 59 years oldSenior Citizen60 years old and above82F

/*Initialize baby_count, child_count, adult_count, senior_count to zero(0) */ /*Intialize total_cost…

Answered: b) Write o pseudocode to represent your…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Question 1: Please develop a program. The program shows a O(n^2) time complexity. You may design nested loops. When you input a number, the output should be how many times of the loops. For example, if your input is 10, the number of loops should be 100 times, 200 times, 300 times, etc. The number of loops do not have to be an accurate number. Question 2: Please develop a program. The program shows a O(nlgn) time complexity. You may design nested loops. When you input a number, the output should be how many times of the loops. For example, if your input is 10, the number of loops should be 30 times, 60 times, etc. The number of loops do not have to be an accurate number.
Q1) a) write down the Assign Mice to Holes algorithm. b) demonstrate it with sample data(data size must not be less than 8) c) calculate the complexity of the algorithm you have chosen
How do I attempt this question?
Question 1: Please develop a program. The program shows a O(n^2) time complexity. You may design nested loops. When you input a number, the output should be how many times of the loops. For example, if your input is 10, the number of loops should be 100 times, 200 times, 300 times, etc. The number of loops do not have to be an accurate number.
In python language please Input a sentence from the user and compute the following: Eg: Dont give up Find the ASCII value for each character of each word and calculate the sum. //hint use ord() & chr() function are used to find corresponding ASCII & char values in python. //*if you get any value ranges from 1 to 32 then replace with $ symbol //char[1-32]--->S Dont give up ASCII(D)=68 ASCII (0)=111 ASCII(n)=110 ASCII(t)=116 sum=68+111+110+116=405. The set are (40, 04), (45,54), (05,50). The biggest values in a set is(40, 54, 50). char(40)=( char(54)=6 char(50)=2 ASCII(g)=103 ASCII()=105 ASCII(v)=118 ASCII(e)=101 sum=103+105+118+101-427, The set are(42.24), (47,74),(27,72), The biggest values in a set is (42.74,72) char(42)=* char(74)=) char(72)=H ASCII(u)=117 ASCII (p)=112 sum=117+112=229, The set are (22.22). (29.92). (29.92), The biggest values in a set is(22.92.92) char(22)=$(Replaced with S)
The area A of a Hemisphere is computed using the following equation. A = 4Tr2 %3D where n=3.14159265 and r is the radius. Write an algorithm (Step 4 of problem solving methodology) that reads a radius r from a user then computes the area A using the above-mentioned formula. The algorithm repeats the same process for five positive radius values. [Hint: use any repetition structure]

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS