Scribd
Upload
4 views2 pages

CN QB

Uploaded by

Charulatha Reddy
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
4 views2 pages

CN QB

Uploaded by

Charulatha Reddy
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

Dept.

of CSE

CN Question Bank - 2024

Module 2:

1. What is framing, Explain the concept of byte stuffing & unstuffing and bit stuffing &
unstuffing in framing with examples.
2. Define flow control and error control in the data link layer. How do these mechanisms help in
reliable data transfer?
3. Explain the simplest protocol for data transmission in channels with FSM.
4. Describe the Stop-and-Wait protocol with the help of sequence diagram and FSM.
5. Define HDLC and explain the three types of frames used in this protocol: I-frames, S-frames,
and U-frames.
6. Explain how connection establishment and release occur in HDLC using U-frames.
7. Explain the concept of piggybacking in HDLC and provide an example of its use.
8. Describe the Point-to-Point Protocol (PPP) and its frame format.
9. Explain the different phases in the PPP link establishment and data transfer.
10. Discuss the purpose of authentication in PPP and compare the PAP and CHAP authentication
methods.
11. Differentiate PPP and HDLC protocol.
12. Define random access in the context of multiple-access protocols. Name the protocols that fall
under this category.
13. Compare Pure ALOHA and Slotted ALOHA in terms of collision management and throughput.
14. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is
the throughput if the system (all stations together) produces.
15. a. 1000 frames per second b. 500 frames per second
16. c. 250 frames per second.
17. A slotted ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is
the throughput if the system (all stations together) produces.
18. a. 1000 frames per second b. 500 frames per second
19. c. 250 frames per second.
20. Explain with flowchart Carrier Sense Multiple Access (CSMA) and how it reduces collisions
in a network.
21. Describe the 1-persistent, non-persistent, and p-persistent methods used in CSMA.
22. Explain how CSMA/CD works and the importance of collision detection in Ethernet networks
23. Describe the backoff algorithm used in CSMA/CD after a collision.
24. Explain how CSMA/CA works and the purpose of Interframe Space (IFS) and Contention
Window and Acknowledgments in reducing collisions.
25. What is the reservation method of controlled access? Describe how it ensures orderly data
transmission.
26. Describe token passing and its application in a network. How do logical and physical rings
differ in this context?
Module 3:

1. Explain the process of packet forwarding in a router for both datagram and virtual-circuit
approaches.
2. Discuss the advantages of using a datagram approach in large-scale networks like the Internet.
3. Draw neatly IPv4 datagram header. List and describe each field and its purpose in packet
delivery.
4. Explain the concept of fragmentation in IPv4 and discuss how the offset field is used in this
process.
5. Define an IPv4 address and explain the purpose of hierarchical addressing.
6. Describe the process and benefits of subnetting and supernetting in IPv4.
7. Given an IPv4 address with CIDR notation, explain how to determine its prefix, suffix, and
address range.
8. What is classful addressing in IPv4, and why is it considered obsolete? Describe the
limitations that led to the adoption of classless addressing.
9. A classless address is given as 167.199.170.82/27. Find the total number of addresses in the
given block. Also give the first and last IP address of the block.
10. Develop a program for error detecting code using CRC-CCITT (16- bits).
11. Develop a program to implement a sliding window protocol in the data link layer.
12. Implement three nodes point – to – point network with duplex links between them. Set the
queue size, vary the bandwidth, and find the number of packets dropped

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