Cryptography and Network Security

Overview – I
1. In the elliptic curve group defined by y2= x3- 17x + 16 over real numbers, what is P + Q if P = (0,-
4) and Q = (1, 0)?
a) (15, -56) b) (-23, -43) c) (69, 26) d) (12, -86)
Answer: a
Explanation: P=(x1, y1)= (0,-4)
Q=(x2, y2)= (1,0)
From the Addition formulae:
λ= (0-(-4)) / (1-0) = 4
x3= = 16 – 0 – 1 = 15 and
y3= 4(0 – 15) –(-4) = -56
Thus R=P + Q = (15, -56).
2. Bob selects E67(2, 3) as the elliptic curve over GF(p). He selects e1 = (2, 22) and d = 4.
Then he calculates e2 = d × e1 and the publicly announces the tuple (E, e1, e2). Now, Alice wants to
send the plaintext P = (24, 26) to Bob and she selects r = 2. What are C1 and C2?
a) C1=(35,1) ; C2 =(21,44) b) C1=(44,21) ; C2 =(1,35)
c) C1=(44,21) ; C2 =(44,21) d) C1=(21,44); C2 =(35,1)
Answer: a
Explanation: Alice finds the points C1= r × e1 ; C1= (35, 1),
C2=P + r × e2 ; C2= (21, 44).
3. For the point P (7, 0) defined in the curve E13(1, 1). What is –P?
a) (7,1) b) (8,12) c) (8,1) d) (7,0)
Answer: d
Explanation: The inverse of P(11,2) is (11,11) or (11,-2).
4. Consider knapsack that weighs 23 that has been made from the weights of the superincreasing
series {1, 2, 4, 9, 20, and 38}. Find the ‘n’.
a) 011111 b) 010011 c) 010111 d) 010010
Answer: b
Explanation: v0=1, v1=2, v2=4, v3=9, v4=20, v5=38
K=6, V=23
Starting from largest number:
v5 > V then ϵ _5=0
v4 < V then V = V – v4 = 23 – 20 = 3 ϵ _4=1
v3 > V then ϵ _3=0
v2>V then ϵ _2=0
v1 < V then V = V – v1= 3 – 2 = 1 ϵ _1=1
v0 =1 then V = V – v0= 1 – 1 = 0 ϵ _0=1
n= ϵ _5 ϵ _4 ϵ _3 ϵ _2 ϵ _1 ϵ _0 = 010011.
5. The plaintext message consist of single letters with 5-bit numerical equivalents from (00000)2 to
(11001)2. The secret deciphering key is the superincreasing 5-tuple (2, 3, 7, 15, 31), m = 61 and a =
17. Find the ciphertext for the message “WHY”.
a) C= (148, 143, 50) b) C= (148, 143, 56) c) C= (143, 148, 92) d) C= (148, 132,92)
Answer: a
Explanation: {wi }= {a vi mod m}
{wi} = { 17×2 mod 61, 17×3 mod 61, 17×7 mod 61, 17×15 mod 61, 17×31 mod 61}
{wi} = {34, 51, 58, 11, and 39}
PlainText In binary Ci
W- 22 10110 148
H – 7 00111 143
Y – 24 11000 50
So that the ciphertext sent will be C= (148, 143, 50).
6. Suppose that plaintext message units are single letters in the usual 26-letter alphabet with A-Z
corresponding to 0-25. You receive the sequence of ciphertext message units 14, 25, 89. The public
key is the sequence {57, 14, 3, 24, 8} and the secret key is b = 23, m = 61.
Decipher the message. The Plain text is
a) TIN b) INT c) KIN d) INK
Answer: b
Explanation: Solve using Knapsack Cryptosystem.
Wi = {57, 14, 3, 24, 8}
b = 23 and m = 61
a = b-1 mod m
61 = 2 x23 + 15
23 = 1x 15 + 8 Therefore 1= 8 x 23 – 3 x 61
15 = 1x 8 + 7 b-1 = 23-1= 8
8 = 1x 7 + 1 a = 8
v_i=a(-1) w_i mod m
=bw_i mod m
v_i={ 30, 17, 8, 3, 1}
Cipher text V = bC mod m Plaintext
14 23 x 14 mod 61 = 17 01000 = 8 = I
25 23 x 25 mod 61 = 26 01101 = 13 = N
89 23 x 89 mod 61 = 34 10011 = 19 = T.
7. How many primitive roots does Z<19> have?
a) 5 b) 8 c) 7 d) 6
Answer: d
Explanation: Z<19> has the primitive roots as 2,3,10,13,14 and 15.
8. Find the order of group G= <Z7*, x>
a) 6 b) 4 c) 3 d) 5
Answer: a
Explanation: |G| = f(7) = (71-70) = 6
G = = { 1, 2, 3, 4, 5, 6 }

9. Which among the following values: 17, 20, 38, and 50, does not have primitive roots in the group G
= <Zn∗ , ×>?
a) 17 b) 20 c) 38 d) 50
Answer: b
Explanation: The group G = <Zn*, ×> have primitive roots only if n is 2, 4, pt, or 2pt
‘p’ is an odd prime and ‘t’ is an integer.
G = <Z17∗ , ×> has primitive roots, 17 is a prime.
G = <Z20∗ , ×> has no primitive roots.
G = <Z38∗ , ×> has primitive roots, 38 = 2 × 19 prime.
G = <Z50∗ , ×> has primitive roots, 50 = 2 × 52 and 5 is a prime.
10.Find the solution of x2≡3 mod 23
a) x≡±16 mod 23 b) x≡±13 mod 23 c) x≡±22 mod 23 d) x≡±7 mod 23
Answer: a
Explanation: a=3 3((23+1)/4)≡36≡1 (QR and there is solution)
x ≡ ±3(23 + 1)/4 (mod 23) ≡±16 i.e. x = 7 and 16
11. In Elgamal cryptosystem, given the prime p=31.
Encrypt the message “HELLO”; use 00 to 25 for encoding. The value of C2 for character ‘L’ is
a) 12 b) 07 c) 20 d) 27
Answer: d
Explanation: The Common factor for the calculation of C2 is e7 mod 31 = 257 mod 31 = 25.
P = “L” = 11; C1 = 37 mod 31 = 17; C2 = 11 x 25 mod 31 = 27; C = (17,27).
12. In Elgamal cryptosystem, given the prime p=31.
What is the respective plaintext character for C = (27, 20)?
a) H b) L c) O d) M
Answer: a
Explanation: The Common factor for the calculation of C2 is e7 mod 31 = 257 mod 31 = 25.
C = 17, 20); P = 20 X (1710)-1 mod 31 = 07; “07” = “H”.
13. For 1000 nodes in IP level, how many keys would be required?
a) 499000 b) 499500 c) 500500 d) 500000
Answer: b
Explanation: Use N(N-1)/2 where N=1000.
14. “Meet in the middle attack” is an attack
a) where the timing required for the attack via brute force is drastically reduced
b) where the adversary uses 2 or more machines to decrypt thus trying to reduce the time
c) where messages are intercepted and then either relayed or substituted with another message
d) where cryptanalysis takes lesser time than the brute force decryption
Answer: c
Explanation: “Meet in the middle attack” is an attack where messages are intercepted and then either
relayed or substituted with another message.
15. Which systems use a timestamp?
i) Public-Key Certificates ii) Public announcements
iii) Publicly available directories iv) Public-Key authority
a) i) and ii) b) iii) and iv) c) i) and iv) d) iv) only
Answer: c
Explanation: Public announcements and Public Certificates involve the use of timestamps.
1. In AES, to make the s-box, we apply the transformation –
b’i = bi XOR b(i+4) XOR b(i+5) XOR b(i+6) XOR b(i+7) XOR ci
What is ci in this transformation?
a) ci is the ith bit of byte c with value 0x63 b) ci is the ith bit of byte c with value 0x25
c) ci is the ith bit of byte c with value 0x8F d) ci is the ith bit of byte c with value 0x8A
Answer: a
Explanation: ci is the ith bit of byte c with value 0x63 i.e,
c = 01100011

2. The inverse s-box permutation follows,

b’i = b(i+2) XOR b(i+5) XOR b(i+7) XOR di
Here di is –
a) di is the ith bit of a byte ‘d’ whose hex value is 0x15
b) di is the ith bit of a byte ‘d’ whose hex value is 0x05
c) di is the ith bit of a byte ‘d’ whose hex value is 0x25
d) di is the ith bit of a byte ‘d’ whose hex value is 0x51
Answer: b
Explanation: The value of ‘d’ is 0x05.

3. What is the block size in the Simplified AES algorithm?

a) 8 bits b) 40 bits c) 16 bits d) 36 bits
Answer: b
Explanation: The block size for the AES algorithm is 16 bits.

4. Which function can be used in AES multiplication –

a) m(x)=x7+x4+x3 b) m(x)=x8+x4+x3+x+1

c) m(x)=x8+x3+x2+x+1 d) m(x)=x8+x5+x3+x
Answer: b
Explanation: m(x)=x8+x4+x3+x+1 stands for 100011011 which is an irreducible polynomial. Others
are not irreducible polynomials.

5. In the DES algorithm the Round Input is 32 bits, which is expanded to 48 bits via ______________
a) Scaling of the existing bits b) Duplication of the existing bits
c) Addition of zeros d) Addition of ones
Answer: a
Explanation: The round key is 48 bits. The input is 32 bits. This input is first expanded to 48 bits
(permutation plus an expansion), that involves duplication of 16 of the bits.

6. Using Differential Crypt-analysis, the minimum computations required to decipher the DES algorithm
is-
a) 256 b) 243 c) 255 d) 247
Answer: d
Explanation: Differential Crypt-analysis requires only 247 computations to decipher the DES algorithm.

7. Using SDES, the Plaintext for the Ciphertext 00001111, given that the key is 1111111111 is,
a) 01100111 b) 00001010 c) 11111111 d) 01101101
Answer: c
Explanation: Perform the SDES Decryption algorithm and compute the cipher text.

8. 12. For p = 11 and q = 17 and choose e=7. Apply RSA algorithm where Cipher message=11 and
thus find the plain text.
a) 88 b) 122 c) 143 d) 111
Answer: a
Explanation: n = pq = 11 × 19 = 187.
C=M^e mod n ; C=11^23 mod 187 ; C = 88 mod 187.

9. Reduce the following Big-O notation. O[ ax7 + 3 x3 + sin(x)] =

a) O[ax7]. b) O[sin(x)]. c) O[x7]. d) O[x7 + x3].
Answer: c
Explanation: O[ ax7 + 3 x3 + sin(x)] = O(ax7) = O(x7).

10. Reduce the following Big-O notation. O[ en + an10] =

a) O[ an10]. b) O[ n10 ]. c) O[ en ]. d) O[ en+ n10 ].
Answer: c
Explanation: O[ en + an10 ] = O[ en ].

TOPOLOGY
1. Which network topology does this represent?
a) Mesh b) Star c) Bus d) Ring
Answer: a
Explanation: The figure represents the mesh topology.
2. ‘Jitter’ refers to-
a) errorless delivery b) variation in the packet arrival time
c) timely delivery of message d) none of the mentioned
Answer: b
Explanation: ‘Jitter’ refers to variation in the packet arrival time.
3. 2 Half duplex systems can make a Full-Duplex.
a) True b) False
Answer: a
Explanation: The statement is true.
4. Which topology requires the most amount of wiring?
a) Mesh b) Star c) Bus d) Ring
Answer: a
Explanation: This is the disadvantage of mesh topology.
5. How many links are there for N nodes in the mesh topology?
a) 1 b) N(N+1)/2 c) N d) N(N-1)/2
Answer: d
Explanation: There are N(N-1)/2 links for N nodes.
6. Which topology has a central hub?
a) Mesh b) Star c) Bus d) Ring
Answer: b
Explanation: The star topology has a single hub.
7. Which topology has the toughest fault identification?
a) Mesh b) Star c) Bus d) Ring
Answer: c
Explanation: In the bus topology, fault identification is tougher.
8. Ethernet LANs use which topology?
a) Mesh b) Star c) Bus d) Ring
Answer: c
Explanation: Ethernet LANs use bus topology,
9. Which topology uses the token passing algorithm?
a) Mesh b) Star c) Bus d) Ring
Answer: d
Explanation: The ring topology uses the token passing algorithm. The token holder gets its turn at
communication.
10. How many lines are required for the bus topology?
a) N(N-1)/2 b) N c) N+1 d) none of the mentioned
Answer: c
Explanation: N drop lines and 1 bus line.
11. A list of protocols used is known as –
a) protocol access b) protocol stack c) permutation stack d) none of the mentioned
Answer: b
Explanation: A list of the protocols used by a certain system, one protocol per layer, is called a protocol
stack.
12. In order to prevent a fast sender from swamping a slow receiver with data, feedback is often used.
This process is known as-
a) flow control b) multiplexing c) congestion d) none of the mentioned
Answer: a
Explanation: The process defined above is known as Flow Control.
Network Hardware
1. Which is the smallest unit amongst the following with reference to the ATM-
a) transmission path b) virtual path c) virtual circuit d) all are of the same size
Answer: c
Explanation: Virtual circuits are the smallest unit in the above options.
2. IEEE 802.8 is/was –
a) IBM Token Bus b) Integrated Services LAN c) Wireless LAN and Mesh d) Fiber Optic TAG
Answer: d
Explanation: IEEE 802.8 was the Fiber Optic TAG (disbanded).
3. The below figure represents the hidden terminal problem.

a) True b) False
Answer: b
Explanation: The above figure represents the exposed terminal problem.
4. Which of the following was the IBM Token bus?
a) IEEE 802.10 b) IEEE 802.11 c) IEEE 802.1 d) IEEE 802.4
Answer: d
Explanation: The IBM Token bus was IEEE 802.4.
5. What is the function of Network Interface Cards?
a) connects the clients, servers and peripherals to the network through a port
b) allows you to segment a large network into smaller, efficient networks
c) connects networks with different protocols like TCP/IP
d) boost the signal between two cable segments or wireless access points
Answer: a
Explanation: A Network Interface Cards connects the clients, servers and peripherals to the network
through a port.
6. A device which is used to boost the signal between two cable segments or wireless access points is
a) Booster b) Repeater c) Switch d) Router
Answer: c
Explanation: The correct term for such a device is a Repeater.
7. A device that provides a central connection point for cables is –
a) Switch b) Hub c) Gateway d) Proxy Server
Answer: c
Explanation: Such a device is known as a Hub and is usually used in STAR topologies.
8. A device that connects networks with different protocols –
a) Switch b) Hub c) Gateway d) Proxy Server
Answer: c
Explanation: Such a device is known as a Gateway.
9. A device that helps prevent congestion and data collisions –
a) Switch b) Hub c) Gateway d) Proxy Server
Answer: a
Explanation: A switch is a device that splits large networks into smaller segments, decreasing the
number of users sharing the same network resources and bandwidth.
10. A device that is used to connect a number of LANs is –
a) Router b) Repeater c) Bridge d) Switch
Answer: a
Explanation: A device that is used to connect a number of LANs is a Router.
Layers – I
1. If a periodic signal is decomposed into five sine waves with frequencies of 100, 300, 500, 700, and
900 Hz, what is its bandwidth?
a) 2500 Hz b) 900 Hz c) 800 Hz d) can’t be determined with the information given
Answer: c
Explanation: The bandwidth is 900-100 = 800 Hz.
2. Assume we need to download text documents at the rate of 100 pages per second. What is the
required bit rate of the channel?
a) 1.846 Mbps
b) 1.536 Mbps
c) 2.4 Mbps
d) None of the Mentioned
Answer: b
Explanation: Average No, of lines u=in each page = 24
Each line has 80 char.
Each char required 8 bits
100 x 24 x 80 x 8 = 1,536,000=1536 Mbps.
3. A digitized voice channel is made by digitizing a 4-kHz bandwidth analog voice signal. We need to
sample the signal at twice the highest frequency (two samples per hertz). We assume that each
sample requires 8 bits. What is the required bit rate?
a) 64 kbps
b) 32 kbps
c) 128 kbps
d) 16 kbps
Answer: a
Explanation: 2 × 4000 × 8 = 64,000 = 64kbps.
4. What is the bit rate for high-definition TV (HDTV)?
a) 1.4 Gbps b) 2 Gbps c) 1.5 Gbps d) 1.8 Gbps
Answer: c
Explanation:
The HDTV screen is normally a ratio of 16: 9 (in contrast to 4: 3 for regular TV)
There are 1920 by 1080 pixels per screen, and
Screen is renewed 30 times per second.
24-bits represent one color pixel.
Therefore Bit Rate = 1920 × 1080 × 30 × 24 = 1,492992,000 = 1.5 Gbps.
5. A device is sending out data at the rate of 1000 bps. How long does it take to send a file of 100,000
characters?
a) 200s b) 400s c) 600s d) 800s
Answer: d
Explanation: ((100,000 × 8) / 1000) s = 800 s.
6. A file contains 2 million bytes. How long does it take to download this file using a 56-Kbps channel?
a) 1-2 mins b) 5-6 mins c) 2-4 mins d) 7-8 mins
Answer: b
Explanation:
With a 56-Kbps channel, it takes 16,000,000/56,000 = 289 s ≈ 5 minutes.
7. We need to send 265 kbps over a noiseless channel with a bandwidth of 20 kHz. How many signal
levels do we need?
a) 1024 b) 512 c) 256 d) 128
Answer: d
Explanation:
256000 = 2 × 20000 × log L = 6.625.
L = 98.7 Levels.
Since this result is not a power of 2, we need to either increase the number of levels or reduce the bit
rate. If we have 128 levels, the bit rate is 280 kbps.
8. Calculate the theoretical highest bit rate of a regular telephone line. The signal-to-noise ratio is
usually 3162.
a) 34.860 kbps b) 17.40 kbps c) 11.62 kbps d) none of the Mentioned
Answer: a
Explanation: C = B log (1+SNR) = 3000 log (1+3162) = 34,860 bps.
Logarithm here is in terms of base 2.
9. Calculate the theoretical channel capacity. If SNR(dB) = 36 and the channel bandwidth is 2 MHz.
a) 12 Mbps b) 24 Mbps c) 16 Mbps d) 32 Mbps
Answer: b
Explanation: None.
10. A channel has a 1-MHz bandwidth. The SNR for this channel is 63. What is the appropriate bit rate?
a) 4 Mbps b) 6 Mbps c) 8 Mbps d) 12 Mbps
Answer: b
Explanation:
C = Blog_2(1 + SNR) = 10^6 log_2(1 + 63) = 6Mbps.
11. A channel has a 1-MHz bandwidth. The SNR for this channel is 63. What is the appropriate signel
level?
a) 2 b) 8 c) 4 d) 16
Answer: c
Explanation: As a continuation to the previous question where we get the channel capacity as 6 Mbps.
For better performance we choose 4 Mbps. Thus we calculate L from –
4Mbps = 2 x 1 MHz x logL.

12.
What are the bits transmitted for the Unipolar system?
a) 01101 b) 11010 c) 10110 d) 01001
Answer: c
Explanation: High – 1, Low – 0.
Layers – II

1.
What are the bits transmitted for the NRZ-L system?
a) 10001101 b) 01001110 c) 10110001 d) 10001101
Answer: c
Explanation: High – 0, Low -1.

2.
What are the bits transmitted for the return to zero system?
a) 01001 b) 10110 c) 10010 d) 01101
Answer: a
Explanation: First half low – 0, First Half High – 1.

3.
What are the bits transmitted in the differential Manchester coding?
a) 001101 b) 101100 c) 110010 d) 010011
Answer: d
Explanation: -ve to +ve transition – 1 bit, +ve to –ve – 0 bit.
4.
What are the bits transmitted for the AMI and Pseudoternary System?
a) 101101 b) 101100 c) 010010 d) none of the mentioned
Answer: c
Explanation: Pseudoternary Has alternating high and low levels as 0 and neutral level as logic 1.
AMI has Alternating high levels as logic 1 and neutral level as logic 0.
5. Five channels, each with a 100-kHz bandwidth, are to be multiplexed together. What is the
minimum bandwidth of the link if there is a need for a guard band of 10 kHz between the channels to
prevent interference?
a) 4600 kHz b) 500 kHz c) 540 kHz d) 580 kHz
Answer: c
Explanation: For five channels, we need at least four guard bands. This means that the required
bandwidth is at least 5 × 100 + 4 × 10 = 540 kHz.
6. Find the checksum byte for the fallowing data words: 10110011, 10101011, 01011010, 11010101
a) 10001101 b) 01110010 c) 10110101 d) 01110010
Answer: a
Explanation: Do binary addition to compute the result.
7. Generate the CRC codeword for the message x3+1 using the generator polynomial x3+x+1.
a) 1001101 b) 1001001 c) 1001110 d) 1001111
Answer: c
Explanation: M(x) = 1001. G(x) = 1011.
x3*M(x) = 1001000.
On Dividing we get remainder as 110. Therefore, Codeword is 1001110.
8. Generate the CRC codeword for the data word 1101011011 using generator 10011. Also write both
in the polynomial form.
a) 11010110110011 b) 11010110110110 c) 11010110111100 d) 11010110111110
Answer: d
Explanation: Solve using polynomial division and then appending the remainder to the divisor.
9. What is the hamming distance between these 2 codes: 10010010 and 11011001?
a) 3 b) 4 c) 6 d) 2
Answer: b
Explanation: Hamming distance is number of dissimilar bits between 2 streams.
10. What is the hamming code for the data: 1001101?
a) 10011100101 b) 11010000101 c) 10001100101 d) 11111001011
Answer: a
Explanation:Find the 1st 2nd 4th and 8th bits using the hamming algorithm and thus proceed to get
the hamming code.
11. 10010100101 is the code received. Find the error bit.
a) 7 b) 5 c) 2 d) 3
Answer: a
Explanation: Error occurs in bit 7 and can be found via hamming code.
12. The channel capacity is 100Mbps, the frame length is 10000 bits and the arrival rate is 5000
frames/sec. Calculate the mean time delay.
a) 400 µsec b) 20 msec c) 2000 µsec d) 200 µsec
Answer: d
Explanation: T = 200 µsec from T= 1/(μC-λ).
Layers – III

1. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the
requirement to make this frame collision-free?
a) 2msec b) 4msec c) 2sec d) 4sec
Answer: a
Explanation: Average frame transmission time
Tfr = 200 bits/200 kbps or 1 ms
Vulnerable time = 2x Tfr = 2 × 1 ms = 2 ms.
2. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the
throughput if the system (all stations together) produces 1000 frames per second?
a) 150 frames b) 80 frames c) 135 frames d) 96 frames
Answer: c
Explanation: Frame transmission time
Tfr= 200/200 kbps or 1 ms.
If the system creates 1000 frames per second, or 1 frame
per millisecond, then G = 1
S = G × e−2G = 0.135 (13.5 percent)
This means that,
Throughput =1000 × 0.135 = 135 frames.
3. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the
throughput if the system (all stations together) produces 500 frames per second?
a) 146 frames b) 92 frames c) 38 frames d) 156 frames
Answer: b
Explanation: If the system creates 500 frames per second, or 1/2 frames per millisecond.
Then G = 1/2.
S = G × e−2G = 0.184 (18.4 percent)
This means that
Throughput = 500 × 0.184 = 92
Only 92 frames out of 500 will probably survive
This is the maximum throughput case, percentage-wise.
4. A pure ALOHA network transmits 200-bit frames on a shared channel of 200 kbps. What is the
throughput if the system (all stations together) produces 250 frames per second?
a) 38 frames b) 48 frames c) 96 frames d) 126 frames
Answer: a
Explanation: If the system creates 250 frames per second, or 1/4 frames per millisecond, then G = ¼.
S = G × e−2G = 0.152 (15.2 percent).
This means that
Throughput = 250 × 0.152 = 38.
Only 38 frames out of 250 will probably survive.
5. A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200-kbps
bandwidth. Find the throughput if the system (all stations together) produces 1000 frames per second.
a) 92 frames b) 368 frames c) 276 frames d) 151 frames
Answer: b
Explanation: G =1 S=G×e−G=0.368 (36.8%)
Throughput = 1000 × 0.0368 = 368 frames.
6. A slotted ALOHA network transmits 200-bit frames using a shared channel with a 200-kbps
bandwidth. Find the throughput if the system (all stations together) produces 500 frames per second.
a) 92 frames b) 368 frames c) 276 frames d) 151 frames
Answer: d
Explanation: G=1/2 S = G × e−G = 0.303 (30.3 percent)
Throughput is 500 × 0.0303 = 151.
7. A network using CSMA/CD has a bandwidth of 10 Mbps. If the maximum propagation time (including
the delays in the devices and ignoring the time needed to send a jamming signal, as we see later) is
25.6 μs, what is the minimum size of the frame?
a) 128 bytes b) 32 bytes c) 16 bytes d) 64 bytes
Answer: d
Explanation: The minimum frame transmission time is Tfr = 2 × Tp = 51.2 μs. This means, in the
worst case, a station needs to transmit for a period of 51.2 μs to detect the collision.
The minimum size of the frame is 10 Mbps × 51.2 μs = 512 bits or 64 bytes. This is actually the
minimum size of the frame for Standard Ethernet.
8. In collision free protocol channel efficiency is given by-
a) d/(d + log2(N)) b) d*(d + log2(N)) c) log2(N) d) (d + log2(N))
Answer: a
Explanation: In collision free protocol channel efficiency is given by d/(d + log2(N)).

9.
Find the distance from source A to destination D using Dijkstra algorithm.
a) 10 b) 11 c) 12 d) 14
Answer: a
Explanation:
The shortest path form A to D is ABEFHD and distance is 10.

10.
Find the distance from source A to destination D using Dijkstra algorithm.
a) A-B-C-J-D-K b) A-B-C-G-H-D-K c) A-E-D-K d) A-E-G-H-D-K
Answer: a
Explanation:
Shortest path is : A-E-G-H-D-K and the distance is 5 units.
11. After performing bit stuffing on the following stream : 01101111111111111110010, the output is-
a) 01101111101111101111100010
b) 01101111111111111110010111
c) 10010000000000000000001101
d) 01101111111111111111110010
View Answer
Answer: a
Explanation: Bit stuffing involves adding a 0 after every five 1s during transmission.
TCP/IP and OSI Reference Model
1. In terms of the size of the network the correct order (ascending) is –
a) PAN, MAN, LAN, WAN b) LAN, MAN, WAN, PAN
c) PAN, LAN, MAN, WAN d) LAN, PAN, MAN, WAN
Answer: c
Explanation: Personal Area Network, Local Area Network, Metropolitan Area Network, Wide Area
Network is the correct order in terms of size of the network from smallest to largest.
2. How many layers are there in the OSI reference model?
a) 4 b) 5 c) 6 d) 7
Answer: d
Explanation: The 7 layers are : Physical Layer, Data Link Layer, Network Layer, Transport Layer,
Session Layer, Presentation Layer, Application Layer.
3. Logical Addressing and Routing are functions of which layer?
a) Physical Layer b) Transport Layer c) Data Link Layer d) Network Layer
Answer: d
Explanation: . Logical Addressing and Routing are functions of the Network Layer.
4. Flow Control and Error Control are functions of which layer?
a) Physical Layer b) Application Layer c) Data Link Layer d) Network Layer
Answer: c
Explanation: Flow Control and Error Control are functions of the Data Link Layer.
5. Dialog Control and Synchronization are function of which layer?
a) Presentation Layer b) Application Layer c) Session Layer d) Data Link Layer
Answer: c
Explanation: Dialog Control and Synchronization are function of the Session Layer.
6.Encryption and Compression are functions of which OSI layer?
a) Presentation Layer b) Application Layer c) Session Layer d) Data Link Layer
Answer: a
Explanation: Encryption and Compression are functions of the Presentation Layer.
7. File, Transfer, Access and Management (FTAM) is a function of which layer ?
a) Presentation Layer b) Application Layer c) Session Layer d) Data Link Layer
Answer: b
Explanation: FTAM is an Application Layer function.
8. How many layers are present in the TCP/IP Reference model?
a) 6 b) 7 c) 5 d) 4
Answer: d
Explanation: There are 4 layers in the TCP/IP reference model : Link, Internet, Transport and
Application.
2. SMTP stands for ________
a) Service Message Transmission Permission b) Secure Message Transfer Protocol
c) Simple Mail Transfer Protocol d) Simple Message Transfer Protocol
Answer: c
Explanation: SMTP stands for Simple Mail Transfer Protocol.
3. UDP stands for ________
a) User Datagram Protocol b) Used Data Protocol
c) Unified Definition Protocol d) Undefined Diagnostic Protocol
Answer: a
Explanation: UDP stands for User Datagram Protocol.
4. ICMP stands for ________
a) Internal Control Message Protocol b) Internet Cipher Mail Protocol
c) Internal Cipher Mail Protocol d) Internet Control Message Protocol
Answer: d
Explanation: ICMP stands for Internet Control Message Protocol.
5. SONET stands for ________
a) Secure Offline Network b) Synchronous Optical Network
c) Service Offline Network d) Secure Optical Netwrok
Answer: b
Explanation: SONET stands for Synchronous Optical Network.
6. DSL stands for ________
a) Data Storage Line b) Digital Subscriber Line
c) Data Service Language d) Data Secure Language
Answer: b
Explanation: DSL stands for Digital Subscriber Line.
7. Which of the following does not lie in the Application Layer of the TCP/IP Model?
a) HTTP b) SMTP c) RTP d) UDP
Answer: d
Explanation: UDP lies in the Transport layer.
8. Which one of these does not lie in the Link Layer of the TCP/IP Model?
a) DSL b) IP c) SONET d) 802.11
Answer: b
Explanation: IP (Internet Protocol) is a member of the Internet layer.
9. Which of these is a connection oriented service?
a) X.25 b) Frame Relay c) ATM d) All of the mentioned
Answer: d
Explanation: All the mentioned are connection oriented services.