Question 1

Which of the following statements is false?

Accepted Answer

A)  If a problem can be solved by a Bare Bones program, then it can be solved by a Turing machine. 
B)  If a problem can be solved by a Turing machine, then it can be solved by a Bare Bones program. 
C)  The halting problem cannot be solved by a Bare Bones program. 
D)  The halting problem can be solved only by using a universal programming language. 
A)  If a problem can be solved by a Bare Bones program, then it can be solved by a Turing machine. 
B)  If a problem can be solved by a Turing machine, then it can be solved by a Bare Bones program. 
C)  The halting problem cannot be solved by a Bare Bones program. 
D)  The halting problem can be solved only by using a universal programming language.

Question 2

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 3

Is the following Bare Bones program self-terminating? Explain your answer.

Accepted Answer

No. If the program is run with

Question 4

What action is performed by the Turing machine described below?

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 5

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, sec

Question 6

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

Accepted Answer

The traveling salesm

Question 7

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 8

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

Accepted Answer

The purpose was to d

Question 9

The precise time complexity of which of the following problems has not yet been established by researchers?

Accepted Answer

A)  Sorting a list 
B)  Searching through a list for a particular entry 
C)  The traveling salesman problem 
D)  Listing all possible subcommittees within a given committee 
A)  Sorting a list 
B)  Searching through a list for a particular entry 
C)  The traveling salesman problem 
D)  Listing all possible subcommittees within a given committee

Question 10

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 11

A _______________ is a relationship between input and output values such that any input is associated
with only one output. If the output can be determined algorithmically from the input, the relationship is
said to be _______________ .

Accepted Answer

function,

Question 12

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 13

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 14

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(n2). 
D)  X is in  $ \varTheta$(n2). 
A)  X is in NP. 
B)  X is in P. 
C)  X is in O(n2). 
D)  X is in  $ \varTheta$(n2).

Question 15

Explain the distinction between time complexity and space complexity.

Accepted Answer

Time complexity measures the a

Question 16

State the Church-Turing thesis.

Accepted Answer

The Turing-computabl

Question 17

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

Accepted Answer

A)   $ \varTheta$(lg n) 
B)   $ \varTheta$(n) 
C)   $ \varTheta$(n lg n) 
D)   $ \varTheta$(n2) 
A)   $ \varTheta$(lg n) 
B)   $ \varTheta$(n) 
C)   $ \varTheta$(n lg n) 
D)   $ \varTheta$(n2)

Question 18

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

Accepted Answer

A)  while X not 0 do;
end; 
B)  while X not 0 do;
decr X;
end; 
C) decr X; 
while X not 0 do;
end; 
A)  while X not 0 do;
end; 
B)  while X not 0 do;
decr X;
end; 
C) decr X; 
while X not 0 do;
end;

Question 19

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

Which of the following statements is false?

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

Is the following Bare Bones program self-terminating? Explain your answer.

What action is performed by the Turing machine described below?

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

Turing machines represent

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

The precise time complexity of which of the following problems has not yet been established by researchers?

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.

A _ is a relationship between input and output values such that any input is associated with only one output. If the output can be determined algorithmically from the input, the relationship is said to be _ .

An unsolvable problem is a problem for which

Which of the following statements is true?

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

Explain the distinction between time complexity and space complexity.

State the Church-Turing thesis.

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

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

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

Data Storage

Data Manipulation

Operating Systems

Networking and the Internet

Algorithms

Programming Languages

Software Engineering

Data Abstractions

Database Systems

Computer Graphics

Theory of Computation

Filters

Exam 11: Artificial Intelligence

Which of the following statements is false?

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

Is the following Bare Bones program self-terminating? Explain your answer.

What action is performed by the Turing machine described below?

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

Turing machines represent

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

The precise time complexity of which of the following problems has not yet been established by researchers?

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.

A _______________ is a relationship between input and output values such that any input is associated with only one output. If the output can be determined algorithmically from the input, the relationship is said to be _______________ .

An unsolvable problem is a problem for which

Which of the following statements is true?

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

Explain the distinction between time complexity and space complexity.

State the Church-Turing thesis.

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

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

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

Data Storage

Data Manipulation

Operating Systems

Networking and the Internet

Algorithms

Programming Languages

Software Engineering

Data Abstractions

Database Systems

Computer Graphics

Theory of Computation

Filters

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.

A _ is a relationship between input and output values such that any input is associated with only one output. If the output can be determined algorithmically from the input, the relationship is said to be _ .