Question 1     

A

Greedy Approach



B

BackTracking



C

Dynamic Programming



D

All the above

Question 2     

A

True



B

False

Question 3     

A

A only



B

B only



C

Both A & B



D

Neither A nor B

Question 4     

A

True



B

False

Question 5     

A

promising node in backtracking means the node at which partial solution exits



B

Non-promising node is the node which has no chance of any solution



C

for only promising nodes state-space tree will be constructed



D

All the above

Question 6     

A

BFS



B

DFS



C

Either A or B



D

Neither A nor B

Question 7     

A

N queen problem



B

subset sum problem



C

Sudoku



D

crosswords



E

All the above

Question 8     

A

92



B

13



C

12



D

91

Question 9     

A

2



B

3



C

Botha A & B



D

For all values of n it’s possible

Question 10     

A

1



B

4



C

3



D

2