Unit 2 Computational Thinking & Algorithms Short Questions

Q1. What is the major difference between solving simple problems and
complex problems?
The main difference between solving simple and complex problems is the number
of steps and the level of difficulty. Simple problems usually have fewer steps,
involve straightforward solutions, and don’t require much time or planning. For
example, calculating the total of two numbers is a simple problem. Complex
problems, however, require more steps, involve multiple factors, and need deeper
thinking and analysis. Complex problems often need to be broken down into
smaller parts before solving. An example of a complex problem is designing a
computer program that manages an entire library system.
Q2. Why do software designers prefer to use IPO charts?
Software designers prefer using IPO charts because they help them organize and
plan the process of solving a problem. IPO stands for Input, Process, and Output.
• Input: What data or information is needed to solve the problem?
• Process: The steps or actions the program will take to work on the data.
• Output: The result or outcome after processing the input.
By using IPO charts, designers can clearly understand what needs to be done at
each stage of a program, making the designing process more structured and
efficient.
Q3. Differentiate between Computational thinking and Logical thinking.
Computational thinking is a problem-solving method used to think like a
computer. It includes breaking down complex problems into smaller parts,
identifying patterns, and using step-by-step processes to solve them. This type of
thinking is important for programming because computers need instructions to
follow.
Logical thinking, on the other hand, is a general way of reasoning used to make
decisions or solve problems in a step-by-step manner. It involves using facts,
rules, and clear steps to conclude. While logical thinking is useful in everyday
situations, computational thinking focuses more on how problems can be solved
in a way that a computer can understand and process.
Q4. Write four properties of Computational thinking.
The following are four important properties of Computational Thinking:
I. Decomposition: This means breaking down a big, complicated problem into
smaller, easier-to-manage parts. For example, if you’re building a website,

Written By: Aman Ullah

 Unit 2 Computational Thinking & Algorithms Short Questions

you can break the task into smaller steps like designing the layout, writing the
content, and coding the functionality.
II. Pattern Recognition: It is about finding similarities or patterns in problems
you have solved before. If you’ve solved a similar problem in the past,
recognizing the pattern can help you solve the new problem more easily.
III. Abstraction: Abstraction involves focusing only on the important details of
the problem and ignoring the less important or unnecessary information.
IV. Algorithm Design: This is the process of creating a step-by-step solution to
solve a problem. An algorithm is like a recipe that tells the computer exactly
what steps to take to complete a task, like sorting a list of numbers in order.
Q5. What are the methods used to design a solution?
Several methods are used to design a solution to a problem in computing. Here
are some of the common ones:
I. Flowcharts: A flowchart is a visual diagram that shows the steps in a process
using symbols and arrows. Each symbol represents an action, and the arrows
show the flow of the process. Flowcharts help in visually understanding how
a program will work.
II. IPO Charts: As mentioned before, an IPO chart helps in organizing the
inputs, processes, and outputs needed to solve a problem. It is useful for
designing small programs where the steps need to be clear.
III. Algorithms: An algorithm is a detailed, step-by-step procedure to solve a
specific problem. It is like a blueprint that guides the computer through each
step required to achieve the desired outcome.
Q6. Which computational thinking technique breaks down the problem into
smaller parts?
The Decomposition technique in computational thinking is used to break down
a large, complex problem into smaller, more manageable parts. This process
allows us to focus on solving one part of the problem at a time. For example, if
you were designing a computer game, decomposition would involve breaking the
task into smaller sub-problems like designing characters, creating levels, writing
game rules, and programming the user interface.
Q7. Identify 3 computing problems from other subjects that you are studying
in your class.
I. Mathematics:
In mathematics, we often encounter problems that require solving multiple
equations or performing complex calculations. For example, using a computer

Written By: Aman Ullah

 Unit 2 Computational Thinking & Algorithms Short Questions

to solve a system of linear equations with many variables can be done using
matrix algebra and algorithms.
II. Physics:
In physics, computers are used to simulate real-world scenarios, like how
objects move under different forces. For example, calculating the trajectory of
a projectile under gravity and air resistance requires complex mathematical
models.
III. Geography:
In geography, computers help process large amounts of data for mapping and
analysis. For example, Geographic Information Systems (GIS) allow us to
input data such as population density, land use, and climate, and then generate
maps that show patterns and relationships.
Q8. Why do we need to think computationally?
We need to think computationally because it helps us solve problems in a
structured and efficient manner, especially when dealing with complex systems
that involve computers. Computational thinking includes breaking down
problems into smaller parts, identifying patterns, focusing on the essential details,
and creating step-by-step instructions to solve the problem. This way of thinking
is crucial not only in programming but in various real-life scenarios, such as
analyzing data, automating tasks, and solving large-scale problems in science,
engineering, and economics.
Q9. The telephone numbers usually have 9 digits. Out of these 9, the first two
digits represent the area code and remain constant within a given area. The
last 7 digits represent the number, and it cannot begin with 0. How many
different telephone numbers are possible with a given area code?
The problem specifies that the first two digits of the phone number are the area
code, which remains constant, so we do not need to consider those two digits in
calculating the total number of possible phone numbers. The last 7 digits
represent the unique telephone number. The first digit of these 7 cannot be 0,
meaning we have 9 possible choices (1 to 9) for the first digit.
For each of the remaining 6 digits, we have 10 possible choices (0 to 9) since
these digits can be any number. To find the total number of possible phone
numbers, we multiply the number of choices for each digit:
❖ 9 choices for the first digit
❖ 10 choices for the second digit
❖ 10 choices for the third digit
❖ 10 choices for the fourth digit

Written By: Aman Ullah

Unit 2 Computational Thinking & Algorithms Short Questions

❖ 10 choices for the fifth digit

❖ 10 choices for the sixth digit
❖ 10 choices for the seventh digit
The total number of possible telephone numbers is:
9 × 10 × 10 × 10 × 10 × 10 × 10 = 9,000,000 different telephone numbers.
Q10. From city A to city B, there are 4 different roads, and from city B to
city C, there are 2 different roads. Draw a map of the given situation and
identify how many possible routes are there that someone can follow to reach
from city A to city C passing by city B.
In this problem, we have two cities, A and C, with city B in between. There are 4
different roads from city A to city B, and 2 different roads from city B to city C.
To calculate how many possible routes someone can take from city A to city C
passing by city B, we simply multiply the number of roads between the cities.
❖ There are 4 possible routes from A to B.
❖ There are 2 possible routes from B to C.
To find the total number of possible routes from A to C, we multiply the number
of options from A to B by the number of options from B to C:
4 roads (A to B) × 2 roads (B to C) = 8 possible routes.
Now, to represent this situation visually, draw a simple map:
❖ Draw city A on the left, city B in the middle, and city C on the right.
❖ From A to B, draw 4 lines representing the 4 roads.
❖ From B to C, draw 2 lines representing the 2 roads.

Written By: Aman Ullah