1) The algorithm will check if the customer is partner or not. 2) If the customer is a partner then the customer will be given a discount based on the following categories: If sales is >= 10000 then the discount is 50% if sales is >= 5000 the discount is 25% if sales is >= 1000 the discount is 10% if sales is < 1000 the discount is 5% 3) If the customer is not a partner then the customer will pay the full payment without any discount. 4) The algorithm should print the total sales, total discount, total sales after discount.

1) The algorithm will check if the customer is partner or not. 2) If the customer is a partner then the customer will be given a discount based on the following categories: If sales is >= 10000 then the discount is 50% if sales is >= 5000 the discount is 25% if sales is >= 1000 the discount is 10% if sales is < 1000 the discount is 5% 3) If the customer is not a partner then the customer will pay the full payment without any discount. 4) The algorithm should print the total sales, total discount, total sales after discount.

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

Related questions

Q: X166: nestParen Given a string, return true if it is a nesting of zero or more pairs of parentheses,…

A: Given To complete the java function public boolean nestParen(String str) { }

Q: I want Algorithm aswell for this particular question

A: To obtain the actual partition of the string, use a backtracking approach. Starting from dp[n],…

Q: fast please 1.In no more than 50 words, give two specific reasons why recursive functions are…

A: Introduction Recuresive Function: Code for recursive functions regularly uses loop configurations,…

Q: Here is another recursion example, but with less guidance. Write a function log2(x), which gives an…

A: Program Approach:- 1. Create the user-defined function whose name is log2(x). This function takes…

Q: After you have compiled a list of the various mathematical processes, sort them in a manner that is…

A: Launch: In mathematics, evaluating a mathematical statement involves following a precise sequence of…

Q: Write a recursive algorithm with the following prototype: int divide(int x, int y); that returns…

A: Solution :

Q: In the box below, write a recursive Fibonacci function that computes the Fibonacci number for input…

A: Input : n - an integer value Output : Fibonacci series from 0 to n using recursion

Q: Is the recursive solution to the triangle number the best way to obtain the triangle number? A.…

A: Answer: Introduction: In simple language, we can say that recursion is one of the methods that will…

Q: Write a recursive function to implement the recursive algorithm (determining the number of ways to…

A: Recursion is a computer programming process in which a function repeatedly calls itself during its…

Q: Complete the implementation for the recursive function repeat_digits), which takes a positive…

A: As per the requirement program is developed. Please check all the fill in the blanks are heighted in…

Q: Flip a fair coin repeatedly until you get two heads in a row (HH). What is the probability of…

A: To calculate the probability of getting two heads in a row (HH) in at most N tosses, we can use a…

Q: he algorithm uses the fact that the set to be permuted consists of distinct numbers. Thus, you…

A: #include<iostream> using namespace std; /* Function to swap two characters */ void…

Q: The word ladder game was invented by Lewis Carroll in 1877. The idea is to begin with a start word…

A: import java.io.BufferedReader; import java.io.File; import java.io.FileReader; import…

Q: In this programming assignment you will implement one or more of the integer multiplication…

A: The numeric answer should be typed in the space below. So if your answer is 1198233847, then just…

Q: Consider a rectangle whose side lengths are two consecutive Fibonacci numbers. (Of course, neither…

A: The idea is to break the rectangle into a square of size Fib(n - 1) and a rectangle of size Fib(n -…

Q: Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD)…

A: According to the information given:- We have to write a recursive implementation of Euclid’s…

Question

I want the algorithm for this question

A company decided to offer discount in the current season, the administration of the company
asked you to write an algorithm to help them to manage this process based on the following
specifications:
1) The algorithm will check if the customer is partner or not.
2) If the customer is a partner then the customer will be given a discount based on the
following categories:
If sales is >= 10000 then the discount is 50%
if sales is >= 5000 the discount is 25%
if sales is >= 1000 the discount is 10%
if sales is < 1000 the discount is 5%
3) If the customer is not a partner then the customer will pay the full payment without any
discount.
4) The algorithm should print the total sales, total discount, total sales after discount.

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

A recursive sequence is defined by - d k = 6 d k − 1 + 3 , for all integers k ≥ 2 and d1 = 2 Use iteration to guess an explicit formula for the above sequence.
Ex. 01 : Recursion About So far, we have learned that we can perform repetitive tasks using loops. However, another way is by creating methods that call themselves. This programming technique is called recursion and, a method that calls itself within it's own body is called a recursive method. One use of recursion is to perform repetitive tasks instead of using loops, since some problems seem to be solved more naturally with recursion than with loops. To solve a problem using recursion, it is broken down into sub-problems. Each sub-problem is similar to the original problem, but smaller in size. You can apply the same approach to each sub-problem to solve it recursively. All recursive methods use conditional tests to either 1. stop or 2. continue the recursion. Each recursive method has the following characteristics: 1. end/terminating case: One or more end cases to stop the recursion. 2. recursive case: reduces the problem in to smaller sub-problems, until it reaches (becomes) the end…
Need help with this python recursive basic pathfinding question. I have the layout of the code but I need help filling in the parts that say "pass" and I need the output of the code to match the sample run below. Our goal is to find a path (not the best path, but just any path) from A to Z. You see that the green path is not the shortest but it does let us navigate from start to finish. (The picture below) First, we need to know A and Z, our starting and ending points. We'll pass these into our function. I'm going to use a dictionary to represent this graph. Each node (vertex, circle) will have a name, in this case "A" and "Z" were the names of the nodes, but in the generated maps I'm going to use "Node 1", "Node 2", "Node 3", etc. Here is an example web_map web_map = { 'Node 1': ['Node 3', 'Node 2'], 'Node 2': ['Node 1', 'Node 4'], 'Node 3': ['Node 1'], 'Node 4': ['Node 2'] } Node 1 is connected to 2 and 3 for instance, and then also note that Node 3 is connected back to…
Write a Recursive Function to print number from Given input down to 0?
How do Numerical Methods go about solving a set of equations? Using your own words, please explain the algorithm used in at least one of the methods.
IN PYTHON: Using a function, create a list of 20 numbers randomly between 1-99. With recursive function, you are going to take the numbers from the list, one at a time starting at position 0 and add them together. If the numbers added together equals a user specified sum, stop the program and show the two digits that sum together. If not, remove the first number from the list and add the next two. Continue running the program until you have reached the end of the list. sample output: randomly selected numbers: [61, 6, 78, 3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] User input : 86 61 + 6 = 67 FALSE [6, 78, 3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 6 + 78 = 84 FALSE [78, 3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 78 + 3 = 81 FALSE [3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 3 + 64 = 67 FALSE [64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 64 + 22 = 86 TRUE!
Hi I would help with completing this. Thank you
I want solution with steps
10. write general plan for analyzing recursive algorithms.
Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence A of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ...., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem. (b) Draw a call-stack…
Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum([2, 5, 10, 6], 12) true skipSum([2, 5, 10, 6], 7) false skipSum([2, 5, 10, 6], 16) false Given code: public static boolean skipSum (List list, int sum) { // call your recursive helper method return skipSumHelper (list, e, sum); 1. 2. 3. 4.
Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence ? of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ..., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem. (b) Draw a call-stack…