Backtracking Algorithms Questions

MCQ bookmark_border

1.

What is the type of the algorithm used in solving the 8 Queens problem?

A

Backtracking

B

Dynamic

C

Branch and Bound

D

D and C

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

2.

Let G be a graph with

A

O(nm)

B

O(n+m)

C

O(mnm)

D

O(nmn).

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

Find the odd one out from the following categories of algorithms.

A

TVSP

B

N-Queens

C

15-Puzzle

D

Bin-Packing.

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

Name the node which has been generated but none of its children nodes have been generated in state space tree of backtracking method.

A

Dead node

B

Live node

C

E-Node

D

State Node

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

What is the type of the algorithm used in solving the 4 Queens problem?

A

Greedy

B

Dynamic

C

Branch and Bound

D

Backtracking.

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

Which design strategy stops the execution when it find the solution otherwise starts the problem from top

A

Back tracking

B

Divide and conquer

C

Branch and Bound

D

Dynamic programming

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

what is the space complexity of 4-Queen problem

A

O(|V|)

B

O(|E|)

C

O(|V|+|E|)

D

O(|V2|)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

Time complexity of 4-queen problem

A

O(|V|)

B

O(|E|)

C

O(|V|+|E|)

D

O(|V2|)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

The method which stops the execution ,if it find the solution. Otherwise it start from the top

A

Branch and bound

B

Dynamic programming

C

Back tracking

D

Divide and conquer

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

Which is not return optimal solution from the following methods

A

Dynamic programming

B

Backtracking

C

Branch and bound

D

Greedy method

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion