Answer / roop&

Cyclic Redundancy Check and Data LINK Layer

Answer / chandru

A CRC(Cyclic Redundancy Check)is an error-detecting
code.Happens at Data link layer.

Answer / jitendera

Crc calculation method
______________*_____________________
This is the topic consern with BE btech studendt

let take a simple example.

Let's do a simple example, dividing a message 100110 by the
key 101.
100110 = x^5 + x^2 + x (why i have writen this.count from
left threr is 6 numrix value so it sholud start frrom x5
and last is x^0

simalry 101 is x2 + 1.(it is key value with degree 2 max
degree)

Since the degree of the key is 2, we start by appending two
zeros to our message.

10011000 / 101
101

111
101

100
101

100
101

01


We don't even bother calculating the quotient, all we need
is the remainder (the CRC), which is 01 in this case. The
original message with the CRC attached reads 10011001. You
can easily convince itself that it is divisible by the key,
101, with no remainder.

In practice we don't write the top bit of the key--it is
implicit. In this particular example, we would only store
bits 01 as our key.

Answer / ravi

hi jitendera
i am ravi here and i am an engineering student from delhi i
have lots of interest in computer network.i was in serch of
the crc calculation method.i went through tennon bom and
frozen but not able to get understand then i came to google
and on serching i found your reply on that site and now
after reading yours answer and i find no any difficulty to
understand it now i can solve more complex polynomilas
based upon yours consept.many many thanks to you.
if you donot mind may i post some basic coputer network
question of our sylebus in which i am facing difficulty?.

thanks aagin

Hi Gyes, here is new question. can you provide answer of following question Like linux, can we windows as router? If yes how can we able to do this,

2 Answers  

---

Station A is transmitting data to station B, and expects an acknowledgment after every 400 bytes. After transmitting data for a while, the two stations determine the line is reliable and change to expecting and acknowledgement every 600 bytes. This is an example of (pick the best answer only): A.) BECN B.) Sliding Windows C.) Poison Reverse D.) Countdown timers E.) Split Horizon F.) Count to infinity

1 Answers  

---

Which IP packet field will prevent endless loops? type-of-service identificationf lags time-to-live header checksum

1 Answers  

---

Which dynamic type draw back is, if single link down, it removes its routing table?

0 Answers  

---

A ISDN PRI circuit can be described as which of the following? A.) 24 B channels and 1-64Kbps D channel B.) 23 B channels and 1-64Kbps D channel C.) 2-D channels and 1-C channel D.) 2-64Kbps B channels and 1-16Kbps D channel

1 Answers  

---

What is the difference between unicast, multicast, broadcast, and anycast?

0 Answers  

---

Which statement is true regarding full duplex? A.) Allows for transmission and receiving of data simultaneously B.) Only works in a multipoint configuration C.) Does not affect the bandwidth D.) Allows for transmission and receiving of data but not a the same time

2 Answers  

---

Identify the type of routing protocol that exchanges entire routing tables at regular intervals? A.) Link state B.) Interior gateway protocols C.) Appletalk routing D.) Distance vector

1 Answers  

---

What is CSU/DSU & explain the function????

6 Answers   Cisco,

---

Which three protocols are correctly matched to their transport layer functions? (Choose three) A. route selection IP B. sliding window UDP C. well known pods IP D. route validation ICMP E. connection oriented TCP F. three-way handshake TCP G. no sequence and acknowledgement UDP

1 Answers  

---

Bridges work at what layer of the OSI model? A.) Data Link B.) Network C.) Physical D.) Application

12 Answers   KVS, PGT,

---

Explain why UDP is lease favored when compared to TCP?

0 Answers  

---