Coaxial cables, Basic Computer Science

Coaxial Cables:

Another metallic transmission medium which offers a large bandwidth, is the coaxial cable. Such cables consist of an outer protective shell made of copper tube, less than one inch in diameter, which actually carries messages. There are two types of coaxial cables- the base band and the broad band. Base band cables use digital transmission and are suitable for fairly short distances. These have a data rate of about 50 Mb/s in half-duplex mode. Broad band coaxial cable on the other hand, is more familiar as CATV and is suitable for long distance (up to 15 KM) transmission. It can support data rates of over 100 Mb/s. Coaxial cables, with their better electrical properties, can transmit at much higher frequencies and support wider bandwidth than the twisted pairs. They are suitable, therefore, for high quality bulk transmission of data at high speeds as well as text, picture and voice. For example, one such cable can support the equivalent of up to 10800 telephone (voice) channels.  

Posted Date: 10/24/2012 5:14:05 AM | Location : United States







Related Discussions:- Coaxial cables, Assignment Help, Ask Question on Coaxial cables, Get Answer, Expert's Help, Coaxial cables Discussions

Write discussion on Coaxial cables
Your posts are moderated
Related Questions
Advantages:- • Sharing Treads permit the sharing of a lot resources that cannot be shared in process, for instance, sharing code section, data section, Operating System resource

Ask question describes deadlock avoidance#Minimum 100 words accepted#

ELEMENTS OF PROGRAMMING LANGUAGE:  Learning a programming language requires understanding of concepts such as representation of different types of data in the computer, the va


role of an system analyst as an innovator

Following are some causes why we use threads in designing operating systems. A process with several threads makes a great server for instance printer server. For the reason that t

Question 1 Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the eve

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no


I need someone to help me with my Unix/Linux homework.