ALLInterview.com :: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Google
   
 
Categories >> Software >> Programming Languages >> C++ >> C++ General
 
 


 

 
 STL interview questions  STL Interview Questions (93)
 OOPS interview questions  OOPS Interview Questions (563)
 C++ General interview questions  C++ General Interview Questions (459)
Question
How many bit combinations are there in a byte?
 Question Submitted By :: C++-General
I also faced this Question!!     Answer Posted By  
 
Answer
# 1
There'll actually be 256 combinations. The maximum value
that can be represented with a byte (8 - bits) is 255 but as
far as combinations are concerned 0 should also be
considered as well as 1, 2, 3, ..., 255. So there are total
256 combinations.
 
Is This Answer Correct ?    84 Yes 7 No
Abdullah Javid
 
Answer
# 2
it is 2^8
means 2 ^ no of bits
means 256....
:)
 
Is This Answer Correct ?    17 Yes 3 No
Vaibhav Meena
 
 
 
Answer
# 3
There are 256 combinations as 00000000 is classed a one
combination. plus the other 255 combinations. Answer 8 is
wrong.Answer 2 is correct.
 
Is This Answer Correct ?    15 Yes 2 No
Azza
 
Answer
# 4
256 combinations.Byte contains the 8 Bits and bit contains
either the value 0 or 1.i.e.(2 raise to power 8 minus
1).The maximum number of value represented with a byte is 8
bits is 255 but 0 should also be considered as well as 1,
2, 3, ..., 255. So there are total
256 combinations.
 
Is This Answer Correct ?    12 Yes 4 No
Santosh Shah
 
Answer
# 5
This has to be the easiest technical question for any
programmer...

A Byte is made of 8 Bits, so the number of combination for
Byte would be 2^8.

However, if asked the maximum number represented then it
would be (2^8)-1.

Surely, if you can't answer this you should seriously think
about changing your profession.
 
Is This Answer Correct ?    5 Yes 0 No
Arjun
 
Answer
# 6
2 pow 8 combinations =256

Arjun is right
 
Is This Answer Correct ?    3 Yes 0 No
Manoj
 
Answer
# 7
=2^8-1
=256-1
=255
bco'z only 8 bit data can be loaded that depends on the
address lines we take
 
Is This Answer Correct ?    0 Yes 6 No
K.kishorebabu
 
Answer
# 8
ya they r right. 
Is This Answer Correct ?    5 Yes 12 No
Krishna
 
Answer
# 9
if number of bite values is n, and length of the byte is k.
that means n = 2, k = 8.
for n even => n^k
(2^8 = 256)
for n odd => n^k - 1
(2^7 - 1 = 128-1 = 127)
 
Is This Answer Correct ?    5 Yes 12 No
Panaitsdv
 
Answer
# 10
2 raise to no. of byte ie. for three byte ,8 bit combination 
Is This Answer Correct ?    4 Yes 13 No
Bari
 

 
 
 
Other C++ General Interview Questions
 
  Question Asked @ Answers
 
What are the basics of classifying different storage types, why? Symphony 2
i want the NIC programmer-B model papaer pattren, iwant the all model papers? NIC 15
Why can you not make a constructor as const?   3
why v use c++ even we have microprocessor CybAge 2
which is the easy way to divide any integer by 2? Persistent 2
what is the use of templates?   3
What is the output of: String a1 = "Hello"; String a2 = "world!"; String* s1 = &a2; String& s2 = a1; s1 = &a1; s2 = a2; std::cout << *s1 << " " << s2 << std::endl; Lehman-Brothers 4
What is Pure Virtual Function? Why and when it is used ? Lucent 9
There is a magic square matrix in such a way that sum of a column or a row are same like 3 5 2 4 3 3 3 2 5 sum of each column and row is 10. you have to check that matrix is magic matrix or not? TCS 1
what do you mean by memory management operators HCL 4
wap to accept 10 numbers & display the number of odd and even numbers??   1
diff between pointer and reference in c++?   1
 
For more C++ General Interview Questions Click Here 
 
 
 
 
 


   
Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
   
Copyright 2013  ALLInterview.com.  All Rights Reserved.

ALLInterview.com   ::  KalAajKal.com