Exam (elaborations)
Testbank Invitation to Computer Science - 8th -
Testbank Invitation to Computer Science - 8th - 2019
[Show more]
Connected book
Book Title:
Author(s):
- Edition:
- ISBN:
- Edition:
Content preview
Test Bank for Invitation To Computer Science 8th Edition Chapter 1: 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 DIFFICULTY: Easy REFERENCES: 3 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.1 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 2. At its most basic level, computer science is the study of algorithms. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy REFERENCES: 6 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.2 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 3. Computer science is the study of how to write computer programs. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy REFERENCES: 3–4 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.1 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 4. Algorithms are exclusive to the field of computer science. a. True Page 1 Test Bank for Invitation To Computer Science 8th Edition Chapter 1: An Introduction to Computer Science. b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy REFERENCES: 7 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.2 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 5. All conceivable problems can be solved algorithmically. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy REFERENCES: 11 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.2 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 6. Algorithms usually contain a set of instructions to be executed in a specific order. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy REFERENCES: 12 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.3.1 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 7. When an operation is unambiguous, we call it a primitive operation, or simply a primitive of the computing agent carrying out the algorithm. a. True b. False Page 2 Test Bank for Invitation To Computer Science 8th Edition Chapter 1: An Introduction to Computer Science. ANSWER: True POINTS: 1 DIFFICULTY: Moderate REFERENCES: 13–14 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.3.1 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 8. Mechanical devices for performing complex calculations existed prior to the twentieth century. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy REFERENCES: 18–19 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.4.1 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 9. The Pascaline and Leibnitz’s Wheel are examples of early computers. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Moderate REFERENCES: 22 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.4.1 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 10. The first electronic programmable computer, ENIAC, was completed just after World War II. a. True b. False ANSWER: True POINTS: 1 Page 3 Test Bank for Invitation To Computer Science 8th Edition Chapter 1: An Introduction to Computer Science. DIFFICULTY: Moderate REFERENCES: 25 QUESTION TYPE: True / False HAS VARIABLES: False OTHER: 1.4.2 DATE CREATED: 11/20/2017 10:15 PM DATE MODIFIED: 11/21/2017 1:18 AM 11. According to Norman Gibbs’s and Allen Tucker’s definition of computer science, the central concept in computer science is the compiler . _________________________ ANSWER: False - algorithm POINTS: 1 DIFFICULTY: Moderate REFERENCES: 6 QUESTION TYPE: Modified True / False HAS VARIABLES: False OTHER: 1.2 DATE CREATED: 11/21/2017 2:10 AM DATE MODIFIED: 11/21/2017 2:10 AM 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 DIFFICULTY: Easy REFERENCES: 7 QUESTION TYPE: Mod ified True / False HAS VARIABLES: False OTHER: 1.2 DATE CREATED: 11/21/2017 2:11 AM DATE MODIFIED: 11/21/2017 2:11 AM 13. The discovery by Gödel places a limit on the capabilities of computers and computer scientists. _________________________ a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Moderate REFERENCES: 11 QUESTION TYPE: True / False Page 4The benefits of buying summaries with Stuvia:
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
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
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 TestBankNursingUS. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $14.89. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
76669 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now
