Questions regarding efficient storing and representing data within a software application.
2
votes
1answer
30 views
How should I architect my Model and Data Access layer objects in my website?
I've been tasked with designing Data layer for a website at work, and I am very interested in architecture of code for the best flexibility, maintainability and readability.
I am generally acutely ...
0
votes
1answer
31 views
Java Alphabetize Algorithm Insertion sort vs Bubble Sort
I am supposed to "Develop a program that alphabetizes three strings. The program should allow the user to enter the three strings, and then display the strings in alphabetical order." It's instructed ...
1
vote
2answers
76 views
Count function on tree structure (non-binary)
I am implementing a tree Data structure in c# based (largely on Dan Vanderboom's Generic implementation). I am now considering approach on handling a Count property which Dan does not implement.
The ...
2
votes
3answers
118 views
Serializing Data Structures in C
I've recently read three separate books on algorithms and data structures, tcp/ip socket programming, and programming with memory. The book about memory briefly discussed the topic of serializing data ...
0
votes
0answers
135 views
Microsoft Interview Preparation [closed]
I have 8 years of java background.
Need help in identifying topics I need to prepare for Microsoft interview. I need to know how many rounds Microsoft will have and what all things these rounds ...
5
votes
2answers
79 views
Data structures for storing finger/stylus movements in drawing application?
I have a general question about creating a drawing application, the language could be C++ or ObjectiveC with OpenGL.
I would like to hear what are the best methods and practices for storing strokes ...
2
votes
1answer
67 views
2D grid with multiple types of objects
This is my first post here in programmers.stackexchange (I'm a regular on SO). I hope this isn't too general.
I'm trying a simple project to learn Java from something I've seen done in the past. ...
2
votes
1answer
35 views
Separating validation from persistence in models?
Models in an MVC application gets kind of hard to test when validation of data and persistence of data is baked together in the model. I would like to test those separately to prevent doing ...
2
votes
3answers
87 views
Internal Mutation of Persistent Data Structures
To clarify, when I mean use the terms persistent and immutable on a data structure, I mean that:
The state of the data structure remains unchanged for its lifetime. It always holds the same data, ...
6
votes
1answer
101 views
Unit testing a text index
Consider a text index such as a suffix tree or a suffix array supporting Count queries (number of occurrences of a pattern) and Locate queries (the positions of all the occurrences of a pattern) over ...
3
votes
1answer
134 views
Efficient Data Structure for this particular problem
Problem Link - http://opc.iarcs.org.in/index.php/problems/NUMTRIPLE
In my opinion, the problem can be solved by a data structure, that shows how each number is connected to another, and via recursion ...
3
votes
1answer
61 views
Amazon Kindle - Whispersync implementation?
For those who are not aware of Kindle's whispersync, here is how it works (from amazon.com):
"...Whispersync synchronizes the bookmarks and furthest page read among devices registered to the same ...
0
votes
1answer
31 views
Create association between informations
I deployed a project some days ago that allow to extract some medical articles using the results of a questionnaire completed by a user. For instance, if I reply on questionnaire I'm affected by ...
1
vote
2answers
120 views
Does the Head(start) pointer of Doubly Linked list points previously to the tail(last) node
I have one question in my mind that in case of circular doubly linked list the head pointer of the doubly linked list also logically point to the next pointer of the tail node of the linked list and ...
2
votes
1answer
263 views
Most efficient Implementation a Tree in C++
I need to write a tree where each element may have any number of child elements, and because of this each branch of the tree may have any length.
The tree is only going to receive elements at first ...
