Register

NIELIT Scientific Assistant June 2025 | Question: 72

• recategorized by
196 views
0 0 votes

Which of the following problems can be solved using a greedy approach?

  1. Knapsack problem ($0/1$ version)
  2. Job Scheduling with deadlines and profits
  3. Fibonacci sequence calculation
  4. Finding the shortest path in a weighted graph

1 Answer

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 → · NIELIT Scientific As...
Position:
Show:

Related questions

1 1 vote
1 1 answer
194
194 views
Shubham Sharma 2 asked Jul 24, 2025
194 views
NIELIT Scientific Assistant June 2025 | Question: 119
Which of the following problems is solved using dynamic programming?Merge sortDepth-first searchBreadth-first searchFibonacci sequence calculation
1 1 vote
1 1 answer
268
268 views
Shubham Sharma 2 asked Jul 24, 2025
268 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...
1 1 vote
1 1 answer
149
149 views
Shubham Sharma 2 asked Jul 24, 2025
149 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...
2 2 votes
1 1 answer
203
203 views
Shubham Sharma 2 asked Jul 24, 2025
203 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