Scribd
Upload
282 views5 pages

Lesson Plan For GE3151

The document describes a course on problem solving and Python programming. It outlines 5 units that will be covered over the semester, including computational thinking, data types, control flow, lists and dictionaries, and files and modules. It lists learning objectives, topics, duration and resources for each unit, as well as assignment topics, test topics, and evaluation components.

Uploaded by

neelapriya2019
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
282 views5 pages

Lesson Plan For GE3151

The document describes a course on problem solving and Python programming. It outlines 5 units that will be covered over the semester, including computational thinking, data types, control flow, lists and dictionaries, and files and modules. It lists learning objectives, topics, duration and resources for each unit, as well as assignment topics, test topics, and evaluation components.

Uploaded by

neelapriya2019
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Degree & Branch B.

E & COMPUTER SCIENCE AND ENGINEERING


Course Code GE3151
Course Title PROBLEM SOLVING AND PYTHON PROGRAMMING
Semester I
Faculty NEELAVANI S A

COURSE DESCRIPTION
 The course is designed to provide complete knowledge of Python language.
 Students will be able to develop logics which will help them to create programs,
applications in Python.
 Also by learning the basic programming constructs they can easily switch over to any other
language in future.

LEARNING OBJECTIVES
 To understand the basics of algorithmic problem solving.
 To learn to solve problems using Python conditionals and loops.
 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.
LESSON PLAN

UNIT – I COMPUTATIONAL THINKING AND PROBLEM SOLVING

S.
Topic to be covered Duration Book Ref. Sl. No. Teaching Method
No.

Fundamentals of Computing – Ref Net


Identification of Computational
1. 50 Mins PPT
Problems

50 Mins T1(65) PPT


2. Algorithms, building blocks of
algorithms
3. Notation (Pseudo code) 50 Mins R1(66-67) PPT

50 Mins R1(68-70) PPT


4. Notation (flow chart,
programming language)
5. Algorithmic problem solving 50 Mins R1(71-72) PPT

50 Mins R1(44) PPT


6. Simple strategies for developing
algorithms (iteration, recursion)
Illustrative problems: find 100 Mins RefNet PPT
7. minimum in a list, insert a card in
a list of sorted cards
8. Guess an integer number in a 50 Mins RefNet PPT
range, Towers of Hanoi

UNIT – II DATA TYPES, EXPRESSIONS, STATEMENTS

S.
Topic to be covered Duration Book Ref. Sl. No. Teaching Method
No.

1. Python interpreter and interactive 100 Mins T1(20-22) PPT


mode, debugging.
2. Values and types: int, float, 50 Mins T1(13-14) PPT
boolean, string, and list
3. Variables, expressions, 50 Mins T1(15-18) PPT

4. statements, tuple 50 Mins T1(15-18) PPT


assignment
5. Precedence of operators, comments 50 Mins T1(19,8-9) PPT

6. Illustrative programs: exchange the 50 Mins RefNet PPT


values of two variables
7. Circulate the values of n variables 50 Mins RefNet PPT

8. Distance between two points. 50 Mins RefNet PPT

UNIT – III CONTROL FLOW, FUNCTIONS, STRINGS

S.
Topic to be covered Duration Book Ref. Sl. No. Teaching Method
No.

1. Conditionals: Boolean values and 50 Mins T1(39-41) PPT


operators
2. conditional (if), alternative (if-else), 50 Mins T1(41-48) PPT
chained conditional (if-elif-else)
3. Iteration: state, while, for, break, 50 Mins T1(49-62) PPT
continue, pass
4. Fruitful functions: return values, 50 Mins T1(83,85,90- PPT
parameters, local and global scope 91,105)
5. Function composition, recursion 50 Mins T1(95) PPT

6. Strings: string slices, immutability, 50 Mins T1(106,109- PPT


string functions and methods 155,120-122)
7. String module; Lists as arrays 50 Mins T1(114) PPT

8. Illustrative programs: square root, 50 Mins T1(63) PPT


gcd
Exponentiation, sum an array of 50 Mins RefNet PPT
9. numbers, linear search, binary
search

UNIT – IV LISTS, TUPLES, DICTIONARIES

S.
Topic to be covered Duration Book Ref. Sl. No. Teaching Method
No.

1. Lists: list operations, list slices 50 Mins T1(133-136) Chalk& Talk

2. List methods 50 Mins T1(142-143) Chalk& Talk

3. List loop, mutability 50 Mins T1(68,137) Chalk& Talk

4. List aliasing, cloning lists, list 50 Mins T1(139-141) Chalk& Talk


parameters
5. Tuples: tuple assignment, tuple as 50 Mins T1(129-131) Chalk& Talk
return value
6. Dictionaries: operations and 50 Mins T1(151-154) Chalk& Talk
methods
7. Advanced list processing - list 50 Mins T1(143) Chalk& Talk
comprehension
8. Illustrative programs: simple 50 Mins RefNet Chalk& Talk
sorting, histogram
9. Students marks statement, Retail 50 Mins RefNet Chalk& Talk
bill preparation.

UNIT – V FILES, MODULES, PACKAGES

S.
Topic to be covered Duration Book Ref. Sl. No. Teaching Method
No.

1. Files and exception: text files, 100 Mins T1(167-170) Chalk& Talk
reading and writing files
2. format operator; command line 50 Mins T1(170) Chalk& Talk
arguments
3. Errors and exceptions 100 Mins T1(255-256) Chalk& Talk

4. Handling exceptions 50 Mins T1(257-258) Chalk& Talk

5. Modules 50 Mins T1(175-181) Chalk& Talk

6. Packages 50 Mins T1(183) Chalk& Talk


Illustrative programs: word count, 50 Mins RefNet Chalk& Talk
7. copy file, Voter’s age validation,
Marks range validation (0-100).

ASSIGNMENT TOPICS
S. No TOPIC
1 Conditionals
2 Functions
3 Lists
4 Sorting
5 Python Modules and Packages.

TEST TOPICS

S. No TOPIC

Test I Algorithmic problem solving, Data types, Expressions and Statements.

Test II Control flow, Functions, Lists, Tuples, Dictionaries, File Modules and Packages.

All tests are compulsory and will be considered for calculating the continuous assessment marks.
Tests will not be postponed under normal conditions.
EVALUATION COMPONENTS

SNo COMPONENTS MARKS

1 TESTS 25

2 FINAL EXAMINATION 75

TOTAL 100

TEXT BOOKS AND EXTRA REFERENCES


PUBLISHER /
S.No TITLE AUTHOR YEAR
EDITION

Think Python: How to


1. Shroff/O‘Reilly
Think Like a Computer Allen B. Downey 2016
Publishers/2nd edition
Scientis

2. Guido van Rossum


An Introduction to Python Network Theory Ltd 2011
and Fred L. Drake Jr

Introduction to Computation Revised and


3. and Programming Using John V Guttag expandedEdition, MIT 2013
Python Press
Introduction to Programming Robert Sedgewick, Pearson India
4. in Python: An Inter- Kevin Wayne, Robert Education Services 2016
disciplinary Approach Dondero Pvt. Ltd.
Mc-Graw Hill
5. Exploring Python Timothy A. Budd Education (India) 2015
Private Ltd.

6. Fundamentals of Python: First


Kenneth A. Lamber CENGAGE Learning 2012
Programs
Introduction to Computer
7. Science using Python: A
Charles Dierbach Wiley India Edition 2013
Computational Problem-
SolvingFocus
Practical Programming: An Paul Gries, Jennifer Second edition,
8. Introduction to Campbell and Jason Pragmatic 2013
ComputerScience using Python Montojo Programmers, LLC

Course Instructor Head of the Department

You might also like