Programming, Data Structures and Algorithms using Python

By Prof. Madhavan Mukund | Chennai Mathematical Institute

Join

Learners enrolled: 2618

ABOUT THE COURSE :
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 files. As far as data structures are concerned, the course covers Python dictionaries as
well as classes and objects for defining user defined datatypes such as linked lists and binary search trees.

INTENDED AUDIENCE: Students in any branch of mathematics/science/engineering, 1st year

PREREQUISITES: School level mathematics.

INDUSTRY SUPPORT: This course should be of value to any company requiring programming skills.

Summary

Course Status : Upcoming

Course Type : Elective

Duration : 8 weeks

o Computer Science and Engineering

o Artificial Intelligence

o Data Science
Category :
o Foundations of Computing

o Programming

Credit Points : 2

Level : Undergraduate

Start Date : 22 Jul 2024

End Date : 13 Sep 2024

Enrollment Ends : 29 Jul 2024

Exam Registration Ends : 16 Aug 2024

Exam Date : 22 Sep 2024 IST
Note: This exam date is subjected to change based on seat availability. You can check final exam date on your hall ticket.
This is an AICTE approved FDP course

FacebookXTeamsLinkedInWhatsAppShare

Course layout
Week 1:
Informal introduction to programmin, algorithms and data structures viagcd
Downloading and installing Python
gcd in Python: variables, operations, control flow - assignments, condition-als, loops, functions

Week 2:
Python: types, expressions, strings, lists, tuples
Python memory model: names, mutable and immutable values
List operations: slices etc
Binary search
Inductive function denitions: numerical and structural induction
Elementary inductive sorting: selection and insertion sort
In-place sorting

Week 3:
Basic algorithmic analysis: input size, asymptotic complexity, O() notation
Arrays vs lists
Merge sort
Quicksort
Stable sorting

Week 4:
Dictionaries
More on Python functions: optional arguments, default values
Passing functions as arguments
Higher order functions on lists: map, lter, list comprehension

Week 5:
Exception handling
Basic input/output
Handling files
String processing

Week 6:
Backtracking: N Queens, recording all solutions
Scope in Python: local, global, nonlocal names
Nested functions
Data structures: stack, queue
Heaps

Week 7:
Abstract datatypes
Classes and objects in Python
"Linked" lists: find, insert, delete
Binary search trees: find, insert, delete
Height-balanced binary search trees

Week 8:
Effcient evaluation of recursive definitions: memoization
Dynamic programming: examples
Other programming languages: C and manual memory management
Other programming paradigms: functional programming

Instructor bio

Prof. Madhavan Mukund

Chennai Mathematical Institute
Madhavan Mukund studied at IIT Bombay (BTech) and Aarhus University (PhD). He has been a faculty member at Chennai
Mathematical Institute since 1992, where he is presently Professor and Director. His main research area is formal verification.
He has active research collaborations within and outside India and serves on international conference programme committees
and editorial boards of journals.

He has served as President of both the Indian Association for Research in Computing Science (IARCS) (2011-2017) and the
ACM India Council (2016-2018). He has been the National Coordinator of the Indian Computing Olympiad since 2002. He
served as the Executive Director of the International Olympiad in Informatics from 2011-2014.

In addition to the NPTEL MOOC programme, he has been involved in organizing IARCS Instructional Courses for college
teachers. He is a member of ACM India's Education Committee. He has contributed lectures on algorithms to the Massively
Empowered Classroom (MEC) project of Microsoft Research and the QEEE programme of MHRD.

Course certificate
The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored
exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 22 September 2024 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be
made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when
you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 6 assignments out of the total 8 assignments given in the
course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM
SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.
Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of
NPTEL and IIT Madras .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team

………………………………..

Fundamentals of Artificial intelligence

By Prof. Shyamanta M. Hazarika | IIT Guwahati
Join

Learners enrolled: 906

ABOUT THE COURSE:
What does automatic scheduling or autonomous driving have in common with web search, speech recognition, and
machine translation? These are complex real-world problems that span across various practices of engineering! Aim
of artificial intelligence (AI) is to tackle these problems with rigorous mathematical tools. The objective of this course
is to present an overview of the principles and practices of AI to address such complex real-world problems. The
course is designed to develop a basic understanding of problem solving, knowledge representation, reasoning and
learning methods of AI.

INTENDED AUDIENCE: Final Year B.Tech; M.Tech and PhD

PREREQUISITES: Basic Course in Probability and Linear Algebra

Summary

Course Status : Upcoming

Course Type : Elective

Duration : 12 weeks

o Multidisciplinary
Category : o Robotics

Credit Points : 3

Level : Postgraduate

Start Date : 22 Jul 2024

End Date : 11 Oct 2024

Enrollment Ends : 29 Jul 2024

Exam Registration Ends : 16 Aug 2024

Exam Date : 26 Oct 2024 IST

Note: This exam date is subjected to change based on seat availability. You can check final exam date on your hall ticket.
This is an AICTE approved FDP course

FacebookXTeamsLinkedInWhatsAppShare

Course layout
Week 1: AI and Problem Solving by Search
Week 2: Problem Solving by Search
Week 3: Problem Solving by Search
Week 4: Knowledge Representation and Reasoning
Week 5: Knowledge Representation and Reasoning
Week 6: Knowledge Representation and Reasoning
Week 7: Reasoning under Uncertainty
Week 8: Planning
Week 9: Planning and Decision Making
Week 10: Machine Learning
Week 11: Machine Learning
Week 12: Machine Learning

Books and references

1. Patrick Henry Winston, Artificial Intelligence, Third Edition, Addison-Wesley Publishing Company, 2004.
2. Nils J Nilsson, Principles of Artificial Intelligence, Illustrated Reprint Edition, Springer Heidelberg, 2014.
3. Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach, 3rd Edition, PHI 2009.
4. Nils J. Nilsson, Quest for Artificial Intelligence, First Edition, Cambridge University Press, 2010.

Instructor bio

Prof. Shyamanta M. Hazarika

IIT Guwahati
Prof. Shyamanta M Hazarika is a Professor of Mechanical Engineering at IIT Guwahati and leads the Biomimetic Robotics and
Artificial Intelligence Lab. His research interest is in Rehabilitation Robotics. This translates into interest in Artificial
Intelligence, Biomimetic Robotics and Robotic Neurorehabilitation. Prior to joining IIT Guwahati, he was with the Department
of Computer Science and Engineering, Tezpur University. He has been a Vertretungsprofessur of Cognitive Systems and
NeuroInformatics, University of Bremen, Germany. Prof. Hazarika holds a B.E. in Mechanical Engineering from Assam
Engineering College, Guwahati, India; M.Tech. in Robotics from Center for Robotics, IIT Kanpur, India. He completed his PhD
in Artificial Intelligence (Knowledge Representation and Reasoning) from School of Computing, University of Leeds, England.
Course certificate
The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored
exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 26 October 2024 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be
made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when
you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the
course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM
SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of
NPTEL and IIT Guwahati .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team

…………………………………………………………………..

Combinatorics
By Prof. Narayanan N | IIT Madras
Join

Learners enrolled: 113

ABOUT THE COURSE:
We start with the finite and infinite avatars of the Pigeonhole Principle, Basic counting tools and the twelvefold way
followed by compositions and partitions of integers and Stirling numbers. We then look at Inclusion exclusion and
Mobius inversion followed by generating functions. We then look at Polya's theorem, graphs and conclude with a
short introduction to species of structures.

INTENDED AUDIENCE :UG students

PRE-REQUISITES : Basic Mathematical Maturity expected from a Mathematics student at the level of 10+2. Familiarity with
group theory will be added
advantage (not necessary).

INDUSTRY SUPPORT : TCS, Infosys, Microsoft Research, Any companies developing discrete mathematics related areas or
algorithms.
Summary
Course Status : Upcoming

Course Type : Elective

Duration : 12 weeks

o Mathematics
Category : o Algebra

Credit Points : 3

Level : Undergraduate

Start Date : 22 Jul 2024

End Date : 11 Oct 2024

Enrollment Ends : 29 Jul 2024

Exam Registration Ends : 16 Aug 2024

Exam Date : 27 Oct 2024 IST

Note: This exam date is subjected to change based on seat availability. You can check final exam date on your hall ticket.
This is an AICTE approved FDP course

FacebookXTeamsLinkedInWhatsAppShare

Course layout
Week 1 : Pigeonhole Principle
Week 2 : Basic and Bijective counting.
Week 3 : Compositions and Partitions.
Week 4 : Advanced Counting.
Week 5 : Inclusion Exclusion, Mobius Inversion.
Week 6 : Generating Functions
Week 7 : Graph theory, introduction, trees, connectivity.
Week 8 : Menger, Hall, Konig - equivalence and System of Distinct Representatives.
Week 9 : Planar graphs.
Week 10: Groups and Polya theory.
Week 11: Species of structures.
Week 12: An overview, scope and further directions.

Books and references

Text:
 1. Introductory Combinatorics 5th Edition, Richard Brualdi, Pearson.

References:

1. Bijective Combinatorics. Nicholas Loehr. CRC press.

2. Enumerative combinatorics. Richard Stanley. Cambridge university press.

Instructor bio

Prof. Narayanan N
IIT Madras
My research interests are related to combinatorics, graph theory and combinatorial algebra.

Course certificate
The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored
exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 27 October 2024 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be
made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when
you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the
course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM
SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of
NPTEL and IIT Madras .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team

……………………………………………………..
A Basic Course in Number Theory
By Prof. Shripad Garge | IIT Bombay
Join

Learners enrolled: 375

ABOUT THE COURSE:
This course intends to develop the basics of number theory touching upon many essential points such as the prime
number theorem, quadratic reciprocity laws, Gauss’ theorem on the classification of binary quadratic forms, Brahmagupta-
Pell equations, to quote a few. This course will enable a student to learn more advanced topics in number theory.

INTENDED AUDIENCE : Students with basic knowledge of Mathematics can take this course.

PREREQUISITES : Knowledge of basic group theory and ring theory will be useful but it is not necessary.

Summary

Course Status : Upcoming

Course Type : Elective

Duration : 12 weeks

o Mathematics
Category : o Algebra

Credit Points : 3

Level : Postgraduate

Start Date : 22 Jul 2024

End Date : 11 Oct 2024

Enrollment Ends : 29 Jul 2024

Exam Registration Ends : 16 Aug 2024

Exam Date : 03 Nov 2024 IST

Note: This exam date is subjected to change based on seat availability. You can check final exam date on your hall ticket.

Course layout
Week 1: Factorization of numbers, primes
Week 2: GCD, Euclid’s algorithm, properties of primes
Week 3: Arithmetical functions, examples
Week 4: Dirichlet product, Möbius inversion
Week 5: Congruences, Chinese remainder theorem, primitive roots
Week 6: Quadratic reciprocity law, applications
Week 7: Binary quadratic forms, Gauss’ theory of reduced forms
Week 8: Sums of two squares, sums of four squares
Week 9: Diophantine approximation, theorems of Dirichlet and Liouville
Week 10: Continued fractions, quadratic irrationals
Week 11: Quadratic extensions of rationals, units in the rings of integers
Week 12: Diophantine equations with special reference to Brahmagupta-Pell equation

Books and references

1. (Alan Baker) A comprehensive course in number theory
2. (Niven, Zuckerman) An introduction to the theory of numbers

Instructor bio

Prof. Shripad Garge

IIT Bombay
I am an associate professor at the mathematics department, IIT Bombay. My research interests are in group theory and number
theory.

Course certificate
The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored
exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 03 November 2024 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be
made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when
you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the
course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM
SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of
NPTEL and IIT Bombay .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team