Problem Detail: This is a sort of edit-distance question, and is very easy. I am just quite brain dead on this subject and can’t figure it out so far. Given a series of numbers, e.g. [3, 1, 1, 1] How Read More …
Category: Uncategorized
Clustered index is dense or sparse?
Problem Detail: I am confused about clustered index is dense or sparse. I searched for that, sources saying it is sparse, but can be dense also. What is it exactly? Asked By : user1218927 Answered By : tanmoy Clustering index is applied when Read More …
Why is factoring large integers considered difficult?
Problem Detail: I read somewhere that the most efficient algorithm found can compute the factors in $O(exp((64/9 cdot b)^{1/3} cdot (log b)^{2/3})$ time, but the code I wrote is $O(n)$ or possibly $O(n log n)$ depending on how fast division and Read More …
What are the different types of databases?
Problem Detail: Is there is a study or classification available on different types of databases? (Examples include structured, unstructured, semi structured relational, object oriented, folksonomies, etc.) Asked By : sashank Answered By : Romuald One of the key differences between the different paradigms Read More …
Is $(a^nb^m)^r$ regular?
Problem Detail: I took my theory of computation exams a few weeks ago, and this was one of the questions: Assume language $L={(a^nb^m)^r mid n,m,rge 0}$ Is L regular? If yes provide a regular expression or an automaton for it. After Read More …
LSD and MSD sorting – which requires fixed length keys?
Problem Detail: I am studying these sorts, but it is still unclear to me which one of these two would require fixed length keys? Asked By : user2461994 Answered By : hanugm MSD(Most Significant Digit) radix sort needs fixed length keys as input. Read More …
Simplify complexity of n multichoose k
Problem Detail: Edit: In my case, $k$ may be greater than $n$ and they grow independently. I have a recursive algorithm with time complexity equivalent to choosing k elements from n with repetition, and I was wondering whether I could get Read More …
Existence of bipartite perfect matching
Problem Detail: Let $B = G(L, R, E)$ be a bipartite graph. I want to find out whether this graph has a perfect matching. One way to test whether this graph has a perfect matching is Hall’s Marriage Theorem, but it Read More …
Lower bounds: queues that return their min elements in $O(1)$ time
Problem Detail: First, consider this simple problem — design a data structure of comparable elements that behaves just like a stack (in particular, push(), pop() and top() take constant time), but can also return its min value in $O(1)$ time, without Read More …
NFA to DFA convertion explanation
Problem Detail: I’ve converted this NFA to a DFA and I get a similar soultion automata but I’m not sure if I really understand everything. Please correct me if I’m explaining it wrong, I would love some feedback. From the state Read More …
