POSTAL ite mete LS Computer Science & IT Objective Practice Sets Computer Netw: Contents | | | su top page. | eee . [Bee eeacssie “| Lo 2 oe 2 | ae a 7. Network Securty 31 | | w MADE ERSY at titute for 1, GATE'S PSUs MADEEASY — Ste For Scaons ony ~eee ee aT Networking Fundamentals and Cro layer of OS! Group-2 Physical layer Data link layer Network layer Application layer hope BcoD @123 4 2 2 3 3 @ass82 @1 33 4 Match the following groups Group-1 Group-2 A. Link 1. Message B. Network 2. Segment C. Application 3. Datagram D. Transport 4, Frame Codes: ABcoD (ie ge @4 3214 (4 3 12 laa a which connects dissimilar LANs of different topologies using different sets of communication protocols so that information can flow from one ta another is called (@) Router (b) Bridge (©) Gateway (@) Switch Which of the folowing device is used to connect multiple devices to @ network and does not stop broadcast trafic? (@) Switch (b) Hub (©) Modem (0) Reg Physical Layer Match List-l with Listll and select the correct answer using the codes given below the list: List-1 ‘A. Route Determination B. FlowContro! C. Interface to transmission media D. Access forthe end user List-tl 1. Data link and transport layer 2. Network layer 3. Appi 4, Physi Codes: A 8 CD a 8 7A Bo ae 2 1 4 3 Which of the following is not rue? (a) Ring topology of N-devices contains (N 1) Gropline and N-Ring cables, (0) Bus toooiogy of N-devices needs 1 dropline and N-Backbone cables. (0) Star topology of N-devices contains N + 1 links and N-ports, (d) Ail of these Match the following: List-1 \ ‘A. Protocol converter B. Passive device C. tis pure electronic device with no software D. Retransmits the data with high signal without interpreting Pure electronic device but associated with software F. Active device used to connect multiple LANS with ftering and forwarding as main design criteria G. Combination of bridge and routerG3 MADE EAsY List-tl 1. Gateway 2. Brouter 3. Router 4. Bridge 5. Switch 6. Repeater 7. Hub Codes: A @ ) © @ Consider the fallowing statements regarding OSI mode! () It divides the network communication into smaller and simpler components, aiding component development, design and troubleshooting, (i) It allows multipie-vendor development through standardization of network ‘components. (ii) It prevents the changes in one layer from affecting the other layers, allowing for quicker development (iv) It usually do not correspond exactly to the protocol stack running on an actual system. Which of the above are true? (a) (i) &(iv)only ——(b) (il) and (ii) only (©) (il) &livyonly (@) Allof these havi aang soooo Esa) ‘The best effort delivery services such as an IP does not include (@) error checking (b) datagram acknowledgment (©) errorcorrection (6) Allof the above 10. Theetficiency of Ethernet (@) increases when propagation delay and transmission delays are low. (0) increases when propagation detay is low and transmission delay is high. (c) increases when propagation delay is high and transmission delay is low. wonwmadeeasy.in SB Postal Study Course BIE] 1 12, 13, 14. IDE EASY ‘Computer Network | (@) increases when propagation delay and transmission delays are high, Match column Awith column B Column-A Column-B ‘A. ONS 1. Port-20 B. POPS 2. Port-21 C. FIP(Data) 3. Port-53 D. FIP(Control) 4. Port- 110 5. Pot-69 Codes: A B CD f@ 3 4 2 1 (bt) 3 4 1 2 @ 3 5 4 2 @ 3 5 2 4 Considered the following router with three sub networks Caras ie ae) Ce) ‘Suppose if above network uses class Cnetwork Tobe 180 te ind reset nh vod sre dopatrenPesuven!wonesare network]. (2 BS82562550 28556286108 (9 assass.an 020 esos In CIDR, if 1P address is used 192.60.128.0/22. Then find the net mask? (@) 255.255.255.0 (pb) 255.256.2520 (c) 255.255.255.128 (d) 255.255.128.0 Match the following List-1 (Packets) Source P Destination 1? ‘A. [Data [250:256:255.255 Source IP Destination 2221.23.24 | 256.256 256 256| 8. [bao unan | mam Destination IF c. [baa Objective Practice Sets15. 16. 17. 18. 19, 20. is} Computer Science & IT List 1. Unicast packet within network 2. This packet never exists 3. Limited broadcasting Codes: A BC @ 1 2 3 2 3 4 © 3 1 2 @2 1 3 ‘To form superneting (@) Allthe network should be contigous (0) Size of allnetwork should be same (in power of2) (©) 1st Network 1D is divisible by sir of all network (@) Allotthe above Which classful subnet mask is useful for need of subnet a network that has § subnets, each with at least 20 hosts. (@) 255.255.255.182 (b) 255.255.255.248, (©) 255.255.256.240 (d) 255.255.255.224 Ona class network, total number of subnets are available with a subnet mask of 240. ‘A Network that is 172.28.0.0 and would lke to ‘support 650 hosts per subnet. The subnet mask should we use is 255.255. and __? 32 bit IP address containing all 1's represent (@) this computer (b) directed broadcast (©) loopback ——(d) limited broadcast The router connecting a company’s network to the internet applies the mask 255.255.255.192 to the destination address of incoming IP packets. I ane of the incoming packet has a destination address of 154.33.7.220, then find the network ID, subnet bits and host ID bits of Incoming packets respectively (@) 154.337, 11,011100 (©) 154.33, 11000000, 011100 (©) 184.33, 0000011111, 011100 (@) 154.337, 011111, 011100 Postal Study Course ERIE] at 22. 23. 24, 25. 26. (amape easy [3 MADE EAsy Ione of the address of a block is 210.69.92.39/ 26, then find the last host of the 2° last subnet, where the addresses are referredin lexicographic order. (2) 210.69.92,127/26 (b) 210.69.92.192126 (c) 210.69.92.191/26 (d) 210.69.92.254)26 Consider the address: 141.14.196.46 and subnet mask 255.255.192,0. Whatare the subnet ID and HOSTID. (@) 141.14.192.0and 141.14.4.46 (0) 141.14.4.46and 141.14.192.0 (€) 255.255. 192.0 and 255.255.4.46 (@) None of these ‘An organization is assigned a biock of 2048 contiguous address starting at address 128.211.160.0 and highest address 128.211.191.258. Which of the following represents the CIDR (Classless Inter Domain Routing) (@) 128.211.168.0/11 (0) 128.211.160.012 (©) 128.211.160.019 (a) 128.211.175.255/21 There are three IP addresses as given below: X= 202.23.14.160 Y= 168.19.200.12 2=72.19262.210 \Wnich of the folowing stalementsislare correct? (@) Xis Class A, Yis Class Band Zis Class C (b) Xis Class ©, Yis Class A and Zis Class 8 (6) Xis Class C, Yis Class B and Zis Class A (@) Xis Class A, Vis Class C and Zis Class 8 Ina class A subnet, we know the IP address of ‘one of the hosts and the mask as given below: IP address = 25.34.1256 Mask = 255.255.0.0 What isthe first address (network address)? (a) 2534.120 (0) 25.94.1256 (c) 2534.00 (@ 25000 In aclass 6 subnet, we know the IP address of ‘one host and the mask as given below: IP address = 125.134.112.66 Mask = 255.255.224.0GQMADE EASY PEs Computer Network | What isthe first address (Network address)? (@) 200.200.200.64/255.255 255.192 (@) 125.134.9680 — (b) 125.134.1120 200,200.20. 128/255 .255.255.192 (©) 125.134.112.66 (d) 125.134.00 200.200.200.321255.255 255.224 200.200.200.16/255.255 255.240 (©) 200,200,200. 128/255.255.255.128 200,200.20. 192/255 .255,255.128 200,200.20. 192/255.255.255.224 27. Foractass C networkif IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the first host of first subnet (represent last octet) is 200,200.200.240/255.255.255.240 28. Which of following IPs may belong to last host (©) 200.200.200.192/255.255.255.128 of any subnetif subnet mask is 255.255.255.224, 200,200,200. 128/255.255.255.192 ( 210.15.1662 (ii) 210.15.16.94 £200.200.200.96/255.255 255.112 (ii) 210.15.16.127 (i) 210.18.16.191 200,200.20. 102/255.255.255.240 (@) (iand(i) ——(b) (ana (i) (@) 200.200.200.128/255.255,255.128 © (ivand(v) (©) (ai) and (iv) £200.200.200.192/255.255 255.128 200.200.200.64/255.255 255.192 29. A network is determined by the subnet ID £200.200,200.208/255.255,255.208 194,96.51.64 and a 26 bit net mask. How many hosts are addressable inthe provided network? 92. Let Xand be the number of 1's in the binary notation of network ID and Direct Broadcast 30. Inanetwork that has a maximum packet size of ‘Address (DBA) respectively for the IP address 600 bytes, a maximum packet lifetime of 30s, 200.25.80.117 (classfull address). The value of and an 8-bt packet sequence number, what is 4Y2 is the maximum data rate (in bps) per connection? 33. _Inthenetwork 251.12,10.110/28, the Fourth octal 31. A company has class C network address of of max IP address of the network which cannot 200.200.2000. Itwishes tohave four subnet. Two bbe assigned to a host is subnets with 60 hosts one with 20 hosts and with 10 hosts each. Which ofthe following option respect to a feasible set of subnat address and subnet mask pairs? EEEIZIER Networking Fundamentals and Physical Layer 1 @203 04 05 @ 6 @ 7 @ 8 @®@ % @ 10. (6) 11. (b) 12 (b) 13.) 14 &) 15. @ 17, &) 19. @ 20. © 24. (c) 22. (@) 23. (0) 24. (©) 25. () 26. @ 28. @ 31. (a) EESnieeu Networking Fundamentals and Physical Layer 1. (a) 2. (e) Hub works in physical layer Link layer unit of data is frame Bridge works in data link layer Network layer unit of data is datagram Router works in network layer Application layer unit of data is message PC, Server works in application layer. ‘Transport layer unit of data is segment ‘Note: Network layer can use the term packet it communication is reliable (via TCP) wmwwmadeeasy.in G3MBDE Easy Objective Practice Sets| Computer Science & IT eee 20s] GIMADE EAs 3. (0) simpler components. provides a teaching Gateway is used between two dissimilar LAN', tool to help network administrators converts a data packet from one protocol format understand the communication process to another protocol format used between networking components. 4. (b) (li) OSI model defines the process for connecting two layers together, promoting interoperability between vendors. It allows vendors to compartmentalize their design efforts to ita modular design, which eases Every device in the network connects to hub and broadcasts to all devices connected to the hub ‘whenever any transmission received on any port. 6 t) implementations and simplifies surtonior QD M4 troubleshooting “mee OSI model ensures interoperable technoogy (iv). The data ink layer protocols often include physical layer specifications. The network and transport layer protocols work together to provide a cumulative end-to-end communication service. Allare true, “4s (9) 0 2N pons N= Brep ne 9. @) ad Option (a): Error Checking is only for header part Option (b): There is no acknowledgment for packets reaching the destination. Option (¢): IP has minimal error control and there ack isnoconceptot error correction for IP datagram, Al the options are correct. o ° 10. (b) ia Topoooy — Pe Efficiency of Ethemet = T6.40a oO Ont ine Propogation delay ( a page y (tp) a Transmission delay (,) Since ais in denominator its value should be low ao in order to get high ficiency, Only gateway can connect to network with 12. (b) different protocols wine tt Passive device: They do not have any (Gisassass [5 inteligence and they can just forward data [ww 3. ‘aio ()_ OSimodel reduces complexity by breaking Subnet maskis: 255.255.255.128 network communication into smaller and (J Objective Practice Sets Gj MBDE EASY www.madeeasy.inG3 MADE EASY 13. (b) 22-bits are used for network portion Net mask = 255.255.2520 14. (b) 21. Packet A: The source IP contain direct broad cast address and wenever use direct broadcast address in source IP. It is always used in destination IP. Hence packet A never exists. Packet B: If destination IP address contain all 1's then it broadcasts within same network (Limited Broadcasting). Packet C: itis a unicast packet within the same network as network ID 24.0.0.0s same for both source and destination IP, 18. (d) 255.255.255.224 provides 0 subnet, each with 30 hosts. So this is useful 16. (240) = 11110009 [in Binary] So total No of subjet possible = 24-2 = 14. 2is deducted becuase one for networkid and other for broadcast. 18. (252 &0) Itis class 8 IP So No of host = 2" 2 = 600 S02" = 602, n = 10 [approx] Hence subnet mask: 255.255.252.0, 19. (d) In 32 bit IP addressing scheme all 1's represent limited broadcast, 23. 24, 20. (c) IP Addr: 184.93.7.220 Mask : 255.255.255.192 [apply SITWISE AND} +40011010..00010001 . 00000111. 11000000 220:111 011100 Q9MADE EASY www.madeeasy.in Postal Study Course UE] 22. Computer Network | 7 Destination address is of class B network. Therefore Network ID is 184.33 and as per mask we can say that 10 bits are used for subnetting and remaining are host bits, «. Subnet ID bits are 0000011111 and Host ID bits are 011100. () 210.69.92. 00100111 gebis 1 ‘subnet bs = 2"Lastsubnet " 2210.6992.10 000 000 +0.900 001 210.6092.10 111 11 = 210.69.92.191 (a) 141.14.196.46 441.14,11000100.00101110 ‘Subnet mask 255.255, 110000000.00000000 Subnet ID: 141.14.192.0 Host ID: 141.14.4.46 (c) Lowest 128.211.160.0 10000000. 11010011.10100000.00000000 Highest 128.211.191.255 }0000000.11010011.10111911.11111111 So here = 32-13 = 19 (c) In IP addresses class A, 8, and C used for general purpose, Range of class A: 1.0.0.0 to 12.255.255,255 Range of class B: 128.0.0.0 to 191.255.255.255 Range of class C: 192.0.0.0 to 223.255.255.255 Hence option (o} is correct, Objeive Pracce Sets25. 26. 27. 28. 29. Computer Sclence& 17 EMMI) 63 MADE EAsy tc) Mask = 11111111.11111111,00000000.00000000 IP Address = 00011001.00100010.00001 100.0011 1000 Taking Bitwise AND = 00071007,007000"0,00000000,00000000 le. 25.34.00, (a) Subnet Mask = 11111111.11111111.11100000.00000000 IP Address = 01111101.10000110.01110000.010000" Taking Bitwise AND= O7717707, 100001 10.07100000,00000000 ive. 125.134.96.0, (33) Computer IP 200.99.39.112 _(200.99.39.01110000) Subnet mask +265,255.255,224 (255.255.255.11100000) 2O0SHSSBE (200.99,39.01100000) (represent 6" subnet) But we have to find fi (@) Subnet maskis 255.255.255.224 () 62 00111110 Last host t subnet with first host that is 200.99.39,00100001 = 200,99.9.83 (i) 94 01011110 Last host (il) 127 = 01111711 ->Direct broadcast address (iv) 191 101 1111 t=»Direct broadoast address (62) 6xbts are used for hosts 28 = 64 diferont hosts. Subnet IO and broadcast address ara reserved 2 64 ~2 = 62 hosts are addressable 30. 31 is} (40960) Within a packet lifetime, the maximum number of data packets can be sent is 2° maximum data rate is 256 + 600 « 8/30 = 40960 bps. (a) First ofall we have, 200,200.200.00000000 Initially, we need two subnets with 60 hosts. ‘subnet 200.200,200.01000000 200.200.200.864 2m4subnet : 200.200.200.10000000 = 200.200.200.128 256, therefore, the Objective Practice Sets MADE EAs TucanC3MADE EASY ESE) Computer Network | These two subnet with subnet mask 33. (111) 255.255.255.192. 251.12.10.110 Now we need one subnet with 20 hosts. Network bits are 28 200.200.200.00100000 = 200.200.200.32 So network mask = 255.255.255.240 ‘This subnet with subnot mask 255.255.255.224 2a = 11110000 one subnet with 10 hosts. 110=01101110 -200.200.200,00010000 = 200.200.200.16 Network 10 ‘Subnet with subnet mask 256.256.255.240, FIRST IP = 251.12,10.97 assignable 82. (820) The IP address 200.25,80.47 belongs to class C LAST IP = 251.12.10.110 assignable network. Therefore network ID is 200.25.80.0 and LAST MOST IP = 251.12.10.111 DBA DBA is 200.25,80.255, Direct broadcast address of network is not The binary representation contains: assigned to any host. 411001000.00001 101.01010000.00000000 = 8 1'sinnetwork ID 11001000.00001 101 01010000.11111111 = 161s is DBA, 2 84 16? = 320 So, 111 can't assigned to any host. wwwmadeeasy.in QgMADE EAsy Objective Practice Setsyi Cro Which of the following statement is FALSE? (a) In Ethernet, each node's physical address 's guaranteed to be globally unique, (b) The single parity check can detect any odd umber of bit errors in a transmitted codeword. (€) In Ethernet, anode wishing to transmit might never be allowad to access the channel. (@) None of these Which of the following statement is incorrect? (@) A reliable data transfer protocol may send multiple packets without waiting for acknowledgements, rather than operating in a stop and wait manner. This technique is called "Pipetining’ (0) A process sends/receives messages to! from the network through a soltware interface called a "Socks (c) Because an HTTP server maintains no information about the clients, an HTTP server said to be "Statefull” (@) The “Traceroute” can be used to determine the number of hops to a destination and the round trip time for each hop. Find the link utilization in stop and wait protaca! if the bandwidth ofthe line is 2x 108 bps, round trip, time is 40 second and the packet size is 1000 bytes. @o (0) 5 () 10 @ 15 Consider a token bucket with maximum Tate R = 20 Mbps. Suppose we want to make sure that the maximum rate can only be sent for almost 5 seconds at atime, and atmost 150 Mb canbe sent over any 10 second window. Compute the required value for the token refresh rate (9in Mbps. Data Link Layer @s () 10 © (a) 20 Consider a link of length 1000 km with 10° bps rate connecting a sender and receiver. Assume a fixed packet length of 1250 bytes and sender always has packets to send. Packets are never lost or corrupted in the connection. Whatis the necessary window size to achieve 100% utilization for a sliding window protocol? ‘Assume signal propagation is 5 ms per km (approximately). (a) 100 (b) 1000 (©) 110 (@ 1100 Given a message "1010001101" and ORC error detecting code uses the polynomials? x44 x21 Find the transmitted message using CRC? (@) 101000110101011 (b) 1010001 10101101 (©) 101000110101110 (a) 1010001011111 Consider a 107 bps link that is 400km long, with ‘a queue large enough to hold 2000 packets, ‘Assume that packets arrive at he queue with an average rate of 4000 packets per second and that the average packet length is 2000 bits, Find the traffic intensity? (@) 02 () 04 © 06 (08 ‘Assume a hypothetical computer networkin which the protocol hierarchy has 10 layer. Ifthe sender sends 200 KB message such that 20% of the network bandwidth is fled with headers. What is the size of the header (in KB)? @s (b) 6 © 10 (9) 15 Consider a 1000 mile link of 1 Mbps capacity (error-free). ithe linkis used by a single sender with a saturated queue sending 1250 byteMADE EASY 10. WW 12. ‘mrwmadecasy.in frames. Assume signal propagation is 5 xs per mile. [1M = 108] Find the link utilization using sliding window protocol with a window size of 7. (a) 25% (0) 50% (o) 75% (©) 100% ‘Suppose that it takes 1 ms to send a packet, ‘and 20ms one-way propagational delay between sender and receiver. The slinding window size = 4. What s the channel utilization. fa) 0.190, (©) 0.024 {e) 0019 (@) 0097 Consider two hosts A and B connected by link of rate” bits/sec. The two hosts are separated. by ‘o meters. Signal can propagate on the link for 'p’ meter during a time period of 1 sec. IF 4 wants to send a video of s bits to 8, then whats the end to end delay ignoring any possible processing and queuing delays? dr+sp Pr _ot-sp nde Br (2) Tendtoers = © Ty 2dr -sp pr or-2sp or (©) Tonata ena = (D) Toraton Identity the true staternents from the following: |. In STOP and WAIT ARQ if the receiver replies with ACK 0, then the sender will send rrext frame with sequence number as 1. NL Physical layer recognizes the frames sent by sender and arranges them in particular order and gives ito layer-2 (Data link layer) IIL. ACK sent by receiver also contains CRC. NM. Stop and wait flow control gives inefficient line utilization for very high data rates over long distance. \.__Insiiding window protocol ACK includes the number of next frames to be send. ostal Study Course FYXE| 13, 14. 15. 16. Qomane Easy Computer Network | 17 (a) Only, 1V (©) I Wand V (©) I tll andiv (@) 1.1, Vonly Which of the following are true? |. maximum window size is Q, then number of sequence bits for SR-ARQ and GEN-ARQ are log,{Q + 1) and log,(20) respectively, Il. The correct order of butter sizes in stop and wait, GBN and SR is: (STOP and Wait) < GBN < (solective repeat) Ill GBN and selective repeat supports both individual and cumulative ACK's, IM. if maximum sequence number is K, then maximum sender's window size in GBN and Ket K selective repeat are and & peat + ; respectively. (@) only Il and lit (6) only | andl I (©) oniy lil and IV. (d) None of these What is the total overhead bits (Headers & Retransmission) with data frames consisting of 40 bit header and 8960 data bits. ACK frames ever occur. NAK frames are 40 bits the error rate (in bits) for frame is 2% and for NAK frame is negligible (upto 2 decimal place)? Imagine a tlow specification that has the maximum packet size 800 bytes, token bucket Tate of 5 x 10° bytes / sec. Token bucket size is 1 million byte and the maximum transmission rate. 10 million bytes / sec. How long cana burst, be send at maximum speed? (@) 04 (b) 0.25 (o) 02 (d) 0.35 Consider GBN protocol in which sender window size (SWS) is 4 and receiver window size (RWS) is 4, Suppose client sends date 0, 1, 2, 3 and only data packet 2is lost and all ACKs are lost. What willbe the contentsin the receiver window batore senders timeout value expires? @ 4,567 (0) 3.4.5.6 ©) 23,45 (d) 2,4,5.6 Objecive Praia Sets ED)17. 18. 19, 20. 21. 22. [SJ Objective Practice Sets | Computer Science & IT Consider two hosts A and B connected by a single link of rater bits/sec. The two hosts are separated by ‘o meters. Signal propagation is ‘p meters per second. Host Ais sending to host Ba packet of size ‘S bits. Propagation delay is denoted by't,” and transmission delay of packet 8 wy, con that f= Zand = 3 Which of the following statement is CORRECT? (@) Attime 1 = f, the first bit is on the link, if boty (b) At time t= ¢,, the first bit has not reached Host &,if ty < ty (¢) Both (a)and(b) (@) Neither (a) nor (b) The message 100100 is to be transmitted by taking the CRC polynomial x3 + x2 + 1 to protect itfrom errors. What must be the message lo be send after appending the CRC to the message? (@) 100100000 (b) 100100001 (©) 100100110 (@) 100100111 Find the link utlization in stop and wait protocol it the bandwidth ofthe line is 2x 10° bps, round trip lime is 40 second and the packet size is 1000 bytes. @o 5s () 10 5 Error detection at the data link layer is achieved by (a) Bit Stuffing (b) Hamming codes (©) Cyclic Redundancy codes (@) Equalization In CRC if the data unit is 100111001 and the divisor is 1011 then what is dividend at the receiver? (@) 100111001101 (© 100111001 (©) 100111001011 (@) 100111001110 CRC can detect all bursts of upto m errors, if generator polynomial Gfx) is of degree (@) One (b) m-1 () m () mst Postal Study Course PLE] 23. 24, 25. 26. 27. (gman Ensy (9MAE EAsy ‘3000 km long trunks used to transmit frames Using @ Go-Back -N protocal . The propagation speed is 6msec/km and trunk data rate is 1.544 Mbps. We ignore the time taken to receive the bits in the acknowledgment. Frame size is 64 bytes. If Go-Back-N protocols used, in order to achieve an efficioncy of 100%, what is the maximum window size at the sender's side? (@) 32 (0) 63 © 10 (@ 219 Achannethas bitrate of {Mbps and propagation delay of 270msec. Frame size is of 125 bytes, ‘Acknowledgment is always piggybacked onto data frames, Four bit sequence number is used. Ignore header size. What is the maximum. achievable channel utilization for Go Back N? (@) 1.48% (b) 0.18% (©) 295% (@) 278% ‘A channel is operating at 5000bps and the propagation delay is 16 ms. What would be the minimum frame size for stop and wait flow contro to get 60% link utilization efficiency? (@) 225 bits (b) 400 bits (©) 480 bits (6) 500bits Host A is sending data to host 8 over a full duplex tink, Aand Bare using the sliding window protocol for flow control. The sender and receiver window sizes are 5 packets each. Data packets (sent only from Ato ) are all 1000 bytes long {and the transmission time for such a packet is, 50s. Acknowledgement packets(sent only from B to A) ate very small and require negligible transmission time. The propagation delay over the link is 200 us, What is the total time required in this ‘communication? (2) 250 sec (©) 275psec (b) 200m sec (@) 450 psec The distance between two stations Mand Nis L kilometers. All frames are K bits long, The propagation delay per kilometer is t seconds, Let A bits/second be the channel capacity, wunwmadeeasy.in[2 MADE ERS ‘Assuming that processing delay is negligible, he minimum number of bits for the sequence ‘number field in a frame for maximum utilization when the sliding window protocol is used, is 09 [on 28224) oy [as o [« aA 6 [oo A=] 28. To provide more reliability than the Single Parity Bittechnique, anew error-detecting scheme has bbeen proposed. The scheme uses fist parity bit for checking all the odd numbered bits and a second party bitfor all the even numbered bits. What i the (rinimum) Hamming distance ofthis cade? 29. Match List-I with List-Il and select the correct, answer using the codes given below the lists: List-1 ‘A. Stop and Wait ARQ B. Go-backNARQ C. Selective repeat ARQ List-II 1. Each frame sent or resent needs a timer, which means that the timer needs to be numbered 2. Ack are sent when data is delivered to network layer. It might be the case that, @ single Ack acknowledges n frames. www.madeeasy.in Postal Study Course BX} 30. 31 S9MADE Easy Computer Network | 12 3. Only2 sequence number used and sender window size is 1. 4, Noaction performed by the received til the desired frame is obtained, Codes: A BC @ 3 1 2 o 3 2 4 @ 3 4 1 @ 2 1 4 In selective repeat (A) protocol the sender window size is K frames. The number of sequence bits required for the communication to take place is given by (@) log, (K+ 1) (&) 1 +l0g,(K) (©) 1 +109,(2h) (6) None of these Station A needs to send a message consisting of 10 packets to station Busing a sliding window of size 4, All packets are ready and can be transferred immediately. Selective repeat and GBN are used at2 different times and every 5th packet get lost for both protocols, (ACK's from B never gets lost). Let x and y be the number of transmissions that A has to make in selective repeat and GBN respectively to ensure safe delivery to B. Then x+y 2 ‘jaca Pai Ses| Computer Science & IT Eres) GIMACE EASY FEEIIE Date tink Layer 1 @2 83 © & & 5 10. (d) 11. @ 12 () 13 @ 15. 20. (c) 21. &) 22 (0) 23. (©) 24. 30. (0) EEE ov ink tayer 1. (d) Option (a), (b) and (c) are true statements. 2. (c) Options (a), (b) and (a) are correct staterents HTTP server maintains no information about clients, such HTTP server is said to be Stateless. Option (c)is incorrect statement 3. (0) Throughput for stop and wait is given by one window per RTT packet _ 1000xé bits r 1000%8 bis _ 209 bps RIT 40 second : = 200 PPS 100 = 10% 2x10? bps 4. (b) If we send maximum rate for 5 seconds, = 20 Mbps x 5 seconds = 100 Mb can be send ‘Atmost 150 Mb can be sent over any 10 seconds window, Therefore in remaining 5 seconds: 150 Mb ~ 100 Mb = 50 Mb can be send S0Mb Token refresh rate (1) = =———= 10Mb foken refresh rato () = ==> ps 5. (b) To achieve maximum throughout U=t = Ww iat Bee 1250x856 _ 9.94 ms, (EA ovjective Practice sets (b) © (9) 6 © 7 @ & @ % 16. (©) 17. (0) 18 6) 19. (0) 25. (2) 26. (d) 27. (©) 29. (} yep = Sut perkm x 1000 = 5 msec oor+2x5 _ 10.01 We SOLER 1001. 1000 () ‘M= 1010001101 Po Sa xtes@+1= 110101 rea “0019 CRC = 01110 Transmitted message = 101000110101110, @ Traffic intensity (i) Arrival rate (bps) ink bandwidth (bps) = 4000 packets/sec x 2000 bits/packet _ 10" bps 08 tion network bandwidth filled with headers = 20% = 1/5 ie Le —10xheadersize * 5 200KB+10xheader_size 200 kB + 10 x Header_size = 50 x Header size 200 KB = 40x Header_size Header_size = 5 kB MADE EASY ‘wirmmadeeasy.inMADE EASY 9. (d) Ht UWdeans) > (2% forop + brans)] then “"U= 100% else Whi Bp tears 7x10 msec = 70 msec hop hans = 2% (Sms) + 10 msec = 20 msec ‘Us 100% (70> 20) 10. (a) Link utlization = Hence N= 4 1, = 20ms 1ms 4 44 = i 097 OG a 11. (a) Since we are ignoring processing and Queueing delays Tonto ons = Toropagatondtay + Tranrieson etsy 9,8 _ dresp pit” pr 12. (c) Tis wrong because iframe 0 is sent then receiver will send ACK-1 for requesting frame 1 is wrong because physical layer only transmits and receives bits. DLL recognizes the frames. 13, @) Allthe statements are fase + if max window size is, then number of sequence bits for GBN ARG is log, (Q + 1) and for SR ARQ is log, (20). * Stop and wait < selective repeat < GBN is the correct order for butter sizes. AAs sender's window size is highest in GBN for a particular number of sequence bits * GBN supports both individual and cumulative, but SR supports only individual ACK. www.madeeasy.in Postal Study Course ERIE] 14, 15, 16. 17. 18. 19. (gmaoe easy ‘Computer Network | + If maximum sequence number is 'K” maximum senders windows size for GBN is K+ 1 and for selective repeat is (K+1)/2 (120.80) ‘The number of retransmissions per frame is 2% ie,, 0.02, Each good frame wastes 40 header bits plus 2% of 4000 bits (retransmission), plus two 40 bit NAK once every 100 frames. The total overhead = 40 + 2x 40 +2 0.4 = 1208bits (ce) M-P Where © Capacity oftoken bucket Token generation rato ‘M : Maximum data rate of token bucket t= time for which token bucket can send the data with maximum data Co Ox tO" byes e005 1 byl ae t zl 0.2sec © ‘Sender window initially {o 4[s[e[7] When 2 is lost then timer expires and window becomes bifelllsfelr (c) The first bit is on the link iff, > f, and the first bithas reached host Bif f, < f, (b) © CRC polynomial is the divisor and the message is dividend. The remainder is added to the message and then itis sent. © CRCis always number of bits in divisor ~1 (c) ‘Throughput for stop and wait is given by one window per RTT Objective Praia Sets5 | Computer Science & IT 20. 21. 22. 23. Objective Practice Sts packet _1000x8 bits RIT ~ 40 second es 2 BOLTS) a50h6 2x10" bps (c) Error detection at data link layer is achieved by CRC. ) son goers 0104 |) ‘ooo | ior ‘01 e000 ono t 0000 2000!) 0004 coo Soot coaat 0100 200 000 ii DOH Remainder So divident at reciver en: (©) (CRC guarantees that all burst error of ength equal to the degree of the polynomials are detected and also burst eros affecting an odd number of bits are detected 100111001011 (©) For sliding window protocol with Go-Back-N Datarate = 1.544Mbos Frame size = 64 bytes = 64 x 8 bits = 512 bits Propagation speed = 6 x 10-® s/km Distance = 3000 km 121, Ta= 3000 x6 x 10° sec 512 bits se rnsoe "= [544 Mops : Gamat Postal Study Course PTE GgmApe Easy E Wx0.33 342x718 36.33 = We a 033 Window size = 110 24, (a) Datarate = 1 Mbps T,= 270msec Fe 125 bytes = 125 x 8 bits 1000 bits : _ 1000 bits Transmission tine (7) = “Trine = 1000 x 10° sec = 1 ms Four bit sequence number For Go-back-N, W= 16-1 1515 T3540 ~ 52; 00777 u=278% 25. (a) For stop and wait Data rate r= 6000 bps Propagationdelay Tp= 15mseo Frame size = 06= = 06 = F= 205 bits 26. (d) Given, Window size n = 5 packets Packets size = 1000 byte = 2° bits Total packet size = 5 x 1000 = 5000 bytes Total time = (Transmission + Propagation) time = 5x 50 + 200 usec = 450 usec Easy ‘wuwmadeeasy.inMADE EASY [RRS 2078] Computer Network 27. (c) 30. (b) Frame size Kit long In SR protocol both sender and receiver willhave Propagation delay tsecikm same window size (K in this case). Channel capacity = Rbits/sec :. Total sequence bits are log, (K+ K) = log, (2K) =log,2 + log, K = 1 + log, K. wK sec WK sec ue Re 72 at. (31) K ; K+2UR sec + 2Ut In BLT time, only 4 (window size) frames can o e bbe transmitted in sliding window protocol we Ke2uin K+ 200R SELECTIVE REPEAT con K K 9Pecets nave tae ert Peis cena mE 28. (2) Although the first parity bit can detect odd- numbered bits and the second parity bit can detect even-numbered bits, this coding scheme can only datect ALL single error for sure, thatis, d= 1, Therefore, the Hamming distance is d+1=2. Although it can sometimes dete 2errors (one even-numbered, one odd- numbered), it cannot detect all the 2 errors. 29. (c) In Selective repeat ARQ : Each frame sont or resent needs a timer, which means that the timer needs to be numbered. In Go-back N ARQ : No action performed by ‘2 anariasen the receiver ithe desited ames obtained | In Selective repeat ARQ : Ack are sent when w}-—— data is delivered to network layer. It might be the case that, a single Ack acknowledges n frames. In Stop and Wait ARQ : Only 2 sequence number used and sender window size is 1 TEE (gman ensy Objective Practice SetsCro Match List-1 (Device) with List! (Operating Layer) and select the correct answer using the codes given below the lists List Listl ‘A. Repeater 1. Physical layer B. Bridge 2. Datalink layer C. Gateway 8, Network layer D. Router 4, Alllayers Codes A B cD O 0 6 6 4 2 4 1 3 @ 1 2 4 3 (Geo Consider two nodes A and B on the same ethemet segment, and suppose the propagation delay between the two nodes is 225 bit times. Suppose at time both nodes A and B begin 1o transmit a frame, Assume that both nodes transmit a 50-bit jam signal after detecting @ callsion For 107 bits per set ethernet, find the time at vwhich both nodes Aand Bsense an idle channel? {inmicro seconds] (a) 22ys (b) 27s (©) 50ns (€) 55 us In Pepersistent CSMA network there are § systems in a slot. The probability of station not transmitting the data is 0.6. Only two stations should transmit the data to avoid collision, What isthe probability that channel is colision ree? Consider nodes in slotted-aloha transmitin each slot with probability P = 0.25. Suppose that a given channel has exactly 8 nodes, What is the probability there is a collision in a given slot___? [upto three decimal) MAC Sub-Layer Consider a 1 Mbps ethernet and find the throughput for sloted aloha at G = 2 (channel load) in Kops. In shared ethernet link, each user is active only 10% of the time, Suppose packet switching is used for 10 users and each useris equally ikely to transmit at any point of time. The probably p that at any given time exactly 8 users are transmitting simultaneously. What is the value of 10 xp? In synchronous transmission, 5 eight bit characters are included in 20 eight bit information characters. If bitrate of sender is 4200 bits/sec, what is the bit rate of receiver (in bits per sec)? Which of the following are true? |. Inetheret, ifthe node transmission rate is increased while all ther parameters are held constant then throughput increases. Ul, ‘The IEEE 802.2 LLC protocol is spectic to the technology being used in a particular broadcast LAN, and therefore must be defined separately for ethernet, token ring, ete UL, Bandividtn is the maximum throughput ofthe channel (@) Only land ill (6) Allof I Il, and It (©) Only i (@) Allare False Suppose that 2N ethernet stations are trying to send the frame, at the same time requires N2 slot time to sort out, who will transmit next Assume that the average packet transmission time's 10 slots. Express the utlization of ethernet in terms of W. 10 20 10+2N, O ©) So+2N(2 MADE EASY 20 20+N © 10. Fora standard Ethernet bandwidth is 10 Mbps the minimum frame size should be 64 bytes. To support CSMAJCD, Transmission Time is twice of Propagation Delay. In fast Ethernet, what will be the length of cable to support same frame size of 64 bytes, i Lis length of cable in standard Ethernet? f@) 104 (b) 5k (© Lito @ Lis 11. Which of the following statement is false to deploya router? (@) The LANs interconnected must belong to different networks. (©) The Ethernet interface and the LAN must belong to the same network. (@) The Routers sharing the same link must belong to the same network. (0) Allthe interfaces of the router mu: tosame network. elong 12. If the data rate of ring is 20 Mbps, signal propagation speed is 200 bius, then the number of bits that can be placed on the channel of 200 km is (ESE mac sub-Layer 1 @ 2 © 8 @ 9% © 10, ESE ec sub-tayer 1. (0) Repeater ~ Physical layer Bridge - Data link layer Gateway — All layers Router Network layer 2. (c) Step 1: Both nodes detect a collision at time 225, Step 2: Jam signal has 50-bit Both nodes stop transmits their jam signal at the lime t= 225 + 50 = 275 wuwmadeeasy.in Postal Study Course BTXE| 13, 14, 16. 16 © (mabe Easy Computer Network | 1 (@) 2,000 its © 1.000 bits (b) 20,000 bits (d) none of these A group of N stations share 60 Kbps siotted ALOHA channel. Each station outputs a S00bits frame on an average of once 5000 ms, even if previous one has not been sent, What is the maximum value of N? (@) 184stations_(b) 368 stations (©) 412stations —(d) 450 stations CSMAICD LAN of 1 Gpbs is to be designed over 100 m cable without repeater. What is the minimum frame size that Data Linked Layer should consider if cable support signal speed of 200000 Km/sec? ‘A group of some stations share a 56 kbps pure ALOHA channel. Each of these stations output a +1000 bits frame on an average of one every 100, seconds, even ifthe previous one not yet been, sent, Efficiency of pure ALOHA is 18.4%, What ‘would be the maximum number of stations? > ‘esuopor coh 00 tansmisi * (5) ( equal to double the propagation tr the length of cable (in meters) u Ethernet if bandwidth = 100 x 108 uy size = 64 bytes velocity = 2 x 10° m/sec to support GSMA CD 11. @) 12. ) 13. @ Step 3: The last bit of the jam signal from B arrives at A after 225 bit times, so 275 + 225 = 500, (Similaty, the last bit of the jam signal from A arrives at Batter 225 bit times, 80 275 + 22 500 bit times) ‘At500 bit times, both sense an idle channel. For 107 bps ethenet, the time taken for 500 bits: S00 bits 10’ bits/sec 0 sec Objeaive Paco Stk| Computer Science & IT 3. (0.3456) P(of2 stations) = 50, Pirsamitna) * Prctvarenaing” = 50, (0.4)7(0.6)* = 100.16 x0.216 = 0.3458 4. (0.632) ‘Acollsion occours with probability 1 unlesseither 8. the channel is used successfully or nobody sends. $0 1-8P(1- PP=(1~ PP rendre 4-6 = 1-2-3) o 67) = 0.362 5. (270) 9. Throughput for sioted Aloha at G= 2 S= Ges 2 =2e%= 5 2027 x 100=27% ar 7. x<1Mipps = 270 Kops jou Mbps Ps 6. (3645) Paci (8) = CQ (0. 990.9) 45 x (0.1)8 x Q)? = 98.45 x 10° = 00000003645 x 10! = 3645 7. (3500) Synchronous bits are not taken by receiver. They are sent by sender just to alert the receiver about the incoming data. 5 eight bit character = 40 bits tJ @ Objective Practice Sets stal Study Course BIE] 10. MADE EASY Gamaoe easy 20 eight bit character information = 240 bits 40 synchronous bits —> 240 info bits Synchronous bits ~» 4200 info bits 404200 240 Total data bits = 4200 - 700 = 3500 bits/sec (a) x: ‘00 synchronous bits Datasize |. Throughput = Datasize ‘oughput= 7 2xpd _ ___Datasize Data: alase ond Bandwiath *°*P Bandwidth x Datasize * Datasize + 2x bandwidth x pd Keeping everything constant, it bandwidth increases then throughput increases. II. LLC protocolis not specific to the technolagy being used. Bandwidth is the maximum number of bits which can be transmitted through the channel Under ideal conditions (c) Let slot time = ¢ then frame transmission time = 10t contention period = N xe 2 Utiization (Up = 2 19 _ an rot 4 + St 104 3N (c) Transmission Time = 2 x Propagation Time Datasize od Bw. ~o%y Velocitys same when mediais same, bandwidth for fast ethernet is 100 Mops. In order to maintain the same frame size since bandwidth is increased from 100 100 Mbps the distance will be reduced from L to L/10. wumadecasy.inG3 MADE EASY 11. @) Option (a), (b),(c) are true All the interfaces of the router must belong to itferent network, ‘Note: The above given statements are rules to deploy a router. 12. (b) Given, DataRate = 20 Mops Propagation speed Tp= 200 mit sec = 200 x 10° misee 200% 200%10 m/s Time to travel 200 km = = 10° sec, 10°? x 20 Mbps 10-9 20 x 10° =20 x 108 10,000 bits. Data in 10° se Number of bits 13. (a) Throughput of one station S00bits 5000 x10 sec = v0b9s Mtrutrougrostincse of soiod ALOHA = sox 4 WS = 2 KB and transmitted 1KB After 2 RIT's > WS = 4 KB and transmitted 3kB After 3 RT's => WS = 8 KB and transmitted 7KB Aller 10 RTT's => WS = 1 MB and transmitted nearly 1 MB After 11 RTT's => WS = 2 MB and transmitted nearly 2MB After 12 RTT's = WS = 4 MB and tansmitted nearly 4 MB After 13 RTT's => WS = 8 MB and transmitted nearly 8MB After 14 RTT's = 10 MB file transmitted completely. (b) Slow start operating interval: (1, 6) ‘Then congestion avoidance begins, Congestion avoidance interval: (6, 16) @ ‘The respective values are 7001, 6001 ‘As these are only control segments, no data shared. Only 1 sequence number is consumed, Hence 7001, 6001 is correct answer. (4295) The largest number in the sequence number fiold is 21 It we start at 7000, it takes [(2° 7,000,000 = 4298 sec. 1) - 7000] / Objective Practice Sets10, 1 12 | Computer Science & IT (29.25) 18. ‘Smoathed Round trip time proposed by Jacobson’s is given as ERT = @IRTT + (1 - a) NRTT Where, ERTT is estimated RTT. 14, ITT Is intial RTT NATT is new ATT, cis the smoothly factor. When ACK comes after 26 ms ERTT = (0.9) 30 + (0.1) 26 = 29.6 ms When 2"4 ACK comes after 32 ms 16. ERAT = 0((296) + (1a) 32 = 29.84ms When 3rd ACK comes atter 24 sec ERTT = (29.84) + (1-a) 24 = 29.256ms (c) ‘Segment sequence number = 44 and data = 2 byte So 4442 = 46willbe the sequence Number of next byte the receiver is expecting, (a) In the slow start alogrithm, the size of the ‘congestion window increases exponetially until itreaches a threshold, after this there is additive increases (one-one window) tl the time outs. Statement (i) is false. Sets EM 201s) & [mane Easy Gamape Easy (o) Nagie's algo Is used to prevent silly window syndrome created by a sender that send data at avery slow rate, (250) 350000 bytes 1400 bytes: (8) When a time-out occurs, three things happens, First, siow start will be initiated. Second, the congestion window would start at 1. Third, the threshold will be reset to 18 KB/2 = 9 KB. Ifthe next four transmissions are all successful, then + 1%transmission : 1 segment, 1 KB + 2° transmission : 2 segments, 2 KB © 3 transmission : 4 segments, 4 KB © 4 ansmission : 8 segments, 8 KB Ater these four successful transmissions, the window size is supposed to be 16. However, since the threshold is 9KB, the window size can. only be 9KB. www.madeeasy.in4) Cori) 1. Which of the following is true about Flow Control in FTP and TFTP respectively? (yes, if it exists and no, if does not exist) (@) YES, YES (b) NO,NO (©) YES,NO (@) NO, YES 2, Which of the following protocol allows non-ASCII data to be sent through e (@) POPS (0) IMAPS (©) TELNET (d) MIME, 3. Match List+I (Protocol Layers) with List-Il (Type of address used) and select the correct answer using the codes given below the lists: List-1 List-l A. Applicationlayer 1, IP address B. NetworkLayer 2. Portadcress C. Datalinklayer 3. MAC address Codes: A BC @ 12 3 o 2 3 4 @2 1 3 ® 3 1 2 4, Match column A with column 8 Column A Column B 1. DNS (i) Por-20 2. POPS (ii) Porat 3, FIP(Data) (ll) Por-53 4. FIP(Control) (iv) Por-110 (v) Port-69 Codes: @) 1-(i), 2-(,3-(i),4-@ (b) 1 -(i), 2-(iv).3-(),4- Gi) (©) 1 (ii), 2-(v), 3 (), 4G) (@) 1 (ii), 2-(W).3 (i, 4-@ 5. Which is the correct option for statement P and Q. P: Port 80 is used by FTP to transfer data. Q:: DNS runs on top of UDP. Application Layer (@) Botharstrue — (b) Both are false (©) Only Pistue (¢) Only Qis tue The values in the HTTP message's cookie field stored at the (@) Client side () Both side (0) Senser side (d) None side Match List-I with List-ll and select the correct answer using the codes given below the lists: List-l HTTP. POP. ‘sMqP MIME List-ll 1. Sending email messages 2. Transfer Multimedia information 3. Send email attachment 4 Cx pom Receiving email messages odes: AB cD @ 12 3 4 @ 2 4 1 38 @2 1 4 8 @4 23 1 You want to implement a mechanics that automates the IP configuration, including IP address, subnet mask, default gateway, and DNS information, Which protocol will you use to accomplish this? (a) SMTP (b) SNMP (©) DHCP (© ARP Which of the following services use UDP? 1. DHOP 2. SMTP 3, SNMP 4, FIP 5. HITP 6. TFIP (a) 1,3and6 ——(b) 2and4 (c) 1,2and4 —(d) allof these| Computer Science & IT 10. To convert the ‘itb.cse.in” to its IP address, which ofthe following is needed? (@) TCR (b) ARP (©) ONS (a) HTTP 14, Consider the following statemonts: 1. Auser request a webpage, that consists of ‘some text and one image. For his page client will send one request message and receive 4 response messages EXE “entation rayer 1 (d) 2 @ 3. Co) 7. (b) 8. () 9. (a) FEEEINIEE “eptication Layer 1. (@) ‘© FIP does not have flow control and has to depend on other protocol (TCP). ‘© In TFTP flow control exists, therefore it does not depend on other protocols. Hence ituses UDP as transport layer protocol 2. (d) Multipurpose internet mail extension is a supplementary protocol that allows non-ASCII data to be sent through e-mail 3. (c) Application layer uses port numbers (address). Network layer deals with IP addresses and Data link layer deals with physical address of the device (MAC address). 4. (b) DNS port number is 53, POPS uses port number 110, FTP uses 2 ports : First port for data communication: 20, for connection establishment: 21 5. (d) FTP uses port 20 o transfer data so statement P is false and Qis correct statement, 6. (c) A cookie can be used to maintain state between HTTP transaction. So both client and server store the cookie value. Postal Study Course PTE 10. 4 fpmabe Easy GamApe Ensy 2. Two distinct webpages (for eg www.madeeasy.in/student.html and ‘ww.madeeasy.in/course himl) can not be sent aver the same persistent connection, Which of the following is correct (@) Only tis true (b) Only 2s false (c) Both 1 and 2are true (@) Both + and 2 are false () 5. (a) 6. (© © 1. @ (b) HTTP: Transfer Mutimedia Information POP: Receiving email messages SMTP: Sending email messages MIME: Send email attachments HTTP: Hyper text transfer protocol POP: Post office protocol SMTP: Simple mail transfer protocol MIME: Multipurpose Internet mail extensions (c) DHCP is used to provide IP information to hosts on your network. (c) Domain name system converts given nam its IP address via a DNS server by using nslookup, dig, or host (d) 1. It will send 4 message, and receive 4 response messages. 2. Since persistent HTTP leaves connection ‘open if connections not timeout and we don't close it, So we can send more webpages over persistent HTTP connection. wwwwmadeeasy.inCra Consider @ secured environment making use of symmetric key Cryptography. Every host connects every other host. Calculate the number of unique keys required (Symmetric Keys) fthere are 5 hosts in the network. Which of the following is the key sizes of DES and 3-DES respectively? 1. 64,128 2, 56,112 3. 56,168 (@) Only (b) Only. (©) Only3. (@) Both 2and 3 ‘Symmetric encryption algorithm is same as (@) RSAalgorithm (©) Secure Hash Algorithm (© Secret key encrypticn algorithm (@) Public key encryption algorithm Which ofthe folowing is true regarding message digest? (@) Itconverts small data into large fixed-length string (b) Given P, Noone can find P such that MO(P) =MO(P) where Pand P are small numbers. (¢) Itis used to provide Confidentiality (d) None of the above Which of the following attack endangers the security of Diffie Heiman method if two parties are not authenticated to each other. (@) Man in the middle (b) Cipher text attack (b) Piaintext attack (d) None ofthese Consider private key cryptosystem has 2 keys, 3 plaintexts and 4 ciphertexts. k= ty bo} Me (my top m4) CHIC, Cy. 0y, Cd eerie Network Security Which of the following encryption table for (K, M, Q)is valid? My My @ Klee % bye Cec mm My 2% ee {tm © Klee Khe ce © Reo ky Consider the following cryptosystem (Saar sa) ek Above cryptosystem is (2) -Symmetric key cryptosystem (6) Public key cryptosystem (©) Digital signature (@) None of these Caesar Cipher isan exampie of (@) Data Encryption Standard (DES) algorithm (b) Monoalphabetic substitution (©) Polyalphabetic substitution (@) Block Cipher Which of the following security services is/are not provided by digital signature? 1. Authentication of message 2. Integrity10, 1. | Computer Science & IT 3. Privacy 4. Non repudiation (@ Only 1and2 (©) Only3. (b) Only 4 (4) Only 3 ana 4 Ram and Sita uses the Diffie-Hellman protocol {for generating session key. Ram chooses y = 3 and Sita chooses x = 5. Identify session key value if G= 7 and N = 23 ‘Two gate aspirants talking to each other use the RSA algorithm to encrypt their messages. They encrypt the message character by character. The value of p, gand dare 5, 17 and 13 respectively, where p, q and d are their integers having usual meaning in the RSA algorithm. Identify the sum of integers in cipher text for corresponding characters in plain text: “lIT™. Assume that [EEIZIER Network security 2. @ 3 © 4 @ & @ 6 Network Security 1 Eh oviecive Praia sets (10) It there are ‘n’ users the number of keys required 10 symmetric keys are required. (d) DESis a block cipher (operates on a fixed block of bits). It encrypts a 64-bit of plain text using a 64-bit key. But only 56 bits used as last bit of every byte is a parity bit. DES uses 112 or 168 bits. {c) The secret key encryption alogrithm are often referred to as symmetric encryption alogrithms as the same key can be used in bidirectional communication between sender and receiver. [SES cer 2078) 12. 13, ©) (@MAGE EAsy OS MADE EASY corresponding cipher characters are placed in their corresponding plain text character places. Also each characteris converted to ASCII value before applying RSA (ASCII value of A, B, C, and so on are 1, 2, 3... respectively). ‘The private key in public key encryption is used for (@) encryption (©) decryption (b) hashing (@) both (a) and (b) Bob choosing 7 and 11 as Pand Q respectively ‘and choosen ‘e’ a random integer to be 13 the wants to send the plain text (M) is 5. The value of cipher text using RSA public crypiosystem is 7 @ & &) 9% @ 12 (© () Converts large data into fixed size small data. P and P* should be large numbers it's used for authentication of data. (a) ‘Sender thinks that he is communicating with receiver, Receiver thinks thathe is communicating with sender with this attack, hacker communicates or mediates with sender and receiver, (b) neryption function should be one toone + fm) f(s); not one to one + Allmessages are mapped to unique cipher text using k, and ke form, there is no mapping for ky and ke + form, there is no mapping fork, and k, Option (b) is correct. ‘wuwmadeeasy.inG3 MADE EASY 7. (a) Both sender and receiver can share the same key in symmetric key cryptosystem. 8. (b) Monoalphabetic substitution is a symmetric key algorithm in which the relationship between characters in plain text is always one-to-one in Cipher tox Caesar Cipher is an example of monoalphabetic substitution. In Caesar Cipher character in Cipher lext is substituted by another character shifted by three places. ‘An example A is substituted by D. eay=9-[ Becton |] Pea 4 [B&F....6] Cipher Text 9. (a) Privacy Is achieved using symmetric key cryptography (Public key-cryptography can also be used) Digital signature provide services of integrity, Authentication and non-repudiation Using digital signature it is not possible to provid privacy. 10. (14) Given 23,G=7 G@modN GimodN mod 23 = 21 78 mod 23 = 17 (RY mod N K = (F,)mod N = (21)8mod 23 (17) moa23 4084101 mod 23 4913 mod 23, k= Note: We can directly compute GY mod n= 14. 4 www.madeeasy.in Postal Study Course EIXE| " 12, 13. G3 Made EASY Computer Network | 3 (119) Given (5-1)(17-1) = 64 Here 3s relatively prime to z Now, (e% a) mod 64 = e [LP] Pmoain [Cipher character fi er 2 o F mos 85 59 T | 20° moses 1 ‘Sum of integers in cipher text message’ 59+59+1= 119 (c) The encryption algorithm and public key are publicly announced. The decryption algorithm and private key are kept secret, (26) P=7,Q=11,e=13andM=5 N2PQ27x11=77 = (P-1)(Q-1)=6x 10=60 C= M(mod N) 5° mod 77 = 26