Midterm Quizzes Flashcards

1
Q

TF GFS does support the complete standard APIs such as POSIX

A

false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

TF the master in GFS maintains the locations of chunks only in the memory

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

TF A GFS1 cluster consists of a single master and multiple chunk servers

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

TF GFS garuntees that all the replicas of a chunk are stored in a single chunk server

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

TF CAP theorem states its impossible to provide all 3 of consistancy, atomicity, and partition tolerance

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

list all the R and W locks required to preform this snapshot

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

TF In hadoops YARN, when a mapreduce job is createdm the users JAR file is passsed to the resource manager as one of its parameters

A

true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

TF in hadoops YARN implementation, the node manager peroidicly pings the yarnchild to monitor the task

A

F

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

In hadoop yarn framwork, if the reducers just completed the copy phase, what would the progress estimated by YARN for the reduce phase

A

1/3

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

TF The hadoops combiner must have the same input and output format as that of the mappers output

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

TF In hadoop YARN framework, a single partition is allowed to contain only one key

A

False

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

in a transition matrix M for pagerank what is m_ij

A

The probability that a surfer at node j will move to node i in the next step

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

in the pagerank equation, what is v_j

A

the probablity that the surfer was at node j at the previous step

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

2 poss with a bloom filter

A

might be part of a set

not a part of set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

4 modulo 15

A

4

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

process to test this

A

do each hash function

If all 3 match up with a 1 then might be mem of set

if any are 0, then not member of set