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

Graph Algorithms & Dynamic Programming question bank (Trees, Graphs & Algorithmic Paradigms)

Practice 5,056 free Software Engineering & Coding - Data Structures & Algorithms (DSA) Trees, Graphs & Algorithmic Paradigms - Graph Algorithms & Dynamic Programming questions with answers and step-by-step solutions.

Start free Book a demo
All Hard Medium
Q1.
[Quantitative Aptitude - Technical Interview #2] 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
Sign in to your free student account to reveal verified answers, instant hints, and detailed explanations.
Sign in to view
Q2.
[Operating Systems & Systems - Technical Interview #4] Which condition is NOT necessary for a system deadlock to occur according to Coffman's conditions?

(A)
Circular wait
(B)
Hold and wait
(C)
Mutual exclusion
(D)
Preemption of allocated resources by high-priority processes
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 2527 Questions in Graph Algorithms & Dynamic Programming

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,527 questions

Unlock every Graph Algorithms & Dynamic Programming question, generate papers, and practice at your own pace.

Start free