You are on page 1of 3

ANSWER KEY PART - A 1. What is Data Communication?

It is the exchange of data between two devices through some transmission medium. Types: 1. Local - If the devices are restricted in a geographical area. 2. Remote - If the devices are farther away without any geographical restriction 2. What is Protocol? Give its Elements? A protocol is a set of rules that govern data communication. A protocol defines what is communicated how it is communicated, and when it is communicated. The key elements of a protocol are : Syntax - structure or format of the data, means to the order how it is presented Semantics - meaning of each section of bits Timing - Timing refers to two characteristics. They are, 1. When data should be sent 2. When data to be received. 3. Differentiate between logical address and physical address Logical Address 1. A Logical address is a 32- bit address assigned to each system in a network 2. If a packet passes the network boundary we need another addressing to differentiate the source and destination systems. Physical address: 1. A Physical address is a 48-bit flat address burned into the ROM of the NIC card 2. If the frames are deistributed to different systems on a network we use thsis physical address 4. What is burst error? It means that two or more bits in the data unit have changed. A burst bit does not necessarily means that the errors occur in consecutive bits The length of the bust error is measured from the first corrupted bit to the last corrupted bit. Some bits in between may not be corrupted. 5. Find the classes of each address (a) 0000001 00001011 00001011 (b) 1100001 10000011 00011011 (c) 14.23.120.8 (d) 252.5.15.111

11101111 11111111

- Class A - Class C - Class A - Class E

6. An IP Packet has arrived with M bit value as 1 and Fragmentation offset value of 0 What do you infer from this? If M Bit value is set to 1, then there are more fragments to follow. If offset value is 0 then fragmented contains the first part of the original datagram. 7. What is the value of receiver window for host A , if the receiver host B has a buffer size of 5000 bytes and 1000 bytes of received and unprocessed data. The value of rwnd = 5000 1000 = 4000. Host B can receive only 4000 bytes of data before overflowing its buffer. Host B advertises this value in its next segment to A

8. What is IntServ? IntServ or integrated services is an architecture that specifies the elements to guarantee quality of service (QoS) on networks. IntServ can for example be used to allowvideo and sound to reach the receiver without interruption. IntServ specifies a fine-grained QoS system, which is often contrasted with DiffServ's coarse-grained control system. 9. What is DDNS? Dynamic DNS (DDNS) is a method of automatically updating a name server in the Domain Name System (DNS), often in real time, with the active DNS configuration of its configured hostnames, addresses or other information. 10. Briefly explain Bucket Brigade attack An attack against public key exchange in which attackers substitute their own public key for their requested public key, also called a Man-in-the-Middle attack. PART-B 11. (a) Explain in detail the OSI/ISO reference model with neat sketch The architecture of OSI model is a layered architecture. The seven layers are, 1. Physical layer 2. Datalink layer 3. Network layer 4. Transport layer 5. Session layer 6. Presentation layer 7. Application layer OR 11. (b) Write a detailed note on Transmision media used by the data communication Networks Factors Types Guided Media : Unshielded Twisted Pair (UTP) Shielded Twisted Pair Coaxial Cable Optical Fiber Unguided Media : Radio Transmission Microwave Satellite Communication 12. (a) Describe the flow control protocols for the noisy channels Stop-and-Wait Protocol Sliding Window Protocol OR

12. (b) Briefly explain IEEE 802.3 and IEEE 802.11 standards IEEE 802.3 Ethernet Physical Properties Ethernet types Access protocol & Frame Format Addresses Transmitter algorithm IEEE 802.11 - WI-FI Physical Properties Collision avoidance Distribution System Access protocol & Frame Format 13. (a) Explain the distance vector routing with an illustrative example Each node maintains set of triples - (Desination, Cost, NextHop) Updations at neighbours Example of distance vector routing Recovery from link failure Looping problem Split Horizon OR 13. (b) Describe the working of Link state routing protocol with suitable example Contrast with distance vector - entire routing table sent just to neighbors Link state packet Reliable flooding Shortest Path First Algorithm (Dijkstra) with example 14. (a) Explain in detail the congestion control mechanisms used in virtual circuit and datagram networks Additive Increase/Multiplicative Decrease Slow Start Fast Retransmit and Fast Recovery OR 14. (b) Explain the various phases of TCP operation Connection Establishment Data Transfer Connection Termination Connection Reset 15. (a) Describe RSA and Diffie Hellman algorithm their merits and demerits Diffie Hellman algorithm Purpose Algorithm with example Merits and demerits RSA Purpose Algorithm with example Merits and demerits OR 15. (b) What is DNS?. Explain with an Example Name service Domain hierarchy Name server Name resolution

You might also like