i want to know about bit pair algorithm...from which site i can know about it?
91202
bit pairing is the practice of establishing, within a code set, a number of subsets that have an identical bit representation except for the state of a specified bit.\n\nNote: An example of bit pairing occurs in the International Alphabet No. 5 and the American Standard Code for Information Interchange (ASCII), where the upper case letters are related to their respective lower case letters by the state of bit six.
785224
An algorithm for solving this would be to divide up the digits and shuffle or switch them in the direction that makes them closer to correct (the "greedy algorithm").  That should work without too much trial and error.
754518
well the bitcomet website should help a little bit. Unfortunately you have to click on some options to get some answers. sorry but Good luck! http://www.bitcomet.com
81883
Details of the algorithm for conversion along with\nsource program written in C can be found at.\nhttp://www.codepedia.com/1/Art_Expressions_p1\n\nA good short article on this topic.\nhttp://www.cs.man.ac.uk/~pjj/cs2121/fix.html
107332
G pairs with C and A pairs with T, so its GAATCCGAATGGTA\n\nI assume the "h" at the end is a typo?\n__________________________________________\nsouthernserendipiti wrote:\n>>>What's the "th" at the end?\nI assumed it was a t and a typo : )
875755
Try tracing a very small example on paper to gain some insight into this.  Perhaps just two or three elements with at least two equal keys.  Then reverse the order of the two equal keys in the input set, and see if you still get the same result.  Tracing the algorithm like this will get you the answer in a manner that should give you some confidence.
395965
The bubble sort is the simplest, easiest sort algorithm. It basically goes like this:\n\nfor(x = 0; x < ARRAY_SIZE; x++)\n{\n   for(y = 0; y < ARRAY_SIZE-1; y++)\n   {\n      if(iarray[y] > iarray[y+1])\n      {\n         swap = iarray[y+1];\n         iarray[y+1] = iarray[y];\n         iarray[y] = swap;\n      }\n   }\n}\n\nPieces of cake!
691515
algorithms, data structures, computer organization
640029
There's a good book by Simon Singh, titled The Code Book that goes through the entire history of cryptography and some of the background.  His website also has information and links on crypto theory.  If you're looking for the most up to date information, ie on elliptical cryptography though or RSA do a search on scholar.google.com for the actual papers.
395381
well.. here is a really wonderful book for this :\n\nDesign and Analysis of algorithms by Anany Levitin.. try getting this book.\n\nAnd : \nhere's a dictionary of algorithms:\n\nhttp://www.nist.gov/dads/\nhere, each and every algorithm's details have been given. And links to other sites, where simulations of algorithms are put up as JAVA APPLETS\n\nfor eg:\nhere's a link to quick sort simultaion using java applet, which i got from NIST . gov :\n\nhttp://www.cosc.canterbury.ac.nz/people/mukundan/dsal/QSort.html\n\nN JOY ; )
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".
571825
http://en.wikipedia.org/wiki/64-bit
622754
There is a microsoft p2p software development kit \n\nhttp://www.microsoft.com/downloads/details.aspx?FamilyId=5116A614-A487-4DFF-B384-829CD8CE977D&displaylang=en\n\nand you can refer to the actual bittorent source code\n\nhttp://www.bittorrent.com/faq.myt#repositoryaccess
243995
Depends on how much you want to know. I found the following "scholarly" articles that may be of interest. These may be hard to read but you can at least try to obtain them from your library. I would suggest that you read the Nat(ure) Biotechnology article, some of the Nature publications are very prestigious and only publish very good research papers.\n\n1: Tanaka K, Okamoto A, Saito I. \nPublic-key system using DNA as a one-way function for key distribution.\nBiosystems. 2005 Jul;81(1):25-9. Epub 2005 Feb 25.\n\n2: Leier A, Richter C, Banzhaf W, Rauhe H. \nCryptography with DNA binary strands.\nBiosystems. 2000 Jun;57(1):13-22.\n\n3: Dove A.\nDNA cryptography.\nNat Biotechnol. 1999 Jul;17(7):625. No abstract available.\n\n4: Beaver D.\nComputing with DNA.\nJ Comput Biol. 1995 Spring;2(1):1-7.
1067470
have a look at http://www.opencores.org\n\nMight also enjoy:\nhttp://tutor.al-williams.com\nhttp://www.fpga4fun.com
871264
http://en.wikipedia.org/wiki/Bit_Torrent\n\nAlso check this to know about Terminology\nhttp://en.wikipedia.org/wiki/Bit_Torrent#Terminology
911428
It's always "possible".  For example, trial division by progressively larger numbers, skipping multiples of 2 and 3, is the worst algorithm known, but it will get there eventually.\n\nEven the best algorithms known take longer and longer as the number gets bigger.  The records, which took several months on a cluster of machines, are for numbers around 200 digits.  I think each additional three digits makes these methods take about twice as long.  They use very very deep number theory.