Design And Analysis Algorithm

About the Subject : 

The design analysis of algorithms is the determination of the amount of resources (such as time and storage) necessary to execute them. Most algorithms are designed to work with inputs of arbitrary length. Usually, the efficiency or running time of an algorithm is stated as a function relating the input length to the number of steps (time complexity) or storage locations (space complexity).

Topics to be covered in this Seminar :

Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving –Asymptotic Notations and its properties – Mathematical analysis for Recursive and Non-recursive algorithms-Brute Force – Closest-Pair and Convex-Hull Problems-Exhaustive Search – Traveling Salesman Problem – Knapsack Problem – Assignment problem-Divide and conquer methodology – Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm –  Greedy Technique – Prim’s algorithm- Kruskal’s Algorithm- Dijkstra’s Algorithm-Huffman Trees-The Simplex Method-The Maximum-Flow Problem – Maximm Matching in Bipartite Graphs- The Stable marriage Problem-Decision Trees-P, NP and NP-Complete Problems–Coping with the Limitations – Backtracking.

Time To Be Planned:

1 or 2 days

Kind Of Program:

3D based Seminar and Guest Lecture for the Students

Reason For The Program :

     

Kalam Scientist Team aiming to build young generation Scientist

Sample Clips For Reference : 

Notation Algorithm

Greedy Technique

Cheers,

Kalam Scientist Team

7667668009

7667662428