Algorithms
Divide & Conquer
Greedy Method
Dynamic Programming
Branch & Bound
100

What is an algorithm?

Step by step instructions to solve the problem

100

Which algorithm is used in decrease & conquer method?

Topological sorting

100

Which algorithm is used for minimum cost spanning tree?

Prims and Kruskals algorithm

100

which algorithm is used for transitive closure?

Warshalls algorithm

200

Which Data Structure used to perform recursion?

Stack

200

What is the best case complexity of selection sort?

n^2

200

Fractional knapsack problem is solved efficiently by which method?

Greedy method

200

Dynamic programming is used to find

All optimal solution is generated

300

Say true or false: Algorithm should have finite number of steps

true

300

What is the worst case time complexity of merge sort?

O(N logN)

300

What is the objective of knapsack problem?

To get the maximum value in the knapsack

300

What approach is being followed in floyd warshall algorithm?

Dynamic programming

300

Hamiltonian path problem is

NP complete problem

400

Algorithms can be represented as?

Pseudocode and flowchart

400

What is the average case complexity of merge sort?

O(NlogN)

400

Which algorithm strategy builds up a solution by choosing the option that looks best at every step?

Greedy method

400
Fractional knapsack problem is also known as

Continuous knapsack problem

400

Which algorithm can be used in solving the hamiltonian path?

Branch and Bound

500

Which data structure has better running time?

Queue or priority queue

Priority queue

500

Which algorithm is used to sort the elements by using insertion and deletion methods?

Heap sort

500

Which algorithm is similar to dijkstra's algorithm in dynamic programming?

Bell-man ford algorithm