Algorithms play a central role not only in the field of Computer Science but also in every scientific activity including the field of computing. Algorithm design techniques have considerable utility in problem solving, which are applicable to problems even beyond computing.

The “Design” part pertains to the description of algorithm at an abstract level by means of a Pseudo Language and Proof of correctness.

The “Analysis” part deals with prediction of resources and performance evaluation (Complexity analysis) on implementation.

The intent of this SDP-DAA is to provide a platform for sharing of knowledge on the concepts and Analysis of complexity for various strategies like Divide and Conquer, Greedy Method, Dynamic Programming, Backtracking, Branch and Bound, NP Hard & NP Complete with emphasis on different Areas of Application and the Recent Research Trends in Algorithms. Appropriate Hands-on-training will also be provided to the participants for implementation of Algorithms