Category: Uncategorized

Problem Detail: An answer on Programmers.SE characterizes an essay by Cook (Objects are not ADTs) as saying Objects behave like a characteristic function over the values of a type, rather than as an algebra. Objects use procedural abstraction rather than type Read More …

Problem Detail: Suppose that we have an algorithm “combination” that uses insertionsort for $n < 100$ and mergesort for $n geq 100$. Is the worst case running time of “combination” then $n^2$ or $nlog n$? I was thinking that it’s simply Read More …

Problem Detail: I am studying for my algorithms final and came across the following problem: Find three languages $L_1 subset L_2 subset L_3$ over the same alphabet such that $L_2 in P$ and $L_1,L_3$ are undecidable. I am having trouble coming Read More …

Problem Detail: I’m wondering how a set of keys could be assigned to nodes in a 2-3-4 tree in order to minimize the height of the tree? Does the sequence of insertion matter with 2-3-4 trees? Asked By : Jack Answered By Read More …

Problem Detail: I need to implement LU-decomposition in Kaira. In Kaira the programmer writes the “parallel part” as the diagram similar to Petri Nets. So, could you, please, recommend me some parallel algorithms for LU-decomposition which are really easy to understand Read More …

Problem Detail: I’m trying to understand the relevance of the Lamport distributed mutual exclusion algorithm (or any of its variants), where a group of processes cooperate to gain exclusive access to a resource without relying on a centralized coordinator. How can Read More …

Problem Detail: I want to build a Automatic Speech Recognition (ASR) engine for myself, but I’ve no idea from where to start. I’ve read that most ASR’s are build upon Hidden Markov Models, but also I’ve read that HMM is limited Read More …

Problem Detail: Assuming I have shown part of the knowledge base in the clausal format: [1] p1(banana). [2] not p1(X) or p2(Y). [3] p1(X) or not p3(F). … and more rules. Most of the books, would do something like this: [1,2] Read More …

Problem Detail: If a decision problem A belongs to the polynomial complexity class P, must there be at least one YES instance and one NO instance of the problem? I know that in the definition of a Turing machine an accept Read More …