Category: Uncategorized

Problem Detail: I’m doing an exercise in my book, the question is to find a string of minimum length in ${a, b}^*$ not in the language corresponding to the given regular expression. a. $b^*(ab)^*a^*$ My answer: $aab$ b. $(a^* + b^*)(a^* Read More …

Problem Detail: The longest common substring (LCS) of two input strings $s,t$ is a common substring (in both of them) of maximum length. We can relax the constraints to generalize the problem: find a common substring of length $k$. We can Read More …

Problem Detail: In Richard Karp’s paper “Reducability among combinatorial problems” he lists 21 NP-Hard problems. Though I can somewhat understand the ideas and motivation behind the paper I am searching for some clarity. From what I know and understand this paper Read More …

Problem Detail: In a round-robin scheduler, adding a process multiple times to the process list is a cheap way to give it higher priority. I wonder how practical an approach this might be. What benefit does it have over other techniques Read More …

Problem Detail: I’m looking at collision detection in communication protocols, in particular Carrier sense multiple access with collision detection (CSMA/CD). According to what I’ve read on Wikipedia, a collision seems to cause the wave of the outgoing signal and the wave Read More …

Problem Detail: Basically, the problem I am solving is this. Initially, the array $A$ is empty. Then I am given data to fill the array and at any time I have to make a query to print the $|A|/3$-th largest element Read More …

Problem Detail: I am looking for articles relating to algorithms that deal with automatic selection of seating assignment. I need an algorithm (preferably more than one) that can automatically select a seating place while enforcing certain constraints that are predefined. Originally Read More …

Problem Detail: Why do most programming languages (if not all) lack a 2-bit data type? A boolean is a single bit with the values being either true or false. Why is there no native, corresponding type where the values can be Read More …

Problem Detail: A path is simple if it repeats no vertices. How many simple paths between two vertices in Complete graph? One way is listing the simple paths is to use depth-first search. but i think it should be simple to Read More …

Problem Detail: If I understand correctly, the complexity of solving a computational problem is defined in terms of which instance $I$ of the problem, what size $n$ of the problem instance, and what algorithm $A$ for solving the problem instance. Is Read More …