Q1. describe the RSA algorithm which is used for encryption.
Q2. For RSA algorithm p = 7 and q = 11, determine the possible values of d. As well find out the value of e for the two possible values of d.
Q3. By using Huffman coding produce codes for the given symbols given with their frequency of occurrence (illustrate the Huffman tree).
a) (50%)
b) C(30%)
c) G (15%)
d) T(5%)
Q4. prepare a detail note on one of the given:
a) Poisson Process
b) File transfer Protocol
c) Electronic mail