IgnouGroup Social Campus
Problem Detail: A graph $G$ is chordal if it doesn’t have induced cycles of length 4 or more. Chordal graphs are precisely the class of graphs that admit a clique tree representation. A clique tree $T$ of $G$ is a tree Read More …
Problem Detail: Say we have 3 DFAs. We know how to OR, AND, or NOT them. But how does one XOR them? There is not one single mention of this online. $x; mathrm{XOR} ;y; mathrm{XOR} ;z = ((x|y)(neg x|y)|z) (neg ((x|y)(neg Read More …
Problem Detail: I’m a fledgling computer science scholar, and I’m being asked to write a paper which involves integer factorization. As a result, I’m having to look into Shor’s algorithm on quantum computers. For the other algorithms, I was able to Read More …
SRS for Library Management System This page contains Library management system project SRS document. A development process consist of various phases, each phase ending with a defined output. The main reason for having a phased process is that it breaks the Read More …
Download now View Sample
Problem Detail: Does the following recursive algorithm have a name? If so, what is it? procedure main(): myFilter = new Filter( myPrime = 2 ) //first prime number print 2 //since it would not otherwise be printed for each n in Read More …
Problem Detail: I am dealing with the problem of computing $ s = lfloor sqrt(x)rfloor$ with $x in [0,30000^2]$. The common sqrtf(x) on C language is too slow for this case, however it always gives me the correct result. I’ve tried Read More …
Problem Detail: This is a follow up to the How does Stack Inspection work? that explores the notion in more detail Stack inspection is a mechanism for ensuring security in the context of the JVM and CLR virtual machines when externally Read More …
Problem Detail: I am having diffuculties understanding the principle of lookahead in LR(1) – items. How do I compute the lookahead sets ? Say for an example that I have the following grammar: S -> AB A -> aAb | b Read More …
Problem Detail: I know that given two problems are undecidable it does not follow that their intersection must be undecidable. For example, take a property of languages $P$ such that it is undecidable whether the language accepted by a given pushdown Read More …
