universal-subject-prompt-bank

name

universal-subject-prompt-bank

description

Pre-optimized sample answers and prompts for ANY subject at ANY university worldwide. Contains a Subject Template Framework covering Engineering, Science, Management, Law, Medical, Computer Science, Mathematics, and Humanities disciplines. Includes SPPU Computer Engineering examples as one reference implementation among many. Covers 2-mark, 4-mark, 6-mark, 10-mark, and 15-mark question patterns with time-budgeted responses.

Universal Subject-Specific Answer Bank

Purpose

This skill provides pre-optimized, exam-ready sample answers for virtually any university subject worldwide. It uses a Subject Template Framework that adapts answer structure, depth, and presentation to match the conventions of each academic discipline.

Each answer is calibrated to:

• Match the exact marks allocation
• Include time budget for real exam conditions
• Follow model answer format expected by examiners in that discipline
• Include marking scheme box
• Use discipline-appropriate vocabulary, evidence types, and reasoning patterns

---

Subject Template Framework

The framework provides eight discipline templates. Each template defines:

• Answer anatomy: how to structure responses for that discipline
• Evidence types: what constitutes proof/justification
• Keyword density: technical vocabulary expectations
• Diagram/visual policy: when and how to use diagrams
• Numerical policy: how to handle calculations
• Citation format: how to reference sources where applicable

1. Engineering Subjects (Formulas, Diagrams, Numerical)

• Answer anatomy: Concept → Formula → Solved Example → Result Interpretation
• Evidence: Standard formulas, SI units, diagrams (circuit/block/flow), solved numericals
• Keyword density: High — use technical terms, component names, parameter symbols
• Diagram policy: Required for 4+ marks — circuit diagrams, block diagrams, flowcharts
• Numerical policy: Must show formula → substitution → steps → final answer with units
• Citation format: Standard notation (e.g., Ohm's Law: V = IR)

2. Science Subjects (Theories, Experiments, Derivations)

• Answer anatomy: Theoretical Principle → Experimental Setup → Observation → Conclusion
• Evidence: Laws, derivations, experimental data, observations, classifications
• Keyword density: High — use scientific terminology, units, nomenclature
• Diagram policy: Required for 4+ marks — experimental setup, graphs, ray diagrams
• Numerical policy: Show formula, substitution, significant figures, units
• Citation format: Scientific naming conventions, law names, discoverer names

3. Management Subjects (Case Studies, Frameworks, Models)

• Answer anatomy: Framework → Application → Case Example → Business Implication
• Evidence: Management models (Porter's Five Forces, SWOT, PESTLE), case studies, real-world examples
• Keyword density: Moderate — balance technical terms with clear explanation
• Diagram policy: Diagrams useful but optional — frameworks, matrices, flowcharts
• Numerical policy: Financial calculations, ratios, break-even analysis with interpretation
• Citation format: Author names, year, model names

4. Law Subjects (Statutes, Cases, Principles)

• Answer anatomy: Legal Principle → Statute Reference → Case Citation → Application
• Evidence: IPC/CRPC sections, constitutional articles, landmark judgments, precedents
• Keyword density: High — precise legal terminology, Latin maxims, statutory references
• Diagram policy: Rarely used — flowcharts for procedural law only
• Numerical policy: Not applicable except in calculation of damages or sentences
• Citation format: Case name (Year) Court, Statute name, Section number

5. Medical Subjects (Anatomy, Physiology, Pathology)

• Answer anatomy: Definition → Anatomical Structure → Physiological Function → Clinical Significance
• Evidence: Anatomical nomenclature (Latin/Greek terms), physiological mechanisms, pathological changes
• Keyword density: Very high — precise anatomical terms, eponyms, clinical terminology
• Diagram policy: Required for 4+ marks — labeled diagrams, flowcharts, clinical images
• Numerical policy: Drug dosages, lab values, vital signs with normal ranges
• Citation format: Standard medical nomenclature (e.g., Terminologia Anatomica), ICD codes

6. Computer Science Subjects (Algorithms, Architectures, Code)

• Answer anatomy: Definition → Algorithm/Pseudocode → Time/Space Analysis → Example Execution
• Evidence: Pseudocode, code snippets, complexity analysis (Big O), architecture diagrams
• Keyword density: High — precise CS terminology, data structure names, algorithmic paradigms
• Diagram policy: Required for 4+ marks — architecture diagrams, flowcharts, state machines
• Numerical policy: Complexity calculations, recurrence relations, trace tables
• Citation format: Standard algorithm names, programming language conventions

7. Mathematics Subjects (Proofs, Derivations, Calculations)

• Answer anatomy: Statement → Given → Proof/Derivation → Conclusion
• Evidence: Theorems, lemmas, axioms, step-by-step algebraic manipulation, geometric constructions
• Keyword density: Moderate — precise mathematical notation, symbols, logical connectors
• Diagram policy: Required for geometry/graph theory — graphs, geometric figures, number lines
• Numerical policy: Every step must be shown; no skipped algebraic manipulation
• Citation format: Theorem names, mathematician names, standard notation (e.g., $\sum$, $\int$)

8. Humanities Subjects (Essays, Arguments, Evidence)

• Answer anatomy: Thesis Statement → Argument 1/2/3 → Supporting Evidence → Conclusion
• Evidence: Primary/secondary sources, historical events, literary texts, statistical data
• Keyword density: Moderate — disciplinary jargon balanced with accessible prose
• Diagram policy: Optional — timelines, maps, infographics for data presentation
• Numerical policy: Census data, survey statistics, economic indicators when relevant
• Citation format: MLA/APA/Chicago depending on university convention

9. Nursing & Health Sciences (Clinical Reasoning, Care Plans, Evidence-Based Practice)

• Answer anatomy: Clinical Presentation → Assessment → Diagnosis → Plan → Evaluation
• Evidence: Patient data, vital signs, lab values, nursing diagnoses (NANDA-I), clinical guidelines
• Keyword density: High — precise medical/nursing terminology, abbreviations (e.g., SOB, NPO, PRN)
• Diagram policy: Required for 4+ marks — body system diagrams, care plan flowcharts, anatomical charts
• Numerical policy: Drug calculations (dosage, drip rates), BMI, fluid balance, APGAR scores — show formula and units
• Citation format: Standard clinical terminology (ICD-11, SNOMED CT), nursing diagnosis labels

10. Design & Visual Arts (Portfolio, Critique, Studio Practice)

• Answer anatomy: Design Problem → Research → Concept → Process → Outcome → Critique
• Evidence: Design principles (balance, contrast, hierarchy, rhythm), colour theory, typography, material studies
• Keyword density: Moderate to high — discipline-specific vocabulary (e.g., kerning, chiaroscuro, biomimicry, wireframe)
• Diagram policy: Mandatory — sketches, mood boards, wireframes, process documentation, annotated images
• Numerical policy: Measurements, proportions, aspect ratios, colour codes (HEX/RGB/CMYK), material specifications
• Citation format: Designer names, movement names (Bauhaus, Art Deco), software/tool names

11. Social Sciences (Research, Data Analysis, Theory Application)

• Answer anatomy: Theoretical Framework → Research Question → Methodology → Findings → Interpretation
• Evidence: Empirical studies, survey data, census statistics, ethnographic observations, theoretical constructs
• Keyword density: Moderate — theoretical terms (e.g., structural functionalism, intersectionality, social capital)
• Diagram policy: Useful for data presentation — bar charts, scatter plots, network diagrams, timelines
• Numerical policy: Descriptive statistics (mean, median, mode), correlation coefficients, chi-square, regression output
• Citation format: APA (most common), ASA, Chicago; include year, journal, DOI for studies

---

Time-Budgeted Answer Framework by Mark Level

Regardless of discipline, answers at each mark level follow a time budget. Adjust content density based on template above.

[1 Mark] — 1 Minute

• Structure: 1 key fact, definition, or term — no elaboration
• Depth: Minimal — single correct piece of information
• What examiners check: Exactness of term/definition, correct spelling, no added content
• Avoid: Diagrams, examples, explanations, comparisons, justification

[2 Marks] — 2 Minutes

• Structure: 1 definition/statement + 1 key point OR 2 bullet points only
• Depth: Surface-level, single concept
• What examiners check: Correctness of core idea, keyword usage, no irrelevant detail
• Avoid: Diagrams, examples, comparisons, explanations beyond one sentence

[4 Marks] — 4 Minutes

• Structure: Definition + 4 key points OR 2 main points with brief explanation each
• Depth: Moderate — concept explanation with supporting details
• What examiners check: Structured answer, relevant keywords, logical flow
• Diagrams: Simple diagram expected if applicable (Engineering/Science/CS/Medical)

[6 Marks] — 6 Minutes

• Structure: Introduction + 4–6 detailed points + Conclusion OR Comparison table
• Depth: Significant — concept + mechanism + example/application
• What examiners check: Complete coverage, structured format, illustrative example, clear conclusion
• Diagrams: Expected for applicable subjects — labeled diagram or flowchart

[10 Marks] — 10 Minutes

• Structure: Full answer with Introduction + 6–8 detailed points + Example/Case Study + Conclusion
• Depth: Comprehensive — multiple aspects, comparisons, real-world applications
• What examiners check: Exhaustive coverage, proper structure, diagrams, practical examples, critical analysis
• Diagrams: Required — multiple diagrams if applicable

[15 Marks] — 15 Minutes

• Structure: Extended essay with Abstract → Theory → Analysis → Case Study → Critical Evaluation → Conclusion
• Depth: Deep — interdisciplinary connections, research references, original synthesis
• What examiners check: Complete mastery, research awareness, critical thinking, structured argumentation
• Diagrams: Multiple diagrams/tables/charts expected

---

Engineering Subjects — Sample Answers

Template 1: Formula-Based Problem (Mechanical Engineering)

Subject: Fluid Mechanics | University: [Any] | Question Type: Numerical + Theory

Define Reynolds Number and determine flow type [2 marks]

Time Budget: 2 min

Reynolds Number (Re) is a dimensionless quantity defined as $Re = \frac{\rho v D}{\mu}$, where $\rho$ is fluid density, $v$ is velocity, $D$ is pipe diameter, and $\mu$ is dynamic viscosity. It indicates whether flow is laminar (Re < 2000), transitional (2000–4000), or turbulent (Re > 4000).

Explain Bernoulli's Theorem with application [6 marks]

Time Budget: 6 min

Bernoulli's Theorem states that for an incompressible, inviscid fluid in steady flow, the total mechanical energy per unit weight remains constant along a streamline: $P/\rho g + v^2/2g + z = \text{constant}$.

1. Pressure Energy ($P/\rho g$): Energy due to fluid pressure.
2. Kinetic Energy ($v^2/2g$): Energy due to fluid velocity.
3. Potential Energy ($z$): Energy due to elevation above datum.
4. Assumptions: Steady flow, incompressible, inviscid, along streamline.
5. Venturi Meter Application: Throat constriction increases velocity → decreases pressure. Pressure difference measured gives flow rate.
6. Limitations: Real fluids have viscosity; friction losses cause energy drop along flow.

Thus, Bernoulli's Theorem is fundamental to fluid mechanics and is widely applied in flow measurement devices.

---

Template 2: Circuit Analysis (Electrical Engineering)

Subject: Network Theory | University: [Any] | Question Type: Network Theorem

State and explain Superposition Theorem [4 marks]

Time Budget: 4 min

Superposition Theorem states that in a linear bilateral network containing multiple independent sources, the response (voltage/current) in any branch equals the algebraic sum of responses caused by each independent source acting alone.

1. Procedure: Consider one source at a time; replace other voltage sources with short circuit and current sources with open circuit.
2. Linear Requirement: Only applicable to circuits obeying Ohm's Law — resistors, capacitors, inductors.
3. Superposition: Add individual contributions with proper sign convention.
4. Limitation: Does not apply to power calculations ($P = I^2R$) since power is nonlinear.

Thus, Superposition Theorem simplifies analysis of circuits with multiple sources.

---

Science Subjects — Sample Answers

Template 1: Physics Derivation

Subject: Electromagnetism | University: [Any] | Question Type: Derivation

Derive Gauss's Law in electrostatics [6 marks]

Time Budget: 6 min

Gauss's Law states that the electric flux through any closed surface equals $\frac{1}{\varepsilon_0}$ times the total charge enclosed by that surface.

1. Electric Flux: $\Phi_E = \oint \vec{E} \cdot d\vec{A}$, where $d\vec{A}$ is area vector normal to surface.
2. Consider a point charge $q$ at center of a spherical surface of radius $r$.
3. Field at distance $r$: $E = \frac{1}{4\pi\varepsilon_0}\frac{q}{r^2}$ (radially outward).
4. Flux through sphere: $\Phi_E = \oint \frac{1}{4\pi\varepsilon_0}\frac{q}{r^2} \cdot \hat{r} \cdot dA = \frac{q}{4\pi\varepsilon_0 r^2} \cdot 4\pi r^2 = \frac{q}{\varepsilon_0}$.
5. Generalization: For any closed surface, $\oint \vec{E} \cdot d\vec{A} = \frac{Q_{\text{enc}}}{\varepsilon_0}$.
6. Significance: Relates electric field distribution to charge distribution; fundamental to Maxwell's equations.

Thus, Gauss's Law provides a powerful tool for calculating electric fields of symmetric charge distributions.

Template 2: Chemistry Mechanism

Subject: Organic Chemistry | University: [Any] | Question Type: Reaction Mechanism

Explain SN1 and SN2 reaction mechanisms [6 marks]

Time Budget: 6 min

SN1 (Substitution Nucleophilic Unimolecular) and SN2 (Substitution Nucleophilic Bimolecular) are two major nucleophilic substitution mechanisms.

SN1	SN2
Two-step mechanism: carbocation formation then nucleophilic attack	Single-step concerted mechanism
Rate depends only on substrate concentration: Rate = k[RX]	Rate depends on both substrate and nucleophile: Rate = k[RX][Nu]
Favored by tertiary alkyl halides	Favored by primary alkyl halides
Racemization occurs (attack from both sides)	Inversion of configuration (Walden inversion)
Polar protic solvents preferred	Polar aprotic solvents preferred

Thus, the choice of SN1 vs SN2 depends on substrate structure, nucleophile strength, and solvent polarity.

---

Management Subjects — Sample Answers

Template 1: Strategy Framework

Subject: Strategic Management | University: [Any] | Question Type: Framework Analysis

Explain Porter's Five Forces Model [4 marks]

Time Budget: 4 min

Porter's Five Forces is a framework for analyzing industry competitiveness and profitability.

1. Threat of New Entrants: Barriers to entry (capital, regulations, brand loyalty).
2. Bargaining Power of Suppliers: Suppliers' ability to raise prices or reduce quality.
3. Bargaining Power of Buyers: Customers' ability to demand lower prices or higher quality.
4. Threat of Substitute Products: Alternative products/services from other industries.
5. Rivalry Among Existing Competitors: Intensity of competition (price wars, advertising, innovation).

Thus, Porter's Five Forces helps organizations identify strategic positioning opportunities within their industry.

Template 2: Case Study Analysis

Subject: Marketing Management | University: [Any] | Question Type: Case Application

Apply the 4Ps of Marketing to launch a new smartphone [6 marks]

Time Budget: 6 min

The Marketing Mix (4Ps) framework guides product launch strategy.

1. Product: Smartphone with AI camera, 5G, 5000mAh battery, OLED display. Unique selling point: AI-powered photography at mid-range price.
2. Price: Penetration pricing strategy — ₹24,999 for initial 3 months then ₹29,999. Competitors at ₹35,000+ for similar specs.
3. Place: Multi-channel distribution — online via Amazon/Flipkart, offline through 500+ exclusive stores and partnered retail chains.
4. Promotion: Digital-first campaign using YouTube influencers, Instagram ads, and in-store demo kiosks. Launch event with tech media coverage.

Thus, a well-coordinated 4Ps strategy ensures market penetration. Here it targets value-conscious consumers seeking premium features.

---

Law Subjects — Sample Answers

Template 1: Constitutional Law

Subject: Constitutional Law | University: [Any] | Question Type: Article Analysis

Explain the Right to Equality under Article 14 [4 marks]

Time Budget: 4 min

Article 14 guarantees equality before law and equal protection of laws within India. Equivalent provisions exist in most constitutional democracies (e.g., 14th Amendment in the US).

1. Equality before Law: No person is above law; equal subjection to ordinary courts.
2. Equal Protection of Laws: Like persons in like circumstances must be treated alike.
3. Reasonable Classification: Article 14 permits classification if (a) based on intelligible differentia, (b) differentia has rational nexus to legislative objective.
4. Landmark Case: State of West Bengal v. Anwar Ali Sarkar (1952) established that arbitrary classification violates Article 14.

Thus, Article 14 is a fundamental right forming the bedrock of constitutional jurisprudence. It balances equality with reasonable state action.

Template 2: Contract Law

Subject: Contract Law | University: [Any] | Question Type: Principle + Case

Define Consideration and explain its essentials [6 marks]

Time Budget: 6 min

Consideration is defined as "something in return" — the price paid by one party for the promise of the other. It is an essential element of a valid contract under Section 2(d) of the Indian Contract Act, 1872 (and equivalent provisions in common law jurisdictions).

1. At Desire of Promisor: Consideration must move at the desire of the promisor.
2. From Promisee or Third Party: Consideration may be provided by the promisee or any other person.
3. Past, Present, or Future: Consideration may be executory (future), executed (present), or past.
4. Need Not Be Adequate: Law only requires presence of consideration, not adequacy (Thomas v. Thomas, 1842).
5. Must Be Real: Physical impossibility or illusory promises do not amount to valid consideration.
6. Must Be Lawful: Illegal consideration renders contract void.

Thus, consideration distinguishes enforceable contracts from mere agreements. Without it, a contract is void ab initio.

---

Medical Subjects — Sample Answers

Template 1: Anatomy

Subject: Human Anatomy | University: [Any] | Question Type: Structure Description

Describe the structure of the heart [4 marks]

Time Budget: 4 min

The heart is a four-chambered muscular organ located in the mediastinum, responsible for pumping blood throughout the body.

1. Pericardium: Double-walled fibrous sac enclosing the heart — outer fibrous and inner serous layers with pericardial fluid.
2. Chambers: Right atrium (receives deoxygenated blood via SVC/IVC), Right ventricle (pumps to lungs), Left atrium (receives oxygenated blood from pulmonary veins), Left ventricle (pumps to aorta — thickest wall).
3. Valves: Tricuspid (right AV), Mitral/bicuspid (left AV), Pulmonary (right ventricular outflow), Aortic (left ventricular outflow).
4. Conduction System: SA node (pacemaker) → AV node → Bundle of His → Purkinje fibers.

Thus, the heart's structural design enables efficient double circulation. Its four chambers ensure complete separation of oxygenated and deoxygenated blood.

Template 2: Pathology

Subject: Pathology | University: [Any] | Question Type: Disease Mechanism

Explain the pathogenesis of Myocardial Infarction [6 marks]

Time Budget: 6 min

Myocardial Infarction (MI) is necrotic death of cardiac muscle due to prolonged ischemia, typically from atherosclerotic plaque rupture.

1. Atherosclerosis: Chronic inflammation leads to lipid-laden plaque formation in coronary arteries.
2. Plaque Rupture: Thin fibrous cap ruptures exposing thrombogenic core.
3. Thrombosis: Platelet aggregation and fibrin mesh form occlusive thrombus.
4. Ischemia: Complete occlusion stops oxygen supply to downstream myocardium within 20–40 minutes.
5. Necrosis: Irreversible cell death begins in subendocardial zone and spreads transmurally.
6. Complications: Arrhythmias, heart failure, cardiogenic shock, ventricular rupture.

Thus, MI pathogenesis involves a cascade from plaque instability to irreversible myocardial necrosis. Early reperfusion (angioplasty/thrombolysis) within the golden hour limits damage.

---

Computer Science Subjects — Sample Answers

Template 1: Algorithm Analysis

Subject: Design and Analysis of Algorithms | University: [Any] | Question Type: Algorithm + Complexity

Define Time Complexity and analyze Binary Search [4 marks]

Time Budget: 4 min

Time Complexity is the computational measure of time an algorithm takes as a function of input size, expressed using Big O notation.

Binary Search finds an element in a sorted array by repeatedly halving the search space.

1. Algorithm: Compare target with middle element; if equal return index; if less, search left half; if greater, search right half.
2. Recurrence Relation: $T(n) = T(n/2) + O(1)$
3. Analysis: Each comparison halves the array — after $k$ comparisons, array size is $n/2^k$. When $n/2^k = 1$, $k = \log_2 n$.
4. Complexity: $O(\log n)$ in all cases (best/average/worst).
5. Space: $O(1)$ iterative; $O(\log n)$ recursive.

Thus, Binary Search provides logarithmic search time, making it exponentially faster than Linear Search ($O(n)$) for large sorted datasets.

Template 2: Database Systems

Subject: Database Management Systems | University: [Any] | Question Type: SQL + Normalization

Explain Third Normal Form with example [6 marks]

Time Budget: 6 min

Third Normal Form (3NF) is a database normalization level requiring: (1) relation is in 2NF, and (2) no transitive dependency exists where a non-key attribute depends on another non-key attribute.

1. 1NF: Atomic values, no repeating groups.
2. 2NF: 1NF + all non-key attributes fully functionally dependent on the entire primary key.
3. 3NF: 2NF + no transitive dependency (non-key → non-key).

Example — Violates 3NF: | Emp_ID | Emp_Name | Dept_ID | Dept_Location | |---|---|---|---| | E101 | Alice | D1 | Mumbai | | E102 | Bob | D1 | Mumbai |

Here, Dept_Location depends on Dept_ID which depends on Emp_ID (transitive).

3NF Decomposition:

• Employee (Emp_ID PK, Emp_Name, Dept_ID FK)
• Department (Dept_ID PK, Dept_Location)

Thus, 3NF eliminates data redundancy and update anomalies. It is the minimum normalization required for most production databases.

---

Mathematics Subjects — Sample Answers

Template 1: Calculus

Subject: Calculus | University: [Any] | Question Type: Theorem + Proof

State and prove the Mean Value Theorem [4 marks]

Time Budget: 4 min

Mean Value Theorem (MVT): If a function $f$ is continuous on $[a,b]$ and differentiable on $(a,b)$, then there exists $c \in (a,b)$ such that $f'(c) = \frac{f(b) - f(a)}{b - a}$.

Proof:

1. Define $g(x) = f(x) - \frac{f(b)-f(a)}{b-a}(x - a)$.
2. $g$ is continuous on $[a,b]$ and differentiable on $(a,b)$.
3. $g(a) = f(a)$ and $g(b) = f(b) - (f(b)-f(a)) = f(a)$.
4. Thus $g(a) = g(b)$. By Rolle's Theorem, $\exists c \in (a,b)$ with $g'(c) = 0$.
5. $g'(x) = f'(x) - \frac{f(b)-f(a)}{b-a}$.
6. Setting $g'(c) = 0$: $f'(c) - \frac{f(b)-f(a)}{b-a} = 0$, hence $f'(c) = \frac{f(b)-f(a)}{b-a}$.

Thus, MVT guarantees a point where instantaneous slope equals average slope, with applications in error analysis and Taylor series.

Template 2: Linear Algebra

Subject: Linear Algebra | University: [Any] | Question Type: Computation

Find eigenvalues and eigenvectors of a 2x2 matrix [4 marks]

Time Budget: 4 min

Given matrix $A = \begin{bmatrix} 4 & 1 \ 2 & 3 \end{bmatrix}$.

Step 1 — Characteristic Equation: $\det(A - \lambda I) = \det\begin{bmatrix} 4-\lambda & 1 \ 2 & 3-\lambda \end{bmatrix} = (4-\lambda)(3-\lambda) - 2 = \lambda^2 - 7\lambda + 10 = 0$

Step 2 — Eigenvalues: $\lambda_1 = 5$, $\lambda_2 = 2$

Step 3 — Eigenvector for $\lambda_1 = 5$: $(A - 5I)v = 0 \Rightarrow \begin{bmatrix} -1 & 1 \ 2 & -2 \end{bmatrix} \begin{bmatrix} x \ y \end{bmatrix} = \begin{bmatrix} 0 \ 0 \end{bmatrix}$ $ -x + y = 0 \Rightarrow y = x$. Eigenvector: $v_1 = \begin{bmatrix} 1 \ 1 \end{bmatrix}$.

Step 4 — Eigenvector for $\lambda_2 = 2$: $(A - 2I)v = 0 \Rightarrow \begin{bmatrix} 2 & 1 \ 2 & 1 \end{bmatrix} \begin{bmatrix} x \ y \end{bmatrix} = \begin{bmatrix} 0 \ 0 \end{bmatrix}$ $2x + y = 0 \Rightarrow y = -2x$. Eigenvector: $v_2 = \begin{bmatrix} 1 \ -2 \end{bmatrix}$.

Thus, eigenvalues 5 and 2 with corresponding eigenvectors $(1,1)$ and $(1,-2)$.

---

Humanities Subjects — Sample Answers

Template 1: History

Subject: Modern World History | University: [Any] | Question Type: Essay

Analyze the causes of World War I [6 marks]

Time Budget: 6 min

World War I (1914–1918) resulted from a confluence of long-term structural tensions and an immediate trigger.

1. Nationalism: Pan-Slavism in Balkans threatened Austria-Hungary; French revanchism over Alsace-Lorraine.
2. Imperial Rivalries: Colonial competition between Britain, France, and Germany in Africa and Asia.
3. Alliance System: Triple Entente (UK, France, Russia) vs. Triple Alliance (Germany, Austria-Hungary, Italy) turned bilateral disputes into continental war.
4. Militarism: Arms race (especially Anglo-German naval race) and Schlieffen Plan forced rapid mobilization.
5. Immediate Trigger: Assassination of Archduke Franz Ferdinand (June 28, 1914) activated alliance obligations through the July Crisis.

Thus, WWI was not caused by a single event but by intersecting structural factors. The alliance system transformed a regional incident into a global conflict.

Template 2: Philosophy/Ethics

Subject: Ethics | University: [Any] | Question Type: Theory Application

Explain Utilitarianism and its limitations [4 marks]

Time Budget: 4 min

Utilitarianism, developed by Jeremy Bentham and John Stuart Mill, holds that actions are morally right if they produce the greatest good for the greatest number.

1. Core Principle: Utility — maximize pleasure, minimize pain (Bentham's hedonic calculus).
2. Act Utilitarianism: Evaluate each action individually by its consequences.
3. Rule Utilitarianism: Follow rules that produce greatest overall utility in the long run.

Limitations:

1. Justice Problem: Could justify punishing an innocent person if it maximizes overall happiness (e.g., railroading a suspect to prevent riots).
2. Measurement Problem: Pleasure/pain is subjective — impossible to quantify or compare across individuals.
3. Demandingness: Requires constant impartial calculation, ignoring personal relationships and commitments.

Thus, Utilitarianism provides a clear decision framework but struggles with rights, justice, and interpersonal comparisons of welfare.

---

Reference Implementation: SPPU Computer Engineering Examples

This section demonstrates how the template framework maps to a specific university curriculum. SPPU (Savitribai Phule Pune University) BE Computer Engineering (2019 Pattern) subjects are shown as one concrete implementation of the Computer Science template.

DBMS (310241)

Define Database Management System [2 marks]

Time Budget: 2 min

A Database Management System (DBMS) is software that enables users to define, create, maintain, and control access to databases. It provides an interface between applications and data while ensuring data integrity, security, and concurrent access.

Explain ER Model with suitable example [6 marks]

Time Budget: 6 min

Entity-Relationship (ER) Model is a conceptual data model that represents real-world entities and their relationships in a database. It provides a high-level view of data structure before implementation.

1. Entity: A real-world object distinguishable from other objects (e.g., Student, Course).
2. Attribute: Properties describing an entity (e.g., Student has roll_no, name, age).
3. Relationship: Association among two or more entities (e.g., Student enrolls in Course).
4. Cardinality: Specifies number of instances of one entity associated with another (e.g., one-to-many).

Example: University database where Student entity (roll_no, name) has enrolls relationship with Course entity (code, title).

Thus, ER model provides a clear blueprint for database design. It is widely used in the initial phase of database development.

Compare File System vs DBMS [6 marks]

Time Budget: 6 min

File System	DBMS
Data stored in flat files	Data stored in structured tables
No built-in security	Provides authentication, authorization
Data redundancy is high	Minimizes redundancy through normalization
Concurrent access leads to inconsistency	Ensures consistency via locking
Backup and recovery complex	Built-in backup and recovery mechanisms

Thus, File System is suitable for simple applications, while DBMS is preferred for enterprise applications requiring data integrity.

OS (310243)

Define Operating System [2 marks]

Time Budget: 2 min

An Operating System (OS) is system software that manages computer hardware and software resources, providing common services for computer programs. It acts as an intermediary between users and computer hardware.

Explain Process States with diagram [4 marks]

Time Budget: 4 min

A process is a program in execution, and it transitions through various states during its lifetime.

1. New: Process is being created.
2. Ready: Process is waiting to be assigned to a processor.
3. Running: Instructions are being executed.
4. Waiting: Process is waiting for an event (e.g., I/O completion).
5. Terminated: Process has finished execution.

Process state transitions enable efficient CPU utilization and are fundamental to multiprogramming operating systems.

Explain Round Robin Scheduling Algorithm [4 marks]

Time Budget: 4 min

Round Robin (RR) is a preemptive CPU scheduling algorithm where each process gets a fixed time slice (quantum) to execute. It is designed specifically for time-sharing systems.

1. Time Quantum: Fixed time slice assigned to each process in the ready queue.
2. Preemption: Process is interrupted after time quantum expires and moved to end of queue.
3. Fairness: All processes receive equal CPU time allocation.
4. Context Switching: Overhead increases with smaller time quantum values.

Thus, Round Robin provides good response time for interactive systems and is widely used in time-sharing operating systems.

Explain Banker's Algorithm for Deadlock Avoidance [6 marks]

Time Budget: 6 min

Banker's Algorithm is a deadlock avoidance algorithm that tests for safety by simulating resource allocation before granting requests. It ensures the system never enters an unsafe state where deadlock could occur.

1. Safety Check: Algorithm verifies if granting a request leaves system in safe state.
2. Resource Allocation Matrix: Tracks currently allocated resources to each process.
3. Need Matrix: Calculates remaining resource needs of each process.
4. Available Vector: Tracks currently available resources in system.

Thus, Banker's Algorithm prevents deadlock by ensuring safe state maintenance. It is used in systems where deadlock avoidance is critical.

CN (310244)

Define Computer Network [2 marks]

Time Budget: 2 min

A Computer Network is a set of interconnected devices that communicate using standardized protocols to share resources and exchange data. It enables resource sharing, communication, and distributed processing across geographical locations.

Explain TCP/IP Model with diagram [4 marks]

Time Budget: 4 min

The TCP/IP Model is a practical networking model consisting of four layers that define how data is transmitted over networks. It is the foundation of the internet and most modern networks.

1. Network Interface: Combines Physical and Data Link layers of OSI.
2. Internet: Handles IP addressing, routing, and fragmentation.
3. Transport: Provides end-to-end communication using TCP/UDP.
4. Application: Combines Session, Presentation, and Application layers of OSI.

Thus, TCP/IP model provides a robust framework for internet communication. It is the de facto standard for global networking.

Compare TCP and UDP [6 marks]

Time Budget: 6 min

TCP	UDP
Connection-oriented protocol	Connectionless protocol
Reliable data delivery	Unreliable, best-effort delivery
Ordered packet delivery	No guarantee of packet ordering
Flow and congestion control	No flow or congestion control
Higher overhead due to ACKs	Lower overhead, minimal header

Thus, TCP is suitable for applications requiring reliability (e.g., HTTP, FTP) while UDP is preferred for real-time applications (e.g., video streaming, VoIP).

DAA (410241)

Define Time Complexity [2 marks]

Time Budget: 2 min

Time Complexity is the computational complexity that describes the amount of time an algorithm takes to run as a function of the length of the input. It is typically expressed using Big O notation to analyze worst-case performance.

Explain Merge Sort Algorithm [4 marks]

Time Budget: 4 min

Merge Sort is a divide-and-conquer sorting algorithm that divides the array into halves, recursively sorts them, and then merges the sorted halves. It has a time complexity of O(n log n) in all cases.

1. Divide: Split array into two halves recursively until single elements remain.
2. Conquer: Each single element is trivially sorted.
3. Combine: Merge two sorted arrays by comparing elements and placing smaller one first.
4. Stability: Merge Sort is stable as it preserves relative order of equal elements.

Thus, Merge Sort guarantees O(n log n) performance regardless of input distribution. It is preferred when consistent performance is required.

Explain Dynamic Programming with example [6 marks]

Time Budget: 6 min

Dynamic Programming (DP) is an optimization technique that solves complex problems by breaking them into overlapping subproblems, solving each once, and storing their solutions. It avoids recomputation by using memoization or tabulation.

1. Optimal Substructure: Optimal solution contains optimal solutions to subproblems.
2. Overlapping Subproblems: Same subproblems are solved multiple times in naive recursion.
3. Memoization: Top-down approach storing results of subproblems in a table.
4. Tabulation: Bottom-up approach filling table iteratively.

Example: Fibonacci sequence where fib(n) = fib(n-1) + fib(n-2). DP stores fib(0)...fib(n) in array, computing each once.

Thus, Dynamic Programming reduces time complexity from exponential to polynomial. It is used in optimization problems like Knapsack, LCS, and Matrix Chain Multiplication.

---

Reference Implementation: VTU (Visvesvaraya Technological University) — Computer Science

This section shows how the same template framework maps to a different Indian university. VTU follows a 5-module, 100-mark, 3-hour pattern with OR within each module.

Module 1: Data Structures — Stacks

Define Stack and its operations [2 marks]

Time Budget: 2 min

A Stack is a linear data structure that follows the LIFO (Last In, First Out) principle. Operations: Push (insert at top), Pop (remove from top), Peek/Top (view top element without removal), isEmpty (check if empty).

Applications: Function call management (call stack), expression evaluation (infix to postfix), undo/redo operations.

Explain Array vs Linked List implementation of Stack [6 marks]

Time Budget: 6 min

Aspect	Array Implementation	Linked List Implementation
Memory allocation	Contiguous, fixed size	Dynamic, node-by-node
Overflow condition	Possible when array is full	Rare (heap exhaustion only)
Underflow condition	Same — empty stack detection	Same
Access time	O(1) for Top and Push (if space)	O(1) for Top and Push
Cache locality	High (contiguous memory)	Low (scattered nodes)
Memory per element	Only the data element	Data + pointer to next node (overhead)
Resizing	Expensive (O(n) copy if full)	No resizing needed — grows naturally
Use case	Known maximum size, performance-critical	Unknown size, frequent insert/delete

Array Stack: Uses a top index. Push: arr[++top] = value. Pop: return arr[top--]. Linked Stack: Uses a head pointer. Push: new node → link to head → update head. Pop: head = head→next.

VTU follow-up often asks: "Write a C program to implement stack using arrays." For code, provide well-commented program with push(), pop(), display(), and main() with menu.

Module 3: Database Management Systems — Normalization

Define 1NF, 2NF, and 3NF with examples [8 marks]

Time Budget: 8 min

Normalization is a process of organizing data to reduce redundancy and improve data integrity.

Normal Form	Rule	Example Violation
1NF	Each cell contains atomic (single) value; no repeating groups	A column storing multiple phone numbers: "123-456, 789-012"
2NF	In 1NF + every non-key attribute fully depends on the entire PK	StudentID → DepartmentName when PK is (StudentID, CourseID) — DepName depends only on StudentID, not the full PK
3NF	In 2NF + no transitive dependency (non-key → non-key)	StudentID → DeptID → DeptHead. DeptHead is transitively dependent on StudentID via DeptID

Example: Consider Student (SID, SName, CourseID, CourseName, Instructor). PK = (SID, CourseID).

• 1NF violation if CourseName contains multiple values → split atomic.
• 2NF violation: SName depends only on SID (part of PK) → move to Student table.
• 3NF violation: Instructor depends on CourseID (non-key → non-key) → move to Course table.

Thus, normalization to 3NF removes update anomalies and data redundancy.

---

Quick Reference: Mark-Level Structure Templates

Marks	Time	Structure	Diagram	Example
2	2 min	1 definition/statement	Not required	Not required
4	4 min	Definition + 4 points or 2 explained points	Simple	Brief
6	6 min	Intro + 4-6 points + Conclusion	Labeled	Yes
10	10 min	Full structured answer + 6-8 points + Conclusion	Required	Case study / detailed
15	15 min	Abstract → Theory → Analysis → Evaluation → Conclusion	Multiple	Research-level

---

How to Use This Skill

1. Identify the subject's discipline from the Subject Template Framework (Section: Subject Template Framework).
2. Determine the marks and locate the corresponding time budget in Time-Budgeted Answer Framework.
3. Select the discipline template and follow its answer anatomy (Concept → Formula → Example or Principle → Case → Application, etc.).
4. Reference the sample answers in the relevant template section for structural guidance.
5. For SPPU-specific questions, refer to the Reference Implementation section which maps Computer Engineering subjects to the Computer Science template.
6. Adapt the vocabulary, evidence type, and diagram policy per the template's specifications.

---

Discipline-Specific Command Word Mapping

Command	Engineering	Science	Management	Law	Medical	CS	Math	Humanities
Define	Term + symbol + SI unit	Term + law + units	Term + context	Doctrine + citation	Term + Latin root + location	Term + use + complexity	Term + notation	Concept + origin
Explain	Mechanism + formula + diagram	Theory + derivation + observation	Model + framework + example	Principle + case + ratio	Mechanism + pathway + clinical sign	Algorithm + trace + complexity	Proof + steps	Argument + evidence + counterpoint
Compare	Table with parameters	Table with properties	Table with criteria	Table with judgments	Table with features	Table with metrics	Table with properties	Table with themes
Derive	Start with known formula	Start with fundamental law	N/A	Deduce from precedent	N/A	Derive recurrence	Step-by-step algebra	Reason from premises
Design	Block diagram + specs	Experimental setup	Strategy + roadmap	Legal document	Treatment protocol	Architecture + trade-offs	Formal proof	Research proposal

---

Session Config

This skill integrates with the session config system (deps/session-profile.json). Before executing, check for an existing session profile:

• If deps/session-profile.json exists, read university, subject, pattern, and exam_type fields to auto-configure the skill.
• If the file does not exist, fall back to user-provided context or prompt the user to run setup-exam-prompt (or npm run init) first.
• Session config eliminates redundant context detection — detection happens once and is reused across all skill calls.