Question 1

Is the following Bare Bones program self-terminating? Explain your answer.
$\begin{array} { l } 
\text { copy } \mathrm { X } \text { to } \mathrm { Z } \
\text { decr } \mathrm { Z } \
\text { while } \mathrm { Z } \text { not } 0 : \
\text { decr } \mathrm { Z } \
\text { decr } \mathrm { X } \
\text { while } \mathrm { X } \text { not } 0 :
\end{array}$

Accepted Answer

No.If the program is run with

Question 2

If the prime numbers underlying an RSA encryption system are small,the system is not secure.For example,suppose you were told that the public keys of a system were n = 15 and e = 13.
A.What are the two prime numbers on which the system is based?
 _______ ________
 B.What is the value of the decryption key d?

Accepted Answer

The answer of If the prime numbers underlying an RSA...

Question 3

Which of the following statements is true?

Accepted Answer

A)  The Bare Bones programming language would still be a universal language if the clear statement was removed. 
B)  The Bare Bones programming language would still be a universal language if the incr statement was removed. 
C)  The Bare Bones programming language would still be a universal language if the decr statement was removed. 
D)  The Bare Bones programming language would still be a universal language if the while statement was removeD. 
A)  The Bare Bones programming language would still be a universal language if the clear statement was removed. 
B)  The Bare Bones programming language would still be a universal language if the incr statement was removed. 
C)  The Bare Bones programming language would still be a universal language if the decr statement was removed. 
D)  The Bare Bones programming language would still be a universal language if the while statement was removeD.

Question 4

Place an X in the blank before each of the following statements that guarantees that a problem is in P.
_____ The problem is in O(n²).
_____ The problem is in O(2?).
_____ The problem is in O(log? n).
_____ The problem is in O(n³).

Accepted Answer

First,thir

Question 5

Which of the following Bare Bones programs is self-terminating?

Accepted Answer

A)  while X not 0: 
B)  while X not 0:
decr X 
C)  decr X
while X not 0: 
A)  while X not 0: 
B)  while X not 0:
decr X 
C)  decr X
while X not 0:

Question 6

What is the time complexity of the problem of sorting a list?

Accepted Answer

A)  $\Theta$ (log? n) 
B)  $\Theta$ (n) 
C)  $\Theta$ (n log? n) 
D)  $\Theta$ (n²) 
A)  $\Theta$ (log? n) 
B)  $\Theta$ (n) 
C)  $\Theta$ (n log? n) 
D)  $\Theta$ (n²)

Question 7

Which of the following is the most precise classification of a problem X?

Accepted Answer

A)  X is in NP. 
B)  X is in P. 
C)  X is in O(n²). 
D)  X is in $\Theta$ (n²). 
A)  X is in NP. 
B)  X is in P. 
C)  X is in O(n²). 
D)  X is in $\Theta$ (n²).

Question 8

State the Church-Turing thesis.

Accepted Answer

The Turing-computabl

Question 9

What is a universal programming language?

Accepted Answer

A universal programming langua

Question 10

Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2,respectively,when execution begins.
$\begin{array} { l } 
\text { clear } \mathrm { Z } \
\text { while X not } 0 : \
\text { while } Y \text { not } 0 : \
\text { decr } Y \
\text { incr } Z \
\text { incr } \mathrm { Z } \
\text { decr } X
\end{array}$
What will be the value of Z when the program terminates?

Accepted Answer

A)  0 
B)  1 
C)  5 
D)  6 
A)  0 
B)  1 
C)  5 
D)  6

Question 11

Which of the following best describes what the following Bare Bones program does? 
$\begin{array} { l } 
\text { copy } \mathrm { X } \text { to } \mathrm { Z } \
\text { clear } \mathrm { X } \
\text { incr } \mathrm { X } \
\text { while } \mathrm { Z } \text { not } 0 \text { : } \
\text { clear } \mathrm { X } \
\text { decr } \mathrm { Z }
\end{array}$

Accepted Answer

A)  It changes the value of X to 1. 
B)  If the starting value of X is 0, it sets the value of X to 0. Otherwise, it sets the value of X to 1. 
C)  If the starting value of X is 0, it sets the value of X to 1. Otherwise, it sets the value of X to 0. 
D)  It ultimately leaves X the same as it was when the program starteD. 
A)  It changes the value of X to 1. 
B)  If the starting value of X is 0, it sets the value of X to 0. Otherwise, it sets the value of X to 1. 
C)  If the starting value of X is 0, it sets the value of X to 1. Otherwise, it sets the value of X to 0. 
D)  It ultimately leaves X the same as it was when the program starteD.

Question 12

Suppose a problem in $\Theta$ (n³)has been solved in 1 second.How long should you expect the same machine to require to solve a new instance of the problem with input that is twice the size as before?

Accepted Answer

The answer of Suppose a problem in $\Theta$ (n³)has been...

Question 13

If an RSA public key encryption system were based on the primes p = 3 and q = 7,which of the following pairs of values would be suitable for the encryption and decryption keys e and d?

Accepted Answer

A)  2 and 6 
B)  5 and 29 
C)  4 and 9 
D)  7 and 23 
A)  2 and 6 
B)  5 and 29 
C)  4 and 9 
D)  7 and 23

Question 14

What action is performed by the Turing machine described below?

$$\begin{array} { c c c c c } 
\begin{array} { c } 
\text { Current } \
\underline{\text { state }}
\end{array} & \begin{array} { c } 
\text { Current } \
\underline{\text { cell content }}
\end{array} & \begin{array} { c } 
\text { Value } \
\underline{\text { to write }}
\end{array} & \begin{array} { c } 
\text { Direction } \
\underline{\text { to move }}
\end{array} & \begin{array} { c } 
\text { New } \
\underline{\text { state }}
\end{array} \
\text { START } & * & * & \text { left } & \text { X } \
\text { X } & 1 & 1 & \text { left } & \mathrm { X } \
\text { X} & 0 & * &\text { right }& \mathrm { Y }
\end{array}$$

Accepted Answer

A)  It replaces any string of consecutive 1s to the left of an * with 0s. 
B)  It leaves the tape unchanged. 
C)  It places an * at the left end of any string of consecutive 1s appearing to the left of an *. 
D)  It complements the string of 0s and 1s appearing to the left of an *. 
A)  It replaces any string of consecutive 1s to the left of an * with 0s. 
B)  It leaves the tape unchanged. 
C)  It places an * at the left end of any string of consecutive 1s appearing to the left of an *. 
D)  It complements the string of 0s and 1s appearing to the left of an *.

Question 15

An unsolvable problem is a problem for which

Accepted Answer

A)  no solution exists. 
B)  no one knows the solution. 
C)  no algorithm exists for finding the solution. 
D)  no one wants to known the solution. 
A)  no solution exists. 
B)  no one knows the solution. 
C)  no algorithm exists for finding the solution. 
D)  no one wants to known the solution.

Question 16

Turing machines represent

Accepted Answer

A)  an effort to define the limits of algorithmic systems. 
B)  a class of machines that can compute very little. 
C)  a class of machines that are now out of date and no longer important. 
D)  a class of machines that can compute all functions. 
A)  an effort to define the limits of algorithmic systems. 
B)  a class of machines that can compute very little. 
C)  a class of machines that are now out of date and no longer important. 
D)  a class of machines that can compute all functions.

Question 17

Explain the distinction between time complexity and space complexity.

Accepted Answer

Time complexity measures the a

Question 18

Give an example of a universal programming language.

Accepted Answer

The most likely answer is Bare

Question 19

Write a program in Bare Bones that will add one to the variable X if X is not 0 and leave X unchanged otherwise.

Accepted Answer

One soluti

Question 20

List the letters associated with the following problems in the order of increasing complexity of the problems.
15.List the letters associated with the following problems in the order of increasing complexity of the problems.
 A.Sorting a list
 B.The halting problem
 C.Searching through a list for a particular entry

Accepted Answer

The answer of List the letters associated with the following...

Is the following Bare Bones program self-terminating? Explain your answer. copy to decr while not 0: decr decr while not 0:

If the prime numbers underlying an RSA encryption system are small,the system is not secure.For example,suppose you were told that the public keys of a system were n = 15 and e = 13. A.What are the two prime numbers on which the system is based? _ __ B.What is the value of the decryption key d?

Which of the following statements is true?

Place an X in the blank before each of the following statements that guarantees that a problem is in P. ___ The problem is in O(n²). _ The problem is in O(2?). _ The problem is in O(log? n). ___ The problem is in O(n³).

Which of the following Bare Bones programs is self-terminating?

What is the time complexity of the problem of sorting a list?

Which of the following is the most precise classification of a problem X?

State the Church-Turing thesis.

What is a universal programming language?

Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2,respectively,when execution begins. clear while X not 0: while Y not 0: decr Y incr Z incr decr X What will be the value of Z when the program terminates?

Which of the following best describes what the following Bare Bones program does? copy to clear incr while not 0 : clear decr

Suppose a problem in $\Theta$ (n³)has been solved in 1 second.How long should you expect the same machine to require to solve a new instance of the problem with input that is twice the size as before?

If an RSA public key encryption system were based on the primes p = 3 and q = 7,which of the following pairs of values would be suitable for the encryption and decryption keys e and d?

What action is performed by the Turing machine described below? Current Current Value Direction New START * * left X X 1 1 left X 0 * right

An unsolvable problem is a problem for which

Turing machines represent

Explain the distinction between time complexity and space complexity.

Give an example of a universal programming language.

Write a program in Bare Bones that will add one to the variable X if X is not 0 and leave X unchanged otherwise.

Data Representation

Data Representation

Operating Systems

Networks and the Internet

Algorithms

Programming Languages

Software Engineering

Data Abstractions

Database Systems

Computer Graphics

Artificial Intelligence

Filters

Exam 12: Theory of Computation

Is the following Bare Bones program self-terminating? Explain your answer. copy to decr while not 0: decr decr while not 0:

Which of the following statements is true?

Place an X in the blank before each of the following statements that guarantees that a problem is in P. _____ The problem is in O(n²). _____ The problem is in O(2?). _____ The problem is in O(log? n). _____ The problem is in O(n³).

Which of the following Bare Bones programs is self-terminating?

What is the time complexity of the problem of sorting a list?

Which of the following is the most precise classification of a problem X?

State the Church-Turing thesis.

What is a universal programming language?

Suppose the variables X and Y in the following Bare Bones program have the values 3 and 2,respectively,when execution begins. clear while X not 0: while Y not 0: decr Y incr Z incr decr X What will be the value of Z when the program terminates?

Which of the following best describes what the following Bare Bones program does? copy to clear incr while not 0 : clear decr

Suppose a problem in Θ\ThetaΘ (n³)has been solved in 1 second.How long should you expect the same machine to require to solve a new instance of the problem with input that is twice the size as before?

If an RSA public key encryption system were based on the primes p = 3 and q = 7,which of the following pairs of values would be suitable for the encryption and decryption keys e and d?

What action is performed by the Turing machine described below? Current Current Value Direction New START * * left X X 1 1 left X 0 * right

An unsolvable problem is a problem for which

Turing machines represent

Explain the distinction between time complexity and space complexity.

Give an example of a universal programming language.

Write a program in Bare Bones that will add one to the variable X if X is not 0 and leave X unchanged otherwise.

Data Representation

Data Representation

Operating Systems

Networks and the Internet

Algorithms

Programming Languages

Software Engineering

Data Abstractions

Database Systems

Computer Graphics

Artificial Intelligence

Filters

Place an X in the blank before each of the following statements that guarantees that a problem is in P. ___ The problem is in O(n²). _ The problem is in O(2?). _ The problem is in O(log? n). ___ The problem is in O(n³).

Suppose a problem in $\Theta$ (n³)has been solved in 1 second.How long should you expect the same machine to require to solve a new instance of the problem with input that is twice the size as before?