Unit 1(1).pptx Program Logic Development
Download as PPTX, PDF0 likes209 views
The document details the fundamentals of algorithm development, outlining key characteristics such as input and output specifications, definiteness, and effectiveness. It provides examples of algorithms for simple operations like making tea, addition, and finding the area of a circle, along with the advantages and disadvantages of using flowcharts for representing algorithms. Additionally, it includes suggested homework exercises for writing algorithms on various mathematical operations.
Unit 1(1).pptx Program Logic Development
- 1. Unit No-1 Program Logic Development
- 4. DIFFERENCE HIGH AND LOW
- 5. • A set of rules that must be followed when solving a particular problem. • An algorithm is a procedure or formula for solving a problem, based on conducting a sequence of specified actions. • The word Algorithm means “a process or set of rules to be followed in calculations or other problem-solving operations” Algorithm
- 6. Characteristics of Algorithm :- 1)Input specified An algorithm should have 0 or more well-defined inputs.Input precision requires that you know what kind of data, how much and what form the data should be. 2)Output specified An algorithm should have 1 or more well-defined outputs, and should match the desired output.Output precision also requires that you know what kind of data, how much and what form the output should be. 3)Definiteness Algorithms must specify every step and the order the steps must be taken in the process.Definiteness means specifying the sequence of operations for turning input into output. Algorithm should be clear and unambiguousYou could not expect a computer to understand something if you yourself are ambiguous about it. 4)Effectiveness For an algorithm to be effective, it means that all those steps that are required to get to output must be feasible with the available resources.It should not contain any unnecessary and redundant steps which could make an algorithm ineffective.
- 7. Basic Convenctions for writing Alogorithms 1.Algorithm Name Each algorith must have name so programer comes to know that what algorithm is for. 2.Comments. The Contains folled by is known as comments. 3.Input and Output Proper input should be given to algorith so expected output is taken. 4.Steps Numbers should be provided each rule or step.
- 8. Algorithm for Making Tea Algorithm Name-Making Tea Input- Water,Tea Leaves,Sugar,Gas,Stove,Utensil,Milk,cup. Output- Tea Step 1- Start Step 2- Light Stove. Step 3- Boil Water in utensil,put tea leaves and sugar in it. Step 4- After Boiling it properly put milk in it. Step 5- After boiling it properly serve it in Cup. Step 6- Stop
- 9. Algorithm for Addition. Algorithm Name-Addition of two Numbers. Input- Two Numbers Output- Addition of two Numbers. Step 1- Start Step 2- Declare variable NUM1,NUM2,ADD. Step 3- Read values of NUM1 and NUM 2. Step 4- Do addition of numbers and store it in third variable i.e.ADD. ADD=NUM1+NUM2. Step 5- Display ADD. Step 6- Stop
- 10. Algorithm for Multiplication Algorithm Name-Multiplication of two Numbers. Input- Two Numbers Output- Multiplication of two Numbers. Step 1- Start Step 2- Declare variable NUM1,NUM2,MUL. Step 3- Read values of NUM1 and NUM 2. Step 4- Do multiplication of numbers and store it in third variable i.e.MUL. MUL=NUM1 * NUM2. Step 5- Display MUL. Step 6- Stop
- 11. Algorithm for Arithmetic Operations Algorithm Name-Arithmetic Operations Input- Two Numbers Output- Addition,Substraction,Division,Multiplication of two Numbers. Step 1- Start Step 2- Declare variable NUM1,NUM2,ADD,SUB,DIV,MUL. Step 3- Read values of NUM1 and NUM 2. Step 4- Do addition of numbers and store it in third variable i.e.ADD. ADD=NUM1+NUM2. Step 5- Display ADD. Step 6-Do Substraction of numbers and store it in third variable i.e.SUB. SUB=NUM1 - NUM2. Step 7- Display SUB. Step 8-Do Division of numbers and store it in third variable i.e.DIV. ADD=NUM1 / NUM2. Step 9- Display DIV. Step 10- Do multiplication of numbers and store it in third variable i.e.MUL. MUL=NUM1 * NUM2. Step 11- Display MUL. Step 12- Stop
- 12. Examples for Home Work • Write a algorithm for Finding Square of given Number. • Write a algorithm for Finding Cube of given Number.
- 13. Algorithm for Area of Circle Algorithm Name-Finding Area of Circle. Input- Radius,AOC. Output- Area of Circle. Step 1- Start Step 2- Declare variable RADIUS,AOC Step 3- Read values of RADIUS. Step 4- Calculate area of circle by using formulae AOC=3.14 * Radius * Radius Step 5- Display AOC. Step 6- Stop
- 14. Examples for Home Work • Write a algorithm for Finding Area of Triangle • Write a algorithm for Finding Area of Cylinder.
- 15. Algorithm for finding greatest number from given 2 numbers Algorithm Name-Finding Greatest number. Input- NUM1 , NUM2. Output- Display Greatest Number. Step 1- Start Step 2- Declare variable NUM1 ,NUM2 Step 3- Read values of NUM1 ,NUM2 Step 4- if NUM1 > NUM2 Display NUM1 is greater. else, Display NUM2 is greater. Step 5- Stop
- 16. Examples for Home Work • Write a algorithm to check whether number is even or odd. • Write a algorithm to check whether number is divisible by 5 or not.
- 18. Flowchart A flowchart is simply a graphical representation of steps. It shows steps in sequential order and is widely used in presenting the flow of algorithms, workflow or processes. Typically, a flowchart shows the steps as boxes of various kinds, and their order by connecting them with arrows.
- 25. Advantages Of Flowchart • It is a convenient method of communication. • It indicates very clearly just what is being done, where a program has logical complexities. • A key to correct programming. • It is an important tool for planning and designing a new system. • It clearly indicates the role-played at each level. • It saves the inconveniences in future and serves the purpose of documentation for a system. • It provides an overview of the system and also demonstrates the relationship between various steps. • Facilitates troubleshooting. • It promotes logical accuracy. • It makes sure that no logical path is left incomplete without any action being taken.
- 26. Disadvantages Of Flowchart • The flowchart is a waste of time and slows down the process of software development. • The flowchart is quite costly to produce and difficult to use and manage. • Flowcharts are not meant for man to computer communication. • Sometimes the Complex logic of the program logic is quite complicated to draw out on by using different defined shapes. In that case, flowchart becomes complex and clumsy. This will become a pain for the user, resulting in a waste of time and money trying to correct the problem • If you need to modify or alternate the process then it will be very hard to do in the flowchart. Because either you will have to erase the end of the flowchart or start.