Julien Ugon

In this question the students have to solve a linear recurrence of order 1. The sequence is asked in recurrence form and the goal is to find its closed form.

This question uses a Geogebra applet to solve a linear program with two variables using the graphical method. It contains three steps:

1. Construct the feasible area (polygon) by adding the constraints one by one. The students can see what happens when the constraints are added.
2. Add the objective function, and the level set of the objective value is shown, as well as its (normalised) gradient.
3. Compute the optimal solution by moving the level set of the objective around.

GIve a random linear program and ask the students to convert it to canonical form.

GIve a random linear program and ask the students to convert it to canonical form.

In this question the students have to solve a linear recurrence of order 2. The sequence is asked in recurrence form and the goal is to find its closed form.

This question gives a text encrypted with an affine cipher and asks students to decrypt it.

This question asks students to decrypt a message using a simple Caesar cipher, without giving them the key.

Asks students to apply laws of logical equivalence to prove the equivalence between two logical statements. The quiz should accept any correct answer (as long as each step is included, with one law per step), and provides detailed feedback on mistakes.

The students should solve a Blakley secret sharing scheme and find the secret.

The purpose of this question is to ask the students to go through one Rijndael round from the AES algorithm.

The purpose of this question is to ask the students to go through one Rijndael round from the AES algorithm.

This question runs the students through the Elliptic Curves version of Diffie Hellman.

In this question the students are given the public and private keys for El Gamal through Elliptic Curve and a message to decrypt. They have to decrypt the message.

This question asks students to solve a discrete logarithm problem with Pollard's rho algorithm as exposed in the book "introduction to cryptography with open source software" by McAndrew.

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.

The purpose of this question is to ask students to decrypt a message encrypted with a Hill cipher.

In this question the students have to solve a linear recurrence of order 2. The sequence is asked in recurrence form and the goal is to find its closed form.

This questions gives a bipartite graph and asks students to identify a full matching of the graph, if it exists.

This question asks students to identify trees.

This question asks students to find a spanning tree for simple undirected graphs.

Convert a number given in base 10 to a different base.

This question aims at getting the students to demonstrate their ability to apply the Euclidean algorithm to find the GCD between two numbers.

We provide two randomly generated numbers and ask the students to enter the steps of the Euclidean algorithm, as well as the GCD between the numbers.

Given a linear programming problem in standard form, write down the dual problem.

Convert a number given in base 10 to a different base.