Data Structures Final Exam Questions
With All Correct Answers 2025 Latest
Update!!!
Who is the author of a book entitled "Algorithms + Data Structures = Program"
CORRECT ANSWERS Niklaus Wirth
Profiling CORRECT ANSWERS is a way to measure the time cost of an algorithm using
the computer's clock to obtain an actual run time
___________ and ____________ is the two most significant resources that we try to
optimize seriously in algorithm analysis. CORRECT ANSWERS time, memory
_____________________ is a method of determining the efficiency of algorithm by
counting their basic operation such as addition, multiplication, comparison using simple
algebra, pencil and paper. CORRECT ANSWERS complexity analysis
Put these Big O growth functions into the right order from the fastest to the slowest
CORRECT ANSWERS 1. O(1)
2. O(log n)
3. O(sqrt(n))
4. O(n)
5. O(n**2)
6. O(2**n)
7. O(n!)
8. O(n**n)
Put these Big O categorization name into the right order from the fastest to the slowest
CORRECT ANSWERS 1. Constant
2. Logarithmic
3. Linear
4. Quadratic
5. Exponential
6. Combinatoric
What is the Big O of the sequential search function? CORRECT ANSWERS O(n)
What is the Big O of the binary search function? CORRECT ANSWERS O(log n)
What is the Big O of the selection sort function? CORRECT ANSWERS O(n**2)
What is the Big O of the bubble sort function? CORRECT ANSWERS O(n**2)
, What is the Big O of the bubble sort with a tweak function? CORRECT ANSWERS
O(n**2)
What is the Big O of the insertion sort function? CORRECT ANSWERS O(n**2)
What is the Big O of the merge sort function? CORRECT ANSWERS O(n log n)
What is the Big O of the counting sort function? CORRECT ANSWERS O(n)
What is the Big O of the Recursive Fibonacci? CORRECT ANSWERS O(2**n)
______________ is a strategy that saves computed values for subsequent use, so they
will not have to be recomputed CORRECT ANSWERS memoization
One of the important algorithm techniques is the divide and conquer methods. Explain
divide and conquer with your own words and give an example. CORRECT ANSWERS
Binary search, splits data into 2 parts
Put these sorting algorithms into the right order from the fastest to the slowest according
to their average case CORRECT ANSWERS 1. Counting Sort
2. Merge Sort
3. Insertion Sort
4. Bubble Sort with Tweak
5. Bubble Sort
6. Selection Sort
The == operation for two lists must CORRECT ANSWERS Compare pairs of items at
each position for equality
Examples of unordered collections are CORRECT ANSWERS Sets and dictionaries
The filter function creates a sequence of the CORRECT ANSWERS Items in a given
collection that pass a Boolean test
A graph collection best represents a CORRECT ANSWERS Map of flight paths
between cities
The == operation for two sets must CORRECT ANSWERS Verify that the sets are of
the same size and that each item in one set is also in the other set
In Python, a type conversion operation for two collections CORRECT ANSWERS
Creates copies of the objects in the source collection and adds these new objects to a
new instance of the destination collection
A hierarchical collection can represent a CORRECT ANSWERS File directory system
With All Correct Answers 2025 Latest
Update!!!
Who is the author of a book entitled "Algorithms + Data Structures = Program"
CORRECT ANSWERS Niklaus Wirth
Profiling CORRECT ANSWERS is a way to measure the time cost of an algorithm using
the computer's clock to obtain an actual run time
___________ and ____________ is the two most significant resources that we try to
optimize seriously in algorithm analysis. CORRECT ANSWERS time, memory
_____________________ is a method of determining the efficiency of algorithm by
counting their basic operation such as addition, multiplication, comparison using simple
algebra, pencil and paper. CORRECT ANSWERS complexity analysis
Put these Big O growth functions into the right order from the fastest to the slowest
CORRECT ANSWERS 1. O(1)
2. O(log n)
3. O(sqrt(n))
4. O(n)
5. O(n**2)
6. O(2**n)
7. O(n!)
8. O(n**n)
Put these Big O categorization name into the right order from the fastest to the slowest
CORRECT ANSWERS 1. Constant
2. Logarithmic
3. Linear
4. Quadratic
5. Exponential
6. Combinatoric
What is the Big O of the sequential search function? CORRECT ANSWERS O(n)
What is the Big O of the binary search function? CORRECT ANSWERS O(log n)
What is the Big O of the selection sort function? CORRECT ANSWERS O(n**2)
What is the Big O of the bubble sort function? CORRECT ANSWERS O(n**2)
, What is the Big O of the bubble sort with a tweak function? CORRECT ANSWERS
O(n**2)
What is the Big O of the insertion sort function? CORRECT ANSWERS O(n**2)
What is the Big O of the merge sort function? CORRECT ANSWERS O(n log n)
What is the Big O of the counting sort function? CORRECT ANSWERS O(n)
What is the Big O of the Recursive Fibonacci? CORRECT ANSWERS O(2**n)
______________ is a strategy that saves computed values for subsequent use, so they
will not have to be recomputed CORRECT ANSWERS memoization
One of the important algorithm techniques is the divide and conquer methods. Explain
divide and conquer with your own words and give an example. CORRECT ANSWERS
Binary search, splits data into 2 parts
Put these sorting algorithms into the right order from the fastest to the slowest according
to their average case CORRECT ANSWERS 1. Counting Sort
2. Merge Sort
3. Insertion Sort
4. Bubble Sort with Tweak
5. Bubble Sort
6. Selection Sort
The == operation for two lists must CORRECT ANSWERS Compare pairs of items at
each position for equality
Examples of unordered collections are CORRECT ANSWERS Sets and dictionaries
The filter function creates a sequence of the CORRECT ANSWERS Items in a given
collection that pass a Boolean test
A graph collection best represents a CORRECT ANSWERS Map of flight paths
between cities
The == operation for two sets must CORRECT ANSWERS Verify that the sets are of
the same size and that each item in one set is also in the other set
In Python, a type conversion operation for two collections CORRECT ANSWERS
Creates copies of the objects in the source collection and adds these new objects to a
new instance of the destination collection
A hierarchical collection can represent a CORRECT ANSWERS File directory system
