|
The following should give you some ideas:
http://en.wikipedia.org/wiki/Patricia_tree[^]
...cmk
The idea that I can be presented with a problem, set out to logically solve it with the tools at hand, and wind up with a program that could not be legally used because someone else followed the same logical steps some years ago and filed for a patent on it is horrifying.
- John Carmack
|
|
|
|
|
What are you gonna do exactly ?
Do you want to identify the strings that contain house,green,H,G ?
|
|
|
|
|
not exactly. I have some strings and i have no idea which they are.
I have to identify the recurrent substrings such as house, green...but i don't have them as input..
Program your life ^^
|
|
|
|
|
Some of the problem parameters aren't clear: Do the recurrent strings always start at the beginning of the line? Do you just ignore non-letters (numbers and punctuation)?
If the answer to both of these questions is yes, you can do this:
1. For each line
2. Extract the string of just the letters from the beginning of the line.
3. See if this string is in a hash table. If so, it's a recurrent string.
4. Else insert this string into the hash table.
If the strings don't always start at the beginning of the line, you have to do multiple insertions for each string: the whole string, the substring starting at the 2nd letter, 3rd letter, etc...
|
|
|
|
|
You need to look at using a data structure like a Trie[^], or as was already pointed out Patrcia Trie[^]. The Wikipedia articles should give you enough information to get started on an actual implementation.
Scott Dorman Microsoft® MVP - Visual C# | MCPD
President - Tampa Bay IASA
[ Blog][ Articles][ Forum Guidelines]
Hey, hey, hey. Don't be mean. We don't have to be mean because, remember, no matter where you go, there you are. - Buckaroo Banzai
|
|
|
|
|
When you aren't a mathematician, it's a pain. When you know what its called, there are pages and pages of info. But people rarely put "The DooDingle algorithm calculates the surface area of a dodecahedron cut by a given XYZ plane" on their webpages.
So half the battle is trying to find out what you should be Googling for.
(Incidentally, I'm trying to find a method of locating the bounding triangle in a Delaunay triangulation for any given coord XY, where the vertices of the triangles are a random set of XYZ coords. Then I can work out the Z at any XY, given my grid).
|
|
|
|
|
Try Googling for Delaunay. I have seen it there as well as under "Convex Hull".
Dave.
|
|
|
|
|
Hi! I am working on a graphing application which plots math functions (for example sin(x)). At this stage the program works but in some cases the graph isn't correct. The program calculates the points of the graph and finds the point (x,f(x)). But some calculations return very small numbers an the graph is not correct. In order to fix this I decided also to calculate the limits of the function in the non defined points (for example lim 1/x, x->0). If someone has stumbled upon some articles or knows something about the problem, let me know. (Google only showed me the math definition of the limit, but I couldn't find an algorithm). Thanks!
Still learning...
|
|
|
|
|
It might be a good idea to identify which inputs return wrong answers, then try to find a pattern in the errors. Fixing the underlying bug will produce a more reliable program than adding a patch involving limits.
|
|
|
|
|
Hi......i need help in ASP.NET for vs 2005 to develop an e commerce website for my final year B.Tech. project....plz guide me...........specially how to develop credit cart verification transaction and shopping cart module??????????
|
|
|
|
|
Well, you'd normally start out by defining your requirements. Possibly you'll want to draw some high level use cases out of these, and then you'll want to break these down into a more detailed design. From there, you can pull together your basic code.
|
|
|
|
|
Pete O'Hanlon wrote: Well, you'd normally start out by defining your requirements. Possibly you'll want to draw some high level use cases out of these, and then you'll want to break these down into a more detailed design. From there, you can pull together your basic code.
Very good advise...
If you want to try doing some Data Flow Diagrams(DFD's). Could help with how you want to the project to flow.
|
|
|
|
|
My objective is to made an online shopping website based on ASP.NET 2.0 ,for which i m using visual studion IDE and prograaming in C#............i need a good ebook on ASP.NET which includes session management as well as database handling......I have made modules.......I m facing difficulty in shopping cart implementation and credit card verification modules..........
|
|
|
|
|
Dear shriyangika,
First of all you should be knowing how the data is flowing.take paper and pencil note down everything what ever coming in your mind about the project ..
as you told
shriyangika wrote: I have made modules.......I m facing difficulty in shopping cart implementation and credit card verification modules..........
whats the module.. how it looks like...and what exact problem you are facing... if you can tell all these it will helpful for the one who is trying to help you here..
vikas da
|
|
|
|
|
You're tackling the problem from the wrong side here. You're talking the technology end when, what you should be doing, is actually working out what the problem really is.
|
|
|
|
|
i explained technology and tools which i m using to implmnt my project...actuall y i m facing problem in database handling and database management in ASP.NET......i have already decided for modules and.....rest of the things.......but how to use database through ASP.NET controls.......i mean dataset and datagrid view control....
Designing of pages i hv done..........but database handling i m nt able to do...
|
|
|
|
|
I am a student of final year MCA doing a project on intelligent tutoring systems ,i dont know which algorithm to use that will suit best to my project.... help me!
|
|
|
|
|
I'd say you should design a data structure that models what the student knows, and how well they know it. Then use this data to select tutorial topics. Then give quizzes and use the results to update the data structure.
|
|
|
|
|
I have binary tree
And I want to traverse this tree level by level
that's mean print the level zero then level one ....etc
how can I do that
|
|
|
|
|
where you get the binary tree from?
as far as i know there is not one included in .Net framework (or whatever your using)(I may be wrong).
But basically you would need to know how it works before you can move through it.
If you made your own then you should know this answer.
|
|
|
|
|
thanks so much
I am study data structure specially non linear data structure
and I need algorithm to solve my problem I know about BFS but I think
this used in graph only my be my teacher Will Not accept this BFS in binary tree
thanks another time
|
|
|
|
|
A binary tree IS a graph. You can use a BFS quite easily on a binary tree.
|
|
|
|
|
|
You need to find out about 'recursion' techniques
|
|
|
|
|
I'm sure there must be a reasonably simple way to do this.....probably something recursive.
I have X apples and want to split them into groups with a maximum M apples in each group. I want to have the minimum number of groups, but for each group to be 'as equal as possible'.
I think the min number of groups is simply CEILING(X/M, 1)
e.g.,
X = 9, M = 4, groups would be 3, 3, 3 (not 4, 4, 1)
X = 137, M = 25 :: (23, 23, 23, 23, 23, 22)
X = 23, M = 5 :: (5, 5, 5, 4, 4)
etc.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
