CSC 180 Chapter 10 Quiz

Réussis tes devoirs et examens dès maintenant avec Quizwiz!

An algorithm must contain a loop.

false

Algorithms should:

use resources efficiently

Which of the following is a good example of effectiveness?

Add 1 to the total number of students registered.

In a flowchart, how would the following be represented? "Is the cost greater than 100?"

As a diamond with the question listed inside the diamond.

In an algorithm or a program, what happens if a loop has no test condition?

The loop would continue "forever"

Programmers use programming languages because these languages:

are precise and unambiguous

A computer algorithm must:

be aware of input and execution settings, be sure the language cannot be misinterpreted, take into account the computer's capabilities, (all of these)

Asking for the interest rate and not specifying whether it should be a percentage or a decimal is an example of missing the ______________ or making a wrong assumption about the data input.

context

Which of the following lacks finiteness?

dividing 10 by 3

Which of the following is a natural language?

english

Algorithms are rare and seldom used outside of the field of computers.

false

An alphabetize algorithm will not work on numbered items.

false

Replacing nouns with pronouns in a natural language algorithm will make the algorithm more understandable.

false

The intersect of an alphabetized list (IAL) and the No Alphabetized Lists (NAL) are different solutions because they:

have different running times, rely on the characteristics of the input, require different forms of the input, (all of these)

Instruction sequences that repeat are called:

loops

An algorithm is a(n) ________ while a program is a(n) ________:

plan, set of directions

The correct order from lowest to highest level of detail of the same program is:

programming language, assembly language, and binary

A heuristic process:

provides guidelines for finding a solution

Different algorithms for the same problem can:

solve the same problem differently, take different amounts of processing time, mean that one algorithm is preferred over others, (all of these)

Which of the following is an example of an algorithm?

the recipe for your favorite chocolate chip cookies, the instructions to assemble a child's bicycle, the directions for alphabetizing your CD collection, (all of these)

A loop in an algorithm must also include a test for finiteness.

true

A possible output for some computations is a statement that there is no output-that is, there is no possible solution.

true

A program is an algorithm, but an algorithm might not be a program.

true

Algorithms always use functions-operations that the agent already knows how to perform-to simplify the algorithmic description.

true

An algorithm is a process. A set of specified steps.

true

An algorithm must be a systematic method for producing a specified result.

true

An algorithm must be systematic and precise.

true

Inputs can be thought of as the raw materials of a problem and outputs are the finished product.

true

The sequence of commands is important in an algorithm.

true

The type of data, the amount of data, and the form of the data that the algorithm expects. must be specified.

true

The way to know that an algorithm works is to know what properties the computation has that cause it to produce the right result every time, and to be able to explain how they do the job.

true

To be effective, an algorithm must stand on its own without outside help or further input.

true

To be effective, an algorithm must stand on its own without outside help or interference.

true


Ensembles d'études connexes

Penal Code 3 - TCOLE Objectives 8.24 - 8.34

View Set

Anatomy Chapter 5 The Skeletal System

View Set

Introduction to Concepts and Responsibilities of Home Ownership

View Set

Marketing Final (Ch 13 + All Quizzes)

View Set

ET3P4: Firms in a competitive market

View Set

Manufacturing Exam 1 Chapter 1-8

View Set

Chapter 9; Psychological Disorders

View Set

CSE205 - Exam 2 - Quiz 8 (Recursion)

View Set