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!

A sequence satisfies a(1) = 1 and a(n) = 3 \cdot a(n-1) for n \ge 2. Which closed form matches it?

a(n) = n(n+1)/2

❌

a(n) = 2^{n-1}

❌

a(n) = 2n

❌

a(n) = n^2

❌

a(n) = 3^{n-1}

✅

a(n) = 2n - 1

❌

View this question

Consider an algorithm that makes about \log n levels of recursion, doing O(n) work in total at each level (this is merge sort). What is its overall time complexity?

O(2^n)

❌

O(n^2)

❌

O(n)

❌

O(\log n)

❌

O(n \log n)

✅

View this question

A sequence is defined by a(1) = 10 and a(n) = a(n-1) + -1 for n \ge 2. What is a(7)?

View this question

A sequence is defined by a(1) = 3 and a(n) = 2 \cdot a(n-1) for n \ge 2. What is a(3)?

View this question

Is the sequence defined by a(1) = 2,\ a(n) = 3 \cdot a(n-1) for n \ge 2 arithmetic, geometric, or neither?

Geometric

✅

Arithmetic

❌

Neither

❌

View this question

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

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

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

Add to Chrome