MASTER TASK: Deep-research exam prep for "Advanced Python Programming" (IOE / TU style).
-------------------------
1) INPUTS
-------------------------
Syllabus (ADVANCED PYTHON PROGRAMMING FOR DATA SCIENCE
ENCT 325
Course Objectives:
The objective of this course is to develop advanced proficiency in Python programming
for data science applications. It focuses on efficient coding practices, sophisticated data
manipulation, statistical analysis, and data visualization using modern Python libraries.
Students will also learn fundamental data engineering and pipeline design concepts to
automate and scale real-world data workflows.
1 Advanced Python Concepts and Best Practices (7 hours)
1.1 Review of Python essentials and coding conventions
1.2 Advanced data structures: Collections, iterators, generators, and
decorators
1.3 Functions and lambda expressions
1.4 Object-Oriented Programming for data science applications
1.5 Exception handling, debugging, and logging
1.6 Working with modules and packages
2 Data Sources and APIs (7 hours)
2.1 Reading and writing structured/unstructured data (CSV, JSON, Excel, text)
2.2 Database access with relational database and non-relational database
2.3 Accessing and processing data from APIs (REST, SOAP)
2.4 Web scraping using requests and BeautifulSoup
2.5 Handling large datasets with chunking and lazy evaluation
3 Advanced Data Wrangling and Transformation (9 hours)
3.1 Advanced Pandas operations: Merging, joining, reshaping, pivoting
3.2 Handling missing, categorical, and time-series data
3.3 Feature transformation, scaling, and encoding
3.4 Memory optimization and efficient data processing
3.5 Building a reusable data-cleaning pipeline
3.6 Introduction to data pipeline components (Ingestion, transformation,
storage)
Lecture : 3 Year : III
Tutorial : 2 Part : I
Practical : 1
4 Applied Statistics and Exploratory Analysis (7 hours)
4.1 Statistical measures: Correlation, covariance, skewness, kurtosis
4.2 Probability review, sampling, and hypothesis testing
4.3 Regression and trend analysis using stats models
4.4 Exploratory data analysis (EDA) using descriptive and inferential methods
4.5 Automation of EDA workflows using Python
5 Data Visualization and Storytelling (7 hours)
5.1 Principles of effective visualization and dashboard design
5.2 Visualization with Matplotlib: Line, bar, histogram, scatter, subplots
5.3 Seaborn for statistical visualization: Box plot, pair plot, heat map
5.4 Interactive visualization using Plotly
5.5 Visualization driven insight generation
5.6 Case study: End-to-end visualization and reporting project
6 Data Engineering and Automation (8 hours)
6.1 Overview of data engineering in applied data science
6.2 Designing and implementing ETL pipelines
6.3 Automating workflows with schedulers (CRON, schedule)
6.4 Logging, monitoring, and error handling in pipelines
6.5 Data storage and retrieval strategies for pipelines
6.6 Automated report generation (Excel, HTML, PDF)
6.7 Case study: End-to-end automated analytics pipeline
Tutorial (30 hours)
1. Python refresher and best practices: Review of Python syntax, indentation,
and PEP8 coding conventions through short exercises
2. Iterators, generators, and decorators: Writing small programs using
generators for data streaming and decorators for function modification
3. Object-oriented programming (OOP): Designing simple class-based
programs and demonstrating inheritance and encapsulation in python
4. Data access and integration: Reading data from CSV, Excel, JSON, and
APIs; Discussion on best practices for data ingestion
5. Database and SQL interaction: practice using SQLite and SQLAlchemy to
query and manipulate structured datasets
6. Web scraping practice: Extracting tabular data using requests and
BeautifulSoup; Handling exceptions and encoding issues
7. Advanced Pandas operations: Hands-on merging, reshaping, pivoting, and
group-by operations for complex data manipulation
8. Data cleaning and transformation: Exercises on handling missing values,
encoding categorical data, and normalization techniques
9. Statistical computation and EDA: Performing descriptive analysis,
correlation, and hypothesis testing using Python libraries
10. Data visualization practice: Creating comparative plots using matpLotlib,
Seaborn, and Plotly; Customizing themes and layouts
11. Pipeline and automation concepts: Designing pseudocode and flow
diagrams for ETL data pipelines and discussing error handling strategies
12. Mini case study discussion: Guided review of a small end-to-end applied
data pipeline from ingestion to visualization and reporting
Practical (15 hours)
1. Setting up Python environment for applied data workflows and writing
modular programs using OOP and functions
2. Collecting data via APIs and web scraping
3. Building advanced data cleaning and transformation pipelines using
Pandas
4. Conducting exploratory data analysis and statistical summaries
5. Developing interactive visualizations using Plotly, matplotlib and Seaborn
6. Automating ETL tasks and data refresh using Python schedulers
7. Generating summary dashboards and automated analytical reports
8. Mini Project: Build a complete applied data pipeline from ingestion to
visualization and reporting on a real-world dataset
Final Exam
The questions will cover all the chapters in the syllabus. The evaluation scheme will be
as indicated in the table below:
Chapter Hours Marks distribution*
179
279
3 9 12
4 7 10
579
6 8 11
Total 45 60
* There may be minor deviation in marks distribution.
References
1. McKinney, W. (2022). Python for data analysis. O’Reilly Media.
2. VanderPlas, J. (2016). Python data science handbook. O’Reilly Media.
3. Beazley, D. (2021). Python cookbook. O’Reilly Media.
4. Grus, J. (2022). Data science from scratch. O’Reilly Media.):
Old questions (these are from "Advanced Computer Programming" and are ~20–25% relatable — paste
numbered):
Advance computer programming which is relatable but not same or similar:( TRIBHUVAN UNIVERSITY
Exam. Back (New Cousc)
INSTITUTE OF ENGINEERING Level BE Full Marks | 60
Examination Control Division | Programme | BEL Pass Marks | 24
2082 Baishakh Year /Part | I/II Time 3 hrs.
Subject. - Advanced Computer Programming (CT153)
SNA KX
P—
Candidates are required to give their answers in their own words as far as practicable.
Attempt All questions.
Thefigures in the margin indicate Full Marks.
Assume suitable data if necessary.
. Discuss about the different programming paradigms with their advantage - and
disadvantage. [4]
Briefly explain different application areas of python programming. [4]
3. Define recursive function. Write a program to find the n' - term of Fibonacci series using
recursive function. | [2+4]
Explain the concept of mutable and immutable data type in python. For the given list of
dictionaries, find the TOTAL MARKS obtained; [4+4]
d = [{"subject":"math","marks":80},
{"subject":"science","marks":90},
{"subject":"english","marks":80}]
5. Explain the significance of lambda function with an example. [2]
6. Explain the benefits of object-oriented programming over procedural programming. [6]
7. Explain the concept of dynamic binding. Write python code to illustrate concept of
abstract class. [2+4]
8. Using concept of binary operator overloading, find the sum of complex numbers. Use
class called as complex, with two attributes: [real and imaginary]. [6]
9. Define exception. You cannot divide a given number by zero. Based on given statement,
write python code to handle the given exception, [2+4]
10. Discuss the difference between a Python module, package, and library. What are the
different ways to import modules? [3+3]
11. How do you reshape a NumPy array? Write a program to solve following system of
linear equations using NumPy. [2+4]
2x + 3y = 12
4x — S5y = —2
ok ok
TRIBHUVAN UNIVERSITY | Exam. | |
INSTITUTE OF ENGINEERING - | Level : BE Full Marks 60
Examination Control Division | Programme : BEL Pass Marks ' 24
2081 Ashwin Year /Part 1/11 - Time | 3 hrs.
Regular (New Course -2080 Batch)
Subject: - Advanced Computer Programming (CT153)
ANN NN
W NN ==
Candidates are required to give their answers in their own words as far as practicable.
Attempt
All questions.
Thefigures in the margin indicate Full Marks,
Assume suitable data if necessary.
. Explain different programming paradigm with example for each. [4]
. - List out the features andlimitations of python. | [2+2]
. What do you mean by operators? Explain different types of operators available in python
with example. | [2+4]
With example, explain following data structures in python: [6]
a) List |
b) Tuple
¢) Dictionary
Using two-dimensional list, write a program to addtwo matrices and create the third
matrix and display it. | [4]
In object-oriented programming, explain the concept of constructor. Write a python code
to illustrate the concept of constructor. | [2+4]
Write python code to explain the concept of Single, Hierarchical and multi-level
inheritance. [6]
Write a program to create a class called Time with attributes (hour, minute and second)
to represent time and add time objects and return the result. [6]
- Explain different types of errors in python program. Write a python program to create a
file called “[Link]” and use it to store the information of two students [Name. Roll No
and college Name]. Ask user to enter the information. [2+4]
10. Explain the advantages of using NumPy array over python sequences with an example. [3]
11. Write a python program to create two 2X2 NumPy arrays and performs matrix addition,
subtraction and element-wise multiplication and display the result, [9]
| ok ok
TRIBHUVANUNIVERSITY STR i:coular(New Course-
INSTITUTE OF ENGINEERING ~~ [Level ~~ BE ~~ FullMarks80
Examination Control Division | Programme BEL ~~ PussMarks 24 |
2081 Ashwin | Year/Part 1/1 Time 3 hrs.
2080 Batch)
a E— r——
Ar E— J a Poa -— en ——— —
v' Attempt All questions.
v' Thefigures in the margin indicate Full Marks.
v' Assume suitable data if necessary.
1. Explain different programming paradigm with example foi each.
2. List oul the featuresand limitations of python.
with example.
4. With example, explain following data structwres in python:
a) List
b) Tuple
c) Dictionary
5. Using two-dimensional list, write a program to add two matrices and create the third
matrix and display it.
10 illustrate the concept of construclor.
inheritance.
Subject:- Advanced ComputerProgramming (CT153
3. What de you mean by operators? Explain different types of operators available
v Candidates are required to give their answers in their own words as = practicable.
*\
\ [41%
\ [242]7
in python
Jk
1-
a
Fe=
6. In object-oriented programming, explain the concept of constructor, Write a python code
J Write python code lo explain the concepl of Single, Hierarchical and multi-level
i 8. Write a program 10 create a class called Time with attributes thour, minute and second)
to represent lime and add time objects and return the result.
9. Explain different types of errors in python program. Wrile a python program to create a
[4]
[2+4]
file called “record.tx1” and use it to slore the information of twa students [Name, Roll No |
and college Name]. Ask user to enter the information.
[Link] the advantages of usingNumPy array over python sequences with an example,
11. Write a python program to creale two 2X2 NumPy amays and performs matrix addition,
subtraction and elerent-wise multiplication and display the result.
wah
r
||
“oR
PL
1244]
[3]
[2]
[6] /
[6]
\)
Desired outputs (choose which you want — leave all if you want everything):
- Run PATTERN ANALYSIS (yes/no): YES
- Generate CHAPTER-WISE predicted questions (yes/no): YES
- Build a MOCK EXAM (chapter-weighted) (yes/no): YES
- Produce FULL MODEL ANSWERS + MARKING RUBRICS (yes/no): YES
- Iterative refinement plan (2 iterations) (yes/no): YES
Preferred output format:
- Pattern analysis: JSON
- Chapter-wise questions: Markdown grouped by Chapter (5 Qs per chapter)
- Mock exam: Exam paper (Markdown) + marking scheme + short answer outlines
- Model answers: Separate solution section (code blocks for code)
- Probability flags: include High/Medium/Low likelihood per question
-------------------------
2) INSTRUCTIONS FOR THE ASSISTANT (do all of these)
-------------------------
A. PATTERN ANALYSIS (deep-research style)
1. Compare the provided syllabus to the old questions and compute an overlap table:
- For each syllabus topic → % overlap score and short note (why matched / not).
- Weight topics that appear in old questions (even 20–25% overlap) slightly higher.
2. Infer IOE/TU exam pattern (phrasing, marks split, typical Q types: short, long, coding, debugging,
tracing).
3. Output: JSON with keys: topic_overlap, pattern_summary, high_prob_topics (top 8),
under_asked_topics (top 6).
B. CHAPTER-WISE PREDICTED QUESTION BANK
1. For **each chapter** in the syllabus produce **5 predicted questions** (numbered).
2. For each question include:
- Marks (suggested)
- Type: Theory / Coding / Debugging / Tracing
- Difficulty: Easy / Medium / Hard
- 1-line rationale (why likely)
- 2–3 bullet key points expected in answer (rubric highlights)
- Likelihood flag: High / Medium / Low
3. Prioritize topics with higher overlap and also include one under-asked important topic per chapter.
C. MOCK EXAM (chapter-weighted, ready to print)
1. Use inferred chapter weights (or the weights you were given) to allocate questions.
2. Build a 3-hour (or specified duration) exam with:
- Section A: Short answer (10 × 2 marks)
- Section B: Long/theory (4 × 10 marks; make 1 compulsory)
- Section C: Coding (3 problems: 20, 20, 20) — include at least one debugging/tracing problem
3. Provide clear instructions, total marks, time, and which questions are compulsory/optional.
D. MODEL ANSWERS + MARKING RUBRICS
1. For every question in the mock exam produce:
- Theory: bullet-point model answer covering all marking points.
- Coding: full, runnable Python 3.10+ code (no external internet calls), time & space complexity, 2
sample testcases with expected output, and a clear grading rubric that assigns marks to subparts.
2. If allowed libraries are specified, use them when appropriate; otherwise use only the standard
library.
E. ITERATIVE REFINEMENT
1. Provide two suggested iterations:
- Iteration 1: increase difficulty / convert ~30% of coding Qs to applied real-world tasks.
- Iteration 2: convert ~40% of remaining theory Qs into short-answer + MCQ variants for fast revision.
2. For each iteration, list exactly which questions change, why, and present the revised questions.
F. EXTRA: Study plan & quick revision
1. Produce a one-week focused revision plan that covers High-probability topics first.
2. Convert the top 25 predicted questions into Anki-friendly Q/A pairs (CSV format): question, concise
answer (<=40 words), tags (chapter, difficulty).
-------------------------
3) RESPONSE FORMATTING RULES
-------------------------
- Start with the PATTERN ANALYSIS JSON (max 1 page).
- Then CHAPTER-WISE predicted questions grouped by chapter (5 per chapter).
- Then MOCK EXAM (full paper) and then MODEL ANSWERS + RUBRICS.
- Use code blocks for code. For model code use Python 3.10+ and include testcases.
- Mark each predicted question with a likelihood: [HIGH / MEDIUM / LOW].
- Keep theory model answers concise and bullet-pointed (suitable as marking points).
- If any syllabus item is ambiguous, infer the most likely interpretation and note that assumption briefly
(1 line).
-------------------------