Split the hexadecimal format, Operating System

The following is a dump of a TCP header in hexadecimal format:

00CD0018 00000EF1 00000D5D 502200D1 01BF0010

We need to first split the above hex as such

00 CD 00 18 00 00 0E F1 00 00 0D 5D 50 22 00 D1 01 BF 00 10

1.1  What is the source port number?

Source port is 2 bytes take 00 CD   = 205

           (00 CD 00 18 00 00 0E F1 00 00 0D 5D 50 22 00 D1 01 BF 00 10)

1.2  What is the destination port number?

Next 2 bytes as destination address 00 18 = 24

1.3  What is the sequence number?

Next 4 bytes as sequence number 00 00 0E F1 = 3825

1.4  What is the acknowledgment number?

Next 4 bytes as acknowledgment number 00 00 0D 5D = 3421

1.5  What is the length of the header?

Next 4 bits as HLEN 5 (this indicates number of sets of 4 bytes which makes the header lenght = 20bytes)

1.6  Which control bits are set and what do they represent?

Next 6 bits are reserved 02 = 02 (10 - remaining (binary))

Next 6 bits are control bits 22= 34 (100010)

1.7  What is the window size?

Next 2 bytes indicate the window length 00 D1 =209

Posted Date: 3/14/2013 2:08:38 AM | Location : United States







Related Discussions:- Split the hexadecimal format, Assignment Help, Ask Question on Split the hexadecimal format, Get Answer, Expert's Help, Split the hexadecimal format Discussions

Write discussion on Split the hexadecimal format
Your posts are moderated
Related Questions
Load Sharing : Processes are not given to a particular processor. A global queue of threads is used to maintain. Each processor, when idle, picks a thread from this queue. Note th


Define the Sleep (sec) Function Sleep function suspends execution of this process for sec number of seconds. While this function is used in our example for consistency, other f

When you run a program on your UNIX system, the system prepares a special environment for that program. This environment owns everything needed for the system to execute the progra

Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algori

swapping technique

Q. Segmentation is alike to paging but uses variable-sized "pages". Describe two segment-replacement algorithms based on FIFO and LRU page replacement schemes. Remember that since

In fixed portioning scheme, what are the advantages of using unequal- size partitions? With unequal-size partitions there are two probable ways to assign process to partitions.

Q. Define the difference among pre-emptive and non pre-emptive scheduling. Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution ta

Problem: a) Define the term ‘process' and what are the different constituents of a process. b) In the three-state process model, what does each of the three states signify?