MCS-042
1. Write
Dijkstra’s algorithm and explain how does it work. Use the algorithm to find
the length of a shortest path between the vertices A and F in the weighted
graph shown in Figure 1. Show all the intermediate steps.
2. Explain
how a network congestion is controlled using slow start algorithm in TCP with help of an illustration. Is
congestion control and flow control are equivalent? (10 Marks)
3. Describe how
MACAW is an improvement over MACA ? (5
Marks)
4. Explain
and illustrate sliding window Protocol with window size of 5. How does the
scheme improve the efficiency of transmission ? (7 Marks)
5. Explain the
function and working model of Kerberos with the help of a diagram. (8 Marks)
6. Explain the
process of generating a digital signature. What are its benefits ? (5
Marks)
7. What is
called Constellation diagram ? Illustrate Constellation diagram of QAM – 16 and
QAM – 64.
8. Differentiate
between Leaky bucket and Token bucket traffic shaper. Why is traffic shaping needed
? (5 Marks)
9. Assume
we need to download a text document at a rate of 100 pages per minute. What is
required bit rate of the channel. Assume Page size = 24 lines Each line = 81
characters (7 Marks)
10. Find CRC for the
data polynomial x9 + x7 + x3 + x2
+ 1 with generator polynomial x3
+ x + 1. (6Marks)
11. Suppose you are developing a standard for a new type of a network. You
need to decide whether your network will use Virtual Circuits (VCs) or datagram
routing. What are the Pros & Cons for using VCs? (6 Marks)
12. Why is that packet switching is said to employ statistical multiplexing
? Contrast statistical multiplexing with the multiplexing that take place in
TDM.
*****************************************************************
Note: Answer with Dotcom Books
www.dotcombooks4u.com
(Last 5 year solved question
paper with Assignment solutions)
9825183881
****************************************************************
No comments:
Post a Comment