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 and Cloud Computing50 Questions
Exam 8: Information Security50 Questions
Exam 9: Introduction to High-Level Language Programming50 Questions
Exam 10: The Tower of Babel: Programming Languages50 Questions
Exam 11: Compilers and Language Translation50 Questions
Exam 12: Models of Computation50 Questions
Exam 13: Simulation and Modeling50 Questions
Exam 14: Ecommerce, Databases, and Data Science50 Questions
Exam 15: Artificial Intelligence50 Questions
Exam 16: Computer Graphics and Entertainment: Movies, Games, and Virtual Communities50 Questions
Exam 17: Making Decisions About Computers, Information, and Society50 Questions
Select questions type
The if/then/else operation is a conditional statement.
Free
(True/False)
4.9/5
(36)
Correct Answer:
True
A sequential search is the technique of looking at all the items in a list one at a time, starting at _______ of the list, until we either find what we are looking for or come to the end of the list.
Free
(Multiple Choice)
4.9/5
(30)
Correct Answer:
D
____ operations provide the computing agent with data values from the outside world that it may use in later instructions.
Free
(Multiple Choice)
4.9/5
(36)
Correct Answer:
C
Explain the importance of the concept of building blocks in the use of algorithms.
(Essay)
4.8/5
(34)
During the initial phases of design, we should be thinking and writing at a highly ____________________ level.
(Short Answer)
4.9/5
(41)
In the line of pseudocode, "Set the value of Area to length × width", "Area" is a ____.
(Multiple Choice)
4.9/5
(43)
Pseudocode is a formal language with rigidly standardized syntactic rules and regulations. _________________________
(True/False)
4.8/5
(42)
Natural language is a set of English language constructs designed to resemble the statements in a programming language but that do not actually run on a computer. _________________________
(True/False)
4.9/5
(32)
What is the problem with using natural language to represent algorithms?
(Essay)
4.9/5
(34)
Once an algorithm has been developed, it cannot be used in the construction of other algorithms.
(True/False)
5.0/5
(43)
____ operations send results from the computing agent to the outside world.
(Multiple Choice)
4.8/5
(32)
____________________ operations allow us to alter the normal sequential flow of control in an algorithm.
(Short Answer)
4.9/5
(32)
The process of searching for a special pattern of symbols within a larger collection of information is called object matching. _________________________
(True/False)
4.9/5
(38)
____________________ is sometimes called a programming language without any details.
(Short Answer)
4.9/5
(34)
Showing 1 - 20 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)