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

Home / Engineering / Design and Analysis of Algorithms / Question

M

Mr. Dubey • 51.43K 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 answer : Option (D) - o(2n)

Explanation:

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

Share

Discusssion

Login to discuss.

Related MCQs on Design and Analysis of Algorithms

Q. The size of an IP address in IPv6 is

Q. If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.

Q. Match all items in Group 1 with correct options from those given in Group 2. List I List II P. Regular Expression 1. Syntax analysis Q. Push down automata 2. Code Generation R. Dataflow analysis 3. Lexical analysis S. Register allocation 4. Code optimization

Q. There are _________ types of VPNs.

Q. Datagrams are routed to their destinations with the help of ________

Q. showed better performance than other approaches, even without a context- based model

Q. Who developed a mechanical device in the 17th century that could add, subtract, multiple, divide and find square roots?

Q. WPA2 is used for security in _______

Q. ISO 9001 is not concerned with of quality records