Unit 1: Introduction to Algorithm

Q1). What do you mean by algorithm? Explain it with example.
Q2). Write the characteristics of algorithm.
Q3). What do you mean by the complexity of algorithm?
Q4). Explain Asymptotic Notation.
Q5). Explain Little-oh notation and Little omega notation . Also Discuss relationship between O, o, theta, omega, and omega notation.
Q6). Write a note on optimality and Reduction.
Q7). Explain Master's Theorem.
Q8). Explain divide and conquer recurrences.
Q9). What do you mean by recursion? Explain your answer with an example.
Q10). Explain Recursion Tree.
Q11). Write pseudocode of Insertion sort. Also find out its computing time and do analysis of insertion sort.
Q12). Write pseudocode for QuickSort. Also find out its computing time and do analysis of QuickSort.
Q13). Write a short note on Randomized Version of Quick Sort.
Q14). Explain Merge Sort. Write its algorithm and do its analysis.
Q15). Explain Heap Sort. Write its algorithm and do its analysis.
Q16). Explain Heapify sort algorithm with its analysis.
Q17). Explain Shell sort algorithm with its analysis.
Q18). Explain Radix sort algorithm with its analysis.
Q19). Explain Bucket sort algorithm with its analysis.
Q20). Explain Counting sort algorithm with its analysis.
Q21). Determine the best case time complexity of merge sort Algorithm.