Forgot Password?
Mobile number is now mandatory for the security of your account.
We've sent you a verification code on your mobile number. Please enter it here to set a new password.
We've sent you a verification code on your mobile number or email address. Please enter it here to set a new password.
(a) Explain Strassen's algorithm for matrix multiplication.
(a) Explain Merge Sort and compute the analysis of merge sort.
(b) Explain NP-completeness reduction with an example.
(j) Explain NP Hard Problem briefly.
(i) Write Naive String Matching Algorithm.
(h) What is Matroid?
(g) Differentiate between Dynamic Programming and Greedy Approach.
(f) Explain fractional knapsack problem.
(e) What are the applications of minimum spanning tree?
(d)What is optimal substructure and overlapping substructure?
(c) Write a short note on Memorization.
(b) What is recursion tree method?
(a) Define little Omega and little Oh notation.
(b) What is Finite Automata and its significance to match a string witha lgorithm and complexity.
(a) Explain Rabin-Karp string matching algorithm.
(a) Give Knuth Morris Pratt algorithm for pattern matching?
Illustrate Dijkstra's and Bellman Ford Algorithm for finding the shortest path.
(b) What is an optimal Huffman Code for the following set of frequencies?
a:1 b: 1 c:2 d:3 e:5 f:8 g:13 h:21
(a) Explain the difference between Kruskal's and Prim's Algorithm with the help of suitable example.
(b) Determine the LCS of <A,B,C,B,D,A,B> and <B,D,C,A,B,A>.
(a) What does Dynamic programming have common with Divide and Conquer and what are differences?
(b) Apply Floyd-Warshall algorithm for constructing shortest path.
(a) Explain Floyd-Warshall algorithm.
(b) Apply Strassen's matrix multiplication algorithm to multiply the following matrices.
b) Perform the Quick Sort to sort the following numbers.
20, 40, 50, 15, 10, 05, 80, 90
Congratulations! Your trial of
is now active.
Let's catch up on a Zoom call and I'll help you craft a killer career plan! Bring your own coffee.
Sourabh Bajaj
