Crowdly

Add to Chrome

Universities
learning.monash.edu
FIT1008-FIT2085 Fundamentals of algorithms - S1 2025

FIT1008-FIT2085 Fundamentals of algorithms - S1 2025

Looking for FIT1008-FIT2085 Fundamentals of algorithms - S1 2025 test answers and solutions? Browse our comprehensive collection of verified answers for FIT1008-FIT2085 Fundamentals of algorithms - S1 2025 at learning.monash.edu.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

We are trying to optimise the pivot selection of the Quicksort algorithm. For our pivot choice, we are using an algorithm to find the median of an unsorted list. The algorithm we opt to use for this takes O(n) time, where n is the size of the list we are partitioning. This would make the overall worst-case time complexity of Quicksort as O(nlogn). Why don't we use this approach in general?

There's no algorithm to calculate the median in O(n) time

While the linear overhead of finding the median is not visible in the asymptotic description, we assume it to be too large to be practical

100%

We would have to sort the list before we can calculate the median

This is a better approach and we should use it

View this question

Is Quicksort a stable sorting algorithm?

Assume we have the following list: [10, 9, 3, 4, 2, 5] and we select 5 to be the pivot. What would the list be after one iteration of quicksort?

You should use the partition algorithm discussed in the pre-reading.

[2, 3, 4, 5, 9, 10]

[3, 4, 2, 5, 10, 9]

[2, 4, 3, 5, 9, 10]

[2, 4, 3, 5, 10, 9]

View this question

I am trying to decide whether I should use Quicksort or Mergesort to sort a list. What factors would affect my choice?

Whether stability is important

Whether being incremental is important

Whether the list is already sorted

How large is the list and whether in-place sorting is preferred

View this question

We are trying to optimise the pivot selection of the Quicksort algorithm. For our pivot choice, we are using an algorithm to find the median of an unsorted list. The algorithm for opt to use for this takes O(n) time, where n is the size of the list we are partitioning. What would the overall worst-case time complexity of this implementation of Quicksort be?

O(nlogn²)

O(n²)

50%

O(nlogn)

50%

O(n²logn)

View this question

Quicksort is not a stable sorting algorithm. Can we make Quicksort stable?

True

False

View this question

Assume we have the following list: [10, 9, 3, 4, 2, 5] and we select 4 to be the pivot. What would the list be after one iteration of quicksort?

You should use the partition algorithm discussed in the pre-reading.

[3, 2, 4, 10, 9, 5]

❌

[3, 2, 4, 10, 5, 9]

[2, 3, 4, 10, 9, 5]

20%

[2, 3, 4, 10, 5, 9]

View this question

1. What is an abstract data type and how does it differ from data type? Give an example of an abstract data type and also of a data type in Python. [3]

2. Briefly describe Stack ADT giving details about [4]

Main property of a Stack ADT [2]
Key operations of the Stack ADT [2]

3. What is the best-case and worst-case time complexity of operation pop() for a Stack ADT, if implemented with an array? (no explanation, no marks) . [3]

View this question

1. Briefly describe a bit-vector, giving details about