Chennai Mathematical Institute · Computer Science

Programming, Data Structures and Algorithms using Python

Prof. Madhavan Mukund · 2025 · 45 free video lectures

This course is an introduction to programming and problem solving in Python. It does not assume any prior knowledge of programming. Using some motivating examples, the course quickly builds up basic concepts such as conditionals, loops, functions, lists, strings and tuples. It goes on to cover…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Lecture 1: Algorithms and programming: simple gcd
  2. Lecture 2: Improving naive gcd
  3. Lecture 3: Euclid's algorithm for gcd
  4. Lecture 4: Downloading and installing Python
  5. Lecture 1: Assignment statement, basic types - int, float, bool
  6. Lecture 2: Strings
  7. Lecture 3: Lists
  8. Lecture 4: Control Flow
  9. Lecture 5: Functions
  10. Lecture 6: Examples
  11. Lecture 1: More about range()
  12. Lecture 2: Manipulating lists
  13. Lecture 3: Breaking out of a loop
  14. Lecture 4: Arrays vs lists, binary search
  15. Lecture 5: Efficiency
  16. Lecture 6: Selection Sort
  17. Lecture 7: Insertion Sort
  18. Lecture 8: Recursion
  19. Lecture 1: Mergesort
  20. Lecture 2: Mergesort, analysis
  21. Lecture 3: Quicksort
  22. Lecture 4: Quicksort analysis
  23. Lecture 5: Tuples and dictionaries
  24. Lecture 6: Function definitions
  25. Lecture 7: List Comprehension
  26. Lecture 1: Exception Handling
  27. Lecture 2: Standard input and output
  28. Lecture 3: Handling files
  29. Lecture 4: String functions
  30. Lecture 5: Formatting printed output
  31. Lecture 6: pass, del() and None
  32. Lecture 1: Backtracking, N queens
  33. Lecture 2: Global scope, nested functions
  34. Lecture 3: Generating permutations
  35. Lecture 4: Sets, stacks, queues
  36. Lecture 5: Priority queues and heaps
  37. Lecture 1: Abstract datatypes, classes and objects
  38. Lecture 2: Classes and objects in Python
  39. Lecture 3: User defined lists
  40. Lecture 4: Search trees
  41. Lecture 1: Memoization and dynamic programming
  42. Lecture 2: Grid paths
  43. Lesson 3: Longest common subsequence
  44. Lecture 4: Matrix multiplication
  45. Lecture 5: Wrap-up, Python vs other languages

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from Chennai Mathematical Institute.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights