Register

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 25

• edited by
951 views
0 votes
0 votes

The address of a class $B$ Host is to be split into subnets with a $3$-bit subnet number. What is the maximum number of subnets and maximum number of hosts in each subnet?

  1. $8$ subnets and $262142$ hosts
  2. $6$ subnets and $262142$ hosts
  3. $6$ subnets and $1022$ hosts
  4. $8$ subnets and $1024$ hosts
• edited by
User Avatar

1 Answer

2 votes
2 votes

CLASS B MASK

11111111.11111111.00000000.00000000

BUT according to question we want three bit subnet then mask

11111111.11111111.11100000.00000000

n general, the number of available hosts on a subnet is $2^{h}−2$, where h is the number of bits used for the host portion of the address. The number of available subnet is $2^{n}$, where n is the number of bits used for the network portion of the address.

Number of subnet=$ 2^{3}$=8

Number of host in each subnet=$2^{13}-2$=8190

none of the ans

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
admin asked Apr 1, 2020
1,157 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 32
The maximum data rate of a channel of $3000$-Hz bandwidth and SNR of $30$ db is $60000$ $15000$ $30000$ $3000$
The maximum data rate of a channel of $3000$-Hz bandwidth and SNR of $30$ db is$60000$$15000$$30000$$3000$
User Avatar
1 votes
1 votes
2 answers
2
admin asked Apr 1, 2020
763 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 4
Bit stuffing refers to Inserting a $’0’$ in user data stream to differentiate it with a flag Inserting a $’0’$ in flag stream to avoid ambiguity Appending a nibble to the flag sequence Appending a nibble to the user data stream
Bit stuffing refers toInserting a $’0’$ in user data stream to differentiate it with a flagInserting a $’0’$ in flag stream to avoid ambiguityAppending a nibble t...
User Avatar
1 votes
1 votes
2 answers
3
admin asked Apr 1, 2020
852 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 1
What will be the output of following? main() { Static int a = 3; Printf(“%d”,a--); If(a) main(); } $3$ $3\;2\;1$ $3\;3\;3$ Program will fall in continuous loop and print $3$
What will be the output of following?main() { Static int a = 3; Printf(“%d”,a ); If(a) main(); }$3$$3\;2\;1$$3\;3\;3$Program will f...
User Avatar
2 votes
2 votes
1 answer
4
admin asked Apr 1, 2020
1,070 views
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 2
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$ $2^{h-1} – 1$ $2^{h+1} – 1$ $2^{h+1}$
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number number of nodes in a binary tree of height $h$ is $2^{h}$$2^{h-1} ...
User Avatar
Link Copied!