Question Bank
Q1. Explain Properties of good algorithm?
Q2. Explain Time complexity in details?
Q3. Explain Asymptotic Notations.
Q4. Explain P, NP,NP-hard and NP-complete in details?
Q5. Explain selection sort with example?
Q6. Explain Substitution method with example?
Q7. What is recursion tree? Describe
Q8. Explain divide and conquer strategy
Q9. Explain quick sort algorithm using divide and conquer algorithm
Q10. Explain Binary search using divide and conquer algorithm
Q11. Write an algorithm for finding maximum and minimum number from given set?
Q12. Explain control abstraction in greedy method
[Link] is the single source shortest path algorithm. Write an algorithm to find single source
shortest path using greedy methods.
[Link] is 0/1 knapsack and fractional knapsack problem
Q15. Write a note on job sequencing problem using greedy approach
[Link] prim’s algorithm of MST. Mention its time complexity.
Q17. Write kruskal’s algorithm for finding a minimum spanning tree. Compute the time
complexity of the same.
Q18. Explain multistage graph with example.
[Link] a short note on state space tree
Q20. Explain N-Queen problem in details.
Q21. Analyze sum of subset algorithm
Q22. Write a short note on branch and bound strategy.
Q23. Write note on travelling sales person problem.
Q24. Explain naïve string matching algorithm with example.
Q25. Write a short note on rabin karp algorithm
Q26. Write short note on knuth-morris-pratt’s pttern matching