7. What will be the output for the following program?templen ←YesYesStartsum sum + i"1234567890"sum - 0k← 1length_of(temp)Loopk>lenito_ascii(temp[k])48Nok+k+1i rem 4 = 0PUT sumEndNo

The given flowchart represents a program that performs a specific calculation on a given string,…

Answered: 7. What will be the output for the…

7. What will be the output for the following program? temp - "1234567890" len - Yes Start Yes sum sum + i sum 0 k 1 length_of(temp) Loop k>len ito_ascii(temp[k]) - 48 No k+k+1 i rem 40 PUT sum End No

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter11: Inheritance And Composition

Section: Chapter Questions

Problem 28SA

See similar textbooks

Similar questions

How do you write a Recursion function 'int numTwos(int n)' which returns the number of 2's in the base-4 expansion of n. cout << numTwos(2170) << endl; // should display "3" without using the following loops: -no for loops -no while loops -no do-while's -no while-do's -no for-while's -no while-for-do's
Hello, How can I store a whole book in a file in c language? I had some issues because the string is too long. here is the question: For this assignment I have uploaded a large text file that contains the entire book “Robinson Crusoe” byWilliam Defoe as file defoe-robinson-103.txt Consider the code shown below. It uses the fgets function.fgets is used to read (“get”) strings (“s”) from a file (“f”), hence the name “fgets”. It takes the following arguments:1. A pointer to an array large enough to store the string. In our case that is the char array calledbuffer of size MAX.2. The size of the array, in our case the symbolic constant MAX, set equal to 4000 in line 4.3. The file pointer of the file to read from, in our case bkPtr. Each call to fgets returns a string until the newline (“\n”) character or EOF is encountered. The codereads strings from the file defoe-robinson-103.txt in the while loop and prints them to screen.Implement this program and run it.
Write a recursive function named largestDigit that accepts an integer parameter and returns the largest digit value that appears in that integer. Your function should work for both positive and negative numbers. If a number contains only a single digit, that digit's value is by definition the largest. You must not use any loops; you also cannot use the string type or any library functions. Your function must be recursive. Complete the following file: largestDigit.cpp 2 // You may use this helper function 3 int max(int a, int b) { return a < b ? b : a; } 4 5 int largestDigit(int n) if((n<0) && (n/10 if(n<0) n = 0)) return n; 8 -n; static int maxi 9 n%10; 0) return maxi; maxi = max(maxi, n%10); return largestDigit(n/10); = 10 if((n/10) 11 12 13 14 15 16 } Submit Calling with Arguments Name Arguments Actual Expected pass largestDigit 135725 7 7 pass largestDigit 111211 2 2 fail largestDigit 100000 1 pass largestDigit 4530021 5 pass largestDigit 7639852 fail largestDigit 76352 6 pass…
Use a for loop to modify each element of arrfile4 by 2Use a for loop to modify each element of arrfile4a by 3 write the new contents of arrfile4 to file4by2write the new contents of arrfile4a to file4aby3 CODE: import java.util.*; import java.io.*; public class Pwriter2 { public static void main(String[] args) throws IOException { PrintWriter tofile2 = new PrintWriter ("file4.txt"); PrintWriter tofile2A = new PrintWriter ("file4a.txt"); int[] arrfile4=new int [10]; int[] arrfile4a=new int [10]; int i=0; while(i<10) { arrfile4[i]=i+1 ; tofile2.println(arrfile4[i] ); arrfile4a[i]=i+11; tofile2A.println(arrfile4a[i]); i=i+1; } tofile2.close(); tofile2A.close(); } }
NEED HELP WITH PYHTON..PASTE INDENTED CODE PLZZ 4. Boolean Functiona) Define a function, isInRange() with an integer parameter, x. This function returns true if the integer number x is in the range (-100, 100). Otherwise, return false. b) Define a main() function, in which a loop will be created to do the following ten times: 1) Get a random integer, n, in the range (-500, 500). 2) Call isInRange(x) function to determine and print out if the number n is in the range. c) Call main() function to initiate the tasks to be performed. Example Output 2 is in the range. -358 is not in the range. -44 is in the range. 297 is not in the range. -295 is not in the range. 205 is not in the range. 467 is not in the range. -116 is not in the range. 388 is not in the range. 53 is in the range.
Java, I am not displaying my results correct. It should add up the digits in the string. input string |result for the sumIt Recursion functions and a findMax function that finds the largest number in a string "1d2d3d" | 6 total "55" |10 total "xx" | 0 total "12x8" |12 Max number "012x88" |88 Max Number "012x88ttttt9xe33ppp100" |100 Max Number public class Finder { //Write two recursive functions, both of which will parse any length string that consists of digits and numbers. Both functions //should be…
Write your codes in a single m.file Write commend to each line for explaining the line Write a code to generate the x and y values for a single butterfly using a for loop. The equations for a butterfly were discovered by Temple H. Feyl in 1989: = cos* - 2 cos(4t) –(sin() x = xo +s* f * sint y = yo +s* f * cost Here t goes from 0 to 40pi (first try with step size of 1 and then change it to step size of 0.01), x0 and y0 are the location of the butterfly center, and s scales the height of the butterfly. Notice that these are algebraic equations, not differential equations. Also pay attention for element by element calculations in matrix operations. 1) Plot a magenta butterfly by considering s=0.1, x0=1, y0=1 2) Plot a different figure blue butterfly having twice height of the first one, x0=3, y0=3 3) Put both plots in a single figure Write Happy Spring as tittle, Happy to y-axis and Spring to the x-axis and legend Loving Butterflies! of all figures. Here is a hint for the item 1 output;…
Write your codes in a single m.file Write commend to each line for explaining the line Write a code to generate the x and y values for a single butterfly using a for loop. The equations for a butterfly were discovered by Temple H. Feyl in 1989: f = ecost - 2 cos(4t) -(sin ) x = xo +s* f * sint y = yo +s f* cost Here t goes from 0 to 40pi (first try with step size of 1 and then change it to step size of 0.01), x0 and y0 are the location of the butterfly center, and s scales the height of the butterfly. Notice that these are algebraic equations, not differential equations. Also pay attention for element by element calculations in matrix operations. 1) Plot a magenta butterfly by considering s=0.1, x0=1, y0=1 2) Plot a different figure blue butterfly having twice height of the first one, x0=3, y0=3 3) Put both plots in a single figure Write Happy Spring as tittle, Happy to y-axis and Spring to the x-axis and legend Loving Butterflies! of all figures.
The Fibonacci sequence is a famous sequence in mathematics. The first element in the sequence is 0 and the second element is 1. The nth element is defined as Fn = Fn-1 + Fn-2- Implement the fib function, which takes an integer n and returns the n th Fibonacci number. Use a while loop in your solution. def fib(n): """Returns the nth Fibonacci number. >>> fib (0) 0 >>> fib (1) 1 >>> fib(2) 1 >>> fib(3) 2 >>> fib(4) 3 >>> fib(5) 5 >>> fib(6) 8 >>> fib (100) 354224848179261915075 "*** YOUR CODE HERE ***"
The following requirments that weren't mentioned for solving the following Python Code below: The provided code for alphabet, test_dups, test_miss, and histogram. Your implementation of the has_duplicates function. A loop that outputs duplicate information for each string in test_dups. Your implementation of the missing_letters function. A loop that outputs missing letters for each string in test_miss. Write a function called missing_letters that takes a string parameter and returns a new string with all the letters of the alphabet that are not in the argument string. The letters in the returned string should be in alphabetical order. Your implementation should use a histogram from the histogram function. It should also use the global variable alphabet. It should use this global variable directly, not through an argument or a local copy. It should loop over the letters in alphabet to determine which are missing from the input parameter. The function missing_letters should…
+ genuity.com/player/ Semester A 1 1 2 2 3 4 5 3 return 1 else: 05 4 return n* factorial(n-1) Which line of code includes a recursive function call? O 3 04 01 Consider the Python code for finding the factorial of an integer n using recursion. Line numbers have been added to the left of each line of code. def factorial(n): if n == 1: Mark this and return O M B DELL A EXXI A Save and Exit 10 Next 2 G < ☆ 0 English V Sign out 19 Kinley Hea TIME REMAINING 50:49 Submit Mar 27 2:47
-Python- Write a function get_letter_grade, such that when given * a lab grade score and * a list of the grade cutoffsreturns the letter grade of that score.Note: Your function automatically returns A for the values that are >= to the first cutoff-value in the list, then A- for the second cutoff-value, B+ for the third and so on. The function returns None for anything that's below the score for B-. You test that get_letter_grade(97, [93, 90, 87, 83, 80]) correctly returns an A, and get_letter_grade(93, [97, 90, 87, 83, 80]) returns A-. DO NOT hard-code the cutoffs, since they can change! You can copy/paste the following template: def get_letter_grade(score, cutoffs): if score ... : return 'A' ...: return 'A-' ...: return 'B+' ...: return 'B' ...: return 'B-'