Test Bank in Conjunction with Invitation to Computer Science,Schneider,6e

Chapter 1: An Introduction to Computer Science




TRUE/FALSE



1. The evolution of computer science began before the development of the first computer system.


ANS: T PTS: 1 REF: 2



2. Computer science is the study of computers.


ANS: F PTS: 1 REF: 2



3. Computer science is the study of how to write computer programs.


ANS: F PTS: 1 REF: 3



4. Algorithms are exclusive to the field of computer science.


ANS: F PTS: 1 REF: 7



5. All conceivable problems can be solved algorithmically.


ANS: F PTS: 1 REF: 11



6. Algorithms usually contain a set of instructions to be executed in any order.


ANS: F PTS: 1 REF: 12

, 7. When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the
computing agent carrying out the algorithm.


ANS: T PTS: 1 REF: 13-14



8. Mechanical devices for performing complex calculations existed prior to the 20th century.


ANS: T PTS: 1 REF: 18-19



9. Hollerith’s machines were one of the first examples of the use of automated information
processing to solve large-scale, real-world problems.


ANS: T PTS: 1 REF: 22



10. The first electronic programmable computer, ENIAC, was built during World War I.


ANS: F PTS: 1 REF: 24-25




MODIFIED TRUE/FALSE



1. According to Norman Gibbs' and Allen Tucker's definition of computer science, the central
concept in computer science is the compiler. _________________________


ANS: F, algorithm


PTS: 1 REF: 5



2. 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. _________________________


ANS: F, conditional

, PTS: 1 REF: 7



3. The discovery by Gödel places a limit on the capabilities of computers and computer scientists.
_________________________


ANS: T PTS: 1 REF: 10



4. The Analytic Engine was the first computing device to use the base-2 binary numbering system.
_________________________


ANS: F

Mark I

Harvard Mark I


PTS: 1 REF: 24



5. FORTRAN and COBOL, the first high-level (“English-like”) programming languages, appeared
during the first generation of computing. _________________________


ANS: F, second


PTS: 1 REF: 29




COMPLETION



1. The three types of ____________________ used to construct algorithms are sequential,
conditional, and iterative.


ANS: operations

, PTS: 1 REF: 6-7



2. One of the most fundamentally important virtues of a(n) ____________________ is that if we
can specify one to solve a problem, then we can automate the solution.


ANS: algorithm


PTS: 1 REF: 10



3. Leibniz’s ____________________ could carry out addition, subtraction, multiplication, and
division.


ANS: Wheel


PTS: 1 REF: 19



4. Charles Babbage gave up on his second ____________________ because the current technology
could not support his project.


ANS: Difference Engine


PTS: 1 REF: 21



5. Wireless communications are a(n) ____________________-generation innovation in computing.


ANS: fifth


PTS: 1 REF: 31




MULTIPLE CHOICE