engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
Pick up the incorrect statement :
1
0/1 knapsack problem solution may fill the knapsack completely for every instance.
2
Huffman code generation is an application of optimal merge pattern.
3
All pairs shortest path problem for n vertices is solved in O(n3) time.
4
If one NP – Hard problem is solved then all NP – Hard problems can also be solved.