B.E./B.
Tech—CSE—R2024—CBCS
SEMESTER II
Category: PC
CS10003 PYTHON PROGRAMMING L T P J C
3 0 0 0 3
COURSE OBJECTIVES:
To understand the basics of python program.
To learn to solve problems using Python conditionals and loops.
To define Python functions and be familiar with python strings.
To use Python data structures lists, tuples and dictionaries to represent complex data.
To do input/output with files in Python.
COURSE OUTCOMES:
CO1: Acquire knowledgeon Python programming.
CO2: Write simple Python programs using conditionals and loops for solving problems.
CO3: Apply Python functions and strings to solve real-time problems.
CO4: Represent compound data using Python lists, tuples, dictionaries etc.
CO5: Read and write data from/to files in Python programs.
CO-PO- MAPPING:
POs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
COs
CO1 3 3 3 3 2 - - - - - 2 2 3 3 -
CO2 3 3 3 3 2 - - - - - 2 2 3 - -
CO3 3 3 3 3 2 - - - - - 2 - 3 - -
CO4 2 2 - 2 2 - - - - - 1 - 3 - -
CO5 1 2 - - 1 - - - - - 1 - 2 - -
AVG 2 2 - - 2 - - - - - 1 - 2 -
Correlation Levels: 1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)
SYLLABUS:
UNIT I DATA TYPES, EXPRESSIONS, STATEMENTS 9
Python interpreter and interactive mode, debugging; values and types: int, float, Boolean,
string, and list; variables, expressions, statements, tuple assignment, precedence of operators,
comments; Illustrative programs: exchange the values of two variables, circulate the values of n
variables, distance between two points.
UNIT II CONTROL FLOW 9
Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained
conditional (if-elif-else); Iteration: state, while, for, break, continue, pass; Illustrative problems:
Linear Search, Minimum in a List, square root, GCD, exponentiation, sum an array of numbers.
UNIT III FUNCTIONS AND STRINGS 9
Fruitful functions: return values, parameters, local and global scope, function composition,
recursion; Strings: string slices, immutability, string functions methods, string module; Lists as
arrays. Illustrative programs: String reverse, palindrome, binary search, Towers of Hanoi
UNIT IV LISTS, TUPLES, DICTIONARIES 9
Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list
parameters; Tuples: tuple assignment, tuple as return value; Dictionaries: operations and
methods; advanced list processing - list comprehension; Illustrative programs: simple sorting,
histogram, Students marks statement, Retail bill preparation.
UNIT V FILES, MODULES, PACKAGES 9
Files and exceptions: text files, reading and writing files, format operator; command line
arguments, errors and exceptions, handling exceptions, modules, packages; Illustrative
programs: word count, copy file, Voter’s age validation, Marks range validation (0-100).
CONTACT PERIODS:
Lecture: 45 Periods Tutorial: - Periods Practical: - Periods Projects: - Periods
Total: 45 Periods
TEXT BOOK:
1. Allen B. Downey, “Think Python: How to Think like a Computer Scientist”, 2nd Edition,
O’Reilly Publishers, 2016.
2. Karl Beecher, “Computational Thinking: A Beginner's Guide to Problem Solving and
Programming”, 1st Edition, BCS Learning & Development Limited, 2017.
REFERENCES:
1. Paul Deitel and Harvey Deitel, “Python for Programmers”, Pearson Education, 1st Edition, 2021.
2. G Venkatesh and Madhavan Mukund, “Computational Thinking: A Primer for Programmers and
Data Scientists”, 1st Edition, Notion Press, 2021.
3. John V Guttag, "Introduction to Computation and Programming Using Python: With Applications
to Computational Modeling and Understanding Data”, Third Edition, MIT Press, 2021
4. Eric Matthes, “Python Crash Course, A Hands - on Project Based Introduction to Programming”,
2nd Edition, No Starch Press, 2019.
5. [Link]
6. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill, 2018.
EVALUATON PATTERN:
Individual
Internal Assessments
Assignments - 2
Activity based Attendance End Semester
Internal Internal Model Examination
Assignments &
Assessment -1 Assessment -2 Exam
seminar
10 10 20 40 20 60
The total internal marks 100 shall be converted into 40 marks and rounded to the nearest integer