wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

SNA Module 2

Total questions: 15

Worksheet time: 8mins

Name
Class
Date
1.

_______ is a relationship between two entities

a)

Mining

b)

Graph

c)

Network

d)

Link

2.

Assign class labels to entities based on their link characteristics is comes under _____

a)

Link-based Object Ranking (LOR)

b)

Link-based Object Classification (LOC)

c)

Link prediction

d)

Link Mining

3.

The_____ of a node is the number of edges incident on it

a)

degree

b)

value

c)

weight

d)

centrality

4.

The ____ of a graph is the number of existing edges divided by

the number of possible ones (assuming no duplicates or loops)

a)

ego alters

b)

degree

c)

density

d)

connectedness

5.

The _____ of vertex v in graph G is

defined as the subgraph of G induced by v and its neighbors

a)

whole network

b)

egocentric network

c)

complete network

d)

social network

6.

_______ Centrality is a category of measures that rate

the centrality of a node by its closeness (distance) to other nodes

a)

Betweeness

b)

Information

c)

Degree

d)

Closeness

7.

How does Google® rank web pages in order to

provide meaningful search results?

a)

Page Rank

b)

Link Analysis

c)

Link Prediction

d)

Web Graph

8.

PageRank is an algorithm that addresses the

____ problem (Link-Based Object Ranking).

a)

LDR

b)

LBR

c)

LAR

d)

LCR

9.

The ______ package contains the function ‘page.rank’ that is

capable of taking a graph object as an input and computing the

PageRank of the vertices in the graph object.

a)

‘igraph’

b)

‘graph’

c)

‘agraph’

d)

‘bgraph’

10.

Expansion for HITS ____

a)

Hyper Interactive Tree Search

b)

Hyper Interactive

Topic Search

c)

Hyper-Induced

Topic Search

d)

Hyperlink-Induced

Topic Search

11.

A vertex

has

many pages linking

to it (High Indegree)

a)

Authority

b)

Hub

c)

Updated Authority

d)

Updated Hub

12.

A vertex

points to many other

vertices (High Outdegree)

a)

Outdegree

b)

Authority

c)

Hub

d)

Indegree

13.

In HITS preprocessor ____ Set is a Set of pages most relevant to user’s

query

a)

Grown

b)

Base

c)

Root

d)

Node

14.

In HITs algorithm, generally the upper

bound for k is ____

a)

10

b)

6

c)

3

d)

20

15.

The _____ method is a

simple measure that takes into account

the intersection set of the neighbors of

the vertices u and v.

a)

Adamic-Adar

b)

Jaccard’s coefficient

c)

common neighbors

d)

Unseen bigrams