question
stringlengths 4
6.13k
| question_id
int64 0
49.1k
| dataset
stringclasses 3
values | category
stringclasses 75
values |
|---|---|---|---|
(Bayes Nets) We are given a Bayes net involving the variables $X_{1}, \cdots, X_{n}$. We determine, using our standard rules, that $X_{1} \perp X_{2} \mid X_{3}$. Assume now that you delete some edges in the original Bayes net. For the modified Bayes net, is it always true that $X_{1} \perp X_{2} \mid X_{3}$ ?
| 100
|
epfl_qa
|
epfl_dpo_qa
|
Let $\mathcal{C}$ be a $(n,k)$ Reed-Solomon code on $\mathbb{F}_q$. Let $\mathcal{C}'$ be the $(2n,k)$ code such that each codeword of $\mathcal{C}'$ is a codeword of $\mathcal{C}$ repeated twice, i.e., if $(x_1,\dots,x_n) \in\mathcal{C}$, then $(x_1,\dots,x_n,x_1,\dots,x_n)\in\mathcal{C'}$. What is the minimum distance of $\mathcal{C}'$?
| 101
|
epfl_qa
|
epfl_dpo_qa
|
Dan has been working with decision trees. His friend Eve recommends using random forests instead. What is most likely to happen?
| 102
|
epfl_qa
|
epfl_dpo_qa
|
The training loss of logistic regression is always zero.
| 103
|
epfl_qa
|
epfl_dpo_qa
|
When representing the adjacency list of a Web page in a connectivity server by using a reference list from another Web page, the reference list is searched only in a neighbouring window of the Web page's URL, because:?
| 104
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} statement for \emph{independent} random variables $X$ and $Y$.
| 105
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{true} statement.
| 106
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{true} assertion. Assume that $C$ is an arbitrary random permutation.
| 107
|
epfl_qa
|
epfl_dpo_qa
|
10 itemsets out of 100 contain item A, of which 5 also contain B. The rule A -> B has:?
| 108
|
epfl_qa
|
epfl_dpo_qa
|
In a FP tree, the leaf nodes are the ones with:?
| 109
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{false} assertion. Using double encryption leads to\dots?
| 110
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following operation is not part of AES?
| 111
|
epfl_qa
|
epfl_dpo_qa
|
Using a salt in a password authentication protocol\dots?
| 112
|
epfl_qa
|
epfl_dpo_qa
|
Find $[3^{288294}]_{35}$.
| 113
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is \textbf{not} a finite field.
| 114
|
epfl_qa
|
epfl_dpo_qa
|
``In any finite group, the order of an element is a factor of the order of the group" is stated by?
| 115
|
epfl_qa
|
epfl_dpo_qa
|
In a zero-knowledge interactive proof, the prover wants to prove :?
| 116
|
epfl_qa
|
epfl_dpo_qa
|
Which one of these is \emph{not} a stream cipher?
| 117
|
epfl_qa
|
epfl_dpo_qa
|
We want to return, from the two posting lists below, the top-2 documents matching a query using Fagin’s algorithm with the aggregation function taken as the sum of the tf-idf weights. How many entries (total of both lists) are accessed in the first phase of the algorithm performing round robin starting at List 1 (i.e., before performing the random access)?List 1List 2documenttf-idfdocumenttf-idfd30.8d10.8d20.6d30.6d10.5d40.5d40.4d20.4?
| 118
|
epfl_qa
|
epfl_dpo_qa
|
Which one is a stream cipher?
| 119
|
epfl_qa
|
epfl_dpo_qa
|
A MAC forgery is\dots?
| 120
|
epfl_qa
|
epfl_dpo_qa
|
CBC can deal with three types of IV. Tick the \emph{false} answer.
| 121
|
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.
| 122
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{false} assertion. In Linear Cryptanalysis, the corresponding mask circuit of \ldots?
| 123
|
epfl_qa
|
epfl_dpo_qa
|
Whenever I want to use Z-Score standardization (also known as normalization), I should use the mean and standard deviation of the training set to normalize my training, validation, and test set.
| 124
|
epfl_qa
|
epfl_dpo_qa
|
The type statement in RDF would be expressed in the relational data model by a table?
| 125
|
epfl_qa
|
epfl_dpo_qa
|
(Backpropagation) Training via the backpropagation algorithm always learns a globally optimal neural network if there is only one hidden layer and we run an infinite number of iterations and decrease the step size appropriately over time.
| 126
|
epfl_qa
|
epfl_dpo_qa
|
The feature ``deck structure type'' can have the following values:
Cast-in-place Concrete,
Concrete Precast Panel,
Open Grating,
Closed Grating,
Steel plate,
Corrugated Steel,
Aluminum and
Timber.
For logistic regression, what is the best encoding for these values? (One or multiple answers)?
| 127
|
epfl_qa
|
epfl_dpo_qa
|
The exponent $\lambda(21)$ of $\mathbb{Z}_{21}^*$ is ...
| 128
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{true} assertion. In RSA \ldots?
| 129
|
epfl_qa
|
epfl_dpo_qa
|
What is WRONG regarding the Transformer model?
| 130
|
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)?
| 131
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following provides forward secrecy.
| 132
|
epfl_qa
|
epfl_dpo_qa
|
A passive adversary can \ldots?
| 133
|
epfl_qa
|
epfl_dpo_qa
|
Which defense(s) highlight the principle of least privilege in software
security?
| 134
|
epfl_qa
|
epfl_dpo_qa
|
Let $H:\{0,1\}^* \rightarrow \{0,1\}^n$ be a hash function and $x_1,x_2\in\{0,1\}^{2n}$ two random different messages. In cryptography, we usually assume that the probability of collision, i.e. $\Pr[H(x_1)=H(x_2)]$, is close to \ldots?
| 135
|
epfl_qa
|
epfl_dpo_qa
|
For which kind of bugs does default LLVM provide sanitizers?
| 136
|
epfl_qa
|
epfl_dpo_qa
|
What is the \textbf{minimal} requirement to make the Vigen\`ere cipher perfectly secure.
| 137
|
epfl_qa
|
epfl_dpo_qa
|
Consider a twelve-round Feistel scheme $\Psi(F^{k_1},F^{k_2},\dots,F^{k_{12}})$. Tick the \emph{minimal necessary} condition for $\Psi$ to be a permutation:?
| 138
|
epfl_qa
|
epfl_dpo_qa
|
Let $\mathcal{C}$ be a binary $(6,3)$ linear code containing the codewords $\mathbf{x}_1 = 011011$, $\mathbf{x}_2 = 101101$ and $\mathbf{x}_3 = 111000$. True or false: The minimum distance of the code is $d_{\min} = 3$.
| 139
|
epfl_qa
|
epfl_dpo_qa
|
Which one is \emph{not} a block cipher?
| 140
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{false} assertion. The ElGamal cryptosystem\dots?
| 141
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{false} answer. In a group, the operation\dots?
| 142
|
epfl_qa
|
epfl_dpo_qa
|
Let $b$ be the maximum number of linearly independent columns of a parity check matrix $H$ of a linear code. True or false: Then, the minimum distance of the code is $b+1$.
| 143
|
epfl_qa
|
epfl_dpo_qa
|
In x86, what are the possible ways to transfer arguments when invoking a system call? For example, in the following code, string and len are sys_cputs’s arguments.
| 144
|
epfl_qa
|
epfl_dpo_qa
|
Consider the source $S_1, S_2, \dots$ such that $S_1$ is uniformly distributed on $\mathbb{Z}/10\mathbb{Z}^*$, and for every $n\geq 1$, $S_{n+1}$ is distributed uniformly on $\mathbb{Z}/(S_n+1)\mathbb{Z}^*$. Let $H(\mathcal{S}) = \lim_{n o\infty} H(S_n)$. True or false: The source is stationary.
| 145
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following graph analysis techniques do you believe would be most appropriate to identify communities on a social graph?
| 146
|
epfl_qa
|
epfl_dpo_qa
|
What is the content of the inode?
| 147
|
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.
| 148
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} assertion regarding the security of the Diffie-Hellman key exchange over a subgroup $\langle g \rangle \subset \mathbb{Z}_p^*$.
| 149
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement. Problems in Bluetooth includes:?
| 150
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} assertion. The security of the DH protocol requires \dots?
| 151
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement. Elliptic Curve Diffie-Hellman is?
| 152
|
epfl_qa
|
epfl_dpo_qa
|
The number of prime numbers in $\{2,3,\dots ,N\}$ when $N$ increases towards the infinity tends to\dots?
| 153
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{correct} assertion. In ElGamal $\ldots$?
| 154
|
epfl_qa
|
epfl_dpo_qa
|
We want to return, from the two posting lists below, the top-2 documents matching a query using Fagin’s algorithm with the aggregation function taken as the sum of the tf-idf weights. How many entries (total of both lists) are accessed in the first phase of the algorithm performing round robin starting at List 1 (i.e., before performing the random access)?List 1List 2documenttf-idfdocumenttf-idfd30.8d10.8d20.6d30.6d10.5d40.5d40.4d20.4?
| 155
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{false} assertion about Diffie and Hellman.
| 156
|
epfl_qa
|
epfl_dpo_qa
|
Given the distribution $P_0$ of a normal coin, i.e. $P_0(0)=P_0(1)=\frac{1}{2}$, and distribution $P_1$ of a biased coin, where $P_1(0)=\frac{1}{3}$ and $P_1(1) = \frac{2}{3}$ , the maximal advantage of a distinguisher using a single sample is\dots?
| 157
|
epfl_qa
|
epfl_dpo_qa
|
Given two distributions $P_0$ and $P_1$ over a discrete set $Z$, the maximal advantage of a distinguisher using a single sample is\dots?
| 158
|
epfl_qa
|
epfl_dpo_qa
|
One-time pad ...
| 159
|
epfl_qa
|
epfl_dpo_qa
|
Consider the list : 5, 12, 7, 8, 41
In which sorting algorithm(s) do you directly compare 5 and 41 ?
We are considering the version of insertion sort seen in the slides of the lecture: we compare \( a_j \) to \( a_{j-1} \), then \( a_{j-2} \) etc ...
?
| 160
|
epfl_qa
|
epfl_dpo_qa
|
When applying Fagin’s algorithm for a query with three different terms for finding the k top documents, the algorithm will scan?
| 161
|
epfl_qa
|
epfl_dpo_qa
|
Does the following code compile? given Ordering[Int] with \t def compare(x: Int, y: Int): Int = y - x given Ordering[Int] with \t def compare(x: Int, y: Int): Int = x - y List(1, 2, 3).sorted?
| 162
|
epfl_qa
|
epfl_dpo_qa
|
Which of the following is/are true about fuzzing?
| 163
|
epfl_qa
|
epfl_dpo_qa
|
How is data integrity ensured in WEP?
| 164
|
epfl_qa
|
epfl_dpo_qa
|
Consider the following set of frequent 3-itemsets: {1, 2, 3}, {1, 2, 4}, {1, 2, 5}, {1, 3, 4}, {2, 3, 4}, {2, 3, 5}, {3, 4, 5}. Which one is not a candidate 4-itemset?
| 165
|
epfl_qa
|
epfl_dpo_qa
|
(FastText supervised Classifier) The FastText supervised classifier can be modeled as a one-hidden-layer neural network.
| 166
|
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\)?
| 167
|
epfl_qa
|
epfl_dpo_qa
|
Dan has been working with decision trees. His friend Eve recommends using random forests instead. What is most likely to happen?
| 168
|
epfl_qa
|
epfl_dpo_qa
|
What is the complexity of generating an RSA modulus of length $2\ell$?
| 169
|
epfl_qa
|
epfl_dpo_qa
|
A model which has a high bias necessarily has a low variance.
| 170
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{false} assertion. The ElGamal cryptosystem\dots?
| 171
|
epfl_qa
|
epfl_dpo_qa
|
Choose the \emph{incorrect} statement?
| 172
|
epfl_qa
|
epfl_dpo_qa
|
What is the \textbf{minimal} requirement to make the Vigen\`ere cipher perfectly secure.
| 173
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{minimal} assumption on the required channel to exchange the key of a Message Authentication Code (MAC):?
| 174
|
epfl_qa
|
epfl_dpo_qa
|
Which flag prevents user programs from reading and writing kernel data?
| 175
|
epfl_qa
|
epfl_dpo_qa
|
Choose the \emph{incorrect} statement?
| 176
|
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.
| 177
|
epfl_qa
|
epfl_dpo_qa
|
The feature ``deck structure type'' can have the following values:
Cast-in-place Concrete,
Concrete Precast Panel,
Open Grating,
Closed Grating,
Steel plate,
Corrugated Steel,
Aluminum and
Timber.
For logistic regression, what is the best encoding for these values? (One or multiple answers)?
| 178
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{true} assertion related to the ElGamal signature scheme.
| 179
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{incorrect} assertion. In a multiplicative cyclic group $G$ of order $m > 1$ with neutral element $e_G$ \ldots?
| 180
|
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$.
| 181
|
epfl_qa
|
epfl_dpo_qa
|
A retrieval model attempts to capture?
| 182
|
epfl_qa
|
epfl_dpo_qa
|
Consider a linear regression problem with $N$ samples where the input is in $D$-dimensional space, and all output values are $y_{i} \in\{-1,+1\}$. Which of the following statements is correct?
| 183
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \emph{false} assertion. Two-keys triple DES\dots?
| 184
|
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 What does the following function implement? b => c => b (not c) c?
| 185
|
epfl_qa
|
epfl_dpo_qa
|
Find $[3^{288294}]_{35}$.
| 186
|
epfl_qa
|
epfl_dpo_qa
|
In order to have security of $2^{128}$ against key recovery attack for a (secure) symmetric key encryption scheme \ldots?
| 187
|
epfl_qa
|
epfl_dpo_qa
|
Tick the \textbf{incorrect} assertion. Using sequential composition,\dots?
| 188
|
epfl_qa
|
epfl_dpo_qa
|
What is a correct pruning strategy for decision tree induction?
| 189
|
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:?
| 190
|
epfl_qa
|
epfl_dpo_qa
|
Let $n=pq$ be a RSA modulus and let $(e,d)$ be a RSA public/private key. Tick the \emph{correct} assertion.
| 191
|
epfl_qa
|
epfl_dpo_qa
|
Which one of these is not believed to be a hard problem?
| 192
|
epfl_qa
|
epfl_dpo_qa
|
Select the \emph{incorrect} statement. The brute force attack \dots?
| 193
|
epfl_qa
|
epfl_dpo_qa
|
The Merkle-D{\aa}mgard construction is?
| 194
|
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.
| 195
|
epfl_qa
|
epfl_dpo_qa
|
Which MAC construction is NOT based on the CBC mode?
| 196
|
epfl_qa
|
epfl_dpo_qa
|
Principle Component Analysis (PCA) is a technique for...
| 197
|
epfl_qa
|
epfl_dpo_qa
|
To obtain a security of $2^{80}$ in a hash function against collisions one needs a hash output of size?
| 198
|
epfl_qa
|
epfl_dpo_qa
|
One-time pad ...
| 199
|
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.