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
Input and output allow the computing agent to communicate with the outside world.
(True/False)
4.9/5
(36)
A purely ____ algorithm is also called a straight-line algorithm.
(Multiple Choice)
4.8/5
(38)
"Print the value of product" is an example of a(n) ____ operation.
(Multiple Choice)
4.7/5
(47)
The two parts of a "while" statement are known as the loop head and the loop body.
(True/False)
4.9/5
(28)
A(n) ____ is a named storage location that can hold a data value.
(Multiple Choice)
4.9/5
(41)
In a pretest loop, the continuation condition is tested at the ____ through the loop.
(Multiple Choice)
4.9/5
(35)
Showing 41 - 50 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)