DAA Unit 5: Selected Topic Previous year questions

What do you mean by String matching ? Also explain string, sub string and proper sub string. Explain Knuth-Morris-Pratt Algorithm and give its analysis. Explain Naïve string matching algorithm and also discuss its analysis. Discuss the string matching with finite automata. Write an algorithm for Rabin-Karp method. Also give a suitable example to explain it. … Read more

DAA Unit 4: Advanced Design and Analysis Previous Year Questions

Write a note on Dynamic programming. Write a difference between Dynamic programming and Greedy approach. Write the elements of Dynamic programming. Explain Matrix-chain multiplication problem and solve it by using Dynamic Programming with one example. Explain Longest Common Subsequence. Write its pseudo code for computing the length of LCS. Explain knapsack problem. Write its Greedy … Read more

DAA Unit 1: Introduction to Algorithm Previous Year Questions

In this article, you will get the all-important questions that are mostly asked in the semester exams. We have collected this list of questions by taking help from the previous year’s question paper from the subject design and analysis of the algorithm. So Before going for the final semester exam of the subject Algorithm, Please … Read more

DBMS Unit 5: Concurrency Control Technique Previous Year Questions

What do you mean by concurrency control techniques? Write the comparison between single user and multi-user system. What do you mean by Transaction? Write the ACID property of Transaction. What is the need of concurrency control. Explain the lost update problem and dirty read problem. Describe the problem faced when concurrent transaction are executing in … Read more

Unit 3: Database Design and Normalization previous Year Questions

Write a short note on decomposition. Write a note on Normalization. What do you mean by lossless join? Explain. What do you mean by dependency preservation? Define Functional Dependency ? What do you mean by Lossless Decomposition? Explain with a suitable example how functional dependencies can be used to show that decomposition are lossless. What … Read more