March 10–14, 2025
7
The five-day session, conducted from 10th to 14th March 2025 via Google Meet, aimed to help 2nd and 3rd-year students from IT, CSE, CSE-IoT, AIDS, Mechanical, and CSBS departments build a strong foundation in algorithmic problem-solving. It focused on key algorithmic paradigms, code optimization, and tackling complex computational problems. Limited participants ensured personalized interaction, in-depth discussions, and hands-on problem-solving for competitive programming, technical interviews, and real-world software development.
Day 1 – Understanding Data Structures: Arrays, linked lists, stacks, queues, trees, and graphs, emphasizing efficiency and real-world applications.
Day 2 – Backtracking & Brute Force: Explored brute-force techniques and backtracking problems such as N-Queens and Sudoku Solver.
Day 3 – Travelling Salesman Problem (TSP): NP-hard problem analysis with exact, heuristic, and approximation solutions using dynamic programming and branch-and-bound approaches.
Day 4 – Divide and Conquer: Case studies on Merge Sort, Quick Sort, and Binary Search with hands-on coding.
Day 5 – Algorithmic Quiz & Challenge: Interactive quiz and coding challenge applying learned concepts to solve real-world algorithmic problems.
- Strengthened logical thinking and coding efficiency.
- Improved problem-solving skills for competitive programming and interviews.
- Practical application of algorithms bridging theory and real-world scenarios.
- Recognition through e-certificates and achievement certificates for top performers.
1. Ruthi Shankari S
2. Rahul V
Volunteers assisted with technical support, session management, and participant engagement.
The tutoring session successfully equipped students with essential algorithmic thinking and problem-solving skills. Participants praised the interactive format, real-world examples, and personalized guidance, which enhanced their understanding and practical application of algorithms.
Social Media Link: LinkedIn Post
