INTRODUCTION TO ALGORITHMS:
THIRD EDITION OVERVIEW ACTUAL
EXAM 2025/2026 QUESTIONS AND
100% CORRECT ANSWERS
Algorithms - CORRECT ANSWER-Step-by-step procedures for
solving problems.
Asymptotic notation - CORRECT ANSWER-Describes algorithm
efficiency in terms of input size.
Insertion sort - CORRECT ANSWER-Simple sorting algorithm
using insertion method.
Heapsort - CORRECT ANSWER-Sorting algorithm using a binary
heap data structure.
,Quicksort - CORRECT ANSWER-Divide-and-conquer sorting
algorithm with pivot selection.
Binary Search Trees - CORRECT ANSWER-Data structure for
efficient searching and sorting.
Red-Black Trees - CORRECT ANSWER-Self-balancing binary
search tree with color properties.
Dynamic Programming - CORRECT ANSWER-Method for solving
complex problems by breaking down.
Greedy Algorithms - CORRECT ANSWER-Approach that builds
up a solution piece by piece.
Priority queues - CORRECT ANSWER-Abstract data type for
managing prioritized elements.
Counting sort - CORRECT ANSWER-Non-comparison-based
sorting algorithm using counting.
,Radix sort - CORRECT ANSWER-Sorting algorithm that
processes digits of numbers.
Bucket sort - CORRECT ANSWER-Distributes elements into
buckets for sorting.
Hash Tables - CORRECT ANSWER-Data structure that uses
hash functions for indexing.
Open addressing - CORRECT ANSWER-Collision resolution
method in hash tables.
Rod cutting - CORRECT ANSWER-Dynamic programming problem
for maximizing profit from cuts.
Matrix-chain multiplication - CORRECT ANSWER-Optimization
problem for multiplying matrices efficiently.
, Longest common subsequence - CORRECT ANSWER-Finding
longest sequence present in two sequences.
Activity-selection problem - CORRECT ANSWER-Choosing
maximum number of compatible activities.
Master theorem - CORRECT ANSWER-Provides a method for
analyzing divide-and-conquer algorithms.
Indicator random variables - CORRECT ANSWER-Variables that
indicate the occurrence of an event.
Probabilistic analysis - CORRECT ANSWER-Analyzing algorithms
based on probabilistic methods.
Matroid - CORRECT ANSWER-A combinatorial structure
generalizing linear independence.
Amortized Analysis - CORRECT ANSWER-Analyzes average time
per operation over a sequence.
THIRD EDITION OVERVIEW ACTUAL
EXAM 2025/2026 QUESTIONS AND
100% CORRECT ANSWERS
Algorithms - CORRECT ANSWER-Step-by-step procedures for
solving problems.
Asymptotic notation - CORRECT ANSWER-Describes algorithm
efficiency in terms of input size.
Insertion sort - CORRECT ANSWER-Simple sorting algorithm
using insertion method.
Heapsort - CORRECT ANSWER-Sorting algorithm using a binary
heap data structure.
,Quicksort - CORRECT ANSWER-Divide-and-conquer sorting
algorithm with pivot selection.
Binary Search Trees - CORRECT ANSWER-Data structure for
efficient searching and sorting.
Red-Black Trees - CORRECT ANSWER-Self-balancing binary
search tree with color properties.
Dynamic Programming - CORRECT ANSWER-Method for solving
complex problems by breaking down.
Greedy Algorithms - CORRECT ANSWER-Approach that builds
up a solution piece by piece.
Priority queues - CORRECT ANSWER-Abstract data type for
managing prioritized elements.
Counting sort - CORRECT ANSWER-Non-comparison-based
sorting algorithm using counting.
,Radix sort - CORRECT ANSWER-Sorting algorithm that
processes digits of numbers.
Bucket sort - CORRECT ANSWER-Distributes elements into
buckets for sorting.
Hash Tables - CORRECT ANSWER-Data structure that uses
hash functions for indexing.
Open addressing - CORRECT ANSWER-Collision resolution
method in hash tables.
Rod cutting - CORRECT ANSWER-Dynamic programming problem
for maximizing profit from cuts.
Matrix-chain multiplication - CORRECT ANSWER-Optimization
problem for multiplying matrices efficiently.
, Longest common subsequence - CORRECT ANSWER-Finding
longest sequence present in two sequences.
Activity-selection problem - CORRECT ANSWER-Choosing
maximum number of compatible activities.
Master theorem - CORRECT ANSWER-Provides a method for
analyzing divide-and-conquer algorithms.
Indicator random variables - CORRECT ANSWER-Variables that
indicate the occurrence of an event.
Probabilistic analysis - CORRECT ANSWER-Analyzing algorithms
based on probabilistic methods.
Matroid - CORRECT ANSWER-A combinatorial structure
generalizing linear independence.
Amortized Analysis - CORRECT ANSWER-Analyzes average time
per operation over a sequence.
