I'm wondering if someone could give me an example of how I can divide a memory word containing the binary representation of an integer into fields of four bits and have each field represent a queue element.Also, how would I decompose an integer into an array of 4 bit integers using MOD and DIV? My text has absolutely no information regarding this and it's becoming frustrating.
I'm barely starting learning this so any help would be appreciated.
Assuming by word you mean an unsigned 16 bit integer then you do it like this (in pascal - assuming array element 0 is in the most significant four bits of the word):
function GetArrayItemFromWord(ArrayWord : Word; Index : Integer) : Integer;
begin
GetArrayItemFromWord := (ArrayWord AND ($F000 SHR (Index - 1) * 4)) SHR (Index - 1) * 4;
end;
or using DIV and MOD
function GetArrayItemFromWord(ArrayWord : Word; Index : Integer) : Integer;
begin
GetArrayItemFromWord := (ArrayWord DIV ($1000 SHR (Index - 1) * 4)) MOD $10;
end;
I leave the remaining exercise of applying this technique to represent a queue to your homework (hint each field will most likely be used as an index (1 to 15)).
Assuming by word you mean an unsigned 16 bit integer then you do it like this (in pascal - assuming array element 0
is in the most significant four bits of the word):
function GetArrayItemFromWord(ArrayWord : Word; Index : Integer) : Integer;
begin
GetArrayItemFromWord := (ArrayWord AND ($F000 SHR (Index * 4))) SHR (Index * 4);
end;
or using DIV and MOD
function GetArrayItemFromWord(ArrayWord : Word; Index : Integer) : Integer;
begin
GetArrayItemFromWord := (ArrayWord DIV ($1000 SHR (Index * 4))) MOD $10;
end;
I think you need to get that integer divided into four groups of 4 bits each. I believe this is the simples way:
Var
g1, g2, g3, g4: integer; ('byte' or 'shortint' can serve)
n: integer;
Begin
n:=x <-- 'x' is the integer you wanna divide
g1:=n and 15; n:=n shr 4;
g2:=n and 15; n:=n shr 4;
g3:=n and 15; n:=n shr 4;
g4:=n and 15;
The operation of "and"-ing leaves the lower 4 bits of "n", putting them at g1. After that, "n" is shifted to right 4 places, getting rid of the older bits, and putting the following 4 bits at rightmost position. Once again, g2 takes those bits; and the same for g3 and g4.
0
PyramidAuthor Commented:
Hi,
Sorry about not replying quickly. The information has helped greatly.
Thanks!!
Pyramid
0
Question has a verified solution.
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Do you want everything to be represented in binary (0s and 1s) using strings?