(Numerical) a. The following is an extremely useful
Step 1: Multiply the number by
Step 2: Add 0.5
Step 3: Delete the fractional part of the result
Step 4: Divide by
For example, using this algorithm to round the number 78.374625 to three decimal places yields:
Using this algorithm, write a C++ function that accepts a user-entered value and returns the result rounded to two decimal places.
b. Enter, compile, and run the program written for Exercise 11a.
Want to see the full answer?
Check out a sample textbook solutionChapter 6 Solutions
C++ for Engineers and Scientists
- Use c++: Enter n numbers stop with sentinel (-1) and show how many and which are odd and even: Example: 29431065 The pairs are 4: 2,4,10,6 The odd ones are 3: 9,3,5 Do not use and, or, functions or arrayarrow_forwardDescription Xiao Zhang is often distressed because there are too many things to arrange. Now he has n tasks at hand, and each task has a starting times, and an ending time e;. To complete a task, he must do it from the starting time to the ending time, and Xiao Zhang can only perform one task at the same time. Xiao Zhang wants to know how many tasks he can accomplish at most. Input The first line is an integer n (1sns300000), indicating the number of tasks Xiao Zhang has at hand. In the next n lines, each line contains two integers s₁, e¡ (1≤s;arrow_forwardany one help me to solve this code write a code to do the following: 1. check if the number stored in AL is a capital english number between A to Z 2. convert the capital letter in AL to a small letterarrow_forward1a) Give the values of the following: M[i,i+1] for i=1,...,5 M[i,i+2] for i=1,...,4 M[i,i+3] for i=1,...,3 f M[1,5] and M[2,6] M[1,6]. b) How do you place the parentheses to compute A by this number of scalar multiplications? For multiplication from left to right write ((((A1A2)A3)A4)A5)A6. c) How many ways to place the paratheses to compute A are there that achieve the minimum number of scalar multiplications?arrow_forward(Mathematical Analysis of Recursive Algorithms) 9. Consider the following recursive algorithm for computing the sum of the first n cube: S(n) = 1³ +23³ +3³ +...+n³. Algorithm S(n) //Input: A positive integer n //Output: The sum of the first n cubes if n = 1 return 1 else return S(n − 1) +n*n*n a) Set up and solve a recurrence relation for the number of times the algorithm's basic operation is executed. b) How does this algorithm compare with the straightforward non-recursive algorithm for computing this function?arrow_forwardFind the error in the following codearrow_forward(PYTHON) A Krishnamurthy number is a number which sum of the factorial of its digits is equal to the number itself. For example: Let us consider the number 145. Factorial sum = 1! + 4! + 5! = 1 + 24 + 120 = 145. Therefore 145 is a Krishnamurthy number. Other examples include: 1, 2, 40585. Write a program that does the following: • asks the user to input an integer. • computes whether the number is a Krishnamurthy number. • then finally prints the result. Note: You are not allowed to use the built-in function math.factorial.arrow_forwardThe hexadecimal numeration system, used in computer programming, is a base sixteen system that uses the symbols 0, 1,2,3,4,5,6,7, 8,9, A, B, C, D, E, and F. Change the following hexadecimal numeral to a base ten numeral. 2CDExtenarrow_forwardCode on Python The following data are given: x= [1, 3, 5, 7]; y=[ln (1), ln (3), ln (5), In (7)] 1. a) Write the python program to interpolate the above data using the Newton's divide- difference method. b) Print out the divide difference cofficients. c) Estimate the logarithm of 2. Print out the true value, interpolating value and the true relative error in %. d) Show on a graph the true function In(x), interpolating polynomial and data points.arrow_forwardQ1:- Example 1: Write a program that solves a quadratic equation using Quadratic equation -b± vb² – 4ac 2а b² – 4ac > 0 x = -b b² – 4ac = 0 2a If the sub-radical value is less than zero, print the expression (the root is complex) Q2- write matlab code to sum the following x5 + x7arrow_forwardType in pseudocode which computes the following sums.arrow_forwardThe following binary sequences are stored in two distinct 16-bit memory locations: A = 10010001 11000111 B = 01111010 11101000 Hint: You can use calculators/tools, but you should show the calculation procedure for each case Find both binary and decimal values of Z=A+B if A, B, and Z are all signed a integers. Find both binary and decimal values of Z=A+B if A, B, and Z are two's b complement numbers. If A and B are two Boolean vectors (vectors in which every element is TRUE or C FALSE), find the outcome of the following bit-wise logical operation: (A&&B)||(!A&&!B). What would be the data type and the corresponding value of Z=A+B (written d in Python) if A and B represent two ASCII Strings (Find ASCII table in appendix). If A represent the first two bytes (network prefix) and B represents the last e two bytes (host suffix) of a class B IPV4 address, find the corresponding IP address.arrow_forwardarrow_back_iosSEE MORE QUESTIONSarrow_forward_ios
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT