IgnouGroup Social Campus
Problem Detail: What we know is that π is infinite and quite likely it contains every possible finite string of digits (disjunctive sequence). I’ve seen recently some prototype of πfs which assume that every file you’ve created (or anybody else) or Read More …
Problem Detail: I was on wikipedia on list of unsolved computer science problems and found this: Is public-key cryptography possible? I thought RSA encryption was a form of public-key cryptography? Why is this a problem? Asked By : Namster Answered By : Yuval Read More …
Problem Detail: I’m looking for some relatively simple examples of when structural hazards occur in a pipelined architecture. The only scenario I can think of is when memory needs to be accessed during different stages of the pipeline (ie, the initial Read More …
Problem Detail: They have finite resources so they can be modeled by finite number of state what is the same that a finite state machine. There are any proof that it is not true? Thanks. Asked By : MRuizEscribano Answered By : David Read More …
Problem Detail: I am reading Operating Systems by William Stallings 6th edition and I came across this text, Program execution: A number of steps need to be performed to execute a program. Instructions and data must be loaded into main memory, Read More …
Problem Detail: I am interested in self-reducibility of Graph 3-Coloralibity problem. Definition of Graph 3-Coloralibity problem. Given an undirected graph $G$ does there exists a way to color the nodes red, green, and blue so that no adjacent nodes have the Read More …
Problem Detail: Is it only because of the fact that it is asynchronous and can be used for long distance message transfer. An example of where other protocols will fail would help. Thanks. Asked By : Sirius Answered By : Pseudonym Historical reasons, 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 …
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: 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 …
