Weekend Special Sale Limited Time 70% Discount Offer - Ends in 0d 00h 00m 00s - Coupon code: buysanta

Exact2Pass Menu

Login / Register

Question # 4

Assuming the node index starts at 1, what is the out-degree of node 3 in the adjacency matrix shown?

Refer to the exhibit.

A.

0

B.

1

C.

2

D.

3

Full Access
Question # 5

What are the major components of the YARN architecture?

A.

ResourceManager and NodeManager

B.

Task Tracker and NameNode

C.

HDFS, Tez, and Spark

D.

Avro, ZooKeeper, and HDFS

Full Access
Question # 6

What elements are needed to determine the time complexity of finding all the cliques of size k in social network analysis?

A.

Eigenvector centrality and betwenness

B.

Clique size and total number of nodes in the network

C.

Number of edges in the network and centrality measure of the cliques

D.

Clique size and betweenness centrality

Full Access
Question # 7

Given an input vector of features, a Random Forests model performs a classification task and ends in a tie.

How does the model handle this outcome?

A.

The model will be rebuilt

B.

A winner is chosen at random

C.

The tree that caused the tie is discarded

D.

One more tree is added to the forest

Full Access
Question # 8

What does YARN provide over and above MapReduce?

A.

Separate cluster and resource management

B.

Parallelized processing

C.

Serialized processing

D.

Access to HDFS data

Full Access
Question # 9

Which representation is most suitable for a small and highly connected network?

A.

Edge list

B.

Adjacency matrix

C.

Eigenvector centrality

D.

Adjacency list

Full Access