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 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 Data Structures and Algorithms

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!

Java Spring Framework

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

Human Computer Interaction

Enhance your knowledge of Human-Computer Interaction with our specialized MCQs....

JavaScript

Strengthen your web development skills with our JavaScript MCQs. Understand core...

Computer Architecture

Unveil the science behind computer design with our Computer Architecture MCQs. Topics...

Reverse Engineering

Strengthen your understanding of Reverse Engineering with our curated set of MCQs....

PHP

Venture into server-side scripting with our PHP MCQs. Cover everything from syntax...

C# programming

Hone your skills in the C# language with our MCQs. Understand data types, operators,...

Python

Dive into one of the most popular languages with our Python MCQs. Understand...

Data Structures and Algorithms

Journey through the fundamentals of Data Structures and Algorithms with our extensive...