Solve 16+ Network Models, Data Link Control, Error Detection and Multiple Access previous year questions for GATE CS with answers and detailed solutions. Free
Answer it here to see how it works. Nothing is recorded until you sign in.
Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.
Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.
Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.
We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.
Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.
Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.
Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.
No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.
Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.
Solve 16+ Network Models, Data Link Control, Error Detection and Multiple Access previous year questions for GATE CS with answers and detailed solutions. Free sample questions below.
This chapter builds the foundation for how data moves reliably across physical links. We move from abstract models to concrete protocols.
Data travels in layers. Each layer has its own addressing scheme.
| Feature | IP Address (Network Layer) | MAC Address (Link Layer) |
|---|---|---|
| Scope | End-to-End (Source to Destination) | Hop-to-Hop (Local Network Segment) |
| Nature | Logical, Software-configured | Physical, Hardware-burned (NIC) |
| Analogy | Home Address (City/Street) | Apartment Number / Name |
| Changeable? | Yes (when moving networks) | No (usually fixed) |
| Format | 32-bit (IPv4) or 128-bit (IPv6) | 48-bit (Hexadecimal) |
Consider the transmission of data bits over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be , which one of the following options shows the remainder bit pattern appended to the data bits before transmission?
Consider the implementation of sliding window protocol over a lossless link, with a window size of frames, where each frame is of size 1000 bits (including header). The bandwidth of the link is 100 kbps () and the one-way propagation delay is 100 milliseconds. Assume that processing times at the sender and receiver are zero and the transmission time of acknowledgements is also zero. Which one of the following options gives the minimum size of (in number of frames) required to achieve 100% link utilization?
Suppose a 5-bit message is transmitted from a source to a destination through a noisy channel. The probability that a bit of the message gets flipped during transmission is 0.01. Flipping of each bit is independent of one another. The probability that the message is delivered error-free to the destination is ______. (rounded off to three decimal places)
Consider an Ethernet segment with a transmission speed of bits/sec and a maximum segment length of 500 meters. If the speed of propagation of the signal in the medium is meters/sec, then the minimum frame size <i>(in bits)</i> required for collision detection is __________
Suppose two hosts are connected by a point-to-point link and they are configured to use Stop-and-Wait protocol for reliable data transfer. Identify in which one of the following scenarios, the utilization of the link is the lowest.