Skip to content

VCE General Mathematics

VCE · VCAAMathematics471 cards

Picked for the same course from what people use most, and all of it can be read without an account.

Everything for Maths

Looking for help with Maths?

Cookie Tutoring, our own tutoring service, may have tutors for Maths. Lessons are live and one to one, and the first 15 minutes with any tutor is free.

Find a tutor

Flashcards for VCE General Mathematics Units 3 and 4 (VCAA), split first into the two areas of study, statistics and discrete maths, and then by topic in the study design's order. A card's extra note says whether a formula is on the VCAA formula sheet or has to be recalled.

Adding it gives you your own copy, with every subdeck below. Each card then comes back just before you would forget it, and every one you get right or wrong counts towards your mastery of its topic. You can delete or suspend the parts you are not studying once it is yours.

What is inside (20 subdecks)

  • 1 Data analysis, probability and statistics134 cards
    • 1.1 Investigating data distributions46 cards
    • 1.2 Investigating association between two variables32 cards
    • 1.3 Investigating and modelling linear associations28 cards
    • 1.4 Investigating and modelling time series data28 cards
  • 2 Discrete mathematics337 cards
    • 2.1 Depreciation of assets24 cards
    • 2.2 Compound interest investments and loans26 cards
    • 2.3 Reducing balance loans22 cards
    • 2.4 Annuities and perpetuities22 cards
    • 2.5 Compound interest investment with additions to the principal21 cards
    • 2.6 Matrices and their applications40 cards
    • 2.7 Transition matrices25 cards
    • 2.8 Graphs and networks23 cards
    • 2.9 Exploring and travelling problems24 cards
    • 2.10 Trees and minimum connector problems21 cards
    • 2.11 Flow problems22 cards
    • 2.12 Shortest path problems22 cards
    • 2.13 Matching problems21 cards
    • 2.14 Scheduling problems and critical path analysis24 cards

Some of its cards

  • A first-order linear recurrence relation has the general form [...], where aa, RR and dd are constants.
    A first-order linear recurrence relation has the general form u0=a, un+1=Run+du_0 = a,\ u_{n+1} = Ru_n + d, where aa, RR and dd are constants.
  • What is a tree, in graph theory?
    A connected graph that contains no cycles
  • What is categorical data?
    Data that places each observation into a named group or category
  • What is a transition matrix?
    A matrix that gives the probabilities or proportions of moving from each state to every other state in one time step
  • In an investigation of association between two variables, what is the explanatory variable?
    The variable thought to explain or influence the value of the other variable
  • What is simple interest?
    Interest calculated only on the original amount invested or borrowed (the principal), so it is the same amount in every period
  • A compound interest investment that receives a regular, equal deposit every period, on top of its interest, is often known by what shorter name?
    A growing (or contributing) annuity investment
  • What is an activity network in the context of scheduling a project?
    A diagram showing the individual activities of a project and the order in which they must be completed
  • In graph theory, what is a vertex?
    A point in a graph, representing an object or location
  • What does the shortest path problem ask for?
    The path between two specified vertices in a weighted graph or network with the smallest total weight

And 461 more once you add the deck.