1. Convex Optimization and its Applications in Computer Science Course Webpage, project ref: Extremely short linear program solvers.

2. Artificial Intelligence: Past, Present, Future | Introduction | Lec 1 Birth of AI | Lec 2 Mathematical Logic in AI | Lec 3 AI Games | Lec 4 AI Games and Search | Lec 5Maze-Solving and Retros | Lec 6 Human-assisted Computation | Lec 7 Robots |  Lec 8 AI Chatbots | Lec 9 Neural Network Applications | Lec 10 Automated Reasoning | Lec 11Machine Learning | Lec 13 Review 

3. Data Structures | Introduction | Lec 1 Complexity | Lec 2 Recursion-Binary Search | Lec 3 Linked List-Stack-Queue | Lec 4 Bubble-Insertion-Sort | Lec 5 Divide-Conquer-Merge-Sort | Lec 6 Quick Sort | Lec 7 Heap-Radix-Sort | Lec 8 Hash Map | Lec 9 Binary Search Tree | Lec 10 AVL Tree-Stern Brocot Tree | Lec 11 Permutation-Disjoint-Set-Kruskal-Algorithm | Lec 12 Revision 

4. Lecture on Creative Geometry and Computer Science | Lecture Slides