Do people want real (as in, not HSC-level) algorithms questions? They probably won't be much help for SDD specifically -- they test high-level mathematical reasoning more than anything else.
Here are three nice ones off the top of my head. The first 2 could in theory come up in an SDD exam, I guess. There are lots of approaches for the third one, some easier than others.
EASY: Write a function that finds the sum of all multiples of 3 or 5 below a given
n. (source: adapted from Project Euler question 1)
EASY-MODERATE: Write a function that, given
n, finds the
nth fibonacci number. Start at 1,1,2,3.... (source: classic)
HARD: You are given an
n*
n grid
G of integers, where in any row
r,
and in any column
c,
.
Efficiently determine whether a given integer
k is in the grid. (Source: one of the UNSW third-year algorithms course practice papers)
EDIT: ahdil if you're interested in computing at UNSW you should give these a go. I'll see you next year