Dr Sashikala Mishra Associate Professor Department of Computer

  • Slides: 13
Download presentation
Dr. Sashikala Mishra Associate Professor Department of Computer Engineering Hope Foundation’s INTERNATIONAL INSTITUTE OF

Dr. Sashikala Mishra Associate Professor Department of Computer Engineering Hope Foundation’s INTERNATIONAL INSTITUTE OF INFORMATION TECHNOLOGY, (I²IT) www. isquareit. edu. in

Contents 1. 2. 3. 4. Importance of Algorithm Types of Algorithm Design of an

Contents 1. 2. 3. 4. Importance of Algorithm Types of Algorithm Design of an algorithm Applications Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Algorithm • An algorithm is a stepwise procedure to complete the task. Input Process

Algorithm • An algorithm is a stepwise procedure to complete the task. Input Process Desired Output • Algorithm which takes the input process it and provides the desired output. • For a single problem we can have multiple algorithms. {A 1, A 2, A 3 …} Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

How to select an algorithm • If they are many approaches are present to

How to select an algorithm • If they are many approaches are present to solve a problem we can select the best by considering the time and space complexity. • The algorithm can be represent as program by using programming language. Like C, C++, JAVA etc • The program can be written in two ways 1. Iterative 2. Recursive • In iterative we generally use the loops like for or while in the case of recursive the same function is called more number of times Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

• Importance of Algorithm • Competent algorithms lead to capable programs. Competent programs

• Importance of Algorithm • Competent algorithms lead to capable programs. Competent programs always substantially preferred by end user Capable programs which came from good algorithm make better use resources. Algorithms provides a appropriate constitution to write the program. Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Difference between program and algorithm • Algorithm is written using normal or algorithmic language.

Difference between program and algorithm • Algorithm is written using normal or algorithmic language. • E. g. Write the value of A • Programs are written using a specific programming language like C, C++ etc. cout << "Hello"; Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Problem Solving Approach 1. Identify the problem Specifications. (Input and Output) 2. Sketch the

Problem Solving Approach 1. Identify the problem Specifications. (Input and Output) 2. Sketch the logic and list the steps to get the target output 3. Write the steps in a particular order and check each steps for finiteness 4. Flowchart to be drawn for Algorithm 5. Translate the Algorithm to any of the Programming language 6. Test the program and Check the Output 7. Documentation 8. Application of the program. Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Computational Problems ü ü ü ü ü Sorting Searching Traversing Shortest paths in a

Computational Problems ü ü ü ü ü Sorting Searching Traversing Shortest paths in a graph Minimum spanning tree Primarily testing Traveling salesman problem Chess Towers of Hanoi Knapsack problem Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

PROPERTIES OF AN ALGORITHM 1. 2. 3. 4. 5. 6. 7. 8. An algorithm

PROPERTIES OF AN ALGORITHM 1. 2. 3. 4. 5. 6. 7. 8. An algorithm takes zero or more inputs An algorithm results in one or more outputs All operations can be carried out in a finite amount of time An algorithm should be efficient and flexible It should use less memory space as much as possible An algorithm must terminate after a finite number of steps. Each step in the algorithm must be easily understood for some reading it An algorithm should be concise and compact to facilitate verification of their correctness. Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Iterative Algorithm • Repetition execution can be named as iterative • Iteration can be

Iterative Algorithm • Repetition execution can be named as iterative • Iteration can be achieved by the looping statements. • Start of the Loop initializing i=0 Condition ( for termination of the loop) Body of the loop • End loop A problem can be solved by iterative or recursive process. e. g. Factorial of a number Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Real-World Applications VLSI chips Machine learning Networking Compilers Computer graphics: movies, video games Routing

Real-World Applications VLSI chips Machine learning Networking Compilers Computer graphics: movies, video games Routing messages in the Internet Searching the Web Distributed file sharing Data Mining Image Processing NLP Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

Reference [1] https: //www. google. co. in/url? sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved= 2 ah. UKEwi. M 04 u.

Reference [1] https: //www. google. co. in/url? sa=t&rct=j&q=&esrc=s&source=web&cd=2&cad=rja&uact=8&ved= 2 ah. UKEwi. M 04 u. Xz. Jzf. Ah. UOU 30 KHSNd. B 6 YQFj. ABeg. QICRAC&url=http%3 A%2 F%2 Fwww. avce. edu. in %2 FDAA-Unit 1. ppt&usg=AOv. Vaw 1_Wp. Mm. Pc 816 Wrzz 3 sq. YZv. L Hope Foundation’s International Institute of Information Technology, I²IT P-14, Rajiv Gandhi Infotech Park MIDC Phase 1, Hinjawadi, Pune – 411057 Tel - +91 20 22933441/2/3 | www. isquareit. edu. in | info@isquareit. edu. in

THANK YOU !! For further information please contact Dr. S. Mishra sashikalam@isquareit. edu. in

THANK YOU !! For further information please contact Dr. S. Mishra sashikalam@isquareit. edu. in | hodce@isquareit. edu. in Department of Computer Engineering Hope Foundation’s International Institute of Information Technology, I 2 IT P-14, Rajiv Gandhi Infotech Park, MIDC Phase I, Hinjawadi, Pune – 411 057 Phone - +91 20 22933441 www. isquareit. edu. in | info@isquareit. edu. in

Dr Sashikala Mishra Associate Professor Department of ComputerDr Sashikala Mishra Associate Professor Department of Computer
Mammary gland Dr Vivek Mishra Associate Professor AxillaryMammary gland Dr Vivek Mishra Associate Professor Axillary
Client Side Validation using Java Script Dr SashikalaClient Side Validation using Java Script Dr Sashikala
Izabella Petriashvili Associate Professor Kakha Gabunia Associate ProfessorIzabella Petriashvili Associate Professor Kakha Gabunia Associate Professor
tenured tenuretrack 10 Professor Associate professor Assistant professortenured tenuretrack 10 Professor Associate professor Assistant professor
READING FOR REFLECTION By Dr Murlidhar Mishra AssociateREADING FOR REFLECTION By Dr Murlidhar Mishra Associate
READING For REFLECTION By Dr Murlidhar Mishra AssociateREADING For REFLECTION By Dr Murlidhar Mishra Associate
Computer Architecture Microarchitectures Virendra Singh Associate Professor ComputerComputer Architecture Microarchitectures Virendra Singh Associate Professor Computer
Computer Architecture Introduction Virendra Singh Associate Professor ComputerComputer Architecture Introduction Virendra Singh Associate Professor Computer
Computer Architecture Introduction Virendra Singh Associate Professor ComputerComputer Architecture Introduction Virendra Singh Associate Professor Computer
JAPANESE ENCEPHALITIS Dr Sudhanshu Mishra Assistant Professor CommunityJAPANESE ENCEPHALITIS Dr Sudhanshu Mishra Assistant Professor Community
Computational Biology Lecture 3 Mapping Bud Mishra ProfessorComputational Biology Lecture 3 Mapping Bud Mishra Professor