IgnouGroup Social Campus
Problem Detail: Following question was asked in one of entrance exams for a graduation programme. Please help me try to solve it : A computer system has an L1 cache, an L2 cache, and a main memory unity connected as shown Read More …
Problem Detail: Given the language with alphabet: ${a, b, c}$ Draw an NFA or DFA for all the strings that have exactly twice substrings $ab$ and at least on $c$. I’m stuck with “exactly twice $ab$”. Can somebody give me some Read More …
Problem Detail: I am trying to create an isochrone based on the OpenStreetMap data set. Everything works fine, I extracted data, processed it into a DAG, ran a Dijkstra algorithm over it. The result is a subset of the complete graph. Read More …
Problem Detail: Does SQL need subqueries? Imagine a sufficiently generalized implementation of the structured query language for relation databases. Since the structure of the canonical SQL SELECT statement is actually pretty important for this to make sense, I don’t appeal directly Read More …
Problem Detail: I have to show a property P is trivial. This problem has to do with Rice’s Theorem, which I do not completely understand. Can someone explain the difference between trivial and non-trivial properties? Asked By : Alex Chumbley Answered By Read More …
Problem Detail: Imagine I have an ordering on a bunch of elements like so: Where an arrow $X leftarrow Y$ means $X < Y$. It is also transitive: $left(X < Yright) wedge left(Y < Zright) implies left(X < Zright)$. In order Read More …
Problem Detail: Given some abstract problem how can I prove that this problem is not in P. I mean, what is the method for proving such thesis? Asked By : Ari Answered By : Yuval Filmus The most common technique is to prove Read More …
Problem Detail: I often work with lexer/parsers, as opposed to a parser combinator and see people who never took a class in parsing, ask about parsing binary data. Typically the data is not only binary but also context sensitive. This basically Read More …
Problem Detail: In a circular linked list, if an elements needs to be inserted at front [just before the node pointed by head], can be done in O(1) (see the answer here) But in a book currently, I have, it is Read More …
Problem Detail: I have a problem giving “intuitive” explanation to turing-unrecognizable languages. We can prove that, say, ${overline{A_{TM}}}$ is not turing-recognizable, because that would make ${{A_{TM}}}$ decidable, but what would the $TM$ do if it doesn’t accept, reject of loop? Asked Read More …
