Back to the 2024 paper
Similar questions
Design and Analysis of Algorithms Answer the following: (i) Describe randomized algorithms. (ii) Write the algorithm for randomized quick sort. (iii) Give the time complexity of randomized quick sort.20247mDesign and Analysis of Algorithms Write the short note on the following: (a) Cook's theorm (b) Randomized algorithms (c) Bin Packing202314mArtificial intelligenceThe A^* algorithm guarantees optimality if the heuristic used is: (i) Arbitrary (ii) Inconsistent (iii) Admissible and consistent (iv) Random20242mFormal Language & Automata TheoryDefine deterministic pushdown automata. Explain with an example.20227m
PreviousWhat is the primary technique used to prove that a problem is NP-complete? (i) Divide and conquer (ii) Dynamic programming (iii) Polynomial-time reduction from a known NP-complete problem (iv) Space complexity calculationNextAnswer the following: (i) Differentiate between best-case, worst-case, and average-case complexity with suitable examples. (ii) Use examples like linear search to demonstrate the differences. (iii) Discuss why worst-case analysis is often preferred in practice.