Introduction to Problem Solving

Topics in this chapter

• Problem Analysis and Specification
• Algorithm Design and Properties
• Flowcharts and Pseudocode
• Control Structures and Logic
• Debugging and Error Types
• Testing and Dry Runs

Cheat sheet

Practice questions

1. Question 1Q-5B1BBE

   Which sequence best represents the main stages of solving a programming problem?

   1. A.Understand and analyse the problem, design an algorithm, implement it, and test and debug the solution
   2. B.Write code first, define the problem later, and skip testing
   3. C.Test the program, draw a flowchart, understand the output, and then define the input
   4. D.Choose programming language, print results, and then identify the problem
   See the answer and solution
2. Question 2Q-640FE5

   Consider the following pseudocode: set n to 5; while n > 0, display n. Which essential property of an algorithm is not satisfied?

   1. A.Input
   2. B.Definiteness
   3. C.Finiteness
   4. D.Effectiveness
   See the answer and solution
3. Question 3Q-B47E0C

   Explain how problem decomposition helps in solving a programming problem. Use the task of preparing a student's result as an example and mention at least two smaller subtasks.

   See the answer and solution
4. Question 4Q-AE9AF2

   Which statement correctly describes an algorithm?

   1. A.A collection of random instructions that may or may not terminate
   2. B.A finite, ordered set of unambiguous steps for solving a problem
   3. C.A programming language used to write computer programs
   4. D.A flowchart symbol used only for input
   See the answer and solution
5. Question 5Q-2C91EC

   Consider the following pseudocode for finding the largest of three numbers: read a, b, c; largest = a; if b > largest then largest = b; if c > largest then largest = c; display largest. If the second if statement is replaced by an else-if connected to the first if statement, what problem can occur?

   1. A.The value of a can never be used as the initial largest value
   2. B.The algorithm will always display the smallest number
   3. C.The comparison with c may be skipped even when c is the largest number
   4. D.The algorithm will become an infinite loop
   See the answer and solution