Download PTU (Punjab Technical University) B.Tech (Bachelor of Technology) / BE (Bachelor of Engineering) 2021 January ECE 7th Sem 71909 Computer Networks Previous Question Paper
Total No. of Pages : 02
Total No. of Questions : 18
B.Tech. (ECE) (2012 to 2017 ) (Sem. ?7)
COMPUTER NETWORKS
Subject Code : BTCS-403
M.Code : 71909
Time : 3 Hrs. Max. Marks : 60
INST RUCT ION TO CANDIDAT ES :
1 .
SECT ION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2 .
SECT ION-B c ontains F IVE questions c arrying FIVE marks eac h and s tud ents
have to atte mpt any FOUR q ues tions.
3 .
SECT ION-C contains THREE questions carrying T EN marks e ach and s tudents
have to atte mpt any T WO questio ns.
SECTION-A
Answer briefly :
1.
What is OSI-1SO?
2.
List different Ethernet versions.
3.
What is the difference between congestion control and flow control?
4.
What is the use of PPP protocol?
5.
What do you understand by CDMA technology?
6.
What do you understand multicasting routing?
7.
What is ALOHA?
8.
Differentiate between switch and hub.
9.
What is subnetting?
10. Explain briefly the concept of cumulative acknowledgement in Go back by N protocol.
1 | M - 7 1 9 0 9
( S 2 ) - 3 6 8
SECTION-B
11. Explain briefly different congestion management techniques.
12. Compare OSI Reference Model with the TCP/IP Model.
13. Discuss about the configuration and control fields of HDLC.
14. Differentiate LAN, MAN and WAN network topologies.
15. Describe a suitable congestion control algorithm with an example used for multicasting
routing.
SECTION-C
16. Compare the working of Go back by N and sliding window protocols in transport layer
with the help of suitable examples.
17. Compare the individual fields of IPv4 header with IPv6 header. Draw the format of an IPv6
and explain.
18. What is routing? At which layer it takes place? Explain hierarchical routing algorithm.
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.
2 | M - 7 1 9 0 9
( S 2 ) - 3 6 8
This post was last modified on 26 June 2021