Skip to main content
§-Quiz

← back to the guide

WACE Mathematics Applications sequences, finance and networks: exam-style practice quiz

12 questions. Pick an answer and you'll see why right away. Options are shuffled each attempt, and the review at the end links each missed question to the dot point to revise.

  1. Jai borrows $20 000 at 7.2 percent per annum, compounding monthly, and repays $400 at the end of each month. Which recurrence relation models the balance AnA_n after nn months?

  2. Section One style. An arithmetic sequence has T1=7T_1 = 7 and common difference 4. The value of T20T_{20} is:

  3. A town of 1200 people grows by 5 percent each year. Its population after 6 years is closest to:

  4. The effective annual interest rate for a nominal rate of 6 percent per annum compounding quarterly is closest to:

  5. A $600 000 fund is invested at 4.5 percent per annum with interest paid quarterly. The quarterly payment that can be made as a perpetuity is:

  6. A loan balance is modelled by An+1=1.004An−900A_{n+1} = 1.004A_n - 900 with A0=150 000A_0 = 150\,000, where nn is in months. The balance after two months is closest to:

  7. A graph has five vertices and seven edges. Four of the vertices have degrees 3, 3, 2 and 2. The degree of the fifth vertex is:

  8. A connected graph has vertices A, B, C, D and E with degrees 2, 3, 4, 3 and 2 respectively. Which statement is correct?

  9. A network has edges PQ 6, PR 2, QR 4, QS 3, RS 7, RT 5 and ST 4. The total weight of a minimum spanning tree is:

  10. A project has activities A (4 days, no predecessor), B (6 days, no predecessor), C (3 days, after A), D (5 days, after A), E (2 days, after B and C) and F (4 days, after D and E). The minimum completion time and the float of activity B are:

  11. In a flow network, a cut separates the source side {S, A} from the sink side {B, T}. The edges crossing the cut are S to B (capacity 5), A to B (capacity 4), A to T (capacity 6) and B to A (capacity 3). The capacity of the cut is:

  12. In the Hungarian algorithm for a 3 by 3 assignment problem, after row and column reduction all the zeros can be covered by just 2 lines. What is the next step?

ExamExplained