R.G.P.V. Bhopal (MP)
M.C.A(3rd Semester) EXAMINATION
COMPUTER NETWORKS [ MCA-305 ]
Time: 3Hrs Max Marks: 100 Min Marks: 40
Note:Attempt any 5 questions.All question Carry equal marks.
Note:Attempt any 5 questions.All question Carry equal marks.
UNIT-I
Q.1.(a) What are the advantages and disadvantages of fiber optics over copper wire ?(b) Differentiate between the following :
(i) OPCM and PCM
(ii) FDM and TDM
(c) What are the major functions of the Data Link layer of ISO-OSI reference model ?
OR
Q.2(a) What are the reasons for using layered protocols ?(b) If the bit rate of a signal is 2000 bps, how many bits can be transmitted in 1 m sec, ?
(c) Show that the efficiency of slotted ALOHA is double of pure ALOHA.?
UNIT-II
Q.3.(a) The message 11010110111110 arrivals using generator polynomial x4 + x + 1. Explain whether it is correct or not.?(b) Write down the procedure of one-bit sliding window protocol. Also explain what will happen when two users start transmitting the message to each other simultaneously.?
OR
Q.4(a) Generate the Hamming codeword of the dataword : 10110001.?(b) Using 4-bit sequence number, what is the maximum size of the send and receive windows for each of the following protocols ?
(i) Stop-and-wait
(ii) Go-Back-N
(iii) Selective-Repeat
UNIT-III
Q.5.(a) Differentiate between bridges and gateways.?(b) Explain token ring MAC sublayer data frame format.?
(c) Describe the principle of operation of the following MAC method as used in LANs :
(i) CSMA/CD
(ii) Control Token
OR
Q.6.(a) Describe the IEEE 802.4 standard protocol and its frame format.?(b) Explain the following :
(i) FDDI
(ii) DGOB
UNIT-IV
Q.7.(a) Explain Dijkstra algorithm, compute the shortest path between the node a and d in thefollowing graph :
(b) Explain the following :
(i) The optimality principle
(ii) Multicasting
OR
Q.8.(a) Discuss the Link state routing with suitable example.?(b) Explain the token bucket algorithm.?
(c) Differentiate between TCP and UDP.?
UNIT-V
Q.9.(a) Explain cipher block chaining and chipher feedback mode. Which one is more efficient and how?(b) Using e = 13, d = 37 and n = 77 in the RSA algorithm, encrypt the message "Good" using the values of 00 to 25 for letters A to Z.?
OR
Q.10.(a) What are all the possible number combination of inputs in a 7-by-3, S-box ? What is thepossible number of outputs ?
(b) Explain the following :
(i) DNS
(ii) Digital signature
META TAGS:-RGTU MCA 3RD SEM PAPERS I RGPV MCA 3RD SEM ALL PAPERS I RGTU MCA 3RD SEM ALL SUBJECT OLD PAPERS I RGPV MCA-305COMPUTER NETWORK MODEL PAPERS I RGTU MCA-305 LAST 5 YEAR PAPERS I RGPV MCA-305 LAST 5 YEAR PAPERS I RGTU MCA 3RD SEM COMPUTER NETWORK GUESSING PAPERS I RGTU MCA-305 COMPUTER NETWORK OLD PAPERS I RGTU COMPUTER NETWORK IMPORTANT QUESTIONS I COMPUTER NETWORK IMPORTANT QUESTIONS I MCA 3RD SEM COMPUTER NETWORK SOLVED PAPERS I
No comments:
Post a Comment