MIS 301 Exam 3 Questions and Verified Answers
network Correct Answer: collections of points joined by lines
"network" = "graph"
edges:
directed v. undirected Correct Answer: directed = A => B
undirected = A <=> B or A - B
network metrics: geodesic path Correct Answer: a shortest path
the shortest sequence of links containing two nodes
network metrics: eccentricity Correct Answer: a node's largest geodesic distance
a measre of how far a node is from the furthest other
network metrics: diameteter Correct Answer: the largest geodesic distance in the network
gives the number of steps that are sufficient to go from any node to another
* indegree Correct Answer: how many directed edges (arcs) are incident on a node
* outdegree Correct Answer: how many directed edges (arcs) originate at a node
* degree (in or out) Correct Answer: # of edges incident on a node (# of connections a node has)
* centrality Correct Answer: degree
betweenness
closeness
degree centrality Correct Answer: the # of direct connections a node has
network Correct Answer: collections of points joined by lines
"network" = "graph"
edges:
directed v. undirected Correct Answer: directed = A => B
undirected = A <=> B or A - B
network metrics: geodesic path Correct Answer: a shortest path
the shortest sequence of links containing two nodes
network metrics: eccentricity Correct Answer: a node's largest geodesic distance
a measre of how far a node is from the furthest other
network metrics: diameteter Correct Answer: the largest geodesic distance in the network
gives the number of steps that are sufficient to go from any node to another
* indegree Correct Answer: how many directed edges (arcs) are incident on a node
* outdegree Correct Answer: how many directed edges (arcs) originate at a node
* degree (in or out) Correct Answer: # of edges incident on a node (# of connections a node has)
* centrality Correct Answer: degree
betweenness
closeness
degree centrality Correct Answer: the # of direct connections a node has
