SECTION A — What This Section Covers
Section A contains 10 short, 2-mark questions checking the student’s basic understanding of Python fundamentals.
Topics include the Python programming cycle, use of __init__(), features of IDEs, loop control statements (break, continue), mutable sequences, nested loop output, special methods (__le__, __ne__), file modes, exception-handling terms (assert, try-except, raise), and writing a simple Python function (linear search).
This section tests whether the student understands core Python concepts, syntax behaviour, OOP basics, file handling, and simple function writing.
SECTION B — What This Section Covers
Section B has any three 10-mark questions, focusing on coding, explanation, and comparison of Python data structures and algorithms.
It includes writing Python code for Fibonacci (recursion), algorithm for prime number generation, comparison of list vs tuple with list comprehensions, implementation of stack ADT, and program for selection sort along with simulation on given data.
This section checks the student’s ability to write Python programs, explain logic, compare structures, and apply algorithms in Python.
SECTION C — What This Section Covers
Section C contains five long questions, each having two choices, and the student must attempt one from each.
The topics include:
Categories of Python operators with stepwise evaluation of complex expressions.
History, features, and explanation why Python is an interpreted language, along with Python 2 vs Python 3 differences.
String-based programs such as counting vowels or capitalizing multiple lines.
List and dictionary data structures with methods and examples.
Iterators, file creation, counting letters/digits into a file; or types of inheritance with static/instance/class methods.
Recursive problems such as Tower of Hanoi, or merge sort, including comparison of algorithm time complexities.
This section evaluates deeper understanding of Python programming logic, OOP concepts, recursion, file handling, inheritance, data structures, operator behaviour, and algorithm efficiency.
