Model 1234568 ciasco PDF

Preview

Summary

Write a simple OpenMP program for vector addition (sum). It is helpful to understand how
threads are created in OpenMP.
To examine the above scenario, we are going to take two one-dimensional arrays, each of size
of 5. We will then create 5 threads. Each thread will be responsible ...

Description

SCHOOL OF COMPUTER SCIENCE AND ENGINEERING FALL SEMESTER 2020-2021 Continuous Assessment Test 1 Programme Name & Branch: B.TECH & CSE Course Code & Name : Social Information and Networks Exam Duration: 45 minutes (Answer all the questions)

Mode of Exam: Online Slot: C2+TC2 Maximum Marks: 30

-------------------------------------------------------------------------------------------------------------------------------------Part A – Multiple Choice Questions (5*1=5)

1. Choose the eccentricity node b from the given graph. (CO1)

A. B. C. D.

1 2 0 3

Correct Answer: B 2. Find the diameter of the given graph. (CO1)

A. B. C. D.

1 2 0 3

Correct Answer: B 3. Determine the radius of the given graph. (CO1)

A. B. C. D.

1 2 3 0

Correct Answer: A 4. Find the no. of cycles from the given graph. (CO1)

A. B. C. D.

1 2 3 0

Correct Answer: B 5.

Determine the clustering coefficient for node 1 (CO2)

A. B. C. D.

0.167 0 1 0.122

Correct Answer: B

PART-B-Short answer 5*5=25 6. Consider the following graph. Identify the path, trail, walk, cycle for the graph provided. (CO1)

7. Consider graph shown in figure below. Calculate clustering coefficient for each node.

(CO2)

8. Consider the network below and calculate the betweenness centrality for node 5 and

node 1. (CO2)

9. Compute the Eigen Vector centrality measure for the nodes in the graph given below. (CO2)

10. Consider the graph; identify cliques, 2-clique, 2-club, and 2-plex. (CO2)...