IgnouGroup Social Campus
Problem Detail: Although I know that the Hamilton Path problem is ${sf NP}$-complete, I think the following variant can be solved in polynomial time: Given a planar graph with vertex set $V$, edge set $E$, start node $S$ and target node Read More …
Problem Detail: In terms of references and their implementation on the heap and the stack, how is equality testing for arrays different from that for integers? This is to do with Java programming, if you have a stack and a heap, Read More …
Problem Detail: Codd’s Algorithm converts an expression in tuple relational calculus to Relational Algebra. Is there a standard implementation of the algorithm? Is this algorithm used anywhere? (It seems that the industry only needs SQL and variants, I’m not sure about Read More …
Problem Detail: Are NP or P closed under subtraction? Im having a hard time deciding whether they are or aren’t. Question was edited Original question: Im having some hard time figuring out what languages are closed under subtraction. Say you have Read More …
Problem Detail: I did some quick math on how much data is contained on a screen at any given instant and I ended up with a number well beyond what I thought was possible. 256 colors for Red, Green, and Blue Read More …
Problem Detail: $ALLEVEN_{CFG}$ = {M is a grammar, and L(M) includes all strings of even length in $Sigma^*$} = {(M): ($SigmaSigma$)* ⊆ L(M)} $ALLODD_{CFG}$ = {M is a grammar, and L(M) includes all strings of odd length in $Sigma^*$} = {(M): Read More …
Problem Detail: Is it necessary to remove all lambda productions, unit productions and useless productions from a context free grammar(CFG) before converting to Chomsky Normal Form(CNF) or Greibach normal form (GNF). If so why is it required? Also my Professor said Read More …
Problem Detail: Polynomial identity testing is the standard example of a problem known to be in co-RP but not known to be in P. Over arithmetic circuits, it does indeed seem hard, since the degree of the polynomial can be made Read More …
Problem Detail: For the following two instruction [Note: MOV Destination, Source ] i1 : MOV R1, R2 i2 : ADD R2, R3 Since i1 is reading from R2 and i2 is writing to R2 there is a WAR data dependency and Read More …
Problem Detail: Given $k$ numbers $A_1 leq A_2 leq … leq A_k$ such that $sumlimits_{i=1}^k A_i = k(2k + 1)$ is there an assignment of numbers $i_1, i_2, … , i_{2k}$ which is a permutation of $1, 2, … , 2k$ Read More …
