By implementing our own function (no use of pow), give me an example that would write a program that runs like the following (user input is bolded): [ace@sally ~]$ g++ lab8.cpp [ace@sally ~]$ ./a.out Base: 2 Exponent: 10 2^10 is 1024 Given integers x and y: xy = x1 * x2* … * xy when y is positive xy = 1 when y is 0 xy = 1 / (x |y|) when y is negative Program preconditions: • user input will be whole numbers • user input will be valid (no “Base: five”)

By implementing our own function (no use of pow), give me an example that would write a program that runs like the following (user input is bolded): [ace@sally ~]$ g++ lab8.cpp [ace@sally ~]$ ./a.out Base: 2 Exponent: 10 2^10 is 1024 Given integers x and y: xy = x1 * x2* … * xy when y is positive xy = 1 when y is 0 xy = 1 / (x |y|) when y is negative Program preconditions: • user input will be whole numbers • user input will be valid (no “Base: five”)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Write a program in python with a function timestable(n), which prints a multiplication table of size n. For example, timestable(5) would print: 12345 2 3 4 5 4 6 8 10 6 9 12 15 8 12 16 20 10 15 20 25Use the function in a program where you ask the user for n and you print the corresponding table.
Write a python program that will take two inputs from the user. One string with a length greater than 2 One number (integer) [Assume the number is always less than the length of the given string.] Your task is to check which indexes of the given string are divisible by the given number. If the character of the divisible index is a vowel (a, e, i, o, u), then replace it with “YES”. Otherwise, replace it with “NO”. [Cannot use built-in replace function.] ======================================================================== Sample Input 1: Python is love 3 Sample Output 1: NOytNOonNOisNOloNOe Explanation 1: None of the indexes divisible by 3 has any vowels. Therefore all of the corresponding characters were replaced by “NO”. ======================================================================== Sample Input 2: Python is good 4 Sample Output 2: NOythYESn iNO goYESd Explanation 2: The 4th and 12th index is divisible by 4 and also contain one of the vowels. Therefore…
Write a program that uses a User-Defined Function (UDF) that solves for the value of Y as a function of x in the equation shown below: The equation is an infinite series of terms, so the UDF must use an infinite loop to sum up all the terms in the series, add only all terms greater than 1 x. If the term is already less than 1 x, terminate the infinite loop, print the computed value of the sum of the series as the value of y for that value of x on the 2nd column of the Table and the corresponding value of on the 3rd column of the Table shown below which the program must print. The UDF must be declared to be of type void and will accept the value of x as one of its argument and will return its computed value of Y corresponding to that value of x through its reference parameter, &T. The UDF must be declared as: void Y( double x, double &T), use the built-in function to compute the corresponding value of on the 3rd column of the Table. The UDF must be able to compute for…
Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to print the string in reverse. Ex: If the input is 6, the output is: 110 Your program must define and call the following two functions. The IntegerToReverseBinary function should produce a string of 1's and 0's representing the integer in binary (in reverse). The ReverseString function should print a string representing the input string in reverse. void IntegerToReverseBinary(int integerValue, string &string)void ReverseString(const string &userString)
Write a function that takes an unsigned integer andreturns the number of '1' bits it has(also known as the Hamming weight).For example, the 32-bit integer '11' has binaryrepresentation 00000000000000000000000000001011,so the function should return 3.T(n)- O(k) : k is the number of 1s present in binary representation.NOTE: this complexity is better than O(log n).e.g. for n = 00010100000000000000000000000000only 2 iterations are required.Number of loops isequal to the number of 1s in the binary representation."""def count_ones_recur(n):.
Write a function that takes an unsigned integer andreturns the number of '1' bits it has(also known as the Hamming weight).For example, the 32-bit integer '11' has binaryrepresentation 00000000000000000000000000001011,so the function should return 3.T(n)- O(k) : k is the number of 1s present in binary representation.NOTE: this complexity is better than O(log n).e.g. for n = 00010100000000000000000000000000only 2 iterations are required..
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assume that the positions of bits count from right to left.That is, the first bit is the least significant bit.data_a DCD 0x77FFD1D1data_b DCD 0x12345678
Write a program that swaps 5th~11th bits in data_a with 25th~31th bits in data_bYour program must work for any data given, not just the example belowIn this question, we assmue that the positions of bits count from right to left.That is, the first bit is the least significant bit.
Write a program that converts an ASCII text string from memory into all lowercase and stores the output to memory. The input string can contain uppercase and lowercase letters as well as spaces, punctuation (period, comma, question mark, exclamation point), and decimal digits. The input string will be null-terminated (that is, end with a 0 byte) and the output string is also to be null-terminated. (Observe: a 0 byte is different than the ASCII code for decimal digit 0 , which is 0x30.) Example: Convert the string "IN 2023, faLL stARTs on September 23." to "in 2023, fall starts on september 23.".
Write a function timestable(n), which prints a multiplication table of size n. For example, timestable(5) would print: 1 2 3 4 5 2 3 4 5 4 6 8 10 6 9 12 158 12 16 2010 15 20 25Use the function in a program where you ask the user for n and you print the corresponding table.
(Program) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters, such as zerocount, onecount, twocount, and so forth, to 0. Then generate a large number of pseudorandom integers between 0 and 9. Each time 0 occurs, increment zerocount; when 1 occurs, increment onecount; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of time they occurred.
Implement the quadratic_formula() function. The function takes 3 arguments, a, b, and c, and computes the two results of the quadratic formula: x1=−b+b2−4ac2a x2=−b−b2−4ac2a The quadratic_formula() function returns the tuple (x1, x2). Ex: When a = 1, b = -5, and c = 6, quadratic_formula() returns (3, 2). Code provided in main.py reads a single input line containing values for a, b, and c, separated by spaces. Each input is converted to a float and passed to the quadratic_formula() function. Ex: If the input is: 2 -3 -77 the output is: Solutions to 2x^2 + -3x + -77 = 0 x1 = 7 x2 = -5.50 code: # TODO: Import math module def quadratic_formula(a, b, c):# TODO: Compute the quadratic formula results in variables x1 and x2return (x1, x2) def print_number(number, prefix_str):if float(int(number)) == number:print("{}{:.0f}".format(prefix_str, number))else:print("{}{:.2f}".format(prefix_str, number)) if __name__ == "__main__":input_line = input()split_line = input_line.split(" ")a =…