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 Babel50 Questions
Exam 11: Compilers and Language Translation50 Questions
Exam 12: Models of Computation49 Questions
Exam 13: Simulation and Modeling50 Questions
Exam 14: Electronic Commerce, Databases, and Personal Privacy50 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 allows you to select exactly one of three alternatives.
(True/False)
4.8/5
(35)
In a pretest loop, the continuation condition is tested at the ____ through the loop.
(Multiple Choice)
4.9/5
(38)
One of the most powerful features of a computer is its ability to handle loops.
(True/False)
4.8/5
(33)
Pseudocode is a formal language with rigidly standardized syntactic rules and regulations._________________________
(True/False)
4.8/5
(37)
In order to implement a "find" functionality in a word processor, one would have to design a ____ algorithm.
(Multiple Choice)
4.8/5
(46)
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.7/5
(35)
The technique of looking at all the items in a list, starting at the beginning of the list, one at a time, until we either find what we are looking for or come to the end of the list is called ____ search.
(Multiple Choice)
4.9/5
(35)
Explain the importance of the concept of building blocks in the use of algorithms.
(Essay)
4.8/5
(38)
The selection of an algorithm to solve a problem is greatly influenced by the way the input ____ for that problem are organized.
(Multiple Choice)
4.8/5
(34)
What is pseudocode and why is it well-suited for representing algorithms?
(Essay)
4.9/5
(38)
What is the problem with using natural language to represent algorithms?
(Essay)
4.7/5
(35)
Showing 21 - 40 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)