Lecture Notes || SNS Courseware

293

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)

algorithmic problem solving

simple strategies for developing algorithms (iteration, recursion)

Illustrative problems: find minimum in a list

guess an integer number in a range

Towers of Hanoi.

UNIT 2:

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

Python interpreter and interactive mode, debugging

variables, expressions, statements

tuple assignment and Example

variables, expressions, statements

precedence of operators, comments

variables, expressions, statements

UNIT 3:

local and global scope, function composition, recursion

Conditionals: Boolean values and operators

conditional (if), alternative (if-else),chained conditional (if-elif & else);Iteration: stat

while, for, break, continue, pass

Fruitful functions: return values, parameters

Strings: string slices, immutability, string functions and methods, string module

linear search

binary search

Lists as arrays. Illustrative programs: square root, gcd, exponentiation, sum an array of numbers

Announcements

Recent Files

Mar

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

Mar

Building blocks of algorithms (statements, state, control flow, functions)

Mar

notation (pseudo code, flow chart, programming language)

Mar

algorithmic problem solving

Mar

simple strategies for developing algorithms (iteration, recursion)

Mar

Illustrative problems: find minimum in a list

Lecture Notes

Announcements

Recent Files

Copyright © SNS College Of Engineering 2014 Developed bySNSCE