Department of Computer Science and Engineering

MOOC COURSE-B19CS8020 – IA-1

Progress Report
Sharath G M
R19CS301
CSE’ E Section
8th Semester Date: 05/08/2023

Sl.NO Title of Certification Programming, Data Structures and Algorithms

Using Python
~ By Prof. Madhavan
Mukund

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
1. Scope 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.

The objectives of the course over the span of 8

weeks are:

Week 1:
● Informal introduction to programming,
 algorithms, and data structures via GCD
● Downloading and installing Python

2. Objectives ● GCD in Python: variables, operations,

control flow - assignments, conditionals,
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 definition: 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, 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:
● Efficient evaluation of recursive
definitions: memorization
● Dynamic programming: examples
● Other programming languages: C and
manual memory management
● Other programming paradigms: functional
programming

The outcomes of this course are as follows:

 ● Enables the student to get familiar
with python programming language
and its syntax’s.
● Basic data structures and
algorithms, exception and file
handling have been shown and
explained.
● Object oriented programming and
dynamic programming have been
3. Outcomes
shown.
Overall, the course gives the learner/student the
familiarity to python programming language at an
intermediate level, where one can code with ease
and greater understanding of what they are
implementing. Also, explains various algorithms
that act as base for learning and implementing
larger projects and programs.

8 Weeks

4. Duration (Teaching Hours) Start Date: 23/01/2023.

End Date: 17/03/2023.
5. Number of Assignments in Quizzes: 05
the course
Assignments: 05
6. Number of Assignments
completed
07 / 10
7. The Percentage of Course
Completion
100 %

Student Examiner Guide