Scribd
Upload
94 views2 pages

CN Assignment Questions

The document outlines an assignment on computer networks topics including media access methods, routing algorithms, and network layer services. It provides 15 questions to explain concepts and 10 problems to solve. Specific topics covered include CSMA, CSMA/CD, persistence, ALOHA, Ethernet, wireless LANs, routing, IP, and shortest path algorithms.

Uploaded by

1js20ec036ksspoorthi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
94 views2 pages

CN Assignment Questions

The document outlines an assignment on computer networks topics including media access methods, routing algorithms, and network layer services. It provides 15 questions to explain concepts and 10 problems to solve. Specific topics covered include CSMA, CSMA/CD, persistence, ALOHA, Ethernet, wireless LANs, routing, IP, and shortest path algorithms.

Uploaded by

1js20ec036ksspoorthi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment

Subject: Computer Networks


Date of announcement: 24/11/2022
Date of Submission: 8/12/2022

Questions:
1. Explain the following media accesses methods with neat diagram and flow chart:
 CSMA
 CSMA/CD
 CSMA/CA
2. Explain persistence method with neat diagram.
3. Explain pure ALOHA, slotted ALOHA with neat diagram.
4. Explain standard ethernet implementation with neat diagram.
5. Explain standard ethernet frame format with neat diagram.
6. Explain the architectural comparison of wired and wireless LAN.
7. Explain the characteristics of wireless LAN.
8. Explain the hidden station problem in wireless LAN and explain the method to
overcome the above problem.
9. Explain virtual circuit packet switched network with a neat diagram.
10. Briefly explain the network layer services.
11. What is distance vector routing, explain the various drawbacks of distance vector
routing and flow solution to overcome this?
12. Explain IP datagram format with a neat diagram.
13. Differentiate between datagram network and virtual circuit network.
14. Give a brief overview of IPV4 datagram.
15. Explain distance vector routing using bellman ford algorithm providing a suitable
illustration.
16. Illustrate the following algorithms with an example
 Link state routing
 Least cost routing
 Path vector routing
Problems:
1. What is the hexadecimal equation of the following ethernet address?
01011010 10000001 01010101 00010001 10101010 00011111
After finding hexadecimal equivalent define the type of destination address.

2. A network using CSMA/CD has a bandwidth of 10Mbps. If the maximum


propagation time (including the delays in the devices and ignoring the time needed to
send a jamming signal, as we see later) is 25.6µs, what is the minimum size of the
frame?
3. Assume the shortest distance between nodes a, b, c & d to node y and the costs from
node x to nodes a, b, c & d are given below:
Day = 5 Dby= 6 Dcy= 4 Ddy= 3
Cxa = 2 Cxb= 1 Cxc= 3 Cxd= 1
What is the shortest distance between node x and node y, Dxy according to the bellman
ford equation?
4. A pure ALOHA network transmits 200-bit frame on a shared channel of 200 kbps.
What is the throughput if the system produces?
 1000 frames per second
 500 frames per second
 250 frames per second
5. Use Dijkstra’s algorithm to find the shortest path tree and the following table for node
A in the figure

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy