GE3151-PROBLEM SOLVING AND PYTHON PROGRAMMING IMPORTANT QUESTIONS

  • COURSE OBJECTIVES:
  • To understand the problem solving approaches.
  • To learn the basic programming constructs in Python.
  • To practice various computing strategies for Python-based solutions to real world problems.
  • To use Python data structures – lists, tuples, dictionaries.
  • To do input/output with files in Python

UNIT I COMPUTATIONAL THINKING AND PROBLEM SOLVING
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, insert a
card in a list of sorted cards, guess an integer number in a range, Towers of Hanoi.


UNIT II DATA TYPES, EXPRESSIONS, STATEMENTS
Python interpreter and interactive mode,debugging; values and types: int, float, boolean, string
, and list; variables, expressions, statements, tuple assignment, precedence of operators,
comments; Illustrative programs: exchange the values of two variables, circulate the values of n
variables, distance between two points.

UNIT III CONTROL FLOW, FUNCTIONS, STRINGS
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
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, histogram,
Students marks statement, Retail bill preparation.


UNIT V FILES, MODULES, PACKAGES
Files and exceptions: text files, reading and writing files, format operator; command line
arguments, errors and exceptions, handling exceptions, modules, packages; Illustrative programs:
word count, copy file, Voter’s age validation, Marks range validation (0-100)

UNIT-1

★ Building block of algorithm
★ Tower of Hanoi
★ Flowchart deatail
★ Algorithm pseudocode deatail
★ Illustrative program

UNIT-2

★Value and data types
★ Interpretor
★ Operators
★ Illustrative program

UNIT-3

★ Decision making & Condition
★ Iteration-looping
★ Strings
★ Illustrative program

UNIT-4

★ List
★ Tuple
★ Selection and insertion sort
★ Illustrative program

UNIT-5

★ Files
★ Handaling exception
★ Illustrative program

Leave a Reply

Your email address will not be published. Required fields are marked *

error: Content is protected !!