# Design and Analysis of Algorithms

80 %
20 %
Information about Design and Analysis of Algorithms
Education

Published on March 7, 2009

Author: neilfurry

Source: authorstream.com

Design and Analysis of Algorithms : 3/7/2009 Presented by : Neil Peter B. Yu 1 Design and Analysis of Algorithms Introduction : 3/7/2009 Presented by : Neil Peter B. Yu 2 Introduction At the end of this presentation, the students should be able to understand what is algorithm and identify its purpose, the use of algorithms, and how they will apply the algorithms to programming. What is Algorithm? : 3/7/2009 Presented by : Neil Peter B. Yu 3 What is Algorithm? Algorithm is a set or series of instruction for carrying a particular task. It is also a procedure to produce the required output from the given input. It is similar with a paragraph that expresses a single thought. Topics of Discussion : 3/7/2009 Presented by : Neil Peter B. Yu 4 Topics of Discussion Purpose Use of Algorithms Application of Algorithms to programming Purpose : 3/7/2009 Presented by : Neil Peter B. Yu 5 Purpose To produce a consistent output based on a precise instruction. e.g: Creating a program. Cooking. Driving a car. How it relates to your daily task. Use of Algorithms : 3/7/2009 Presented by : Neil Peter B. Yu 6 Use of Algorithms It can be used to follow a certain steps of instructions such as: Doing a mathematical problem Programming Daily Task Application of Algorithms to Programming : 3/7/2009 Presented by : Neil Peter B. Yu 7 Application of Algorithms to Programming By means of flowchart Is used to describe processing procedures based on detailed analysis. Example of Flow Chart : 3/7/2009 Presented by : Neil Peter B. Yu 8 Example of Flow Chart START P = 0 INPUT A,B,C P=A*B*C OUTPUT P STOP Explanation of the flowchart : 3/7/2009 Presented by : Neil Peter B. Yu 9 Explanation of the flowchart Flowchart shows how to determine the product of the three (3) numbers. Sample Program : 3/7/2009 Presented by : Neil Peter B. Yu 10 Sample Program #include<stdio.h> #include<conio.h> main() { int A,B,C,P; clrscr(); printf("Enter First Number: "); scanf("%d",&A); printf("Enter Second Number: "); scanf("%d",&B); printf("Enter third Number: "); scanf("%d",&C); P=A*B*C; printf("The product of A*B*C is: %d",P); getch(); } Thank you for your time : 3/7/2009 Presented by : Neil Peter B. Yu 11 Thank you for your time I hope you gained knowledge from what I presented.

 User name: Comment:

## Related presentations

October 19, 2017

October 6, 2017

#### PHAN LOAI VA TINH CHAT CHUNG CUA CAC NGUYEN TO HUT...

September 25, 2017

October 19, 2017

October 19, 2017

October 19, 2017

## Related pages

### CS 161 - Design and Analysis of Algorithms

K-12 Free Education. ... Course Description. Course Overview: Introduction to fundamental techniques for designing and analyzing algorithms, including ...

### Algorithms: Design and Analysis, Part 1 - Stanford ...

Algorithms: Design and Analysis, Part 1 from Stanford University. Algorithms are the heart of computer science, and the subject has countless practical ...

### Design and Analysis of Algorithms | Electrical Engineering ...

This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms ...

### Design and Analysis of Computer Algorithms

This site contains design and analysis of various computer algorithms such as divide-and-conquer, dynamic, greedy, graph, computational geometry etc.

### DESIGN AND ANALYSIS OF ALGORITHMS: Amazon.de: Bücher

- DESIGN AND ANALYSIS OF ALGORITHMS jetzt kaufen. Kundrezensionen und 0.0 Sterne. …

### NPTEL :: Computer Science and Engineering - Design and ...

Design and Analysis of Algorithms. ... Algorithms Analysis Framework - II; Asymptotic Notations; Algorithm Design Techniques : Basics;

### DESIGN AND ANALYSIS OF ALGORITHMS - Duke University

CPS 230 DESIGN AND ANALYSIS OF ALGORITHMS Fall 2008 Instructor: Herbert Edelsbrunner Teaching Assistant: Zhiqiang Gu

### Analysis of algorithms - Wikipedia, the free encyclopedia

In computer science, the analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them.