CS3591 Computer Networks Previous Year Question Papers - Anna University
Explore the Previous Year Anna University Question Papers of CS3591 Computer Networks.
2024
-
2024 - CSE-ND-2024-CS 3591-Computer Networks -260702950-20250604161745 (10).pdf
2023
-
2023 - CSE-ND-2023-CS 3591-Computer Networks-331495196-20875.pdf
Important Questions - CS3591 Computer Networks
UNIT I: Introduction and Application Layer
Part A (2 Marks)
- Define a Computer Network and its components.
- What are the seven layers of the OSI model?.
- Differentiate between IMAP and POP protocols.
- Why is HTTP considered a stateless protocol?.
Part B (13/16 Marks)
- OSI Reference Model: Detailed explanation of all seven layers and their functions.
- TCP/IP Protocol Suite: Architecture and comparison with the OSI model.
- HTTP Protocol: Working mechanism, request/response messages, and persistent connections.
- Domain Name System (DNS): Hierarchy, name resolution process, and record types.
- Email Protocols: Detailed study of SMTP, POP3, and IMAP architecture.
UNIT II: Transport Layer
Part A (2 Marks)
- Difference between TCP and UDP.
- Define Congestion Control and Quality of Service (QoS).
- What is a socket address?.
Part B (13/16 Marks)
- TCP Connection Management: Three-way handshake for establishment and four-way for termination.
- TCP Congestion Control: Explanation of Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery.
- Congestion Avoidance Algorithms: Mechanisms like DECbit and Random Early Detection (RED).
- Reliable Data Transfer: Comparison of Go-Back-N and Selective Repeat ARQ protocols.
UNIT III: Network Layer
Part A (2 Marks)
- What is a subnetwork mask?.
- Define the purpose of ICMP and ARP protocols.
- What is tunneling in networking?.
Part B (13/16 Marks)
- IP Addressing: Detailed explanation of IPv4 addressing, subnetting, and supernetting.
- IPv6: Header format and transition mechanisms from IPv4 to IPv6.
- DHCP: The working process of the Dynamic Host Configuration Protocol.
- Packet Switching: Concepts and differences between datagram and virtual circuit switching.
UNIT IV: Routing
Part A (2 Marks)
- Define unicast and multicast routing.
- What is the count-to-infinity problem?
Part B (13/16 Marks)
- Distance Vector Routing (DVR): Working of the RIP protocol and the Bellman-Ford algorithm.
- Link State Routing: OSPF protocol and Dijkstra's algorithm for path selection.
- Inter-domain Routing: Detailed explanation of the Border Gateway Protocol (BGP).
- Multicast Routing: Concepts of DVMRP and PIM protocols.
UNIT V: Data Link and Physical Layers
Part A (2 Marks)
- Define Propagation Delay and Transmission Delay.
- What is Framing and what are its methods?.
- Difference between CSMA/CD and CSMA/CA.
Part B (13/16 Marks)
- Error Control: Techniques for error detection and correction (CRC, Hamming Code, Parity).
- Ethernet Standards: Detailed look at IEEE 802.3 (Wired) and 802.11 (WLAN/Wi-Fi).
- Media Access Control: PPP and CSMA protocols.
- Transmission Media: Advantages and disadvantages of guided and unguided media.
Most Repeated / High-Weight Questions
OSI model layers and functions, TCP/IP architecture, routing algorithms (RIP, OSPF, BGP), congestion control mechanisms, error detection and correction techniques, IPv4/IPv6 addressing and subnetting.
Additional Resources
How to Use These Question Papers
- OSI Model Foundation: Master all 7 layers in detail. Complete Units 1-3 for layered architecture understanding, dedicate 35% of time to routing algorithms (Unit 4).
- Protocol Study: Understand TCP/IP architecture, HTTP, DNS, SMTP/POP3/IMAP protocols. These protocol-specific questions appear with 13-16 marks regularly.
- Routing Algorithm Practice: Master RIP (distance vector), OSPF (link state), and BGP (inter-domain) algorithms. Draw routing tables and trace algorithm execution manually.
- Subnetting & IPv4: Practice IP address calculation, CIDR notation, subnetting/supernetting. Understand IPv6 header format and transition mechanisms from IPv4.
- Time Management: Allocate 60-90 minutes per protocol analysis or routing problem; practice combined questions on architecture and algorithms under timed conditions.