# BSD 2201  NETWORK SCIENCE THEORY. UNIVERSITY EXAMINATIONS: 2021/2022
EXAMINATIONS FOR THE DEGREE OF BACHELOR OF SCIENCE IN
SOFTWARE DEVELOPMENT
BSD 2201: NETWORK SCIENCE
FULL TIME/PART TIME
DATE: DECEMBER, 2021 TIME: 2 HOURS
INSTRUCTIONS: Answer QUESTION ONE AND ANY OTHER TWO questions.

QUESTION ONE [20 Marks]
a) Briefly describe the applications areas of network science (5 Marks)
b) Using an illustration, describe Breadth First Search(BFS) algorithm and its importance to
network science (5 Marks)
c) Describe any three characteristics of network science in the modern period ( 5 Marks)
d) Describe any three properties of a graph ( 5 Marks)
QUESTION TWO [15 Marks]
a). Given the ego network snapshot below, the highlighted cluster and the following
information, suggest three nodes (ego node does not count) that could potentially reach a
large audience broadcasting some kind of information concerning technology to most people
in this group.
Graph information:
• Most people in this group are Computer Science students and use this network to many
purposes that may or may not be related to technology.
• The size of each node is directly proportional to each nodes’ eigenvector centralities.
• The fact that two nodes are too close from each other in the representation has nothing to do
with the kind of interaction they have in the network.
i) What are the three nodes you selected to broadcast information? Why were they chosen?
[5 Marks]
iii) What kinds of assumptions do you have to make in order to balance the lack of helpful
information and how those assumptions can affect your strategy? [5 Marks]
QUESTION THREE
a) Consider the bipartite network below
I. Construct its adjacency matrix. (3 Marks)
II. Construct the adjacency matrix of its two projections, on the purple and on the
green nodes, respectively. (4 Marks)
III. Calculate the average degree of the purple nodes and the average degree of the
green nodes in the bipartite network. (4 Marks)
IV. Calculate the average degree in each of the two network projections.
( 4 Marks)
QUESTION FOUR
I. Differentiate between the following
a) Tree and a Forest in a graph (2 Marks)
b) Weakly connected and Strongly connected graph (2 Marks)
c) in-degree and out-degree directed graphs (2 Marks)
d) Directed and undirected graph (2 Marks)
e) incident and degree (2Marks)
II. Using an illustration, describe Depth First Search(BFS) algorithm (5 Marks)

(Visited 45 times, 1 visits today) 