New answers tagged

0 votes

Is solving Binary String Matching equivalent to Solving All type of string matching?

String matching performed bit by bit would be much slower than character by character, because a character is made of 8 or 16 bits and a processor can handle them in a single go. Also note that string ...
user avatar
  • 4,518
0 votes

Create binary numbers with a described pattern

As said in my comment, binary numbers of size $n$ are not supported by current computers. We have two situations: only support the native binary type; as $n$ does not exceed $64$, you can very well ...
user avatar
  • 4,518
0 votes

when is 2's complement used, or called into use in hardware

To obtain the negative of a 2's complement positive number, flip all its bits and add 1. E.g. 123d = 01111011b -123d = 10000100b + 1 = 10000101b This also works ...
user avatar
  • 4,518

Top 50 recent answers are included