Crowdly
Add to Chrome
COMPSCI4009 Algorithmics I (H) 2025-26
Looking for COMPSCI4009 Algorithmics I (H) 2025-26 test answers and solutions? Browse our comprehensive collection of verified answers for COMPSCI4009 Algorithmics I (H) 2025-26 at moodle.gla.ac.uk.
Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!
In the recurrence relation for finding the optimal string distance when transforming the string characters do not match the distance x into the string y. When the d(i,j) equals:
1 + min{ d(i,j−1), d(i−1,j), d(i−1,j−1) } What does the case d(i−1,j−1) correspond to?
✅
❌
❌
❌
View this question
If you perform Radix sort on a string of length m using the factor b of m.
0%
View this question
As we have seen, every comparison based sorting algorithm must
use at least
O(n log n)comparisons.
This is because the decision tree for the algorithm must have at
least:
❌
❌
✅
❌
View this question
What is the complexity of heap sort?
❌
❌
❌
✅
View this question