Solution:
Question 20 Find a theta notation for the number of times the statement x = x...
In the code given below, how many times the cout statement is executed? for (int x = 0; x< 10; x++) for (int y=0; y < 10; y++) for (int z = 0; z <=10; z++) cout << X+y+z;
Question 9 Each repetition in a loop is referred to as a(n) statement steration selection condition Question 10 In the following statements, the printf statement will be executed times Count 10; while (count <= 10) printf ("td , Count) 1 an infinite number of o 10 Question 11 The statement that terminates a loop and continues with the statement immediately following the loop is O break continue goto Ocomma recursion Question 12 The statement always creates a post-test loop. repeat...until...
14.3 How many times is the statement cout<<]<<","<</<<","; executed in the following program? int I, ); for (I = 2; I >= 0; I--) { for (] = 1; }<2; J++) cout << ) << ", << I << cout << endl; 11 } Select one O 2.3 0 6.6 O c. 2 d. None of the above are correct
If cos theta= square root 11/6 and tan theta < 0, find the
exact value of sin the
1. If cos os (0) – VII and tan(Q) <o, find the exact value of sino).
10 pts Question 2 Find 0 - notation (as a function of n) for the number of times the statement "x x +1" is executed in the following pseudocode: for i 1 to n3 for j 1 to i х%3Dх+1
cot(theta)=-3/4 and cos(theta)
7. cot(0) - 3 4 and cos(0) <0, find the exact value of sec(0)
QUESTION 10 Find the Laplace Transform of f(t) = 0 ift<1: f(t) = tiflsts 2: f(t) = 0 ift> 2. ign 5
A5 a. Find the negation of the statement "a < x <b, for some x e W". b. What are the logical laws and general rules that are used to find this?
Question 16 What is the value of x after the following code is executed? X = 7 If x < 7 X = x + 1 X = x + 2 7 9 10 8
Find the worst case runtime f(n) for the following
algorithms.
Specify the number of operations executed for an input size n,
for the worst case run time as a function of n.
Circle statement(s) and draw a line to the right
side specifying the number of operations.
If statement(s) are a part of an iteration of n, specify the
total number of iterations as a function of n.
Algorithm-01 int sum = 0; int j = 1; while ( <=...