Problem Detail: I am trying to learn compiler design. But I get confused when I have to deal with Follow set specifically for the empty word. I am trying to figure this out please help me with the same. S-> ABC Read More …
Blog
[Solved]: Why do most books say that a 1 bit branch predictor mispredicts on the first loop iteration?
Problem Detail: I am reading two books, Computer organization and design by David A Patterson, and Digital Design and Computer Architecture by Harris and Harris. These books claim that a 1 bit branch predictor mispredicts on the first and last iterations Read More …
[Solved]: Is every linear-time algorithm a streaming algorithm?
Problem Detail: Over at this question about inversion counting, I found a paper that proves a lower bound on space complexity for all (exact) streaming algorithms. I have claimed that this bound extends to all linear time algorithms. This is a Read More …
[Solved]: Prerequisites of computational complexity theory
Problem Detail: what’s the prerequisite topics needed for understanding computational complexity theory and analysis of algorithm …including big-O and Big-theta notations and these staff. I want a mathematical background and good book suggestions for each topic … thanks Asked By : Eng_Boody Read More …
[Solved]: Artificial intelligence – bridge and torch problem
Problem Detail: I am doing a artificial intelligence course as part of my computer science degree. I am stuck on a question about searching. The question is a version of the Bridge and torch problem. Five people need to walk from Read More …
[Solved]: Theoretical foundations of Divide and Conquer
Problem Detail: When it comes to the design of algorithms, one often employs the following techniques: Dynamic Programming The Greedy-Strategy Divide-and-Conquer While for the first two methods, there are well-known theoretical foundations, namely the Bellman Optimality Principle and matroid (resp. greedoid) Read More …
[Solved]: What does a wedge in a graph look like?
Problem Detail: I am reading Decompositions of Triangle-Dense Graphs by Gupta et al. On page 2, in Definition 1 what is a wedge in a graph? I know what triangle is but I don’t know what wedge is and google isn’t Read More …
[Solved]: Variants of the 3-SUM problem
Problem Detail: The 3SUM problem has two variants. In one variant, there is a single array $S$ of integers, and we have to find three different elements $a,b,c in S$ such that $a+b+c=0$. In another variant, there are are three arrays Read More …
[Solved]: Do computers actually use carry-lookahead adders?
Problem Detail: There are plenty of details about carry lookahead adders such as Kogge-Stone, Lander-Fischer, etc. in college CS courses. They are described as “common in the industry”. However, I can’t find any evidence (aside from maybe the Manchester carry chain) Read More …
[Solved]: How can I use the NP complexity Venn diagram to quickly see which class of NP problem can be poly reducible to another class?
Problem Detail: I’m so bad at solving the problem of the type: “If $A$ is an NP-complete problem, $B$ is reducible to $A$, then $B$ is…” That I have to come here and ask these silly questions each and every time Read More …
