How many times is the following cout statement executed within this loop? int counter = 0; for(int k=0; k<5; k++) { cout << "counter: " << counter << endl; }
5 times
4 times
What is the big O for printing in a linked list.
O(N)
none of the above
How long does it take to excute for n items in for loop?
A.n+1
B.n+2
C.n+3
D.n
Program execution times are susceptible to the hardware, tricks , data, etc.
for ( int i = 0; i < 4; i++) for( int x = 0; x <3 ; x++) cout << "hi"<< endl; how many times will the cout statement execute?
A)15
B)10
C)12
D)11
How many times would the cout operation be done in this loop?
for(int i = 0; i < n; i++){ for(int j = 0; j < n; j++){ for(int k = 0; k < 5; k++){ cout << "o hai.";
5*n*n times
How many time is the cout statement executed in the following for loop? int counter = 0; for( int k = 0; k < 5; k++){ cout << "counter: " << counter << endl; }
A) 4
B) 0
C) 5
D) 6
When measuring algorithm efficiency, the program is susceptible to ____
a. hardware
b. data
c. tricks
d. all of the above
e. none of the above
f. a,b,c, and more
When you are calculating the number of loops that a nested for loop runs through, you should:
A. Multiply the number of loops together
B. Count the number of loops that the first for loop runs through
C. Make a guess
D. None of the above
How do you measure the efficiency of algorithms?
A) you can't, not enough information
B) Focus on algorithm, not program
C) none
What is algorithm analysis measuring?
A. the efficiency of algorithms
B. the number of lines of code
C. how often the program will enter an infinite loop
D. how much memory leakage there is
How many steps does the following take to execute if there's n items in a list? Node* curr = m_head; // 1 assignment while( curr !=NULL) { //n + 1 comparisons cout << curr->next; // n calls to operator<< curr = curr->next; // n assignments } Total: (n + 1) * assignment_time = (n + 1) * comparison_time + n write_time
A. 6 steps
B. 5 steps
C. 4 steps
D. 3 steps
What is the big O for this segment of code:
long factorial(int n){
if(n <= 1) return 1; else return n * factorial(n - 1);
}
Program execution times are susceptible to hardware, tricks, data.
How many itterations would a quadruply-nested for loop with base itterations 7 and all others itterating at n itterate?
7*n^3
