SSM INSTITUTE OF ENGINEERING AND TECHNOLOGY

Dindigul – Palani Highway, Dindigul-624002.

COURSE PLAN
Duration of the
From :17.11.2021
Academic Year 2021-2022 (Odd) semester as per
To :08.03.2022
academic calendar
Name of the Department COMPUTER
SCIENCE AND Semester I
ENGINEERING
Subject Code & Name GE3151 & Total Hours
Problem Solving as per
and Python syllabus 45
Programming
Name of the Faculty with Ms. N. Anu Lavanya,
designation &department AP/CSE
Department Parent dept. Other dept.
Regular / Elective Regular Subject  -
Prerequisites Knowledge Basic Computer Knowledge

Duration One semester Credit Units : 3

Class / Laboratory Schedule 3-0-0-3[L TP C ]
OOP With Python Matching POs and PSOs
Curriculum gap/ Content beyond syllabus/
PO: 1, 2, 3
Hands-on training / Industrial Visit /Guest Lecture
PSO: 1, 2
Students are able
 To understand the basics of algorithmic
problem solving.
 To learn to solve problems using Python
conditionals and loops.
Course Objectives
 To define Python functions and use function
calls to solve problems.
 To use Python data structures - lists, tuples,
dictionaries to represent complex data.
 To do input/output with files in Python..
CO Course Outcome(s) Program Outcome(s)
Upon completion of the course, the PO 01 # Engineering knowledge
students will be able to: PO 02 # Problem analysis
CS8791.1 Develop algorithmic solutions to simple PO 03 # Design/development of solutions
computational problems. PO 04 # Conduct investigations of complex
CS8791.2 Develop and execute simple Python problems
programs. PO 05 # Modern tool usage
CS8791.3 Write simple Python programs using PO 06 # The engineer and society
conditionals and looping for solving PO 07 # Environment and sustainability
problem and decompose a Python PO 08 # Ethics
program into functions. PO 09 # Individual and team work
CS8791.4 Represent compound data using Python PO 10 # Communication
lists, tuples, dictionaries etc. PO 11# Project management and finance
PO 12# Life-long learning
CS8791.5 Read and write data from/to files in
Python programs

Vision
To grow as an eminent department with excellence in computing and research by integrating
computer and information technology to develop products and services for the benefit of the society
with ethical values.

Mission
 To instill in students the urge to learn by imparting finest quality education.
 To impart good attitude and integrate creativity and research orientation
 To initiate interest and equip students to design and develop intelligent products
 To inculcate the desire to serve the society with ethical values.

Programme Educational Objectives

Graduates of Computer Science and Engineering Programme will:
PEO Program Outcome(s)
PEO.1 Able to perform in technical/managerial roles ranging from design, development and problem solving
professional in software industries and R & D laboratories by applying computer engineering theory and
principles.
PEO.2 Engage in life-long learning through successful completion of post graduate programs in engineering and
interdisciplinary areas to emerge as researchers, experts, and educators.
PEO.3 Serve society with excellence in professionalism, moral and ethical conduct, understanding of social context
and interpersonal skills.

Programme Specific Outcomes

At the end of the Programme graduate will be able to
PSO Description
PSO.1 Understand the principles of basic engineering and acquire the hardware and software aspects of
computer science and engineering.
PSO.2 Design and develop applications or products using various programming languages.
Books For Study
TEXT BOOKS:
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. https://www.python.org/
6. Martin C. Brown, “Python: The Complete Reference”, 4th Edition, Mc-Graw Hill,2018.
CO – PO& PSO Mapping:
CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO1 PSO1 PSO2
2
CS8791.1 2 1 1
CS8791.2 2 1 1
CS8791.3 3 2 1 2 1
CS8791.4 3 2 1 2 1
CS8791.5 3 2 1 2 1

Delivery and  Chalk and Board

Instruction  PPTS Assessment  Internal Assessment Tests
Methods Methods  Assignments
 Tutorials
 Collaborative Learning Activity  Anna University Examinations

Planned Cumula Text /

S. Page Executed Remar
tive Topics to be covered Ref.
No. Date Hour Nos. Date ks
Hours Book
UNIT – 1

COMPUTATIONAL THINKING AND PROBLEM SOLVING

1 17.11.21 3 1 Fundamentals of Computing R4 65

2 19.11.21 2 2 Identification of Computational 69

R4
Problems -Algorithms
Building blocks of algorithms
3 20.11.21 4 3 (statements, state, control flow, R4 74
functions)
4 23.11.21 1 4 Notation (pseudo code, flow chart, 70
R4
programming language)
5 24.11.21 3 5 Algorithmic problem solving R4 68

6 26.11.21 2 6 Simple strategies for developing R4 74

algorithms (iteration, recursion)
7 27.11.21 4 7 Illustrative problems: find minimum in T1 118
a list
8 30.11.21 1 8 Insert a card in a list of sorted cards T1 92
9 01.12.21 3 9 Guess an integer number in a range T1 93
10 03.12.21 2 10 Towers of Hanoi T1 93
UNIT – 2

DATA TYPES, EXPRESSIONS, STATEMENTS

1 04.12.21 4 11 Python interpreter and interactive T1 02
mode
2 07.12.21 1 12 Values and types: int, float, T1 04
boolean, string, and list
3 08.12.21 3 13 Variables , expressions T1 09
4 10.12.21 2 14 Statements T1 10
5 11.12.21 4 15 Tuple assignment T1 10
6 14.12.21 1 16 Precedence of operators, comments T1 12

7 15.12.21 3 17 Illustrative programs: exchange the T1 116

values of two variables
 8 17.12.21 2 18 Circulate the values of n variables T1 60
9 18.12.21 4 19 Distance between two points T1 60
UNIT – 3

CONTROL FLOW, FUNCTIONS, STRINGS

1 1 20 Conditionals: Boolean values and T1 39
21.12.21
operators
2 22.12.21 3 21 Conditional (if), alternative (if-else), T1 40
chained conditional (if-elif-else)
3 24.12.21 2 22 Iteration: state, while, for, break, T1 64
continue, pass
4 28.12.21 1 23 Fruitful functions: return values, T1 64
parameters
5 29.12.21 3 24 Local and global scope, function T1 17,43
composition
6 31.12.21 2 25 Recursion T1 43
Strings: string slices, immutability, string
7 04.01.22 1 26 functions and methods, string module; T1 73,75
Lists as arrays
8 05.01.22 3 27 Revision – Part A & B -
9 08.01.22 1,2 28 Internal test – 1 -

10 11.01.22 1 29 Illustrative programs: square root, gcd, T1 3

exponentiation
11 12.01.22 3 30 Sum an array of numbers, linear search T1 3,126
12 19.01.22 3 31 Binary search. T1 126
UNIT – 4
LISTS, TUPLES, DICTIONARIES
1 21.01.22 2 32 Lists: list operations, list slices, list T1 89
methods, list loop
2 22.01.22 4 33 Mutability , aliasing, cloning lists, list T1 97
parameters
3 25.01.22 1 34 Tuples: tuple assignment, tuple as return T1 115
value
4 28.01.22 2 35 Dictionaries: operations and methods T1 103
5 29.01.22 4 36 Advanced list processing T1 184
6 01.02.22 1 37 list comprehension T1 184
7 02.02.22 3 38 Illustrative programs: simple sorting T1 132
8 04.02.22 2 39 Illustrative programs: simple sorting, T1 134
histogram
9 05.02.22 4 40 Students marks statement, Retail bill NOTES
preparation
UNIT – 5

CLOUD TECHNOLOGIES AND ADVANCEMENTS

1 O8.02.22 1 41 Files and exception: text files T1 137
2 09.02.22 3 42 reading and writing files T1 138
3 11.02.22 2 43 format operator; command line arguments T1 138,140
4 12.02.22 4 44 errors and exceptions T1 140
5 15.02.22 1 45 handling exceptions T1 140
6 16.02.22 3 46 Modules, packages T1 140
7 18.02.22 2 47 Illustrative programs: word count T1 143
9 19.02.22 4 48 copy file, Voter’s age validation T1 143
 10 22.02.22 1 49 Marks range validation (0-100). T1 143
11 23.02.22 3 50 Revision – Part A & B -
12 01.03.22 1 51 CBS: OOP With PYTHON Notes
13 02.03.22 3 52 CBS: Notes
14 04.03.22 2 53 Revision – Question Bank Ref Material
15 05.03.22 4 54 Revision – University Question Paper Ref Material
16 08.03.22 1 55 Revision – University Question Paper Ref Material

Assessment Plan for the course

Course
S. No How measured When measured
Outcome
Based on the IA Test I, After IA Test I and Anna University
1 CS8791.1
Anna University Exam Exam
Based on the IA Test I and II, After IA Test I, II and Anna
2 CS8791.2
Anna University Exam University Exam
Based on the IA Test II, After IA Test II and Anna University
3 CS8791.3
Anna University Exam Exam
Based on Assignment III, After Assignment III and
4 CS8791.4
Anna University Exam Anna University Exam
Based on Assignment III, After Assignment III and
5 CS8791.5
Anna University Exam Anna University Exam

Internal Assessment and Assignment

Unit Test Date Assignment Date

I
Internal Assessment Test I
II
III
IV Internal Assessment Test II
V

Course Attainment Criteria

Measuring Course Outcomes attained through University Examinations

Attainment Description Correlation

Level Level
1 Range of marks: 66%-100% Substantial (3)
2 Range of marks: 33%-66% Moderate (2)
3 Range of marks: 1%-33% Low(1)

Measuring Course Outcomes attained through Internal Assessment

Attainment Description Correlation

 Level Level
1 Range of marks: 66%-100% Substantial (3)
2 Range of marks: 33%-66% Moderate (2)
3 Range of marks: 1%-33% Low(1)

Prepared by Checked by Approved by

Signature
Dr.D.SENTHIL
Name N. ANU LAVANYA Dr. V. SHUNMUGHAVEL
KUMARAN
Designation Assistant Professor HoD, CSE PRINCIPAL

Date 16.11.2021 16.11.2021 16.11.2021

Remarks if any

Completion of Completion of
Model
Unit I Unit II Unit III Unit IV Unit V Exam
/Semester
Initials of the
Head of the
Department
with date
Internal Test-1 Internal Test-2

Signature
with Date
Faculty-in-charge Head of the Department Principal