# Social Networks | Week 6

**Course Name: Social Networks**

**Course Link: Click Here**

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

**Q1. Which of the following is valid about characteristics of a web graph?**

a. Directed and cyclic

b. Directed and acyclic

c. Directed and cyclic/acyclic

d. Undirected and cyclic

e. Undirected and acyclic

f. Undirected and cyclic/acyclic

**Answer: c. Directed and cyclic/acyclic**

**Q2. Pick out the most efficient technique to obtain the web graph containing a huge number of nodes.**

a. Breadth first search

b. Depth first search

c. Random walk

d. Both A and B

**Answer: c. Random walk**

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

**Q3. Consider the graph shown in the following Figure. The number written in each circle represents the number of gold coins possessed by the corresponding node(20, 30, 20, 30). Choose the number of gold coins every node has in the next iteration, according to the equal sharing gold ‘coins’ game.**

a. 20, 30, 20, 60

b. 30, 40, 30, 30

c. 20, 30, 20, 30

d. 20, 20, 20, 20

**Answer: d. 20, 20, 20, 20**

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

**Q4. Identify the type of nodes that can cause a challenge in the Random walk coin distribution technique.**

a. indegree > outdegree

b. outdegree > indegree

c. zero outdegree

d. high outdegree

**Answer: c. zero outdegree**

**Q5. Consider algorithm 1 to be equal sharing coin distribution game and algorithm 2 to be random dropping coin distribution game. Which of the following is true?**

a. Algorithm 1 converges but Algorithm 2 does not

b. Algorithm 2 converges but Algorithm 1 does not

c. Both algorithms converge

d. None of them converges

**Answer: c. Both algorithms converge**

**Q6. In the graph shown in the following figure, assume that the current pagerank values of A, B and C are 0.4, 0.2 and 0.4 respectively. What will be their pagerank values after one iteration?**

a. A : 0.4,B : 0.4,C : 0.4

b. A : 0.2,B : 0.4,C : 0.4

c. A : 0.4,B : 0.2,C : 0.4

d. A : 0.4,B : 0.4,C : 0.2

**Answer: d. A : 0.4,B : 0.4,C : 0.2**

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

**Q7. In a random graph with n nodes, the number of nodes to be traversed in order to to visit all nodes in a random walk as observed in the experiment is approximately**

a. log n

b. n log n

c. n2

d. 2n

**Answer: c. n2**

**Q8. Which of the following is true for Teleportation?Statement I – Choosing a node uniformly at random in a graph Statement II – Choosing the highest degree node in the graph**

a. I only

b. II only

c. Both

d. None

**Answer: d. None**

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

**Q9. A web graph is a/an**

a. Directed graph

b. Undirected graph

c. Complete graph

d. Bipartite graph

**Answer: a. Directed graph**

**Q10. If nx represents networkx library then, for a graph G, what does nx.pagerank(G) returns?**

a. List of web pages that are top 10 priority

b. List of page rank values

c. Dictionary where keys are nodes and values are Page ranks

d. Dictionary where keys are Page ranks and values are nodes

**Answer: c. Dictionary where keys are nodes and values are Page ranks**

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

* The material and content uploaded on this website are for general information and reference purposes only. Please do it by your own first. COPYING MATERIALS IS STRICTLY PROHIBITED.

**These are Nptel Social Networks Week 6 Assignment 6 Answers**

More Solutions of Social Networks: Click Here

More NPTEL Solutions: https://progiez.com/nptel/