question
stringlengths 4
6.13k
| question_id
int64 0
49.1k
| dataset
stringclasses 3
values | category
stringclasses 75
values |
|---|---|---|---|
A shadow stack...
| 300
|
epfl_qa
|
epfl_dpo_qa
|
Select \emph{incorrect} statement. Generic attacks on DES include?
| 301
|
epfl_qa
|
epfl_dpo_qa
|
In JOS, suppose one Env sends a page to another Env. Is the page copied?
| 302
|
epfl_qa
|
epfl_dpo_qa
|
In JOS and x86, which register stores the system call number when invoking a system call?
| 303
|
epfl_qa
|
epfl_dpo_qa
|
For the number of times the apriori algorithm and the FPgrowth algorithm for association rule mining are scanning the transaction database the following is true?
| 304
|
epfl_qa
|
epfl_dpo_qa
|
Which symmetric key primitive is used in WPA2 encryption?
| 305
|
epfl_qa
|
epfl_dpo_qa
|
The needed number of DES operations to attack DES is about ...
| 306
|
epfl_qa
|
epfl_dpo_qa
|
If timeliness is ensured by a communication channel then the channel also provides\ldots?
| 307
|
epfl_qa
|
epfl_dpo_qa
|
Which one of the following encryption method is a simple substitution cipher?
| 308
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement. Elliptic Curve Diffie-Hellman is?
| 309
|
epfl_qa
|
epfl_dpo_qa
|
The test loss of the 1-nearest neighbor classifier is always zero.
| 310
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{correct} assertion. Assume that $C$ is an arbitrary random permutation.
| 311
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textit{incorrect} assertion.
| 312
|
epfl_qa
|
epfl_dpo_qa
|
Consider a group $G$ with prime order. We can deduce that?
| 313
|
epfl_qa
|
epfl_dpo_qa
|
Which defense(s) highlight the principle of least privilege in software
security?
| 314
|
epfl_qa
|
epfl_dpo_qa
|
The Merkle-D{\aa}mgard construction is?
| 315
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{\emph{incorrect}} assertion.
| 316
|
epfl_qa
|
epfl_dpo_qa
|
Which one of these is \emph{not} a hard computational problem?
| 317
|
epfl_qa
|
epfl_dpo_qa
|
Which statement about Singular Value Decomposition (SVD) is true?
| 318
|
epfl_qa
|
epfl_dpo_qa
|
Increasing the depth of a decision tree cannot increase its training error.
| 319
|
epfl_qa
|
epfl_dpo_qa
|
Given that $100000000003$ is prime, what is the cardinality of $\mathbf{Z}_{200000000006}^*$?
| 320
|
epfl_qa
|
epfl_dpo_qa
|
Suppose that an item in a leaf node N exists in every path. Which one is correct? ?
| 321
|
epfl_qa
|
epfl_dpo_qa
|
Compared to the plain RSA cryptosystem and for equivalent key sizes, the plain Elgamal cryptosystem has\dots?
| 322
|
epfl_qa
|
epfl_dpo_qa
|
Let $f$ be any hash function with output domain size $N$.
| 323
|
epfl_qa
|
epfl_dpo_qa
|
In the first pass over the database of the FP Growth algorithm?
| 324
|
epfl_qa
|
epfl_dpo_qa
|
Your input is "Distributed Information Systems". Your model tries to predict "Distributed" and "Systems" by leveraging the fact that these words are in the neighborhood of "Information". This model can be:?
| 325
|
epfl_qa
|
epfl_dpo_qa
|
Consider an RSA encryption where the public key is published as $(m, e) = (55, 17)$. Which one of the following numbers is a valid decoding exponent?
| 326
|
epfl_qa
|
epfl_dpo_qa
|
Using a 4-gram character model, comparing "banana" and "ananas"...
| 327
|
epfl_qa
|
epfl_dpo_qa
|
Consider a group $G$ with prime order. We can deduce that?
| 328
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} statement. The following statements have been proven:?
| 329
|
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?
| 330
|
epfl_qa
|
epfl_dpo_qa
|
Let $$G= egin{pmatrix} 1 &1 &1 &0 &1 &0\ 0 &1 &1 &1 &0 &0\ 0 &1 &1 &0 &0 &0\ 0 &1 &1 &1 &0 &1 \end{pmatrix}$$ be the generator matrix of a $(6,4)$ linear code $\mathcal C$ over $\mathbb F_2$. True or false: $d_{min}=2$.
| 331
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following attacks makes sense for a MAC:?
| 332
|
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|X)=H(Z|X)$?
| 333
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following integers has the square roots $\{2,3\}$ when taken modulo $5$ \textbf{and} the square roots $\{3,10\}$ when taken modulo $13$.
| 334
|
epfl_qa
|
epfl_dpo_qa
|
You are given a hash function $h$ based on the Merkle-Damg{\aa}rd scheme. Which of the following attacks is the most difficult, \emph{a priori}?
| 335
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following operations would switch the user program from user space to kernel space?
| 336
|
epfl_qa
|
epfl_dpo_qa
|
The Merkle-D{\aa}mgard construction is?
| 337
|
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}$.
| 338
|
epfl_qa
|
epfl_dpo_qa
|
In a Ranked Retrieval result, the result at position k is non-relevant and at k+1 is relevant. Which of the following is always true (P@k and R@k are the precision and recall of the result set consisting of the k top ranked documents)?
| 339
|
epfl_qa
|
epfl_dpo_qa
|
Generative Adversarial Networks use the generator and discriminator models during training but only the discriminator for data synthesis.
| 340
|
epfl_qa
|
epfl_dpo_qa
|
Let $G$ be a set and $*$ a commutative operation on pairs of elements from $G.$ Suppose there exists an element $e\in G$ such that $a*e=e*a=a$ for all $a \in G.$ Also, suppose there exist elements $b,c,d \in G$ such that $b*c=d*c.$. True or false: If $b
ot=d,$ then $(G,*)$ cannot be a group.
| 341
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is/are true about fuzzing?
| 342
|
epfl_qa
|
epfl_dpo_qa
|
Consider an RSA encryption where the public key is published as $(m, e) = (35, 11)$. Which one of the following numbers is a valid decoding exponent?
| 343
|
epfl_qa
|
epfl_dpo_qa
|
We want to generate a $\ell$-bit prime. The complexity is roughly\dots?
| 344
|
epfl_qa
|
epfl_dpo_qa
|
In a zero-knowledge interactive proof, the prover wants to prove :?
| 345
|
epfl_qa
|
epfl_dpo_qa
|
Let the first four retrieved documents be N N R R, where N denotes a non-relevant and R a relevant document. Then the MAP (Mean Average Precision) is:?
| 346
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is correct regarding schemas and ontologies?
| 347
|
epfl_qa
|
epfl_dpo_qa
|
One of the following ciphers is a \emph{block} cipher. Which one?
| 348
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{incorrect} assumption.
| 349
|
epfl_qa
|
epfl_dpo_qa
|
The Factoring Problem is equivalent to ...
| 350
|
epfl_qa
|
epfl_dpo_qa
|
Church booleans are a representation of booleans in the lambda calculus. The Church encoding of true and false are functions of two parameters: Church encoding of tru: t => f => t Church encoding of fls: t => f => f Which of the following functions implements not b?
| 351
|
epfl_qa
|
epfl_dpo_qa
|
(Text Representation Learning, GloVe) Learning GloVe word vectors is identical to approximating the observed entries of the word/context co-occurence counts by $\mathbf{W} \mathbf{Z}^{\top}$, in the least square sense, if the $f_{d n}$ weights are set to 1 for all observed entries.
| 352
|
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.
| 353
|
epfl_qa
|
epfl_dpo_qa
|
What is the complexity of generating an RSA modulus of length $2\ell$?
| 354
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} statement. The following statements have been proven:?
| 355
|
epfl_qa
|
epfl_dpo_qa
|
Which defense(s) highlight the principle of least privilege in software
security?
| 356
|
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:?
| 357
|
epfl_qa
|
epfl_dpo_qa
|
Consider the classes below and tick the correct answer. class A class B extends A class C[-T]?
| 358
|
epfl_qa
|
epfl_dpo_qa
|
An HMM model would not be an appropriate approach to identify?
| 359
|
epfl_qa
|
epfl_dpo_qa
|
What could Out of Vocabulary (OoV) forms consist of? Select all that apply.A penalty will be applied for wrong answers.
| 360
|
epfl_qa
|
epfl_dpo_qa
|
Consider a neural net with $K$ nodes per hidden layer. In a standard such net we have $K^{2}$ parameters/weights (ignoring the bias terms) per layer. Consider a convolutional net where the data is laid out in a one-dimensional fashion and the filter/kernel has $M$ non-zero terms. Ignoring the bias terms, how many parameters are there per layer?
| 361
|
epfl_qa
|
epfl_dpo_qa
|
Let $H$ be a hash function based on the Merkle-Damg{\aa}rd construction. The Merkle-Damg{\aa}rd theorem says that \dots?
| 362
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{correct} statement. $\Sigma$-protocols \ldots?
| 363
|
epfl_qa
|
epfl_dpo_qa
|
Categorical Cross-Entropy loss:?
| 364
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following statement(s) is/are correct?
| 365
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement. UMTS uses?
| 366
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{incorrect} assertion regarding plain Rabin, i.e., Rabin without any redundancy.
| 367
|
epfl_qa
|
epfl_dpo_qa
|
(Stochastic Gradient Descent, cont) SGD in typical machine learning problems requires fewer parameter updates to converge than full gradient descent.
| 368
|
epfl_qa
|
epfl_dpo_qa
|
Why is natural language processing difficult?Select all that apply.You will get a penalty for wrong answers.
| 369
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following in Linux x86-64 assembly snippets can be used as a
gadget AND can be chained with more gadgets (e.g., in a ROP/JOP chain)?
| 370
|
epfl_qa
|
epfl_dpo_qa
|
Let $n \geq 2$ be a positive integer, and $M$ a uniformly distributed binary message of length $2n$. Let $P_K(M)$ denote the one-time pad encryption of $M$ with key $K$. Let $K_1$ be a uniformly distributed binary key length $n$. Let $K_2$ be the complement of $K_1$. Let $K_3$ be the reverse of $K_1$. Let $K_i||K_j$ denote the concatenation of the two keys. True or false: Encryption with the key $K_6 = ( K_1|| K_3 ) $, $P_{K_6}(M)$ provides perfect secrecy.
| 371
|
epfl_qa
|
epfl_dpo_qa
|
A page that points to all other pages but is not pointed by any other page would have...
| 372
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is/are true about fuzzing with sanitizers?
| 373
|
epfl_qa
|
epfl_dpo_qa
|
In the GSM infrastructure, which of the following entity contains Ki?
| 374
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement. Factoring?
| 375
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is true?
| 376
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{correct} assertion. The maximum advantage of an \textbf{adaptive} distinguisher limited to $q$ queries between two random functions $F$ and $F^*$ is always\dots?
| 377
|
epfl_qa
|
epfl_dpo_qa
|
Let $0\leq\alpha\leq1$ be an unknown constant. Let $X$ be a random variable taking values in $\mathcal{X}=\{0,1,2\}$ with probability $p_X(0) = p_X(1) = \alpha$ and $p_X(2) = 1-2\alpha$. Let $Y$ be a random variable defined as follows egin{equation*}Y = egin{cases}1, & ext{if }X=2\0, & ext{if } X
eq 2\end{cases}.\end{equation*} You also know that $H(X|Y) = rac{1}{2}$. Choose the correct value of $\alpha$.
| 378
|
epfl_qa
|
epfl_dpo_qa
|
Select the correct canonical representation(s) of the English verb "to dance" conjugated at the third person singular indicative present. You will get a penalty for wrong ticks.
| 379
|
epfl_qa
|
epfl_dpo_qa
|
A simple substitution cipher can be broken \dots?
| 380
|
epfl_qa
|
epfl_dpo_qa
|
What is the benefit of LDA over LSI?
| 381
|
epfl_qa
|
epfl_dpo_qa
|
Due to the birthday paradox, a collision search in a hash function with $n$-bit output has complexity\dots?
| 382
|
epfl_qa
|
epfl_dpo_qa
|
(Linear Regression) You are given samples $\mathcal{S}=\left\{\left(\mathbf{x}_{n}, y_{n}\right)\right\}_{n=1}^{N}$ where $\mathbf{x}_{n} \in \mathbb{R}^{D}$ and $y_{n}$ are scalar values. You are solving linear regression using normal equations. You will always find the optimal weights with 0 training error in case of $N \leq D$.
| 383
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is \textbf{not} a finite field.
| 384
|
epfl_qa
|
epfl_dpo_qa
|
Let $\mathcal C_1$ be a linear code over $\mathbb F_3^n$, and let $\mathcal C_2$ be a linear code over $\mathbb F_2^n$. True or false: $\mathcal C_1 \cap \mathcal C_2$ is necessarily a linear code over $\mathbb F_3^n$.
| 385
|
epfl_qa
|
epfl_dpo_qa
|
A query transformed into the concept space of LSI has?
| 386
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{incorrect} assumption. A language $L$ is in NP if\dots?
| 387
|
epfl_qa
|
epfl_dpo_qa
|
LFSRs are used within \ldots?
| 388
|
epfl_qa
|
epfl_dpo_qa
|
Which is true?
| 389
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{true} assertion.
| 390
|
epfl_qa
|
epfl_dpo_qa
|
Let $h$ be a cryptographic hash function based on the Merkle-Damg{\aa}rd scheme. The Merkle-Damg{\aa}rd Theorem states that\dots?
| 391
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{incorrect} assertion regarding plain Rabin, i.e., Rabin without any redundancy.
| 392
|
epfl_qa
|
epfl_dpo_qa
|
Nearest neighbor classifiers cannot be used for regression because they rely on majority voting, which is not suited for continuous labels.
| 393
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following operations would switch the user program from user space to kernel space?
| 394
|
epfl_qa
|
epfl_dpo_qa
|
Which flag prevents user programs from reading and writing kernel data?
| 395
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following apply to recent Android-based mobile systems but not
to Linux-based desktop systems?
| 396
|
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?
| 397
|
epfl_qa
|
epfl_dpo_qa
|
Select \emph{incorrect} statement. The exhaustive search?
| 398
|
epfl_qa
|
epfl_dpo_qa
|
What is the support of the itemset {beer, chocolate} and the confidence of the rule {chocolate} → {beer} in the dataset below?TID: Items BoughtT1: milk, butter, beerT2: milk, diaper, beer, eggsT3: butter, diaper, beer, chocolate
T4: milk, butter, diaper, beerT5: milk, butter, diaper, chocolate
?
| 399
|
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.