I need to program this.
I'm not asking any code, but an idea from you would be helpful.
Thanks.
I open a binary file stream,
which has millions or trillions of 1's & 0's
some thing like this 1100100011101110111..........
for easy understanding lets take this
1 1 0 0 0 0 1 =X
assume there is an idle case like this
1 1 1 1 1 1 1 = Y
now Y has 7 cases, each case has 2 chances
either 1 or 0
'Z' is particular case
first position is changed to 0
1 1 1 1 1 1 0
and matched with X
not as a number[whether x is y, or not], but from left to right
checking 'individual' digits
If one digit is not matching, then the case is failed
if true, then checking Y's 2nd digit with X's ,so on
if all the cases are failed
Now Y's second case is
1 1 1 1 1 0 1
1 1 1 1 1 0 0
and again repeating the same procedure
if x & y has trillions of 1's and 0's
what is the complexity of the program
can I take Z count,
so that
If I change the 1 1 1 1 1 1 1=Y
for Z count times,
I can get X.
Thanks. 5 1960
On 20 Nov, 09:49, cnoe <azeez...@gmail.comwrote:
I'm guessing your first language isn't english.
I'm left struggling to understand what you mean.
Could you provide a sample input and its corresponding
output.
input string: "1100001"
output string: "1111110"
or whatever
I need to program this.
The first step is to clearly define what you are trying to do
I'm not asking any code, but an idea from you would be helpful.
Thanks.
I open a binary file stream,
which has millions or trillions of 1's & 0's
some thing like this 1100100011101110111..........
those are actual bits? Or characters?
for easy understanding lets take this
1 1 0 0 0 0 1 =X
why are there seven of them? Why not 8?
assume there is an idle case like this
1 1 1 1 1 1 1 = Y
why is this an "idle case"? Assume we have no idea what
your problem domain is.
now Y has 7 cases, each case has 2 chances
either 1 or 0
'Z' is particular case
a particular 1 or 0?
first position is changed to 0
1 1 1 1 1 1 0
and matched with X
how can you compare a position (a single bit?) with
7 bits?
not as a number[whether x is y, or not],
what are x and y?
but from left to right checking 'individual' digits
nope you completly lost me here. Could you give an example?
If one digit is not matching, then the case is failed
why can't you just load the bits into a byte and compare the bytes?
if true,
does "true" mean "matching"?
then checking Y's 2nd digit with X's ,so on
what?
if all the cases are failed
what?
Now Y's second case * is
I thought a "case" was a bit (or a bit position)
1 1 1 1 1 0 1
1 1 1 1 1 0 0
and again repeating the same procedure
if x & y has trillions of 1's and 0's
what is the complexity of the program
do you mean as in big-O?
can I take Z count,
Z?
*so that
If I change the 1 1 1 1 *1 1 1=Y
you change the value of Y?
for Z count times,
what does "Z count" mean?
I can get * * X.
Thanks.
no problem...
--
Nick Keighley
On Nov 20, 3:18*pm, Nick Keighley <nick_keighley_nos...@hotmail.com>
wrote:
On 20 Nov, 09:49, cnoe <azeez...@gmail.comwrote:
I'm guessing your first language isn't english.
I'm left struggling to understand what you mean.
Could you provide a sample input and its corresponding
output.
input string: *"1100001"
output string: "1111110"
or whatever
I need to program this.
The first step is to clearly define what you are trying to do
I'm not asking any code, but an idea from you would be helpful.
Thanks.
I open a binary file stream,
which has millions or trillions of 1's & 0's
some thing like this 1100100011101110111..........
those are actual bits? Or characters?
for easy understanding lets take this
1 1 0 0 0 0 1 =X
why are there seven of them? Why not 8?
assume there is an idle case like this
1 1 1 1 1 1 1 = Y
why is this an "idle case"? Assume we have no idea what
your problem domain is.
now Y has 7 cases, each case has 2 chances
either 1 or 0
'Z' is particular case
a particular 1 or 0?
first position is changed to 0
1 1 1 1 1 1 0
and matched with X
how can you compare a position (a single bit?) with
7 bits?
not as a number[whether x is y, or not],
what are x and y?
but from left to right checking 'individual' digits
nope you completly lost me here. Could you give an example?
If one digit is not matching, then the case is failed
why can't you just load the bits into a byte and compare the bytes?
if true,
does "true" mean "matching"?
then checking Y's 2nd digit with X's ,so on
what?
if all the cases are failed
what?
Now Y's second case * is
I thought a "case" was a bit (or a bit position)
1 1 1 1 1 0 1
1 1 1 1 1 0 0
and again repeating the same procedure
if x & y has trillions of 1's and 0's
what is the complexity of the program
do you mean as in big-O?
can I take Z count,
Z?
*so that
If I change the 1 1 1 1 *1 1 1=Y
you change the value of Y?
for Z count times,
what does "Z count" mean?
I can get * * X.
Thanks.
no problem...
--
Nick Keighley
here it is
take a sequence some thing like this
1 0 1 0 1 1 1 1 0 1 1 1 [total 12 here]
1 1 1 1 1 1 1 1 1 1 1 1 1 [create an idle case with 12 1's]
if I keep changing the idle sequence with 1's and 0's
in which case I can get the original given
sequence.
thanks.
cnoe wrote:
<snip>
1 1 1 1 1 1 1 1 1 1 1 1 1 [create an idle case with 12 1's]
s/idle/ideal/ ??
Bye, Jojo
On 20 Nov, 10:24, cnoe <azeez...@gmail.comwrote:
On Nov 20, 3:18*pm, Nick Keighley <nick_keighley_nos...@hotmail.com>
wrote:
On 20 Nov, 09:49, cnoe <azeez...@gmail.comwrote:
I'm guessing your first language isn't english.
I'm left struggling to understand what you mean.
Could you provide a sample input and its corresponding
output.
input string: *"1100001"
output string: "1111110"
or whatever
I need to program this.
The first step is to clearly define what you are trying to do
I'm not asking any code, but an idea from you would be helpful.
Thanks.
I open a binary file stream,
which has millions or trillions of 1's & 0's
some thing like this 1100100011101110111..........
those are actual bits? Or characters?
for easy understanding lets take this
1 1 0 0 0 0 1 =X
why are there seven of them? Why not 8?
assume there is an idle case like this
1 1 1 1 1 1 1 = Y
why is this an "idle case"? Assume we have no idea what
your problem domain is.
now Y has 7 cases, each case has 2 chances
either 1 or 0
'Z' is particular case
a particular 1 or 0?
first position is changed to 0
1 1 1 1 1 1 0
and matched with X
how can you compare a position (a single bit?) with
7 bits?
not as a number[whether x is y, or not],
what are x and y?
but from left to right checking 'individual' digits
nope you completly lost me here. Could you give an example?
If one digit is not matching, then the case is failed
why can't you just load the bits into a byte and compare the bytes?
if true,
does "true" mean "matching"?
then checking Y's 2nd digit with X's ,so on
what?
if all the cases are failed
what?
Now Y's second case * is
I thought a "case" was a bit (or a bit position)
1 1 1 1 1 0 1
1 1 1 1 1 0 0
and again repeating the same procedure
if x & y has trillions of 1's and 0's
what is the complexity of the program
do you mean as in big-O?
can I take Z count,
Z?
*so that
If I change the 1 1 1 1 *1 1 1=Y
you change the value of Y?
for Z count times,
what does "Z count" mean?
I can get * * X.
Thanks.
no problem...
--
Nick Keighley
don't quote sigs
here it is
here *what* is?
take a sequence some thing like this
1 0 1 0 1 1 1 1 0 1 1 1 *[total 12 here]
1 1 1 1 1 1 1 1 1 1 1 1 1 [create an idle case with 12 1's]
that's 13 1's. I asked you to give an example of both
input and output. You have not provided the output.
f("101011110111","111111111111) -??
you have a mapping that's takes two sequences of bits as
an input and produces... what exactly?
if I keep changing the idle sequence with 1's and 0's
what does this mean?
in which case I can get the original given
sequence.
I've no idea what this means.
If you can't state your problem then I don't see how
you can expect to write a program to solve it.
I probably won't reply to you again.
You seem like a time waster.
--
Nick Keighley
cnoe wrote:
I need to program this.
I'm not asking any code, but an idea from you would be helpful.
Thanks.
I open a binary file stream,
which has millions or trillions of 1's & 0's
some thing like this 1100100011101110111..........
Are you talking about bits or bytes?
What do you think
"binary file stream"
means in C?
--
pete This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Siddharth Taneja |
last post by:
Hi,
I have a very simple prg over here, trying to read the lines of a file
#include <iostream>
#include <fstream>
#include <iostream>
#include <string>
using namespace std;
|
by: gnv |
last post by:
Hi all,
I am writing a cross-browser(i.e. 6 and netscape 7.1) javascript
program to save an XML file to local file system.
I have an xml string like below:
var xmlStr = "<?xml version="1.0"...
|
by: Johnny Google |
last post by:
Here is an example of the type of data from a file I will have:
Apple,4322,3435,4653,6543,4652
Banana,6934,5423,6753,6531
Carrot,3454,4534,3434,1111,9120,5453
Cheese,4411,5522,6622,6641
The...
|
by: Sky Sigal |
last post by:
I have created an IHttpHandler that waits for uploads as attachments for a
webmail interface, and saves it to a directory that is defined in
config.xml.
My question is the following:
assuming...
|
by: Daniel Corbett |
last post by:
I am trying to save a file dynamically created in a webpage. I get the
following headers, but cannot figure out how to save the attachment. I am
basically trying to replicate what internet...
|
by: IcingDeath via DotNetMonster.com |
last post by:
I am building this SQL Server database app in which i can store files. In
order to display files I want to have the app show the associated icon for
the extension of the file that is in the...
|
by: rony_16 |
last post by:
Hi,
I have a program that connects to a site With WebRequest and
WebResponse .
The response of this site is a file (csv file).
The problem is that the file do not comes as a stream , hi is a part...
|
by: AdrianH |
last post by:
Assumptions
I am assuming that you know or are capable of looking up the functions I am to describe here and have some remedial understanding of C++ programming.
FYI
Although I have called...
|
by: J055 |
last post by:
Hi
I have the following code. I upload an XML file using the FileUpload object,
store the stream in a session so the user gets the chance to confirm some
options then pass the stream from the...
|
by: Dennis |
last post by:
Hi, I have a text file that contents a list of email addresses like
this:
"foo@yahoo.com"
"tom@hotmail.com"
"jerry@gmail.com"
"tommy@apple.com"
I like to
|
by: ryjfgjl |
last post by:
ExcelToDatabase: batch import excel into database automatically...
|
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...
|
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...
|
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...
|
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...
|
by: Defcon1945 |
last post by:
I'm trying to learn Python using Pycharm but import shutil doesn't work
|
by: Shællîpôpï 09 |
last post by:
If u are using a keypad phone, how do u turn on JavaScript, to access features like WhatsApp, Facebook, Instagram....
|
by: Faith0G |
last post by:
I am starting a new it consulting business and it's been a while since I setup a new website. Is wordpress still the best web based software for hosting a 5 page website? The webpages will be...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 3 Apr 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome former...
| |