Write a C program to compute the real roots of a quadratic equations. ax + bx +c = 0The roots are given by the equationsь? - 4ась? - 4асX1 = -b +X2 = -b -2a2aThe program should request for the values of the constantsa, b and c and print the values of x1 and x2. Use thefollowing rules:(a) No solution, if both a and b are zero(b) There is only one root, if a= 0(c) There are no real roots, if b²- 4ac is negative(d) Otherwise, there are two real roots

Answered: (a) No solution, if both a and b are…

(a) No solution, if both a and b are zero (b) There is only one root, if a = 0 (e) There are no real roots, if b²- 4ac is negative (d) Otherwise, there are two real roots

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 6PE

See similar textbooks

Similar questions

(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
Currency Traders wants a program that converts American dollars to British pounds, Mexican pesos, and Japanese yen, and then displays the results. Use the following conversion rates for one American Dollar: .6318 British pounds, 12.8863 Mexican pesos, and 82.34 Japanese yen. First, create an IPO chart for this problem, and then desk-check the algorithm twice, using 1000 and 50 as the number of American dollars.
In C++ (Algebra: solve 2 × 2 linear equations) You can use Cramer’s rule to solve the following 2 × 2 system of linear equation: ax + by = ecx + dy = fx = (ed - bf) / (ad - bc)y = (af - ec) / (ad - bc) Write a program that prompts the user to enter a, b, c, d, e and f and displays the result. If ad - bc is 0, report that “The equation has no solution”. Sample Run 1 Enter a, b, c, d, e, f: 9.0 4.0 3.0 -5.0 -6.0 -21.0 x is -2 and y is 3 Sample Run 2 Enter a, b, c, d, e, f: 1.0 2.0 2.0 4.0 4.0 5.0 The equation has no solution
C++ Programming Exercise: A real estate office handles, say, 50 apartment units. When the rent is, say, $600 per month, all the units are occupied. However, for each, say, $40 increase in rent, one unit becomes vacant. Moreover, each occupied unit requires an average of $27 per month for maintenance. How many units should be rented to maximize the profit? Write a program that prompts the user to enter: a. The total number of of units. b. The rent to occupy all the units. c. The increase in rent that results in a vacant unit. d. Amount to maintain a rented unit. The program then outputs the number of units to be rented to maximize the profit.
The ABC Lumber Co. asks you to write a Phyton program that would produce a table of g properties of its rectangular cross- section lumber. The dimension of the wood is given as base and height in inches. The table is to include the following information:
Please code in C++. Write a program that simulates a coin-tossing game. At the beginning of the game, each of N players has a single fair coin and M points. The game performs a sequence of passes until only a minimum number of players remain. In a pass the players toss their coins into the air and when the coins fall to earth, the players count the number of coins that show heads and the number of coins that show tails. If the number of heads exceed the number of tails, then the players who tossed heads increase their points by an integer P and the players who tossed tails decrease their points by the same integer P. The players perform the opposite actions when the number of tails is greater than the number of heads. If the number of heads equals the number of tails, then no player’s points change. If any player’s points fall below one, then the player leaves the game, never to return. The game employs a second integer K to compute P’s value. K’s and P’s initial values are one.…
Find the error/s in the following code, highlight and write the correct code on a piece of paper. 1. discr == b*b - 4*a*c; if discr < 0 disp(’Warning: discriminant is negative, roots are imaginary’) else discr =0 disp(’Discriminant is zero, roots are repeated’) elseif disp(’Roots are real’) end 2. n = 5;A = eye(n):for j=2,n for i=1:j-1 A(i,j)=i/j; A[j,i]=i/j; Endend
In c++ A driver needs help finding the shortest path travelling between a number of points. There are 6 Points, and each point has a coordinate.. the points are as follows Point A 11 6 Point B 29 10 Point C 10 4 Point D 45 19 Point E 21 12 Point F 40 1 How will you calculate and find which point has the shortest path between these points Note: the driver should travel through these points once, you can also check every possible solution and measure which is best. The program should also display which Point was the shortest aswell as which one was the second shortest(in ascending order) Like example the shortest Path are as follows: C,B,A,E,F,D
In this assignment you will write your own square root function and a main program to test it. Thesquare root function will return a tuple the includes the square root of the number as well as thenumber of iterations it took to arrive at that solution. The pseudocode for the function and mainprogram is given as follows:import mathEPSILON = 1.0e-14def square_root(number):approximation = 1previous = 0iterations = 0while ((absolute value of (approximation * approximation minus number)is greater than EPSILON) and previous != approximation):previous = approximationapproximation = 0.5 * (approximation + number / approximation)iterations += 1return (approximation, iterations)print('This program calculates the square root of an inputted number')print('and the number of iterations that the algorithm took to reach')print(f'a degree of accuracy of {EPSILON}.')answer = “yes”while answer[0] equals “Y” or answer[0] equals “y”:number = float(input('Enter a nonnegative number: '))while number is less…
This Code print the first occurrences of x, Modify the code to print the last occurrences of x and print how many times it exists? ( with explanation for each line if possible) many thanks.
Modified coin-row problem:If we modified the coin-row problem, so that you cannot take the adjacent coin, and youcannot take the coin next to the adjacent coin also (see example below), what would thedynamic programming formula F(n) be?Example: A, B, C, D, E, F, G, H, I, JIf A is taken, then B & C cannot be taken, but D (or above D, like E and so on) can be taken.If B is taken, then A, C, D cannot be taken.And so on.
Use C++ Write a program that simulates flipping a coin to make decisions. The input is how many decisions are needed, and the output is either heads or tails. Assume the input is a value greater than 0. Ex: If the input is: 3 the output is: heads tails heads For reproducibility needed for auto-grading, seed the program with a value of 2. In a real program, you would seed with the current time. In that case, every program's output would be different, which is what is desired but can't be auto-graded. Note: A common student mistake is to call srand() before each call to rand(). But seeding should only be done once, at the start of the program, after which rand() can be called any number of times. Your program must define and call the following function that returns "heads" or "tails".string HeadsOrTails()