88. What term is used to refer to an informal description of a sequence of steps for solving a problem? A) assembly language instructions B) pseudocode C) machine instructions for a specific CPU D) Java virtual machine instructions Ans: B Section Ref: Section 1.7 Problem Solving: Algorithm Design Title: What term is used to refer to an informal description of a sequence of steps for solving a problem? Difficulty: Easy 89. What term is used to refer to a sequence of steps for solving a problem that is unambiguous, executable, and terminating? A) documentation B) pseudoprogram C) algorithm D) comments Ans: C Section Ref: Section 1.7 Problem Solving: Algorithm Design Title: What term is used to refer to a sequence of steps for solving a problem that is unambiguous, executable, and terminating? Difficulty: Easy 90. Which of the following options is true about algorithms? A) Algorithms are described informally and can contain ambiguous steps. B) Algorithms are written in a programming language. C) Algorithms can replace the source code in programs. D) You must create an algorithm for a problem before you can create a program to solve the problem. Ans: D Section Ref: Section 1.7 Problem Solving: Algorithm Design Title: Which of the following options is true about algorithms? Difficulty: Easy 91. A step sequence is unambiguous when ___________________________ A) it will eventually come to an end. B) it is clearly documented. C) it can be carried out in practice. D) are precise instructions for what to do at each step and where to go next. Ans: D Section Ref: Section 1.7 Problem Solving: Algorithm Design
88. What term is used to refer to an informal description of a sequence of steps for solving a problem? A) assembly language instructions B) pseudocode C) machine instructions for a specific CPU D) Java virtual machine instructions Ans: B Section Ref: Section 1.7 Problem Solving: Algorithm Design Title: What term is used to refer to an informal description of a sequence of steps for solving a problem? Difficulty: Easy 89. What term is used to refer to a sequence of steps for solving a problem that is unambiguous, executable, and terminating? A) documentation B) pseudoprogram C) algorithm D) comments Ans: C Section Ref: Section 1.7 Problem Solving: Algorithm Design Title: What term is used to refer to a sequence of steps for solving a problem that is unambiguous, executable, and terminating? Difficulty: Easy 90. Which of the following options is true about algorithms? A) Algorithms are described informally and can contain ambiguous steps. B) Algorithms are written in a programming language. C) Algorithms can replace the source code in programs. D) You must create an algorithm for a problem before you can create a program to solve the problem. Ans: D Section Ref: Section 1.7 Problem Solving: Algorithm Design Title: Which of the following options is true about algorithms? Difficulty: Easy 91. A step sequence is unambiguous when ___________________________ A) it will eventually come to an end. B) it is clearly documented. C) it can be carried out in practice. D) are precise instructions for what to do at each step and where to go next. Ans: D Section Ref: Section 1.7 Problem Solving: Algorithm Design
Big-Java-Early-Objects-5th-Edition-Test-Bank.docx