Blog

Question Detail: This is a homework question, so I am only looking for hints. I got a question in an assignment which states : Design a DFA that accepts strings having 1 as the 4th character from the end, on the Read More …

Question Detail: In my class we just started learning about Turing machines. I think I understand the concept but am unsure how to syntactically solve any problem related to one. I am presented with the problem: Build a Turing machine accepting Read More …

Question Detail: If a graph with $n$ vertices has more than $frac{(n-1)(n-2)}{2}$ edges then it is connected. I am a bit confused about this question, since I can always prove that for a graph to connected you need more than $|E|>n-1$ Read More …

Question Detail: While discussing some intro level topics today, including the use of genetic algorithms; I was told that research has really slowed in this field. The reason given was that most people are focusing on machine learning and data mining. Read More …

Question Detail: The well known SAT problem is defined here for reference sake. The DOUBLE-SAT problem is defined as $qquad mathsf{DOUBLEtext{-}SAT} = {langlephirangle mid phi text{ has at least two satisfying assignments}}$ How do we prove it to be NP-complete? More Read More …

Question Detail: I’ve came up with a result while reading some automata books, that Turing machines appear to be more powerful than pushdown automata. Since the tape of a Turing machine can always be made to behave like a stack, it’d Read More …

Question Detail: From what I have learned asymptotically tight bound means that it is bound from above and below as in theta notation. But what does asymptotically tight upper bound mean for Big-O notation? Asked By : nangal.vivek Best Answer from StackOverflow Read More …

Question Detail: I’ve decided to read Operating Systems Concepts by Silberschatz, Galvin Gagne (8th edition) over the summer. I’ve gotten to a topic that’s confusing me – interrupts and their role as it relates to operating systems. The text says that Read More …

Question Detail: Knapsack problems are easily solved by dynamic programming. Dynamic programming runs in polynomial time; that is why we do it, right? I have read it is actually an NP-complete problem, though, which would mean that solving the problem in Read More …

Question Detail: I tried this problem from CLRS (Page 39, 2.3-4) We can express insertion sort as a recursive procedure as follows. In order to sort A[1… n], we recursively sort A[1… n-1] and then insert A[n] into the sorted array Read More …