Filter:
📐
Mathematics-I
ODEs, PDEs, Vector Calculus, Matrices | JNTUK R23 First Year
100+Questions
5Units
16MEach
I

Ordinary Differential Equations

⭐ High Weightage · 30-35 marks
1
2023Unit 18MMedium⭐⭐⭐ High
Solve: dy/dx + y·tan(x) = sin(x). Find the general solution using the integrating factor method.

Identification

Form: dy/dx + P(x)y = Q(x). Here P(x) = tan(x), Q(x) = sin(x). This is a First-Order Linear ODE. Use Integrating Factor.

Step 1: Find Integrating Factor

IF = e∫P dx = e∫tan x dx = elog|sec x| = sec(x)

Step 2: Multiply both sides by IF

sec(x)·dy/dx + sec(x)·tan(x)·y = sin(x)·sec(x) = tan(x)

Left side = d/dx[y·sec(x)]

Step 3: Integrate both sides

d/dx[y·sec x] = tan x  →  y·sec x = ∫tan x dx = log|sec x| + C
✅ Final Answer

y·sec(x) = log|sec(x)| + C  or  y = cos(x)·[log|sec(x)| + C]

⚡ Direct Formula for Linear ODE

Solution: y·IF = ∫Q·IF dx + C

IF = e^(∫P dx) → always start here. Remember: ∫tan x dx = log|sec x| (not −log|cos x| — both are same but write consistently)

⚠️ Common Mistakes

1. Writing ∫tan x = log(cos x) — Wrong! It's log|sec x| = −log|cos x|

2. Forgetting absolute value: must write log|sec x|

3. Missing constant C during integration

4. Not simplifying: leave answer as y = cos x·[log|sec x| + C]

💡 Trick

IPAS Rule: Identify → find P → compute IF = e^(∫P) → Apply: y·IF = ∫Q·IF dx + C → Simplify

📋 Examiner Expectations (8M)

1. Write "First-Order Linear ODE" — earns 1 mark

2. Show IF = e^(∫tan x dx) step clearly

3. Write d/dx[y·sec x] = tan x explicitly — critical

4. Final answer must be solved for y, not left implicit

5. 4-5 numbered steps expected minimum

📌 Similar Questions (High Probability)

  • Solve dy/dx + y·cot(x) = 5e^(cos x) [2022, 8M]
  • Solve dy/dx − 2xy = x·e^(x²) [2024, 8M]
  • Solve dy/dx + 2y = 4x [2022, 4M]
  • Solve (1+x²)dy/dx + 2xy = cos x [Expected 2026]
2
2024Unit 116MHard⭐⭐⭐ Very High
Solve Bernoulli's equation: dy/dx + y/x = y³·x². Reduce to a linear ODE.

Step 1: Identify Bernoulli's Equation

Form: dy/dx + P(x)y = Q(x)·yⁿ. Here n=3. Standard reduction needed.

Step 2: Substitution v = y^(1-n) = y^(-2)

dv/dx = -2y^(-3)·dy/dx  →  y^(-3)·dy/dx = -½·dv/dx

Step 3: Divide original equation by y³

y^(-3)·dy/dx + y^(-2)/x = x²  →  -½·dv/dx + v/x = x²
dv/dx − 2v/x = −2x²  (Linear ODE in v)

Step 4: Solve Linear ODE

P = −2/x, IF = e^(∫−2/x dx) = x^(−2)

v·x^(-2) = ∫(−2x²)(x^(-2))dx = ∫−2 dx = −2x + C
✅ Final Answer

Substituting v = y^(-2):  y^(-2)/x² = −2x + C  or  1/(x²y²) = C − 2x

⚡ Bernoulli Quick Formula

New linear ODE: dv/dx + (1−n)P·v = (1−n)Q

Here: dv/dx + (1−3)(−1/x)v = (1−3)(x²) → dv/dx + 2v/x = −2x² ✓

Memorize: v = y^(1-n), always substitute this way

⚠️ Common Mistakes

1. Using wrong n — it's the power of y on the right side only

2. Forgetting (1−n) factor when writing reduced linear ODE

3. Not back-substituting v = y^(1-n) at the end

4. Sign error: −½·dv/dx when going from dy/dx to dv/dx

3
2022Unit 18MMedium⭐⭐⭐ High
Test for exactness and solve: (2xy + 3y²)dx + (x² + 6xy − 4y²)dy = 0

Step 1: Identify M and N

M = 2xy + 3y²,  N = x² + 6xy − 4y²

Step 2: Check Exactness ∂M/∂y = ∂N/∂x

∂M/∂y = 2x + 6y  |  ∂N/∂x = 2x + 6y  → ✅ EXACT

Step 3: Find F such that ∂F/∂x = M

F = ∫M dx = ∫(2xy + 3y²)dx = x²y + 3xy² + g(y)

Step 4: Find g(y) using ∂F/∂y = N

x² + 6xy + g'(y) = x² + 6xy − 4y²  →  g'(y) = −4y²  →  g(y) = −4y³/3

✅ General Solution

x²y + 3xy² − 4y³/3 = C

⚡ Direct Method for Exact ODEs

F = ∫M dx + ∫(terms in N not containing x) dy

= x²y + 3xy² + ∫(−4y²)dy = x²y + 3xy² − 4y³/3 = C

⚠️ Mistakes

1. Forgetting to test exactness first (earns marks)

2. Treating x as constant instead of y when integrating M

3. Forgetting g(y) — arbitrary function of y only

4
2023Unit 116MHard⭐⭐⭐ High
Solve: d²y/dx² − 4dy/dx + 4y = e^(2x) + sin(2x). Find complete general solution.

Step 1: CF — Auxiliary Equation

m² − 4m + 4 = 0 → (m−2)² = 0 → m = 2, 2 (repeated root)

CF = (C₁ + C₂x)e^(2x)

Step 2: PI for e^(2x) — a=2 is repeated root

f(D) = D²−4D+4, f(2)=0. Use: PI = x²·e^(ax)/f''(a)

f''(D)=2, so f''(2)=2

PI₁ = x²·e^(2x) / 2

Step 3: PI for sin(2x)

Replace D² → −4: f(−4) = −4−4(−4)+4 → Use operator: sin(2x)/(D²−4D+4)

Replace D² = −4: (−4−4D+4) = −4D → PI₂ = sin(2x)/(−4D)

= −(1/4)·∫sin(2x)dx = −(1/4)·(−cos(2x)/2) = cos(2x)/8

PI₂ = cos(2x)/8
✅ Complete Solution y = CF + PI₁ + PI₂

y = (C₁ + C₂x)e^(2x) + (x²/2)e^(2x) + cos(2x)/8

⚡ PI Table

If a is simple root of AE: PI = x·e^(ax)/f'(a)

If a is double root: PI = x²·e^(ax)/f''(a)

For sin(ax)/cos(ax): Replace D²=−a². If zero, multiply by x and differentiate denominator w.r.t. D

⚠️ Mistakes

1. For repeated root CF: must write (C₁+C₂x)e^mx not C₁e^mx+C₂e^mx

2. Forgetting x² for double repeated root in PI

3. Sign error in PI for trig functions

5
2022Unit 18MMedium⭐⭐⭐ High
Solve the homogeneous ODE: x·dy/dx = y + √(x² − y²)

Step 1: Check Homogeneity

dy/dx = y/x + √(1−y²/x²) — this is f(y/x) form → Homogeneous ODE

Step 2: Substitute y = vx, dy/dx = v + x·dv/dx

v + x·dv/dx = v + √(1−v²)  →  x·dv/dx = √(1−v²)

Step 3: Separate variables and integrate

dv/√(1−v²) = dx/x  →  sin⁻¹(v) = ln|x| + C
✅ Back-substitute v = y/x

sin⁻¹(y/x) = ln|x| + C

⚡ Homogeneous Test & Trick

Check: is dy/dx = f(y/x)? Yes → always use v = y/x

∫dv/√(1−v²) = sin⁻¹(v) — standard integral, memorize!

After solving: always back-substitute y/x for v

II

Linear DE of Higher Order & Variation of Parameters

⭐⭐ Important · 25 marks
6
2022Unit 216MHard⭐⭐ Medium
Solve using Variation of Parameters: d²y/dx² + y = cosec(x)

Step 1: Find CF

m² + 1 = 0 → m = ±i → y₁ = cos x, y₂ = sin x

Step 2: Wronskian W

W = y₁y₂'−y₂y₁' = cos²x + sin²x = 1

Step 3: Find A and B

A = −∫(y₂·R/W)dx = −∫sin(x)·cosec(x)dx = −∫1 dx = −x

B = ∫(y₁·R/W)dx = ∫cos(x)·cosec(x)dx = ∫cot(x)dx = log|sin x|

Step 4: PI = A·y₁ + B·y₂

PI = −x·cos x + sin x·log|sin x|
✅ Complete Solution

y = C₁cos x + C₂sin x − x·cos x + sin x·log|sin x|

⚡ Variation of Parameters Steps

1. Find CF → get y₁, y₂

2. Compute W = y₁y₂'−y₂y₁'

3. A = −∫(y₂R/W)dx, B = ∫(y₁R/W)dx

4. PI = Ay₁ + By₂

7
2024Unit 28MMedium⭐⭐ Medium
Solve Clairaut's equation y = px + a/p (p = dy/dx). Find general and singular solutions.

Clairaut's Form Recognition

y = px + f(p) where f(p) = a/p. Directly give general solution.

General Solution: y = Cx + a/C  (replace p by C)

Singular Solution

Differentiate w.r.t. p: 0 = x − a/p² → p² = a/x → p = √(a/x)

Substitute: y = x·√(a/x) + a/√(a/x) = √(ax) + √(ax) = 2√(ax)

Singular Solution: y² = 4ax (a parabola!)

💡 Fact

The singular solution is the envelope of the family of straight lines (general solution). Always a curve that is tangent to each line of the family.

III

Partial Differential Equations (PDE)

⭐⭐⭐ Very Important · 30 marks
8
2023Unit 38MMedium⭐⭐⭐ Very High
Form the PDE by eliminating arbitrary constants a and b from: z = (x² + a)(y² + b)

Let p = ∂z/∂x, q = ∂z/∂y

p = 2x(y² + b)  →  y²+b = p/(2x)

q = 2y(x² + a)  →  x²+a = q/(2y)

Substitute back into z = (x²+a)(y²+b)

z = [q/(2y)] · [p/(2x)] = pq/(4xy)
✅ PDE: 4xyz = pq  or  4xyz = (∂z/∂x)(∂z/∂y)

⚡ PDE Formation Rule

Step 1: Partial diff to get p = ∂z/∂x, q = ∂z/∂y

Step 2: Express a, b from p, q equations

Step 3: Substitute into original → eliminate a, b

Count: One arbitrary constant → one PDE

9
2024Unit 316MHard⭐⭐⭐ Very High
Solve Lagrange's linear PDE: p(y−z) + q(z−x) = x−y where p = ∂z/∂x, q = ∂z/∂y.

Step 1: Write Lagrange's Auxiliary Equations

dx/(y−z) = dy/(z−x) = dz/(x−y)

Step 2: First Integral — Add all three

Numerators: (y−z)+(z−x)+(x−y) = 0 → dx+dy+dz = 0

Integrating: x + y + z = c₁  →  u = x+y+z

Step 3: Second Integral — Multiply by x, y, z

x·dx + y·dy + z·dz = [x(y−z)+y(z−x)+z(x−y)] = 0

Integrating: x² + y² + z² = c₂  →  v = x²+y²+z²
✅ General Solution: φ(x+y+z, x²+y²+z²) = 0

⚡ Lagrange's Multiplier Method

Choose multipliers (l,m,n) such that l·P + m·Q + n·R = 0

Then l·dx + m·dy + n·dz = 0 is integrable

Two independent integrals u=c₁, v=c₂ → F(u,v) = 0

IV

Vector Calculus — Gradient, Divergence, Curl, Theorems

⭐⭐⭐ Very Important · 35 marks
10
2023Unit 48MEasy⭐⭐⭐ Very High
Find ∇φ of φ = x²yz + 4xz² at (1,−2,−1). Also find the directional derivative along (2,1,−2).

∂φ/∂x = 2xyz + 4z²

At (1,−2,−1): 2(1)(−2)(−1) + 4(1) = 4 + 4 = 8

∂φ/∂y = x²z

At (1,−2,−1): (1)²(−1) = −1

∂φ/∂z = x²y + 8xz

At (1,−2,−1): −2 + 8(1)(−1) = −2−8 = −10

∇φ = 8i − j − 10k

Unit vector u along (2,1,−2)

|a| = √(4+1+4) = 3,  u = (2i + j − 2k)/3

D_uφ = ∇φ·u = (8)(2/3) + (−1)(1/3) + (−10)(−2/3) = 16/3 − 1/3 + 20/3 = 35/3
∇φ = 8i − j − 10k  |  Directional Derivative = 35/3

⚡ Key Gradient Facts

|∇φ| = Maximum rate of change (in direction of ∇φ)

Directional Derivative = ∇φ · unit vector (always use unit vector!)

Normal to surface φ = const is the direction of ∇φ

11
2023Unit 416MHard⭐⭐⭐ Very High
Verify Green's theorem for ∮[(xy+y²)dx + x²dy] where C is bounded by y=x and y=x² (first quadrant).

Green's Theorem

∮[P dx + Q dy] = ∬(∂Q/∂x − ∂P/∂y) dA

RHS (Double Integral)

P = xy+y², Q = x². ∂Q/∂x = 2x, ∂P/∂y = x+2y. Integrand = 2x−x−2y = x−2y

RHS = ∫₀¹∫ₓ²ˣ (x−2y)dy dx = ∫₀¹[xy−y²]ₓ²ˣ dx = ∫₀¹(x⁴−x³)dx = 1/5 − 1/4 = −1/20

LHS: Along y=x² (x:0→1), then along y=x backwards

I₁ = ∫₀¹[x·x²+x⁴+x²·2x]dx = ∫₀¹(3x³+x⁴)dx = 3/4+1/5 = 19/20

I₂ = ∫₁⁰(3x²)dx = [x³]₁⁰ = −1

LHS = 19/20 + (−1) = −1/20 = RHS ✓
✅ LHS = RHS = −1/20. Green's Theorem Verified!

📋 Verification Strategy

1. Always compute RHS (double integral) first — usually easier

2. Find intersection of curves: x=x² → x=0,1

3. For LHS: parametrize each curve separately

4. State theorem before starting — earns 1 mark

12
2024Unit 416MHard⭐⭐⭐ High
Apply Gauss Divergence theorem: evaluate ∬F·n̂ dS where F = 4xzî − y²ĵ + yzk̂ over the cube 0≤x,y,z≤1.
∬ F·n̂ dS = ∭ div F dV  (Gauss Theorem)

Find div F

div F = ∂(4xz)/∂x + ∂(−y²)/∂y + ∂(yz)/∂z = 4z − 2y + y = 4z − y

∭(4z−y)dV = ∫₀¹∫₀¹∫₀¹(4z−y)dz dy dx = ∫₀¹∫₀¹(2−y)dy dx = ∫₀¹(3/2)dx = 3/2
✅ ∬ F·n̂ dS = 3/2
V

Matrices, Eigenvalues & Cayley-Hamilton Theorem

⭐⭐⭐ Very Important · 30 marks
13
2023Unit 516MMedium⭐⭐⭐ Very High
Find eigenvalues and eigenvectors of A = [[2,1,1],[1,2,1],[0,0,1]].

Step 1: Characteristic Equation |A−λI| = 0

Expanding along row 3: (1−λ)[(2−λ)²−1] = 0 → (1−λ)(λ²−4λ+3) = 0 → (1−λ)²(λ−3) = 0

Eigenvalues: λ₁ = 1 (repeated), λ₂ = 3

Eigenvector for λ = 3

[A−3I]x=0 gives −x+y=0, z=0 → eigenvector: [1,1,0]ᵀ

Eigenvectors for λ = 1

[A−I]x=0: x+y+z=0. Two free variables: [−1,1,0]ᵀ and [−1,0,1]ᵀ

λ=1: [−1,1,0]ᵀ, [−1,0,1]ᵀ  |  λ=3: [1,1,0]ᵀ

⚡ Verification

Sum of eigenvalues = trace(A) = 2+2+1 = 5 = 1+1+3 ✓

Product = det(A) = 3 = 1×1×3 ✓

Always verify before writing final answer!

14
2024Unit 516MHard⭐⭐⭐ Very High
Verify Cayley-Hamilton theorem for A = [[1,2],[2,1]] and find A⁻¹ using it.

Characteristic Equation

(1−λ)²−4=0 → λ²−2λ−3=0

Verify A²−2A−3I = 0

A² = [[5,4],[4,5]]. A²−2A−3I = [[5−2−3, 4−4−0],[4−4−0, 5−2−3]] = [[0,0],[0,0]] ✓

Find A⁻¹

A²−2A−3I=0 → A−2I = 3A⁻¹

A⁻¹ = (A−2I)/3 = (1/3)[[1−2, 2],[2, 1−2]] = (1/3)[[−1,2],[2,−1]]
✅ A⁻¹ = (1/3)[[−1,2],[2,−1]]

⚡ Cayley-Hamilton for A⁻¹

From p(A)=0, multiply by A⁻¹, isolate A⁻¹

For 2×2: if λ²+bλ+c=0 → A⁻¹ = −(A+bI)/c

Here: λ²−2λ−3=0 → A⁻¹ = −(A−2I)/(−3) = (A−2I)/3

⚛️
Engineering Physics
Optics, Lasers, Fiber Optics, Quantum Mechanics, Semiconductors | JNTUK R23
75+Questions
5Units
I

Wave Optics — Interference & Diffraction

⭐ High Weightage
1
2023Unit 110MMedium⭐⭐⭐ Very High
Derive conditions for constructive and destructive interference in thin films. Explain Newton's rings and derive the formula for radius of the nth dark ring.

Thin Film Interference — Theory

Light partially reflects from top and bottom surfaces of a thin film. Two reflected beams interfere. Reflection from denser medium → phase change of π (equivalent to λ/2 path difference).

Path difference: Δ = 2μt·cos(r) ± λ/2

Conditions

Constructive (Bright): 2μt·cos r = (2n+1)λ/2 (n=0,1,2…)

Destructive (Dark): 2μt·cos r = nλ (n=0,1,2…)

Newton's Rings Setup

Plano-convex lens on flat glass. Air film of varying thickness. Center t=0 → path diff = λ/2 → central dark spot. From geometry: r² = 2Rt (for small t).

nth Dark Ring Derivation

Dark condition (normal incidence, μ_air=1): 2t = nλ

From geometry: r²=2Rt → 2Rt = nRλ

Radius of nth dark ring: rₙ = √(nRλ)  |  Diameter: Dₙ² = 4nRλ
Key Results:

Dark: rₙ = √(nλR)  |  Bright: rₙ = √((2n−1)λR/2)

Wavelength: λ = (D²ₙ₊ₚ − D²ₙ)/(4pR)

⚡ Formulas to Memorize

rₙ(dark) = √(nλR)

rₙ(bright) = √((2n−1)λR/2)

λ measurement: λ = (D²ₘ − D²ₙ)/(4(m−n)R)

D² ∝ n for dark; D² ∝ (2n−1) for bright

Trick: Center is dark → phase reversal at bottom glass. CDSS: Center Dark, Spacing Squareroot-n

📋 Examiner Checklist (10M)

1. Draw labeled setup diagram — 2 marks minimum

2. Show geometry: r² = 2Rt derivation using circle theorem

3. Explain why center is dark: write path diff = λ/2 at t=0

4. Derive Dₙ² = 4nλR step by step — this gets full marks

5. State both bright and dark ring formulas

II

Lasers & Fiber Optics

⭐ High
2
2023Unit 210MMedium⭐⭐⭐ Very High
Explain He-Ne laser with energy level diagram. Derive the relation between Einstein's A and B coefficients.

Einstein Coefficients — Derivation

Three processes: Absorption (rate ∝ N₁·ρ·B₁₂), Spontaneous Emission (rate ∝ N₂·A₂₁), Stimulated Emission (rate ∝ N₂·ρ·B₂₁)

At thermal equilibrium: N₁B₁₂ρ = N₂A₂₁ + N₂B₂₁ρ

Solving for ρ and comparing with Planck's formula:

B₁₂ = B₂₁  |  A₂₁/B₂₁ = 8πhν³/c³

He-Ne Laser Working

Medium: He:Ne = 10:1 gas mixture. Pumping: Electrical discharge.

1. Electrons collide with He → He excited to metastable 2¹S₀ level

2. Resonance collision: He* + Ne(ground) → He(ground) + Ne*(3s) [nearly same energy]

3. Lasing transition: Ne*(3s) → Ne*(2p) → emits 632.8 nm red light

4. Population inversion maintained between 3s and 2p levels

Conditions for Laser Action

1. Population Inversion: N₂ > N₁ (non-equilibrium)

2. Metastable state with long lifetime

3. Optical feedback: resonant cavity (two mirrors)

4. Gain > Losses: G > L

A/B = 8πhν³/c³  |  He-Ne emits 632.8 nm  |  Population inversion is essential

⚡ LASER Key Facts

A₂₁/B₂₁ = 8πhν³/c³ (Einstein relation)

He-Ne: 632.8 nm (red) | Ruby: 694.3 nm | CO₂: 10.6 μm

At room temp: hν ≫ kT → A₂₁ ≫ B₂₁ρ → spontaneous dominates without population inversion

📋 Must-Do in Exam

1. Draw energy level diagram of He AND Ne side by side — 3 marks

2. Show resonance condition explicitly

3. Derive A/B from Planck's law — most students skip, earns bonus marks!

4. Write wavelength 632.8 nm — examiner always expects exact value

3
2024Unit 28MMedium⭐⭐⭐ High
Define Numerical Aperture (NA) and acceptance angle of optical fiber. Derive expression for NA. Calculate NA if n₁=1.5, n₂=1.45.

Acceptance Angle Derivation

At fiber entrance: n₀·sin(θₐ) = n₁·sin(θᵣ)

At core-cladding: sin(θc) = n₂/n₁ (critical angle)

For total internal reflection: θᵣ = 90°−θc

n₀·sin(θₐ) = n₁·cos(θc) = n₁√(1−n₂²/n₁²)

NA = n₀·sin(θₐ) = √(n₁² − n₂²)

Calculation

NA = √(1.5² − 1.45²) = √(2.25 − 2.1025) = √0.1475 ≈ 0.384
NA ≈ 0.384  |  Acceptance angle = sin⁻¹(0.384) ≈ 22.6°

⚡ Fiber Optics Formulas

NA = √(n₁²−n₂²) = n₁√(2Δ) where Δ=(n₁−n₂)/n₁

V-number = 2πa·NA/λ (a = core radius)

Single mode: V < 2.405  |  Multi mode: V > 2.405

III

Quantum Mechanics

⭐⭐ Important
4
2023Unit 310MHard⭐⭐⭐ High
State Heisenberg's Uncertainty Principle. Prove that an electron cannot exist inside the nucleus using this principle.

Statement

It is impossible to simultaneously determine exact position and exact momentum of a particle with unlimited precision.

Δx·Δpₓ ≥ ℏ/2  |  ΔE·Δt ≥ ℏ/2   (ℏ = h/2π)

Electron Cannot Exist in Nucleus — Proof

Nuclear diameter ≈ 10⁻¹⁴ m → Δx = 10⁻¹⁴ m

Δp ≥ ℏ/(2Δx) = (1.055×10⁻³⁴)/(2×10⁻¹⁴) ≈ 5.27×10⁻²¹ kg·m/s

Minimum Kinetic Energy

Relativistic: E = pc = 5.27×10⁻²¹ × 3×10⁸ ≈ 1.58×10⁻¹² J ≈ 9.9 MeV

But beta electrons from nucleus have only ~1 MeV. Contradiction!

Also, this energy greatly exceeds nuclear binding energy per nucleon (~8 MeV)

✅ Required energy ~10 MeV >> actual electron energy ~1 MeV → Electrons CANNOT exist in nucleus!

⚡ Key Values

ℏ = 1.055×10⁻³⁴ J·s  |  h = 6.626×10⁻³⁴ J·s

1 eV = 1.6×10⁻¹⁹ J  |  1 MeV = 1.6×10⁻¹³ J

Nuclear size: ~10⁻¹⁴ m  |  Atomic size: ~10⁻¹⁰ m

5
2022Unit 310MHard⭐⭐⭐ High
Derive time-independent Schrödinger equation. Apply it to a particle in an infinite potential well and find energy eigenvalues and wave functions.

Derivation from Wave Equation

For free particle: ψ = Ae^(ikx−iωt), k=p/ℏ, ω=E/ℏ

∂²ψ/∂x² = −k²ψ  →  p² = −ℏ²(∂²ψ/∂x²)/ψ. Using E = p²/2m + V:

−ℏ²/2m · ∂²ψ/∂x² + Vψ = Eψ  (Time-Independent Schrödinger Equation)

Particle in Infinite Well (0 ≤ x ≤ L, V=0 inside)

Inside: ψ'' + k²ψ = 0, k²=2mE/ℏ²

General: ψ = A sin(kx) + B cos(kx)

BC ψ(0)=0: B=0  |  BC ψ(L)=0: kL=nπ → k=nπ/L

Eₙ = n²π²ℏ²/(2mL²) = n²h²/(8mL²)  |  ψₙ = √(2/L)·sin(nπx/L)
Energy is quantized: E₁ (ground state) = h²/(8mL²), Eₙ = n²E₁

Wave functions are orthogonal sine functions

IV

Semiconductors & Band Theory

⭐⭐⭐ Very High
6
2024Unit 410MMedium⭐⭐⭐ Very High
Discuss Hall Effect. Derive the equation for Hall Coefficient. How is Hall Effect used to determine the type of semiconductor?

Hall Effect Principle

When a current-carrying conductor/semiconductor is placed in a perpendicular magnetic field, a transverse electric field (Hall field) is set up perpendicular to both current and magnetic field.

Derivation of Hall Coefficient

Force on charge carrier: Lorentz force F = qvB (upward for electrons in n-type)

Hall field builds up until: qEH = qvB → EH = vB

Current density J = nqv → v = J/(nq)

Hall field: EH = JB/(nq)

Hall Coefficient: RH = EH/(JB) = 1/(nq)  for n-type (negative RH)
RH = 1/(pq)  for p-type (positive RH)

Applications

1. Sign of RH → type of semiconductor (n or p)

2. |RH| → carrier concentration n or p = 1/(|RH|·q)

3. Mobility μ = |RH|·σ (σ = conductivity)

RH = 1/(nq) for n-type | RH = 1/(pq) for p-type

Negative RH → n-type | Positive RH → p-type

⚡ Hall Effect Formulas

VH = (RHIB)/t  (Hall voltage)

RH = VHt/(IB)  (from experiment)

n or p = 1/(|RH|·e)

Mobility μ = |RH|·σ

🧪
Engineering Chemistry
MOT, Electrochemistry, Polymers, Water Technology | JNTUK R23
70+Questions
5Units
I

Molecular Orbital Theory (MOT)

1
2023Unit 18MMedium⭐⭐⭐ Very High
Write MO electronic configuration of O₂ and O₂⁻. Calculate bond order and magnetic properties of each.

MO Energy Level Order (O₂ and heavier)

σ1s < σ*1s < σ2s < σ*2s < σ2pz < π2px = π2py < π*2px = π*2py < σ*2pz

O₂ (16 electrons)

σ1s²σ*1s²σ2s²σ*2s²σ2pz²π2px²π2py²π*2px¹π*2py¹

Bond Order = (10−6)/2 = 2  |  Two unpaired e⁻ in π* → Paramagnetic

O₂⁻ (17 electrons) — one extra e⁻ in π*

σ1s²σ*1s²σ2s²σ*2s²σ2pz²π2px²π2py²π*2px²π*2py¹

Bond Order = (10−7)/2 = 1.5  |  One unpaired e⁻ → Paramagnetic

O₂: BO=2, Paramagnetic  |  O₂⁻: BO=1.5, Paramagnetic

⚡ MOT Quick Rules

BO = (Nb − Na)/2  |  BO > 0: stable; BO = 0: unstable

Higher BO = Shorter & Stronger bond

Unpaired e⁻ → Paramagnetic  |  All paired → Diamagnetic

Adding e⁻ to antibonding → reduces BO; to bonding → increases BO

II

Electrochemistry & Corrosion

2
2023Unit 210MMedium⭐⭐⭐ High
Derive Nernst equation for electrode potential. Calculate EMF of: Zn|ZnSO₄(0.1M)||CuSO₄(0.01M)|Cu (E°cell = 1.1V).

Nernst Equation Derivation

From thermodynamics: ΔG = ΔG° + RT ln Q and ΔG = −nFE

−nFE = −nFE° + RT ln Q

E = E° − (RT/nF)·ln Q = E° − (0.0592/n)·log Q  at 25°C

EMF Calculation

Cell reaction: Zn + Cu²⁺ → Zn²⁺ + Cu. n=2

Q = [Zn²⁺]/[Cu²⁺] = 0.1/0.01 = 10

E = 1.1 − (0.0592/2)·log(10) = 1.1 − 0.0296 = 1.0704 V
✅ E_cell = 1.07 V

⚡ Nernst at 25°C

E = E° − (0.0592/n)·log Q

Q = [products]/[reactants] of cell reaction

E > 0: spontaneous  |  E = 0: equilibrium  |  E < 0: non-spontaneous

III

Polymers & Water Technology

3
2024Unit 38MEasy⭐⭐⭐ High
Explain addition and condensation polymerization with examples. Explain synthesis and properties of Bakelite.

Addition Polymerization

Monomers add without loss of any molecule. Requires double bond. Mechanism: Free radical initiation → Propagation → Termination

Example: n(CH₂=CH₂) → -(CH₂-CH₂)ₙ- (Polyethylene)

Condensation Polymerization

Monomers combine with elimination of small molecules (H₂O, HCl). Requires bifunctional groups.

Example: Nylon 6,6: Hexamethylenediamine + Adipic acid → Nylon + nH₂O

Bakelite Synthesis

Phenol + Formaldehyde with acid/base catalyst

Step 1: Phenol + HCHO → ortho-hydroxybenzyl alcohol (addition)

Step 2: Condensation → linear chain (Novolac, thermoplastic)

Step 3: Cross-linking at high temp → Bakelite (thermosetting)

Bakelite properties:

Hard, non-melting, good electrical insulator, heat resistant. Used in switches, socket panels, handles.

⚡ Quick Comparison

Addition: double bonds, no byproduct, chain growth → PE, PVC, Teflon

Condensation: functional groups, byproduct (H₂O), step growth → Nylon, Bakelite, Terylene

Thermoplastic: re-meltable  |  Thermosetting: non-remeltable (Bakelite)

💻
C Programming
Programs, Algorithms, Pointers, Files, Structures | JNTUK R23
75+Questions
5Units
I

Basics, Data Types, Operators & Control Flow

1
2023Unit 14MEasy⭐⭐⭐ Very High
Write a C program to check whether a given number is an Armstrong number.

Logic

Armstrong number: sum of cubes of digits = number itself. Eg: 153 = 1³+5³+3³ = 153

#include <stdio.h> #include <math.h> int main() { int n, orig, rem, result = 0, digits = 0, temp; printf("Enter a number: "); scanf("%d", &n); orig = n; temp = n; while(temp != 0) { digits++; temp /= 10; } temp = n; while(temp != 0) { rem = temp % 10; result += (int)pow(rem, digits); temp /= 10; } if(result == orig) printf("%d IS Armstrong\n", n); else printf("%d is NOT Armstrong\n", n); return 0; }
Enter a number: 153 153 IS Armstrong Enter a number: 123 123 is NOT Armstrong

Dry Run for n=153

digits=3, then: rem=3→result=27; rem=5→result=152; rem=1→result=153. result==153 → Armstrong!

⚠️ Common Errors

1. Not saving original value: always use orig=n before loop

2. Using pow() without casting to int — may get 152.999 instead of 153

3. Forgetting #include <math.h> for pow()

4. Hardcoding 3 digits — use digit-counting loop for general n-digit Armstrong

🎙️ Viva Questions

Other Armstrong numbers? → 0, 1, 153, 370, 371, 407 (3-digit)

Difference between % and /? → % gives remainder, / gives quotient (integer division)

Why int cast for pow()? → pow() returns double; int cast needed to avoid floating point rounding

What if n=0? → 0^1 = 0 = 0, so 0 IS Armstrong

II

Arrays & Strings

2
2022Unit 28MMedium⭐⭐⭐ Very High
Write a C program to multiply two m×n matrices. Verify dimensions and display result matrix.
#include <stdio.h> int main() { int a[10][10], b[10][10], c[10][10]; int r1, c1, r2, c2, i, j, k; printf("Rows, cols of A: "); scanf("%d %d", &r1, &c1); printf("Rows, cols of B: "); scanf("%d %d", &r2, &c2); if(c1 != r2) { printf("Multiplication not possible!\n"); return 1; } printf("Enter Matrix A:\n"); for(i=0;i<r1;i++) for(j=0;j<c1;j++) scanf("%d",&a[i][j]); printf("Enter Matrix B:\n"); for(i=0;i<r2;i++) for(j=0;j<c2;j++) scanf("%d",&b[i][j]); /* Initialize result to 0 */ for(i=0;i<r1;i++) for(j=0;j<c2;j++) c[i][j]=0; /* 3 nested loops for multiplication */ for(i=0;i<r1;i++) for(j=0;j<c2;j++) for(k=0;k<c1;k++) c[i][j] += a[i][k]*b[k][j]; printf("Result:\n"); for(i=0;i<r1;i++){ for(j=0;j<c2;j++) printf("%d\t",c[i][j]); printf("\n"); } return 0; }

🎙️ Viva Questions

Condition for matrix multiplication? → Columns of A must equal Rows of B

Time complexity? → O(n³) for n×n matrices

Why initialize c[i][j]=0? → Array has garbage values; accumulation requires starting from 0

What is row-major storage? → a[i][j] at address: base + (i×cols + j)×sizeof(int)

III

Functions & Recursion

3
2023Unit 38MMedium⭐⭐⭐ High
Write a recursive C function to find nth Fibonacci number. Trace function calls for n=5.
#include <stdio.h> int fib(int n) { if(n == 0) return 0; /* Base case 1 */ if(n == 1) return 1; /* Base case 2 */ return fib(n-1) + fib(n-2); } int main() { int n; printf("Enter n: "); scanf("%d", &n); printf("fib(%d) = %d\n", n, fib(n)); return 0; }

Call Tree for fib(5)

fib(5)
├── fib(4)
│   ├── fib(3) → fib(2)+fib(1) = 1+1 = 2
│   └── fib(2) → fib(1)+fib(0) = 1   → fib(4) = 3
└── fib(3)
    ├── fib(2) = 1
    └── fib(1) = 1                    → fib(3) = 2
Result: fib(5) = 3 + 2 = 5
Enter n: 5 fib(5) = 5

⚠️ Mistakes

1. Missing base case → infinite recursion → stack overflow

2. Returning n instead of 1 for fib(1)

3. Returning 1 for fib(0) — should return 0

💡 Complexity Note

Recursive: O(2ⁿ) time, O(n) space  |  Iterative: O(n) time, O(1) space. Mention this in exam — earns extra marks!

IV

Pointers & Structures

4
2024Unit 48MMedium⭐⭐⭐ Very High
What is a pointer? Write a program to find sum and average of array elements using pointers. Draw memory diagram.

Definition

A pointer is a variable that stores the memory address of another variable. Declaration: int *p; — p stores address of int. p = &n; — p points to n. *p = value at address (dereferencing).

#include <stdio.h> int main() { int arr[5], i; int *ptr = arr; /* ptr → arr[0] */ int sum = 0; float avg; printf("Enter 5 elements: "); for(i=0; i<5; i++) scanf("%d", ptr+i); for(i=0; i<5; i++) sum += *(ptr+i); avg = (float)sum / 5; printf("Sum=%d, Avg=%.2f\n", sum, avg); return 0; }

Memory Diagram

arr: [1000] [1004] [1008] [1012] [1016]
ptr = 1000  → ptr+1=1004 (adds sizeof(int)=4)
*(ptr+2) = value at address 1008 = arr[2]

🎙️ Viva

Difference ptr++ vs *ptr++? → ptr++ moves pointer; *ptr++ gets value then moves

What is NULL pointer? → Pointer with value 0, points to nothing

Dangling pointer? → Pointer to freed/destroyed memory location

How does pointer arithmetic work? → Adds sizeof(datatype) bytes, not 1 byte

5
2024Unit 48MMedium⭐⭐⭐ High
Define structure. Write a C program to store and display information of 5 students (name, roll, marks). Find the topper.

Definition

A structure is a user-defined data type that groups variables of different data types under one name.

#include <stdio.h> struct Student { char name[30]; int roll; float marks; }; int main() { struct Student s[5]; int i, top = 0; for(i=0; i<5; i++) { printf("Enter name, roll, marks: "); scanf("%s %d %f", s[i].name, &s[i].roll, &s[i].marks); } printf("\nAll Students:\n"); for(i=0; i<5; i++) printf("%s\t%d\t%.2f\n", s[i].name, s[i].roll, s[i].marks); for(i=1; i<5; i++) if(s[i].marks > s[top].marks) top = i; printf("Topper: %s with %.2f marks\n", s[top].name, s[top].marks); return 0; }

🎙️ Viva

Difference between structure and union? → Structure: separate memory per member; Union: shared memory (size = max member)

sizeof(union) vs sizeof(struct)? → Union = max(sizeof members); Struct = sum + padding

Can struct contain a pointer to itself? → Yes — self-referential structure (used in linked lists)

🌲
Data Structures
Arrays, Linked Lists, Stacks, Queues, Trees, Sorting | JNTUK R23
60+Questions
5Units
I

Stacks & Queues

⭐ High
1
2023Unit 18MMedium⭐⭐⭐ Very High
Implement a Stack using arrays in C. Write push, pop, and display operations. Show overflow and underflow conditions.
#include <stdio.h> #define MAX 5 int stack[MAX], top = -1; void push(int val) { if(top == MAX-1) { printf("Stack Overflow!\n"); return; } stack[++top] = val; printf("%d pushed\n", val); } int pop() { if(top == -1) { printf("Stack Underflow!\n"); return -1; } return stack[top--]; } void display() { if(top == -1) { printf("Stack Empty\n"); return; } printf("Stack (top→bottom): "); for(int i=top; i>=0; i--) printf("%d ", stack[i]); printf("\n"); } int main() { push(10); push(20); push(30); display(); printf("Popped: %d\n", pop()); display(); return 0; }
10 pushed 20 pushed 30 pushed Stack (top→bottom): 30 20 10 Popped: 30 Stack (top→bottom): 20 10

⚡ Stack Concept

LIFO — Last In First Out

top = −1: empty stack  |  top = MAX−1: full stack

Push: check overflow, stack[++top] = val

Pop: check underflow, return stack[top--]

Applications: Expression evaluation, function calls, undo operations, browser history

🎙️ Viva

What is LIFO? → Last In First Out — last element pushed is first to be popped

Difference: Stack vs Queue? → Stack: LIFO; Queue: FIFO (First In First Out)

Stack applications? → Function call stack, expression evaluation, backtracking, browser back button

What is Stack Overflow in OS? → When program uses more stack memory than allocated (infinite recursion)

II

Linked Lists

2
2024Unit 216MHard⭐⭐⭐ Very High
Write C code to: (a) Insert a node at the beginning of a singly linked list, (b) Delete a node from the end, (c) Display the list.
#include <stdio.h> #include <stdlib.h> struct Node { int data; struct Node *next; }; struct Node *head = NULL; void insertBegin(int val) { struct Node *newNode = (struct Node*)malloc(sizeof(struct Node)); newNode->data = val; newNode->next = head; head = newNode; } void deleteEnd() { if(head == NULL) { printf("List empty!\n"); return; } if(head->next == NULL) { free(head); head = NULL; return; } struct Node *temp = head; while(temp->next->next != NULL) temp = temp->next; free(temp->next); temp->next = NULL; } void display() { struct Node *temp = head; while(temp != NULL) { printf("%d → ", temp->data); temp = temp->next; } printf("NULL\n"); } int main() { insertBegin(30); insertBegin(20); insertBegin(10); display(); deleteEnd(); display(); return 0; }
10 → 20 → 30 → NULL 10 → 20 → NULL

⚡ Linked List vs Array

Array: fixed size, random access O(1), insert/delete O(n)

Linked List: dynamic size, no random access, insert begin O(1), delete O(n) for end

Always use free() to avoid memory leaks!

🎙️ Viva

What is a self-referential structure? → A struct containing a pointer to the same type (Node has Node *next)

malloc() vs calloc()? → malloc(): allocates memory (uninitialized); calloc(): allocates and sets to zero

What is a doubly linked list? → Each node has both prev and next pointers

Time complexity of search in linked list? → O(n) — must traverse from head

III

Sorting Algorithms

3
2023Unit 38MMedium⭐⭐⭐ High
Write and trace Bubble Sort and Quick Sort algorithms. Compare their time complexities.

Bubble Sort

void bubbleSort(int a[], int n) { int i, j, temp; for(i=0; i<n-1; i++) for(j=0; j<n-i-1; j++) if(a[j] > a[j+1]) { temp=a[j]; a[j]=a[j+1]; a[j+1]=temp; } }

Trace: [64,34,25,12] → Bubble Sort

Pass 1: [34,25,12,64]  |  Pass 2: [25,12,34,64]  |  Pass 3: [12,25,34,64] ✓

Quick Sort (Partition logic)

int partition(int a[], int low, int high) { int pivot = a[high], i = low-1, temp; for(int j=low; j<high; j++) if(a[j] <= pivot) { i++; temp=a[i]; a[i]=a[j]; a[j]=temp; } temp=a[i+1]; a[i+1]=a[high]; a[high]=temp; return i+1; } void quickSort(int a[], int low, int high) { if(low < high) { int pi = partition(a, low, high); quickSort(a, low, pi-1); quickSort(a, pi+1, high); } }

⚡ Sorting Complexity Table

Algorithm  | Best    | Average | Worst   | Space
-----------|---------|---------|---------|------
Bubble     | O(n)    | O(n²)   | O(n²)   | O(1)
Selection  | O(n²)   | O(n²)   | O(n²)   | O(1)
Insertion  | O(n)    | O(n²)   | O(n²)   | O(1)
Quick Sort | O(nlogn)| O(nlogn)| O(n²)   | O(logn)
Merge Sort | O(nlogn)| O(nlogn)| O(nlogn)| O(n)
Basic Electrical & Electronics Engineering
DC Circuits, AC Theory, Transformers, Semiconductors, Amplifiers | JNTUK R23
60+Questions
5Units
I

DC Circuits & Network Theorems

1
2023Unit 110MMedium⭐⭐⭐ Very High
State and verify Thevenin's theorem. Find the current through the 5Ω load in a circuit with a 10V source, 10Ω and 5Ω series-parallel resistors.

Thevenin's Theorem Statement

Any linear two-terminal network can be replaced by an equivalent circuit consisting of a voltage source (V_th) in series with a resistance (R_th).

Step 1: Find V_th (Open circuit voltage)

Remove the 5Ω load. With 10Ω and 5Ω in series: Total R = 10+5 = 15Ω. But load removed means 5Ω is open: V_th = voltage across the load terminals.

For a simple series circuit (V=10V, R_series=10Ω): V_th = 10 × (0/10+0) — depends on exact circuit. Standard result: V_th = 10V if no series R before load.

Step 2: Find R_th (Replace all sources by their internal resistance)

Voltage sources → short circuit. Calculate resistance seen from load terminals: R_th = 10 || 0 + 5 = depends on circuit topology.

Standard example: R_th = R₁||R₂ = 10×10/(10+10) = 5Ω

Step 3: Find load current

I_L = V_th/(R_th + R_L) = 10/(5+5) = 1 A
Thevenin Equivalent: V_th = 10V, R_th = 5Ω → I_L = 1A

⚡ Thevenin Steps

1. Remove load, find V_th = open circuit voltage

2. Kill all sources (short V, open I), find R_th from terminals

3. I_L = V_th/(R_th + R_L)

Norton's: I_N = V_th/R_th, R_N = R_th

II

AC Circuits & Resonance

2
2024Unit 210MMedium⭐⭐⭐ High
Derive the expression for resonant frequency of series RLC circuit. Explain the concept of Q-factor and bandwidth.

Series RLC Circuit Impedance

Z = √[R² + (X_L − X_C)²]  where X_L = ωL, X_C = 1/(ωC)

Resonance Condition: X_L = X_C

ωL = 1/(ωC) → ω²LC = 1

ω₀ = 1/√(LC)  |  f₀ = 1/(2π√(LC))

At Resonance

Z = R (minimum), Current I = V/R (maximum). Circuit is purely resistive.

Q-factor and Bandwidth

Q = ω₀L/R = 1/(ω₀CR) = (1/R)√(L/C)

Bandwidth BW = f₀/Q = R/(2πL)

Higher Q → sharper resonance, narrower bandwidth

f₀ = 1/(2π√LC)  |  Q = ω₀L/R  |  BW = f₀/Q

⚡ RLC Resonance Formulas

f₀ = 1/(2π√LC) — resonant frequency

At resonance: Z=R (min), I=V/R (max), pf=1

Q = ω₀L/R = voltage magnification factor

BW = f₂−f₁ = R/(2πL) = f₀/Q

III

Transformers & Semiconductors

3
2022Unit 38MEasy⭐⭐⭐ High
Explain the working principle of a transformer. Derive the EMF equation. If a transformer has 500 primary and 1000 secondary turns with 220V primary, find secondary voltage.

Working Principle

Transformer works on the principle of mutual electromagnetic induction. AC supply to primary coil creates changing flux in core, which induces EMF in secondary coil.

EMF Equation Derivation

Flux: φ = φₘ·sin(ωt). EMF induced: e = −dφ/dt = −φₘω·cos(ωt)

Max EMF: Eₘ = N·φₘ·ω = N·φₘ·2πf

RMS EMF: E = 4.44·f·N·φₘ

Turns Ratio and Secondary Voltage

V₂/V₁ = N₂/N₁  →  V₂ = 220 × (1000/500) = 440 V
Secondary Voltage = 440V (Step-up transformer)

⚡ Transformer Formulas

E = 4.44 f N φₘ (EMF equation, 4.44 = π/√2 × 2)

V₁/V₂ = N₁/N₂ = I₂/I₁ (turns ratio = voltage ratio = inverse current ratio)

Step-up: N₂ > N₁, V₂ > V₁  |  Step-down: N₂ < N₁, V₂ < V₁

⚙️
Basic Civil & Mechanical Engineering
Engineering Materials, Surveying, Thermodynamics, Machines | JNTUK R23
50+Questions
5Units
I

Engineering Materials & Construction

1
2023Unit 18MEasy⭐⭐⭐ High
What is cement? Explain the manufacturing process of Portland cement using dry process. List the chemical compounds in cement and their roles.

Definition

Cement is a binding material that hardens when mixed with water due to chemical reactions. Portland cement is most commonly used in construction.

Dry Process of Manufacture

1. Crushing: Limestone and clay are crushed separately

2. Drying: Raw materials dried to remove moisture

3. Grinding: Mixed and ground to fine powder in ball mill

4. Blending: Proportioned and stored in silos

5. Burning: Fed into rotary kiln at 1400-1500°C → clinker formed

6. Cooling & Grinding: Clinker + 3-4% gypsum → ground to cement powder

Chemical Compounds (Bogue's Compounds)

C₃S (Tricalcium Silicate, 40%) — Early strength, responsible for initial setting

C₂S (Dicalcium Silicate, 30%) — Slow hydration, long-term strength

C₃A (Tricalcium Aluminate, 11%) — Rapid hydration, sets first (gypsum controls it)

C₄AF (Tetracalcium Alumino Ferrite, 12%) — Contributes to color, resistance

Gypsum added: retards C₃A from setting too fast (flash set prevention)

⚡ Key Facts

Dry process: suitable for dry climate, less fuel, simpler

Wet process: mixing with water, more uniform but energy-intensive

Fineness of cement affects: rate of hydration, strength gain, heat of hydration

Initial set: 30 min | Final set: 10 hours (for OPC)

II

Thermodynamics & Heat Engines

2
2024Unit 210MMedium⭐⭐⭐ Very High
State the laws of thermodynamics. Explain the Carnot cycle with P-V diagram and derive the expression for Carnot efficiency.

Laws of Thermodynamics

0th Law: If A is in thermal equilibrium with B, and B with C, then A is in equilibrium with C. (Defines temperature)

1st Law: Energy can neither be created nor destroyed. dQ = dU + dW (Heat added = change in internal energy + work done)

2nd Law: Heat cannot spontaneously flow from cold to hot body. Efficiency of heat engine < 100%

3rd Law: Entropy of a pure perfect crystal at absolute zero is zero

Carnot Cycle (4 Reversible Processes)

1. Isothermal Expansion (1→2): Heat Q₁ absorbed from source at T₁

2. Adiabatic Expansion (2→3): Temperature falls from T₁ to T₂

3. Isothermal Compression (3→4): Heat Q₂ rejected to sink at T₂

4. Adiabatic Compression (4→1): Temperature rises back to T₁

Carnot Efficiency: η = 1 − Q₂/Q₁ = 1 − T₂/T₁ = (T₁−T₂)/T₁

Significance

Carnot efficiency is the maximum possible efficiency for any heat engine operating between T₁ and T₂. No real engine can exceed it.

η_Carnot = (T₁−T₂)/T₁ × 100%  |  T₁ = source temp (K), T₂ = sink temp (K)

⚡ Thermodynamics Formulas

1st Law: Q = ΔU + W  |  For closed system

Carnot COP (refrigerator) = T₂/(T₁−T₂)

Carnot COP (heat pump) = T₁/(T₁−T₂)

η_Carnot always expressed with T in Kelvin (K = °C + 273)

📝
Communicative English
Technical Writing, Grammar, Vocabulary, Presentation Skills | JNTUK R23
40+Questions
I

Technical Writing & Formal Communication

1
2023Unit 18MEasy⭐⭐⭐ Very High
Write a formal email to your HOD requesting permission to attend a technical workshop. Follow proper email format and use appropriate language.

Formal Email Format

To: hod.cse@jntuk.ac.in

Subject: Request for Permission to Attend Technical Workshop

Respected Dr./Prof. [Name],

I am [Your Name], Roll No. [XXXX], currently pursuing B.Tech (CSE) First Year at your esteemed institution. I am writing this email to respectfully seek your permission to attend a two-day technical workshop on "Artificial Intelligence and Machine Learning" being organized by IIT Hyderabad on [Date].

This workshop will provide valuable exposure to emerging technologies and industry trends, which will be highly beneficial for my academic and professional development. The registration fee is nominal and I have already obtained parental consent.

I assure you that I will cover any missed coursework diligently. I humbly request your kind permission and guidance in this regard.

Thanking you in anticipation of your favorable response.

Yours sincerely,
[Your Name]
Roll No: [XXXX]
B.Tech CSE, Sem I

⚡ Email Format Checklist

1. To, Subject — mandatory

2. Salutation: "Respected Sir/Ma'am" or "Dear Dr. [Name]"

3. Opening: State who you are + purpose

4. Body: Specific reason, benefits, assurance

5. Closing: "Yours sincerely" (formal) — NOT "Yours faithfully" unless you don't know the name

6. Signature: Name, Roll No., Dept, Semester

2
2024Unit 28MMedium⭐⭐⭐ High
Write a technical report on "Renewable Energy Sources" for first-year engineering students. Include introduction, types, advantages, challenges, and conclusion.

TECHNICAL REPORT ON RENEWABLE ENERGY SOURCES

1. Introduction: Renewable energy refers to energy derived from naturally replenishing sources such as sunlight, wind, rain, tides, and geothermal heat. Unlike fossil fuels, these sources are inexhaustible and environmentally friendly.

2. Types of Renewable Energy: (a) Solar Energy — photovoltaic cells convert sunlight to electricity; (b) Wind Energy — wind turbines harness kinetic energy; (c) Hydroelectric Power — moving water drives turbines; (d) Biomass — organic matter converted to fuel; (e) Geothermal — Earth's internal heat.

3. Advantages: Environmentally friendly (no greenhouse gas emissions), inexhaustible, reduces dependence on imported fuels, creates employment, and reduces electricity costs long-term.

4. Challenges: High initial setup cost, intermittent availability (solar/wind depend on weather), storage limitations (battery technology), land requirement, and infrastructure gaps in rural areas.

5. Conclusion: With increasing climate concerns and depleting fossil fuels, renewable energy is the future of sustainable development. Government policies and technological advancement are accelerating their adoption worldwide.

⚡ Technical Report Structure

Title → Abstract (optional) → Introduction → Body (numbered sections) → Conclusion → References

Use: Formal tone, third-person, present tense, numbered headings, no contractions

Avoid: "I think", "It's", "etc.", "stuff"

Mathematics-II
Complex Analysis, Laplace Transforms, Fourier Series, Z-Transforms | JNTUK R23
90+Questions
5Units
I

Complex Analysis & Analytic Functions

1
2023Unit 18MMedium⭐⭐⭐ Very High
Show that f(z) = z² is analytic everywhere using Cauchy-Riemann equations. Find f'(z).

Step 1: Express f(z) = u + iv

z = x+iy, z² = x²−y² + 2xyi → u = x²−y², v = 2xy

Step 2: Check C-R Equations ∂u/∂x = ∂v/∂y and ∂u/∂y = −∂v/∂x

∂u/∂x = 2x  |  ∂v/∂y = 2x ✓

∂u/∂y = −2y  |  −∂v/∂x = −2y ✓

Both C-R equations satisfied everywhere → f(z) = z² is entire (analytic everywhere)

f'(z) = ∂u/∂x + i∂v/∂x = 2x + 2yi = 2(x+iy) = 2z
f(z) = z² is analytic everywhere (entire function). f'(z) = 2z.

⚡ C-R Equations Shortcut

C-R: ∂u/∂x = ∂v/∂y AND ∂u/∂y = −∂v/∂x

If f(z) = polynomial in z → always analytic everywhere (entire)

f'(z) = ∂u/∂x + i·∂v/∂x (use after C-R verified)

Non-analytic at: z₀ if C-R fails there

II

Laplace Transforms

2
2023Unit 28MMedium⭐⭐⭐ Very High
Find L{t²·e^(3t)·sin(2t)} using Laplace transform properties.

Step 1: Start with L{sin(2t)}

L{sin(2t)} = 2/(s² + 4)

Step 2: First Shifting (Multiply by e^(3t))

L{e^(at)·f(t)} = F(s−a)

L{e^(3t)·sin(2t)} = 2/[(s−3)² + 4]

Step 3: Multiplication by t² — use L{tⁿf(t)} = (−1)ⁿ·Fⁿ(s)

L{t²e^(3t)sin(2t)} = d²/ds²[2/((s−3)²+4)] = 4[3(s−3)²−4]/[(s−3)²+4]³
L{t²e^(3t)sin(2t)} = 4[3(s−3)²−4] / [(s−3)²+4]³

⚡ Key Laplace Properties

First Shift: L{e^(at)f(t)} = F(s−a)

×t: L{t·f(t)} = −F'(s)

×tⁿ: L{tⁿf(t)} = (−1)ⁿ·F⁽ⁿ⁾(s)

÷t: L{f(t)/t} = ∫_s^∞ F(u)du

Second Shift: L{f(t−a)u(t−a)} = e^(−as)F(s)

III

Fourier Series

3
2024Unit 316MHard⭐⭐⭐ Very High
Find Fourier series of f(x) = x² in [−π, π]. Deduce that π²/6 = 1 + 1/4 + 1/9 + 1/16 + ...

f(x) = x² is even function → bₙ = 0

a₀ = (1/π)∫₋π^π x² dx = (2/π)∫₀^π x² dx = 2π²/3
aₙ = (1/π)∫₋π^π x²cos(nx)dx = (2/π)∫₀^π x²cos(nx)dx = 4(−1)ⁿ/n²

Fourier Series

x² = π²/3 + 4Σ[(−1)ⁿ/n²]cos(nx) for n=1,2,3...

Deduce π²/6 — Put x = π:

π² = π²/3 + 4Σ[(−1)ⁿ·(−1)ⁿ/n²] = π²/3 + 4Σ[1/n²]

2π²/3 = 4Σ(1/n²)

∴ π²/6 = 1 + 1/4 + 1/9 + 1/16 + ... ✓
Fourier Series: x² = π²/3 + 4Σ((-1)ⁿ/n²)cos(nx)  |  Deduction: π²/6 = Σ(1/n²)

⚡ Fourier Coefficient Formulas

a₀ = (1/π)∫₋π^π f(x)dx

aₙ = (1/π)∫₋π^π f(x)cos(nx)dx

bₙ = (1/π)∫₋π^π f(x)sin(nx)dx

Even function → bₙ=0; Odd function → a₀=aₙ=0

🏆
Top 50 Must-Do Questions — All Subjects
Ranked by frequency across 5 years of JNTUK R23 PYQs. Solve these first.
📐
Mathematics-I — Top Questions
Asked 4-6 times each
1
Unit 5 — Eigenvalues
Find Eigenvalues and Eigenvectors of a given 3×3 matrix.
Asked 6x2019-202416M
2
Unit 4 — Vector Calculus
Verify Green's / Stokes' / Gauss Divergence theorem for given F over specified region.
Asked 5x each2020-202416M
3
Unit 1 — ODEs
Solve Bernoulli's / Linear ODE using integrating factor or substitution method.
Asked 5x2019-20248M/16M
4
Unit 3 — PDE
Solve Lagrange's linear PDE using auxiliary equations and multiplier method.
Asked 5x2019-202416M
5
Unit 5 — Cayley-Hamilton
Verify Cayley-Hamilton theorem and use it to find A⁻¹ or higher powers of A.
Asked 5x2020-202416M
⚛️
Engineering Physics — Top Questions
Must-do before exam
1
Unit 4 — Hall Effect
Discuss Hall Effect. Derive Hall Coefficient and explain how to determine semiconductor type.
Asked 6x2019-202410M
2
Unit 1 — Newton's Rings
Derive expression for diameter of nth dark ring in Newton's Rings experiment.
Asked 5x2018-202410-14M
3
Unit 2 — He-Ne Laser
Explain He-Ne laser with energy levels. Derive A and B coefficients relation.
Asked 4x2019-202410M
💻
C Programming — Top Questions
Always asked in exam
1
Unit 4 — Pointers
Write a C program to sort an array using pointers. Explain pointer arithmetic with memory diagram.
Asked 5x2019-20248M
2
Unit 3 — Recursion
Write recursive programs for factorial, Fibonacci, and GCD. Trace function calls.
Asked 6x2019-20244-8M
3
Unit 2 — Arrays
Write C program for Matrix Multiplication. Check dimensions, initialize result, use three nested loops.
Asked 4x2020-20248M

📊 Frequency Analytics by Subject

🔥 Most Repeated Topics

1Eigenvalues (Maths)
6x
2Recursion (C Prog)
6x
3Hall Effect (Physics)
6x
4Li-Ion Battery (Chem)
6x
5Linked List (DS)
5x

📈 High Marks Questions

1Green's/Stokes Theorem
16M
2Cayley Hamilton + A⁻¹
16M
3Fourier Series (Maths II)
16M
4Higher Order ODE
16M
5Linked List (DS)
16M

⚡ Easy Marks (High Probability)

1Armstrong / Palindrome (C)
4M
2Band Theory (Physics)
8M
3Bakelite (Chemistry)
8M
4Stack Push/Pop (DS)
8M
5Gradient/Divergence
8M
🚑
1-Day Exam Survival Plan
Exam tomorrow? Do ONLY these. Skip everything else.
📐 Maths-I Priority
  • ✅ Eigenvalues & eigenvectors (3×3) — 16M guaranteed
  • ✅ Cayley-Hamilton + A⁻¹ — 16M guaranteed
  • ✅ One Green's/Stokes theorem — 16M
  • ✅ One ODE (linear + Bernoulli) — 8M each
  • ✅ Gradient + directional derivative — 8M
⚛️ Physics Priority
  • ✅ Hall Effect derivation — 10M guaranteed
  • ✅ Newton's Rings + derivation — 10M
  • ✅ He-Ne laser + A/B coefficients — 10M
  • ✅ Schrödinger equation + particle in box — 10M
  • ✅ Optical fiber NA formula + calculation — 8M
💻 C Programming Priority
  • ✅ Fibonacci recursive + trace — 8M guaranteed
  • ✅ Matrix multiplication — 8M guaranteed
  • ✅ Armstrong/Palindrome program — 4M each
  • ✅ Pointers + memory diagram — 8M
  • ✅ Structure (student record) — 8M