Event Summary

#

I had the opportunity to conduct a Data Structures and Algorithms session for the students of Sri Eshwar College of Engineering. It was a great privilege to connect with such enthusiastic young minds and share knowledge on core graph algorithms including Dijkstra, Kruskal, and Prim’s, along with graph representation — all implemented using the C programming language.

The session turned out to be highly interactive, with students actively engaging, asking insightful questions, and contributing to meaningful discussions. Their curiosity and involvement made the session more collaborative and impactful.

My Contribution

#

Coming from a Java and Kotlin background, revisiting C programming was a refreshing and intellectually stimulating experience. It pushed me to think more deeply about algorithms, especially from a low-level perspective.

To ensure effective teaching, I spent time exploring C concepts in depth — particularly memory management, pointers, and internal working layers — so I could explain the fundamentals clearly and practically.

This experience was not just about teaching, but also about learning and growing alongside the students.

Relevant Links

#

• LinkedIn: Post Link