With these types of question, you can score 60- 70 marks in this subject. But if you want to score more please solve more numericals..
1. What do you mean by algorithm ? Write its characteristics. 2. Discuss quick sort method and analyze its complexity. 3. Explain the concept of merge sort with example. 4. Write short note on heap sort algorithm with its analysis. 5. Explain HEAP SORT on the array with example.
1. What is red-black tree ? Write an algorithm to insert a node in an empty red-black tree explain with suitable example. 1. Insert the following information, F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E, G, I into an empty B-tree with degree t = 3.
2. What is a Fibonacci heap ? Discuss the applications of Fibonacci heaps. 3. Explain the insertion and deletion algorithm in a red-black tree. 4. Explain skip list. Explain its operations.
1. Write short note on divide and conquer. Write algorithm for merge sort and quick sort. 2. What do you mean by graphs? Discuss various representations of graphs. 3. Explain DFS. Also give DFS algorithm. 4. Explain convex hull problem.
1. Describe and compare following algorithms to determine the minimum cost spanning tree : i. Kruskal’s algorithm ii. Prim’s algorithm 2. What do you mean by spanning tree and minimum spanning tree ?[2 marks] 3. State Bellman-Ford algorithm.
1. What is the principle of optimality ? Also give approaches in dynamic programming. 2. Differentiate between dynamic programming and greedy approach. 5. What is backtracking ? [2 marks]
1. Write short notes on N-Queens problem with numericals. 2. What is branch and bound technique ? [2 marks] 3. What is backtracking? Solve the subset sum problem using backtracking, where n = 4, m = 18, w[4] = {5, 10, 8, 13}. 4. Differentiate between backtracking and branch and bound approach.
1. Describe in detail Knuth-Morris-Pratt string matching algorithm. Compute the prefix function for the pattern ababbabbabbababbabb when the alphabet is = {a, b}. 2. What is string matching algorithm ? Explain Rabin-Karp method with examples. 3. Discuss the problem classes P, NP and NP-complete. 5. Show that CLIQUE problem is NP-complete.
1. Differentiate between Big Oh(O) and theta() notations with suitable examples. [2 marks] 2. Single source shortest path. [2 marks] 3. Define graph colouring. [2 marks] 4. List any two approximation algorithms. [2 marks] 4. Differentiate NP-complete with NP-hard.
With these types of question, you can score 60- 70 marks in this subject. But if you want to score more please solve more numericals..