Course Content:

Algorithm Design Techniques (including Divide and Conquer, Dynamic Programming and Greedy)
Asymptotic Analysis
Data Structures
Graph Algorithms (including for shortest paths, minimum spanning trees)
NP-completeness and recent trends to deal with them (including approximation and fixed-parameter tractable algorithms)

The emphasis will be on problem solving, applications, motivational examples and pedagogical methods.

The workshop will relate these topics to the B.Tech syllabus for Kerala University to equip teachers to teach this course more effectively.