Problem 2: Give the time complexity of the following code and explain the reason: (1) (2) for (i = 1; i < n; i *= 2 ) { } for(j= n; j > 0; j /= 2 ) { for (k = j; res } } } for (i = n; i > 0; i == 1) { for (j } <= n; k += 2 ) { i j + j * k) ; 1; j

Problem 2: Give the time complexity of the following code and explain the reason: (1) (2) for (i = 1; i < n; i = 2 ) { } for(j= n; j > 0; j /= 2 ) { for (k = j; res } } } for (i = n; i > 0; i == 1) { for (j } <= n; k += 2 ) { i j + j k) ; 1; j

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 7SA

See similar textbooks

Related questions

Q: Ackermann's Function is a recursive mathematical algorithm that can be used to test how well a…

A: The question asks you to design a Python function called `ackermann(m, n)` that implements…

Q: The following questions are related to regular expression and regular language: (i) Let r,, r2, r be…

A: Answer: Regular Expressions:- Regular Expressions are used to denote regular languages. An…

Q: Sudoku is a popular logic puzzle that uses a 9 by 9 array of squares that are organized into 3 by 3…

A: import java.util.Scanner; public class SudokuPuzzle { private int board [][]; private int…

Q: Question 1: Implement programs that run and give running time for the two Fibonacci sequence…

A: Calculate Fibonacci sequence using recursion: #include <stdio.h> #include…

Q: Consider the following code snippet [Pseudocode]: Method func) { PRINT "This is not an main…

A: Answer 1. The code will show compile time error. Answer 2. The code will show compile time error.

Q: f) (10 points) Assume that void some_fct2 (int N, int k); has time complexity (N²) for (k = 1; k <=…

A: BELOW STEP BY STEP COMPLETE SOLUTION REGARDING YOUR PROBLEM

Q: sum = 0; for (k=1; k<=n; k*=2) for (j=1; j<k; j++) sun++ What is the time complexity of…

A: The Time Complexity of the following code will be O(nlogn).

Q: Following C code computes the approximate roots and the absolute approximate error of f(x)=x3…

A: The given C code computes the approximate roots. Blanks in the given code is write as BOLD with…

Q: Question 2 Which of the following is the proper recursive case for the following function int…

A: Note: Valid recursive call must lead to termination condition or base case in the given function :…

Q: (3) There is a function void fnE(int i, int num) that runs in 1000-i steps, regardless of what num…

A: We have to calculate the total time in big-O of function fnA of variable n. To calculate Big O,…

Q: (a) sum= 0; for (int i = 0; i 1) { sum++; i= 1/2; } = 2*log2 (n) We denote by Ta(n), Tb (n), Te(n)…

A: Fragment: A fragment is a portion of code that is incomplete or lacks the necessary syntax to be…

Q: What is the time complexity of following code. Show the time complexity of each statement below and…

A: Language is one of the most widely used programming language which has been used to create different…

Q: 1. clearly how the function is evaluated and the return of the function for every recursive step as…

Q: Question 4. Find the time complexity of the following code. 1. for (i = n; i >= 1; i/= 2): { for j =…

A: for(i=n;i>=1;i=i/2)So from for loop i will decrement by i/2then out side for loop will execute…

Q: Provide a time complexity analysis for this code #include int main(){ //Required matrices and…

A: We have to determine the time complexity analysis for this code.

Q: Consider the following recursive function: { a if b = 0, %3D f(b, a) 1 f(6, 2. (a f(a, b) if b > a >…

A: Answer is given below .

Q: - Write a program (C language .C or Python .py) to implement JohnsonTrotter algorithm and count the…

A: Python uses English keywords in the code. Indentation is very important the python code. It supports…

Q: Explain the functionality of below recursive functions. static void fun1(int n) { int i = 0; if…

A: Recursion : => Recursion happens when something is described in terms of itself or of its type.…

Q: int functionC (int n) { int i, j, sumC = 0; for (i=n; i > 0; i=i-5) for (j=1; j 0) { if (functionC…

A: The solution of the above question is:

Q: Explain the term 'intellectual property rights'.

A: Intellectual property rights is a term which used to define the legal rights which are given to…

Q: I Evaluate the time complexity of following code: int a-0; for (i-0; i< N; i++){ aati;) for (i- 0;…

A: COMPLEXITY OF GIVEN CODE - int a = 0 ; for ( i = 0 ; i < N ; i ++ ) { a = a + i ; } for ( i = 0…

Q: void sort_Algo(int anArray[], int n) { int i, j, idx; for (1 - 0; i anArray[ idx ]) idx - idx - j;…

A: The above algorithm represents selection sorting. In selection sort, we repeatedly find the…

Q: 4. Consider the function IndexEqual(A,i.j) that returns true if there exists an index x (i sx sj)…

A: Below i have answered:

Q: * Axiomatic Proof Prove the following program for integer division (x/y): { x>= 0 ^ y>0 } q := 0;…

A: The notation used for the statement 'If P is true immediately before S is executed and the execution…

Q: For function sumtok, write the missing recursive call. This function returns the sum of the values…

A: Correct Code:- public int sumtok(int k) { if (k<= 0){ return 0; }else{ return k +…

Q: 8. Give a recursive definition of the sequence {an}, n = 1, 2, 3, ... if a) an = 4n − 2. b) an = 1 +…

A: Solution: a)

Q: 2. The function f is defined for non-negative integers a and b recursively as follows: f (a, b) ={…

Q: 8. A() { Int I, j, k, n; For (I = 1; 1<= n; I++) { For (j = 1; jsi²;j++) { For (k =1, k< =, k+) {…

A: Given : In questions 4-10 estimate the Big 0 value by analyzing the code. Note the algorithms are…

Q: Part a. Make a diagram of memory for point one when n == 2. int expo(int x, int n) { int r, t; if (n…

A: Part a:

Q: Consider the following code where n can be any number of more than 20. Select the correct time…

A: Answer 8: for the question 8 the time complexity will be option B. O(nm) because outer loop is…

Q: For each of the following program fragments: Give an analysis of the running time (Big-Oh). Justify…

A: Let's consider the program A given above . As mentioned in the comments we can see that the program…

Q: For each of the following function, indicate the class (n) the function belongs (use the simplest g…

A: Hi please find the solution below and I hope it would be helpful for you.

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

Problem 2:
Give the time complexity of the following code and explain the reason:
(1)
(2)
for (i = 1; i < n; i *= 2 ) {
}
for (j = n; j> 0; j /= 2 ) {
}
}
for (
for (k = j; k <= n; k += 2 ) {
res += (i* j + j * k );
(i = n; i > 0; i = 1 ) {
for (j
}
}
1; j < n; j *= 2 ) {
for (k = 0; k<j; k += 1 ) {
res += (i* j + j * k ) ;
}
=

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1: Introduction:

VIEW

Step 2: Answer and explanation:

VIEW

Solution

VIEW

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

int functionC (int n) { int i, j, sumC = 0; for (i=n; i > 0; i=i-5) for (j=1; j 0) { if (functionC(n) % 2 == 0) { for (i=m; i > 0; i=i/3) sumE++; } else (10) Asymptotic runtime of functionE { for (i=m; i > 0; i=i-3) sumE--; } n--; } return sumE;
I Evaluate the time complexity of following code: int a-0; for (i-0; i< N; i++){ aa+i;) for (i 0; i< N; i+){ a-a+i;) 2
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.
8. Ackerman's Function Ackermann's Function is a recursive mathematical algorithm that can be used to test how well a system optimizes its performance of recursion. Design a function ackermann(m, n), which solves Ackermann's function. Use the following logic in your function: If m = 0 then return n + 1 If n = 0 then return ackermann(m-1,1) Otherwise, return ackermann(m-1,ackermann(m,n-1)) Once you've designed yyour function, test it by calling it with small values for m and n. Use Python.
For funX |C Solved xb Answer x+ CodeW X https://codeworko... 田) CodeWorkout X267: Recursion Programming Exercise: Cumulative Sum For function sumtok, write the missing recursive call. This function returns the sum of the values from1 to k. Examples: sumtok(5) -> 15 Your Answer: 1 public int sumtok(int k) { 2. } (0 => ) return 0; 3. } else { return > 6. { Check my answer! Reset Next exercise 1:09 AM
Consider the following recursive function: if b = 0, if 6 > a > 0, a f(b, a) f (b, 2.(a mod b)) otherwise. f(a, b) = Estimate the number of recursive applications required to compute f(a, b).
The following questions are related to regular expression and regular language: (i) Let r,, r2, r be regular expressions. Find all the regular ones from the following expressions: a·p, r³, r* · 0, (r*)), r + r2 – r, (4) +r + 12, n+r, ÷ r,, r*), (r, r2), {rn + r2}, a+¢ (ii) Let E= {a, b}. Given regular expressions r = a*b", r' = ba* ab* + (ab)* (ba)* and Ir" = (a* + b)bb(a + b)*,- nd L(r), Lr), and L(r"), the languages defined by r, r', r", respectively. (iii) Let Z = {a, b}. Given the language L = {aa" b"b, (ba)*, bb: n, m 2 0 and h 2 1}, find the regular expression r such that L(r) = L.
* Axiomatic Proof Prove the following program for integer division (x/y): { x>= 0 ^ y>0 } q := 0; r := x; while y <= r do begin r := r - y; q := q + 1; end { y > r ^ x = r + y * q }
java C++ Ackermann’s FunctionAckermann’s Function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion. Write a function A(m, n) that solves Ackermann’s Function. Use the following logic in your function:If m = 0 then return n + 1If n = 0 then return A(m−1, 1) Otherwise, return A(m−1, A(m, n−1))Test your function in a driver program that displays the following values:A(0, 0) A(0, 1) A(1, 1) A(1, 2) A(1, 3) A(2, 2) A(3, 2) SAMPLE RUN #0: ./AckermannRF Hide Invisibles Highlight: Show Highlighted Only The·value·of·A(0,·0)=·1↵ The·value·of·A(0,·1)=·2↵ The·value·of·A(1,·1)=·3↵ The·value·of·A(1,·2)=·4↵ The·value·of·A(1,·3)=·5↵ The·value·of·A(2,·2)=·7↵ The·value·of·A(3,·2)=·29↵
Design a recursive version of dynamic programming algorithm (Top-down) to construct the actual solution of the matrix chain multiplication problem (i.e., the parentheses order). For this problem, please write down the recursive function in pseudocode and Write down the dynamic table and matrix output on the following examples: (a) Three matrices (A, B, and C) with dimensions 10 × 50 × 5 × 100, respectively. (b) Four matrices (A, B, C, and D) with dimensions 20 × 5 × 10 × 30 × 10, respectively.
1. Compute the recursive function f(n) = 3f(n–3)– l; ƒ(0) = 1; for n=12;. Show %3D %3D %3D clearly how the function is evaluated and the return of the function for every recursive step as seen in class. Show all your work to get credit
Please written by computer source Question 1: Suppose we wish to write a procedure that computes the inner product of two vectors u and v. An abstract version of the function has a CPE of 14–18 with x86- 64 for different types of integer and floating-point data. By doing the same sort of transformations we did to transform the abstract program combine1 into the more efficient combine4, we get the following code: Our measurements show that this function has CPEs of 1.50 for integer data and 3.00 for floating-point data. For data type double, the x86-64 assembly code for the inner loop is as follows: Assume that the functional units have the characteristics listed in Figure 5.12. **See last page for figures A. Diagram how this instruction sequence would be decoded into operations and show how the data dependencies between them would create a critical path of operations, in the style of textbook Figures 5.13 and 5.14. vmovsd vmovsd vmulsd vaddsd | | | |…