Question 1.Which of the following functions has a constant growth rate?
n
n²
n log n
1

Question 2. An algorithm is _____.
a finite collection of steps to solve a problem
a program
a programming function
a mathematical formula

Question 3. The running time of an algorithm is _____.
the time, in milliseconds, it takes to complete its execution
the running time of its implementation
the maximum number of basic operations executed by the algorithm (over all inputs of size N)
the number of steps given in its description

Question 4. The following function returns the _____ of the array elements.

int mystery(int a[], int n)
{
int x=a[0];
for (inti=1; i if (x > a[i]) x = a[i];
return x;
}

maximum
minimum
middle element
sum

Question 5. Consider the recursive function below:

intRecFunction(int n)
{
if (n==0) return 0;
else return RecFunction(n-1) + n;
}

What is the output in the statement cout< 0
1
2
3

Question 6. Consider the function below:

long x(int n)
{
if (n == 1) return 1;
else return n*x(n-1);
}

What will be displayed by the cout statement cout<< x(3) < 720
25
6
1

Question 7.The running time of bubble sort is __________.
O(n log n)
O(log n)
O(n)
O(n2)

Question 8. A method that performs very well in practice, even though its worst-case running time is quadratic, is __________.
bubble sort
insertion sort
mergesort
quicksort

Question 9. The running time of an algorithm to find the sum of a list of k values is __________
O(1)
O(k)
O(log k)
O(k log k)

Question 10. Consider the recursive function below:

long myFunction(int x)
{
if (x==0 || x==1) return x;
else return myFunction(x-1) + myFunction(x-2);
}

What will be displayed by System.out.println(myFunction(3));?
0
1
2
3

Question 11. In each step, the __________ method divides the list to be sorted into two parts of equal size.
bubble sort
insertion sort
quick sort
merge sort.