Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Problem Solving and Python Programming, Study notes of Computer Science

Problem-solving is the process of identifying a problem, creating an algorithm to solve the given problem, and finally implementing the algorithm to develop a computer program. An algorithm is a process or set of rules to be followed while performing calculations or other problem-solving operations.

Typology: Study notes

2021/2022

Available from 09/28/2022

aswathy-s-nair
aswathy-s-nair 🇮🇳

5 documents

Partial preview of the text

Download Problem Solving and Python Programming and more Study notes Computer Science in PDF only on Docsity!

Chapter: Problem Solving and Python Programming : Algorithmic

Problem Solving

Problem Solving Techniques

PROBLEM SOLVING

Problem solving is the systematic approach to define the problem and creating number of solutions. The problem solving process starts with the problem specifications and ends with a Correct program.

PROBLEM SOLVING TECHNIQUES

Problem solving technique is a set of techniques that helps in providing logic for solving a problem. Problem Solving Techniques: Problem solving can be expressed in the form of

  1. Algorithms.
  2. Flowcharts.
  3. Pseudo codes.
  4. programs

ALGORITHM

It is defined as a sequence of instructions that describe a method for solving a problem. In other words it is a step by step procedure for solving a problem. Properties of Algorithms  Should be written in simple English  Each and every instruction should be precise and unambiguous.  Instructions in an algorithm should not be repeated infinitely.  Algorithm should conclude after a finite number of steps.  Should have an end point  Derived results should be obtained only after the algorithm terminates. Qualities of a good algorithm The following are the primary factors that are often used to judge the quality of the algorithms. Time – To execute a program, the computer system takes some amount of time. The lesser is the time required, the better is the algorithm. Memory – To execute a program, computer system takes some amount of memory space. The lesser is the memory required, the better is the algorithm. Accuracy – Multiple algorithms may provide suitable or correct solutions to a given problem, some of these may provide more accurate results than others, and such algorithms may be suitable. Example Write an algorithm to print „Good Morning” Step 1: Start Step 2: Print “Good Morning” Step 3: Stop