Welcome to the Networking MCQs Page

Dive deep into the fascinating world of Networking with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Networking, a crucial aspect of UGC CBSE NET Exam. In this section, you will encounter a diverse range of MCQs that cover various aspects of Networking, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within UGC CBSE NET Exam.


Check out the MCQs below to embark on an enriching journey through Networking. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of UGC CBSE NET Exam.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Networking. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Networking MCQs | Page 8 of 33

An attacker sits between customer and Banker, and captures the information from the customer and retransmits to the banker by altering the information. This attack is called as ..............
Answer: (b).Replay Attack
Match the following Layers and Protocols for a user browsing with SSL:

a. Application layer i. TCP
b. Transport layer ii. IP
c. Network layer iii. PPP
d. Datalink layer iv. HTTP

Codes: a b c d
Answer: (a).iv i ii iii
The maximum size of the data that the application layer can pass on to the TCP layer below is .........
Answer: (c).Any size
A packet whose destination is outside the local TCP/IP network segment is sent to ..............
Answer: (d).Default gateway
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ...........
Answer: (c).by exchanging information with neighbor nodes
In link state routing algorithm after the construction of link state packets, new routes are computed using:
Answer: (b).Dijkstra's algorithm
Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is ..................
Answer: (a).nP(1-P)^n-1
Station A uses 32 byte packets to transmit messages to station B using sliding window protocol. The round trip delay between A and B is 40 milli seconds and the bottleneck bandwidth on the path between A and B is 64 kbps. The optimal window size of A is
Answer: (b).10
Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be:
Answer: (a).(1+x) is factor of G(x)
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet size is ................
Answer: (d).5 bytes

Suggested Topics

Are you eager to expand your knowledge beyond Networking? We've curated a selection of related categories that you might find intriguing.

Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!