Aspire Faculty ID #17370 · Topic: CUET MCA 2026 · Just now
CUET MCA 2026

Column AColumn B
(A) Minimum Spanning TreeI. Height balanced
(B) Topological SortII. Stack
(C) RecursionIII. Kruskal's algorithm
(D) AVL TreeIV. DFS

Options:

(a) (A)-I, (B)-II, (C)-III, (D)-IV

(b) (A)-II, (B)-I, (C)-III, (D)-IV

(c) (A)-IV, (B)-III, (C)-II, (D)-I

(d) (A)-III, (B)-IV, (C)-II, (D)-I

Solution

Minimum Spanning Tree → Kruskal's algorithm → III
Topological Sort → DFS based algorithm → IV
Recursion → uses stack → II
AVL Tree → height balanced tree → I

Correct Answer: (d) (A)-III, (B)-IV, (C)-II, (D)-I

Previous 10 Questions — CUET MCA 2026

Nearest first

Next 10 Questions — CUET MCA 2026

Ascending by ID
Ask Your Question or Put Your Review.

loading...