[PDF] GE8151 Problem Solving and Python Programming (PSPP) 2017 Regulation Syllabus, Notes, 2 Marks, Question Banks/Important Questions and Previous years Question Papers for Anna University Students

Last updated on Sep 4, 2023
Problem Solving and Python Programming
Syllabus
GE8151 Problem Solving and Python Programming
  • UNIT I ALGORITHMIC PROBLEM SOLVING:
    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, insert a card in a list of sorted cards, guess an integer number in a range, Towers of Hanoi.
  • UNIT II DATA, EXPRESSIONS, STATEMENTS:
    Python interpreter and interactive mode; values and types: int, float, boolean, string, and list; variables, expressions, statements, tuple assignment, precedence of operators, comments; modules and functions, function definition and use, flow of execution, parameters and arguments; Illustrative programs: exchange the values of two variables, circulate the values of n variables, distance between two points.
  • UNIT III CONTROL FLOW, FUNCTIONS:
    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, local and global scope, function composition, recursion; Strings: string slices, immutability, string functions and methods, string module; Lists as arrays. Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.
  • UNIT IV LISTS, TUPLES, DICTIONARIES:
    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, local and global scope, function composition, recursion; Strings: string slices, immutability, string functions and methods, string module; Lists as arrays. Illustrative programs: square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.
  • UNIT V FILES, MODULES, PACKAGES:
    Files and exception: text files, reading and writing files, format operator; command line arguments, errors and exceptions, handling exceptions, modules, packages; Illustrative programs: word count, copy file.
Study Materials

Notes

1NotesDownload

Question Banks/Important Questions

1QBankDownload

2 Marks

12 MarksDownload

Previous years Question Papers

1DecJan 2019Download
2Jan 2018Download
Tags: AU2017GE8151

We use Cookies

We use cookies to improve your browsing experience on our website, to analyze our website traffic, and to understand where our visitors are coming from. For more please visit our cookie policy.