teaching
Materials for full term courses, short courses and tutorials that I've taught or created.
University of Colorado Boulder
- Graduate Part-Time Instructor [Fall 2023] : CSCI-3104: Algorithms [Best Gradute Part Time Instructor]
- Graduate Part-Time Instructor [Spring 2023] : CSCI-3104: Algorithms [Best Gradute Part Time Instructor]
- Graduate Part-Time Instructor [Fall 2022] : CSCI-3104: Algorithms [Best Gradute Part Time Instructor]
- Teaching Assistant [Summer 2022] : CSCI-3104: Algorithms [Outstanding Teaching Assistant Award]
- Teaching Assistant [Spring 2022] : CSCI-3104: Algorithms [Outstanding Teaching Assistant Award]
Below is a sample lecture notes from one my lectures as a Graduate Part-Time Instructor. In this lecture I continue with Quicksort and its modifications (introduced in the previous lecture) to undergraduates students. We end the lecture by working through a proof that shows Randomized Quicksort algorithm always leads to \(O(nlog_e n)\) runtime, where \(n \in \mathbb{N}\) is the size of the array/list.
If you need more such lecture notes on concepts in Algorithms, feel free to email me!
- (upcoming… A Comphrensive Guide for Algorithms)