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

DSSB_2017

0 votes
131 views
Default subnet mask for a class?

1.255.255.255.0

2.255.0.0.0

3.255.255..0.0

4.All of the above.

Please explain if you are answering. Thanku
in Computer Networks 131 views

3 Answers

0 votes

Answer is 4

You should click on this link for explenation  

http://www.tcpipguide.com/free/t_IPDefaultSubnetMasksForAddressClassesABandC.htm

0 votes
all of the above, Class A , CLASS B , CLASS C
0

for class A 255.0.0.0

 class B 255.255.0.0

 class C 255.255.255.0

0 votes
answer is 4 because

1.255.255.255.0:CLASS C

2.255.0.0.0:CLASS A

3.255.255..0.0:CLASS B

SO ALL THREE OF THEM ARE DEFAULT SUBNET MASK
← Prev. Next →
← Prev. Qn. in Sub. Next Qn. in Sub. →

Related questions

1 vote
1 answer
1
896 views
DSSB_2017
Which of the following is not the member of class ? 1.Static function 2.Friend dunction 3.const. function 4.Virtual function
Which of the following is not the member of class ? 1.Static function 2.Friend dunction 3.const. function 4.Virtual function
asked Jun 13, 2017 in Programming Harikesh Kumar 896 views
0 votes
1 answer
2
113 views
DSSB_2017
A logical schema is a database 1. is the entire database 2.is the standard way of organizing information into accessible parts 3.describes how data actually store in disk 4.all of the above
A logical schema is a database 1. is the entire database 2.is the standard way of organizing information into accessible parts 3.describes how data actually store in disk 4.all of the above
asked Jun 13, 2017 in Databases Harikesh Kumar 113 views
0 votes
1 answer
3
480 views
DSSB_2017
A sorting algorithm is called stable if 1.It takes O(n log n) time 2.It maintains relative order of occurrence of non-distinct elements 3.It uses divide and conquer paradigm 4.It takes linear time
A sorting algorithm is called stable if 1.It takes O(n log n) time 2.It maintains relative order of occurrence of non-distinct elements 3.It uses divide and conquer paradigm 4.It takes linear time
asked Jun 13, 2017 in Algorithms Harikesh Kumar 480 views
0 votes
2 answers
4
400 views
DSSB_2017
Choose the statement that are syntactically incorrect in C language? 1.for( ; ; ); 2./* this is a /* a valid */ comment*/ 3.return 5; 4.return(6+3);
Choose the statement that are syntactically incorrect in C language? 1.for( ; ; ); 2./* this is a /* a valid */ comment*/ 3.return 5; 4.return(6+3);
asked Jun 13, 2017 in Programming Harikesh Kumar 400 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...