Coding & campus placements

Software Engineering & Coding - Data Structures & Algorithms (DSA) previous year questions (PYQ)

20,224 previous year Software Engineering & Coding - Data Structures & Algorithms (DSA) questions, grouped by year, with answers and solutions.

Start free Book a demo

2026 (20200 questions)

Q1.

[Quantitative Aptitude - Technical Interview #160] A pipe can fill a reservoir in 12 hours, while a leak at the bottom can empty it in 20 hours. If both operate simultaneously, in how many hours will the reservoir be completely filled?

(A)

32 hours

(B)

24 hours

(C)

30 hours

(D)

16 hours

Show answer & solution

Verified Answer & Solution Locked

Q2.

[Quantitative Aptitude - Technical Interview #136] A pipe can fill a reservoir in 12 hours, while a leak at the bottom can empty it in 20 hours. If both operate simultaneously, in how many hours will the reservoir be completely filled?

(A)

16 hours

(B)

32 hours

(C)

24 hours

(D)

30 hours

Show answer & solution

Verified Answer & Solution Locked

2024 (24 questions)

Q1.

Engineering Analysis & Principles: In technical analysis of 'Two Pointers Sliding Window and Kadane Algorithm' within Arrays, Strings & Complexity Analysis, which governing relationship or mathematical model determines optimal system response under equilibrium conditions?

(A)

First-order linear differential operator with boundary conditions matching system eigenvalues (Two Pointers Sliding Window and Kadane Algorithm)

(B)

Zero-order static algebraic summation neglecting non-linear feedback

(C)

Unconstrained stochastic random walk without conservation criteria

(D)

Non-convergent divergence theorem with unbounded parameter drift

Show answer & solution

Verified Answer & Solution Locked

Q2.

GATE Technical Standard: In computational modeling of 'Two Pointers Sliding Window and Kadane Algorithm', what constitutes the primary performance trade-off regarding asymptotic efficiency and resource conservation?

(A)

Minimizing peak algorithmic runtime and memory latency through optimal dynamic constraints (Two Pointers Sliding Window and Kadane Algorithm)

(B)

Maximizing redundant register transfers to force artificial synchronization

(C)

Arbitrary thread serialization without mutex coordination or race mitigation

(D)

Unbounded stack consumption with circular recursive invocation

Show answer & solution

Verified Answer & Solution Locked

All Years Protected

Want All 20224 Software Engineering & Coding - Data Structures & Algorithms (DSA) PYQs?

Sign up free to unlock every previous year question paper with detailed solutions, practice in timed exam mode, and evaluate your rank.

Ready to practice Software Engineering & Coding - Data Structures & Algorithms (DSA) PYQs?

Start free Chat on WhatsApp