MCA 103 Computer Networks Notes for GGSIPU MCA Semester 1 run to 82 pages across 4 units, with 26 solved examples, 30 practice numericals with answers, 45 figures and 107 exam-style questions. They follow the MCA syllabus in force from Academic Year 2025-26 and are sold as a printed book, not as a PDF.
Written by Prateek Talwar, Founder, Unnati Educations · Reviewed by Ritik Rawat, B.Tech, Senior Full Stack Developer · Checked against the official MCA Scheme of Examination and Detailed Syllabus (BoS approval 28/07/2025) · Updated 14 October 2026 · Editorial policy
Scheme: MCA (2 years), affiliated institutes | Applies to: Academic Year 2025-26 onwards | Verified against: syllmcaaff050825900p.pdf, ipu.ac.in, 2025
MCA 103 Computer Networks at a glance: GGSIPU MCA Sem 1 credits, units and exam pattern
The official PDF prints the code as MCA-103, a 44-hour theory paper. It sits with the other GGSIPU MCA Semester 1 papers.
| Course and semester | MCA (2 years), Semester 1 |
|---|---|
| Type and credits | Theory · L 3, T/P 0 · 3 credits |
| Marks | End-term paper 60 marks; passing marks 40 out of 100 for every paper (scheme note 9); internal split not printed. Rules: Ordinance 11 |
| Applies to | Academic Year 2025-26 onwards, affiliated institutes |
| End-term pattern | Q1 compulsory, short answers on the whole syllabus, 12 marks · two questions per unit, attempt one, 12 marks each (12 + 48 = 60 marks) |
| Units and hours | 4 units: 11, 11, 12 and 10 hours |
| Paired lab | MCA 161 Computer Networks Lab. · L 0, P 2 · 1 credit |
MCA 103 Computer Networks Notes unit-wise: 26 solved examples and 30 practice numericals across 4 units
Unit titles below are the notes' own, as the official PDF only numbers units. Formula sheets and question banks close every unit, making these GGSIPU MCA Sem 1 Computer Networks notes handy for last-week revision. Other papers of the course are listed under GGSIPU MCA notes.
MCA 103 Unit 1: Introductory Concepts and the Physical Layer
Pages 4 to 26, 15 sections. OSI and TCP/IP, topologies, devices, cables and wireless media, GEO, MEO and LEO satellites, line coding, ASK to QAM, PCM and delta modulation, 1G to 5G cellular, and FDM, WDM and TDM. It has 5 solved examples and 14 figures.
| Quantity | Working | Result |
|---|---|---|
| Sampling rate | 2 × 4000 Hz | 8000 samples/s |
| Bit rate | 8000 × 8 | 64 kbps (DS0 channel) |
| Levels, SNR | 28; 6.02 × 8 + 1.76 | 256 levels, about 49.92 dB |
Quick look: PCM for a 4 kHz voice signal, 8 bits per sample (from page 19)
- Quantity
- Sampling rate
- Working
- 2 × 4000 Hz
- Result
- 8000 samples/s
- Quantity
- Bit rate
- Working
- 8000 × 8
- Result
- 64 kbps (DS0 channel)
- Quantity
- Levels, SNR
- Working
- 28; 6.02 × 8 + 1.76
- Result
- 256 levels, about 49.92 dB
MCA 103 Unit 2: The Data Link Layer and Medium Access Sub-layer
Pages 27 to 46, 14 sections. Framing and stuffing, parity, CRC, checksum and Hamming (7, 4), the three ARQ protocols, ALOHA, CSMA and CSMA/CD, collision-free protocols, the 802.3 frame, 802.11 with CSMA/CA, Bluetooth and Wi-Fi 4 to 7. It is the most numerical unit: 8 solved examples, 10 practice numericals and 13 figures.
Quick look: CRC for dataword 1001, generator 1011 (from page 31)
- r = 3, so append three 0s:
1001000. - Divide by
1011using XOR; remainder110. - Codeword =
1001110. - Receiver divides again, gets
000and accepts.
MCA 103 Unit 3: The Network Layer
Pages 47 to 64, 10 sections. IPv4 classes, subnetting, CIDR and NAT; Dijkstra, flooding, distance vector, link state and hierarchical routing; the IPv4 header and fragmentation; IPv6 header, neighbor discovery and SLAAC; Mobile IP and multicast trees. It has 8 solved examples, 10 practice numericals and 8 figures.
| Subnet | Range | Usable hosts |
|---|---|---|
| 1 | .0 to .63 | .1 to .62 |
| 2 | .64 to .127 | .65 to .126 |
| 3 | .128 to .191 | .129 to .190 |
| 4 | .192 to .255 | .193 to .254 |
Quick look: 192.168.1.0/24 split into four /26 subnets, 62 hosts each (from page 50)
- Subnet
- 1
- Range
- .0 to .63
- Usable hosts
- .1 to .62
- Subnet
- 2
- Range
- .64 to .127
- Usable hosts
- .65 to .126
- Subnet
- 3
- Range
- .128 to .191
- Usable hosts
- .129 to .190
- Subnet
- 4
- Range
- .192 to .255
- Usable hosts
- .193 to .254
MCA 103 Unit 4: The Transport Layer and the Application Layer
Pages 65 to 82, 13 sections. Ports, UDP and TCP headers, handshake, flow control, RTO, Tahoe and Reno, leaky and token bucket; then DNS, SMTP, POP3, IMAP, MIME, HTTP, firewalls and RSA. It has 5 solved examples, 10 practice numericals and 10 figures.
Quick look: TCP congestion window, ssthresh 16 (from page 73)
- Slow start: 1, 2, 4, 8, 16.
- Congestion avoidance: 17, 18 ... 24.
- Time-out at 24 (Tahoe): ssthresh 12, cwnd back to 1.
- Three duplicate ACKs at 24 (Reno): cwnd = 12, then 13, 14.
Pure and slotted ALOHA in random access: excerpt from page 36 of the MCA 103 notes
Excerpt from page 36
Multiple-access protocols fall into three groups. Random-access or contention protocols are ALOHA, CSMA, CSMA/CD and CSMA/CA. Controlled-access or collision-free protocols are bit-map reservation, polling, token passing and binary countdown. The third group, channelisation (FDMA, TDMA, CDMA), is the static approach used in cellular networks.
Where ALOHA came from
ALOHA was built by Norman Abramson at the University of Hawaii in 1970 for a radio network linking the islands. It was the earliest random-access method. No station controls another; each one decides for itself when to send.
Pure ALOHA
A station sends a frame whenever it has one. With only one shared channel, frames from different stations can collide. Pure ALOHA depends on acknowledgements: if no ACK comes back within a time-out (usually twice the maximum propagation time), the station assumes a collision, waits a random back-off time and sends again. After a maximum number of attempts, typically 15, it gives up.
- The vulnerable time, during which a collision can happen, is 2 × Tfr, where Tfr is the frame transmission time. A frame clashes with any frame started up to one frame time before or after it.
- If G is the average number of frames the whole system produces in one frame time, throughput S = G × e−2G.
- Maximum throughput is 1/(2e), about 0.184 or 18.4%, reached when G = 1/2.
Slotted ALOHA
Slotted ALOHA, proposed by Roberts in 1972, divides time into slots of length Tfr and lets a station send only at the start of a slot. A station that misses the start waits for the next one. A collision now happens only when two stations choose the same slot, so the vulnerable time falls to Tfr, half that of pure ALOHA.
- Throughput S = G × e−G.
- Maximum throughput is 1/e, about 0.368 or 36.8%, when G = 1, which is double the pure ALOHA figure.
- All stations need a shared clock, so one station broadcasts a short pulse at the start of every slot.
MCA 103 exam corner: 59 short-answer and 48 long-answer questions by unit
These are practice questions; answers come from each unit's sections and solved examples, not separate model answers.
| Unit | Short | Long | Solved examples + numericals |
|---|---|---|---|
| I | 17 | 13 | 5 + 0 |
| II | 14 | 12 | 8 + 10 |
| III | 14 | 11 | 8 + 10 |
| IV | 14 | 12 | 5 + 10 |
MCA 103 exam questions and worked numericals per unit
- Unit
- I
- Short
- 17
- Long
- 13
- Solved examples + numericals
- 5 + 0
- Unit
- II
- Short
- 14
- Long
- 12
- Solved examples + numericals
- 8 + 10
- Unit
- III
- Short
- 14
- Long
- 11
- Solved examples + numericals
- 8 + 10
- Unit
- IV
- Short
- 14
- Long
- 12
- Solved examples + numericals
- 5 + 10
The MCA 103 notes list 59 short-answer and 48 long-answer exam-style questions across 4 units, plus 26 solved examples and 30 practice numericals with answers.
- Unit I: Links and ports for a full mesh of 10 devices? Pointer: n(n − 1)/2 = 45 links; n − 1 = 9 ports each.
- Unit II: Why is the Ethernet minimum frame 64 bytes? Pointer: Tfr ≥ 2Tp so the sender still hears the collision; at 10 Mbps that is 512 bits.
- Unit III: Network address of 200.45.34.56/20? Pointer: keep the top 4 bits of 34 (0010 0010 to 0010 0000), giving 200.45.32.0/20.
- Unit IV: Why a three-way handshake, and what is SYN flooding? Pointer: SYN, SYN + ACK, ACK fix both starting sequence numbers; fake SYNs fill the half-open table, and SYN cookies defend.
More practice sits in the MCA 103 important questions.
Who writes and checks the MCA 103 networking notes?
- Prateek Talwar, author. Founder, Unnati Educations; Associate Company Secretary (ACS), ICSI, membership no. 58704, since 15 May 2019; B.Com, University of Delhi (School of Open Learning), 2012. Profile
- Ritik Rawat, subject reviewer. Senior Full Stack Developer, Unnati Educations; B.Tech.
The 2026-27 edition maps to the MCA scheme approved on 28 July 2025 and includes Wi-Fi 7, 5G and QUIC. These MCA 103 Computer Networks IPU notes were last checked on 13 October 2026 under our editorial policy.
The same team prepares GGSIPU important questions for each course it covers.
Do the MCA 103 notes cover the full GGSIPU syllabus?
Yes. Every topic under the four official units of MCA 103 has its own section in the notes, from the OSI model to public and private keys.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| I | Goals and applications, OSI, TCP/IP, topology and design, networking devices; physical layer, guided and wireless media, satellites, signal encoding, digital to analog modulation, sampling, PCM, DM, analog modulation, mobile telephone system, multiplexing | Sections 1 to 15, pp. 5 to 24 | Covered |
| II | Data link layer, error detection and correction, flow and error control; channel allocation, ALOHA, CSMA, CSMA/CD, collision-free protocols, Ethernet, wireless LANs, Bluetooth, Wi-Fi | Sections 1 to 14, pp. 28 to 43 | Covered |
| III | Network layer functions, classful and classless IPv4, routing algorithms, IP packet format, IPv6 addressing, neighbor discovery, auto configuration, Mobile IP, multicasting (source based and group shared tree) | Sections 1 to 10, pp. 48 to 61 | Covered |
| IV | Transport functions and protocols, UDP, TCP, connection management, flow, error and congestion control; DNS, e-mail, WWW, firewalls, public and private keys | Sections 1 to 13, pp. 66 to 80 | Covered |
Official MCA 103 units mapped to the notes
- Official unit
- I
- Official topics
- Goals and applications, OSI, TCP/IP, topology and design, networking devices; physical layer, guided and wireless media, satellites, signal encoding, digital to analog modulation, sampling, PCM, DM, analog modulation, mobile telephone system, multiplexing
- Where in the notes
- Sections 1 to 15, pp. 5 to 24
- Status
- Covered
- Official unit
- II
- Official topics
- Data link layer, error detection and correction, flow and error control; channel allocation, ALOHA, CSMA, CSMA/CD, collision-free protocols, Ethernet, wireless LANs, Bluetooth, Wi-Fi
- Where in the notes
- Sections 1 to 14, pp. 28 to 43
- Status
- Covered
- Official unit
- III
- Official topics
- Network layer functions, classful and classless IPv4, routing algorithms, IP packet format, IPv6 addressing, neighbor discovery, auto configuration, Mobile IP, multicasting (source based and group shared tree)
- Where in the notes
- Sections 1 to 10, pp. 48 to 61
- Status
- Covered
- Official unit
- IV
- Official topics
- Transport functions and protocols, UDP, TCP, connection management, flow, error and congestion control; DNS, e-mail, WWW, firewalls, public and private keys
- Where in the notes
- Sections 1 to 13, pp. 66 to 80
- Status
- Covered
Source: MCA Scheme of Examination and Detailed Syllabus, 2025-26 onwards. Unit I's "Analog to digital Modulation" is handled both ways: section 12 covers analog-to-digital conversion and section 13 covers AM, FM and PM.
Each course in GGSIPU notes is mapped to its official PDF the same way.
How to write MCA 103 answers: addressing numericals, CRC and Hamming steps, and protocol timing diagrams
Each 12-mark unit question often has two parts, such as "(a) explain PCM (b) compare PCM and DM". Give each part a diagram, six to eight points and a comparison table.
- Waveforms: answers are judged on the drawing. Mark bit boundaries with dotted lines and write each bit above its interval, as in Fig 1.8 and 1.9.
- Unit II numericals: write the formula, show every XOR or parity step and box the answer; for ALOHA, draw the timeline and quote 18.4% and 36.8%.
- Addressing: for IPv4 blocks, write the changing byte in binary, show the mask, then give first address, last address and N. For IPv6, show both abbreviation rules;
::appears only once. - TCP and services: draw the handshake with sequence numbers and sketch the cwnd graph. Name ports for services: DNS 53, SMTP 25, POP3 110, IMAP 143, HTTP 80, HTTPS 443.
Worked example: one address is 205.16.37.39/28; find the block (page 51)
- Suffix 4 bits, so N = 16 and mask 255.255.255.240.
- 39 = 0010 0111: host bits to 0 gives 32, to 1 gives 47.
- First 205.16.37.32/28, last 205.16.37.47/28, N = 16.
Practise this layout on the GGSIPU MCA important questions.
MCA 103 and the MCA 161 Computer Networks lab (6 course outcomes), plus other GGSIPU MCA Sem 1 papers
Paired lab: MCA 161 Computer Networks lab notes · L 0, P 2 · 1 credit · 6 course outcomes built around a network simulator.
- Unit I topologies and devices feed lab CO2 (configuration) and CO3 (building LANs).
- Unit II MAC protocols feed CO4, simulating protocol performance.
- Unit III routing algorithms feed CO5, comparing them.
- All four units, with Unit IV TCP and UDP, feed CO6, designing a real network.
The other Semester 1 theory papers are MCA 101 Discrete Structures, MCA 105 Operating Systems with Linux, MCA 107 Database Management Systems and MCA 109 Object Oriented Programming and JAVA. MCA 105 runs closest, since MCA 103 lists basic OS concepts as a prerequisite.
MCA 103 networking notes FAQs
How do I get the full MCA 103 notes?
Send a WhatsApp message to 9899436384 using the "Get Full Notes" button on this page. The full MCA 103 notes come only as a printed book of 82 pages, not as a PDF file, and it reaches you within 5 to 7 days at most, depending on your location. You can check seven watermarked pages first through the "View Sample PDF" button at the top.
Do the MCA 103 notes follow the current MCA syllabus?
Yes. They follow the MCA scheme and syllabus for affiliated institutes that applies from Academic Year 2025-26, approved by the USIC&T Board of Studies on 28 July 2025. Each official topic in Units I to IV maps to a numbered section of the notes, and the syllabus table above gives the exact pages. If the syllabus is revised, the notes and this page are updated.
What is the passing mark for MCA 103 Computer Networks?
MCA 103 is marked out of 100, and its end-term question paper is set for 60 marks (12 for Q1 plus four unit questions of 12). The MCA scheme of examination states pass marks as 40%, which is 40 out of 100 for every paper. End-term minimums, re-appear and other result rules are governed by GGSIPU Ordinance 11 on ipu.ac.in.
How many questions do I answer in the MCA 103 end-term paper?
Five. Q1 is compulsory, covers the whole syllabus and carries 12 marks in short-answer parts. Each of the four units then offers two questions of 12 marks, and you attempt one from each, adding up to 60 marks. That is why every unit in the notes ends with both short-answer and long-answer practice sets for this exact pattern.
Which MCA 103 unit has the most numericals?
Units II and III tie with 18 worked numericals each: 8 solved examples plus 10 practice numericals. Unit II covers CRC, Hamming code, checksum, window sizes, ALOHA throughput and minimum frame size. Unit III covers IPv4 classes, subnetting, CIDR blocks, fragmentation and IPv6 abbreviation. Unit IV has 15 and Unit I has 5, all solved examples.
Do the MCA 103 notes cover IPv6, Mobile IP and multicasting?
Yes, all three are in Unit III. IPv6 runs from page 55 to 58 with notation, address types, the 40-byte header, neighbor discovery, SLAAC with EUI-64 and IPv4 to IPv6 transition. Mobile IP covers home and foreign agents, its three phases and triangle routing. Multicasting compares source-based trees (DVMRP, MOSPF, PIM-DM) with group-shared trees (CBT, PIM-SM).
Get the full MCA 103 Computer Networks Notes on WhatsApp
The full MCA 103 notes are sold only as a printed book, ordered on WhatsApp; there is no PDF version. These are Computer Networks notes in English, printed on A4.
What the printed MCA 103 notes book contains
- Unit
- I
- Pages
- 4 to 26 (23)
- Solved examples
- 5
- Practice numericals
- 0
- Figures
- 14
- Unit
- II
- Pages
- 27 to 46 (20)
- Solved examples
- 8
- Practice numericals
- 10
- Figures
- 13
- Unit
- III
- Pages
- 47 to 64 (18)
- Solved examples
- 8
- Practice numericals
- 10
- Figures
- 8
- Unit
- IV
- Pages
- 65 to 82 (18)
- Solved examples
- 5
- Practice numericals
- 10
- Figures
- 10
Delivery: within 5 to 7 days at most; the exact time may vary with your location.
Order the printed MCA 103 Computer Networks Notes book on WhatsApp (4 units, 82 pages)
Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.
Ready for the full notes?
Discuss coverage and delivery with our team.