IgnouGroup Social Campus
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: 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: 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 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: 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: 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: In my Algorithms and Data Structures course, professors, slides and the book (Introduction to Algorithms, 3rd edition) have been using the word NIL to denote for example a child of a node (in a tree) that does not exist. Read More …
Problem Detail: Lets say we have $L_1$, which is a regular language and $L_2$ which is not. Are $L_1 cap L_2$, $L_1 cup L_2$ , $L_1$ $L_2$ and $L_1 cdot L_2$ are always non-regular languages? We know that two regular languages Read More …
Problem Detail: I need to keep a collection on integers in the range 0 to 65535 so that I can quickly do the following: Insert a new integer Insert a range of contiguous integers Remove an integer Remove all integers below Read More …
Problem Detail: How many different max-heaps can I form using a list of $n$ integers. Example: list [1,2,3,4] and max-heap is 4 3 2 1 or 4 / 3 2 / 1 other possible max-heap is 4 2 3 1 4 Read More …
