General Problem-Solving

Concepts in ICT
Presented by Group # 7

Lead by: Ahmad Nawaz

Hafiza Maham Waheed

Muhammad Asif , Abdullah

Shafqat Pervaiz , Abeer Ahmad

Slide …
Overview of Python:
Programming language created by Guido van Russom in 1991. He created
it to improve on the ABC language, making programming easier and more
efficient.

What is Python? Why Use Python? Applications

Programming language for • Easy to learn • Websites and web apps
talking to computers. • Versatile for many • Data analysis and
applications visualization
• Rich libraries and • Game Development
frameworks • AI and robotics
• Portability
• Task automation

Slide 1
Defining the Problem
Task requiring Identify inputs and
logical solution outputs

Clarify problem statement

Slide 2
Steps to Solve a Problem

1 Understand the problem

2 Break it into smaller parts

3 Plan the solution

4 Write the code

5 Testing and debugging

6 Optimization (if necessary)

Slide 3
Break it into smaller steps
• Divide into smaller subproblems
• Outline steps for each part

Planning the solution

Choose a strategy Visualize the logic
Brute force, divide and conquer, greedy Use pseudocode or flowcharts
algorithms

Slide 4
Implementation and Testing
Write clean, modular Test with various cases Debug and fix issues
code
Run your program with Identify and resolve logic or
Translate algorithm into various inputs to verify its code problems
programming language correctness

Slide 5
Optimization Techniques

Improve Time Complexity Reduce Memory Usage Refactor Code

Enhance algorithm efficiency Optimize data structures and Streamline and improve code
storage structure

Slide 6
Problem-Solving Strategies

Strategy Key Idea Efficiency Use Case

Brute Force Try all Inefficient for Small input

solutions large problems problems

Divide and Divide into Efficient for Sorting,

Conquer subproblems large problems searching,
complex
problems

Greedy Best Efficient but Optimization

Algorithm decision at not always problems
each step optimal

Slide 7
Common Pitfalls to Avoid

1 Overcomplicating the solution

2 Neglecting unusual scenarios

3 Skipping design/planning steps

4 Underestimating problem complexity

Awareness of these pitfalls enhances problem-solving skills leads to more robust solutions.

Slide 8
Types of Errors
In Python programming, you might face different types of
problems while writing code.

These problems can range from simple mistakes (like typos)

to more complex issues (like incorrect logic).

Slide 9
Syntax Errors: The
Grammar of Code
Rule-Breaking Punctuation
Mistakes Matters
Syntax errors occur Forgetting a colon or
when code doesn't parenthesis can cause
follow Python's rules. a SyntaxError.

Easy Fixes
Double-check your code for
correct syntax and indentation.

Slide 10
Runtime Errors: When
Code Misbehaves
1 During Execution
Runtime errors occur while the program is running.

2 Impossible Operations
Dividing by zero is a common example of a runtime
error.

3 Prevention
Ensure operations are valid before executing them.

Slide 11
Logic Errors: Silent but
Deadly
Sneaky Mistakes
Code runs without crashing but produces incorrect
results.

Misunderstood Instructions
Like following a recipe incorrectly, leading to
unexpected outcomes.

Careful Review
Double-check algorithms and logic to ensure correct
problem-solving.

Slide 12
Memory Management: Balancing Resources

Resource Allocation Performance Impact Optimization

Memory issues occur when Excessive memory use can slow Limit memory usage and release
programs use too much memory. down or crash programs. unused resources.

Slide 13
Type Errors: Mixing Incompatible Data
Data Type Mismatch Common Example Prevention
Occurs when operations are Attempting to add a string Ensure data types are
performed on incompatible and a number. compatible or use type
data types. conversion.

Slide 14
Version Compatibility:
Bridging the Gap
1 Python 2.x
Older version with different syntax and features.

2 Python 3.x
Current version with improved functionality and
syntax.

3 Version Checks
Always verify Python version compatibility for your
code.

Slide 15
Problem Solving in
Sequential Structure
Sequential programming involves executing instructions step-
by-step in a strict order, with each line running linearly
without skipping or repeating steps unless specified.

It’s foundational for simple tasks without conditionals or loops.

Slide 16
Understanding Sequential Structure
Definition Characteristics Ideal Use
A programming approach Steps occur in a set order, Perfect for tasks where each
where code statements with each line running once step logically follows the
execute one after another, as written. previous, without decisions
from top to bottom. or loops.

Slide 17
Basic Examples of Sequential Structure
Printing Statements Adding Two Numbers

Three print() functions run one after another, Variables are initialized, numbers are added, and
following instructions step by step. the result is displayed in sequence.

Slide 18
Problem-Solving Steps with Sequential Structure
1 Understand the Problem
Break down the problem into a series of smaller, linear steps.

2 Plan Each Step

Write out each action that needs to be done in the correct order.

3 Write Code Sequentially

Implement each step as a separate line of code, ordered as planned.

4 Test the Code

Run the code to ensure each step executes correctly and produces expected output.

Slide 19
Example: Calculate Rectangle Area

Get Width Get Height Calculate Area Display Result

Input the width of the Input the height of the Multiply width and Show the calculated
rectangle. rectangle. height to get the area. area to the user.

Slide 20
Applications of Sequential Structure

Data Processing Pipelines Simple Calculations Basic File Operations

Load, process, and save data in a Perform fixed-step calculations Open, read/write, and close files
defined sequence. like area or price computations. in a specific order.

Slide 21
Advantages and Limitations
Advantages Limitations

• Easy to understand and follow • Lacks flexibility for complex problems

• Efficient for simple, straightforward tasks • Not suitable for tasks requiring decisions or
• Ideal for beginners learning programming repetition
basics • Limited interactivity and user input handling

Slide 22
 Moving Beyond Sequential Structure
Sequential Structure
1 Foundation of programming logic

Decision Structures
2
Introduce if-else for choices

Loops
3
Add for and while for repetition

Functions
4
Organize code into reusable blocks

Mastering sequential structure prepares you to explore advanced programming paradigms, expanding your problem-solving skills.

Slide 23
Discussion and Practice
of Pseudocode
Pseudocode is a high-level representation of an algorithm that
uses plain language to describe the logic of a program.

It acts as a bridge between human understanding and actual

coding.

Slide 24
What is Pseudocode?
Definition Purpose
A high-level description of an algorithm using To plan logic before coding and ensure clarity of
plain language or structured format. the solution.

Slide 25
Characteristics of Good
Pseudocode
Clarity and Language
Conciseness Independence
Easy to read and Not tied to any specific
understand, including programming language
only relevant steps. syntax.

Logical Flow
Uses structured constructs like loops, conditions, and
functions.

Slide 26
Benefits of Using Pseudocode

1 Improves Problem-Solving

2 Simplifies Collaboration

3 Minimizes Errors

Pseudocode focuses on logic over syntax, improving team understanding and reducing pre-coding bugs.

Slide 27
From Pseudocode to Code: The Journey
Write Pseudocode
1
Plan your algorithm using plain language.

Review and Refine

2
Optimize the logic and structure of your pseudocode.

Translate to Code
3
Convert pseudocode into your chosen programming language.

Test and Debug

4
Verify the code works as intended and fix any issues.

Slide 28
Discussion and
Generating Flowcharts
Flowcharts are visual diagrams that represent the steps of a
process or algorithm using symbols. They help in planning,
understanding, and communicating solutions effectively.

Slide 29
What is a Flowchart?
Visual Problem-Solving
Representation Tool
Flowcharts use symbols They help break down
to diagram steps in a complex problems into
process or algorithm. manageable steps.

Communication Aid
Flowcharts facilitate clear and concise explanation of
solutions.

Slide 30
Common Flowchart Symbols

Oval Rectangle
Represents the start or end of a
Indicates a process or action step.
process.

Diamond Arrow
Signifies a decision point with Shows the flow or direction of the
yes/no or true/false outcomes. process.

Parallelogram

Used for input or output operations

Slide 31
Steps to Generate a Flowchart Start

1 Define the Problem

Clearly identify the process you want to map out.

Input/Output
2 Break Down the Process
List all steps in a logical order.

3 Map Steps to Symbols

Use appropriate symbols for each step in the process.
Decision

4 Draw the Flowchart

Connect symbols with arrows to show the process flow.

5 Test and Refine

End
Walk through the flowchart to ensure accuracy and clarity.

Slide 32
Example: Calculate the sum of 2 numbers
Start
Begin the process.

Input first number

Prompts the user to enter first number.

Input second number

Prompts the user to enter second number.

Add the two numbers

Calculates the sum of two the numbers.

Display the result

Outputs the calculated sum to the user.

End
End of process.

Slide 33
Tools for Creating Flowcharts

Manual Tools Digital Tools

• Pen and paper • Draw.io
• Whiteboard • Microsoft PowerPoint

Slide 34
Key Takeaways
Simplify Complex Processes
Flowcharts break down complex logic into easy-to-
understand visuals.

Identify Errors Early

Visualizing processes helps spot logical issues before
implementation.

Practice Regularly
Create flowcharts for various problems to improve your
skills.

Slide 35