Register

NIELIT 2016 DEC Scientist B (CS) - Section B: 52

• retagged by
1,973 views
0 votes
0 votes

The concept of order Big O is important because

  1. It can be used to decide the best algorithm that solves a given problem
  2. It is the lower bound of the growth rate of algorithm
  3. It determines the maximum size of a problem that can be solved in a given amount of time
  4. Both (A) and (B)
• retagged by
User Avatar

2 Answers

0 votes
0 votes

Option (A) It can be used to decide the best algorithm that solves a given problem

User Avatar
0 votes
0 votes
Option A) is correct , It can be used to decide the best algorithm that solves the problem.
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

4 votes
4 votes
4 answers
1
admin asked Mar 31, 2020
84,862 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 16
Two main measures for the efficiency of an algorithm are: Processor and Memory Complexity and Capacity Time and Space Data and Space
Two main measures for the efficiency of an algorithm are:Processor and MemoryComplexity and CapacityTime and SpaceData and Space
User Avatar
1 votes
1 votes
1 answer
2
admin asked Mar 31, 2020
1,092 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 27
What is the solution to the recurrence $T(n)=T \bigg (\dfrac{n}{2} \bigg )+n$? $O(\log n)$ $O(n)$ $O(n\log n)$ None of these
What is the solution to the recurrence $T(n)=T \bigg (\dfrac{n}{2} \bigg )+n$?$O(\log n)$$O(n)$$O(n\log n)$None of these
User Avatar
2 votes
2 votes
2 answers
3
admin asked Mar 31, 2020
8,640 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 7
The Knapsack problem belongs to which domain of problems? Optimization NP complete Linear Solution Sorting
The Knapsack problem belongs to which domain of problems?OptimizationNP completeLinear SolutionSorting
User Avatar
2 votes
2 votes
4 answers
4
admin asked Mar 31, 2020
15,564 views
NIELIT 2016 DEC Scientist B (CS) - Section B: 12
The running time of Quick sort algorithm depends heavily on the selection of: No. of inputs Arrangement of elements in an array Size of elements Pivot Element
The running time of Quick sort algorithm depends heavily on the selection of:No. of inputsArrangement of elements in an arraySize of elementsPivot Element
User Avatar
Link Copied!