Skip to main content

1. Bus Network Topology

In a bus topology all of the computers in a network are attached to a segment of cable that connects them in a sight line. Each connected computer or peripherals is called terminal or node.
Of the network is connected by a terminating resistor which prevents single interference.
          In a bus topologies the nodes are of passive participate i.e. listing on the line and waiting for message address to them. This type of network can transmit to any other node whenever it wants. Transmit is limited to one computer at a time thus at one time the computer is master and all others are waiting message to read. Terminator was used in end of cable.
a.      Advantages
i.                    It is simple reliable and easy to use.
ii.                  Single backbone cable is required to connects all nodes, thus is cheaper.
iii.                Other computers are can easily added and network can be extended.
iv.                 A repeated can also be used in extended cable.
v.                   Repeater allows the message to trend to a longer distance.
b.      Disadvantages
i.                    It is slower communication network because of heavy data jam.

ii.                  At a time any two nodes are connected others have to wait them.

Fig: Bus Topology

Comments

Popular posts from this blog

Passing arrays to functions in C programming

Like any other variables, we can also pass entire array to a function. An array name can be named as an argument for the prototype declaration and in function header. When we call the function no need to subscript or square brackets. When we pass array that pass as a call by reference because the array name is address for that array. /* Program to illustrate passing array to function */ #include<stdio.h> void display(int) ; /* function prototype */ main( ) { int num[5] = {100, 20, 40, 15, 33, i ; clrscr( ) ; printf (“\n The content of array is \n”) ; for (i=0; i<5; i++) display (num[i]) ; /*Pass array element fo fun */ getch{ } ; } void display(int n) { printf (“\t%d”, n ) ; } Output:     The content of array is 100      20       40       15 3 /* Program to read 10 numbers from keyboard to store these num into array and then c...

Object Oriented Programming

Object Oriented Programming Programming paradigm that represents the concept of "objects" that have data fields (attributes that describe the object) and associated procedures known as methods Programming methodology based on objects, instead of just functions and procedures Focuses on data rather than process As individual objects can be modified without affecting other aspects of the program, it is easier for programmers to structure and organize software programs Easier to update and change programs written in object-oriented languages Simula was the first object oriented programming language Eg: C++, Java, etc. Features of OOPS Objects Referred as instance of class Basic run-time entities in an object-oriented system a person, a place, a bank account, a table of data, etc can be an object They occupy space in memory that keeps its state  Each object contains data and code to manipulate the data  Classes Blue print or prototype  which ...

Recursive Function in C programming

             If a statement within the body of a function calls the same function, the function is called recursive function. Actually, recursion is a process by which a function calls itself repeatedly until some specified condition has been satisfied. This process is used for repetitive computations in which each action is stated in term of previous result. Many iterative or repetitive problems can be written in this form.                To solve a problem using recursive method, two conditions must be satisfied. They are: 1)       Problem could be written or defined in term of its previous result. 2)       Problem statement must include a stopping condition. /*   An example of recursive function to calculate factorial of a number.*/    #include<stdio.h>    #include<conio.h...