Madhavan Mukund

NPTEL Programming, Data Structures and Algorithms Using Python

Lecture Slides

• Week 1: Introduction

  • Lecture 1: Algorithms and programming: simple gcd
  • Lecture 2: Improving naive gcd
  • Lecture 3: Euclid's algorithm for gcd
  • Lecture 4: Downloading and installing Python

• Week 2: Basics of Python

  • Lecture 1: Assignment statement, basic types - int, float, bool
  • Lecture 2: Strings
  • Lecture 3: Lists
  • Lecture 4: Control Flow
  • Lecture 5: Functions
  • Lecture 6: Examples

• Week 3: Lists, inductive function definitions, sorting

  • Lecture 1: More about range()
  • Lecture 2: Manipulating lists
  • Lecture 3: Breaking out of a loop
  • Lecture 4: Arrays vs lists, binary search
  • Lecture 5: Efficiency
  • Lecture 6: Selection Sort
  • Lecture 7: Insertion Sort
  • Lecture 8: Recursion

• Week 4: Sorting, Tuples, Dictionaries, Passing Functions, List Comprehension

  • Lecture 1: Mergesort
  • Lecture 2: Mergesort, analysis
  • Lecture 3: Quicksort
  • Lecture 4: Quicksort analysis
  • Lecture 5: Tuples and dictionaries
  • Lecture 6: Function definitions
  • Lecture 7: List Comprehension

• Week 5: Exception handling, input/output, file handling, string processing

  • Lecture 1: Exception Handling
  • Lecture 2: Standard input and output
  • Lecture 3: Handling files
  • Lecture 4: String functions
  • Lecture 5: Formatting printed output
  • Lecture 6: pass, del() and None

• Week 6: Backtracking, scope, data structures; stacks, queues and heaps

  • Lecture 1: Backtracking, N queens
  • Lecture 2: Global scope, nested functions
  • Lecture 3: Generating permutations
  • Lecture 4: Sets, stacks, queues
  • Lecture 5: Priority queues and heaps

• Week 7: Classes, objects and user defined datatypes

  • Lecture 1: Abstract datatypes, classes and objects
  • Lecture 2: Classes and objects in Python
  • Lecture 3: User defined lists
  • Lecture 4: Search trees

• Week 8: Dynamic programming, wrap-up

  • Lecture 1: Memoization and dynamic programming
  • Lecture 2: Grid paths
  • Lecture 3: Longest common subsequence
  • Lecture 4: Matrix multiplication
  • Lecture 5: Wrap-up, Python vs other languages