Machine-translated by Google. Questions are authored in English.
Top

Computer Network Questions and Answers

92.

Number of cross point needed for 10 lines in a cross point switch which is full duplex in nature and there are no self-connection is

Answer: B

Correct answer: 45

A full-duplex line serves both directions, and no station connects to itself, so the number of connections is the number of unordered pairs:

\[ \binom{10}{2} = \frac{10\times 9}{2} = 45 \]

Please log in or register to report this question.

93.

Collision domain can be compared to which distance data travels between two stations ?

Answer: B

Correct answer: Maximum

The collision domain is bounded by the greatest distance a frame may travel and still be detected as a collision by the sender before it finishes transmitting. It is therefore a maximum distance, and it shrinks as the data rate rises.

Please log in or register to report this question.

Answer: A

Correct answer: \( \overline{A + B} = \bar{A} \cdot \bar{B} \)

De Morgan’s first theorem states that the complement of a sum is the product of the complements: \[ \overline{A + B} = \bar{A} \cdot \bar{B}. \] In words, NOT (A OR B) is the same as (NOT A) AND (NOT B). The second theorem is its dual: \[ \overline{A \cdot B} = \bar{A} + \bar{B}. \] A truth table confirms the first at once. Taking A and B as 0,0 gives \( \overline{0} = 1 \) on the left and \( 1 \cdot 1 = 1 \) on the right; every other combination gives 0 on both sides. The practical rule for applying either theorem is: break the bar, change the sign. Split the overbar, and swap AND for OR or OR for AND. The theorems matter because they allow any circuit to be rebuilt using only NAND gates or only NOR gates, which is why those two are called universal.

Please log in or register to report this question.

95.

What is the decimal equivalent of the hexadecimal number 2F?

Answer: B

Correct answer: 47

Each hexadecimal digit carries a place value that is a power of 16, read from the right: \( 16^{0} = 1 \) and \( 16^{1} = 16 \). In 2F the digit F stands for 15, so \[ 2 \times 16 + 15 = 32 + 15 = 47. \] The letters run A = 10, B = 11, C = 12, D = 13, E = 14, F = 15, and it is worth memorising them, since almost every hexadecimal question depends on the conversion. A quicker route for small values goes through binary. Each hexadecimal digit is four bits: 2 is 0010 and F is 1111, giving 00101111, which is \( 32 + 8 + 4 + 2 + 1 = 47 \). Conversion by grouping is faster than arithmetic once the sixteen four-bit patterns are familiar. The largest two-digit hexadecimal number is FF, which is 255 - the maximum value of one byte, and the reason colour codes and byte values are so often written this way.

Please log in or register to report this question.

96.

A terminal multiplexer has six 1200 bps terminals and n 300 bps terminals connected to it. The outgoing line is 9600 bps. What is the maximum value of n?

Answer: C

Correct answer: 8

The 300 bps terminals may use whatever the 1200 bps terminals leave:

\[ 9600 - 6\times 1200 = 2400\ \text{bps} \qquad n = \frac{2400}{300} = 8 \]

Please log in or register to report this question.

98.

In BCD, the decimal number 25 is represented as

Answer: A

Correct answer: 0010 0101

In binary coded decimal each decimal digit is encoded separately in four bits. So 25 becomes 2 and 5 encoded individually: 2 is 0010 and 5 is 0101, giving 0010 0101. This is not the same as the pure binary value of 25, which is 11001 - the second option, and the usual trap. BCD deliberately sacrifices compactness for ease of conversion. Because only ten of the sixteen four-bit patterns are used, the six combinations from 1010 to 1111 are invalid in BCD, and arithmetic must correct for them: when a BCD addition produces a result above 9 or generates a carry, 6 is added to bring it back into range. The code is used wherever numbers are displayed or entered digit by digit - calculators, digital clocks, instrument panels - because converting each digit to a seven-segment display needs no division. The waste is about 20 per cent of the available codes.

Please log in or register to report this question.

99.

Which among the following communications lines is best suited to interactive processing applications?

Answer: C

Correct answer: full duplex lines

Interactive work means a rapid exchange in both directions, and a full duplex line carries both at once so neither side waits for the line to turn round. A simplex line carries one direction only.

Please log in or register to report this question.

100.

Thick coax have maximum segment of

Answer: A

Correct answer: 500 m

Thick coaxial cable, the 10Base5 of the original Ethernet, allows a 500 m segment - the 5 in the name records it. Thin coax, 10Base2, manages about 185 m.

Please log in or register to report this question.

Loading…

Other Subjects

Tags: Computer Network Questions and Answers || Computer Network MCQ Questions and Answers || Computer Network GK Questions and Answers || Computer Network GK MCQ Questions || Computer Network Multiple Choice Questions and Answers || Computer Network GK || GK on Computer Network || Computer Awareness Questions and Answers || Computer Awareness MCQ Questions and Answers || Computer Awareness GK Questions and Answers || GK on Computer Awareness