Map data structure in pl/sql for storing key value pair?
Is there anyway to create a map data structure in pl/sql. ...
Is there anyway to create a map data structure in pl/sql. ...
Hi, What is the best algorithm to find if any three points are collinear in a set of points say n. Please also explain the complexity if it is not trivial. Thanks Bala ...
Hi, I have seen many questions on stackoverflow where dynamic programming technique can be used to make a exponential algorithm, a polynomial one. I have seen standard problems on dynamic programming. Is there a website or book that contains practice problems and solutions? Thanks Bala ...
How is an AVL tree different from a B-tree? ...
Hello Anyone know where I can obtain a sample implementation of a Directed Graph and sample code for performing a topological sort on a directed graph? (preferably in Java) Thanks ...
If databases can support up to millions of records, how is all of this data organized such that queries can be executed in a reasonable amount of time? ...
What are some good programs or web-based applications that can be used (preferrably (but not necessarily) for free) to create diagrams for computer science articles or dissertations? Particularly, I'm looking to represent data structures such as stacks, linked lists, trees, etc.. Any ideas? ...
I want a custom class object to hold data and have somehow the feeling that creating about 80 properties is not the best way of doing it. Most of the properties would be bool values, so i'm thinking about creating Arrays (keys / values) or (probably better) a NSDictionary attached to the object for holding the data. Does that make sense...
In particular an immutable List with a cons operation would be welcome. ...
Hey Stackoverflow I'm working on my homework and I'm trying to reverse a circular-linked deque without a sentinel. Here are my data structures: struct DLink { TYPE value; struct DLink * next; struct DLink * prev; }; struct cirListDeque { int size; struct DLink *back; }; Here's my approach to reversing the deque: void revers...
How can I convert xml to Python data structure using lxml? I have searched high and low but can't find anything. Input example <ApplicationPack> <name>Mozilla Firefox</name> <shortname>firefox</shortname> <description>Leading Open Source internet browser.</description> <version>3.6.3-1</version> <license name="Firefox EULA">...
Hi I have created a List data structure implementation for generic data type with each node declared as following. struct Node { void *data; .... .... } So each node in my list will have pointer to the actual data(generic could be anything) item that should be stored in the list. I have following signature for adding a node to...
I want to know what kinds of data structure in Java and not in the util package? For example: Hashmap, Collection, Set. Please give me a list of them as many as possible. Thank you OK, let me change a way to ask something: Except in util package, is there any data structures already implemented in JAVA, and if need to use them, we ...
I've started working on some Android applications and have a question regarding how people normally deal with situations where you have a static data set and have an application where that data is needed in memory as one of the standard java collections or as an array. In my current specific issue i have a spreadsheet with some pre-calc...
I have the following array structure (linked list): struct str_pair { char ip [50] ; char uri [50] ; str_pair *next ; } ; str_pair *item; I know to create a new item, I need to use item = new str_pair; However, I need to be able to loop through the array and delete a particular item...
how can I create an array of tuples in jsp (java) like (a:1, b:2) (c:3, d:4) ... ... ...
Does anyone know of a C++ data structure library providing functional (a.k.a. immutable, or "persistent" in the FP sense) equivalents of the familiar STL structures? By "functional" I mean that the objects themselves are immutable, while modifications to those objects return new objects sharing the same internals as the parent object wh...
I'm revisiting data structures and algorithms to refresh my knowledge and from time to time I stumble across this problem: Often, several data structures do need to swap some elements on the underlying array. So I implement the swap() method in ADT1, ADT2 as a private non-static method. The good thing is, being a private method I don't ...
In my code, Java TreeSet iteration is the dominant time factor. In looking at the system I believe that it is O(n) complexity. Can anyone verify this? I am thinking that by providing links backward from child node to parent node I could improve the performance. ...
I am working with a large list of points (each point has three dimensions x,y,z). I am pretty new with R, so I would like to know what is the best way to represent that kind of information. As far as I know, an array allows me to represent any multidimensional data, so currently I am using: > points<-array( c(1,2,0,1,3,0,2,4,0,2,5,0,2...