If f(n) is the number of times that  y=y+A[i]; is executed in the code segment below, which of the following is the correct big-Oh notation for f? y=0;

Q: Q11/ A function f(t) is said to be even if: Oa) f(t) = f(-t) Ob) f(t) = -f(-t) Oc) f(t) # f(-t) %D…

A:

Q: Find an error in the following code and fix it. int x = 23; int* p = x; Group of answer choices…

A: Here in this question we have given a code and we have asked to find an error in the code.

Q: How many times this LOOP does executes? for (int i = 20; i< 20; i++) { cout << “welcome "; }

A: It does not produce any output. As i = 20 and i&lt;20 becomes false it quits the for loop. So, the…

Q: Find an incorrect line in the following code segment: void swap(int *x, int *y) { int t = *x;…

A: When we call a function in the main method in pointers we use: swap(&amp;a, &amp;b) , which will…

Q: This C code gets a positive integer between 1 and 8, inclusive int n; do {      printf("Height:…

A: C program: This C program will exit when the Height is entered between 1 and 8 inclusive. This…

Q: What is the big O notation for this function?

A: 1) The Fibonacci sequence is a series of numbers where each number is the sum of the two preceding…

Q: This is the code so far #include // for cin and cout #include // for setw() and setfill() using…

A: Output :-

Q: ease you neeedUsing recursion to print half of the indent hourglass

A: Algorithms:   Declare input variables. Using for loop, set the input value to 10 and decrement it…

Q: b) Find the errors and correct them: 1) int sum 0;x; do{ cin<<x; Sumt-x;] while(x!-0.0) 2) (for int…

A: 1) variable names are case sensitive in CPP. The correct code is: int sum=0,x; do{ cin&gt;&gt;x;…

Q: A=[1; 2; 3] THEN A=A' , THE RESULT * IS COLUMN O NON O ROW O A*A = A*2 TRUE O False O MATLAB IS EASY…

A: Ans a) A = [1; 2; 3] then A = A' . THE result is : a) COLUMN    Ans b) A * A = A * 2  b) False that…

Q: Given the following piece of code : int i=5,sum = 0; while (i<10) { sum-=i; i++; } What is the value…

A: Given code is: int i = 5, sum = 0;while (i &lt; 10){    sum -= i;    i++;}

Q: Exercise 3: Write a function fact (n) which returns the factorial of n (n!). Note: n! is undefined…

A: Algorithm Function factorial return type is long long as the factorial of larger numbers can exceed…

Q: Part A #include #include main() #include #include main () int X[7]={2,5,1,3,6,9,7}, S=0; for (int…

A: Given: required: output of the code

Q: Graphically display the function using Java f(x) = x +5 * cos x

A: Below i have drawn graph:

Q: i <- 1 while i (i < 10) { print(i) i i <- i + 1 }

A: 1) Above R programming code prints numbers from 1 to 9 value of variable i is assign to 1 while…

Q: // decreasing portion of the pattern for (int i=n; i>=1; i--) { for (int j-n; j>=i; j--) { ");…

A: Explanation: #include&lt;iostream&gt;using namespace std; void recursivePattern(int a,int n){int…

Q: )Perform dry run and identify how many times this code will perform iterations. for (i=n; i <  0;…

A: Perform dry run and identify how many times this code will perform iterations. for (i=n; i &lt;  0;…

Q: > Output: Print the pattern and the repeated count if there is a repeated pattern, Print "none"…

A: Program: #include&lt;bits/stdc++.h&gt; using namespace std;   void computeLPS(char str[], int M, int…

Q: 02: Detect the errors (at least 8) in the following C++ program: #include int i, j, array(5,5),…

A: Your answer is given below.

Q: Complete the following sentence. There are two basic forms of loop constructs: while loops and…

A: The problem is based on the types of loops in programming languages.

Q: C++ only Example Input: 2 15 100 123456789 9876543 Output: 70 102768568246676

A: As asked I have answered the question in C++

Q: Hermite Polynomial:  (THERE ARE NO CALCULATIONS IN THIS QUESTION – ALGORITHM BASED ANSWERS!)  The…

A: a)

Q: Using loops of any kind, lists, or is not allowed. Angela loves reading books. She recently started…

A: We will create a list first for available books which will hold the numbersl, r. Similarly, we will…

Q: Write a program that takes five students' quizzes in a course. Consider each student has given ten…

A: Best student will score highest average (sum of all quizes divided by the number of quizes)  Worst…

Q: gcc generates the following assembly code:

A: the answer is below:

Q: Given the following piece of code : int i, sSum = 0; for(i=1;i<7;i++) sum+=2; What is the value of…

A: Code:  #include &lt;iostream&gt;using namespace std;int main(){int i,sum=0;//declaring the variables…

Q: 3. Given the following sequential code: int A[100], B[100]; int C=0; for (int i = 0; i <m; i++) {…

A: The sequential code parallelized using OpenMP is mention in step 2

Q: Write a C program that reads an integer n and prints the sequence of order n. The first few strings…

A: In the given program, we need to initialize a string with 0 and in each step, the bits are flipped…

Q: a) function func(A,n) if n ≤ 5 then return A(1) else for i=1 to n for j = i to n-1 Ail(i) + A/i) + 2

A: a) Let T(n) be the worst case running time of the function func(A, n). We can see that when n &lt;…

Q: include using namespace std;   int MSD(int n){       if(n == 0)         return 0;       int k =…

A: Understanding the Function of the CodeThe given C++ code is intended to find and output the Most…

Q: Q.7: How many multipliers of 3 are there between I and 100? Write a program to find that.

A: As programming language is not mentioned, so we are providing answer in C++ language.

Q: True or False: Asymptotically analyze the expression below. n² (1 + sqrt(n)) = O(n²log n) True False

A: To establish whether n^2(1+sqrt(n)) is asymptotically constrained by O(n^2 log n), we must assess…

Q: Q15: Analyze the time complexity of the below powering code. This code shows the divide and conquer…

A: Maters theorem is used to find out the time complexity of the recursive programs if the recurrence…