SNA_Quiz

To draw any graph we need at least a………..

• node

• edge

• node and edge

• none

I will compare the centrality measures of two graphs. Which measure do I need to make this comparison?

• a. Degree centrality

• b. Standardized measure of degree centrality

• c. Closeness centrality

• d. Betweeness score

Which of the following statements about undirected networks is true?

• a. It has incoming links

• b. It has outgoing links

• c. Twitter is a good example for these types of networks

• d. They are symmetrical

Which of the following statements about incidence matrix is true?

• a. Node names appear on both the vertical and horizontal axis

• b. It is composed of two columns. One shows the nodes while the corresponding column displays the neighbors

• c. On the horizontal axis, we see edges. On the vertical axis we have nodes

• d. For large graphs, it produces efficient results

The  road from one node to another is named as…………………

• a.       Path

• b. The shortest path

• c.  Diameter

• e. Connectivity

……………..connects two…… family. Fill in the blanks with an appropriate term.

• a. Hub/bridge

• b. Hub/node

• c. Bridge/hub

• d. Bridge/node

Which of the following statements about hub is wrong?

• a. It has the highest number of connections

• b. When it is excluded, there will be radical change in the graph structure

• c. Known as strategic edges

• d. Not every node can be a hub

How to calculate 1st degree ego centric network of the selected node?

• a. It includes the node itself

• b. It is calculated based on the neighbours of the selected node

• c. It is composed of the node and its neighbours

• d. It includes the node and neighbours connections

What will happen to the shape of the below network when we calculate the 2nd degree ego centric network of C?

 

• a.       No change

• b. D will be removed

• c. A will be removed

• d. C will be removed

Which of the following statements about efficiency is wrong?

• a. It is based on the shortest path

• b. The selected node is removed from the network to calculate efficiency

• c. 1st degree ego centric network of the selected node is used

• d. 1,5 degree ego centric network of the selected node is used