Make an algorithm and flowchart of the following problem set. 7. Display the high school level of a student, based on its year-entry. For example, the year entry 1 (one) means the student is a freshman, 2 for sophomore and so on. Here are the given criteria: Year-entry number 1 High-school Level Freshman 2 Sophomore 3 Junior 4 Senior Other entry number Out-of-School

Make an algorithm and flowchart of the following problem set. 7. Display the high school level of a student, based on its year-entry. For example, the year entry 1 (one) means the student is a freshman, 2 for sophomore and so on. Here are the given criteria: Year-entry number 1 High-school Level Freshman 2 Sophomore 3 Junior 4 Senior Other entry number Out-of-School

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 17PE

See similar textbooks

Similar questions

Check these two codes and then answer these questions please: 1) Empirically, show the performance curve of the algorithm using time measurements 2) Using the basics of the theoretical analysis, write the complexity of its worst-casetime. 1. Approach: Non recursive: //include necessary header files#include <iostream>using namespace std;//main functionint main(){ int days,buy_on_this_day ,sell_on_this_day; //get number of days as input from user cout<<"Enter number of days: "; cin>>days; int stock_price[days]; for(int i=0;i<days;i++) { cout<<"Enter stock_price"; cin>>stock_price[i]; } int i=0; for(int i=0;i<days-1;i++) { //comparing current price with next day price and finding the minima while(i<days-1 && stock_price[i+1]<=stock_price[i]) i++; if(i==days-1) break; buy_on_this_day =i++; while(i<days && stock_price[i]>=…
Assuming A and B are two algorithms that solve the same problem, indicate whether each of the following statements is true or false:
# Exercise 1. Implement the algorithm covered in lectures that determines if an integer n is prime. Your function should return True, if n is prime, and False otherwise. Your algorithm has to be effective for n ~ 1,000,000,000,000.def isPrime(n):
Consider a network of streets laid out in a rectangular grid, In a northeast path from one point in the grid to another, one may walk only to the north (up) and to the east (right). Write a program that must use a recursive function to count the number of northeast paths from one point to another in a rectangular grid. Your program should prompt the user to input the numbers of points to the north and to east respectively, and then output the total number of paths. Notes: 1. Here is a file (timer.h download and timer.cpp download) which should be included in your program to measure time in Window or Unix (includes Mac OS and Linux) systems (use start() for the beginning of the algorithm, stop() for the ending, and show() for printing). 2. The computing times of this algorithm is very high, and the number of paths may be overflow, don't try input numbers even over 16. 3. Name your recursive function prototype as calcPath(int north, int east) to ease grading. 4. Paste your output
Write a recursive algorithm with the following prototype: int divide(int x, int y); that returns x/y (integer division). You need not test for divide by 0. THE FUNCTION MUST BE RECURSIVE. (hint: base case should be when x<y)
Write an algorithm that prompts the user for the radius, in inches, and price of a pizza, and then reads in those values. Finally, have the algorithm compute and output the pizza’s cost per square inch.
Let two words be given. At least how many steps must be taken to make one of these two words like the other? Each step can be one of the following 3 steps: 1- Drop a letter 2- Changing a letter 3- Add a letter (anywhere) Solve the question using only a brute force algorithm. Explain your solution and question write program in java language and calculate time complexity?
Let n be a positive integer and let MaxCrossing(n) be a function that returns the maximum number of line crossings that you can create by drawing n straight lines. Write down a recursive formula for MaxCrossing(n) and analyze the time complexity of the corresponding recursive algorithm. You must write a formal recursive formula including the base case and general recursive step.
Design an algorithm for checking whether two given words are anagrams, i.e., whether one word can be obtained by permuting the letters of the other. (For example, the words tea and eat are anagrams.)
In order to determine the minimum velocity and maximum height, a recursive approach can be employed. The implementation involves soliciting input from the user for the initial values of minimum velocity and maximum height, which will serve as the starting points for the recursive calculations?
A good algorithm should be free from ambiguity” briefly discuss
Write an algorithm and draw a flow chart for the given problem: A birdbath contains ½ (0.5) liters of water and a rainy day add 215 ml more water into the birdbath. How many total milliliters of water are in the birdbath after it rained? Hint: 1 liter = 1000 milliliters For this given problem try to identify what variables are given and what other variables you can have to calculate the total amount of water in birdbath