Campus Placements & IT Recruitment - Aptitude (TCS NQT & IT Majors)

Data Interpretation & Sufficiency question bank (Reasoning Ability & Logical Deduction)

Practice 5,052 free Campus Placements & IT Recruitment - Aptitude (TCS NQT & IT Majors) Reasoning Ability & Logical Deduction - Data Interpretation & Sufficiency 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)

Kruskal's Algorithm using Union-Find disjoint sets

(B)

Floyd-Warshall Algorithm using dynamic programming adjacency matrix

(C)

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

(D)

Bellman-Ford Algorithm with relaxation over V-1 iterations

Show answer & solution

Verified Answer & Solution Locked

Q2.

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

Bellman-Ford Algorithm with relaxation over V-1 iterations

(C)

Floyd-Warshall Algorithm using dynamic programming adjacency matrix

(D)

Kruskal's Algorithm using Union-Find disjoint sets

Show answer & solution

Verified Answer & Solution Locked

Protected Questions

Unlock All 2525 Questions in Data Interpretation & Sufficiency

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

Unlock every Data Interpretation & Sufficiency question, generate papers, and practice at your own pace.

Start free