About this previous year paper
This is the B.Tech Semester III theory examination paper for Python Programming (KNC302).
The exam carries 50 marks and tests a student’s understanding of core Python concepts, data structures, control flow, functions, recursion, file handling, modules, searching & sorting, ADTs, and basic problem-solving using Python.
The paper is divided into three sections – A, B, and C, containing conceptual, descriptive, and program-based questions.
SECTION A – Short Questions (10 Marks)
Section A contains 5 short questions, each of 2 marks, covering:
Python Programming Cycle (edit → compile/interpret → execute → debug)
Output of while loop with else block
Output of Python function returning cube of a number
Interface for ADT (abstract data types)
Search operations in Python (linear search, membership operator etc.)
These test basic understanding & output prediction skills.
SECTION B – Medium-Length Questions (15 Marks)
Students must attempt any three (each 5 marks). Topics include:
Meaning & working of a Python IDE
Randomizing list items using random.shuffle()
Tuples & unpacking sequences
File input/output operations (open(), read/write modes)
Tower of Hanoi for n = 3, showing all recursive steps
This section evaluates Python concepts, data structures, recursion, and file operations.
SECTION C – Long / Program-Based Questions (25 Marks)
Students must attempt one part from each question (Q3 to Q7).
Q3 – Sorting / Interpreted Nature
Python program to perform Selection Sort
OR
Why Python is considered an interpreted language
Q4 – Pattern Printing / Fibonacci
Program to print the star pattern shown on page 1 of the file
Pattern increases 1 to 5 stars, then decreases
OR
Python program for Fibonacci series
Q5 – Strings / Tuples
Program to exchange first & last character of a string
OR
Program to add an item to a tuple
Q6 – Modules / Algorithms
How to create & import a Python module
OR
Algorithm of Sieve of Eratosthenes used to generate prime numbers
Q7 – Binary Search / Merge Operations
Recursive function BinarySearch(Arr, l, R, X)
OR
Explanation of Merge List & Merge Sort
These questions test core programming capability, recursion, logic building, algorithm knowledge, and Python modularity.