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.

2026 (20200 questions)

Q1.
[Graph Algorithms - Technical Interview #33] Which algorithm is guaranteed to find the shortest path from a single source vertex to all other vertices in a weighted directed graph with non-negative edge weights in O((V + E) log V) time?

(A)
Floyd-Warshall Algorithm using dynamic programming adjacency matrix
(B)
Dijkstra's Algorithm using a binary min-heap / priority queue
(C)
Bellman-Ford Algorithm with relaxation over V-1 iterations
(D)
Kruskal's Algorithm using Union-Find disjoint sets
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers and step-by-step solutions.
Sign in to view
Q2.
[Quantitative Aptitude - Technical Interview #9] 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)
16 hours
(C)
24 hours
(D)
30 hours
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers and step-by-step solutions.
Sign in to view

2024 (24 questions)

Q1.

GATE Technical Standard: In computational modeling of 'Asymptotic Notations Big-O Omega Theta', 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 (Asymptotic Notations Big-O Omega Theta)

(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
Sign in to your free student account to reveal verified answers and step-by-step solutions.
Sign in to view
Q2.

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
Sign in to your free student account to reveal verified answers and step-by-step solutions.
Sign in to view
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?

Sign up free to unlock every previous year question and generate papers from them.