GE3151 Problem Solving and Python Programming Previous Year Question Papers - Anna University
Master problem-solving methodology and Python programming with Anna University GE3151 previous year question papers. This foundational subject covers algorithms, flowcharts, data structures, and coding fundamentals across five units. Use our comprehensive PYQs (Regulation 2021) to practice unit-wise questions, understand coding patterns, and prepare confidently for theory and programming components in your exams.
2024
-
2024 - GENERAL-AM-2024-GE 3151-Problem Solving and Python Programming-843182274-51225.pdf
2023
-
2023 - SH-AM-2023-GE 3151-Problem Solving and Python Programming-843035503-20230926191457 (2).pdf
-
2023 - SH-ND-2023-GE 3151-Problem Solving and Python Programming-122298649-21184.pdf
2022
-
2022 - GENERAL-AM-2022-GE 3151-Problem Solving and Python Programming-289488130-GE 3151.pdf
-
2022 - SH-ND-2022-GE 3151-Problem Solving and Python Programming-832279259-ND22SH (2).pdf
Important Questions - GE3151 Problem Solving and Python Programming
UNIT 1
Theory
- Explain steps in problem solving methodology.
- What is an algorithm? Write characteristics of a good algorithm.
- Define flowchart. Explain standard symbols with diagram.
- Compare algorithm vs flowchart.
- Explain top-down approach with example.
Programs / Problem Solving
- Write algorithm & flowchart for: Finding largest of three numbers, Factorial of a number, Sum of n numbers.
- Solve Tower of Hanoi problem (logic + steps).
- Trace given algorithm and find output.
UNIT 2
Theory
- Explain data types in Python.
- Define operators and explain types (arithmetic, relational, logical).
- Explain operator precedence and associativity.
- What is type casting?
- Explain input and output functions in Python.
Programs
- Write program for: Arithmetic operations using input, Swap two numbers (with & without temp), Simple interest / area calculations.
- Evaluate given expressions based on precedence.
- Predict output of Python expressions.
UNIT 3 (VERY IMPORTANT – Mixed Theory + Coding)
Theory
- Explain conditional statements (if, if-else, elif) with syntax.
- Explain nested if statement with example.
- Define iterative statements. Explain: for loop, while loop.
- Differentiate for vs while loop.
- Explain break, continue, pass statements.
- What is an infinite loop?
Programs
- Write program to: Find largest of 3 numbers using if-else, Check even/odd / prime number, Generate multiplication table, Find sum of digits, Reverse a number.
- Loop-based programs: Factorial using loop, Fibonacci series, Pattern printing.
- Predict output for loop + condition based code.
UNIT 4 (VERY HIGH WEIGHTAGE)
Theory
- Explain list in Python and its characteristics.
- Explain list functions: append(), insert(), remove(), pop(), sort().
- Compare list vs tuple vs dictionary.
- Explain dictionary and its operations.
- Explain tuple properties and uses.
Programs
- Write program to: Perform list operations (add, delete, sort), Find sum / max / min in list, Sort list in ascending/descending.
- Dictionary programs: Store and display student data, Count frequency of elements.
- Programs using tuple.
- Predict output of list/dictionary operations.
UNIT 5
Theory
- Define exception handling.
- Explain try, except, finally blocks.
- Types of errors in Python.
- Explain file handling concepts.
- List different file opening modes.
Programs
- Write program using: try-except for division error, multiple exception handling.
- File programs: Read and write file, Count words / lines in file, Append data to file.
- Predict output of exception handling code.
PART C (COMPULSORY – VERY IMPORTANT)
Case study → Write: Algorithm, Python program, Output OR Write a complete program combining: Condition + loop + list/dictionary + file handling.
Additional Resources
How to Use These Question Papers
- Unit-Wise Preparation: Complete Unit 1-2 for theory foundation, dedicate 40% of time to Units 3-4 (most frequent in exams).
- Code Practice: Write all Python programs from scratch; don't just read—compile and run them locally to understand execution.
- Algorithm & Flowchart: Practice drawing flowcharts for each program to strengthen problem-solving methodology.
- Predict Output Questions: These appear frequently—solve 10-15 such problems per week to build pattern recognition.
- Time Management: Allocate 60-90 minutes per program; practice Part C case studies under timed conditions (150 minutes).
Frequently Asked Questions about GE3151 Question Papers
What topics should I prioritize in GE3151 exam preparation?
Allocate 40% of preparation time to Units 3-4 (conditional statements, loops, data structures) as they appear most frequently. Units 1-2 cover foundational theory (algorithms, Python basics) essential for understanding. Unit 5 (exception handling, file operations) is important for practical programs.
How should I approach predict output questions in GE3151?
Trace the code line-by-line manually, tracking variable values at each step. Pay special attention to loop conditions, operator precedence, and list/dictionary operations. Practice 10-15 such problems weekly to build pattern recognition and speed.
Is memorizing code enough to pass GE3151?
No. GE3151 requires understanding problem-solving methodology and hands-on coding practice. Write all programs from scratch, compile, and run them locally. Draw flowcharts for each program to strengthen conceptual understanding required for both theory and practical exams.
What is the Part C case study typically about in GE3151?
Part C requires a complete program combining multiple concepts: conditions + loops + data structures (list/dictionary) + file handling. You must provide algorithm, Python code, and sample output. Time allocation: 150 minutes for this section during exams.
Which Python concepts appear in almost every GE3151 exam?
List operations (append, remove, sort), dictionary programming (storing data, counting frequency), loops (for/while), and conditional statements (if-else) are mandatory. Exception handling and file operations also appear regularly in Part B and Part C sections.
How can I score well in GE3151 theory portions?
Master problem-solving steps, algorithm characteristics, and flowchart symbols from Unit 1. Practice writing pseudocode and flowcharts for all programs. Understand differences: for vs while loops, lists vs tuples vs dictionaries. These theory concepts frequently appear in Part A questions.