Page 1

Full file at http://testbank360.eu/test-bank-invitation-to-computer-science-5th-edition-schneide

Ch02 True/False Indicate whether the statement is true or false. ____

1. An unstructured, “free-flowing” writing style should be used for writing algorithms.

____

2. With a natural language, different readers can interpret the same sentence in totally different ways.

____

3. During the initial phases of design, we should be thinking and writing at a highly abstract level.

____

4. Java and C++ are examples of pseudocode languages.

____

5. Languages such as Java and C++ are the algorithmic design languages of choice.

____

6. The fact that natural language can have many different meanings in different contexts makes it difficult to use for designing algorithms.

____

7. Pseudocode is a set of English language constructs designed to resemble the statements in a programming language.

____

8. Pseudocode is sometimes called a programming language without any details.

____

9. The three basic sequential operations are called addition, multiplication, and exponentiation.

____ 10. When writing arithmetic expressions in pseudocode, you can assume that the computing agent already knows the basic trigonometric functions, sine, cosine, and tangent. ____ 11. Input and output enable the computing agent to communicate with the outside world. ____ 12. When writing arithmetic expressions in pseudocode, you can assume that the computing agent executing your algorithm has all the capabilities of a typical calculator. ____ 13. A sequential algorithm executes its instructions in a straight line from top to bottom and then stops. ____ 14. Control operations allow us to alter the normal sequential flow of control in an algorithm. ____ 15. The if/then/else operation allows you to select exactly one of two alternatives. ____ 16. The two parts of a “while” statement are known as the loop head and the loop body. ____ 17. One of the most powerful features of a computer is its ability to handle loops. ____ 18. Having an infinite loop in an algorithm is an error. ____ 19. In a posttest loop, it is possible for the loop body to never be executed. ____ 20. The multiplication operation can be reduced to repeatedly adding a number a certain number of times. ____ 21. The process of finding a solution to a given problem is called algorithm discovery. ____ 22. Once an algorithm has been developed, it may itself be used in the construction of other algorithms. ____ 23. The use of high-level instructions during the design process is an example of abstraction. ____ 24. Pattern matching can only be applied to graphics and pictures. ____ 25. The process of searching for a special pattern of symbols within a larger collection of information is called object matching.


Full file at http://testbank360.eu/test-bank-invitation-to-computer-science-5th-edition-schneide

Multiple Choice Identify the choice that best completes the statement or answers the question. ____ 26. ____ is an example of a natural language. a. C c. English b. Java d. Perl ____ 27. Most computer scientists use ____ to design and represent algorithms. a. natural languages c. low-level programming languages b. high-level programming languages d. pseudocode ____ 28. In the line of code, “Set the value of Area to length*width”, “Area” is a ____. a. value c. constant b. variable d. primitive ____ 29. A(n) ____ is a named storage location that can hold a data value. a. expression c. computation b. variable d. constant ____ 30. ____ operations submit to the computing agent data values from the outside world that it may then use in later instructions. a. Ingoing c. Input b. Outgoing d. Output ____ 31. ____ operations send results from the computing agent to the outside world. a. Input c. Send b. Put d. Output ____ 32. A purely ____ algorithm is sometimes termed a straight-line algorithm. a. sequential c. iterative b. conditional d. control ____ 33. Together, conditional and iterative operations are called ____ operations. a. sequential c. hierarchical b. control d. dynamic ____ 34. ____ statements are the “question-asking” operations of an algorithm. a. Primitive c. Sequential b. Iterative d. Conditional ____ 35. A ____ is the repetition of a block of instructions. a. cycle c. matrix b. nucleus d. loop ____ 36. An algorithm can fall into an infinite loop when ____. a. the input operations were missing b. the algorithm uses more than one loop c. the output operations were missing d. the continuation condition of the loop never becomes false ____ 37. In a pretest loop, the continuation condition is tested at the ____ through the loop. a. beginning of each pass c. end of each pass b. beginning of only the first pass d. end of only the last pass ____ 38. In a posttest loop, the continuation condition is tested at the ____ through the loop. a. beginning of each pass c. end of each pass b. beginning of just the first pass d. end of just the last pass ____ 39. The ____ loop is an example of a posttest loop. a. do/while c. while b. do d. if/then/else


Full file at http://testbank360.eu/test-bank-invitation-to-computer-science-5th-edition-schneide

____ 40. To create a loop that executes exactly b times, we create a ____. a. control object c. counter b. counting method d. variable ____ 41. “Print the value of product” is an example of a(n) ____ operation. a. sequential c. input b. conditional d. output ____ 42. The standard algorithm for searching a(n) ____ list of values is called sequential search. a. ordered c. numerical b. unordered d. alphabetical ____ 43. The technique of looking at all the items in a list, starting at the beginning of the list, one at a time, until we either find what we are looking for or come to the end of the list is called ____ search. a. sequential c. iterative b. control d. random ____ 44. The selection of an algorithm to solve a problem is greatly influenced by the way the ____ for that problem are organized. a. words c. solutions b. data d. pseudocode ____ 45. A(n) ____ is a collection of useful algorithms. a. primitive c. set b. binary d. library ____ 46. In order to implement a “find” functionality in a word processor, one would have to design a ____ algorithm. a. pattern matching c. sequential b. natural language d. do-while ____ 47. ____ is the process of searching for a special pattern of symbols within a larger collection of information. a. Sequential search c. Pattern matching b. Dynamic processing d. Pattern search ____ 48. ____ refers to the separation of the high-level view of an entity or an operation from the low-level details of its implementation. a. Inheritance c. Encapsulation b. Randomness d. Abstraction ____ 49. Viewing an operation at a high level of abstraction and fleshing out the details of its implementation at a later time is known as ____ design. a. bottom-up c. increasing size b. top-down d. increasing depth ____ 50. Which statement exemplifies abstraction? a. The president of General Motors views the company in terms of every worker, every supplier, and every car. b. The president of General Motors views the company in terms of its corporate divisions and high-level policy issues. c. A good approach to algorithm design and software development, is to focus on how we might actually implement a particular operation. d. A convenient way to view the hardware component called “memory” is to focus on the billions of electronic devices that go into constructing a memory unit.


Full file at http://testbank360.eu/test-bank-invitation-to-computer-science-5th-edition-schneide

Ch02 Answer Section TRUE/FALSE 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25.

ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS:

F T T F F T T T F T T T T T T F T T F T T T T F F

PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS:

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF:

40 41 41 41 41 41 42 42 43 44 44 44 46 46 46 48 48 49 52 54 57 62 70 67 67

PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS:

1 1 1 1 1 1 1 1 1 1 1 1 1

REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF:

40 42 43 43 44 44 46 46 46 48 49 51 51

MULTIPLE CHOICE 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38.

ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS:

C D B B C D A B D D D A C


Full file at http://testbank360.eu/test-bank-invitation-to-computer-science-5th-edition-schneide

39. 40. 41. 42. 43. 44. 45. 46. 47. 48. 49. 50.

ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS: ANS:

A C D B A B D A C D B B

PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS: PTS:

1 1 1 1 1 1 1 1 1 1 1 1

REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF: REF:

51 55 56 58 58 61 62 67 67 70 70 70

Test bank invitation to computer science 5th edition schneider  

test bank invitation to computer science 5th edition schneider. Full file at http://testbank360.eu/test-bank-invitation-to-computer-sci...

Read more
Read more
Similar to
Popular now
Just for you