Lecture 1 introduction
Download as PPTX, PDF0 likes64 views
This document outlines the details of an advanced data structures and analysis of algorithms course taught by Abirami S at Shah and Anchor Kutchhi Engineering College in Mumbai. The course objectives include analyzing algorithm time and space complexity, applying advanced data structures, and evaluating divide and conquer and greedy algorithms techniques. The course covers topics like analysis of algorithms, advanced data structures, divide and conquer, greedy methods, dynamic programming, and string matching. Prerequisites include programming and data structures.
Lecture 1 introduction
- 1. Lecture 1 Advanced Data structures & Analysis of Algorithms Abirami S Asst.Prof. IT Dept. Shah and Anchor Kutchhi Engineering College, Mumbai
- 2. Course Outcome 1. Discuss analysis of algorithm(Understand) 2. Apply the time and space complexity of various algorithms.(Apply) 3. Select a proper pattern matching technique to solve the given problems. (Evaluate) 4. Construct advanced data structures( Apply) 5. Examine various Divide and Conquer techniques.(Analyze) 6. Solve Greedy algorithms, Dynamic algorithms.(Apply) Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 3. Prerequisite 1. Programming Language 2. Data Structure Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 4. Modules 1. Analysis of Algorithm 2. Advanced Data structure 3. Divide and conquer 4. Greedy method 5. Dynamic programming 6. String Matching Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 5. Analysis of Algorithm ⢠In general terms, analysis of algorithm discuss about the efficiency of an algorithm. ⢠It tells the estimation of various resources required by an algorithm to crack a specific problem of computation. ⢠The resources are the necessary storage or the required time to execute a specific algorithm. ⢠The estimated running time of an algorithm is called as time complexity and the estimated storage/memory needed for the execution of an algorithm is called as space complexity. Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 6. Advanced Data structure ⢠Data Structures are used to store data and manage the data in a very efficient way for easy and faster access and for modification of data. ⢠Data Structures are used in every program. Some examples of data structures are arrays, stacks, queues, linked lists, binary trees, hash tables. ⢠This module consists of AVL tree, B/B++ tree, Red Black tree, Tries, and so on. Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 7. Divide and conquer ⢠The divide and conquer technique divides the larger problem into smaller sub problems and the solution is the combination of those smaller sub problems. Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 8. Dynamic Programming Vs Greedy Algorithm Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm
- 9. Thank You Shah and anchor kutchhi Engineering College, Mumbai. Advanced Data Structures & Analysis of Algorithm