IgnouGroup Social Campus
Problem Detail: I don’t quite understand why the rotation in the splay tree data structure is taking into account not only the parent of the rating node, but also the grandparent (zig-zag and zig-zig operation). Why would the following not work: Read More …
Problem Detail: Can I use breadth-first search for topologicallly sort vertices and finding strongly connected components in a graph? If yes, how can I do that? If not, why? I tried with a simple acyclic graph of 3 vertices, gave the Read More …
Problem Detail: I’ve been having trouble understanding a unification algorithm for first order logic, as I don’t know what a compound expression is. I googled it, but found nothing relevant. I also don’t know what a list means in this context. Read More …
Problem Detail: I need to give a PDA and CFG for a language that contains all binary strings that start and end with the same symbol. I’ve created the CFG with no problem, but I’m stuck with the PDA and don’t Read More …
Problem Detail: Given a graph $G = (V,E)$, where $|V| = n$. What is a fast algorithm for generating the collection of all 2-hop neighborhood lists of all nodes in $V$. Naively, you can do that in $O(n^3)$. With power of Read More …
Problem Detail: Is there any formal definition about the average height of a binary tree? I have a tutorial question about finding the average height of a binary tree using the following two methods: The natural solution might be to take Read More …
Problem Detail: I need to solve the following recurrency: $T(n) = 2T(sqrt{n}) + O(1)$. It’s for a simple undergrad problem that a student asked me, but I really couldn’t solve it. Since it is for an undergrad question, it would be Read More …
Problem Detail: Given a set $mathbf{S}$ of sets, I’d like to find a set $M$ such that every set $S$ in $mathbf{S}$ contains at least one element of $M$. I’d also like $M$ to contain as few elements as possible while Read More …
Problem Detail: This is a question from the exam of our “Automata and Formal Languages” course. There is a question where asked to prove or disprove that any “relative complement” operation between two context sensitive languages will also produce a context Read More …
Problem Detail: I often hear phrases like ‘true concurrency semantics’ and ‘true concurrency equivalences’ without any references. What does those terms mean and why are they important? What are some examples of true concurrency equivalences and what is the need for Read More …
