UCEST105 Algorithm Thinking with Python

Module 1 – Problem Solving

Reference for Part A Problem Solving:

Chapter 1: The World of Problem solving in KTU Textbook on

“Algorithm thinking with Python”. 2024 Scheme

Reference for Part B Python Programming:

Chapter 4,5 and 6: The World of Problem solving in KTU Textbook

on “Algorithm thinking with Python”. 2024 Scheme

Also for python programming of Module 1 refer the documents “Python

Basics Part 1”, “Python Operators” and “Python library math”

For steps in problem solving using trial and error method, algorithm
thinking, heuristics, mean end analysis and decomposition – Refer
Chapter 1 (World of Problem solving) in KTU Textbook on
“Algorithm thinking with Python”.

Dept. of AEI GEC Kozhikode

 Module 1 – Problem Solving Examples
1. How do you use a decomposition strategy to design a menu-driven calculator
that supports four basic arithmetic operators - addition, subtraction,
multiplication, and division?
2. Rearrange the letters in the words new door to create a one word
3. “A student wants to achieve a high score on an upcoming exam”. Explain how
means-end analysis can be employed for this.
4. Six glasses are in a row. The first three are full of water and next three are
empty. By moving only one glass, can you arrange them so that empty and full
glasses are alternate?
5. A mad scientist wishes to make a chain out of plutonium and lead pieces.
There is a problem, however. If the scientist places two pieces of plutonium
next to each other, BOOM! The question is, in how many ways can the
scientist safely construct a chain of length n?.
6. Name two current problems in your life that might be solved through a
heuristic approach. Explain why each of these problems can be solved using
heuristics.
7. Solve the Missionaries and Cannibals problem using the 6 steps of problem
solving.
8. Walk through the six problem-solving steps to find the largest number out of
three numbers.
9. Your professor has given you an assignment on “Algorithmic thinking” to be
submitted by this Wednesday. How do you employ means-end analysis to
devise a strategy for completing your assignment before the deadline?
10. Name two current problems in your life that might be solved through a trial
and error approach.

Dept. of AEI GEC Kozhikode

4 Phases of Problem Solving:
1. Understanding the Problem: Identify and define the problem clearly.
2. Generating Possible Solutions: Brainstorm various potential solutions.
3. Evaluating and Selecting the Best Solution: Assess each solution and
choose the one that works best.
4. Implementing the Solution: Apply the chosen solution and verify that it
resolves the problem.

6 Steps of problem solving:

1. Identify the Problem: Understand what needs to be solved.
2. Understand the Problem: Break down and analyze the problem.
3. Generate Possible Solutions: Think of different ways to approach it.
4. Evaluate the Possible Solutions and choose best solution: Consider the
pros and cons of each solution and Select the most effective solution.
5. Implement the Solution: Put the solution into action.
6. Evaluate the Results – Check if results are correct.

6 Steps in Problem Solving using Computer

1. Understand the Problem:
2. Formulate a model for the solution
3. Develop an algorithm
4. Code the algorithm
5. Test the program
6. Evaluate the solution

Dept. of AEI GEC Kozhikode

Example 1,

How do you use a decomposition strategy to design a menu-driven calculator that supports
four basic arithmetic operators - addition, subtraction, multiplication, and division?

Solution,

To design a menu-driven calculator using a decomposition strategy, we break down the

problem into smaller, manageable parts (or components). The goal is to identify the major
functions or operations required to perform the calculations and how they interact, and
then implement them systematically.

Step 1: Identify the Problem

 Problem: We need to create a menu-driven calculator that supports four basic

arithmetic operators: addition, subtraction, multiplication, and division.
 Inputs: Two numbers and an operator (addition, subtraction, multiplication, or
division).
 Output: The result of the operation performed on the two numbers.

Step 2: Decompose the Problem

Decompose the calculator design into smaller sub-problems or components that can be
developed independently. These components may include:

1. Input Handling:
o Get the user’s choice of operation.
o Collect the two numbers on which the operation will be performed.
2. Performing the Calculation:
o Create separate functions for each arithmetic operation (addition,
subtraction, multiplication, division).
3. Menu Display:
o Create a menu that displays the available operations (addition, subtraction,
multiplication, and division).
4. Error Handling:
o Handle errors such as invalid inputs, division by zero, etc.
5. Loop for Multiple Calculations:
o Allow the user to perform multiple calculations without restarting the
program.

Dept. of AEI GEC Kozhikode

Step 3: Break Down Each Component

Let’s break down each of these components in more detail:

1. Input Handling

 Display Menu: Show a list of available options (1. Addition, 2. Subtraction, etc.).
 Get User Input: Prompt the user to select an operation (e.g., choose 1 for addition).
 Get Numbers: Ask the user for two numbers.

2. Performing the Calculation

 Addition Function: Create a function add(a, b) that returns a + b.

 Subtraction Function: Create a function subtract(a, b) that returns a - b.
 Multiplication Function: Create a function multiply(a, b) that returns a * b.
 Division Function: Create a function divide(a, b) that returns a / b. Ensure to handle
division by zero.

3. Menu Display

 A simple text-based menu that displays:

1. Addition
2. Subtraction
3. Multiplication
4. Division
5. Exit

 Allow the user to choose an option by entering a number (e.g., 1 for addition).

4. Error Handling

 Invalid Input Handling: If the user enters a non-numeric input or an invalid menu
option, prompt them to enter a valid option.
 Division by Zero: Check for division by zero before performing division, and display
an error message if the user attempts to divide by zero.

5. Loop for Multiple Calculations

 Repeat: After performing an operation, ask the user if they want to perform another
calculation or exit.

Dept. of AEI GEC Kozhikode

Step 4: Define the Program Structure

With the components decomposed, we can structure the program flow logically:

 Display Menu to the user.

 Get User Choice of operation.
 Validate Input: If the input is valid, proceed to get the numbers; otherwise, show an
error message and ask for the input again.
 Perform the Operation based on the user’s choice.
 Display Result of the operation.
 Repeat the process or exit based on user choice.

Step 5: Write Program code and implement

Explain the code using flow chart or pseudo code and implement the code in the required
programming language.

Step 6: Test the Calculator

Once the components are implemented, test the calculator by performing various
operations:

 Addition: 5 + 3 = 8
 Subtraction: 10 - 4 = 6
 Multiplication: 6 * 7 = 42
 Division: 8 / 2 = 4 (test division by zero as well)

Dept. of AEI GEC Kozhikode

Example 2,

Rearrange the letters in the words new door to create a one word

Solution,

 Understanding the Problem: We need to rearrange the letters in "new door" to

form a valid word.
 Generating Possible Solutions: We brainstorm combinations of the letters (like
"wonder," "owner," etc.).
 Evaluating and Selecting the Best Solution: "Wonder" uses all the letters and is a
valid word, making it the best solution.
 Implementing the Solution: We conclude that "wonder" is the answer.

1. Understanding the Problem

 What is the problem?

o The problem is to rearrange the letters in the phrase "new door" to create a
valid, meaningful word.
 What do we know?
o We have the letters n, e, w, d, o, o, r available.
o We need to use all these letters and form a single word.
 What is the goal?
o The goal is to find one meaningful word formed from these letters.

2. Generating Possible Solutions

 How do we generate solutions?

o We start by rearranging the letters in different ways, either randomly or
systematically. At this point, we’re brainstorming different combinations and
trying to find a valid word.
o Possible words might include:
 "wonder" (which uses all the letters and is a valid word).
 "owner," "worn," and others, but those don't use all of the letters or
aren't valid words.
 Solution exploration:
o After trying several combinations, "wonder" stands out as a valid word.

3. Evaluating and Selecting the Best Solution

 How do we evaluate the solutions?

o The solution must meet two criteria:
1. Use all of the letters from the original phrase "new door."
2. Be a valid, meaningful word.
 Which solution works best?

Dept. of AEI GEC Kozhikode

 o"Wonder" is the best choice because it:
 Uses all the letters (n, e, w, d, o, o, r).
 Is a valid, meaningful word.
 Other combinations like "worn" or "owner" don't use all the letters or aren't as
suitable as "wonder."

4. Implementing the Solution

 How do we apply the solution?

o The solution is to recognize that "wonder" is the correct word formed by
rearranging the letters.

Dept. of AEI GEC Kozhikode

Example 3,

“A student wants to achieve a high score on an upcoming exam”. Explain how means-end
analysis can be employed for this.

Solution,

Means-end analysis is a problem-solving strategy that involves breaking down a goal into
smaller, more manageable subgoals and determining the steps or "means" needed to
achieve each subgoal. This process is typically used in decision-making and problem-solving
to navigate the gap between the current state and the desired outcome.

For a student wanting to achieve a high score on an upcoming exam, means-end analysis
could be employed as follows:

1. Identify the Goal:

The main goal is to achieve a high score on the exam. To make this goal more
specific, the student can break it down further (e.g., achieving a score above 90%).
2. Analyze the Current Situation:
The student evaluates their current knowledge, skills, and preparation. For example,
they may assess how much they know about the subject, how well they understand
key concepts, and what areas they need to improve.
3. Determine the Necessary Subgoals:
Based on the analysis of their current situation, the student sets intermediate goals
or subgoals. These could include:
o Reviewing lecture notes and textbooks
o Practicing with past exam papers
o Clarifying any doubts with the teacher or a tutor
o Developing a study schedule or routine
o Strengthening weak areas of knowledge
4. Identify Means (Steps) to Achieve Each Subgoal:
The student decides on specific actions to take in order to achieve each subgoal. For
example:
o To review lecture notes, the student might plan to allocate 2 hours per day
for each subject, focusing on key topics.
o To practice with past exams, the student might schedule a mock exam every
weekend.
o To clarify doubts, the student might attend office hours or join a study group.
5. Evaluate Progress and Adjust:
As the student works through each subgoal, they periodically assess their progress. If
any subgoal is not being met (e.g., if the student is struggling with a particular topic),
they adjust their approach—such as spending more time on the difficult topic or
seeking additional resources.

Dept. of AEI GEC Kozhikode

 6. Finalize the Preparation:
As the exam approaches, the student may adjust the means of studying to focus on
exam-specific strategies, such as improving time management during the exam,
taking care of physical and mental well-being, or practicing stress-reduction
techniques.

Dept. of AEI GEC Kozhikode

Example 4,

Six glasses are in a row. The first three are full of water and next three are empty. By moving
only one glass, can you arrange them so that empty and full glasses are alternate?

Solution,

To solve this puzzle, we need to rearrange six glasses, where the first three are full of water
and the next three are empty. The goal is to move only one glass so that the glasses
alternate between full and empty. The initial arrangement is:

Full (F), Full (F), Full (F), Empty (E), Empty (E), Empty (E)

Step 1: Identify the Problem

We are given six glasses in a row, three full and three empty. Our task is to rearrange them
so that the glasses alternate between full and empty by moving only one glass.

Step 2: Understand the Problem

We need to create an alternating pattern of full and empty glasses. The goal is to end up
with this pattern:

Full (F), Empty (E), Full (F), Empty (E), Full (F), Empty (E)

Step 3: Generate Possible Solutions

To get this alternating pattern with only one move, let's think about the positions:

 We have six glasses. The first three are full (F), and the last three are empty (E):
o FFFEEE
 We can move one glass, but the trick is figuring out which glass to move and where.

Step 4: Evaluate and Select the Best Solution

The simplest and most effective way to achieve the alternating pattern with one move is to
move content of one of the full glasses (F) into one of the empty spots (E) where it will
create the correct alternating pattern.

The Move:

 Move the third full glass (F) to the fifth position, which is currently empty (E).

Now the glasses are arranged like this:

 F, E, F, E, F, E

This satisfies the alternating pattern of full and empty glasses.

Dept. of AEI GEC Kozhikode

Step 5: Implement the Solution

By moving only the contents of second full glass (F) into the fifth position, we achieve the
desired alternating pattern with only one move.

Step 6: Verify the Solution

After making the move, the glasses are now arranged as:

 F, E, F, E, F, E

Dept. of AEI GEC Kozhikode

Example 5,

A mad scientist wishes to make a chain out of plutonium and lead pieces. There is a
problem, however. If the scientist places two pieces of plutonium next to each other,
BOOM! The question is, in how many ways can the scientist safely construct a chain of
length n?.

Solution,

To solve this problem, we need to figure out how many different ways the scientist can
construct a chain of length n using two types of pieces: plutonium (denoted by P) and lead
(denoted by L), with the condition that two pieces of plutonium cannot be adjacent to each
other. In other words, no two P pieces can be placed next to each other.

Step 1: Understand the problem

We need to determine how many valid arrangements of P (plutonium) and L (lead) pieces
can be made in a chain of length n, where no two P pieces are adjacent. This can be thought
of as a problem of counting valid binary strings of length n, where:

 P represents a "1" (plutonium).

 L represents a "0" (lead).
 The rule is that no two 1's (plutonium pieces) are next to each other.

Step 2: Define sub problems

We can define a recursive relation for the number of valid chains of length n. Let f(n)
represent the number of valid chains of length n.

 If the last piece in the chain is L, then the remaining part of the chain is a valid chain
of length n−1. So, there are f(n−1) ways to extend the chain.
 If the last piece in the chain is P, then the second-to-last piece must be L (because
two P pieces cannot be adjacent). This means that the rest of the chain (up to length
n−2) must also be a valid chain of length n−2. So, there are f(n−2) ways to extend the
chain.

Thus, the recursive relation is:

f(n)=f(n−1)+f(n−2)

This relation is similar to the Fibonacci sequence, but with different base cases.

Step 3: Base cases

 f(0)=1: There's exactly one way to arrange a chain of length 0 — the empty chain.
 f(1)=2: There are two valid chains of length 1: either L or P.

Dept. of AEI GEC Kozhikode

Step 4: Calculate the result

Using the recursive relation and base cases, we can compute f(n) for any n.

For example, if n=3:

f(3)=f(2)+f(1)

From the base cases, we know that:

f(2)=3(the valid chains are: **LL**, **LP**, **PL**)

f(1)=2(the valid chains are: **L**, **P**)

So:

f(3)=3+2=5

The valid chains of length 3 are: LLL, LLP, LPL, PLP, PLL.

Step 5: Generalize for any n

The number of valid chains of length n follows the Fibonacci-like sequence:

f(n)=f(n−1)+f(n−2)

With the base cases:

 f(0)=1
 f(1)=2

This recurrence can be computed iteratively or recursively for any n.

Final Answer:

The number of ways the scientist can safely construct a chain of length n is given by
f(n)f(n)f(n), where f(n)f(n)f(n) follows the recurrence relation f(n)=f(n−1)+f(n−2) with initial
conditions f(0)=1 and f(1)=2. This sequence grows similarly to the Fibonacci sequence, but
with different starting values.

Dept. of AEI GEC Kozhikode

Example 6,

Name two current problems in your life that might be solved through a heuristic approach.
Explain why each of these problems can be solved using heuristics.

Solution,

1. Time Management (Prioritizing Tasks)

Problem:
You have a long to-do list with various tasks, deadlines, and responsibilities. It feels
overwhelming, and you're unsure where to start.

Why Heuristics Can Solve This:

Time management is a classic example of a problem where heuristics can be extremely
useful. A common heuristic used here is the "80/20 rule" (Pareto principle), which suggests
that 20% of your tasks will contribute to 80% of your results. This heuristic helps you quickly
identify the tasks that will have the greatest impact.

Another heuristic is the Eisenhower Matrix, where tasks are categorized into:

 Urgent and important (do first),

 Important but not urgent (schedule),
 Urgent but not important (delegate),
 Neither urgent nor important (eliminate or minimize).

By using these simple rules of thumb, you can quickly prioritize tasks without needing to
spend excessive time analyzing each one in-depth.

2. Finding a New Apartment or House to Rent

Problem:
You’re searching for a new place to live, and you have a list of criteria (location, price,
amenities, etc.). There are too many options, and you don’t have time to visit them all or
carefully consider every detail.

Why Heuristics Can Solve This:

Finding a new apartment is a complex problem with many variables. A heuristic approach
could involve filtering properties based on a few key priorities (e.g., price range, location,
and minimum square footage). Instead of evaluating every property in exhaustive detail,
you apply rules of thumb to narrow down the options quickly. For example, you might
decide that the location is more important than amenities, or that a lower price is more
important than having an extra bedroom.

Dept. of AEI GEC Kozhikode

A common heuristic might be:

 "Rule of Thumb for Rent-to-Income Ratio": Only consider places where the rent is
no more than 30% of your monthly income. This helps you filter out unaffordable
options quickly.

Another heuristic could involve eliminating options based on obvious dealbreakers (e.g., no
pets allowed, noisy neighborhood, etc.), leaving you with a manageable number of potential
places to evaluate in more detail.

Dept. of AEI GEC Kozhikode

Example 7,

Solve the Missionaries and Cannibals problem using the 6 steps of problem solving.

Solution,

1. Identify the Problem

 Problem Statement: You have three missionaries (M) and three cannibals (C) on one
side of a river. They need to cross to the other side using a boat that can carry only
two people at a time.
 Constraint: At no point on either side of the river can the number of cannibals
outnumber the missionaries. If they do, the cannibals will eat the missionaries.
 Goal: Move all three missionaries and three cannibals safely to the other side of the
river.

2. Analyze the Problem

 Current State: All 3 missionaries and 3 cannibals are on the left side of the river, and
the boat is on the left side.
 Goal State: All 3 missionaries and 3 cannibals must be on the right side of the river,
and the boat must be on the right side.
 Constraints:
o The boat can only carry 2 people at a time.
o Cannibals cannot outnumber missionaries on either side of the river at any
time.

3. Generate Possible Solutions

We will list the possible moves that adhere to the constraints:

 Two missionaries cross.

 Two cannibals cross.
 One missionary and one cannibal cross.
 One missionary crosses.
 One cannibal crosses.

Since we must ensure the safety of the missionaries, we’ll avoid any move where cannibals
would outnumber missionaries on either side of the river.

Dept. of AEI GEC Kozhikode

4. Evaluate and Select the Best Solution

After analyzing the problem and possible moves, we will start solving the problem step by
step by using safe moves. The approach we’ll take is to make moves that maximize the
number of missionaries and cannibals safely transferred without violating the constraints.

5. Implement the Solution

Here’s a simple step-by-step solution using safe moves:

 Initial state: (3, 3, left) — 3 missionaries, 3 cannibals, boat on the left side.
 Step 1: Move 2 cannibals to the right side.
o New state: (3, 1, right)
 Step 2: One cannibal returns to the left side.
o New state: (3, 2, left)
 Step 3: Move 2 cannibals to the right side again.
o New state: (3, 0, right)
 Step 4: One cannibal returns to the left side.
o New state: (3, 1, left)
 Step 5: Move 2 missionaries to the right side.
o New state: (1, 1, right)
 Step 6: One cannibal and one missionary return to the left side.
o New state: (2, 2, left)
 Step 7: Move 2 missionaries to the right side again.
o New state: (0, 2, right)
 Step 8: One cannibal returns to the left side.
o New state: (1, 1, left)
 Step 9: Move 2 cannibals to the right side.
o Final state: (0, 0, right) — All missionaries and cannibals are safely on the
right side!

6. Review and Evaluate the Outcome

 Final State: The goal state has been reached: (0, 0, right) — All 3 missionaries and 3
cannibals are safely on the right side of the river.
 Solution Verification: At no point were cannibals outnumbering the missionaries on
either side of the river. Every move was checked to ensure safety.

Dept. of AEI GEC Kozhikode

Example 8,

Walk through the six problem-solving steps to find the largest number out of three
numbers.

Solution,

1. Identify the Problem

We need to determine which of the three given numbers is the largest.

2. Gather Information

Let's say the three numbers are: 12, 5, and 20. We need to analyze these numbers to find
the largest one.

3. Generate Alternatives

Consider different approaches to find the largest number:

 Compare each number sequentially.

 Use a mathematical formula (e.g., using max functions in programming).
 Sort the numbers and pick the last one (if sorted in ascending order).

4. Evaluate Alternatives

Assess the approaches:

 Sequential comparison: Simple and clear but requires multiple comparisons.

 Mathematical formula: Efficient if using programming but requires familiarity with
the syntax.
 Sorting: More complex and unnecessary for just three numbers; overkill for this
situation.

5. Choose a Solution

The most straightforward approach is to compare the numbers sequentially. We will

compare the first number with the second, then compare the larger of those two with the
third.

6. Implement the Solution

1. Start with the first two numbers (12 and 5).

o Compare: 12 > 5, so the larger is 12.
2. Now compare 12 with the third number (20).
o Compare: 20 > 12, so the larger is 20.

Thus, the largest number among 12, 5, and 20 is 20.

Dept. of AEI GEC Kozhikode

Example 9,

Your professor has given you an assignment on “Algorithmic thinking” to be submitted by

this Wednesday. How do you employ means-end analysis to devise a strategy for
completing your assignment before the deadline?

Solution,

To employ means-end analysis for completing your assignment on "Algorithmic thinking"

before the Wednesday deadline, we can follow these steps:

1. Identify the Goal

Goal: Successfully complete and submit the assignment by Wednesday.

2. Break Down the Goal

Identify the key components needed to achieve the goal:

 Understand the assignment requirements.

 Conduct research on algorithmic thinking.
 Outline the assignment structure.
 Write the assignment.
 Revise and proofread the final draft.
 Submit the assignment.

3. Identify Current State

Assess your current situation:

 Understanding: Are you familiar with algorithmic thinking? Do you need to

research?
 Resources: Do you have access to necessary materials (books, articles, internet)?
 Time: How much time do you have before the deadline?

4. Identify the Means (Steps to Reach the Goal)

For each component, outline specific actions to bridge the gap between your current state
and the goal:

1. Understand the Requirements:

o Read the assignment prompt carefully.
o Note any specific formatting or content guidelines.
2. Conduct Research:
o Use online resources, textbooks, or academic articles to gather information
on algorithmic thinking.
o Take notes on key concepts and examples.

Dept. of AEI GEC Kozhikode

 3. Outline the Assignment:
o Create a structured outline that includes an introduction, main points, and
conclusion.
o Decide how to present your ideas logically.
4. Write the Assignment:
o Allocate time each day leading up to Wednesday for writing (e.g., write the
introduction and first section on Monday, continue on Tuesday, etc.).
o Focus on completing sections rather than perfection to maintain momentum.
5. Revise and Proofread:
o After finishing the first draft, take a break before revising.
o Check for clarity, coherence, and adherence to assignment guidelines.
6. Submit the Assignment:
o Ensure you know how and where to submit (online platform, email, etc.).
o Double-check that everything is complete before submission.

5. Create a Timeline

Develop a timeline based on your outlined steps:

 Monday: Understand requirements and conduct initial research.

 Tuesday: Complete research, finalize the outline, and begin writing.
 Wednesday (morning): Finish writing, revise, and proofread.
 Wednesday (afternoon): Submit the assignment.

6. Monitor Progress

As you work through each step, keep track of your progress:

 Adjust your timeline if you find certain sections take longer than expected.
 Stay focused and avoid distractions to maximize productivity.

By systematically breaking down the assignment using means-end analysis, you can
effectively strategize and ensure that you complete the task before the deadline.

Dept. of AEI GEC Kozhikode

Example 10,

Name two current problems in your life that might be solved through a trial and error
approach.

Solution,

1. Fixing a Slow Internet Connection

Problem: My internet connection is slow, and I'm not sure why it's happening.

Steps Using Trial and Error:

1. Initial Attempt:
Solution 1: Restart the router.
o Action: Turn off the router for 30 seconds, then turn it back on.
o Result: Internet speed is still slow.
o Learning: This solution didn’t work.
2. Second Attempt:
Solution 2: Move the router to a different location in the room (closer to the area
where I use the internet the most).
o Action: Position the router in a more central location and away from
obstructions.
o Result: The connection improves slightly but is still slower than expected.
o Learning: Proximity to the router does help, but there’s still a problem.
3. Third Attempt:
Solution 3: Disconnect other devices from the network to reduce congestion.
o Action: Unplug other devices using the Wi-Fi, like phones or smart TVs.
o Result: The speed improves, but it’s still not as fast as it should be.
o Learning: Reducing devices on the network makes a difference, but the root
cause is likely elsewhere.
4. Fourth Attempt:
Solution 4: Change the Wi-Fi channel or frequency band (from 2.4 GHz to 5 GHz).
o Action: Access the router settings and switch the channel/frequency.
o Result: The internet speed drastically improves, and I experience better
performance.
o Learning: Changing the channel to avoid interference solved the issue.

Dept. of AEI GEC Kozhikode

2. Mobile Phone not working

If your mobile phone isn't turning on, the trial and error method can be an effective way to
diagnose and solve the issue.

Steps Using Trial and Error:

1. Check for Battery Charge

 Solution 1: Plug the phone into the charger and wait for a few minutes (at least 10–
15 minutes) to see if the battery was completely drained.
o Action: Connect the phone to a known working charger and leave it plugged
in for a while.
o Result: The screen shows a charging symbol after a few minutes, and the
phone powers on.
o Learning: If the phone turns on, the problem was simply a dead battery. Keep
in mind that if the battery was completely drained, it may take a few minutes
before any signs of life appear.

If the phone doesn't show any signs of charging or powering up after waiting for a
while, proceed to the next step.

2. Inspect the Power Button

 Solution 3: Check if the power button is stuck or unresponsive.

o Action: Gently press the power button and see if it feels physically stuck or
doesn’t click as usual. Sometimes dirt or debris can obstruct the button.
o Result: If the button feels stuck, clean the area around it using compressed
air or a soft brush. Try pressing it again.
o Learning: A stuck or damaged power button can prevent the phone from
turning on. Cleaning or repairing it might resolve the issue.

If the power button seems fine and the phone still won’t turn on, move to the next
step.

4. Check the Charger and Charging Port

 Solution 4: Test a different charger and charging cable.

o Action: Use a different charger and cable to rule out a faulty charger or cable.
Ensure the charging port is clean and not obstructed by dirt or lint.
o Result: The phone turns on when connected to a different charger.
o Learning: A faulty charger or cable might be preventing the phone from
charging, which means it couldn’t turn on because the battery had no charge.

If the phone still doesn’t respond, move on to the next step.

Dept. of AEI GEC Kozhikode

5. Check for Screen/Display Issues

 Solution 5: Determine if the phone is actually on but the screen isn’t working.
o Action: Listen for any sounds (e.g., notification alerts, vibrations) that would
indicate the phone is on but the screen is not displaying anything. Try
adjusting the screen brightness or tapping on the screen to see if the display
is just dim or frozen.
o Result: You may notice the phone is on but the display is blank or frozen,
indicating an issue with the screen or display components.

If you don’t hear any sounds and the screen is still black, proceed to the next step.

6. Perform a Soft or Factory Reset (Last Resort)

 Solution 6: Attempt a factory reset via recovery mode (for Android) or DFU (Device
Firmware Update) mode (for iPhones).
o Action:
 For Android: Boot into recovery mode (usually by holding Power +
Volume Up/Down together when the phone is off) and choose Wipe
Cache Partition or Factory Reset (this will erase all data, so only do
this if necessary).
 For iPhones: Connect the iPhone to a computer with iTunes (or Finder
on macOS) and attempt to restore or update the device through
recovery or DFU mode.
o Result: If successful, the phone will start up after the reset.
o Learning: A software corruption issue could be preventing the phone from
booting. A factory reset may clear this, but it will erase all data on the device.
Use this as a last resort.

If the phone still doesn’t turn on, it might indicate a hardware failure that requires
professional repair.

Outcome:

Through trial and error, you’ll likely identify whether the issue is related to:

 Battery charge
 Frozen system requiring a reset
 A faulty power button or charger
 Screen/display issues
 Software corruption needing a factory reset

If none of the steps resolve the issue, the problem may be deeper, such as a hardware
failure (e.g., motherboard or internal component damage), which may require professional
repair or replacement.

Dept. of AEI GEC Kozhikode