IgnouGroup Social Campus
Problem Detail: I am presented with a comparison network. How can I determine if the comparison network is a sorting network? In the image below there is an example of a selection sort and insertion sort network. The intent is to Read More …
Problem Detail: I’m trying to solve the following problem related to distribution- I have a list L of items (I1, I2,….In) sorted in order of importance, I1 being the most important. Each item has multiple tags assigned to it and the Read More …
Problem Detail: I would like to find for any given vertex in a polygon stored in a doubly-connected edge list if the polygon is to its right or not. How do I do that without having a bunch of nested if Read More …
Problem Detail: First of all, let me preface by saying that this question is not completly new but the original question hasn’t been answered. More important, this is only basic question on understanding the proof itself. So after some search in Read More …
Problem Detail: Suppose I have a function $f$ on sets. What is the property of $f$ called when, for all sets $x$, $y$: $f(x)$ is a superset of $f(y)$ when $x$ is a superset of $y$ i.e. $$forall x,y : xsupseteq Read More …
Problem Detail: Is ${ WxW^{mathrm{R}} mid W,xin{0,1}^+}$ a regular language? If so, why? The notation $W^{mathrm{R}}$ means the reverse string of $W$? If we consider the best answer in this solution, if the language is regular, then its FA should reject all Read More …
Problem Detail: Why the smallest operable data type in most programming languages is one-byte sized? Is it possible that to operate with a single bit? If it is possible, how to do it in practical? Asked By : WeZZard Answered By : adrianN Read More …
Problem Detail: Suppose I have a set of strings $S$ that is generated from the alphabet. Suppose I have a DFA $D$ and a CFG $G$, are the questions of ${Dmid Dtext{ is a DFA and }L(D) = S}$ and ${Gmid Read More …
Problem Detail: If I store a directed graph $G$ in adjacency list format, one can find all the out-neighbors $j$ of a given vertex $i$ in $mathcal O(d)$ time, where $d$ is the max degree of the graph. These are all Read More …
Problem Detail: This is a PDA from the lecture slides I’m using: They say it accepts all words that contain double a’s. While it makes some sense it’s not full proof. What prevents the second a to be read in the Read More …
