Given the flowing piece of code, in the worst case it is big-Θ of what (where the input is of size n)? Foo(A) 1 k = 0 2 for i = 1 to A.length 3 A[i] = A[i] + 1 4 for j = 1 to A. length - i 5 A[j] = A[j] * A[i] 6 if A[j] > 20 7 k = k + 1 8 A[i] = k 9 for i = 1 to A.length / 2 10 exchange A[i] with A[A.length + 1 - i]

Given the flowing piece of code, in the worst case it is big-Θ of what (where the input is of size n)? Foo(A) 1 k = 0 2 for i = 1 to A.length 3 A[i] = A[i] + 1 4 for j = 1 to A. length - i 5 A[j] = A[j] * A[i] 6 if A[j] > 20 7 k = k + 1 8 A[i] = k 9 for i = 1 to A.length / 2 10 exchange A[i] with A[A.length + 1 - i]

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
Analyze the following piece of pseudocode and give a tight () bound on the running time as a function of n. Show your work. A formal proof is not required, but you should justify your answer. 1. 2. 3. 4. 5. 6. 7. 8. for in² to 2n² do { rex 1 for k4i to bi do rex rex * 2 fido 1 for k0 to rex do fido rex* fido
Some applications require a sort of cyclic rotations of a text, which all contain allthe characters of the text. For i from 0 to N 1, the i th cyclic rotation of a text of lengthN is the last N i characters followed by the first i characters. Identify the problem withthe following code fragment to compute all the cyclic rotations:int N = s.length();for (int i = 0; i < N; i++) rotation[i] = s.substring(i, N) + s.substring(0, i);
Consider the code C={00010, 01100,01011,11010,01010}. What is the minimum distance of C? For what k is the code C k-error detecting? Write the set of error patterns that C can detect?
Write a function that gets an array of ints of length n, and a number k, and returns the longest subsequence of consecutive k’s in the array. For example - On input ([1, 1, 3, 3, 3, 1, 5, 1], 1), the function returns 3 - On input ([1, 3, 3, 2, 3, 3, 3, 3], 3), the function returns 4 - On input ([3, 5, 2, 5, 2, 5, 5], 3), the function returns 2 - On input ([1, 2, 3, 3, 3, 3], 5), the function returns 0 // returns the length of the longest subsequence // of consecutive k’s in the array int longest_seq(const int* ar, int n, int k); test for the function: void test_q1() { inta1[] = {1, 1, 3, 3, 3, 1, 5, 1}; if (longest_seq(a1, 8, 1) == 2) printf("Q1-1 ok\n"); else printf("Q1-1 ERROR\n"); inta2[] = {1,3,3,2,3,3,3,3}; if (longest_seq(a2, 8, 3) == 4) printf("Q1-2 ok\n"); else printf("Q1-2 ERROR\n"); }
Let L={ w in(0 + 1)* 1 | w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expression below represents L? (A) (0* 10* 1)* (B) 0* (10* 10* )* (C) 0* (10* 1* )* 0* (D) 0* 1(10* 1)* 10*
Using this pseudo code: 1 for i = 1 to A.length-1 2 for j = A.length downto i+1 3 if A[j]< A[j-1] 4 exchange A[j] with A[j-1] What is the best loop invariant for the loop in lines 2 - 4?
What is the running time of the following piece of code for a given integer n: x=2; while(x
You are given a N*N maze with a rat placed at maze[0][0]. Find whether any path exist that rat can follow to reach its destination i.e. maze[N-1][N-1]. Rat can move in any direction ( left, right, up and down).Value of every cell in the maze can either be 0 or 1. Cells with value 0 are blocked means rat cannot enter into those cells and those with value 1 are open.Input FormatLine 1: Integer NNext N Lines: Each line will contain ith row elements (separated by space)Output Format :The output line contains true if any path exists for the rat to reach its destination otherwise print false.Sample Input 1 :31 0 11 0 11 1 1Sample Output 1 :trueSample Input 2 :31 0 11 0 10 1 1Sample Output 2 : false Solution: //// public class Solution { public static boolean ratInAMaze(int maze[][]){ int n = maze.length; int path[][] = new int[n][n]; return solveMaze(maze, 0, 0, path); } public static boolean solveMaze(int[][] maze, int i, int j, int[][] path) {//…
How do I get rid of my division by zero error? def sine(M, N, tol=1e-14): x = linspace(-2 * pi, 2 * pi, M) w = ones(N) for i in range(0, N): if i == 0: w[i] = (-1) ** i / 2 elif i == N - 1: w[i] = (-1) ** i / 2 else: w[i] = (-1) ** i cgl = -cos(arange(N) * pi / (N - 1)) CGL = ones(N) fc = ones(N) for i in range(N): CGL[i] = (pi / 4) * cgl[i] + (pi / 4) fc[i] = sin(CGL[i]) x1 = ones(M) y = zeros(M) er = zeros(M) s = 1 for i in range(0, M): numerator = 0 denominator = 0 x1[i] = (x[i]) % (2 * pi) s = 1 if x1[i] > pi: x1[i] = 2 * pi - x1[i] s = -1 if x1[i] > (pi / 2): x1[i] = pi - x1[i] for j in range(N): temp = w[j] / (x1[i] - CGL[j]) numerator += temp * fc[j] denominator += temp y[i] = s * numerator / denominator for i in range(0, M): for k in range(N): if abs(x1[i] - CGL[k]) == 0: y[i] = fc[k] er[i] = abs(y[i] - sin(x[i])) mer = norm(er, inf) return mer
Write a computer program that produces the desired output from the given input. Input: Two n × n arrays, n ≤ 10, that represent two groups and an array that represents a function from the first group to the secondOutput: Determination of whether the function is an isomorphism
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):.