Skip to content
- What do you mean by algorithm? Explain it with example.
- Write the characteristics of algorithm.
- What do you mean by the complexity of algorithm?
- Explain Asymptotic Notation.
- Explain Little-oh notation and Little omega notation . Also Discuss relationship between O, o, theta, omega, and omega notation.
- Write a note on optimality and Reduction.
- Explain Master’s Theorem.
- Explain divide and conquer recurrences.
- What do you mean by recursion? Explain your answer with an example.
- Explain Recursion Tree.
- Write pseudocode of Insertion sort. Also find out its computing time and do analysis of insertion sort.
- Write pseudocode for QuickSort. Also find out its computing time and do analysis of QuickSort.
- Write a short note on Randomized Version of Quick Sort.
- Explain Merge Sort. Write its algorithm and do its analysis.
- Explain Heap Sort. Write its algorithm and do its analysis.
- Explain Heapify sort algorithm with its analysis.
- Explain Shell sort algorithm with its analysis.
- Explain Radix sort algorithm with its analysis.
- Explain Bucket sort algorithm with its analysis.
- Explain Counting sort algorithm with its analysis.
- Determine the best case time complexity of merge sort Algorithm.