Scribd
Upload
33 views3 pages

DAA - Question Bank

Uploaded by

khararkikhabar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views3 pages

DAA - Question Bank

Uploaded by

khararkikhabar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Student's Group

Discord
DAA Questions Bank
2-Marks Questions

1. What is an algorithms? Write properties of an algorithm.


2. What is the difference between an algorithm and a program? Explain with an example.
3. What is asymptotic notation? Explain its purpose and list the three main types of asymptotic
notations.
4. What is algorithmic complexity, and why is it important to analyze the performance of an
algorithm?
5. Define Big-O notation and explain its purpose in analyzing algorithms.
6. Define the queue data structure and its types.
7. Explain the difference between a circular queue and a linear queue. Write the advantages of
using a circular queue.
8. Write difference between array and linked list.
9. What is a binary tree? Explain with example.
10. Define the terms vertex, edge, degree, and path in the context of graph theory. Provide
examples of each in an undirected graph and a directed graph.
11. Write difference between prims and Kruskal algorithm.
12. Define Divide and Conquer strategy.
13. What is the purpose of Strassen's Matrix Multiplication?
14. List any two greedy algorithms.
15. What is MST in graph theory?
16. Define Huffman coding.
17. Why does Breadth-First Search use a "Queue" data structure instead of a "Stack"?
18. Discuss whether the greedy algorithm always provides an optimal solution.
19. Discuss the essential properties of B-trees.
20. Discuss the difference between Divide and Conquer and Dynamic Programming with
examples.
21. Explain the difference between Little "oh" and Little Omega notations.
22. State the difference between BFS and DFS in graph traversal.
23. Discuss the Hamiltonian cycle problem.
24. What is Dijkstra's Algorithm used for? Briefly explain how it works.
25. What is the Floyd-Warshall algorithm? What is the time complexity of the Floyd-Warshall
algorithm for finding the shortest paths in a graph.
26. What is the main difference between Dijkstra's algorithm and the Floyd-Warshall algorithm?
27. What is the primary use of the Bellman-Ford algorithm. What is the time complexity of the
Bellman-Ford algorithm?

5-Marks Questions

1. Discuss the worst-case complexity of Quick Sort with an example.


2. Solve the following recurrence relation: T(n) = 2T(n/2) + n.
3. What is Prim's algorithm for Minimum Spanning Tree (MST)? Explain it with an example.
4. Explain the concept of hashing and discuss different types of hashing techniques (Open and
Closed Hashing).
5. Explain the concept of an AVL tree and how it maintains balance during insertions and
deletions. Write an algorithm for insertion in an AVL tree, and demonstrate the process with
an example.
6. Explain the Heap Sort algorithm Describe the process of heapifying a binary tree and its time
complexity. Also, illustrate the Heap Sort algorithm with an example.
7. Describe Strassen's Matrix Multiplication algorithm.
8. Describe the 0/1 knapsack problem in branch and bound with the help of an example.
9. Explain the concept of backtracking with reference to the N-Queen problem.
10. Describe the steps involved in solving the sum of subsets problem using the backtracking
technique with an example.
11. Describe the general method of Backtracking and explain how it is applied to the N-Queens
problem.
12. What is Prim's algorithm for Minimum Spanning Tree (MST)? Explain it with an example.
13. What is the Travelling Salesperson Problem (TSP)? Discuss the Branch and Bound approach for
solving TSP.
14. What is the Chinese Remainder Theorem with example?
15. Explain P ,NP ,NP HARD and NP Completeness using example.

10-Marks Questions

1. Compare and contrast AVL trees and Red-Black trees. Explain how they maintain balance and
perform insertion and deletion operations.
2. Discuss the properties and applications of B-trees. Explain how B-trees maintain balance and
handle large datasets efficiently.
3. Derive the best and worst-case time complexities of 2-way Merge Sort using the divide-and-
conquer technique.
4. Explain the following sorting algorithms: Counting Sort, Bucket Sort, and Radix Sort. Discuss
the time complexity, advantages, and disadvantages of each. Also, provide an example to
illustrate how each algorithm works.
5. Apply Quick Sort on the following list and sort it in ascending order:
38, 81, 22, 48, 36, 99, 31, 44, 55, 67, 97, 72.
6. Write a detailed explanation of the Knapsack problem and solve a given instance using
dynamic programming.
7. What is the principle behind the greedy algorithm? Discuss its application in solving problems
like activity selection or Huffman coding.
8. Explain the Branch and Bound technique using the 0-1 Knapsack problem.
9. Describe the steps involved in solving the Traveling Salesperson Problem (TSP) using dynamic
programming.
10. Explain the Longest Common Subsequence (LCS) problem with its real-world applications.
Discuss the dynamic programming approach to solving the LCS problem. Including a detailed
explanation of the algorithm, the time complexity, and an example
11. Explain Dijkstra's algorithm in detail. Describe its working, advantages, limitations, and
provide an example with a graph to illustrate how the algorithm finds the shortest path from a
source node.
12. Explain the Floyd-Warshall algorithm with an example. Describe how it works to find the
shortest paths between all pairs of vertices and discuss its advantages and limitations.
13. Explain the process of topological sorting in a directed acyclic graph (DAG). Discuss its
applications and algorithms for performing topological sort.
14. Explain the Bellman-Ford algorithm for finding the shortest path in a graph with negative edge
weights. Compare it with Dijkstra’s algorithm.
15. Describe the Knuth-Morris-Pratt (KMP) algorithm for pattern matching. Explain the
preprocessing phase and the matching phase with an example.
16. Write an algorithm to find the Convex Hull of a set of points using the Gift Wrapping or
Graham’s scan algorithm. Analyze its time complexity.
17. Given two arrays num[] and rem[] where each pair is co-prime (gcd for every pair is 1), find the
minimum positive number x for the following inputs using the Chinese Remainder Theorem:
num[] = {5, 71}, rem[] = {2, 3}
num[] = {3, 4, 5}, rem[] = {2, 3, 1}

You might also like