LESSON PLAN

1. Course Title : PYTHON PROGRAMMING

5. Semester : IV
2. Course Code : MSDY 122 6. Academic Year : 2019 - 21
3. Course Faculty : Mrs. Pandiyavathi.T 7. Department : CA
4. Theory / Practical : Theory 8. No. of Credits :
9. Course Learning Objectives:
 To introduce the basic concepts of python programming with values and variables.
 To know the basic arithmetic operators used in Python Programming.
 To understand the importance of Python coding as a scripting language for
developers
 To learn to use the important functions in python programming
 To know the data structures and its usage in python programming.

10. Course pre-requisites:

Basic knowledge of Computer and any programming language.
11. Schedule of teaching and learning
Refer Annexure 2
12. Course material and References
The students shall refer books at Library or shall buy their own copies. Materials would be
provided for some portions.
Text Books:
1. Learning To Program With Python by Richard L. Halterman.(2011)
2. Guttag, John. Introduction to Computation and Programming Using Python. Spring 2013
edition. MIT Press, 2013.

References:
1. Programming Python, 4th Edition by Mark Lutz (2010) O'Reilly Media
2. Python Cookbook, 3rd Edition: Recipes for Mastering Python 3, by David Beazley and
Brian K. Jones, on O’Reilly Atlas (2013)

13. Assessment Scheme:

Total marks (100) = Internal Marks (50) + End Semester Marks (50)
Allocation of Marks:
S.No Assessment Scheme Weightage
1 Mid Trimester Examination 30%
2 Assignment/Seminar 20%
3 End Trimester exam 50%
Total 100%

i) Periodical tests: Two continuous assessments would be conducted and assignments after
every unit will be given.
ii) Assignment
Type of assignment - Written Assignment/Seminar
(OR)
Quiz / Comprehension
Mode of conducting Quiz - random (written or oral) / Objective type Test

iii) Case study discussion

Case studies will be given to the students for analysis. Students will present the case analysis
in the class room.
(OR)

Seminar
Seminar topic will be assigned to group of students. Time given for preparation - 7 – 10
days
iv) Fabrication / assembling - NA
v) Carry home exercise: Case study
vi) Self study: As indicated in Lesson Plan
vii) Content beyond syllabus: Learning about the application of Python programs.
14. Course outcomes
On completion of course, the students will be able to
 Apply various features and components of Python programming in the field of data
science.
 Student will learn how to design and program Python applications.
 Student will learn how to use lists, tuples, and dictionaries in Python programs.
 Student will learn how to identify Python object types.
 Student will learn how to use indexing and slicing to access data in Python programs.
 Student will define the structure and components of a Python program.
 Student will learn how to write loops and decision statements in Python
15. Mapping of course outcomes with learning activities and assessments

Course outcomes Learning activities Assessments CAT I * End sem

% *
%

Course outcome 1 Lecture and Seminar Case study 30 20

analysis

Course outcome 2 Lecture and Seminar Case study 40 20

analysis

Course outcome 3 Lecture and Seminar 30 20

-

Course outcome 4 Lecture and Seminar 20

-

Course outcome 5 Lecture and Seminar 20

-

*% of marks in the question paper relevant to the respective outcomes

Date:
Course faculty Head of the Department
 ANNEXURE (vide item 11)
Schedule of Teaching and Learning
Unit No.
Mode of Teaching Reference /
& Period Topic
delivery Aids Source
Total hours
MODULE I INTRODUCTION
2 Introduction to Python Lecture PPT T1
Programming, Development tools,

2 Values and variables, Integer Lecture Chalk and T1

values, Talk
2 Variables and assignment, Lecture Chalk and T1
12 hours Identifiers, Talk
2 Floating point types, Control codes Lecture Chalk and T1
Talk
2 Strings, User input Lecture Chalk and T1
Talk
2 Eval function, Print function Lecture Chalk and T1
Talk
MODULE II ARITHMETIC EXPRESSION
2 Expression and Arithmetic Lecture PPT T1 & T2
2 Operator precedence and Lecture PPT T1 & T2
associatively,
2 Comments and errors Lecture PPT T1 & T2
12 hours 2 Syntax errors, Run time errors Lecture Chalk and T1 & T2
Talk
1 Logic errors Lecture PPT T1 & T2

3 Arithmetic operators Lecture PPT T1 & T2

MODULE CONDITIONAL STATEMENTS

III
2 Conditional execution, Boolean Lecture PPT T1 & T2
expressions,
2 Simple if statement, if/else, Lecture Chalk and T1 & T2
Talk
2 Compound Boolean expressions, Lecture Chalk and T1 & T2
12 hours nested conditions, Talk
2 Decision statements, conditional Lecture PPT T1 & T2
expressions.
1 Iterations, while statement Lecture PPT T1 & T2
1 Definite vs indefinite loops Lecture Chalk and T1 & T2
Talk
 1 Nested loops Lecture Chalk and T1 & T2
Talk
1 Abnormal loop termination Lecture Chalk and T1 & T2
Talk
MODULE FUNCTIONS
IV
2 Functions, standard mathematics Lecture PPT T1 & T2
functions
2 Time function, random function Lecture Chalk and T1 & T2
Talk
1 Importing function, writing own Lecture Chalk and T1 & T2
functions Talk
12 hours 1 Parameter passing Lecture PPT T1 & T2
2 Custom function vs standard Lecture PPT T1 & T2
functions Global variables
2 Default variables, recursion Lecture PPT T1 & T2
2 Reusable functions, functions as Lecture Chalk and T1 & T2
data. Talk
MODULE V LINEAR SEARCH

2 Lists, List assignment, list bounds, Lecture PPT T1 & T2

slicing,
2 List and functions, prime Lecture Chalk and T1 & T2
generation with list Talk
2 Sorting, flexible sorting, search, Lecture PPT T1 & T2
linear search
12 hours 2 Binary search, list permutation, Lecture PPT T1 & T2
random permutation, objects
2 String objects, list objects, custom Lecture Chalk and T1 & T2
types - geometric Talk

2 Handling exceptions and Case Lecture PPT T1 & T2

Study.