5

Draw the graph network for “Profile” with the following description:

Ram works for Intel company. Ram is friend of Laxman since 2018. Ram likes Graph
Analytics technology.

Which of the following cypher code is used to compute in-degree of all nodes in the graph?

(1 Point)

match (n: Node)<-[r]-() return n.Name as Node, count(r) as Indegree merge match (a:
Node)<-[r]-(root) where not((root)<--()) return root.Name as Node, 0 as Indegree

match (n: Node)<-[r]-() return n.Name as Node, count(r) as Indegree union match (a:
Node)<-[r]-(root) where not((root)<--()) return root.Name as Node, 0 as Indegree

match (n: Node)<-[r]-()return n.Name as Node, find(r) as Indegree union match (a:
Node)<-[r]-(root) where not((root)<--()) return root.Name as Node, 0 as Indegree

match (n: Node)<-[r]-() return n.Name as Node, find(r) as Indegree merge match (a:
Node)<-[r]-(root) where not((root)<--()) return root.Name as Node, 0 as Indegree
6

Compute the Betweenness Centrality for node 3 for the graph in figure 6

(1 Point)
9
8

6
7

Observe the graph network, given in the Figure 5 and identify the type of graph whose
nodes are more connected within the cluster than to nodes outside the cluster

(1 Point)

Cluster

Modular Graph-insem ka q
Hierarchical Graph

Highly connected graph

8

Posts, comments on post and response to comments are all represented as _________in
the Facebook graph network.

(1 Point)

Edges or Relationships

Edges or Objects

Nodes or Objects

Nodes or Relationships
9

Which of the following is a Cypher command used to combine two or more query results?

(1 Point)

union

combine

merge

return
10

Draw the graph network for “Profile” with the following description:

Ram works for Intel company. Ram is friend of Laxman since 2018. Ram likes Graph
Analytics technology.
Which of the following cypher code is used to view the graph?

(1 Point)

match (n: Node)-[r]->(m) return n, r, m

list(n: Node)-[r]->(m) return n, r, m

view (n: Node)-[r]->(m) return n, r, m

None of the Specified

11

What kind of centrality identifies "hubness"?

(1 Point)

Between-ness

Degree

Group

Closeness
12

Most ideal community in the network is the subgraph where every node connected to every
other node in the structure. Such a structure is called

(1 Point)

Thinly Connected Cluster

Clique

Core

Dense Cluster
13
Draw the graph network for “Profile” with the following description:

Ram works for Intel company. Ram is friend of Laxman since 2018. Ram likes Graph
Analytics technology.

Which of the following cypher code is used to compute degree of all nodes in the graph?

(1 Point)

match (n: Node)-[r]-() with n, count(r) as degree set n.deg = degree return n.Name, n.deg

match (n: Node)-[r]-() with n, count(distinct r) as degree set n.deg = degree return n.Name,
n.deg

match (n: Node)-[r]-() with n, count(distinct r) as degree set n.deg = =degree return n.Name,
n.deg

match (n: Node)-[r]-() with n, count( r) as degree set n.deg == degree return n.Name, n.deg
14

fThe network where we find a small subset of people whose removal maximally
disrupt the whole network. This concept is related to ________________of the graph

(1 Point)

Community

Similarity

Connectivity

Centrality
15

Cypher includes a____________ command to find the longest path in a graph network.

(1 Point)
DIAMETER

None of the specified

PATH

MAXPATH
16

__________________ is represented by count of the number of edges incident upon a

given node normalized by the possible number of edge

(1 Point)

Between-ness Centrality

Group Degree Centrality

Closeness Centrality

Degree Centrality
17

Which Cypher pattern is used to represent a node?

(1 Point)

()

<>

{}

[]
18

________________are created in the graph, when a specific user creates specific tweets.

(1 Point)
Nodes

Edges

Users

Comments
19

_________________is the ratio of the number of internal edges in cluster C to the number
of possible connections inside the graph

(1 Point)

Cluster Density

Community Cluster Density

Intra Cluster Density

Inter Cluster Density

20

Identify the form of connectivity from the given graph (Figure 2)

(1 Point)
Directly Connected Graph

Strongly Connected Graph

Disconnected Graph

Weakly Connected Graph

21

_____________implies that the data elements in the graph are more strongly related.

(1 Point)

Interdependency
Higher Valence

Connectedness

Homogeneity
22

What is the in-degree of node 3 in the graph given in Figure 3?

(1 Point)

1
3
23

Identify the greatest listener from the given graph (Figure 4)

(1 Point)

Node 2

Node 1

Node 3

Node 4
24

Compute the Betweenness Centrality for node 5 for the graph in Figure 6

(1 Point)
6
0

8
25

Which type of community analytics question is the following: How tightly knit was the 2014
World Cup twitter community on July 13, 2014?

(1 Point)

Static

Prediction

Evolution

Connection Volatility
26

The network where we find a small subset of people whose removal maximally disrupt the
whole network. This concept is related to

(1 Point)

Community

Connectivity

Modularity

Centrality
27

Draw the graph network for “Profile” with the following description:
Ram works for Intel company. Ram is friend of Laxman since 2018. Ram likes Graph
Analytics technology.

Which of the following cypher code is used to construct adjacency matrix of the graph?

(1 Point)

match (n: Node), (m: Node) return n.Name, m.Name, case when (n)-->(m) then 0 else 1 end as
value

match (n: Node), (m: Node) return n.Name, m.Name, case when (n)-->(m) then 1 else 0 end as
value

match (n: Node), (m: Node) return n.Name, m.Name, if when (n)-->(m) then 0 else 1 end as
value

match (n: Node), (m: Node) return n.Name, m.Name, if when (n)-->(m) then 1 else 0 end as
value
28

An influencer in a network is defined as:

(1 Point)

a node which has heavy weight edges to at least 1/2 of the nodes in the network

All of the specified

a node which can reach all other nodes quickly

the biggest gossip in the network

29

How is GraphX different when compared to Giraph?

(1 Point)

GraphX employs the mathematics of graphs and utilizes its huge potential for fast information
extraction speeds to store information in the form of nodes and inter-node relationships.
GraphX is also faster since its underlying engine is a dataflow engine not dedicatedly designed
for vertex-centric graph processing.

GraphX consumes more memory which translates into requiring more machines.

All of the specified(not sure)

30

Compute the Betweenness Centrality for node 2 for the graph in Figure 6

(1 Point)
6
8

3
31

What kind of centrality would you want to analyze in a graph if you wanted maximize
commodity flow in a network?

(1 Point)

Closeness

Betweenness

Group

Degree
32

In Facebook network , updates such as, write a post, like somebody else post or make a
comment, describes, the result in constant increasing in the number of edges in a graph.
This scenario is an example of which of the V's

(1 Point)

Valence

Velocity

Volume

Variety
33

What do you infer from the row and column of V3 in the adjacency matrix given in the
Figure1?
(1 Point)

No outgoing edges

1 outgoing edge and 2 incoming edges

No incoming edges

2 outgoing edges and 1 incoming edge

34
When trying to represent a relationship between Jim and Jerry who have more than one
relationship to each other. Which of the following would be needed in a graph representing
those relationships?

(1 Point)

Multiple edges between Jim and Jerry

Can have multiple nodes

Can combine separate graphs into a single graph

Can have separate graphs

Submit
This content is created by the owner of the form. The data you submit will be sent to the form owner. Microsoft is not
responsible for the privacy or security practices of its customers, including those of this form owner. Never give out
your password.

Powered by Microsoft Forms | Privacy and cookies | Terms of use

Doubts likho
8, 15- apna sahi hi h, 18, 29 confirm bas i g all 4 are fine…graphx ka memory wala kardo bas
SUBMIT THEN? - yes, -shameek

Abhi submit karke kya karega 45 tak toh baithna hai - what if disconnect in btwn
Aur bhailog
Kya chal raha hai
Btech khatam
Last cs exam of my life hopefully ++, do saal ka hona chaiye btech

Sirf yehi doubt h na? Rest is fine ig…OK

29 ka kya hai fir? GraphX consumes more memory which translates into requiring more machines.
This only? Ya

Iska edge bhi to hoga? – edge sirf action hota hai na obv node create hoga toh
edge bhi ayega but mainly tweet toh node hua thanks