The Gateway to Computer Science Excellence

+3 votes

A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with $n$ nodes, the number of direct links as a function of $n$ can be expressed as

- $\frac{n(n+1)}{2}$
- $\frac{(n+1)}{2}$
- $\frac{n}{2}$
- $\frac{n(n-1)}{2}$

+3 votes

If there are $n$ nodes then

We can connect $node\ 1$ to $n-1$ nodes using $n-1$ direct links

We can connect $node\ 2$ to $n-1$ nodes using $n-2$ direct links ( not $n-1$ since we have already connected it with $node 1$)

We can connect $node\ 3$ to $n-1$ nodes using $n-3$ direct links ( not $n-1$ since we have already connected it with $node\ 1$ and $node\ 2$)

.....

We can connect $node\ n$ to $n-1$ nodes using $0$ direct links (since it is already connected to every other node)

So total number of links required = $(n-1)+(n-2)+(n-3)+....+1+0= \frac{n(n-1)}{2}$

$\therefore$ Option $4.$ is correct.

0 votes

**a direct link between all pairs of nodes **, it clearly indicates that whatever the topology looks like,

it always with a **Complete graph with 'n' nodes.**

**the number of direct links as a function of n ,** they simply ask the number of edges .

So, the number of edges in a complete graph with 'n' nodes = **(n*(n-1))/2.**

Hence , OPTION D.

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.3k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.5k
- Others 1.5k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,648 questions

56,422 answers

195,194 comments

99,828 users