Written for the Western Sydney University MESH numeracy preparation workshop for the LANTITE test (Australia). Students are given a proportion of staff who either have or haven't completed their reports. They are asked to find the complement, as a percentage. There are 6 different versions of this question. 

Used for LANTITE preparation (Australia). SP = Statistics & Probability strand. NC = Non-Calculator strand. Students are asked a multiple choice question based on a pie chart. The question is randomly selected from a pool of seven questions.

Written for the Western Sydney University MESH numeracy preparation workshop for the LANTITE test (Australia). Students are given the number of bagels baked, in a number of hours, and need to calculate the number baked per half-hour. There are 6 different versions of this question.

No description given

No description given

This question tests the student's ability to identify the factors of some composite numbers and the highest common factors of two numbers. 

testing sin, cos, tan of angles that are negative or greater than 2pi radians that result in nice exact values. 

question involving caomparison test and absolute convergence

No description given

Tests students' ability to apply the recursive form of the Extended Euclidean Algorithm.  Random four-digit inputs are chosen subject to the condition that the Euclidean Algorithm terminates in seven steps.

A straightforward test of encrypting and decrypting an eight-letter message with the Vigenère Cipher using a four-letter key.  Message letters are generated uniformly at random from the English alphabet, as are the key letters.  Students are expected to be able to map English letters onto elements of $\mathbb{Z}_{26}$ in the usual order.

A straightforward test of encrypting and decrypting an eight-bit message with the Vernam Cipher.  The message and the key are uniform and independently generated eight-bit strings.

A straightforward test of encrypting and decrypting an eight-letter message with the Substitution Cipher.  Message letters are generated uniformly at random from the English alphabet and the key is a uniformly chosen random permutation of the alphabet.  Students are expected to be able to map English letters onto elements of $\mathbb{Z}_{26}$ in the usual order.

No description given

A straightforward test of encrypting and decrypting an eight-letter message with the Caesar Cipher.  Message letters are generated uniformly at random from the English alphabet, as is the key.  Students are expected to be able to map English letters onto elements of $\mathbb{Z}_{26}$ in the usual order.

Dummy question to test random() function when first decimal place of upper limit of range is 4, and test of currency() function.

DCS 2023 Maths Entrance Test to be used September 2023

1.5 hours with 3 randomised questions from each of these groups:

• Notation and Algebra
• Calculus - Differentiation
• Calculus - Integration
• Trigonometry

No description given

The purpose of this question is to test student's understanding of the Elliptic curves version of El Gamal encryption. It asks them to go through two steps: the publication of the public key, and the use of this public key to encrypt a message.

No description given

Tests the ability to find the gradient and intercept of a straight line graph.

A quick practice set of problems for education students to take in preparation for their numeracy test.

A quick practice set of problems for education students to take in preparation for their numeracy test.

A quick practice set of problems for education students to take in preparation for their numeracy test.

This question tests the student's ability to solve Integer Programming problems applying Population-based Metaheuristics.

This question tests the student's ability to solve Integer Programming problems applying Single State Metaheuristics.

This question tests the student's ability to model and solve Integer Programming problems by Branch and bound method

This question tests the student's ability to model and solve Integer Programming problems by Branch and bound method

This question tests the student's ability to solve Linear Programming problems by hand using the Simplex Method.

This question tests the student's ability to solve Linear Programming problems by hand using the Simplex Method.