Question 1

Define Algorithm.

Accepted Answer

An Algorithm is a strictly defined, finite sequence of computational instructions designed to solve a specific problem.

Question 2

What is Time Complexity?

Accepted Answer

Time Complexity mathematically quantifies the total CPU execution time an algorithm requires based on the input size.

Question 3

Define Asymptotic Notation.

Accepted Answer

Asymptotic Notation provides a mathematical abstraction to describe the limiting behavior of an algorithm's time complexity.

Question 4

What is a Greedy Algorithm?

Accepted Answer

A Greedy Algorithm aggressively makes the mathematically optimal choice at every local step to find a global optimum.

Question 5

Define Dynamic Programming.

Accepted Answer

Dynamic Programming breaks complex problems into overlapping subproblems, aggressively storing and reusing their calculated solutions to prevent redundant CPU cycles.

Question 6

What is the Divide and Conquer technique?

Accepted Answer

Divide and Conquer aggressively splits a problem into independent subproblems, solves them recursively, and merges the results.

Question 7

Define NP-Hard.

Accepted Answer

NP-Hard problems are mathematically the absolute hardest computational problems, to which all NP problems can be reduced.

Question 8

What is Backtracking?

Accepted Answer

Backtracking is a recursive depth-first search strategy that violently prunes dead-end mathematical paths to optimize execution.

Question 9

Define Minimum Spanning Tree.

Accepted Answer

A Minimum Spanning Tree is a mathematically derived subgraph connecting all vertices of a graph with absolute minimum total edge weight.

Question 10

What is the Knapsack Problem?

Accepted Answer

The Knapsack Problem is a classic mathematical optimization challenge focused on maximizing total value without exceeding a strict weight capacity.

Question 11

Explain the different asymptotic notations (Big-O, Omega, Theta) with examples.

Accepted Answer

A rigorous mathematical exploration of the three foundational Asymptotic Notations: Big-O (Worst-case), Omega (Best-case), and Theta (Average/Tight-bound), detailing their strict algebraic definitions.

Question 12

Describe the Binary Search algorithm and analyze its time complexity.

Accepted Answer

A technical deconstruction of the Binary Search algorithm, utilizing the Divide and Conquer paradigm on strictly sorted arrays, followed by a rigorous logarithmic time complexity analysis.

Question 13

Explain the Merge Sort algorithm with an example and analyze its time complex…

Accepted Answer

A detailed exploration of the Merge Sort algorithm, highlighting its strict Divide and Conquer mechanics, the physical merging of sub-arrays, and the mathematical derivation yielding $O(n \log n)$ time complexity.

Question 14

Discuss Kruskal's Algorithm for finding Minimum Spanning Tree.

Accepted Answer

An architectural breakdown of Kruskal's Algorithm utilizing the Greedy paradigm and the highly optimized Disjoint-Set (Union-Find) data structure to mathematically construct a Minimum Spanning Tree.

Question 15

Explain the concept of Dynamic Programming with the Fibonacci example.

Accepted Answer

A definitive explanation of Dynamic Programming (DP), showcasing how Tabulation and Memoization completely eradicate the catastrophic exponential time complexity of naive recursive Fibonacci calculations.

Question 16

Describe the N-Queens problem using Backtracking.

Accepted Answer

A technical exploration of the N-Queens problem, detailing how the Backtracking algorithm utilizes a Depth-First Search tree and aggressive mathematical pruning to locate safe configurations.

Question 17

Explain the concept of P and NP complexity classes.

Accepted Answer

A rigorous theoretical classification of Computational Complexity, defining the mathematical distinction between P (Polynomial time) and NP (Nondeterministic Polynomial time) problem classes.

Question 18

(a) Explain the methods of solving recurrence relations: Substitution Method,…

Accepted Answer

An exhaustive mathematical exposition on solving Recurrence Relations, detailing the aggressive algebraic guessing of the Substitution Method, the geometric visualization of the Recursion Tree, and the absolute formulaic dominance of the Master Theorem.

Question 19

(a) Explain the Quick Sort algorithm in detail with a suitable example.

Accepted Answer

A definitive architectural and mathematical breakdown of the Quick Sort algorithm, detailing its highly aggressive pivot partitioning mechanics, in-place memory optimization, and a rigorous analysis of its catastrophic $O(n^2)$ worst-case degradation.

Question 20

(a) Explain Dijkstra's Algorithm for Single Source Shortest Path with a suita…

Accepted Answer

A highly advanced mathematical breakdown of Dijkstra's Algorithm, detailing its aggressive Greedy methodology, physical reliance on Priority Queues (Min-Heaps), and edge relaxation to calculate the absolute Single Source Shortest Path.

Question 21

Explain the 0/1 Knapsack problem using Dynamic Programming with a suitable ex…

Accepted Answer

A rigorous exposition of Dynamic Programming (DP) techniques, violently deconstructing both the 0/1 Knapsack Problem and the Matrix Chain Multiplication Problem, showcasing how overlapping subproblems are tabulated in 2D arrays to prevent exponential CPU collapse.

Question 22

(a) Explain the concept of NP-Completeness.

Accepted Answer

A deep theoretical exposition on the catastrophic concept of NP-Completeness, detailing Cook's Theorem, Polynomial-Time Reducibility, and the severe implications this mathematical classification holds for the P vs NP crisis.

Design and Analysis of Algorithms