Blog

Question Detail: So I’ve been trying to crack this for a long time and almost feel like I am going in loops about this question. Given the following NFA: Using the GNFA algorithm get the regular expression. I understand that you Read More …

Question Detail: I am studying best first search as it compares to BFS (breadth-first search) and DFS (depth-first search), but I don’t know when BFS is better than best-first search. So, my question is When would best-first search be worse than Read More …

Question Detail: Question: “Certain properties of a programming language may require that the only way to get the code written in it be executed is by interpretation. In other words, compilation to a native machine code of a traditional CPU is Read More …

Question Detail: Question: “Certain properties of a programming language may require that the only way to get the code written in it be executed is by interpretation. In other words, compilation to a native machine code of a traditional CPU is Read More …

Question Detail: Most of us learned programming using “textual” programming languages like Basic, C/C++, and Java. I believe it is more natural and efficient for humans to think visually. Visual programming allows developers to write programs by manipulating graphical elements. I Read More …

Question Detail: The 3SUM problem tries to identify 3 integers $a,b,c$ from a set $S$ of size $n$ such that $a + b + c = 0$. It is conjectured that there is not better solution than quadratic, i.e. $mathcal{o}(n^2)$. Or Read More …

Question Detail: There is an easy polynomial algorithm to decide whether there is a path between two nodes in a directed graph (just do a routine graph traversal with, say, depth-first-search). However it seems that, surprisingly, the problem gets much harder Read More …

Question Detail: I’m reading Sipser and I’m finding it hard to understand what the process is such that if you give me k Turing machines with k tapes, I can spit out an equivalent Turing machine with only one tape. An Read More …