0% found this document useful (0 votes)
227 views

Python Programming Theory

This document provides an overview of the syllabus for a Python Programming course. The syllabus is divided into 5 units that cover topics like Python basics, conditionals and loops, functions, strings, lists, tuples, dictionaries, file input/output, classes and inheritance. It also lists 8 recommended textbooks for the course that provide guidance on learning Python programming. The syllabus is mapped to an online course on practical Python programming.

Uploaded by

Sanjay Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
227 views

Python Programming Theory

This document provides an overview of the syllabus for a Python Programming course. The syllabus is divided into 5 units that cover topics like Python basics, conditionals and loops, functions, strings, lists, tuples, dictionaries, file input/output, classes and inheritance. It also lists 8 recommended textbooks for the course that provide guidance on learning Python programming. The syllabus is mapped to an online course on practical Python programming.

Uploaded by

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

\

Text books:

1. William Stallings, Network Security Essentials: Applications and Standards, Prentice Hall, 4th edition, 2010.

2. Michael T. Goodrich and Roberto Tamassia, Introduction to Computer Security, Addison Wesley, 2011.

3. William Stallings, Network Security Essentials: Applications and Standards, Prentice Hall, 4th edition, 2010.

4. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press,
2001.

Mapped With : https://ict.iitk.ac.in/product/computer-system-security/

PYTHON PROGRAMMING
Course Outcome ( CO) Bloom’s Knowledge Level (KL)

At the end of course , the student will be able to understand


To read and write simple Python programs.
CO 1 K1, K2
To develop Python programs with conditionals and loops.
CO 2 K2, K4
To define Python functions and to use Python data structures –- lists, tuples, dictionaries
CO 3 K3
To do input/output with files in Python
CO 4 K2
To do searching ,sorting and merging in Python
CO 5 K2, K4

DETAILED SYLLABUS 3-1-0


Unit Topic Proposed
Lecture
Introduction: The Programming Cycle for Python , Python IDE, Interacting with Python Programs ,
Elements of Python, Type Conversion.
I 08
Basics: Expressions, Assignment Statement, Arithmetic Operators, Operator Precedence, Boolean
Expression.

Conditionals: Conditional statement in Python (if-else statement, its working and execution),
Nested-if statement and Elif statement in Python, Expression Evaluation & Float Representation.
II 08
Loops: Purpose and working of loops , While loop including its working, For Loop , Nested Loops ,
Break and Continue.
Function: Parts of A Function , Execution of A Function , Keyword and Default Arguments ,Scope
Rules.
Strings : Length of the string and perform Concatenation and Repeat operations in it. Indexing and
III
Slicing of Strings. 08
Python Data Structure : Tuples , Unpacking Sequences , Lists , Mutable Sequences , List
Comprehension , Sets , Dictionaries
Higher Order Functions: Treat functions as first class Objects , Lambda Expressions
Sieve of Eratosthenes: generate prime numbers with the help of an algorithm given by the Greek
Mathematician named Eratosthenes, whose algorithm is known as Sieve of Eratosthenes.
File I/O : File input and output operations in Python Programming
Exceptions and Assertions
IV Modules : Introduction , Importing Modules , 08
Abstract Data Types : Abstract data types and ADT interface in Python Programming.
Classes : Class definition and other operations in the classes , Special Methods ( such as _init_,
_str_, comparison methods and Arithmetic methods etc.) , Class Example , Inheritance , Inheritance
and OOP.

Iterators & Recursion: Recursive Fibonacci , Tower Of Hanoi


Search : Simple Search and Estimating Search Time , Binary Search and Estimating Binary Search
V 08
Time
Sorting & Merging: Selection Sort , Merge List , Merge Sort , Higher Order Sort

Text books:
1. Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist‘‘, 2nd edition, Updated for Python 3,
Shroff/O‘Reilly Publishers, 2016 (http://greenteapress.com/wp/thinkpython/)
2. Guido van Rossum and Fred L. Drake Jr, ―An Introduction to Python – Revised and updated for Python 3.2, Network
Theory Ltd., 2011.
3.John V Guttag, ―Introduction to Computation and Programming Using Python‘‘, Revised and expanded Edition, MIT
Press , 2013
4.Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming in Python: An Inter-disciplinary
Approach, Pearson India Education Services Pvt. Ltd., 2016.
5.Timothy A. Budd, ―Exploring Python‖, Mc-Graw Hill Education (India) Private Ltd.,, 2015.
6.Kenneth A. Lambert, ―Fundamentals of Python: First Programs‖, CENGAGE Learning, 2012.
7.Charles Dierbach, ―Introduction to Computer Science using Python: A Computational ProblemSolving Focus, Wiley
India Edition, 2013.
8.Paul Gries, Jennifer Campbell and Jason Montojo, ―Practical Programming: An Introduction to Computer Science
using Python 3‖, Second edition, Pragmatic Programmers, LLC, 2013.
Mapped With : https://ict.iitk.ac.in/product/python-programming-a-practical-approach/

You might also like