[Internet and Neworking MCQS ]
झारखंड में आयोजित होने वाली JPSC, JSSC, JET, झारखंड पुलिस भर्ती परीक्षा आदि के लिए उपयोगी सामान्य अध्ययन।
[ Internet and Neworking MCQS ]
Useful GK for JPSC, JSSC, JET, Jharkhand Police and other exams.
191. एक message को network के छोटे लेकिन बड़े group को भेजना क्या कहलाता है?
[A] Unicasting
[B] Multicasting
[C] Broadcasting
[D] None of these
191. Sending a message to a well defined group is called ...................
[A] Unicasting
[B] Multicasting
[C] Broadcasting
[D] None of these
सही उत्तर: B
व्याख्या: Multicasting selected group को message भेजता है
Correct Answer: B
Explanation: Multicasting sends data to group
192. Router algorithm route कब बदलता है?
[A] router changes
[B] topology changes
[C] user changes
[D] transmission time does not change
192. The router algorithm takes the decision to change the route when .................
[A] router changes
[B] topology changes
[C] user changes
[D] transmission time does not change
सही उत्तर: B
व्याख्या: Topology change होने पर routing algorithm नया path चुनता है
Correct Answer: B
Explanation: Route changes when topology changes
193. यदि router J, router I से router K के optimal path पर स्थित है, तो J से K तक का optimal path भी उसी route पर होगा। इसे क्या कहते हैं?
[A] Routing principle
[B] Optimality principle
[C] Sink tree principle
[D] Network principle
193. If router J is on the optimal path from router I to router K, then the optimal path from J to K also falls along the same route is known as ....................
[A] Routing principle
[B] Optimality principle
[C] Sink tree principle
[D] Network principle
सही उत्तर: B
व्याख्या: Optimality principle shortest path routing में उपयोग होता है
Correct Answer: B
Explanation: This is known as the optimality principle
194. सभी sources से एक destination तक optimal routes के समूह को क्या कहते हैं?
[A] Binary tree
[B] Sparse tree
[C] Sink tree
[D] AVL tree
194. The set of optimal routes from all sources to a given destination is known as .................
[A] Binary tree
[B] Sparse tree
[C] Sink tree
[D] AVL tree
सही उत्तर: C
व्याख्या: Sink tree shortest path routing में प्रयोग होता है
Correct Answer: C
Explanation: Optimal routes form a sink tree
195. कौन सी technique में network information की आवश्यकता नहीं होती?
[A] flooding
[B] variable routing
[C] fixed routing
[D] random routing
195. The technique which requires no network information required is ….
[A] flooding
[B] variable routing
[C] fixed routing
[D] random routing
सही उत्तर: A
व्याख्या: Flooding में packets सभी दिशाओं में भेजे जाते हैं
Correct Answer: A
Explanation: Flooding does not require network information
196. Hamming codes की आवश्यकता क्यों होती है?
[A] Error correction
[B] Encryption only
[C] Decryption
[D] Bit stuffing
196. Why do we require hamming codes?
[A] Error correction
[B] Encryption only
[C] Decryption
[D] Bit stuffing
सही उत्तर: A
व्याख्या: Hamming code error correction के लिए उपयोग होता है
Correct Answer: A
Explanation: Hamming codes are used for error correction
197. 1111 और 1111 का checksum क्या होगा?
[A] 0000
[B] 1111
[C] 1110
[D] 0111
197. The checksum of 1111 and 1111 is _________.
[A] 0000
[B] 1111
[C] 1110
[D] 0111
सही उत्तर: A
व्याख्या: Checksum calculation modulo arithmetic पर आधारित है
Correct Answer: A
Explanation: Checksum result is 0000
198. Cyclic redundancy checking में divisor CRC से ______ होता है
[A] one bit less than
[B] one bit more than
[C] The same size as
[D] none of the above
198. In cyclic redundancy checking, the divisor is _______ the CRC.
[A] one bit less than
[B] one bit more than
[C] The same size as
[D] none of the above
सही उत्तर: B
व्याख्या: CRC divisor degree message से 1 bit अधिक होता है
Correct Answer: B
Explanation: Divisor is one bit more than CRC
199. दो शब्दों के बीच corresponding bits में अंतर की संख्या को क्या कहते हैं?
[A] Hamming rule
[B] Hamming code
[C] Hamming distance
[D] none of the above
199. The ________ between two words is the number of differences between corresponding bits.
[A] Hamming rule
[B] Hamming code
[C] Hamming distance
[D] none of the above
सही उत्तर: C
व्याख्या: Hamming distance error detection में उपयोग होता है
Correct Answer: C
Explanation: It is called Hamming distance
200. Modulo-2 arithmetic में ______ समान परिणाम देते हैं
[A] addition and subtraction
[B] addition and multiplication
[C] addition and division
[D] none of the above
200. In modulo-2 arithmetic, __________ give the same results.
[A] addition and subtraction
[B] addition and multiplication
[C] addition and division
[D] none of the above
सही उत्तर: A
व्याख्या: Modulo-2 arithmetic में addition और subtraction समान होते हैं
Correct Answer: A
Explanation: Addition and subtraction are same