Blog

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 …

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 …

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 …

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 …

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 …

Problem Detail: Given a binary heap $H$, indexed in $[1..n]$, whose elements are integers, is there a way to quickly find its median in $O(log n)$-time? Asked By : Cássio Jandir Pagnoncelli Answered By : jbapple It takes $Omega(n)$ time to find the Read More …

Problem Detail: What’s the fundamental difference(s) between small and big-step operational semantics? I’m having a hard time grasping what it is and the motivation for having the two. Asked By : Simon Morgan Answered By : Gilles Small-step semantics defines a method to Read More …

Problem Detail: I find it fairly easy to generate an upper bound for nearly any iterative solution (e.g. look at the limits on each loop, etc.), and can oftentimes create an upper bound for normal recursive functions. However, I am now Read More …

Problem Detail: I was wondering, since $a^*$ is itself a star-free language, is there a regular language that is not a star-free language? Could you give an example? (from wikipdia) Lawson defines star-free languages as: A regular language is said to Read More …

Problem Detail: According to what I have read from two different sources, cache coloring is (was?) required in order to: Counter the problem of aliasing: Prevent two different virtual addresses with the same physical address from mapping to different cache sets. Read More …