PROBLEM SOLVING USING PYIHON L TIP C
U23PPRI05 PROGRAMMING
(Common to ADS, H, CSE, CSE(AIML), CSD, CMI, BME, ECE,
EEE, MECH and MeT Branches)
3 olo 0 3
Course Outcomes
At the end of the course, the student will be able to
COI, Develop algorithmic solutions to simple computational problems
C02: Write simple Python programs
C03: Write programs with the various control statements and handling strings in Python
C04: Develop Python programs using functions and files
C05: Analyze a problem and use appropriate data structures to solve it.
Pre-requisite: NIL
CO/PO, PSO Mapping
(3/2/1 indicates the strength of correlation) 3-Strong, 2-Medium, 1-Weak
Outcomes ’SOs'
ToT mp onpol5 ononpQl8 ommp U2
COs Programme Outcomes (POs}and Proxramme @ic
POI PSOI PS02
COI 2 2 3 1 1 1
C02 2 2 3 1 1 I
C03 2 2 3 1 1 1
C04 2 3 1 1 1
C05 2 3 1 1 1
Course Assessment methods
Direct Indirect
CIE test 1 (8) Objectives Test (6)
CIE test I1 (8) Attendance (5)
CIE test III (8) Total CIE: 40 marks Course end survey
Assignment/seminar/Quiz (5) Semester End Examination (60)
nit 01: ALGORFFHMIC PROBLEM SOLVING 9 Hours
Need for computer languages, Algorithms, building blocks of algorithms (statements, state, contro1
flow, functions), notation (pseudo code, flow Chart, programming language), algorithmic problem
solvin& simple strategies for developing algorithms (iteration, recursion).
hit 02: BASICS OF PYTHON PROGRAMMING 9 Hours
Introduction-Python Interpreter-Interactive and script mode -Values and types, variables, operators,
expressions, statements, precedence of operators, Multiple assignments, comments, input function,
print function, Formatting numbers and strings, implidt/explidt type conversion.
hit 03: CONTROL STATEMENTS AND STRINGS 9 Hours
Conditional (iD, alternative (if-else), chained conditional (if-elif-else). Iteration-while, for, infinite loop,
break, continue, pass, else. Strings-String slices, immutability, string methods and operations.
4.8a>23 Versiar I.O Pn>gaarmu BE & B Tech BLE/LTKh R9lhtjoIB2023
@
P .,r .„MgkM:
PROFESSOR & HEAD
Dop8nment of Information Technology
SGNA COLLEGE OF TECHNOLOGy
q A LEM . 636 006
hit 04: FUNCriONS, FILES AND MODULES 9 Hours
Functions - Introduction, inbuilt functions, user defined functions, passing parameters - positional
argumurts, default arguments, keyword arguments, return values, local scope, global scope and
recursion. Files -Text files, reading and writing files. Modules - create – import.
Init 05: DATA STRUCFURES: LISTS, SETS, TUPLES, DIC:FIONARIES 9 Hours
Lists-aeating lists, list operations, list methods, mutability list functions, searching and sortin& Sets-
creating sets, set operations. Tuples-Tuple assignment, Operations on Tuples, lists and trIples, Tuple as
return value- Dictionaries-operationsand methods, Nested Dictionaries, Union Operation.
Theory: 45 Hn Tutorial: - I Practical: - I Project:-- } Total Hours: 45Hls
TEXr BOOKS
e ng with Python” Oxford University Press, 2"d
Edition 2023 .
a
REFERENCES
1. Ashok Namdev Kamthane, Amit Ashok Kamthane, “Programming and Problem Solving with
on” Mc-Graw Hill Education, 2018.
2. C) ing Python: A Computationa1 Problem
Solving Focus” Wiley India Edition, 2013.
3. Allen Downey, "Think Python: How to Think Like a Computw Scientist" O'Reilly Media, 2nd
Edition 2016.
4. Timothy A. Budd,” Exploring Python” Mc-Graw Hill Education (India) Private Ltd., 2015.
tir. J.'A
PROFESSOR & HEAD
n,partm8nt of InformatIon Technology
SOIIA COLLEGE OF TECHNOLOGY
S A L E M . 636 006
4.82023 Vrrsiar I.O PK)glamlnea BE & B TKh hE / LTcdr Rc8rladorB 2023
@
@
V