0% found this document useful (0 votes)
48 views8 pages

Maazhasnain167 9a CCN PPR

Here is a 64-bit binary number I generated to represent a UDP header: 0100101011100011010001010101100011010010001101110011 1) There are no errors in the UDP header as represented by this 64-bit binary number. 2) The source port number is 10101 which is decimal 21. 3) The destination port number is 11100011 which is decimal 123. 4) The packet length without the header is 0100010101101 which is decimal 310.

Uploaded by

Maaz Chauhann
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views8 pages

Maazhasnain167 9a CCN PPR

Here is a 64-bit binary number I generated to represent a UDP header: 0100101011100011010001010101100011010010001101110011 1) There are no errors in the UDP header as represented by this 64-bit binary number. 2) The source port number is 10101 which is decimal 21. 3) The destination port number is 11100011 which is decimal 123. 4) The packet length without the header is 0100010101101 which is decimal 310.

Uploaded by

Maaz Chauhann
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Maaz Hasnain

F16BCSE167
9A
CCN final Paper
Submitted to Sir Sharjeel Farooqui
FOUNDATION UNIVERSITY
Rawalpindi Campus
Final Term Examination (Fall 2021)

Program: BSSE Semester: 05


Course Title: CCN Max. Marks: 50
Time Allowed: 3 hour(including uploading time). Date 9 Feb 2021
Email address : [email protected]

Question #1 (10 marks)


Consider the following string of ASCII characters that were captured by Wire shark when the
browser sent an HTTP GET message (i.e., this is the actual content of an HTTP GET message).
The characters <cr><lf> are carriage return and line-feed characters (that is, the italized
character string <cr> in the text below represents the single carriage-return character that was
contained at that point in the HTTP header). Answer the following questions, indicating where
in the HTTPGET message below you find the answer.

1) What is the URL of the document requested by the browser?


The document request was http://gaia.cs.umass.edu/cs453/index.html. The Host : field
indicates the server's name and /cs453/index.html indicates the file name.

2) What version of HTTP is the browser running?


The browser is running HTTP version 1.1, as indicated just before the first pair.

3) Does the browser request a non-persistent or a persistent connection?


The browser is requesting a persistent connection, i.e.: keep-alive.

4) What is the IP address of the host on which the browser is running?


This information is not contained in an HTTP message anywhere. So there is no way to
tell this from looking at the exchange of HTTP messages alone. One would need
information from the IP datagrams to answer this question .
5) What type of browser initiates this message? Why is the browser type needed in an HTTP
request message?
Mozilla/5.0. The browser type information is needed by the server to send different
versions of the same object to different types of browsers.

Question # 2 (10 marks)


Suppose u have to send N packets from source to destination and window size is of 10 then if RTT is
your roll no then how much time required for complete data transmission using selective reject?
N=roll no

Question # 3 (10 marks)


In a block of addresses we know the IP address of one host is Roll no. Roll no. Roll no. Roll
no./20.What is the first address and the last address of this block? Find the number of addresses in the
block?
Hint: if your roll no is 33 then your ip address will look like this: 33.33.33.33/20

Answer:
Network: 167.167.160.0/20

First address: 167.167.160.1

Last address: 167.167.175.254

No of addresses: 4094

Question # 4 (10 marks)


Consider you have 5 Nodes network randomly connected with each other. Each node has connected
with some link cost. Find the cost for given network graph, using Dijkstra’s Algorithm compute the
shortest path of the farthest node in your network?

Answer:
QUESTION 5: (10 MARKS)
Generate your own 64-bit binary number and consider it as UDP Header. Then find the following?

1) Is there any Error in the UDP Header?


2) What is the source port no?
3) What is the destination port no?
4) What is the packet length without header?

You might also like