adplus-dvertising
frame-decoration

Question

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)

a.

3 x p

b.

a constant

c.

p x (m div 3)

d.

p x (m mod 3)

Posted under Algorithm Complexity Data Structures and Algorithms

Answer: (c).p x (m div 3)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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)
Add Comment

Similar Questions

Discover Related MCQs

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...

Software Architecture and Design

Get a strong hold on the blueprint of software systems with our Software Architecture...

Systems Analysis and Design Methods

Get familiar with the process of designing and improving business systems with our...

SQL Server

Master Microsoft's database server with our SQL Server MCQs. Topics cover database...

MS Office

Master the suite of productivity tools with our MS Office MCQs. From Word and Excel...

Computer Graphics

Step into the visual side of computing with our Computer Graphics MCQs. Cover topics...

Operating System

Dive deep into the core of computers with our Operating System MCQs. Learn about...

Object Oriented Programming Using C++

Enhance your programming skills with our MCQs on Object Oriented Programming using...

Web Technologies

Master the building blocks of the web with our Web Technologies MCQs. From HTML and...