100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Invitation to Computer Science 7Th Ed by G Michael Schneider Judith Gersting - Test Bank £22.99
Add to cart
Quickly navigate to
Preview
  2.  
  3. Invitation To Computer
  4.  
  5. Invitation To Computer
  6.  
  7. Invitation to Computer

Exam (elaborations)

Invitation to Computer Science 7Th Ed by G Michael Schneider Judith Gersting - Test Bank
 1 purchase

Test Bank For Invitation to Computer Science 7Th Ed byG Michael Schneider Judith Gersting Complete Test Bank Instant Download

Preview 4 out of 167  pages

Document information

  • October 6, 2023
  • 167
  • 2023/2024
  • Exam (elaborations)
  • Questions & answers

Subjects

  • invitation to computer science 7th ed by g michae
  • invitation to computer science
  • complete test bank with answers
  • test bank

Written for

All documents for this subject (2)

Seller

avatar-seller
ExamsExpert

Reviews received

Content preview

,Name Clas Dat
: s: e:

Chapter 01: An Introduction to Computer Science
1. The evolution of computer science began before the development of the first computer system.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 2

2. Computer science is the study of computers.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 2

3. Computer science is the study of how to write computer programs.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 3

4. Algorithms are exclusive to the field of computer science.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 7

5. All conceivable problems can be solved algorithmically.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 11

6. Algorithms usually contain a set of instructions to be executed in any order.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 12

7. When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the computing agent
Cengage Learning Testing, Powered by Cognero Page 1

,Name Clas Dat
: s: e:

Chapter 01: An Introduction to Computer Science
carrying out the algorithm.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 13-14

8. Mechanical devices for performing complex calculations existed prior to the 20th century.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 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.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 22

10. The first electronic programmable computer, ENIAC, was built during World War I.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 24-25

11. According to Norman Gibbs' and Allen Tucker's definition of computer science, the central concept in computer
science is the compiler. _________________________
ANSWER: False - algorithm
POINTS: 1
REFERENCES: 5

12. 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. _________________________
ANSWER: False - conditional
POINTS: 1
REFERENCES: 7

13. The discovery by Gödel places a limit on the capabilities of computers and computer scientists.
_________________________
ANSWER: True
Cengage Learning Testing, Powered by Cognero Page 2

, Name Clas Dat
: s: e:

Chapter 01: An Introduction to Computer Science
POINTS: 1
REFERENCES: 10

14. The Analytic Engine was the first computing device to use the base-2 binary numbering system.
_________________________
ANSWER: False - Mark I, Harvard Mark I
POINTS: 1
REFERENCES: 24

15. FORTRAN and COBOL, the first high-level (“English-like”) programming languages, appeared during the first
generation of computing. _________________________
ANSWER: False - second
POINTS: 1
REFERENCES: 29

16. The three types of ____________________ used to construct algorithms are sequential, conditional, and iterative.
ANSWER: operations
POINTS: 1
REFERENCES: 6-7

17. 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.
ANSWER: algorithm
POINTS: 1
REFERENCES: 10

18. Leibniz’s ____________________ could carry out addition, subtraction, multiplication, and division.
ANSWER: Wheel
POINTS: 1
REFERENCES: 19

19. Charles Babbage gave up on his second ____________________ because the current technology could not support his
project.
ANSWER: Difference Engine
POINTS: 1
REFERENCES: 21

20. Wireless communications are a(n) ____________________-generation innovation in computing.
ANSWER: fifth
POINTS: 1
REFERENCES: 31

21. In ____ computer science, researchers study the logical and mathematical properties of problems and their solutions.
a. theoretical b. scientific

Cengage Learning Testing, Powered by Cognero Page 3

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller ExamsExpert. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £22.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67479 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 15 years now

Start selling
£22.99  1x  sold
  • (0)
Add to cart
Added