Exam 2: Algorithm Discovery and Design
Exam 1: An Introduction to Computer Science50 Questions
Exam 2: Algorithm Discovery and Design50 Questions
Exam 3: The Efficiency of Algorithms50 Questions
Exam 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates50 Questions
Exam 5: Computer Systems Organization50 Questions
Exam 6: An Introduction to System Software and Virtual Machines50 Questions
Exam 7: Computer Networks, the Internet, and the Worldwide Web50 Questions
Exam 8: Introduction to High-Level Language Programming100 Questions
Exam 9: The Tower of Babel100 Questions
Exam 10: Compilers and Language Translation50 Questions
Exam 11: Models of Computation50 Questions
Exam 12: Simulation and Modeling50 Questions
Exam 13: Electronic Commerce and Information Security50 Questions
Exam 14: Artificial Intelligence50 Questions
Exam 15: Making Decisions About Computers, Information, and Society50 Questions
Select questions type
In a posttest loop, the continuation condition is tested at the ____ through the loop.
Free
(Multiple Choice)
4.8/5
(34)
Correct Answer:
C
Languages such as Java and C++ are the algorithmic design languages of choice.
Free
(True/False)
4.8/5
(40)
Correct Answer:
False
Iteration should be minimized when designing algorithms.
Free
(True/False)
4.8/5
(38)
Correct Answer:
False
The if/then/else operation allows you to select exactly one of two alternatives.
(True/False)
4.9/5
(37)
Once an algorithm has been developed, it may itself be used in the construction of other algorithms.
(True/False)
4.9/5
(40)
The fact that natural language can have many different meanings in different contexts makes it difficult to use for designing algorithms.
(True/False)
4.8/5
(37)
How are the computer science terms, "index", and "pointer" related?
(Multiple Choice)
4.9/5
(39)
In the multiplication algorithm discussed in this chapter, the statement, "Get values for a and b" is a(n) ____ operation.
(Multiple Choice)
4.7/5
(37)
In pseudocode, it does not matter exactly how you choose to write your instructions as long as the intent is clear and unambiguous.
(True/False)
4.9/5
(40)
The multiplication operation can be reduced to repeatedly adding a number a certain number of times.
(True/False)
4.8/5
(33)
With a natural language, different readers can interpret the same sentence in totally different ways.
(True/False)
4.9/5
(41)
The standard algorithm for searching a(n) ____ list of values is called sequential search.
(Multiple Choice)
4.9/5
(44)
When writing arithmetic expressions in pseudocode, it is safe to assume that the computing agent already knows the basic trigonometric functions, sine, cosine, and tangent.
(True/False)
4.8/5
(36)
Control operations can be used to alter the normal sequential flow of control in an algorithm.
(True/False)
4.9/5
(35)
____ is the process of searching for a special pattern of symbols within a larger collection of information.
(Multiple Choice)
4.9/5
(31)
The design of an algorithm to solve a problem is highly dependent on the organization of the ____ involved in the problem.
(Multiple Choice)
4.9/5
(45)
In addition to designing a correct algorithm, computer scientists concern themselves with algorithmic efficiency.
(True/False)
4.9/5
(41)
Computer algorithms are limited to accepting only two values as input.
(True/False)
4.9/5
(36)
____ is the ability to separate the high-level view of an entity or an operation from the low-level details of its implementation.
(Multiple Choice)
4.8/5
(34)
Showing 1 - 20 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)