FIT2004 Algorithms and data structures - S2 2026

Looking for FIT2004 Algorithms and data structures - S2 2026 test answers and solutions? Browse our comprehensive collection of verified answers for FIT2004 Algorithms and data structures - S2 2026 at learning.monash.edu.

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

What is the time complexity of the naive recursive Fibonacci, fib(n) = fib(n-1) + fib(n-2) (no memoisation)?

O(2^n) (exponential)

✅

O(n^2)

❌

O(n)

❌

O(\log n)

❌

View this question

Which is the TIGHTEST simplified Big-O class for 4n^2 + 1000n + 100 (drop constant factors and lower-order terms)?

O(n^2)

✅

O(n)

❌

O(n \log n)

❌

O(n^3)

❌

View this question

What is the worst-case time complexity of heapsort of n items?

O(2^n)

0%

O(n^2)

❌

O(n)

0%

O(\log n)

0%

O(n \log n)

0%

O(1)

0%

View this question

A loop runs

Image failed to load: i

i from 1 to 12. For each i, an inner loop runs j from 1 to i, executing one statement. Exactly how many times does that statement execute in total?

View this question

Want instant access to all verified answers on learning.monash.edu?

Get Unlimited Answers To Exam Questions - Install Crowdly Extension Now!

Add to Chrome