menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

madeeasy test series

0 votes
105 views

answer given as 255.255.255.254  how it is correct please check??

in Computer Networks 105 views
0

 i dont even get this concept in this question means how approach how they do what they do .......plss share ur view .......

 

0
This question is wrong, the network cannot be configured with class $C$ hosts, maximum hosts can be $254$ which is less than the requirement in only $Y$ which needs $512$ hosts.

Also DBA has all network id bits as it is and the host bits are 1.
0

see this what is wrong ? In this so

0
never seen of borrowing, can't confirm if it is valid, if we can use it then it's simple, still 255.255.255.254 can't be true. we need network bits as it is.
0
ok but check solution I commented it is correct or not.
0
yes i think is ok, you have $9$ bits for host so $510$ hosts required also $510$. Should be ok. DBA only hosts bits are $1$. Should be ok.

Please log in or register to answer this question.

← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
0 answers
1
176 views
MadeEasy Test Series : Computer Networks - Sliding Window
Q.Consider a network connecting two systems connected 2000 Km apart. The band width of the network is 70 Mbps. The propagation speed of the signal is 2 10 m/sec and average size of the frame is 10 KB. Assume processing delays at nodes ... x 10^3 bits , how? it should be multiplied with 8 to convert frame to bits. correct me if i m wrong.
Q.Consider a network connecting two systems connected 2000 Km apart. The band width of the network is 70 Mbps. The propagation speed of the signal is 2 10 m/sec and average size of the frame is 10 KB. Assume processing delays at nodes are negligible. Selective repeat sliding window ... KB as 10 x 10^3 bits , how? it should be multiplied with 8 to convert frame to bits. correct me if i m wrong.
asked Jan 22, 2019 in Computer Networks Badayayash 176 views
0 votes
1 answer
2
192 views
Madeeasy test series
An IP router with a MTU of 1400 bytes (excludes header length) has received and IP datagram of size 4000 bytes with on IP header of length 20 bytes. The value of offset field in the header of the third IP fragment generated by the router for this packet are_____
An IP router with a MTU of 1400 bytes (excludes header length) has received and IP datagram of size 4000 bytes with on IP header of length 20 bytes. The value of offset field in the header of the third IP fragment generated by the router for this packet are_____
asked Jan 22, 2019 in Computer Networks leihf[ow 192 views
1 vote
0 answers
3
678 views
MadeEasy Test Series 2019: Computer Networks - Token Bucket
A token bucket scheme is used for traffic shaping. a new token is put into the bucket at every 10 micro second. assume each token pick one packet which contain 2B of data. it is observed that initial capacity of bucket is 10 Mb. the ... R? is it token arriving rate (0.1M/s) or data transmitted equivalent to token (16bits * 0.1M/s) ?
A token bucket scheme is used for traffic shaping. a new token is put into the bucket at every 10 micro second. assume each token pick one packet which contain 2B of data. it is observed that initial capacity of bucket is 10 Mb. the computer can transmit at full speed of 8 Mbps for ... ) = MT what is R? is it token arriving rate (0.1M/s) or data transmitted equivalent to token (16bits * 0.1M/s) ?
asked Jan 15, 2019 in Computer Networks Rahul_Rathod_ 678 views
0 votes
0 answers
4
83 views
madeeasy test series
this is a c function which adds the newly created node at the end(tail) of link list . this node is pointed by q and next of this node is already null. struct *node *add(struct node*head ,struct node *q) the number of ways to fill the boxes so function ... while how second is true becz when on;ly one node in list then second will fail ..answer is given as 1 and 2 are true .
this is a c function which adds the newly created node at the end(tail) of link list . this node is pointed by q and next of this node is already null. struct *node *add(struct node*head ,struct node *q) the number of ways to fill the boxes so function works correctly ... : while how second is true becz when on;ly one node in list then second will fail ..answer is given as 1 and 2 are true .
asked Jan 15, 2019 in Computer Networks eyeamgj 83 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...