2

Programming, Data Structures and Algorithms using Python. Instructor: Prof. Madhavan Mukund, Department of Computer Science and Engineering, Chennai Mathematical Institute

FREE
This course includes
Hours of videos

1249 years, 10 months

Units & Quizzes

45

Unlimited Lifetime access
Access on mobile app
Certificate of Completion

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 searching and sorting algorithms, dynamic programming and backtracking, as well as topics such as exception handling and using less. As far as data structures are concerned, the course covers Python dictionaries as well as classes and objects for denying user-defined data types such as linked lists and binary search trees. (from nptel.ac.in)

Course Currilcum

    • Lecture 01 – Algorithms and Programming: Simple GCD Unlimited
    • Lecture 02 – Improving Naive GCD Unlimited
    • Lecture 03 – Euclid’s Algorithm for GCD Unlimited
    • Lecture 04 – Downloading and Installing Python Unlimited
    • Lecture 05 – Assignment Statement, Basic Types – Int, Float, Bool Unlimited
    • Lecture 06 – Strings Unlimited
    • Lecture 07 – Lists Unlimited
    • Lecture 08 – Control Flow Unlimited
    • Lecture 09 – Functions Unlimited
    • Lecture 10 – Examples Unlimited
    • Lecture 11 – More about Range () Unlimited
    • Lecture 12 – Manipulating Lists Unlimited
    • Lecture 13 – Breaking Out of a Loop Unlimited
    • Lecture 14 – Arrays vs Lists, Binary Search Unlimited
    • Lecture 15 – Efficiency Unlimited
    • Lecture 16 – Select Sort Unlimited
    • Lecture 17 – Insertion Sort Unlimited
    • Lecture 18 – Recursion Unlimited
    • Lecture 19 – Mergesort Unlimited
    • Lecture 20 – Mergesort, Analysis Unlimited
    • Lecture 21 – Quicksort Unlimited
    • Lecture 22 – Quicksort Analysis Unlimited
    • Lecture 23 – Tuples and Dictionaries Unlimited
    • Lecture 24 – Function Definitions Unlimited
    • Lecture 25 – List Comprehension Unlimited
    • Lecture 26 – Exception Handling Unlimited
    • Lecture 27 – Standard Input and Output Unlimited
    • Lecture 28 – Handling Files Unlimited
    • Lecture 29 – String Functions Unlimited
    • Lecture 30 – Formatting Printed Out Unlimited
    • Lecture 31 – Pass, Del() and None Unlimited
    • Lecture 32 – Backtracking, N Queens Unlimited
    • Lecture 33 – Global Scope, Nested Functions Unlimited
    • Lecture 34 – Generating Permutations Unlimited
    • Lecture 35 – Sets, Stacks, Queues Unlimited
    • Lecture 36 – Priority Queues and Heaps Unlimited
    • Lecture 37 – Abstract Data Types, Classes and Objects Unlimited
    • Lecture 38 – Classes and Objects in Python Unlimited
    • Lecture 39 – User Defined Lists Unlimited
    • Lecture 40 – Search Trees Unlimited
    • Lecture 41 – Memoization and Dynamic Programming Unlimited
    • Lecture 42 – Grid Paths Unlimited
    • Lecture 43 – Longest Common Subsequence Unlimited
    • Lecture 44 – Matrix Multiplication Unlimited
    • Lecture 45 – Python vs Other Languages Unlimited