where can i find c/c++ program to compute a 12 bit hamming code for 8 bits?
139522
I've included a link below to a short C program (developed by Jack Klein) which generates and checks (12,8) hamming codes.
32238
If you write the codes for 16 digits in binary out -\n\n0000 - 0\n0001 - 1\n0010 - 2\n0011 - 3\n0100 - 4\n0101 - 5\n0110 - 6\n0111 - 7\n1000 - 8\n1001 - 9\n1010 - A\n1011 - B\n1100 - C\n1101 - D\n1110 - E\n1111 - F\n\nThen take 3E7C, match the four digits on the chart:\n\n0011 1110 0111 1100 =\n\n11111001111100\n\nThats hex to binary conversion, to decimal, you just add your exponents of two, reading binary number from right to left:\n\n2^2 + 2^3 + 2^4 + 2^5 + 2^6 + 2^9 + 2^10 + 2^11 + 2^12\n\n= \n\n15996\n\nI admit there's a more direct path to the number, but rememebring the way above allows you do any decimal/binary/hex conversion neededed, so its all I've remembered.
374089
It has 2-bytes code, so you need to examine two consequent bytes. It is not C++ specific, it is PC-specific.
463145
binary generation or backtracking techniques
288377
PASCAL!!!its out dated, i think it is possible to get it on C/C++
12275
Follow this link:\n\nhttp://www.thefreecountry.com/compilers/cpp.shtml\n\n:)
785470
There are numerous ways to do that. \nHere is, probably the simplest:\n\nchar *s="char *s=%c%s%c;%cmain() {printf(s,34,s,34,10,10);}%c";\nmain() {printf(s,34,s,34,10,10);}\n\nThe program itself is fairly useless.\nThe whole point of an exercise like this is the satisfaction of finding a solution yourself. Too bad, you did not give yourself a chance
284585
It depends on the definition that you use for Gray code since there "is no unique definition for Gray code" [Peter Jackel, p. 84]. The most commonly used (at least in a Sobol sequence context) is:\n \nG(n) = n bitxor [n/2],\nwhere [x] is the integer part of x,\nbitxor is the bitwise operation on the binary representation of to integers.\n\nSo you have to express 17 and 8 in binary and perform bitxor.\n\n17 = ___________10001\n8  = ____________01000\nbitxor(17, 8) =____ 11001 = 25\n\n(I did my best to align the 3 numbers above but am not sure how the'll show up in other pcs)\n\nObservation: the bitxor operation can be performed as a "sum without carry on the binary representation".
172063
http://www.thefreecountry.com/compilers/cpp.shtml
2853
I always recommend Bjarne Stroustrup's "The C++ Programming Language", third edition.  It cuts straight to the meat of what is different between C and C++ instead of messing around with arrays of char like most tutorials do.
409160
This is possible only if at least half of those 256 values will not be used at all, and that you know which ones won't be used beforehand. If that's the case, you can map the remaining values that will be used with 7 bits.\n\nSee Shannon's entropy equation...
964471
Hi there you can go to www.cplusplus.com\nOr if you want help ina specific topic just goolgle iT. fOR example\narrays in C++ go to i'm feeling lucky
425700
Try a book called "C and the 8051". Writing code for the 8051 is basically the same as any other processor, so if you know C, you have little else to learn. Mainly, you want to know how the processor works (RAM layout, bits and bytes, interrupts, and any special hardware). Keil is probably the best compiler out there for the 8051, so have that too.\n\nP.S. Normally all programs are done in C. C++ really isnt needed for the 8051.\n\nGood luck!!
261757
Hope this link helps.It has the code for identifying a palindrome and also it has numerous other similar programs.Good Luck!!
1007436
http://www.freeprogrammingresources.com/cppbooks.html
1048980
http://www.cprogramming.com/tutorial.html\nhttp://www.cplusplus.com/doc/tutorial/\nhttp://visualcplus.blogspot.com/\n\nall taken from yahoo seach. you can search for c c+ tutorials and come up with hundreds if these don't do it for you.
997626
http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP?Res=150\n\nhttp://www.math.sfu.ca/~cbm/aands/subj.htm\n\nhttp://clusterfie.epn.edu.ec/ibernal/html/CURSOS/AbrilAgosto06/Metodos/Libros/Fundamentals%20Of%20Numerical%20Computing%20-%201997%20-Wiley%20%20(By%20Laxxuss).pdf