question
stringlengths 4
6.13k
| question_id
int64 0
49.1k
| dataset
stringclasses 3
values | category
stringclasses 75
values |
|---|---|---|---|
Which one of these is \emph{not} a MAC construction?
| 400
|
epfl_qa
|
epfl_dpo_qa
|
A passive adversary can \ldots?
| 401
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is correct regarding prediction models?
| 402
|
epfl_qa
|
epfl_dpo_qa
|
Consider a $(k+1,k)$ block code that to a binary sequence $x_1,\dots,x_k$ associates the codeword $x_1,\dots,x_k,x_{k+1}$, where $x_{k+1}= x_1+\ldots+x_k$ mod $2$. This code can detect all the errors of odd weight.
| 403
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{correct} assertion concerning WPA2?
| 404
|
epfl_qa
|
epfl_dpo_qa
|
A vending machine dispensing books of stamps accepts only $1 bills, $2 bills and $5 bills.
Find a recurrence relation for the number of ways to deposit $$n$$ dollars in the vending machine, where the order in which the coins and bills are deposited matters.
| 405
|
epfl_qa
|
epfl_dpo_qa
|
What is the value of \(f(4)\) where \(f\) is defined as \(f(0) = f(1) = 1\) and \(f(n) = 2f(n - 1) + 3f(n - 2)\) for integers \(n \geq 2\)?
| 406
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following sets can you use Cantor’s Diagonalization Argument to prove it is uncountable (multiple answers) ?
| 407
|
epfl_qa
|
epfl_dpo_qa
|
Which is NOT a mobile telephony protocol?
| 408
|
epfl_qa
|
epfl_dpo_qa
|
What are possible morphological analyses of "drinks"?(Penalty for wrong ticks)?
| 409
|
epfl_qa
|
epfl_dpo_qa
|
When using linear regression, which techniques improve your result? (One or multiple answers)?
| 410
|
epfl_qa
|
epfl_dpo_qa
|
If we pick independent random numbers in $\{1, 2, \dots, N\}$ with uniform distribution, $\theta \sqrt{N}$ times, we get at least one number twice with probability\dots?
| 411
|
epfl_qa
|
epfl_dpo_qa
|
You are working on a dataset with lots of outliers, and want to perform a regression task. Everything else being equal, and assuming that you do not do any pre-processing, which loss function will be less affected by these outliers?
| 412
|
epfl_qa
|
epfl_dpo_qa
|
Generative Adversarial Networks use the generator and discriminator models during training but only the discriminator for data synthesis.
| 413
|
epfl_qa
|
epfl_dpo_qa
|
Assume we work with $64$-bit block cipher. In differential cryptanalysis, for which of the following circuits is the output difference going to be different from the input difference?
| 414
|
epfl_qa
|
epfl_dpo_qa
|
MD5 is?
| 415
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{incorrect} assertion. Using sequential composition,\dots?
| 416
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following statements is wrong regarding RDF?
| 417
|
epfl_qa
|
epfl_dpo_qa
|
How many $x \in \mathbb{Z} / 23\mathbb{Z}$ satisfy the equation $0 = 1 - x + x^2 - x^3 + .... - x^{21} + x^{22} - x^{23}$, when all operations are with respect to the field $(\mathbb{Z} / 23 \mathbb{Z}, + , \cdot)$? Check the correct answer.
| 418
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{true} statement.
| 419
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is correct regarding prediction models?
| 420
|
epfl_qa
|
epfl_dpo_qa
|
One-hot encoding:?
| 421
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} assertion. The perfect cipher over $\left\{ 0,1 \right\}^\ell$ is \dots?
| 422
|
epfl_qa
|
epfl_dpo_qa
|
A page that points to all other pages but is not pointed by any other page would have...
| 423
|
epfl_qa
|
epfl_dpo_qa
|
For this question, one or more assertions can be correct. Tick only the correct assertion(s). There will be a penalty for wrong assertions ticked.Which of the following associations can be considered as illustrative examples for inflectional
morphology (with here the simplifying assumption that canonical forms are restricted to the roots
only)?
| 424
|
epfl_qa
|
epfl_dpo_qa
|
Which algorithm can be typically used in order to generate a prime number?
| 425
|
epfl_qa
|
epfl_dpo_qa
|
Mark the \emph{incorrect} statement. A finite field is?
| 426
|
epfl_qa
|
epfl_dpo_qa
|
Assume that you get a confidence interval of size $\delta$ for some problem given $N$ iid samples. Expressed as a function of $N$, how many iid samples do you need to get a confidence interval of $\operatorname{size} \delta / 3 ?$?
| 427
|
epfl_qa
|
epfl_dpo_qa
|
Which adversarial model corresponds to Linear Cryptanalysis?
| 428
|
epfl_qa
|
epfl_dpo_qa
|
What is true regarding Fagin's algorithm?
| 429
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textit{incorrect} assertion. Given an RSA public key $(e,N)$, we \textit{can} efficiently compute square roots in $\mathbb{Z}_{N}^*$ if we have an efficient algorithm that \ldots?
| 430
|
epfl_qa
|
epfl_dpo_qa
|
Let $\mathcal{C}$ be the $(6,3)$ linear code on $\mathbb{F}_3$ whose parity-check matrix is egin{equation*} H = egin{pmatrix} 2 &0 &1 &1 &1 &0 \ 1 &2 &0 &0 &1 &1 \ 0 &0 &0 &1 &1 &1 \end{pmatrix}. \end{equation*} True or false: The matrix egin{equation*} ilde{H} = egin{pmatrix} 1 &0 &2 &2 &2 &0 \ 2 &1 &0 &0 &2 &2 \ 0 &0 &0 &2 &2 &2 \end{pmatrix} \end{equation*} is also a valid parity-check matrix for $\mathcal{C}$.
| 431
|
epfl_qa
|
epfl_dpo_qa
|
Which one is a stream cipher?
| 432
|
epfl_qa
|
epfl_dpo_qa
|
Consider an Sbox $S:\{0,1\}^m \rightarrow \{0,1\}^m$. We have that \ldots?
| 433
|
epfl_qa
|
epfl_dpo_qa
|
Consider the table of term frequencies for 3 documents D1, D2, and D3D1 D2 D3car740auto330insurance 037Considering the bag of words model , with TF-IDF weightning and cosine similarity metric, which document (D1, D2 or D3) is most relevant to the following query:"car insurance"?
| 434
|
epfl_qa
|
epfl_dpo_qa
|
Consider two fully connected networks, A and B, with a constant width for all layers, inputs and outputs. Network A has depth $3L$ and width $H$, network B has depth $L$ and width $2H$. Everything else is identical for the two networks and both $L$ and $H$ are large. In this case, performing a single iteration of backpropagation requires fewer scalar multiplications for network A than for network B.
| 435
|
epfl_qa
|
epfl_dpo_qa
|
A query transformed into the concept space of LSI has?
| 436
|
epfl_qa
|
epfl_dpo_qa
|
Consider an RSA encryption where the $(p, q)$ are determined as $(53, 61)$. True or false: $(e,d) = (319, 23)$ are valid encoding/decoding exponents.
| 437
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is true?
| 438
|
epfl_qa
|
epfl_dpo_qa
|
Pick the \textit{correct} assertion. Kasiski test can be used to \dots?
| 439
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{false} statement. Enigma ...
| 440
|
epfl_qa
|
epfl_dpo_qa
|
Let $X$ be a random variable distributed over the alphabet $\mathcal{X}=\{0,1,\ldots,n\}$. Assume also that there exist $x_1,x_2\in\mathcal{X}$ such that $p_X(x_1)
eq p_X(x_2)$ ( extit{i.e.}, $X$ is not uniformly distributed over $\mathcal{X}$). Let $Y=2^X$ and $Z=\lfloor X/2
floor$. True or false: $H(Y)\geq \log_2(n+1)$?
| 441
|
epfl_qa
|
epfl_dpo_qa
|
Let $(G,+)$ be a group of order $n$. If $g$ is a generator of this group, then it has order\dots?
| 442
|
epfl_qa
|
epfl_dpo_qa
|
Let $G_1, G_2$, be valid generator matrices of dimensions $\mathbb F^{k_i imes n_i}$, all over the same field $\mathbb F$. Recall that ``valid'' means that for all $i$, $k_i \leq n_i$ and $ ext{rank}(G_i) = k_i$. True or false: Assuming $k_1 = k_2$ and $n_1=n_2$, the matrix $G_{7} + G_{8}$ is also a valid generator matrix.
| 443
|
epfl_qa
|
epfl_dpo_qa
|
Which one is \emph{not} a block cipher?
| 444
|
epfl_qa
|
epfl_dpo_qa
|
Consider an RSA encryption where the $(p, q)$ are determined as $(53, 61)$. True or false: $(e,d) = (7, 223)$ are valid encoding/decoding exponents.
| 445
|
epfl_qa
|
epfl_dpo_qa
|
What is the value of \(f(4)\) where \(f\) is defined as \(f(0) = f(1) = 1\) and \(f(n) = 2f(n - 1) + 3f(n - 2)\) for integers \(n \geq 2\)?
| 446
|
epfl_qa
|
epfl_dpo_qa
|
The statistical distance between two distributions is \dots?
| 447
|
epfl_qa
|
epfl_dpo_qa
|
Which one is \emph{not} a block cipher?
| 448
|
epfl_qa
|
epfl_dpo_qa
|
What are the complexities for the single-target dictionary attacks, when there are $N$ keys?
| 449
|
epfl_qa
|
epfl_dpo_qa
|
Given the following teleporting matrix (Ε) for nodes A, B and C:
[0 1⁄2 0]
[0 0 0]
[0 1⁄2 1]
and making no assumptions about the link matrix (R), which of the following is correct:?
| 450
|
epfl_qa
|
epfl_dpo_qa
|
When using bootstrapping in Random Forests, the number of different data items used to construct a single tree is:?
| 451
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} assertion regarding the Diffie-Hellman key exchange?
| 452
|
epfl_qa
|
epfl_dpo_qa
|
When using the plain ElGamal cryptosystem over the group $\mathbb{Z}_p^*$ with a fixed $\ell$-bit prime $p$ and a fixed generator $g\in\mathbb{Z}_p^*$, the \textit{tightest} complexity of generating a new key-pair is\ldots?
| 453
|
epfl_qa
|
epfl_dpo_qa
|
A Carmichael number is?
| 454
|
epfl_qa
|
epfl_dpo_qa
|
Given a document collection, if we change the ordering of the words in the documents, which of the following will not change?
| 455
|
epfl_qa
|
epfl_dpo_qa
|
What is WRONG regarding the Transformer model?
| 456
|
epfl_qa
|
epfl_dpo_qa
|
Due to the birthday paradox, a collision search in a hash function with $n$-bit output has complexity\dots?
| 457
|
epfl_qa
|
epfl_dpo_qa
|
For two $\ell$-bit numbers, the \textbf{tightest} complexity to compute their gcd is?
| 458
|
epfl_qa
|
epfl_dpo_qa
|
The k-means algorithm for clustering is guaranteed to converge to a local optimum.
| 459
|
epfl_qa
|
epfl_dpo_qa
|
Thang, Jeremie and Tugrulcan have built their own search engines. For a query Q, they got precision scores of 0.6, 0.7, 0.8 respectively. Their F1 scores (calculated by same parameters) are same. Whose search engine has a higher recall on Q?
| 460
|
epfl_qa
|
epfl_dpo_qa
|
What is the worst case complexity of listing files in a directory? The file system implements directories as hash-tables.
| 461
|
epfl_qa
|
epfl_dpo_qa
|
Thick the \emph{incorrect} assertion.
| 462
|
epfl_qa
|
epfl_dpo_qa
|
Which mode of operation is similar to a stream cipher?
| 463
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is/are true about fuzzing?
| 464
|
epfl_qa
|
epfl_dpo_qa
|
Applying logarithmic scaling is useless if we use Z-Score standardization (also known as normalization) afterwards, as the standardization will undo the effects of the scaling.
| 465
|
epfl_qa
|
epfl_dpo_qa
|
What is true regarding Fagin's algorithm?
| 466
|
epfl_qa
|
epfl_dpo_qa
|
Recall can be defined as:?
| 467
|
epfl_qa
|
epfl_dpo_qa
|
If timeliness is ensured by a communication channel then the channel also provides\ldots?
| 468
|
epfl_qa
|
epfl_dpo_qa
|
Consider the function $f: \R o \R$, $f(x) = \lvert x - 2023
vert$. A subgradient of $f$ at $x = 2023$ exists extbf{and} is unique.
| 469
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{correct} assertion.
| 470
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following models for generating vector representations for text require to precompute the frequency of co-occurrence of words from the vocabulary in the document collection?
| 471
|
epfl_qa
|
epfl_dpo_qa
|
Let $X$ and $K$ be two independent random variables in a group $G$ with $n$ elements and where $K$ is uniformly distributed over $G$. Let $Y = X+K$. Then, for any $y\in G$, $\Pr[Y=y]=$\dots?
| 472
|
epfl_qa
|
epfl_dpo_qa
|
Consider the following loaded dice with $6$ faces: $P(S_1=6)=5/6$ and $P(S_1 = x)=1/30$ for $x\in\{1,2,3,4,5\}$. Suppose we throw it indefinitely. Hence, we have a source $S=S_1 S_2 S_3\ldots$. Then, $H(S_n|S_{n-1})
eq H(S_n)$.
| 473
|
epfl_qa
|
epfl_dpo_qa
|
(Weight initialization) The choice of weight initialization will not impact the optimization behavior of the neural network.
| 474
|
epfl_qa
|
epfl_dpo_qa
|
What is the worst case complexity of listing files in a directory? The file system implements directories as hash-tables.
| 475
|
epfl_qa
|
epfl_dpo_qa
|
Thick the \emph{incorrect} assertion.
| 476
|
epfl_qa
|
epfl_dpo_qa
|
What is/are the goal/s of compartmentalization?
| 477
|
epfl_qa
|
epfl_dpo_qa
|
What is TRUE regarding the Multi-head Self-attention mechanism?
| 478
|
epfl_qa
|
epfl_dpo_qa
|
(Generalized Linear Models) Deep neural networks with logistic loss for binary classification are generalized linear models.
| 479
|
epfl_qa
|
epfl_dpo_qa
|
What are the drawbacks of non-preemptive scheduling compared to preemptive scheduling?
| 480
|
epfl_qa
|
epfl_dpo_qa
|
Consider the following joint distribution on $X$ and $Y$, where both random variables take on the values $\{0,1\}: p(X=$ $0, Y=0)=0.1, p(X=0, Y=1)=0.2, p(X=1, Y=0)=0.3, p(X=1, Y=1)=0.4$. You receive $X=1$. What is the largest probability of being correct you can achieve when predicting $Y$ in this case?
| 481
|
epfl_qa
|
epfl_dpo_qa
|
Which statement about extit{black-box} adversarial attacks is true:?
| 482
|
epfl_qa
|
epfl_dpo_qa
|
Let $G_1, G_2$, be valid generator matrices of dimensions $\mathbb F^{k_i imes n_i}$, all over the same field $\mathbb F$. Recall that ``valid'' means that for all $i$, $k_i \leq n_i$ and $ ext{rank}(G_i) = k_i$. True or false: Assuming $k_1 = k_2$ and $n_1=n_2$, the matrix $G_{7} + G_{8}$ is also a valid generator matrix.
| 483
|
epfl_qa
|
epfl_dpo_qa
|
Let $f: \mathbb{Z}_{m n} \rightarrow \mathbb{Z}_m \times \mathbb{Z}_n$ be defined by $f (x) = (x \bmod m,x \bmod n)$. Then $f$ is a ring isomorphism between $\mathbb{Z}_{180}$ and:?
| 484
|
epfl_qa
|
epfl_dpo_qa
|
Given the 2-itemsets {1, 2}, {1, 3}, {1, 5}, {2, 3}, {2, 5}, when generating the 3-itemset we will:?
| 485
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement.
| 486
|
epfl_qa
|
epfl_dpo_qa
|
With Fagin’s algorithm, once k documents have been identified that occur in all of the lists?
| 487
|
epfl_qa
|
epfl_dpo_qa
|
I want to send a value to Bob without him knowing which value I sent and such that I cannot change my mind later when I reveal it in clear. I should use \dots?
| 488
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{true} assertion.
| 489
|
epfl_qa
|
epfl_dpo_qa
|
We consider a month of 30 days. I have \(n\) chocolates and each day, I can either: not eat chocolate or eat exactly one chocolate. All chocolates needs to be eaten by the end of the month. What is the smallest number of chocolates needed to guarantee that I will eat chocolate 5 days in a row during the month?
| 490
|
epfl_qa
|
epfl_dpo_qa
|
How many necessary and sufficient queries do we need to distinguish the distribution $P$ from the uniform distribution $U$ with significant advantage?
| 491
|
epfl_qa
|
epfl_dpo_qa
|
Which method can be used for dimensionality reduction ?
| 492
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{correct} statement. In DSA signature, i.e., DSS?
| 493
|
epfl_qa
|
epfl_dpo_qa
|
For this question, one or more assertions can be correct. Tick only the correct assertion(s). There will be a penalty for wrong assertions ticked.Which of the following associations can be considered as illustrative examples for inflectional
morphology (with here the simplifying assumption that canonical forms are restricted to the roots
only)?
| 494
|
epfl_qa
|
epfl_dpo_qa
|
Consider the classes below and tick the correct answer. class A class B extends A class C[-T]?
| 495
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following encryption schemes is deterministic?
| 496
|
epfl_qa
|
epfl_dpo_qa
|
What should be the type of value ? // list: List[String] list.foldLeft(value)((x, y) => x + y.length)?
| 497
|
epfl_qa
|
epfl_dpo_qa
|
Let $G$, be a valid generator matrix of dimensions $\mathbb F^{k imes n}$. Recall that ``valid'' means that $k \leq n$ and $ ext{rank}(G) = k$. Let $D_1 \in \mathbb F^{k imes k}$ and $D_2 \in \mathbb F^{n imes n}$ be diagonal matrices with non-zero diagonal elements. True or false: $D_1 \cdot G \cdot D_2$ is also a valid generator matrix.
| 498
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{true} assertion. In RSA \ldots?
| 499
|
epfl_qa
|
epfl_dpo_qa
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.