Problem Detail: Since a sufficiently large hash table takes constant time to both insert and retrieve data, should it not be possible to sort an array by simply inserting each element into the hash table, and then retrieving them in order? Read More …
Author: ignougroup
[Solved]: Give an example of a non-regular language $L$ such that $L^*$ is regular
Problem Detail: I can’t think of an example of a non-regular language $L$ such that $L^*$ is regular. . Any help ? Asked By : Altaïr Answered By : R B Define $L={a^nb^n|nin mathbb N}cup {a,b}$ It’s not hard to see that while Read More …
[Solved]: Where can I find rules for source to source transformation optimization rules?
Problem Detail: Upon reading Do source code optimizers exist? I knew that such programs existed but the ones I have worked with use a set of rules to drive a transformation algorithm. Ira Baxter provided a link to the tools running Read More …
[Solved]: Basic action for every data structure O(1)
Problem Detail: My lecturer for Algorithms said that most of the data structures I will encounter in the algorithms course I am taking have a basic action which is of O(1). Ex: Binary heap. Basic action is: Compare 2 childen. Compare Read More …
[Solved]: Peer grading design – choosing a graph, to get accurate rankings/ratings
Problem Detail: Background. I am writing some code for semi-automated grading, using peer grading as part of the grading process. Students are given pairs of essays at a time, and the students have a slider to choose which is better and Read More …
[Solved]: Would adding recursive named functions to Simply typed lambda calculus make it Turing complete?
Problem Detail: Say I have Simply typed lambda calculus, and add an assignment rule: <identifier> : <type> = <abstraction> Where <identifier> is the name of the function, <type> is the function type and <abstraction> is the abstraction to be assigned to Read More …
[Solved]: What kind of reductions are usually used in order to prove PP-completeness?
Problem Detail: I’ve read that MAJSAT is PP-complete. Under what type of reduction is this true? What kind of reductions are usually used in order to prove PP-completeness? Asked By : Fayez Abdlrazaq Deab Answered By : D.W. Here “PP-complete” means “complete for Read More …
[Solved]: Partition problem with distinct integers
Problem Detail: Partition problem is a well known NP-complete problem. In the definitions I have seen, the input is assumed to be a multiset of integers and we want to decide the existance of a partition into two sets that have Read More …
[Solved]: What’s a fast algorithm to decide whether there is an $A_G$ corresponding to a given $chi_G(lambda)$?
Problem Detail: Given an adjacency matrix $A_G$ of an undirected graph $G$, it is easy and straightforward to compute the characteristic polynomial $chi_G(lambda)$. What about the other way around? The problem can be formulated as follows. Problem Given a polynomial $P$, Read More …
[Solved]: Is a single symbol, not in a set, a language?
Problem Detail: I was reading about Turing machines and realized I’m not sure about the difference between the following scenario. Given the alphabet $Sigma = {a, b }$, we have the following assertions: $a in R $ ${a} in R$ I Read More …
