5-Write an algorithm using pseudocode or draw a flowchart for the following problem: You have five different numbers (random numbers). How you can find and print the second maximum number? For instance, suppose the numbers are: 12, 80, 55, 9 and 30. Your algorithm must print 55 as the second maximum number. (10 Marks)

5-Write an algorithm using pseudocode or draw a flowchart for the following problem: You have five different numbers (random numbers). How you can find and print the second maximum number? For instance, suppose the numbers are: 12, 80, 55, 9 and 30. Your algorithm must print 55 as the second maximum number. (10 Marks)

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 7PP: (Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point...

See similar textbooks

Similar questions

/*code Kth Largest Factor A positive integer d is said to be a factor of another positive integer N if when N is divided by d, the remainder obtained is zero. For example, for number 12, there are 6 factors 1, 2, 3, 4, 6, 12. Every positive integer k has at least two factors, 1 and the number k itself.Given two positive integers N and k, write a program to print the kth largest factor of N. Input Format: The input is a comma-separated list of positive integer pairs (N, k). Output Format: The kth highest factor of N. If N does not have k factors, the output should be 1. Constraints: 1<N<10000000000 1<k<600. You can assume that N will have no prime factors which are larger than 13..
Q2: Write an algorithm and draw flowchart for printing odd numbers less than a given number (n). They should also calculate their sum and count.
1. Write an algorithm that asks the user to enter ten numbers and then prints the largest one.2. Write an algorithm that asks the user to enter a positive integer n and prints the sum of the divisors of n.
Three numbersa. Write a program that reads three numbers and prints “all the same” if they are allthe same, “all different” if they are all different, and “neither” otherwise.b. Write a program that reads three numbers and prints “increasing” if they are inincreasing order, “decreasing” if they are in decreasing order, and “neither”otherwise. Here, “increasing” means “strictly increasing”, with each value largerthan its predecessor. The sequence 3 4 4 would not be considered increasing.c. Repeat part b. but before reading the numbers, ask the user whetherincreasing/decreasing should be “strict” or “lenient”. In lenient mode, thesequence 3 4 4 is increasing and the sequence 4 4 4 is both increasing anddecreasing
6- You have two numbers ABCD and WXYZ (ex: 2345 and 7965). Write an algorithm using Pseudocode that decides whether ABCD is the inverse of WXYZ. (For example, if ABCD is 2356 and WXYZ is 6532 then the algorithm prints "Inverse" otherwise it will print "Not Invers")
69 ۳ ۱:۳ ۱ ص |0,ك.بث © ۷ Assignment No 4 (1).. Assignment No4 Given the 3 dimensions of a box (length, width, and height), draw a flow chart to find if this box is cubic or not. (note that the box is cubic when all dimentions are equal) 1. Answer 2. Given an integer number, write an algorithm to find if the number is even or odd? Answer:
QuadraticAA.java Write a program that solves quadratic equations of the form , where The values A, B, and C will be real numbers (doubles) that you will request from the user. The equation below is what is used to solve for . Remember, there will be two solutions for x (not necessarily distinct). No loops are necessary, so don’t include any. To find the two solutions for this equation, you will use the quadratic formula: Remember that it must be solved for both the and : You will ask the user to input a value for A, B, and C (in that order, using those same letters), then you will use those values to find the two values of x as above. Your output MUST then display the original quadratic equation back to the user with their coefficients in place, and then output the two results. We will assume that the user will not put zero for A. *Format ALL OUTPUT VALUES (including the equation) to have only two decimal places. There is a test case below. Your program should run the…
واجب دراسي1 اكتب خوارزمية ورسم المخط ط الانسيابي لحساب مساحة عد د من الدوائر نصف القطر يبدا من 1 الى 20 Home work1: Write an algorithm and draw flow chart to calculate the area of a number of circles with radius from 1 to 20 A=pie*R?
Exercise III: Catalan numbers For n e N, denote by c, to be the number of ways to form a "mountain range" with n upstrokes (U) and n downstrokes (D) that all stay above a horizontal line. For instance: for n = 1, only UD is allowed, so c = 1; • for n = 2, only UUDD and UDUD are allowed, so c2 = 2. 1. Check that c3 = 5 by writing down or drawing all possible options. 2. Consider the power series +00 g(x) = 2 n=0 (by definition co = 1) called the generating function of the sequence (en). Justify that cn < 4" for each n, and deduce that the radius of convergence of g is at least 1/4. 3. It can be show that for r E (-1/4, 1/4), g(x) = 1+ xg(r)? and therefore 1- VI 4.x g(x) = 2.x Use this formula and the known power series of V1+ x to write the first terms of the power series expansion of g, in the form g(x) = co + c1x + c2x2 + C3x + c4x* + ·.. Show how you obtain a few terms, but you do not need to show all computations and you can use a calculator for fractions. Check that you recover co,…
1) BFS refresher: Suppose you have an n × n chessboard and a knight placed in one of the squares. Youwould like to find out the fewest number of moves needed to reach a given target square. Design an algorithmfor this task stated formally below: Input: An n × n chess board, a starting square S, and a target square T.Output: The fewest number of moves a knight takes to move from S to T. Write in Pseudocode, please.
Suppose you want to deposit a certain amount of money into a savings account, and thenleave it alone to draw interest for the next 10 years. At the end of 10 years, you would like tohave $10,000 in the account. How much do you need to deposit today to make that happen?You can use the following formula, which is known as the present value formula, to find out:The terms in the formula are as follows: [5 marks]• P is the present value, or the amount that you need to deposit today.• F is the future value that you want in the account. (In this case, F is $10,000.)• r is the annual interest rate.• n is the number of years that you plan to let the money sit in the account.Write a method named presentValue that performs this calculation. The method should accept the future value, annual interest rate, and number of years asarguments. It should return the present value, which is the amount that you need to deposit today.Demonstrate the method in a program that lets the user experiment with…
Givenx = 9, and y = 4, compute the product p = x ÷ y by using Unsigned Binary Division Algorithm, where each number is represented using 4 bits. Note: x is the dividend and y is the divisor You MUST SHOW the STEPS of the calculation. The flowchart of Unsigned Binary Division algorithm is shown below. START A-0 M-Divisor Q-Dividend Count Shift Left A, Q A-A-M No Yes A<0? Qo–1 A-A+M Count-Count– 1 No Yes Count = 0? Quotient in Q Remainder in A END