UNITS 
COURSE MATERIALS & VIDEOS 
UNIT I 
ALGORITHMIC PROBLEM SOLVING 
1.1 Algorithms 


1.1 Algorithms 

1.2 Building Blocks Of Algorithms 


1.2 Building Blocks Of Algorithms 

1.3 Notation Pseudo Code, Flow Chart 


1.3 Notation Pseudo Code, Flow Chart 

1.4 Notation  Programming Language 


1.4 Notation  Programming Language 

1.5 Algorithmic Problem Solving 


1.5 Algorithmic Problem Solving 

1.6 Simple Strategies for Developing Algorithms (Iteration, Recursion) 


1.6 Simple Strategies for Developing Algorithms (Iteration, Recursion) 

1.7 Illustrative problems: find minimum in a list, insert a card in a list of sorted cards 


1.7 Illustrative problems: find minimum in a list, insert a card in a list of sorted cards 

1.8 Illustrative problems: guess an integer number in a range, Towers of Hanoi 


1.8 Illustrative problems: guess an integer number in a range, Towers of Hanoi 


UNIT II 
DATA, EXPRESSIONS, STATEMENTS 
1.1 Python Interpreter and Interactive Mode 


1.1 Python Interpreter and Interactive Mode 

1.2 Values and Types: Int, Float, Boolean, String, and List 


1.2 Values and Types: Int, Float, Boolean, String, and List 

1.3 Variables, Expressions, Statements, Tuple Assignment, Precedence of Operators, Comments 


1.3 Variables, Expressions, Statements, Tuple Assignment, Precedence of Operators, Comments 

1.4 Functions, Function Definition and Use, Flow of Execution 


1.4 Functions, Function Definition and Use, Flow of Execution 

1.5 Parameters and Arguments 


1.5 Parameters and Arguments 

1.6 Modules 


1.6 Modules 

1.7 Illustrative Programs 


1.7 Illustrative Programs 


UNIT III 
CONTROL FLOW, FUNCTIONS 
1.1 Boolean Values and Operators 


1.1 Boolean Values and Operators 

1.2 Conditional (if), alternative (ifelse), chained conditional (ifelifelse) 


1.2 Conditional (if), alternative (ifelse), chained conditional (ifelifelse) 

1.3 Iteration: state, while, for, break, continue, pass 


1.3 Iteration: state, while, for, break, continue, pass 

1.4 Fruitful functions: return values, parameters, local and global scope, function composition, recursion 


1.4 Fruitful functions: return values, parameters, local and global scope, function composition, recursion 

1.5 Strings: string slices, immutability, string functions and methods, string module, Lists as arrays 


1.5 Strings: string slices, immutability, string functions and methods, string module, Lists as arrays 

1.6 Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary search. 


1.6 Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary search. 


UNIT IV 

UNIT V 
