(SEM III) THEORY EXAMINATION 2022-23 PYTHON PROGRAMMING

This question paper is a comprehensive examination designed to evaluate a student's understanding of Python programming fundamentals, control structures, data structures, object-oriented programming concepts, functions, file handling, and algorithmic problem-solving. The paper is divided into three sections: A, B, and C, guiding the student from basic conceptual knowledge to moderate analytical questions and finally to advanced applications of Python.

SECTION A – Short Questions (10 Marks)

This section contains ten brief questions, each worth 1 mark, focusing on essential Python concepts. These questions are designed to quickly assess the student’s theoretical knowledge and basic understanding.

Topics include:

Python Programming Cycle – highlighting how Python programs are written, compiled/interpreted, executed, and debugged.

List Slicing – an important Python data manipulation technique with indexing.

Module Importing – understanding import, from … import, and alias usage.

Difference between Python Lists and Arrays – touching on mutability, data types, and use-cases.

Floor Division – using // operator with examples.

Difference between append() and extend() – essential for list operations.

Python Dictionary – definition and usage of key-value pairs.

Object-Oriented Programming (OOP) – including classes, objects, and example snippets.

Two code-based output questions checking understanding of:

Vowel counting using loops and conditionals

String join() function to join list elements

This section tests precision, clarity of concepts, and memory of Python syntax.

SECTION B – Descriptive & Coding Questions (15 Marks)

Students must attempt any three questions, each worth 5 marks.
This section examines the student’s ability to apply Python logic, write programs, demonstrate concepts, and analyze the flow of control.

Topics covered:

1. String Built-in Functions & Palindrome Program

Students must demonstrate five string functions (e.g., upper(), lower(), replace(), split(), strip()) and write code to check whether a string reads the same backward and forward.

2. For and While Loops (Flow Diagrams, Syntax, Examples)

Emphasizes understanding of iteration, logic flow, and proper loop construction.

3. Continue, Break, Pass Statements

Tests the ability to control loop execution and understand when to skip iterations, exit loops, or leave placeholder blocks.

4. Reverse Number Program

A classic logic-building exercise using loops or string conversion.

5. List Comprehension

Conceptual and practical demonstration of Python’s most concise list-building technique.

This section ensures students are comfortable with programming logic, flow control, and real code execution.

SECTION C – Advanced Python Concepts (25 Marks)

This section contains five higher-order questions, each offering two internal choices. Students must attempt one part per question. Each carries 5 marks, making this section crucial for scoring.

This section tests deep understanding and application of Python concepts.

Q3 – Sequence Handling OR Lambda Functions

Part (a): Students must explain

Unpacking Sequences

Mutable Sequences

List Comprehension
with examples.

Part (b): Students explain

Lambda Functions

Their role in higher-order functions

Use of map() function with example

This tests understanding of functional programming concepts.

Q4 – Argument Passing OR OOP Concepts

Part (a): Explanation of different argument types:

Positional

Keyword

Default

Variable-length (*args, **kwargs)
with examples.

Part (b): Students write short notes on:

Encapsulation (data hiding using classes)

Inheritance (code reusability)
with examples.

This question tests function flexibility and OOP fundamentals.

Q5 – File Handling OR Prime Number Algorithm

Part (a): Tests practical skills of:

Creating files

Writing data

Reading data

Displaying output

Part (b): Students must explain the Sieve of Eratosthenes and write a Python program to print primes from 1 to 100.

This section checks algorithmic thinking and Python I/O operations.

Q6 – Sorting OR Searching Algorithms

Part (a): Students write and explain Selection Sort, including complexity analysis.
Part (b): Students must explain Binary Search, give code, and analyze time complexity.

This tests understanding of basic data structures and algorithms.

Q7 – Exception Handling OR Recursion (Tower of Hanoi)

Part (a): Students explain importance of exception handling, the use of try, except, finally with examples.

Part (b): Students explain the Tower of Hanoi puzzle along with its recursive Python function.

This section tests error-handling, recursion, and logical reasoning.

OVERALL PURPOSE OF THE PAPER

This exam evaluates a student’s:

Core Python fundamentals

Data structures (lists, dictionaries, sequences)

Control flow understanding

Ability to write and analyze Python programs

Use of functions, arguments, loops, and conditionals

Knowledge of OOP concepts

Real-world coding skills (file handling, sorting, searching)

Logic building using recursion and algorithms

Strength in problem-solving and coding accuracy

The paper ensures students have both theoretical knowledge and practical programming ability, making it suitable for diploma, BCA, B.Tech, or introductory Python programming courses.