Pular para o conteúdo principal

Communities

Analyse the graph below and evaluate the following statements: I - The modularity value for this graph is approximately 0.48. II - Removing nodes 15, 6, and 8 is not expected to significantly impact the modularity: it will increase by only about a hundredth compared to the modularity of the original network. III - Introducing a new green node that connects to nodes 3, 5, and 6 increases the modularity to approximately 0.61. IV - Increasing the modularity might cause the green nodes to transition into lilac or orange. Choose an option with only correct statements: a) I, II and III b) II, III and IV c) II and IV d) I, II and IV e) None of above Original idea by: João Marcos

Calculus

What is the volume generated by rotating the region bounded by the curves y=x^2 and y=4 around the x-axis?


a)2π

b) 4π

c) 8π

d) 16π

e) None of above


Original idea by: João Marcos

Comentários

Postar um comentário

Postagens mais visitadas deste blog

Communities

Analyse the graph below and evaluate the following statements: I - The modularity value for this graph is approximately 0.48. II - Removing nodes 15, 6, and 8 is not expected to significantly impact the modularity: it will increase by only about a hundredth compared to the modularity of the original network. III - Introducing a new green node that connects to nodes 3, 5, and 6 increases the modularity to approximately 0.61. IV - Increasing the modularity might cause the green nodes to transition into lilac or orange. Choose an option with only correct statements: a) I, II and III b) II, III and IV c) II and IV d) I, II and IV e) None of above Original idea by: João Marcos

Graph Theory II

Analyse the following graph: Choose the truth statement: A) Both node D and node E have the same clustering coefficient. B) Node F currently has a clustering coefficient of zero, however if we establish a connection between node F and node A, it could potentially become the node with the highest clustering coefficient. C) This graph can be classified as a disconnected graph since not all nodes connect with each other. D) The node C has the highest clustering coefficient. E) None of above Original idea by: João Marcos