Let's suppose that 1 = TRUE and 0 = FALSE, we want to find how many combinations we can do with 11 zeros and ones, in fact, it's:

To evaluate the number of combinations we can do:

2 because we can pick 2 different options (true or false) and 11 because it's the number of questions, then

We have 2048 different ways that this test can be completed.