IgnouGroup Social Campus
Problem Detail: An AVL tree is one that satisfies the height-balance property which states that: For every position p of T, the heights of the children of p differ by at most 1. Below is an example AVL tree. However, I’ve Read More …
Problem Detail: I’ve got the following definitions: $$mathrm{Interleave},(x,y) = {w_1dots w_nmid w_iin{x_i,y_i} text{ for }i=1, dots, |x|}$$ when $x$, $y$ and $w$ are words with $|x|=|y|$ and $w_i$ means the $i$-th letter in $w$. $$mathrm{Interleave},(L_1,L_2) = !!!!bigcup_{substack{xin L_1, yin L_2, |x|=|y|}}!!!! Read More …
Problem Detail: I have a problem with this exercise: Let G be the following ambiguous grammar for the λ-calculus: E → v | λv.E | EE | (E) where E is the single non-terminal symbol, λv.E represents abstraction w.r.t. the variable Read More …
Problem Detail: Consider the following code segment : for (int i = 1; i <= n; i++ ) { for (int j = 1; j <= n; j = j + i ) { printf(“Hi”); } } Here, the outer loop Read More …
Problem Detail: I was learning some basic sorting techniques with their complexity. However I cannot understand why only the number of comparisons are taken into account while calculating time complexity and operations such as swap are ignored. Link to selection sort Read More …
Problem Detail: I want to parse user-defined domain specific languages. These languages are typically close to mathematical notations (I am not parsing a natural language). Users define their DSL in a BNF notation, like this: expr ::= LiteralInteger | ( expr Read More …
Problem Detail: Im working on a modified A Star algorithm, that instead of attempting to find the shortest path, it tries to find the longest past, or in my specific case, the highest weighted path. I have some number of classes, Read More …
Problem Detail: I am new to turing machines, I am having problems with mapping a function to a turing maching that computes that particular function. for example: f(x) = 2x + 3 n>= 0 MIN(x,y) leaves the smallest between x and Read More …
Problem Detail: I’m studying the MIPS multi-cycle datapath, and I’m wondering what would happen if there was only one read port in the register file for certain instructions. First, for R-type instructions, I know that it takes in 2 registers(for example, Read More …
Problem Detail: I am unable to find a clear definition of term “size of the instance” when considering some algorithmic problem. I came accross a definition that said, that “Size of the instance corresponds to the size of the input array Read More …
