Author: ignougroup

Problem Detail: I came across a proof that the an AVL tree has O(log n) height and there’s one step which I do not understand. Let $N_h$ represent minimum number of nodes that can form an AVL tree of height h. Read More …

Problem Detail: Can you pipeline a pure Von Neumann architecture based CPU or do you need seperate data and instruction caches for this? If you include seperate instruction and data caches (then it isn’t a von neumann CPU anymore, it’s a Read More …

Problem Detail: I have come across a question that is a bit hard to understand due to its wording, I may havecome up with a possible solution, but I don’t know if it’s correct. Can you please help me? Thanks in Read More …

Problem Detail: How can we prove that $h(x) = g(f(x))$ is a reduction function for $A leq_m C$, if $f$ is the reduction function of $A leq_m B$ and $g$ is the reduction function for $B leq_m C$ The given Proposition Read More …

Problem Detail: We only consider the reverse Polish notation as an arithmetic expression. Formally, RNP is a sequence consisted of numbers and arithmetic operators: $+,-,*,/$, and its syntax is: $$newcommandRNF{mathrm{RNF}}newcommandnum{mathrm{number}}newcommandop{mathrm{operator}}RNF=num,bigvert,RNF,RNF,op$$ and its value $$newcommandeval{operatorname{eval}}evalnum=num$$ $$evalRNF_1,RNF_2,op=evalRNF_1 op evalRNF_2$$ The following pseudo code Read More …

Problem Detail: By a vanilla Turing machine, I mean a Turing machine with one tape (no special input or output tapes). The problem is as follows: the tape is initially empty, other than a string of $n$ $1$s and $0$s terminated Read More …

Problem Detail: At least in Java, if I write this code: float a = 1000.0F; float b = 0.00004F; float c = a + b + b; float d = b + b + a; boolean e = c == d; Read More …

Problem Detail: Suppose that someone found a polynomial algorithm for a NP-complete decision problem. Would this mean that we can modify the algorithm a bit and use it for solving the problems that are in NP, but not in NP-complete? Or Read More …

Problem Detail: I don’t know much about yacc, bison, flex or lex and please correct me if I’m wrong but a programming language is also a Turing machine and a Turing machine is defined as the tuple $(Q, Gamma, b, Sigma, Read More …