Data Structures & Algorithms
A core theoretical and practical computer science course emphasizing the design, implementation, and rigorous asymptotic analysis of foundational data structures and algorithms.
Term: Spring
Responsibilities (TA):
-
Algorithmic Mentorship: Guided students in designing efficient algorithms and implementing complex data structures (e.g., graphs, trees, dynamic programming models) during interactive lab sessions.
-
Complexity Analysis: Assisted students in mathematically evaluating time and space complexity using Big-O notation, reinforcing theoretical rigor in practical code development.
-
Evaluation & Optimization: Assessed demanding programming assignments and written examinations, providing targeted feedback on algorithmic correctness, edge-case handling, and code optimization.