Hakkera
Sep 27 2006, 08:57 PM
| | This my sound like a bit of a noob question, but it has always occured to me. On screen, we get hexadecimal code, but the processor doesnt understand that right? So, if I make a program in Hex, would I have to compile it, I understnad that Hex is shorthand binary, but would I?
|
Reply
osknockout
Sep 27 2006, 09:49 PM
Lol, we're all noobs sometime.  You wouldn't have to compile it. You'd just have to find a way to save it in that format, like through a hexadecimal editor, because normally data is saved in bytes (1 byte= 2 hexes = 256 binary bits)
Reply
ghostrider
Sep 27 2006, 10:50 PM
QUOTE This my sound like a bit of a noob question, but it has always occured to me. On screen, we get hexadecimal code, but the processor doesnt understand that right? So, if I make a program in Hex, would I have to compile it, I understnad that Hex is shorthand binary, but would I? I don't quite understand what you mean by 'Hexadecimal Code'. Can you elaborate? I should be able to answer your question, I've been writing in assembly for 3 years. If your talking about data, such as: CODE
Somedata db 0FFh
Then that will be turned into binary when it compiles. Or if you mean you are writing a program totally in Hex, that will work too. The compiler will convert that into code that the computer can understand. Also, QUOTE (1 byte= 2 hexes = 256 binary bits) The above is wrong. 1 byte consists of 8 bits, thus making 256 possible characters.
Reply
osknockout
Sep 28 2006, 09:47 PM
QUOTE The above is wrong. 1 byte consists of 8 bits, thus making 256 possible characters. Ah! Sorry about that. Heh, you'd think after programming in Z80 assembly for 4 years you'd get that down. Anyway, ghostrider's right.
Reply
Similar Topics
Keywords : hex, binary
- Data Structure -- Trees -- Threaded Binary Tree
(0)
Data Structures -- Binary Tree -- Structurally Same
Find if 2 binary tress are structurally same?? (4) Given two binary trees, find out whether a tree is structurally same to the other. Structurally same
means that the two trees look alike or a tree looks alike a subtree of the other tree. Look for
time and space complexity. Some more for readers What is a binary tree? QUOTE A binary
tree is made of nodes, where each node contains a "left" pointer, a "right" pointer, and a data
element. The "root" pointer points to the topmost node in the tree. The left and right pointers
recursively point to smaller "subtrees" on either side. A null pointer represents a binary....
Data Structures -- Binary Tree -- Mirror Image
Binary Tree -- Mirror Image (0) Given a binary tree, write an algorithm to find its mirror image with minimal time and space
complexities. Note: If you know the answer and if you feel it is simple also please post the
answers so that others will come to know about the answers. This question was sent by my friend
through mail. Solutions Suggested Sol 1 CODE void PrintMirror(node *root) {
if(node!=NULL) PrintMirror(root->right);
Printf(root->data); PrintMirror(root->left); } In case of
implementation using....
Can You Convert This Binary Message
(6) can you crack this QUOTE
0010001100100011001000110010001100100011001000110010001100100011001000110010001100100011001000110010
0011001000110010001100100011001000110010001100100011001000110010001100100011001000110010001100100011
0010001100100011001000110010001100100011001000110010001100100011001000110010001100100011001000110010
0011001000110010001100100011001000110010001100100011001000110010001100100011001000110010001100100011
0010001100100011000011010000101000100011001000000010000000100000001000000010000000100000001000000010
00000010000000100000001000000010000000100000001....
C++ Binary Search Tree Destructor/remove Methods
howto? (0) I have a binary search tree and I need to put a destructor on it. Ideally it would be called when I
exit the program. How would a destructor look if it should delete all the nodes of a tree
(recursively prefered). Also, how would I go about removing a node from my tree and then replacing
it so the tree is still ordered inorder-wise? replacing specs: * If the node x is a leaf, then
it can simply be clipped off. * If x has a single child then it can be replaced by its child.
* Otherwise, if x has two children, find the leftmost child in x's right subtr....
Opening Files In Binary Format?
(3) i'm trying to iterate through a file and copy its character by character into a new exe file so
i can later adapt this functionality into a program that i've already written in two or three
other languages. its just to dip my fingers back in C since i've gotten rusty from since the
last time i used to harrass this forum, lol. i seem to believe that once i use fopen in read mode
that it opens the file in binary mode but it still dosen't give me the results i want, watch a
small sample of the code please. Code: CODE int main(void) { int a; ....
Binary Tree
(1) Ok my program is supposed to read in from a file and create a linked list of chapters and each
linked list is supposed to have a link to a binary tree that holds words that are related to each
chapter so eventually I can code a search function the input file is as follows 3 Drop_Box 10 need
to drop box with secure box emergency drop urgent Carpet_maintenance 7 grease remove immediately
cover floor laundry man Smoke_alarm 8 please floor scene urgently scene battery scene box there are
only 3 lines the top number indicates how many chapters there are and then each line ....
Crack The Binary Code...
and win an account with 50 Gmail Invites (-1)
Crack The Binary Code...
and win an account with 50 Gmail Invites (4) After my somewhat popular "binary code cracking" thread, I’ve decided to create one that actually
requires thinking and some logic, as well as some Hexdeimal, HTML and binary code knowledge, the
person who can successfully crack this code will have the honor of winning the email name --->
the.last.remaining.screenname@gmail.com, In addition that account has been stashed with 50 juicy
Gmail Invites. So it's time to start your brains, and use your IQ. Due to the "possible"
difficulty level of this “code” I have provided three hints: Hint Number 1 – In the fi....
Crack The Binary Code An Win A Gmail Invitation!
as if you don't have one already... (7) Anyways, I've played around with some binary, and made a large binary sentence. If you can
succefully "crack" to binary code, and convert it back to plain text, you will find in the convered
text one gmail invite. But, i figured that probably everyone has got one areadly, but, it's wort
a try, here comes the code. /tongue.gif' border='0' style='vertical-align:middle' alt='tongue.gif'
/> This oinvite will automaticlly expire in three weeks, so quickness is the key. -BINARY CODE-
0101010001100101011100110111010001101001011011100110011100100000010101000110010....
Looking for hex, binary
|
|
Searching Video's for hex, binary
|
advertisement
|
|
Jul 25, 2008
