Exam 1: An Introduction to Computer Science
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
Jacquard's Loom was considered the first "computing device" because it was ____ and had memory where information was stored in a machine-readable form.
Free
(Multiple Choice)
4.8/5
(33)
Correct Answer:
D
______ operations are the "looping" instructions of an algorithm.
Free
(Multiple Choice)
4.8/5
(40)
Correct Answer:
B
The history of ____ begins 3,000 years ago.
Free
(Multiple Choice)
4.8/5
(29)
Correct Answer:
D
In ____ computer science, researchers study the logical and mathematical properties of problems and their solutions.
(Multiple Choice)
4.9/5
(30)
The Pascaline and Leibnitz's Wheel are examples of early computers.
(True/False)
4.9/5
(28)
Explain the achievement of the Difference Engine of Charles Babbage, and explain the challenge he faced in trying to construct the larger model.
(Essay)
5.0/5
(36)
Charles Babbage gave up on his second ____________________ because the current technology could not support his project.
(Short Answer)
4.7/5
(35)
Define each of the categories to which the operations used to construct algorithms belong. Provide two to three examples within each category.
(Essay)
4.8/5
(38)
The statement "If the mixture is too dry, then add one-half cup of water to the bowl" is an example of a(n)iterative operation. _________________________
(True/False)
4.8/5
(39)
The Analytical Engine was the first computing device to use the base-2 binary numbering system. _________________________
(True/False)
4.8/5
(34)
The discovery by Gödel places a limit on the capabilities of computers and computer scientists. _________________________
(True/False)
4.9/5
(32)
An operation that is ____ is called a primitive operation of the computing agent carrying out the algorithm.
(Multiple Choice)
4.8/5
(41)
What was the major change brought about by the second generation of computing?
(Essay)
4.8/5
(39)
FORTRAN and COBOL, the first high-level (English-like)programming languages, appeared during the first generation of computing. _________________________
(True/False)
4.8/5
(38)
At its most basic level, computer science is the study of algorithms.
(True/False)
4.8/5
(39)
Algorithms usually contain a set of instructions to be executed in a specific order.
(True/False)
5.0/5
(41)
List at least six of the recent developments of the fifth generation of computing.
(Essay)
4.7/5
(38)
Showing 1 - 20 of 50
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)