Question 1

What was Alan Turing's purpose when developing the concept of the Turing machine?

Accepted Answer

The purpose was to design a system that could compute any computable function.

Question 2

Place an X in the blank before each of the following statements that contradict the Church-Turing thesis.Leave the other blanks blank.
_____ All functions are computable.
_____ Some functions that are not computable by Turing machines are computable by other
means.
_____ All computable functions are Turing-computable.
_____ Some problems cannot be solved by any Turing machine.

Accepted Answer

First and second

Question 3

If we were using RSA encryption with the private keys n = 133 and d = 5,what would be the decrypted version of the encrypted message whose bit pattern is 11?
__________

Accepted Answer

1101110 (which is binary for 110)

Question 4

Place a T in the blank before each of the following statements that are true.Leave the other blanks blank.
_____ All Bare Bones programs that do not contain a while statement are self-terminating.
_____ All Bare Bones programs that contain a while statement are not self-terminating.
_____ Some Bare Bones programs are both self-terminating and not self-terminating.
_____ No Bare Bones program is both self-terminating and not self-terminating.

Accepted Answer

The answer of Place a T in the blank before...

Question 5

Suppose the variable X in the following Bare Bones program has the value 3 when execution begins.
$\begin{array} { l } 
\text { clear } Y \
\text { decr } X \
\text { while X not } 0 : \
\text { decr } X \
\text { incr } Y
\end{array}$
 A.What will be the value of X when the program terminates?

B.What will be the value of Y when the program terminates?

Accepted Answer

The answer of Suppose the variable X in the following...

Question 6

Write a sequence of statements in the Bare Bones language that is equivalent to the statement
$\begin{array} { c } 
\text { if } \mathrm { X } \text { not } 0 \text { : } \
\mathrm { S } 1 \
\text { else: } \
\mathrm { S } 2
\end{array}$
where S1 and S2 are sequences of Bare Bones statements.

Accepted Answer

One soluti

Question 7

Which of the following systems does not process the same computational capabilities as the others?

Accepted Answer

A)  Turing machines 
B)  Universal programming languages 
C)  Algebraic expressions 
D)  The Bare Bones language 
A)  Turing machines 
B)  Universal programming languages 
C)  Algebraic expressions 
D)  The Bare Bones language

Question 8

If a solution with time complexity $\Theta$ (n²)is known to exist,then the problem is known to be in which of the following?

Accepted Answer

A)  $\Theta$ (n²) 
B)  O(n²) 
C)  $\Theta$ (n³) 
D)  $\Theta$ (n) 
A)  $\Theta$ (n²) 
B)  O(n²) 
C)  $\Theta$ (n³) 
D)  $\Theta$ (n)

Question 9

Which of the following sets of values constitutes a valid RSA public key encryption system?

Accepted Answer

A)  p = 5, q = 11, n = 55, e = 17, d = 13 
B)  p = 5, q = 11, n = 83, e = 17, d = 13 
C)  p = 5, q = 11, n = 83, e = 10, d = 13 
D)  p = 5, q = 11, n = 55, e = 10, d = 13 
A)  p = 5, q = 11, n = 55, e = 17, d = 13 
B)  p = 5, q = 11, n = 83, e = 17, d = 13 
C)  p = 5, q = 11, n = 83, e = 10, d = 13 
D)  p = 5, q = 11, n = 55, e = 10, d = 13

Question 10

Identify a problem that does not have an algorithmic solution.

Accepted Answer

The most l

Question 11

Give an example of a problem in NP that may not be in P.

Accepted Answer

The traveling salesm

Question 12

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

Accepted Answer

The answer of Suppose the variables X and Y in...

Question 13

The class of problems known as NP is so named because it is composed of which of the following?

Accepted Answer

A)  Non-polynomial problems 
B)  Non-programmable problems 
C)  Non-universal problems 
D)  Non-deterministic polynomial problems 
A)  Non-polynomial problems 
B)  Non-programmable problems 
C)  Non-universal problems 
D)  Non-deterministic polynomial problems

Question 14

Why is a public key encryption system based on the RSA algorithm secure?

Accepted Answer

It is secure because

Question 15

What is the time complexity of the problem of searching for a particular entry in 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 16

Place a T in the blank before each of the following statements that are true.Leave the other blanks blank.
_____ P is contained in NP.
_____ All solvable problems are in P.
_____ The traveling salesman problem is in NP.
_____ The traveling salesman problem is not solvable.

Accepted Answer

The answer of Place a T in the blank before...

Question 17

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

Accepted Answer

The answer of Suppose the variables X and Y in...

Question 18

Place an F in the blank before each of the following statements that are false.Leave the other blanks blank.
_____ No one has discovered a problem that cannot be solved by a Turing machine.
_____ The Bare Bones programming language would not be a universal language if the clear
statement were removed.
_____ The only problem that cannot be solved by a Turing machine is the halting problem.
_____ Some problems cannot be solved by any Turing machine.

Accepted Answer

First,seco

Question 19

If we were using RSA encryption with the public keys n = 91 and e = 5,what would be the encrypted version of the message whose bit pattern is 11?
__________

Accepted Answer

111101 (wh

Question 20

Write a program in Bare Bones that terminates with the variable Z equal to 1 if the variables X and Y start with non-zero values and with Z equal to 0 otherwise.

Accepted Answer

One soluti

What was Alan Turing's purpose when developing the concept of the Turing machine?

If we were using RSA encryption with the private keys n = 133 and d = 5,what would be the decrypted version of the encrypted message whose bit pattern is 11? __________

Suppose the variable X in the following Bare Bones program has the value 3 when execution begins. clear Y decr X while X not 0: decr X incr Y A.What will be the value of X when the program terminates? B.What will be the value of Y when the program terminates?

Write a sequence of statements in the Bare Bones language that is equivalent to the statement if not 0 : 1 else: 2 where S1 and S2 are sequences of Bare Bones statements.

Which of the following systems does not process the same computational capabilities as the others?

If a solution with time complexity $\Theta$ (n²)is known to exist,then the problem is known to be in which of the following?

Which of the following sets of values constitutes a valid RSA public key encryption system?

Identify a problem that does not have an algorithmic solution.

Give an example of a problem in NP that may not be in P.

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

The class of problems known as NP is so named because it is composed of which of the following?

Why is a public key encryption system based on the RSA algorithm secure?

What is the time complexity of the problem of searching for a particular entry in a list?

Place a T in the blank before each of the following statements that are true.Leave the other blanks blank. ___ P is contained in NP. _ All solvable problems are in P. _ The traveling salesman problem is in NP. ___ The traveling salesman problem is not solvable.

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

If we were using RSA encryption with the public keys n = 91 and e = 5,what would be the encrypted version of the message whose bit pattern is 11? __________

Write a program in Bare Bones that terminates with the variable Z equal to 1 if the variables X and Y start with non-zero values and with Z equal to 0 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

What was Alan Turing's purpose when developing the concept of the Turing machine?

If we were using RSA encryption with the private keys n = 133 and d = 5,what would be the decrypted version of the encrypted message whose bit pattern is 11? __________

Suppose the variable X in the following Bare Bones program has the value 3 when execution begins. clear Y decr X while X not 0: decr X incr Y A.What will be the value of X when the program terminates? B.What will be the value of Y when the program terminates?

Write a sequence of statements in the Bare Bones language that is equivalent to the statement if not 0 : 1 else: 2 where S1 and S2 are sequences of Bare Bones statements.

Which of the following systems does not process the same computational capabilities as the others?

If a solution with time complexity Θ\ThetaΘ (n²)is known to exist,then the problem is known to be in which of the following?

Which of the following sets of values constitutes a valid RSA public key encryption system?

Identify a problem that does not have an algorithmic solution.

Give an example of a problem in NP that may not be in P.

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

The class of problems known as NP is so named because it is composed of which of the following?

Why is a public key encryption system based on the RSA algorithm secure?

What is the time complexity of the problem of searching for a particular entry in a list?

Place a T in the blank before each of the following statements that are true.Leave the other blanks blank. _____ P is contained in NP. _____ All solvable problems are in P. _____ The traveling salesman problem is in NP. _____ The traveling salesman problem is not solvable.

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

If we were using RSA encryption with the public keys n = 91 and e = 5,what would be the encrypted version of the message whose bit pattern is 11? __________

Write a program in Bare Bones that terminates with the variable Z equal to 1 if the variables X and Y start with non-zero values and with Z equal to 0 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

If a solution with time complexity $\Theta$ (n²)is known to exist,then the problem is known to be in which of the following?

Place a T in the blank before each of the following statements that are true.Leave the other blanks blank. ___ P is contained in NP. _ All solvable problems are in P. _ The traveling salesman problem is in NP. ___ The traveling salesman problem is not solvable.