Question $11$ pts

The notation O$(10$n$)$ is for which of the following algorithmic complexity

Group of answer choices

constant complexity

polynomial complexity

exponential complexity

linear complexity

Flag question: Question $2$

Question $21$ pts

What does the Big$-$Theta $(\backslash$theta $)$ notation of algorithmic complexity signify?

Group of answer choices

worst case

average case

none of the mentioned

best case

Flag question: Question $3$

Question $31$ pts

What is the algorithmic complexity for the addDigits function defined below?

def addDigits$($s$)$:

val $=0$

for c in s:

val $+=$ int$($c$)$

return val

Group of answer choices

logarithmic complexity

linear complexity

log linear complexity

constant complexity

Flag question: Question $4$

Question $41$ pts

Who created the default sort algorithm used by Python?

Group of answer choices

The person who invented Python

Tim Peters

Timothy Thomas

Tim Berners Lee

Flag question: Question $5$

Question $51$ pts

What is the appropriate Big$-$O notation to represent the algorithmic complexity of the grow function defined below?

def grow$($x$)$:

for i in range$($x$)$:

ans $*=2$

for j in range$($x$)$:

ans $+=2$

return ans

Group of answer choices

O$($n$2)$

O$(1)$

O$($n$)$

O$($n log n$)$

Flag question: Question $6$

Question $62$ pts

What is the algorithmic complexity for the quizTest function defined below?

def quizTest$($n$,$ m$)$:

if n$<0$:

return

else:

quizTest$($n$-1,$ m$)$

quizTest$($n$-1,$ m$+1)$

Group of answer choices

linear complexity

none of the mentioned

exponential complexity

constant complexity

Flag question: Question $7$

Question $72$ pts

What is the algorithm complexity for the sorting algorithm used in the following Python program?

list$1=[1,5,7,3,5,6]$

print$($sorted$($list$1))$

Group of answer choices

O$($n$)$

O$($n log n$)$

O$(1)$

O$($log n$)$

Flag question: Question $8$

Question $81$ pts

What is the most important consideration when designing and developing a program?

Group of answer choices

Correct Result

Cleverness

Computational Complexity

Readabiliity