What is Complexity of an Algorithm?

Define big O notation

What is pseudocode?

Define flowchart.

What is asymptotic notation?

What is brute force algorithm?

Define exhaustive search.

What is feasibility?

Define Hamiltonian circuit.

Define merge sort.

What is heap sort?

What is binary search?

Define Dijkstra's algorithm.

Define Huffman trees.

What do you mean by optimum solution?

What are BFS and DFS?

Define closest-pair problem.

Define divide and conquer technique.

Explain Strassen's matrix multiplication.

What are the features of dynamic programming?

Explain Greedy method.

Explain Minimal Spanning Tree (MSP).

State and explain assignement problem.

Explain Kruskal algorithm with example.

Explain and compute the complexity of quick sort algorithm.

How do you compute Huffman code?

Compute the time complexity of linear search.

Compute the time complexity of selection sort.

Explain time complexity using big O notation for sum of natural numbers.