Lecture Notes || SNS Courseware

Subject Details

Dept : IT

Sem : 1

Regul : 2019

Faculty : sivagami R

phone : NIL

E-mail : sivagami.r.ad@snsce.ac.in

426

Page views

Files

Videos

R.Links

Lecture Notes

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)

simple strategies for developing algorithms (iteration, recursion)

UNIT 2:

Python interpreter and interactive mode

debugging; values and types: int, float, boolean, string and list

variables, expressions, statements

precedence of operators, comments

Illustrative programs

UNIT 3:

conditional (if), alternative (if-else),chained conditional (if-elif-else);

Fruitful functions: return values, parameters

while, for, break, continue, pass

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

Tuples: tuple assignment, tuple as return value

Dictionaries: operations and methods

Illustrative programs

UNIT 5:

Files and exceptions

modules, packages

Illustrative programs: word count

handling exceptions

Announcements

Recent Files

Feb

Fundamentals of Computing – Identification of Computational Problems -...

Feb

building blocks of algorithms (statements, state, control flow...

Feb