Transcript CN-10MCA32-100Questions-Dr.KSJ

Department of MCA
Subject: Computer Networks
Subject Code: 13MCA31
Semester: III MCA
Question Bank
1. Define Computer Network.
2. Explain how networks could be classified?
3. Explain the applications of Computer networks
4. Draw the OSI network Architecture
5. Explain the various layers of OSI network architecture in detail
6. What is Multiplexing?
7. Explain the working of TDM and FDM
8. What is Statistical Multiplexing? What are its advantages?
9. Mention few applications of computer networks
10. How the cost-effective resource sharing is implemented in Computer networks
11. What are Sockets?
12. What are the various Protocol Implementation Issues?
13. Describe the relationship between bandwidth and latency
14. Explain any two encoding schemes.
15. Consider a point to point 20 Km in Length. At what bandwidth would Propogation
delay (at a speed of 2 x 10 8 m/sec) equal transmit delay for 100 byte packet? What
about 512 – byte packets?
16. Define Latency, Propagation delay and Transmission Delay.
17. Explain RTT of the network?
18. Explain the internet protocol graph
19. Suppose we want to transmit the message 11001001 and protect it from errors using
CRC Polynomial x3 + 1
a) Use Polynomial Long division to determine the message that should
be transmitted.
b) Suppose the leftmost bit of the message is inverted due to noise on the
transmission link. What is the result of teh receivers CRC
calculations? How does the receiver that an error has occurred?
20. What is encoding?
21. Explain the different encoding schemes with wave forms
22. Why Framing is required? Mention the different types of framing approach
23. Write the BISYNC and PPP Frame format?
24. Write the, DDCMP and HDLC Frame format.
25. Write Short note on Error detection
26. Explain Two dimensional Parity
27. Define the terms Timeout and ARQ
28. Explain stop and wait ARQ Scheme with timeline showing different scenarios
for stop and wait algorithm?
29. Explain CSMA/CD
30. Explain Physical properties of Ethernet
31. Explain Ethernet’s Frame format and addresses
32. Explain Ethernet Transmitter Algorithm
33. Briefly Explain the token ring and its working
34. Draw the 802.5/Token ring frame format
35. Explain switching and Forwarding
36. Explain the characteristics of connection less(datagram) networks
37. Explain rotation technique to handle header for source routing
38. Briefly Explain the Virtual Circuit Switching
39. Write Short note on Bridges
40. Briefly Explain IPV4 packet header
41. Explain briefly the process of Fragmentation and Reassembly
42. Draw diagram showing header fields used in IP fragmentation for unfragmented
packet and fragmented packet
43. Briefly Explain Datagram Forwarding in IP
44. Draw OSPF header format
45. Explain Dynamic Host Configuration Protocol
46. Explain Internet Control Message Protocol
47. Explain how Distance Vector Routing works with an example network?
48. Draw the functional block diagram of router and explain
49. Explain Routing for Mobile Hosts
50. Explain Route optimization in Mobile IP
51. Explain DNS Message Format
52. Explain any one VOIP signalling
53. Write short note on WWW
54. Explain FTP
55. Explain point to point Protocol
56. Explain different types of switching
57. Differentiate between unicasting, Multicasting and broadcasting
58. With neat block diagram explain Piconet networks
59. Differentiate between connection oriented and connection less services
60. Differentiate between TCP and UDP
61. Define DNS. Explain the hierarchy of name servers
62. Explain Manage gateway
63. Write short note on WI max (802.11)
64. Write a note on Address resolution Protocol (ARP)
65. Define internet Explain IPv4 Packet format with neat diagram
66. Compare IPv4 with IPv6 header format
67. Explain the concept of DNS
68. Describe routing for mobile hosts. Explain how a host gets registered itself with a
foreign agent?
69. Explain OSPF
70. Explain LAN Switches
71. Explain how TCP Manages byte streams
72. Explain the uses of computer networks with respect to business and home
applications
73. Explain Application-Layer Overview
74. Describe the principle behind Client/server model
75. What is TTL (Time to leave)?
76. Differentiate between recursive mapping and Iterative mapping.
77. Explain Secure Shell (SSH) Protocol
78. Describe the structure of SSH packet format
79. Differentiate between SMTP and e-mail
80. What is Secure Copy Protocol (SCP)?
81. What is meant by Web Caching?
82. Explain the concept of IP Telephony
83. Explain Session Initiation Protocol (SIP)
84. Explain H.323 protocols
81. List out SIP components
82. What is meant by Session signalling and numbering?
83. Describe the advantages and disadvantages of packet switching
84. Calculate the total time required to transfer a 1000-KB file in the following cases,
assuming an RTT of 100 ms, a packet size of 1 KB and an initial 2 * RTT of
“handshaking” before data is sent.
a) The bandwidth is 1.5 Mbps, and data packets can be sent continuously.
b) The bandwidth is 1.5 Mbps, but after we finish sending each data packet
we must wait one RTT before sending the next.
85. Consider a point-to-point link 2 km in length. At what bandwidth would propagation
delay (at a speed of 2*108 m/s) equal transmit delay for 100-byte packets? What
about 512-byte packets?
86. Consider a point-to-point link 50 km in length. At what bandwidth would
propagation delay (at a speed of 2*108 m/s) equal transmit delay for 100-byte
packets? What about 512-byte packets?
87. How “wide” is a bit on a 1-Gbps link? How long is a bit in copper wire, where the
speed of propagation is 2.3 *108 m/s?
88. For each of the following operations on a remote file server, discuss whether they
are more likely to be delay sensitive or bandwidth sensitive.
(a) Open a file.
(b) Read the contents of a file.
(c) List the contents of a directory.
(d) Display the attributes of a file.
89. Calculate the latency (from first bit sent to last bit received) for the following:
(a) 1-Gbps Ethernet with a single store-and-forward switch in the path, and a
packet size of 5000 bits. Assume that each link introduces a propagation
delay of 10 μs and that the switch begins retransmitting immediately after it
has finished receiving the packet.
(b) Same as (a) but with three switches.
(c) Same as (b) but assume the switch implements “cut-through” switching: It
is able to begin retransmitting the packet after the first 128 bits have been
received.
90. Hosts A and B are each connected to a switch S via 10-Mbps links as in Figure 1.25.
The propagation delay on each link is 20 μs. S is a store-and forward device; it
begins retransmitting a received packet 35 μs after it has finished receiving it.
Calculate the total time required to transmit 10,000 bits from A to B
91. Describe a protocol combining the sliding window algorithm with selective ACKs.
Your protocol should retransmit promptly, but not if a frame simply arrives one or
two positions out of order. Your protocol should also make explicit what happens if
several consecutive frames are lost.
92. Draw a timeline diagram for the sliding window algorithm with SWS = RWS = 3
frames for the following two situations. Use a timeout interval of about 2* RTT.
(a) Frame 4 is lost.
(b) Frames 4–6 are lost.
93. Show the 4B/5B encoding, and the resulting NRZI signal, for the following bit
Sequence:
1110 0101 0000 0011
94. Propose a mechanism that virtual circuit switches might use so that if one switch
loses all its state regarding connections, then a sender of packets along a path
through that switch is informed of the failure.
95. Give an example of a working virtual circuit whose path traverses some link twice.
Packets sent along this path should not, however, circulate indefinitely.
96. What aspect of IP addresses makes it necessary to have one address per network
interface, rather than just one per host? In light of your answer, why does IP tolerate
point-to-point interfaces that have nonunique addresses or no addresses?
97. Why does the Offset field in the IP header measure the offset in 8-byte units? (Hint:
Recall that the Offset field is 13 bits long.)
98. Some signalling errors can cause entire ranges of bits in a packet to be overwritten
by all 0s or all 1s. Suppose all the bits in the packet including the Internet checksum are
overwritten. Could a packet with all 0s or all 1s be a legal IPv4 packet? Will the Internet
checksum catch that error? Why or why not?
99. When closing a TCP connection, why is the two-segment-lifetime timeout not
necessary on the transition from LAST ACK to CLOSED?
100. A sender on a TCP connection that receives a 0 advertised window periodically
probes the receiver to discover when the window becomes nonzero. Why would the
receiver need an extra timer if it were responsible for reporting that its advertised
window had become nonzero (i.e., if the sender did not probe)?