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!

An arithmetic series has first term 2, common difference 4, and 6 terms. What is the sum of all 6 terms?

View this question

What is \log_2(1024) (i.e. the power to which 2 must be raised to give 1024)?

View this question

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

O(2^n)

❌

O(n^2)

✅

O(n)

❌

O(\log n)

❌

O(n \log n)

❌

O(1)

❌

View this question

A loop runs i from 1 to 8. For each i, an inner loop runs j from 1 to

Image failed to load: i

i, executing one statement. Exactly how many times does that statement execute in total?

View this question

For logarithms (to any fixed base), \log(x \cdot y) is equal to:

\log x - \log y

❌

\log x + \log y

✅

x \cdot \log y

❌

\log x \cdot \log y

❌

View this question

An arithmetic series has first term 5, common difference 3, and 4 terms. What is the sum of all 4 terms?

View this question

What is \log_2(64) (i.e. the power to which 2 must be raised to give 64)?

View this question

In a proof by (weak) induction that a statement P(n) holds for all integers n \ge 1, what does the BASE CASE establish?

P(0)

❌

P(k) for an arbitrary k

❌

P(1)

✅

P(k+1) assuming P(k)

❌

View this question

Assuming the inductive hypothesis 1 + 2 + \dots + k = k(k+1)/2, adding the next term gives 1 + 2 + \dots + k + (k+1) = k(k+1)/2 + (k+1). Which is the correct simplified form (needed to complete the inductive step)?

k(k+1)/2 + 1

❌

(k+1)^2 / 2

❌

(k+1)(k+2)

❌

(k+1)(k+2)/2

✅

View this question

To prove by induction that 1 + 2 + \dots + n = n(n+1)/2 for all n \ge 1, the INDUCTIVE HYPOTHESIS is the assumption that:

1 + 2 + \dots + k = k(k+1)/2 holds for an arbitrary fixed integer k \ge 1

✅

k(k+1)/2 is always an integer

❌

1 + 2 + \dots + n = n(n+1)/2 holds for all n (which is what we want to prove)

❌

1 + 2 + \dots + (k+1) = (k+1)(k+2)/2 holds

❌

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