UNIT 1:
Fundamentals of Computing – Identification of Computational Problems -Algorithms
building blocks of algorithms (statements, state, control flow, functions)
notation (pseudo code, flow chart, programming language)
algorithmic problem solving
simple strategies for developing algorithms (iteration, recursion)
simple strategies for developing algorithms (iteration, recursion)
Illustrative problems: find minimum in a list
insert a card in a list of sorted cards
guess an integer number in a range
UNIT 2:
Python interpreter and interactive mode, debugging
values and types: int, float, boolean, string and list;
variables, expressions, statements
precedence of operators, comments
exchange the values of two variables
circulate the values of n variables
distance between two points
UNIT 3:
local and global scope, function composition, recursion
Conditionals: Boolean values and operators
Conditionals: Boolean values and operators
conditional (if), alternative (if-else),chained conditional (if-elif-else);Iteration: state,
while, for, break, continue, pass
Fruitful functions: return values, parameters
Strings: string slices, immutability, string functions and methods, string module;
Lists as arrays. Illustrative programs: square root, gcd, exponentiation, sum an array of numbers
UNIT 4:
Lists: list operations, list slices, list methods, list loop
mutability, aliasing, cloning lists, list parameters;
Tuples: tuple assignment, tuple as return value
Dictionaries: operations and methods
advanced list processing - list comprehension;
Illustrative programs: simple sorting
UNIT 5:
Files and exceptions: text files, reading and writing files
Illustrative programs: word count, copy file, Voter’s age validation,
Marks range validation (0-100).
