Creating a minimized DFA
Anyone know a good site that explains step by step how to create a minimized Deterministic Finite State Automaton? I found a few site, but they don't go into enough detail on the process. Thanks....
3 answers | 211 bytes |
"Matrix" generation optimization
Hi, I'm currently reading a problem book (examples are written in FORTRAN, but the problems are interesting none the less) from the late 80's that I got at my local library just keep my brain alive and learn more C++ at the same time.I'm currently solving (actually, I already (partial...
4 answers | 4802 bytes |
computation time
hello peoplei was wondering if anyone could come up with a program that could excatly compute the amount of time that it takes for a simple arthimetic operation. I mean lets assume that there is a simple addition program, is it possible to find the exact amount of time that it took for the computati...
1 answers | 387 bytes |
computer graphics - how to check a point in a polygon ?
hello everyone, I need to check whether the click point is inside a polygon(made up of a set of points) , if you know the algorithm or tips, plz help, tks....
2 answers | 160 bytes |
Can U help me to write preorder traverse for n-child tree
HI I need program like that Preorder traverse using recursive procedure for n order child treeplz can U help me with in this Issue...
2 answers | 135 bytes |
Claims that < as <= for the sake of proving BigOh
Definition of BigOh says that 0<=f(x)<=Cg(x), for x>=k, where C is positive constant, and k is nonnegative constant;To prove n+1 is belong to BigOh(n),we purposely take C=4, k=1But in this case it is n<4(n+1) for x>1,can we still write it as n<=4(n+1) for x>1, and says that C=4...
3 answers | 388 bytes |
Chess
I need some ideas on how a chess game is programmed. Thanks in advance,Ted...
7 answers | 89 bytes |
Check a Point lies in a Line segment
Gurus,Can you please guide me to find the logic or algoirthm to check whether a Point P(x, y) lies in a Line constructed by two Points A(x, y) & B(x, y)?Thanks in advance....
4 answers | 191 bytes |
Change into something more of a recursive code snip
for(int i=0;i<10;i++) for(int j=0;j<10;j++){ if(i==j) Dosomething(); else Dosomethingelse(); }Thanks in advance-Yaskatze...
7 answers | 182 bytes |
bool matrix conversion - urgent
Hi !I have a nice logical problem.I have a matrix of boolean values like this:|--------||Matrix |User1|User2|User3||---|--|--|--||Object1|false|true |true ||---|--|--|--||Object2|true |false|true ||---|--|--|--||Object3|true |true |true ||---|--|--|--||Object4|false|false|false||---|--|--|--||Objec...
5 answers | 1580 bytes |
Calculate the median using only counters
Somebody must have an algorithm for this. Here's the situation:I have a stream of integers of known size (12 bit) and known cardinality (i.e., how many integers there are).I also have 2 counters that will count the numbers <= or >= limit values that I can set (which can be different for...
15 answers | 1726 bytes |
Basics of computing
Hi all, I will graduate in this year and I want to pass an IT exam at the end of my school. Everything's cool but I don't have any IT lessons at school. And I don't know the basics of programming but have some experience with C/C++.And my question is if anyone can answer me to these...
17 answers | 1407 bytes |
bidirectional pseudo random number generator
many forms of PRN generator are recursive functions like x1 = f( x0 )wich means the new RND comes from the computation of some algo on a previous value of the same algo.for instance, the C rand() function works like this... simply the fact of passing the previous value on and on is hidden to the use...
3 answers | 797 bytes |
B+ Tree: Is it Good for In-Memory Usage Too
I'm implementing a virtual list view control that could potentially hold a few million entries that will be kept in memory (i.e., not stored to disk until program is exited). I want to provide a search ability, and to ensure that each item in the list is unique. I was thinking about using a B...
5 answers | 943 bytes |
B+ tree in C language
I think the title speaks out for its self alone :PI am working on a project which simulates an operation system and need B+ tree functions in C to handle the data.If anyone could help, I'd praise him!I searched a lot in the web but came up with nothing:(PS:Regards from a Greek student!!...
1 answers | 332 bytes |
- B*tree
- Asymptotically non negative functions
- Asymptotic Growth
- Audio Theory - Harmonicity
- Algorithms and Data Structures
- Algorithms partition
- Algorithm: xml parallel sequence storage
- Algorithm to store paths
- Asymptotic growth
- Algorithm to form maximum pairs
- Algorithm to compare vectors/lists/arrays of ordered numbers
- Algorithm that searches for multiple patterns in a string?
- Algorithm for plotting large no of points
- Algorithm for optimal teritorial coverage
- an array problem
- All Possible Combinations
- Home - About Us - Contact - Privacy Statement - Link Exchange - Bookmark - Map.XML - Rss.Xml
- Copyright 2001-2009 by VISUAL C++ TECH Information Technology Co.,Ltd All rights reserved
- 0.438