[go: up one dir, main page]
Scribd
Upload
31 views2 pages

31 - Ecse105l - Computational Thinking and Programming

Uploaded by

sarvankumarnagarampalli478
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
31 views2 pages

31 - Ecse105l - Computational Thinking and Programming

Uploaded by

sarvankumarnagarampalli478
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

Name of Program Bachelor of Technology (BT/CSE/ECE/EP/ME)

IILITIPIC
ECSE105L Computational Thinking and Programming
Owning School/Department Department of Computer Science Engineering 2 I 1 14 IS
Pre-requisites/Exposure -

Course Outcomes {COs)


On completion of this course, the students will be able to:

COi: Solve given problem in Python by using standard programming constructs.


CO2: Build programs using the features of object-oriented programming languages.
CO3: Make use of Python inbuilt APls to write functions.

CO-PO/PSO Mapping

PO PO PO PO PO PO PO PO PO POI POI POI PSO PSO PSO


I 2 3 4 5 6 7 8 9 0 I 2 I 2 3
co 3 2 3 2 2 3
I
co 2 2 3 2 3 2 I 2
2
co 3 3 3 2 3 2 2
3

I =weakly related 2= moderately related 3=strongly related

Course Contents:

Module I: 08 lecture hours

Why Python, Applications of Python, Versions of Python, Number system, Binary, Octal, Literals,
Variables, Data types, Operators, Control Structures if/else/elif, Nested if/else. Lists/Nested Lists,
Tuple.

Module II: 10 lecture hours

Iterative Control, while loop, For loop, Range, Break, Continue, Pass, Nested Loops, Loop inside if,
List Operations, List comprehension, Membership operator. Functions, Default argument. required
arguments, keyword argument, variable arguments, Function invoking, Nested functions, Lambda
functions, Map Reduce, Recursive Functions, Factorial, GCD using Euclid Algorithm. Dictionary
Operations, Sets, Enumerators.

Module III: 10 lectures hours

String Operations, Slicing, File Handling. Exception Handling, Modules, Namespaces, Local. Global,
and Built-in Namespaces, Object Oriented Programming, Classes and Objects, Encapsulation, Data
abstraction, Inheritance, Polymorphism. Interactive Graphics, Displaying Images, Generating Colors.
Graphics Objects, Entry Objects, Turtle, Tkinter, Working with Widgets, Controlling Layout with
Geometry Managers, Events and Event Handlers. Developing Interactive applications.

Studio Work/Laboratory Experiments:


The lab component of this course is designed to introduce online-coding tools such as
Microsoft Azure, Colab to the students and provide hands-on experience with the concepts
taught in the lectures.

Text Books:
1. Dierbach, Charles. Introduction to computer science using python: A computational problem­
solvingfocus. Wiley Publishing, 2012. ISBN 9789332584686.

Reference Books :
1. Martinez, D. and Jesus, S. D, Applied Computational Thinking with Python: Design
Algorithmic Solutions/or Complex and Challenging Real-world Problems. Packt Publishing,
2021. ISBN 89351507314.

Assessment Scheme:

Components Internal Assessment Mid Term Exam End Exam Total

) Weightage (%) 65% 0% 35% 100%

Re /yr r
Be�;rLniversity, Gre r Neida
(Estab11sh� Under Act 24 of Govt, ofate
Uttar Pradesh)
Plot Nos 8, 9, 1 o, 11, Tech Zone-II
Gre ater Noida-20131 o

You might also like