Sneha Sahi: Content of Homework Should Start From This Page Only
Sneha Sahi: Content of Homework Should Start From This Page Only
Declaration:
I declare that this assignment is my individual work. I have not
copied from any other student’s work or from any other source
except where due acknowledgment is made explicitly in the text,
nor has any part been written for me by another person.
Student’s
Signature: Rohan Kandwal
Evaluator’s comments:
__________________________________________________________________
___
PART-A
It shows two systems , System A and System B. Both the systems are
communicating with each other through PSTN network. The use of modems
is clearly shown in the figure. They are modulating the data at the sender
end and again demodulating at the receiver side.
Que2: With the aid of the diagram, describe how the following gain access to the
internet:
Que3: Explain why most data networks operate in a packet mode. Hence explain
why services involving audio and video are supported?
Ans 3: Example Of Packet Switching :-
Packet switching refers to protocols in which messages are broken up into small
packets before they are sent. Each packet is transmitted individually across the net
and may even follow different routes to the destination. Thus, each packet has
header information about the source, destination, packet numbering etc. At the
destination, the packets are reassembled into the original message.
1. The first and most important benefit is that since packets are short, the
communication links between the nodes are only allocated to transferring a single
message for a short period of time while transmitting each packet. Longer
messages require a series of packets to be sent, but do not require the link to be
dedicated between the transmission of each packet. The implication is that packets
belonging to other messages may be sent between the packets of the message
being sent from A to D. This provides a much fairer sharing of the resources of each
of the links.
figure above. At the time packet 1 is sent from B to C, packet 2 is sent from A to B;
packet 1 is sent from C to D while packet 2 is sent from B to C and packet 3 is sent
from A to B and so forth. This simultaneous se of communications links represents a
gain in efficiency. The total delay for transmission across a packet network may be
considerably less than for message switching, despite the inclusion of a header in
each packet rather than in each message.
For audio and video services are mainly supported by circuit switching. Once
a circuit is established it remains connected for the duration of the session.
Circuit switched creates temporary or permanent dedicated links that are
well suited for this type of communication.
PART -B
Ans 4:
The bandwidth of a transmission channel is the frequency interval over which the
signal does not experience line loss greater than a certain value (generally 3 dB, as
3 decibels corresponds to a signal loss of 50%).
Ans: An aspect ratio is the width by height dimensions (the ratio) of a display screen. It's often
used in terms of a movie screen, TV, or computer monitor.
The standard aspect ratio for television is 4:3. In other words, if the width of the screen is four
inches, the height would be three inches. If the width is eight inches, the height would be six
inches. If the width is 16 inches, the height would be 12.
Que6: Derive the bit rate that results from the digitization of a 525-line and a 625-
line system using the 4:2:0 digitization format and interlaced scanning. Hence
derive the amount of memory required to store a 2-hour movie/video.
Y=720 x 480
Cb =Cr=360 x 240
Memory required per line=720 x 8+ 2(360 x 8)= 11520 bits or 1440 bytes
=149.2992 Gbytes
In 625 system
Y=720 x 480
Cb =Cr=360 x 288
=149.2992 Gbytes
ABACADABACADABACABAB
2) Determine the savings in transmission bandwidth over normal ASCII and binary
coding.
Ans 7: (1)
According to the priority of the letters the huffmann tree is as shown below:
20
0 1
A 0 1
10 10
5 5
B
0 1
3 2
C D
SYMBOL FREQUENCY CODE CODE TOTAL
LENGTH LENGTH
A 10 0 1 10
B 5 10 2 10
C 3 110 3 9
D 2 111 3 6
10 x 1 + 5 x 2 + 3 x 3 + 2 x 3= 35 bits
(2) ASCII code uses 7 bits per code word. This makes the total bits
to be
10 7 70
5 7 35
3 7 21
2 7 14
Then the same data will take 140 bits. That means 105 bits more than the
huffmann tree coding.