473,320 Members | 2,158 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,320 software developers and data experts.

Can we replace 8 bits by 2 bits?

This is a basic thing.
Say A=0100 0001 in ASCII which deals with 256 characters(you know
better than me!)
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?

Jan 5 '07 #1
22 2455
Umesh a écrit :
This is a basic thing.
Say A=0100 0001 in ASCII which deals with 256 characters(you know
better than me!)
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?
Dear customer

We are ready to fulfill your request, and we thank you for the
confidence you give us by placing your order.

Please buy products for US$ 200 at our website. When your VISA
card payments are accepted we will gladly send you the requested
program.

Yours sincerely

J.K. OB

Customer support.

P.S.
Our website address:
www.DoMyHomework.com
Jan 5 '07 #2
Umesh napsal:
This is a basic thing.
Say A=0100 0001 in ASCII which deals with 256 characters(you know
better than me!)
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?
Yes, you can encode it this way, but you would have problem to work
with it. For example accessing 6th character of such array would be
something like (I did not test following code):

char GetNthChar(const char array[] a, size_t index)
{
const size_t im4 = index % 4 * 2;
return (a[index / 4] & (3 << im4)) >im4;
}

However it may be usefull to store your data in such format. So I would
recommend to encode it before storing, decode it after loading and work
with ordinary char array containing values 0, 1, 2 and 4 only.

If you really need to save couple of bytes, you should write some
wrapping class which overloads operator[] and hides all these bit
operations. It would be something like std::vector<boolnot for 1 bit
values, but for 2 bit values.

Jan 5 '07 #3
"Umesh" wrote:
Say A=0100 0001 in ASCII which deals with 256 characters(you know
better than me!)
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?
The switch statement *may* be germane to your problem.

BTW, ASCII does not deal with 256 characters, ASCII consists of only 128
characters. Terminology is a bitch since it is often used improperly by the
very people who in fact know better. It's "quicker" that way. :-(
Jan 5 '07 #4
Suppose that I define an array of 2 bits {00,01,10,11} . Now when the
program finds A in the text file it replaces with 00, B with 01, C with
10 and D with 11. So the encoded file will take 1/8 of the space of the
original file.

During decoding I'll replace 00 by A, 01 by B, 10 by C and 11 by D to
regain the original file.

I'm an inexperienced programmer. Pl help.

Jan 5 '07 #5

Umesh wrote:
Suppose that I define an array of 2 bits {00,01,10,11} . Now when the
program finds A in the text file it replaces with 00, B with 01, C with
10 and D with 11. So the encoded file will take 1/8 of the space of the
original file.

During decoding I'll replace 00 by A, 01 by B, 10 by C and 11 by D to
regain the original file.

I'm an inexperienced programmer. Pl help.
Your question doesn't really belong in comp.lang.c
You aren't asking about a C feature or problem, you are asking for
someone to teach you the rudiments of the skill of writing programs.

Write the code to do this:

open the input file
open the output file
for each character in the input file
if the character is 'A'
write binary 00 to the output file
else if the character is 'B'
write binary 01 to the output file
else if the character is 'C'
write binary 10 to the output file
else if the character is 'D'
write binary 11 to the output file
else
do nothing
end-if
end-if
end-if
end-if
end-for-loop
close the output file
close the input file
terminate the program

HTH
--
Lew

Jan 5 '07 #6
Umesh said:
This is a basic thing.
Say A=0100 0001 in ASCII which deals with 256 characters
128, actually, but I know what you mean. Certainly 8 bits are sufficient to
encode 256 characters, which is what you actually care about.
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?
Here's some code to split a byte into four:

void decode(char *letter, int ch)
{
const char alphabet[] = "ABCD";
int mask = 0x11;

for(i = 0; i < 4; i++)
{
letter[i] = alphabet[(ch & mask) >(i * 2)];
mask <<= 1;
}
}

letter must point to the first element in an array of at least four chars.
Note that decode() does not build a string. If you want a string, deal with
the null terminator yourself.

If you are decoding, say, 0xAD, this is 10101101 in binary, and at the end
of the decoding process letter[0] will store 'C', letter[1] will store 'C',
letter[2] will store 'D', and letter[3] will store 'B'.

Encoding is quite easy too. Simply reverse the process. For decoding,
though, you may find it convenient to have an alphabet array of UCHAR_MAX +
1 bytes, all of which have the value 0, but set alphabet['A'] to 1,
alphabet['B'] to 2, alphabet['C'] to 3, and alphabet['D'] to 4. Then you
can say: if(alphabet[letter[i]] == 0) { error - invalid code } else { your
OR-mask is alphabet[letter[i]] - 1 so you can OR it into your encoding, and
then shift left ready for the next mask }

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.
Jan 5 '07 #7
Umesh said:
Suppose that I define an array of 2 bits {00,01,10,11} . Now when the
program finds A in the text file it replaces with 00, B with 01, C with
10 and D with 11. So the encoded file will take 1/8 of the space of the
original file.
A quarter.

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.
Jan 5 '07 #8
Your question doesn't really belong in comp.lang.c
You aren't asking about a C feature or problem, you are asking for
someone to teach you the rudiments of the skill of writing programs.

Write the code to do this:

open the input file
open the output file
for each character in the input file
if the character is 'A'
write binary 00 to the output file
else if the character is 'B'
write binary 01 to the output file
else if the character is 'C'
write binary 10 to the output file
else if the character is 'D'
write binary 11 to the output file
else
do nothing
end-if
end-if
end-if
end-if
end-for-loop
close the output file
close the input file
terminate the program

HTH
--
Lew
Dear Lew,
I'm not asking you to put down the algorithm which I already did. I
want you to write a part of the program. I won't ask you to do that
once I learn C well. Because I've only learnt to make algorithms and
determine their time complexity, I need your help.

I heard that it is easier to implement programs than to make effective
algorithm which I already did. Actually my original algo is far more
complex than this. But I want to start from the simple one. Becuse I've
none to teach me, I think sometimes a little help comes handy. That's
why I'm here. I hope that expert folks like you won't upset me. Thank
you. I look forward to hear from you again. God bless you.

Jan 5 '07 #9
Umesh a écrit :
>>Your question doesn't really belong in comp.lang.c
You aren't asking about a C feature or problem, you are asking for
someone to teach you the rudiments of the skill of writing programs.

Write the code to do this:

open the input file
open the output file
for each character in the input file
if the character is 'A'
write binary 00 to the output file
else if the character is 'B'
write binary 01 to the output file
else if the character is 'C'
write binary 10 to the output file
else if the character is 'D'
write binary 11 to the output file
else
do nothing
end-if
end-if
end-if
end-if
end-for-loop
close the output file
close the input file
terminate the program

HTH
--
Lew


Dear Lew,
I'm not asking you to put down the algorithm which I already did. I
want you to write a part of the program. I won't ask you to do that
once I learn C well. Because I've only learnt to make algorithms and
determine their time complexity, I need your help.
Lew is right.

You will NOT learn until you practice. And you will not practice
if somebody else does the work for you.

And besides, why should we work for you for free?

You must learn the basics first. Buy the book from Kernighan and
Ritchie, learn it, and then ask questions. I learned C that way,
and there wasn't any body else there to ask questions. It is
perfectly doable if you WORK.

Or pay a class in computer programming. That is possible too.

But we can't replace a teacher or a book, and we will not work
for you for free.
Jan 5 '07 #10

Umesh wrote:
[snip]
I'm not asking you to put down the algorithm which I already did. I
want you to write a part of the program.
Sorry, but no.

But, I'll make it simpler for you

First off, just write the code that frames your program. This is the
minimum code; just the startup and termination. Something like

#include <stdlib.h>
int main(void)
{
return EXIT_SUCCESS;
}

Compile and run this code, making changes until it works. This
shouldn't take very long, as this rudimentary code is almost foolproof.

Next, add in the file open and close functions and retest

Next, add in the input read logic, and retest

Next, add in the logic to choose between 'A', 'B', 'C', and 'D', and
retest

Next, add in the logic to feed bit pairs to the output (this doesn't
/yet/ have to write the pairs to the output), and retest

Next, add in the logic to write out the bit pairs to the output, and
retest

Now, you are done
[snip]

Jan 5 '07 #11

Richard Heathfield wrote:
Umesh said:
This is a basic thing.
Say A=0100 0001 in ASCII which deals with 256 characters

128, actually, but I know what you mean. Certainly 8 bits are sufficient to
encode 256 characters, which is what you actually care about.
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?

Here's some code to split a byte into four:

void decode(char *letter, int ch)
{
const char alphabet[] = "ABCD";
int mask = 0x11;

for(i = 0; i < 4; i++)
{
letter[i] = alphabet[(ch & mask) >(i * 2)];
mask <<= 1;
}
}
mask=0x3;
Well i am not sure but i think and
mask <<=2, and then you have to reverse letter
or if we know number of digits
then 0x110000 (construct mask)
then shift ch&mask by appropriate amount.
>
letter must point to the first element in an array of at least four chars.
Note that decode() does not build a string. If you want a string, deal with
the null terminator yourself.

If you are decoding, say, 0xAD, this is 10101101 in binary, and at the end
of the decoding process letter[0] will store 'C', letter[1] will store 'C',
letter[2] will store 'D', and letter[3] will store 'B'.
It is giving strange stuff
Encoding is quite easy too. Simply reverse the process. For decoding,
though, you may find it convenient to have an alphabet array of UCHAR_MAX +
1 bytes, all of which have the value 0, but set alphabet['A'] to 1,
alphabet['B'] to 2, alphabet['C'] to 3, and alphabet['D'] to 4. Then you
can say: if(alphabet[letter[i]] == 0) { error - invalid code } else { your
OR-mask is alphabet[letter[i]] - 1 so you can OR it into your encoding, and
then shift left ready for the next mask }

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.
Jan 5 '07 #12
ni*****@gmail.com said:
Richard Heathfield wrote:
<snip>
>Here's some code to split a byte into four:

void decode(char *letter, int ch)
{
const char alphabet[] = "ABCD";
int mask = 0x11;

for(i = 0; i < 4; i++)
{
letter[i] = alphabet[(ch & mask) >(i * 2)];
mask <<= 1;
}
}

mask=0x3;
oops
Well i am not sure but i think and
mask <<=2,
oops squared

Let's just pretend that article didn't happen, shall we? :-(

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.
Jan 5 '07 #13
"Umesh" <fr****************@gmail.comwrote in message
news:11*********************@v33g2000cwv.googlegro ups.com...
This is a basic thing.
Say A=0100 0001 in ASCII which deals with 256 characters(you know
better than me!)
But we deal with only four characters and 2 bits are enough to encode
them. I want to confirm if we can encode A in 2bits(say 00), B in 2
bits (01), C in 2 bits(10) and D in 2 bits by some program. I only use
this four alphabet in my work. Can u pl write a sample program to reach
my goal?
Short answer, yes you can.

Long answer, it's probably more pain than it's worth.

The problem is modern computers usually use 8 bit bytes. A byte is the
smallest unit the computer will handle as one unit, and it is usually 8 bits
(it may be more or maybe a few less on some system). So, if you defined
each value as 2 bits (A, B, C, D or 0, 1, 2, 3 or whatever) it would still
need to be stored in a byte. With an 8 bit byte you could store 4 of these
in each byte. But, since most computers deal with a minimum of 8 bits at a
time, it would be up to you to extract the bits yourself.

This means you couldn't use some simple define or such, you'd need to make a
class and things get complicated from there.

Unless you are storing a whole lot of these so size becomes an issue, it is
easier to just waste the extra 6 bits of the byte and store each value in a
byte so you can use std::vector and such more easy.
Jan 5 '07 #14
Jim Langston said:

<snip>
>
Unless you are storing a whole lot of these so size becomes an issue, it
is easier to just waste the extra 6 bits of the byte and store each value
in a byte so you can use std::vector and such more easy.
He can't use std::vector because there's no such thing. Except, of course,
that you know perfectly well that there *is* such a thing. But I know
you're wrong - and you know I'm wrong - and that's the trouble with
cross-posting.

--
Richard Heathfield
"Usenet is a strange place" - dmr 29/7/1999
http://www.cpax.org.uk
email: rjh at the above domain, - www.
Jan 5 '07 #15
"Richard Heathfield" <rj*@see.sig.invalidwrote in message
news:nt*********************@bt.com...
Jim Langston said:

<snip>
>>
Unless you are storing a whole lot of these so size becomes an issue, it
is easier to just waste the extra 6 bits of the byte and store each value
in a byte so you can use std::vector and such more easy.

He can't use std::vector because there's no such thing. Except, of course,
that you know perfectly well that there *is* such a thing. But I know
you're wrong - and you know I'm wrong - and that's the trouble with
cross-posting.
Oh, my bad. I missed the fact he cross posted. I even looked and made sure
I was replying to comp.lang.c++ before I gave a c++ answer. Yes, cross
posting is evil.
Jan 5 '07 #16
In article <t8******************************@bt.com>,
Richard Heathfield <rj*@see.sig.invalidwrote:
>Umesh said:
>Suppose that I define an array of 2 bits {00,01,10,11} . Now when the
program finds A in the text file it replaces with 00, B with 01, C with
10 and D with 11. So the encoded file will take 1/8 of the space of the
original file.

A quarter.
True. But he's right, too. It does take an eighth of the space of the
original.

And then another eighth...

Jan 6 '07 #17
In article <fC*************@newsfe04.lga>,
Jim Langston <ta*******@rocketmail.comwrote:
>"Richard Heathfield" <rj*@see.sig.invalidwrote in message
news:nt*********************@bt.com...
>Jim Langston said:

<snip>
>>>
Unless you are storing a whole lot of these so size becomes an issue, it
is easier to just waste the extra 6 bits of the byte and store each value
in a byte so you can use std::vector and such more easy.

He can't use std::vector because there's no such thing. Except, of course,
that you know perfectly well that there *is* such a thing. But I know
you're wrong - and you know I'm wrong - and that's the trouble with
cross-posting.

Oh, my bad. I missed the fact he cross posted. I even looked and made sure
I was replying to comp.lang.c++ before I gave a c++ answer. Yes, cross
posting is evil.
You know, it is interesting. "Everybody knows" that (i.e., the
conventional wisdom is that) cross-posting is better than multi-posting,
but I have often argued that that bit of CW 'taint so. For, among other
reasons, this one. Cross-posting assumes that answers are correct (or,
more precisely, that answers can be evaluated) regardless of which forum
they are posted in. A perfectly reasonable layman's position, to be
sure, but, as we see here, not good enough for us experts.

Whereas, if the newbie multi-posts (which is his natural inclination,
given that many [most?] of the commonly available newbie tools - i.e.,
Google and Microsoft - make proper cross-posting difficult), he could then
follow the responses independently in each forum and deal accordingly.

P.S. Specific example. Every once in a awhile, somebody will post some
sort of Unix-y/C-y question, cross-posting it to a dozen or so Unix-y/C-y
groups, including clc, and the clc pedants will do their usual:

Off topic. Not portable. Cant discuss it here. Blah, blah, blah.

routine, posting that bit of valuable information to, of course, all
dozen or so groups - after which the post degenerates into the usual clc
bickering about topicality, all the while being posted to all dozen or
so groups. This despite the fact that the post *was* topical in
probably all but one (or maybe two, if clc++ was included and the
participants there are as anal as the clc guys) of those groups.

And the point, of course, is that simple multi-posting would have
avoided this mess.

Jan 6 '07 #18
Kenny McCormack escreveu:
In article <fC*************@newsfe04.lga>,
[snipped]
You know, it is interesting. "Everybody knows" that (i.e., the
conventional wisdom is that) cross-posting is better than multi-posting,
but I have often argued that that bit of CW 'taint so. For, among other
reasons, this one. Cross-posting assumes that answers are correct (or,
more precisely, that answers can be evaluated) regardless of which forum
they are posted in. A perfectly reasonable layman's position, to be
sure, but, as we see here, not good enough for us experts.

Whereas, if the newbie multi-posts (which is his natural inclination,
given that many [most?] of the commonly available newbie tools - i.e.,
Google and Microsoft - make proper cross-posting difficult), he could then
follow the responses independently in each forum and deal accordingly.

P.S. Specific example. Every once in a awhile, somebody will post some
sort of Unix-y/C-y question, cross-posting it to a dozen or so Unix-y/C-y
groups, including clc, and the clc pedants will do their usual:

Off topic. Not portable. Cant discuss it here. Blah, blah, blah.

routine, posting that bit of valuable information to, of course, all
dozen or so groups - after which the post degenerates into the usual clc
bickering about topicality, all the while being posted to all dozen or
so groups. This despite the fact that the post *was* topical in
probably all but one (or maybe two, if clc++ was included and the
participants there are as anal as the clc guys) of those groups.

And the point, of course, is that simple multi-posting would have
avoided this mess.
Perhaps the point is the 'experts' and zealots that have so quick
fingers to post about non topicality could change the behaviour either
not post at all (exchanging the 'off topic' repply by silence) or first
look at header of the msg and see if it is cross-posted.
Jan 6 '07 #19
Umesh wrote:
I only use
this four alphabet in my work.
Gene sequencing?
Jan 6 '07 #20
Cesar Rabak wrote:
Kenny McCormack escreveu:
.... snip ...
>>
And the point, of course, is that simple multi-posting would have
avoided this mess.

Perhaps the point is the 'experts' and zealots that have so quick
fingers to post about non topicality could change the behaviour
either not post at all (exchanging the 'off topic' repply by
silence) or first look at header of the msg and see if it is
cross-posted.
McCormack is a troll, and should always be ignored. In addition
the proper answer is to set follow-ups to a single group when
cross-posting, which will avoid the ever growing babble. Google
could do this automatically, by insisting that a cross-posted
article have a follow-up set.

--
Chuck F (cbfalconer at maineline dot net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net>
Jan 6 '07 #21
CBFalconer escreveu:
Cesar Rabak wrote:
>Kenny McCormack escreveu:
... snip ...
>>And the point, of course, is that simple multi-posting would have
avoided this mess.
Perhaps the point is the 'experts' and zealots that have so quick
fingers to post about non topicality could change the behaviour
either not post at all (exchanging the 'off topic' repply by
silence) or first look at header of the msg and see if it is
cross-posted.

McCormack is a troll, and should always be ignored. In addition
the proper answer is to set follow-ups to a single group when
cross-posting, which will avoid the ever growing babble. Google
could do this automatically, by insisting that a cross-posted
article have a follow-up set.
I agree that the person from the group that is in topic and gives a
contributive answer should do so!
Jan 6 '07 #22
On Sat, 6 Jan 2007 11:26:10 -0600, CBFalconer wrote
(in article <45***************@yahoo.com>):
McCormack is a troll, and should always be ignored.
True.
In addition
the proper answer is to set follow-ups to a single group when
cross-posting, which will avoid the ever growing babble.
Except for one small problem. If you do that, and it is adhered to, if
the OP replies to your response, and the followup was to a group you
don't yourself subscribe to, then you never see it. It's a nice idea,
but doesn't work all that well in practice, unless everyone subscribes
to all the groups anyway (gag).

Similarly, people complain about cross-posting, others complain about
multi-posting, of the two, the latter is far worse, as most newsreaders
are smart enough to delete all cross-posted messages (or at least mark
them as read) when you read the first one.
Google could do this automatically, by insisting that a cross-posted
article have a follow-up set.
Surely by now you realize Google has no interest in a proper NNTP
implementation, even if one could be agreed upon.
--
Randy Howard (2reply remove FOOBAR)
"The power of accurate observation is called cynicism by those
who have not got it." - George Bernard Shaw

Jan 10 '07 #23

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

8
by: Eric Lilja | last post by:
Hello, I had what I thought was normal text-file and I needed to locate a string matching a certain pattern in that file and, if found, replace that string. I thought this would be simple but I had...
13
by: M | last post by:
Hi, I've searched through the previous posts and there seems to be a few examples of search and replacing all occurrances of a string with another string. I would have thought that the code...
22
by: Michael Nahas | last post by:
Antti & all interested, The draft description of my language to replace C is available at: http://nahas.is-a-geek.com/~mike/MyC.pdf I am a long time C programmer (I read the old testament...
2
by: sck10 | last post by:
Hello, I am converting a DataList from vb to c#. I am having a problem converting the Replace function to c#. Any help with this would be appreciated. <asp:DataList id="dlstPhotoGallery"...
23
by: Umesh | last post by:
This is a basic thing. Say A=0100 0001 in ASCII which deals with 256 characters(you know better than me!) But we deal with only four characters and 2 bits are enough to encode them. I want to...
2
adelemb
by: adelemb | last post by:
Hi, I have a bit of JavaScript for a Tell a Friend link. The person enters an email into a box clicks submit and their email programme opens a new mail with the URL from the referring page. My...
16
by: spl | last post by:
To increase the performance, how to change the / operator with bitwise operators? for ex: 25/5, 225/25 or 25/3 or any division, but I am not bothered of any remainder.
1
by: neovantage | last post by:
Hey all, I am using a PHP script which creates headings at run time in a sense at page execution. I am stuck a with a very little problem which i am sure i will have the solution from experts. ...
0
by: DolphinDB | last post by:
The formulas of 101 quantitative trading alphas used by WorldQuant were presented in the paper 101 Formulaic Alphas. However, some formulas are complex, leading to challenges in calculation. Take...
0
by: DolphinDB | last post by:
Tired of spending countless mintues downsampling your data? Look no further! In this article, you’ll learn how to efficiently downsample 6.48 billion high-frequency records to 61 million...
0
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
1
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
0
by: Vimpel783 | last post by:
Hello! Guys, I found this code on the Internet, but I need to modify it a little. It works well, the problem is this: Data is sent from only one cell, in this case B5, but it is necessary that data...
0
by: ArrayDB | last post by:
The error message I've encountered is; ERROR:root:Error generating model response: exception: access violation writing 0x0000000000005140, which seems to be indicative of an access violation...
1
by: PapaRatzi | last post by:
Hello, I am teaching myself MS Access forms design and Visual Basic. I've created a table to capture a list of Top 30 singles and forms to capture new entries. The final step is a form (unbound)...
0
by: CloudSolutions | last post by:
Introduction: For many beginners and individual users, requiring a credit card and email registration may pose a barrier when starting to use cloud servers. However, some cloud server providers now...
0
by: af34tf | last post by:
Hi Guys, I have a domain whose name is BytesLimited.com, and I want to sell it. Does anyone know about platforms that allow me to list my domain in auction for free. Thank you

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.