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.

[Graph Algorithms - Technical Interview #2] 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)

Dijkstra's Algorithm using a binary min-heap / priority queue

(B)

Floyd-Warshall Algorithm using dynamic programming adjacency matrix

(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

Q2.

[Operating Systems & Systems - Technical Interview #4] Which condition is NOT necessary for a system deadlock to occur according to Coffman's conditions?

(A)

Hold and wait

(B)

Mutual exclusion

(C)

Circular wait

(D)

Preemption of allocated resources by high-priority processes

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 2527 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 up free to access all 2,527 questions

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

Start free