Subject question bank

Algorithm Questions for Exams

Prepare for semester exams using important questions, numericals, viva questions and unit-wise questions.

U1 Introduction to Algorithm U2 Advanced Data Structure U3 Divide and Conquer and Greedy U4 Dynamic programming U5 Selected Topics
U

Unit-wise questions

Unit 1

Introduction to Algorithm

Open unit →
  1. What is an algorithm? Simple Explanation and Real-Life Example
  2. Characteristics of an algorithm with examples and explanations
  3. Complexity of an Algorithm: Time and Space Complexity
  4. Asymptotic Notations: Big Oh, Big Theta and Big Omega Notation
  5. Explain Little-oh notation and Little omega notation . Also Discuss relationship between O, o, theta, omega, and omega notation.
  6. Optimality and Reduction Of Algorithm with Examples
  7. Explain Master’s Theorem.
  8. Divide and Conquer Recurrences with Examples
Unit 2

Advanced Data Structure

Open unit →
  1. What is Red-Black Tree? Write its advantage.
  2. Write different kinds of rotation in RB Tree.
  3. Write the property of Red-Black Tree. Show that the longest simple path from a node x in a RB-Tree to a descendants leaf has length at most twice that of the shortest simple path from node x to a descendants leaf.
  4. Discuss the all cases of insert a node in RB Tree. Also write its algorithm.
  5. Discuss the all cases of remove a node in RB Tree. Also write its algorithm.
  6. Explain B-Tree. Write its properties.
  7. Write the basic operations in B-Tree.
  8. Explain the delete operation of a node from B-Tree.
Unit 3

Divide and Conquer and Greedy

Open unit →
  1. What do you mean by Graph Theory? Explain.
  2. Write a note on Graph and Digraph.
  3. Explain various data structure for Graphs.
  4. Write a note on Breadth First Search(BFS).What type of problem you can solve using BFS.
  5. Write a note on Depth First Search(DFS).What type of problem you can solve using DFS.
  6. Write a note on Bipartite Graph.
  7. Explain Topological Sort.
  8. Discuss Strongly Connected Components with its algorithm.
Unit 4

Dynamic programming

Open unit →
  1. Write a note on Dynamic programming.
  2. Write a difference between Dynamic programming and Greedy approach.
  3. Write the elements of Dynamic programming.
  4. Explain Matrix-chain multiplication problem and solve it by using Dynamic Programming with one example.
  5. Explain Longest Common Subsequence. Write its pseudo code for computing the length of LCS.
  6. Explain knapsack problem. Write its Greedy Solution.
  7. Explain knapsack problem. Write Dynamic Programming Solution for 0/1 knapscak problem.
  8. What is optimization problem? How are greedy method can be used to solve the optimization problem?
Unit 5

Selected Topics

Open unit →
  1. What do you mean by String matching ? Also explain string, sub string and proper sub string.
  2. Explain Knuth-Morris-Pratt Algorithm and give its analysis.
  3. Explain Naïve string matching algorithm and also discuss its analysis.
  4. Discuss the string matching with finite automata.
  5. Write an algorithm for Rabin-Karp method. Also give a suitable example to explain it.
  6. What do you mean by Approximation algorithm? Explain.
  7. Define Vertex cover. What is vertex cover problem? Provide the approximation algorithm for vertex cover problem.
  8. Explain the vertex cover problem. Also write algorithm for it.