Search:

Yea I see the ping.c file, but these are pretty complex tools especially when they're being used in real life distribution. Thanks for the quick response. Hopefully someone in here has a basic...

I don't see a ping/icmp ping source files in that tar? Also these examples would not be what I call simple to follow. Thanks for your try, but I'll see if anyone else has a simplier example.

Hi,
I'm trying to find a simple ping client that would talk to a ping server that I have that's in java. I'm trying to create a simplistic ping client similar to the actual ping program found in...

Hi, I'm currently working on a mail client thats suppose to be in java that connects to a generic smtp server to send mail. We were told to find a C version and base off of the socket programming and...

I'm not even hacking. I'm taking a security course, and I'm trying to learn about buffer overflows. I know I could find material on the web, but I was hoping that someone might be able to take an...

Hello,
Can someone show me a quick example of code that performs a small buffer overflow that another driver application would be able to take advantage of the overflow and access a part of the code...

hm . . . quite unhelpful. If you can not contribute to answering the post, then its best for you to keep quiet.

I already know what an M-Way Search Tree is and the properties it holds such as the...

If I'm given a M-Way Search Tree, how would I determine it is a B-Tree with the parameter K < M, where K is the value that is to be inserted and M is the Order of the M-Way Search Tree. This is not...

How do you split a BST where the value X may or may not be in the tree into BST q,r , given that all the values in tree Q is less than or equal to X and tree r is greater than or equal to X ?

Happy thanksgiving everyone,

I'm trying to get a general idea of how to split a single binary search tree into two seperate tree. I was curious is there a general form or procedure to do this?...

nobody has worked with this ADT before?

I'm working on a project that uses hybrid trie ADT and I'm trying to finish the function Delete and Erase.

Delete is going to delete the d-tuple [x1,x2,x3,x4] from the Set S and Erase will clear...