Question 1

Select all that apply . Which of the following lacks finiteness?

Accepted Answer

A)  Add 2 to a number five times . 
B)  Find the value of pi . 
C)  Read Chapter 10 . 
D)  Bake until the top of the cake appears brown . 
A)  Add 2 to a number five times . 
B)  Find the value of pi . 
C)  Read Chapter 10 . 
D)  Bake until the top of the cake appears brown .

Question 2

Which of the following statements is NOT true about algorithms?

Accepted Answer

A)  Problems can be solved by different algorithms in different ways . 
B)  Algorithms can be given at different levels of detail, depending on the abilities of the agent . 
C)  Algorithms always work . 
D)  All of these are true . 
A)  Problems can be solved by different algorithms in different ways . 
B)  Algorithms can be given at different levels of detail, depending on the abilities of the agent . 
C)  Algorithms always work . 
D)  All of these are true .

Question 3

The intended result (that is, the data resulting from a computation) is the ________ .

Accepted Answer

The answer of The intended result (that is, the data...

Question 4

There is only one possible algorithm that can be developed to solve each problem .

Accepted Answer

A) True 
 B)False

Question 5

Anyone who creates an algorithm needs to know why it works .

Accepted Answer

A) True 
 B)False

Question 6

A(n) ________, such as C or Java, is a formal notation used to precisely define an algorithm .

Accepted Answer

programmin

Question 7

It is possible for the output of an algorithm to be a statement that says there is no possible solution .

Accepted Answer

A) True 
 B)False

Question 8

Instruction sequences that repeat are called

Accepted Answer

A)  loops 
B)  tests 
C)  sorts 
D)  assumptions 
A)  loops 
B)  tests 
C)  sorts 
D)  assumptions

Question 9

Select all that apply . Which of the following is(are) required of an algorithm?

Accepted Answer

A)  It must, eventually, end . 
B)  Input and output must be specified . 
C)  It must be executable without further external support . 
D)  It must specify every step and the order the steps must be performed . 
A)  It must, eventually, end . 
B)  Input and output must be specified . 
C)  It must be executable without further external support . 
D)  It must specify every step and the order the steps must be performed .

Question 10

The type of data, the amount of data, and the form of the data must all be specified when creating an algorithm .

Accepted Answer

A) True 
 B)False

Question 11

A web search process is not an algorithm; rather, it is a(n) ________ process .

Accepted Answer

The answer of A web search process is not an...

Question 12

A heuristic process is an example of an algorithm .

Accepted Answer

A) True 
 B)False

Question 13

The data to be transformed during the computation in order to produce the output is the ________ .

Accepted Answer

The answer of The data to be transformed during the...

Question 14

A(n) ________ is an idea or concept extracted from a specific situation .

Accepted Answer

The answer of A(n) ________ is an idea or concept...

Question 15

A precise, systematic method for producing a specified result is a(n) ________ .

Accepted Answer

The answer of A precise, systematic method for producing a...

Question 16

An algorithm is a systematic method to produce a specified result .

Accepted Answer

A) True 
 B)False

Question 17

Which of the following is an example of definiteness?

Accepted Answer

A)  Add and multiply values A, B, and C . 
B)  Divide the result of values A and B by D . 
C)  Use multiplication and addition to find the result of three values . 
D)  Add values A and B, then divide by C . If C = 0, solution is "undefined . " 
A)  Add and multiply values A, B, and C . 
B)  Divide the result of values A and B by D . 
C)  Use multiplication and addition to find the result of three values . 
D)  Add values A and B, then divide by C . If C = 0, solution is "undefined . "

Select all that apply . Which of the following lacks finiteness?

Which of the following statements is NOT true about algorithms?

The intended result (that is, the data resulting from a computation) is the ________ .

There is only one possible algorithm that can be developed to solve each problem .

Anyone who creates an algorithm needs to know why it works .

A(n) ________, such as C or Java, is a formal notation used to precisely define an algorithm .

It is possible for the output of an algorithm to be a statement that says there is no possible solution .

Instruction sequences that repeat are called

Select all that apply . Which of the following is(are) required of an algorithm?

The type of data, the amount of data, and the form of the data must all be specified when creating an algorithm .

A web search process is not an algorithm; rather, it is a(n) ________ process .

A heuristic process is an example of an algorithm .

The data to be transformed during the computation in order to produce the output is the ________ .

A(n) ________ is an idea or concept extracted from a specific situation .

A precise, systematic method for producing a specified result is a(n) ________ .

An algorithm is a systematic method to produce a specified result .

Which of the following is an example of definiteness?

Defining Information Technology

Exploring the Human-Computer Interface

The Basics of Networking

A Hypertext Markup Language Primer

Locating Information on the World Wide Web

An Introduction to Debugging

Representing Information Digitally

Representing Multimedia Digitally

Principles of Computer Operations

Social Implications of IT

Privacy and Digital Security

The Basics of Spreadsheets

Advanced Spreadsheets for Planning

Introduction to Database Concepts

A Case Study in Database Organization

Fundamental Concepts Expressed in Javascript

A Javascript Program

Programming Functions

Iteration Principles

A Case Study in Algorithmic Problem Solving

Limits to Computation

A Fluency Summary

Filters

Exam 10: Algorithmic Thinking

Select all that apply . Which of the following lacks finiteness?

Which of the following statements is NOT true about algorithms?

The intended result (that is, the data resulting from a computation) is the ________ .

There is only one possible algorithm that can be developed to solve each problem .

Anyone who creates an algorithm needs to know why it works .

A(n) ________, such as C or Java, is a formal notation used to precisely define an algorithm .

It is possible for the output of an algorithm to be a statement that says there is no possible solution .

Instruction sequences that repeat are called

Select all that apply . Which of the following is(are) required of an algorithm?

The type of data, the amount of data, and the form of the data must all be specified when creating an algorithm .

A web search process is not an algorithm; rather, it is a(n) ________ process .

A heuristic process is an example of an algorithm .

The data to be transformed during the computation in order to produce the output is the ________ .

A(n) ________ is an idea or concept extracted from a specific situation .

A precise, systematic method for producing a specified result is a(n) ________ .

An algorithm is a systematic method to produce a specified result .

Which of the following is an example of definiteness?

Defining Information Technology

Exploring the Human-Computer Interface

The Basics of Networking

A Hypertext Markup Language Primer

Locating Information on the World Wide Web

An Introduction to Debugging

Representing Information Digitally

Representing Multimedia Digitally

Principles of Computer Operations

Social Implications of IT

Privacy and Digital Security

The Basics of Spreadsheets

Advanced Spreadsheets for Planning

Introduction to Database Concepts

A Case Study in Database Organization

Fundamental Concepts Expressed in Javascript

A Javascript Program

Programming Functions

Iteration Principles

A Case Study in Algorithmic Problem Solving

Limits to Computation

A Fluency Summary

Filters