b) The following program segment computes C = A * B, where A, B, C are matrices.for (long int i = 1; i <= r; i++)for (long int j = 1; j<= m; j++)long double S = 0;for (long int k = 1; k <= n; k++)S = S+ Ali, k) * B[k, j];Cli, 1 = S;How many times does the code iterate in computingi) S?ii) The j* column of C, i.e. C[i.j] for a fixed i and j = 1, 2, ,3, ..., m?iii) The complete matrix C?

i) Since the computation of S is done within three for loops which runs up to r m and n, code will…

b) The following program segment computes C = A * B, where A, B, C are matrices. for (long int i = 1; i <= r; i++) for (long int j = 1; j<= m; j++) long double S = 0; for (long int k = 1; k <= n; k++) S = S+ A[i, k) * B[k, ]; Cli, 1 = S; How many times doces the code iterate in computing i) S? ii) The j* column of C, i.e. C[i.j] for a fixed i and j = 1, 2, ,3, ..., m? The complete matrix

b) The following program segment computes C = A * B, where A, B, C are matrices. for (long int i = 1; i <= r; i++) for (long int j = 1; j<= m; j++) long double S = 0; for (long int k = 1; k <= n; k++) S = S+ A[i, k) * B[k, ]; Cli, 1 = S; How many times doces the code iterate in computing i) S? ii) The j* column of C, i.e. C[i.j] for a fixed i and j = 1, 2, ,3, ..., m? The complete matrix

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion

Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

4. Design a recursive function that accepts an integer argument, n, and prints every second number from n down to a minimum of 0. Assume that n is always a positive integer.
Q4. Recursion Find how many possible combinations that a number can be decomposed into the multiple of integers (smaller than the number itself) by a recursion function.Suppose we have a positive number Y as input, and it need to be decomposed into the multiple of several integers, Yi, where each Yi, is smaller than Y(e.g., Y=Y1∗Y2∗ Y3∗...∗Yn). In addition, these decomposed integers can only be arranged in an ascending order (Y1
6.38 LAB: Convert to binary - methods (JAVA) Write a program in java 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 reverse the string. Ex: If the input is: 6 the output is: 110 The program must define and call the following two methods. Define a method named intToReverseBinary() that takes an int as a parameter and returns a string of 1's and 0's representing the integer in binary (in reverse). Define a method named stringReverse() that takes a string as a parameter and returns a string representing the input string in reverse. public static String intToReverseBinary(int integerValue)public static String stringReverse(String inputString) Code starts here: import java.util.Scanner; public…
1. Write a recursive function that takes as a parameter a nonnegative integer and generates the following pattern of stars. If the nonnegative integer is 4, then the pattern generated is:********************Also, write a program that prompts the user to enter the number of lines in the pattern and uses the recursive function to generate the pattern. For example, specifying 4 as the number of lines generates the above pattern. 2. A palindrome is a string that reads the same both forward and backward. For example, the string "madam" is a palindrome. Write a program that uses a recursive function to check whether a string is a palindrome. Your program must contain a value-returning recursive function that returns true if the string is a palindrome and false otherwise. Do not use any global variables; use the appropriate parameter.
Read Chapter 12 Recursive Lines Write a recursive function that accepts an integer argument, n. The function should display n lines of asterisks on the screen, with the first line showing 1 asterisk, the second line showing 2 asterisks, up to the middle line which shows n asterisks. You will then continue to print less stars until your last line of one asterisk. With an input of 3 your output should look like below. You will need to wind the stack to print up to your largest line. You will print the last set of lines as you unwind the stack or as you come out of your recursion. * ** *** ** *
(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.
1. Write a recursive function that takes a string as an input and returns the reverse of the string. 2.Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: *ede cde bcde abcde Method call rec_string(‘abc’), will produce the following output: *cbc abc 3. Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the…
2. Sum: a recursive function that computes the sum of integers 1, 2, 3, …., n for a given number n. So Sum(6) should return 1 + 2 + 3 + 4 + 5 + 6 , i.e. 21.sum(n) = n + sum(n-1)
The following recursive function takes three positive integer arguments: def compute(n,x,y) : if n==0 : return x return compute(n-1,x+y,y) What is the value returned by the compute function? n*x+y x+y x+n*y x What if: will the returned value be for the compute function defined in the question above if the argument n is negative? x x-n*y x+n*y The function will never return a value.
Create a recursive function that checks if a word is a palindrome. A palindrome is a word, phrase, number, or other sequences of characters that reads the same forward and backward (ignoring spaces, punctuation, and capitalization). For example, "radar" is a palindrome.
Question 9 Write in Python! Write a function word count that will take a sentence (string) and return to you the number of words in the sentence. Show it works by calling it with “Cinderella must get to the ball without her slippers.” (Answer should be 9) Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Q4: Write C++ program using funcions, write saperate functions for input and output, program should take input 10 numbers in an array, counts the zeros, even and odd numbers in array. Finally prints the total number of zeros, even and odd numbers