Question: If for an algorithm time complexity is given by O(1) then the complexity of it is ____________

Options

A : constant

B : polynomial

C : exponential

D : none of the mentioned

Click to view Correct Answer

Previous || Next

Discrete Mathematics Freshers more questions

Delay of the resource allocated during setup phase during data....

Delay of the resource allocated on demand during data transfer....

During the process of freezing the temperature is _________

Swineburne’s test is applicable to those machines in which flux....

If for an algorithm time complexity is given by O(n)....

If for an algorithm time complexity is given by O(log2n)....

If for an algorithm time complexity is given by O(n2)....

The output of an first order hold between two consecutive....

If for an algorithm time complexity is given by O((3?2)n)....

The time complexity of binary search is given by ___________

Chemical Engineering Basics - Part 1 more Online Exam Quiz

Discrete Mathematics Equivalence Classes Partitions

Discrete Mathematics Exam

Discrete Mathematics Experienced

Discrete Mathematics Finite State Automation

Discrete Mathematics Floor Ceiling Function

Discrete Mathematics Fundamental Principle Counting

Discrete Mathematics Generating Functions

Discrete Mathematics Geometric Probability

Discrete Mathematics Geometric Sequences

Discrete Mathematics Graph Matrices