Social Network Analysis
Save
Edit
Host a game
Live GameLive
Homework
Solo Practice
Practice
13 QuestionsShow answers
  • Question 1
    30 seconds
    Q. SNA can be described as
    answer choices
    study of human relationships by means of Graph theory.
    study of realtionships
    study of graph theory
    All
  • Question 2
    30 seconds
    Q.

    Data structure format in which graph can be represented

    answer choices

    Matrix

    Nodes

    Edges

    All

  • Question 3
    30 seconds
    Q. A ----- is a ---- without passing through the same link more than once.
    answer choices
    walk , path
    path , walk
    None
  • Question 4
    30 seconds
    Q. A path with the same start and end node
    answer choices
    walk
    travesing
    cycle
    None
  • Question 5
    30 seconds
    Q. What is a Graph Diameter?
    answer choices
    Is the largest number of vertices to be traversed in order to travel from one vertex to another
    Is a way to quantitatively analyze a graph
    Both
    None
  • Question 6
    30 seconds
    Q. The degree of a node describes---
    answer choices
    its level of connectedness in the network
    its in-degree
    its out-degree
    None
  • Question 7
    30 seconds
    Q. What is Geodesic distance?
    answer choices
    is the number of relation in the shortest walk from one actor to another
    is the number of position in the shortest walk from one actor to another
    Both
    None
  • Question 8
    30 seconds
    Q. The ratio of the number of realtions which are reciprocated over the total number of realtions in the network
    answer choices
    Clustering
    Transitivity
    Reciprocity
    All
  • Question 9
    30 seconds
    Q. Measures of Centrality
    answer choices
    Degree & Betweenness
    Closeness & Eigenvector
    Both
    None
  • Question 10
    30 seconds
    Q. In closeness centrality , a node is considered important if it is relatively ----- to all other nodes
    answer choices
    Far
    Close
    between
    None
  • Question 11
    30 seconds
    Q. Google PageRank is a variant of ----- centrality
    answer choices
    Betweenness
    Closeness
    Eigenvector
    All
  • Question 12
    30 seconds
    Q. A network is ------ connected if each pair of vertices is connected by a semipath.
    answer choices
    weakly
    strongly
    None
    Both
  • Question 13
    30 seconds
    Q. A ------ is a connection between two nodes.
    answer choices
    neighborhood
    edge
    degree
    None
Report Quiz
Join a game