Question 1     

A

True



B

False

Question 2     

A

100



B

011



C

110



D

010



E

Both A & B

Question 3     

A

Travelling Salesman Problem



B

Knapsack Problem



C

Minimum spanning tree Algorithms



D

Job Scheduling Problem



E

All the above

Question 4     

A

O(n^2)



B

O(logn)



C

O(2^n)



D

O(nlogn)

Question 5     

A

Greedy and Dynamic Programming are two types of programming paradigms to optimise the problems



B

Every Problem can be solved using Greedy approach



C

Greedy approach is one of the efficient approaches



D

Greedy approach always gives you time complexity in polynomial time

Question 6     

A

Greedy Approach



B

Recursion



C

Both A & B



D

None of the above

Question 7     

A

Greedy Approach



B

Dynamic Programming



C

Back Tracking



D

Brute Force

Question 8     

A

Full Tree



B

Left splay tree



C

Right splay tree



D

Both B & C

Question 9     

A

O(nlogn)



B

O(n*n)



C

O(logn)



D

O(2^n)

Question 10     

A

True



B

False