style$=$"margin$-$left:$0$px;margin$-$right:$0$px;$">$Question $1$Turing machines representA. an effort to define the limits of algorithmic systems.B$.$ a class of machines that can compute all computable functions.C$.$ a class of machines that are now out of date and no longer important.D$.$ an early model of a digital computer.

Question $2$An algorithm's complexity refers toA. the amount of time needed to solve it$.$B$.$ the amount of storage needed to solve it$.$C$.$ both the amounts of time and storage needed to solve it$.$D$.$ whether a bare bones language can solve it$.$

Question $3$In P vs$.$ NP and the Computational Complexity Zoo, Scott Aaronson says that s$=$f$($n$)$ which meansA. a solution is function of the namespace in which the problem is defined.B$.$ the number of steps required to solve a problem are related to its size.C$.$ the number of steps required to solve a problem are related to the efficiency of the programming language.D$.$ the number of steps required to solve a problem are related to the architecture of the CPU.

Question $4$The halting problem doesn't have an algorithmic solution.TrueFalse

Question $5$The following statements illustrate which concept below?

var$1=1$

while var$1!=0$:

var$1=$ var$1+1$A$.$ A P complex problem.B$.$ A deterministic problem.C$.$ An NP problem.D$.$ The halting problem.

Question $6$If a function is computable,A$.$ both a Turing machine and a Bare Bones Language program can solve it $.$B$.$ a Turing machine can solve it$,$ but a Bare Bones Language program cannot $.$C$.$ a Turing machine cannot solve it$,$ but a Bare Bones Language program can $.$D$.$ it must be non$-$deterministic.

Question $7$

Which of the following questions has not yet been answered by researchers?A$.$ Is P contained in NP$?$B$.$ Is NP contained in P$?$C$.$ Are all the problems in NP solvable?D$.$ Are all the problems in P solvable?

Question $8$

The class of problems known as NP complete

A$.$ have no known solutionB. have clear, easily verified solutionsC. require a bare bones language to solve themD. may have solutions, but it is not easy to verify them

Question $9$

Which of the following algorithms represents an optimal solution $($in terms of time complexity$)$ for sorting a list?A$.$ Insertion sortB. Bubble sortC. Selection sortD. Merge sort

Question $10$Which of the following represents the most costly algorithm for solving a problem?A$.(2**$n$)$B$.($n log$2$ n$)$