Python
Core Exam Topics (from syllabus + past papers)
These are the areas that repeatedly appear and are central to your curriculum:
1. Python Fundamentals
o Tokens, variables, data types, operators, expressions
o Control statements (if, while, for, nested loops)
o Difference between compiled vs interpreted languages
2. Data Structures
o Strings: slicing, indexing, methods (split(), join(), formatting)
o Lists: mutable nature, methods, slicing, sorting
o Tuples: immutability, operations
o Dictionaries: key-value pairs, methods, comparison with lists
3. Functions & Scope
o Function arguments (default, keyword, variable-length)
o Recursive functions (Fibonacci, sum of nested lists)
o Lambda functions
o Global keyword and scope rules
4. Modules & Packages
o Creating and using modules
o Difference between module and package
o Namespaces
5. File Handling & Exceptions
o Text vs binary files
o File object methods (read(), readline(), write(), seek(), tell())
o Exception handling (try, except, finally)
6. Object-Oriented Programming
o Classes, objects, attributes
o Inheritance (types: single, multiple, multilevel, hierarchical, hybrid)
o Encapsulation vs abstraction
o Built-in functions for classes and instances
7. Algorithms
o Sorting: bubble sort, selection sort, merge sort
o Prime number generation
o Time complexity comparisons
High-Probability Exam Questions
Based on the overlap of syllabus + past papers:
• Short Answer (Section A style):
o Define tokens and types.
o Difference between list and tuple.
o Explain slicing with example.
o Purpose of global keyword.
o Common built-in exceptions.
o Applications of Python.
• Medium Answer (Section B style):
o Differentiate mutable vs immutable objects.
o Types of function arguments with examples.
o Recursive Fibonacci function.
o Explain abstraction vs encapsulation with code.
o String methods (split, join) and immutability.
• Long Answer / Program (Section C/D style):
o Bubble sort passes (step-by-step).
o Program to check palindrome number.
o Swap two numbers without temp variable.
o File handling program: count digits/letters in input string and write to file.
o Program to capitalize all input lines.
o Compare lists vs dictionaries with examples.
Smart Prep Strategy
• Section A → Memorize definitions + 1-line examples (tokens, slicing, tuple vs list).
• Section B → Practice writing short programs (reverse number, recursive sum, lambda).
• Section C/D → Focus on sorting algorithms, file handling, recursion, OOP concepts — these
are the “big marks” questions.
• Cross-check with syllabus → Every unit has appeared in past papers, so balance theory + coding.
Python Programming Exam Prep Guide
This guide synthesizes your syllabus and past exam papers into a focused revision plan.
Unit I – Fundamentals
• Tokens: Keywords, identifiers, literals, operators, delimiters.
• Variables & Data Types: int, float, str, list, tuple, dict, set.
• Operators: Arithmetic, relational, logical, bitwise, assignment.
• Control Statements: if, if-else, nested if, while, for, nested loops.
Likely Questions:
• Define tokens and types.
• Difference between compiled vs interpreted languages.
• Write a loop to print numbers 0–57.
• Applications of Python.
Unit II – Objects
• Strings: Slicing, indexing, immutability, methods (split(), join(), upper()).
• Lists: Mutable, slicing, methods (append(), remove(), sort()).
• Tuples: Immutable, operations, built-in functions.
• Dictionaries: Key-value pairs, methods (keys(), values(), items()).
Likely Questions:
• Differentiate mutable vs immutable objects.
• Explain slicing with example.
• Compare lists and dictionaries.
• String immutability with example.
Unit III – Functions & Modules
• Functions: Defining, calling, recursion, lambda, scope, global keyword.
• Arguments: Positional, keyword, default, variable-length.
• Modules & Packages: Creating, importing, namespaces.
Likely Questions:
• Types of function arguments with examples.
• Recursive Fibonacci function.
• Lambda function characteristics.
• Difference between module and package.
Unit IV – File & Exception Handling
• File Handling: Text vs binary files, modes (r, w, a, rb, wb).
• File Methods: read(), readline(), readlines(), write(), seek(), tell().
• Exception Handling: try, except, finally, raising exceptions.
Likely Questions:
• Program to count digits/letters in string and write to file.
• Explain text vs binary files.
• Purpose of finally block.
• Library functions for file I/O.
Unit V – Classes & OOP
• Classes & Objects: Attributes, methods, self parameter.
• Inheritance: Single, multiple, multilevel, hierarchical, hybrid.
• Encapsulation vs Abstraction: Differences with examples.
• Built-in Functions: isinstance(), issubclass(), getattr(), setattr().
Likely Questions:
• Explain inheritance and its types.
• Program demonstrating abstraction vs encapsulation.
• Built-in functions for classes and instances.
Algorithms & Problem Solving
• Sorting: Bubble sort, selection sort, merge sort.
• Prime Numbers: Algorithm and Python code.
• Time Complexity: Compare algorithms.
Likely Questions:
• Bubble sort passes till 3rd iteration.
• Program to implement merge sort.
• Selection sort simulation.
• Prime number generation algorithm.
High-Yield Practice Programs
1. Reverse a number and sum digits.
2. Swap two numbers without temp variable.
3. Palindrome number check.
4. Capitalize all input lines.
5. Recursive sum of nested lists.
Exam Strategy
• Section A: Memorize definitions + short examples.
• Section B: Practice small programs (reverse, recursion, lambda).
• Section C/D: Focus on sorting, file handling, recursion, OOP.
Key Tip: Balance theory with coding practice. Write and run each program at least once to ensure
fluency.