General Programming
in [Programming]
|
Patricia Tree I'm trying to understand the Patricia Tree, specifically how to build a Patricia Tree. Can anyone point me into a good source or give me an idea of how it works? Thanks, Jason ... 28 Mar 2006 23:57
doubly linked list Hi, I want to insert a node in an sorted doubly linked list of integers in ascending order. The list should not have duplicate nodes. I need an algorithm (assuming an object oriented language) bye ... 25 Mar 2006 20:00
permutations A common application for recursion is the problem of generating all possible permutations of a set of symbols. For the se consisting of symbols A,B and C there exists six permutations - namely, ABC, ACB, BAC, BCA, CBA and CAB. The set of permutations of N symbols is generated by taking each symbol in turn and prefi... 24 Mar 2006 14:09
Autoexec in Windows XP / Strange symptoms Hello there I recently bought a new computer, running Windows XP. On my previous computer, which ran Dos 5, I had a program I had written called logger, and I ran this in the AUTOEXEC.BAT file. The program wrote the date and time to a particular file. Part of the point of this was to keep a record of when I used... 23 Mar 2006 16:53
I have silly question... I have 64bit processor (Intell 630D) system, and install 32bit OS on it what happen if I try to run a program written with 64bit assembly language such that not use any external function. (assume assembling with cross assember) it is possible make run the 64bit assembly program ? ... 23 Mar 2006 19:28
Checking for Modification to a Set of Files What is the best way to write a program to check a set of files for changes to their content? I want to be able to have tasks executed based on this change. ... 29 Mar 2006 09:57
How to find the maximum sum of atleast L consecutive integers given a sequence of N integers. Hi all, How can we find the maximum sum of atleast L consecutive integers given a sequence of N integers. The brute force approach of forming all possible length sequences at every index and finding their sum gives an O(N^2) solution which is not desirable. Can somebody tell me a better approach for this ? ... 21 Mar 2006 06:17
implementation suggestions In scientific problems it is often required to create enumerations of combinations or partitions of sets, like e.g. list all the possible ways to create the number M as a sum of exactly N components (a special version of subset sum "knapsack" problems). I have implemented such algorithms in various occasions and... 17 Mar 2006 15:49
Ideas on Reverse Engineering ;-) Hey all, Well it's not exactly reverse engineering. Basically here's the deal. I want to defer certain network calls made by Asterisk (an open source pbx) to my own network stack implementation. So my plan of action is to basically run gdb to see which files/processes of Asterisk make the socket connections... 13 Mar 2006 07:01
meaning of if condition and looping please give another meaning of looping and if condition...... and example plsss.... ... 11 Mar 2006 22:28 |