|
what is the method to print the nodes of a B-tree of any degree?
in preorder or postorder...
sushma
|
|
|
|
|
Sounds like homework, so no help here.
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
|
|
|
|
|
I don't quite get your question so I can't help.
Paul Conrad wrote: Sounds like homework, so no help here.
What's wrong with helping people with homework as long as it is not the "can you do my project for me type of questions"? As long as their question is specific and is asking how to do something and not for the code itself why not?
|
|
|
|
|
MikeMarq wrote: as long as it is not the "can you do my project for me type of questions"?
Nothing is wrong with it, provided that it isn't asking for someone to do the work.
In this case, I think the problem is that the theory behind how to do a post-order and in-order traversal of a tree should have been covered in class before giving the assignment.
|
|
|
|
|
This definately sounds like a homework problem and the theory behind how to do a pre-order and post-order traversal should have been covered in class. You can try looking here http://en.wikipedia.org/wiki/Post-order_traversal[^] for more conceptual information, but no one here is going to just give you the code.
|
|
|
|
|
well well...this was not posted with t intention of getting my homework done.....
ok i got tht 4m t site ...thanx!
|
|
|
|
|
Hi dear reader. I did symmetric key data encryption and decryption algorithms, which are focused on small one byte for encrypting and output sixteen bytes for decryption, ready but problem is that i could not checked it my strength of the algorithm yet because of the not sure the criteria of the measurements for cryptography and algorithm as well. I hope a professional person,who are good the cryptography or got expensive experience of at this area, can help me to resolve my problem and can advice what i to do that is better. Help me please?
Thank you
Regards Bimbaa
-- modified at 9:56 Tuesday 30th October, 2007
|
|
|
|
|
it should measure the strength of the algorithm by measure the criteria of your algorithm.
Take my advice
1. the algorithm should implement it and check the speed of your program. the program should run in high speed time to avoid the atacker to attack your application....this is first criteria.
2. the data model who want to secure it should be consistent to be insure that your algoeith work correctly.
3. analyze the cost of the algoeith also good
4. ask the mathmatical person for another criterias measure criteria because the speed only not enough.
researcher need advice
|
|
|
|
|
Hi Bimbaa,
Bimbaa wrote: ...can help me to resolve my problem and can advice what i to do that is better.
Perhaps the Usenet group sci.crypt[^] will prove to be a better resource for you.
Jeff
|
|
|
|
|
http://csrc.nist.gov/nissc/1997/proceedings/128.pdf
Need a C# Consultant? I'm available.
Happiness in intelligent people is the rarest thing I know. -- Ernest Hemingway
|
|
|
|
|
Oh thanks dear. This paper is important for me and published ready before ten years ago. Is the criteria of measurement for the cryptography in this paper still same with nowadays criteria?
|
|
|
|
|
I would imagine so. If not it is still a good baseline.
Need a C# Consultant? I'm available.
Happiness in intelligent people is the rarest thing I know. -- Ernest Hemingway
|
|
|
|
|
If you are lucky (I was once), you could pose your question to Prof. Rivest. You'll stand a much better chance of receiving help if you ask specific questions that can be easily answered without the reader having to invest much time.
"Normal is getting dressed in clothes that you buy for work and driving through traffic in a car that you are still paying for, in order to get to the job you need to pay for the clothes and the car and the house you leave vacant all day so you can afford to live in it." - Ellen Goodman
"To have a respect for ourselves guides our morals; to have deference for others governs our manners." - Laurence Sterne
|
|
|
|
|
Hey David Crow. This is also important for me. Thank you for your giving contacts.
|
|
|
|
|
It's not like I gave you secret information. His Web page, as well as his e-mail address, are public.
"Normal is getting dressed in clothes that you buy for work and driving through traffic in a car that you are still paying for, in order to get to the job you need to pay for the clothes and the car and the house you leave vacant all day so you can afford to live in it." - Ellen Goodman
"To have a respect for ourselves guides our morals; to have deference for others governs our manners." - Laurence Sterne
|
|
|
|
|
Yes. dear your right. I have seen the contact and sent him a mail ready. Thank you again.David
|
|
|
|
|
Hi,everyone,
This is my first time to post here. This website is amazing and I get a lot of help.
I have a question. You may hear about variable elimination in the subject of Artificial Intelligence. But how can I realize this algorithm, using what data stucture to store the datas. What is the format of output data? If anyone has good idea or even the source code (C++ prefered), please tell me ASAP. Thanks very much.
Best wishes.
|
|
|
|
|
Google might help.
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
|
|
|
|
|
Dear All, I have read bimbaa issues and i'm currently doing same oh him/her encryption/Decryption algorith at Qatar University and i wrote the algorithm for that but i want to measure the strength of my algorithm and i dont know how,exactly i dont know what the critria that i should use it to measure it. Moreover, my output consist of 1 byte as well my input.if u say not enough because the standard one should be at least 16 bytes then i will say that any hacker not know what is the original data that i encrypted as well i feel the speed of my application ( the application of the algorithm)if high speed then the attacker cannot hack my security data. Please, advice me.
researcher need advice
|
|
|
|
|
"Real programmers just throw a bunch of 1s and 0s at the computer to see what sticks" - Pete O'Hanlon
|
|
|
|
|
hai all,
i need some algorithm to find the day code(1 to 366) based on the date.
for example, the code for feb 2nd 2007 will be
31+2=33.
for march 2nd 2007 will be 31+28+2=61
and for march 2nd 2008 will be 31+29+2=62 since 2008 is a leap year.
iam sure that, this is not a very big task. but, how simple our logic is, matters.
any ideas please?
|
|
|
|
|
chandu004 wrote: hai all,
i need some algorithm to find the day code(1 to 366) based on the date.
for example, the code for feb 2nd 2007 will be
31+2=33.
for march 2nd 2007 will be 31+28+2=61
and for march 2nd 2008 will be 31+29+2=62 since 2008 is a leap year.
iam sure that, this is not a very big task. but, how simple our logic is, matters.
any ideas please?
There probably is a way, in the language that you use, to subtract two dates and return the result in days. Just subtract 31 Dec of the previous year from the date that you want...
|
|
|
|
|
oh cool,
nice technique.
how ever, i strained my brain for half an hour and wrote a three lined logic to achieve this.
thank you.
|
|
|
|
|
century years rules (of course if you need to deal with):
(1) Century years aren't leap years (though they're divisible by 4).
(2) Century years divisible by 400 (as 2000, for instance) are leap years.
Maybe you have to further strain your brain.
If the Lord God Almighty had consulted me before embarking upon the Creation, I would have recommended something simpler.
-- Alfonso the Wise, 13th Century King of Castile.
|
|
|
|
|
yes pallini,
i certainly had to deal with it and iam aware of it.
thank you.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
