Register

NIELIT Scientific Assistant June 2025 | Question: 119

• recategorized by
185 views

1 Answer

0 0 votes
  • Merge sort: This is a classic example of a Divide and Conquer algorithm that recursively splits and sorts sub-arrays.
  • Depth-first search: A graph traversal technique that uses a Stack (or recursion) to explore as deep as possible along a branch.
  • Breadth-first search: A graph traversal technique that uses a Queue to explore all neighbor nodes at the current depth before moving deeper.
  • Fibonacci sequence calculation: A problem solved by Dynamic Programming because it involves overlapping subproblems where results are stored to avoid re-calculation.

     

  • So optino D is correct.
Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT Scientific As...Next → · NIELIT Scientific As...
← Previous in category · NIELIT Scientific As...Next in category → · Application of Sorti...
Position:
Show:

Related questions

2 2 votes
1 1 answer
196
196 views
Shubham Sharma 2 asked Jul 24, 2025
196 views
NIELIT Scientific Assistant June 2025 | Question: 69
Which traversal method can be used to print the nodes of a binary tree in ascending order?Pre-order traversalPost-order traversalIn-order traversalLevel-order traversal
1 1 vote
1 1 answer
259
259 views
Shubham Sharma 2 asked Jul 24, 2025
259 views
NIELIT Scientific Assistant June 2025 | Question: 67
Which of the following algorithms is used to find the minimum spanning tree in a graph?Dijkstra's AlgorithmKruskal's AlgorithmBellman-Ford AlgorithmFloyd-Warshall Algorit...
0 0 votes
1 1 answer
186
186 views
Shubham Sharma 2 asked Jul 24, 2025
186 views
NIELIT Scientific Assistant June 2025 | Question: 72
Which of the following problems can be solved using a greedy approach?Knapsack problem ($0/1$ version)Job Scheduling with deadlines and profitsFibonacci sequence calculat...
1 1 vote
1 1 answer
137
137 views
Shubham Sharma 2 asked Jul 24, 2025
137 views
NIELIT Scientific Assistant June 2025 | Question: 76
Which of the following is the correct asymptotic notation for an algorithm that grows slower than $\text{O}\left(n^{\wedge} 2\right)$ but faster than $\text{O}(n)?$$\text...