M

Mr. Dubey • 52.30K Points
Coach 

Q. What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

(A) o(1)
(B) o(n)
(C) o(n2)
(D) o(2n)
Correct : Option (D)

Explanation: 
 in the brute force algorithm, all the possible ways are calculated which are of the order of 2n.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The portion of physical layer that interfaces with the media access control sublayer is called

Q. Which of the following storage devices exposes its storage to clients as Raw storage that can be partitioned to create volumes?

Q. SYNC flooding attack belongs to a type of security attack known as ___________

Q. ________________ is not a category of SQL command.

Q. The Assumption of pervasive computing is about and technology.

Q. The majority of publically available Internet information sources are:

Q. The ____________is implemented more efficiently than a general parallel region containing possibly several loops.

Q. What is the fundamental insight underlying the "cognitive walk through" method of evaluation?

Q. Information content is

Q. Consider a complete graph G with 4 vertices. The graph G has spanning trees.