You are on page 1of 2


1. With relevant examples differentiate simplex, half duplex and full duplex.
2. A sine wave completes one cycle in 25 micro\sec. what is its freq. express it in kHz
3. A digital signal has a bit interval of 40 micro\sec. what is the bit rate in kbps.
4. An analog signal carries 4 bits in each signal element. if 1000 signal elements are sent per
second, find the band rate and bit rate.
5. List 4 properties by which transmission media can differ.
6. Consider a 32 bit block of data 111001111101 1101 0011 1001 1010 1001 that has to be
transmitted. If LRC is used what is the transmitted bit stream?
7. In the hamming code, for a data unit of ‘m’ bits how you do compute the no. of redundant bits 'r'
8. What kinds of errors can vertical redundancy check determine? What kind of errors it cannot
9.calculate the band-rate for (i)2000 bps , FSK (ii) 6000 bps , 8PSK (iii) 6000 bps , 16-QAM (iv)
10.A modified NRZ code known as enhanced NRZ is sometimes used for high density magnetic
tape recording E-NRZ entails separating the NRZ-l data stream into 7-bit words , inverting bits
2,3,6 and 7, and adding the parity bit to each word to ensure odd parity. Advantages of E-NRZ
over NRZ-L? Any disadvantages?
11. Draw the sender and receiver window for a system using go-back-n ARQ scenario (n=4).
(i) Frame 0 is sent, frame 0 act (ii) frame 1 and 2 sent and act (iii) frame 3 and 4 sent, NAK (iv)
received (iv) frames 4, 5 and 6 sent and all act
12. Compare connection oriented and connectionless service
13. Distinguish pt-to-pt and multi pt. links. Give relevant diagram.
14. in the hamming code, for a data unit of 'm' bits how do you compute the no. of redundant bits
'r' needed?
15. What kind of errors can VRL determine and what kinds of errors it cannot determine?
16. Discuss stop and wait protocol.
17. Discuss go-back N sliding window protocol.

8 marks:

1. A n/w has 'n' devices. Determine the no. of cable links required for a mesh, ring, bus and star
2. A block of 32 bits has to be transmitted. Discuss how the 32 but is transmitted to the receiver
using LRC.
3. Explain layers in OSI model
4. Explain star and bus topologies of a computer n/w
5. Explain about coaxial cable and FOC for communication
6. Explain about the transmission modes available for data flow
7. Explain the categories of n/w
8. Explain CRC error detection mechanism with an example
9. Explain HDLC in detail
10. Discuss briefly about the line coding process used for converting digital data to digital signals
11. Write short notes on transmission media
12. Compare and contrast. Go-back-N and selective repeat ARQ
13. Compare OSI and TCP model
14. Discuss about 2 recent modem standards in detail
15.suppose a string 0101 is used as a bit string to indicate the end of a frame and the bit stuffing
rule is the insert a 0 after each appearance of 0101 in the original data, thus 010101 modified to
01001001 show how this string is modified ? 110 110 100 101 010 111 01

16 marks:
1. Go-back-N and selective repeat are 2 basic approaches to deal with transmission errors.
Compare the two approaches in terms of storage and b/w requirements. With the aid of a packet
seq. diagram show the output of go-back-n when a data packet/ACK packet/NAK packet is
2. Explain how full duplex data transmission takes place on RS232 DTE-DCE interface
3. What is the use of layered architecture? Discuss briefly the OSI layers that are responsible for
the following?
1).determine the best path to route packets 2).providing end-to-end communication with reliable
service 3).providing node-to-node communication with reliable service.
4. Explain briefly the different types of guided and unguided transmission. Media.
5. Consider a token ring network with ring latency D, the total ring propagation delay and link b/w
is R. assume there an N stations in the n/w placed equally apart. Assuming each station when
having the token, will txt one packet with field length L. calculate the utilization when
(i) L/R<D, and under immediate token release
(ii) L/R>D, and under immediate token release
(iii) L/R<D, and under delayed token release
(iv) L/R>D, and under delayed token release