Summer Sale Limited Time 60% Discount Offer - Ends in 0d 00h 00m 00s - Coupon code: 28522818

Home > EMC > EMCDS > E20-065

E20-065 Advanced Analytics Specialist Exam for Data Scientists Question and Answers

Question # 4

What do first-order and second-order Markov processes have in common concerning next word prediction?

A.

Both use WordNet to model the probability of the next word

B.

Both are unsupervised methods

C.

Both provide the foundation to build a trigram language model

D.

Neither makes assumptions about the probability of the next word

Full Access
Question # 5

What best describes tokenization?

A.

Adding lexical relations to the raw text

B.

Converting text into the list of terms

C.

Converting text into a list of unique terms

D.

Reducing variant forms of tokens to their base forms

Full Access
Question # 6

The naive Bayer classifier is trained over 1600 movie reviews and then tested over 400 reviews.

Here is the resulting confusion matrix:

190 (TP) 10(FN)

80 (FP) 120(TN)

What are the precision, recall, and the F1-score values?

A.

Precision0.95; Recall: 0704; F1-score: 0.809

B.

Precision 0.613, Recall: 0.95, F1-score: 0.745

C.

Precision 0.704, Recall: 0.95; F1-score: 0.809

D.

Precision 0.95; Recall: 0.613; F1-score: 0.745

Full Access
Question # 7

What is a characteristic of spark?

A.

Unable to run map -> reduce execution plans

B.

Supports applications written in Python, Java, and Scala

C.

Less efficient processing small files than Hadoop MapReduce

D.

Supports workflows that can return to previous work steps

Full Access
Question # 8

You develop a Python script "logisticpy" to evaluate the logistic function denoted as f(y) for a given value y that includes the following Pig code:

Register 'logistic.py' using jython as udf;

z = FOREACH y GENERATE $0, udf.logistic ($0);

DUMP z;

What is the expected output when the Pig code is executed?

A.

0

B.

Jython is not a supported language

C.

Value of f(y) for ally

D.

Tuples (y, f(y))

Full Access
Question # 9

In a connected, undirected graph of 5 nodes with 10 edges, how many more edges need to be added to make the clustering coefficient of every node equal 1 ?

A.

0

B.

5

C.

10

D.

15

Full Access