adplus-dvertising
frame-decoration

Question

Using the standard algorithm, what is the time required to determine that a number n is prime ?

a.

Linear time

b.

Constant time

c.

Quadratic time

d.

Logarithmic time

Posted under Algorithm Complexity Data Structures and Algorithms

Answer: (a).Linear time

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Using the standard algorithm, what is the time required to determine that a number n is prime ?
Add Comment

Similar Questions

Discover Related MCQs

Q. Let m, n be positive integers. Define Q (m, n) as Q (m, n) = 0, if m>n Then Q (m, 3) is (a div b, gives the quotient when a is divided by b)

View solution

Q. The worst case occur in quick sort when

View solution

Q. What does it mean when we say that an algorithm X is asymptotically more efficient than Y?

View solution

Q. The complexity of Fibonacci series is

View solution

Q. The worst case complexity for insertion sort is

View solution

Q. The worst case complexity of quick sort is

View solution

Q. To measure Time complexity of an algorithm Big O notation is used which:

View solution

Q. If for an algorithm time complexity is given by O(1) then complexity of it is:

View solution

Q. If for an algorithm time complexity is given by O(log2n) then complexity will:

View solution

Q. If for an algorithm time complexity is given by O(n) then complexity of it is:

View solution

Q. If for an algorithm time complexity is given by O(n²) then complexity will:

View solution

Q. If for an algorithm time complexity is given by O((3/2)ⁿ) then complexity will:

View solution

Q. The time complexity of binary search is given by:

View solution

Q. The time complexity of linear search is given by:

View solution

Q. Time complexity of binary search algorithm is constant.

View solution

Q. Which is the best data structure for round robin algorithm for CPU scheduling?

View solution

Q. Which algorithm is having highest space complexity?

View solution

Q. If the array is already sorted, then the running time for merge sort is:

View solution
View All MCQs on Algorithm Complexity

Suggested Topics

Are you eager to expand your knowledge beyond Data Structures and Algorithms? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!

Computer Hardware

Explore the tangible components of computers with our Computer Hardware MCQs. Learn...

Neural Networks

Dive into the world of Artificial Intelligence with our Neural Networks MCQs. Uncover...

Java Programming

Level up your coding skills with our Java Programming MCQs. From object-oriented...

Cloud Computing

Stay on top of the biggest trend in IT with our Cloud Computing MCQs. These questions...

Discrete Mathematics

Refine your mathematical skills essential for computer science with our Discrete...

Wireless and Mobile Communications

Get to grips with modern communication technologies with our Wireless and Mobile...

Java Spring Framework

Enhance your Java development skills with our Spring Framework MCQs. Learn about...

CSS

Polish your web design skills with our CSS MCQs. Learn about selectors, properties,...

Internet of Things (IoT)

Discover how devices communicate with each other in the smart world with our IoT...