Software Engineering & Coding - Data Structures & Algorithms (DSA)

Arrays, Strings & Complexity Analysis question bank (Linear Data Structures & Analysis)

Practice 5,056 free Software Engineering & Coding - Data Structures & Algorithms (DSA) Linear Data Structures & Analysis - Arrays, Strings & Complexity Analysis questions with answers and step-by-step solutions.

Start free Book a demo
All Hard Medium
Q1.
[Quantitative Aptitude - Technical Interview #1] 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)
30 hours
(C)
24 hours
(D)
16 hours
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.
[Graph Algorithms - Technical Interview #3] 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)
Kruskal's Algorithm using Union-Find disjoint sets
(B)
Floyd-Warshall Algorithm using dynamic programming adjacency matrix
(C)
Bellman-Ford Algorithm with relaxation over V-1 iterations
(D)
Dijkstra's Algorithm using a binary min-heap / priority queue
Show answer & solution
Verified Answer & Solution Locked
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Protected Questions

Unlock All 2529 Questions in Arrays, Strings & Complexity Analysis

Log in or sign up free to access every question with complete solutions, create chapter practice tests, and track your performance.

Sign in to unlock Create free account

Sign up free to access all 2,529 questions

Unlock every Arrays, Strings & Complexity Analysis question, generate papers, and practice at your own pace.

Start free