The primary objective of the short term course is to provide an understanding of the fundamentals of some algorithms for some selected areas (problems). Algorithm is the core subject of computing and is required in almost all areas of computer and related sciences. The goal is to enlighten the audience about a few algorithms for some fundamental problems so that at the end of the 5-day workshop/course, one can become more confident on some specific set of problems. The exact set of problem areas will depend on the individual instructors. However the backbone of all of them will be algorithm. Moreover, at the end of the workshop/course, one will have a fair understadning of some of the open questions (research problems) in each area/topic. The course will provide a platform for the faculties teaching data structure and algorithm related courses in various technical institutes in sharing the best practices for effective understanding and delivery of the subject. Pedagogy sessions arranged as part of the course will facilitate professional way of teaching algorithms. The course will also provide a forum for long term association with some of the faculties of the CSE department, IIT Guwahati in terms of student internship, collaborative research and combined mentoring of student projects.

• Dr. Sushanta Karmakar, Associate Prof, CSE, IIT Guwahati.
• Dr. Pinaki Mitra, Associate Prof, CSE, IIT Guwahati.
• Dr. Deepanjan Kesh, Assistant Professor, CSE, IIT Guwahati.
• Dr. Jatindra Kumar Deka , Professor, CSE, IIT Guwahati.
• Dr. Partha Sarathi Mandal, Associate Professor, Math, IIT Guwahati.

• Topic 1: Maximum flow and related problems
• Topic 2: BSP (binary space partition) trees and related applications
• Topic 3: Algorithms for Matchings in Graphs
• Topic 4: Algorithms for bit-probe model and related problems
• Topic 5: Algorithms for geometric optimization problems
• Topic 6: Algorithms for wireless networks
• Topic 7: Pedagogy session on how to effectively teach algorithms

The course provides the participants with an appreciation of modern algorithm design techniques and their applications in practical problem. The course does not have any pre-requisite. However basic understanding of data-structure and algorithm will be helpful. To facilitate better understanding, a few tutorial sessions for problem solving will be arranged. Special sessions are there devoted to the discussion of state of art research issues related to algorithms. The course would like to bring faculties teaching the related subjects in various participating institutes under one umbrella and share the best practices in delivering the subject in a more effective way.

The course is open to faculty members of TEQIP mapped institutions. Please refer to "Institution List" link in the NPIU website for list of TEQIP mapped institutions. There will be total 30 seats for the course which will be filled based on first come first serve basis.