Discrete Mathematics Freshers Online Exam Quiz
Discrete Mathematics Freshers GK Quiz. Question and Answers related to Discrete Mathematics Freshers. MCQ (Multiple Choice Questions with answers about Discrete Mathematics Freshers
Which algorithm is better for sorting between bubble sort and quicksort?
Options
A : bubble sort
B : quick sort
C : both are equally good
D : none of the mentioned
If for an algorithm time complexity is given by O(n) then the complexity of it is ___________
Options
A : constant
B : linear
C : exponential
D : none of the mentioned
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
If for an algorithm time complexity is given by O(log2n) then complexity will be ___________
Options
A : constant
B : polynomial
C : exponential
D : none of the mentioned
If for an algorithm time complexity is given by O(n2) then complexity will ___________
Options
A : constant
B : quadratic
C : exponential
D : none of the mentioned
If for an algorithm time complexity is given by O((3?2)n) then complexity will be ___________
Options
A : constant
B : quardratic
C : exponential
D : none of the mentioned
The time complexity of binary search is given by ___________
Options
A : constant
B : quardratic
C : exponential
D : none of the mentioned
Which is used to measure the Time complexity of an algorithm Big O notation?
Options
A : describes limiting behaviour of the function
B : characterises a function based on growth of function
C : upper bound on growth rate of the function
D : all of the mentioned
The time complexity of the linear search is given by ___________
Options
A : O(log2n)
B : O(1)
C : exponential
D : none of the mentioned
Time complexity of the binary search algorithm is constant.
Options
A : True
B : False
C :
D :
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Discrete Mathematics Equivalence Classes Partitions
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