IgnouGroup Social Campus
Problem Detail: I have a simple problem of making a DFA which accepts all inputs starting with double letters (aa, bb) or ending with double letters (aa, bb), given $Sigma ={a, b}$ is the alphabet set of the given language. I Read More …
Problem Detail: Classically, there are 3 popular ways to think about computation: Turing machine, circuits, and lambda-calculus (I use this as a catch all for most functional views). All 3 have been fruitful ways to think about different types of problems, Read More …
Problem Detail: I have started to study non deterministic automata using the book of Hopcroft and Ullman. I’m stuck in a problem that I found very interesting: Give a non deterministic finite automaton accepting all the strings that have the same Read More …
Problem Detail: I’m reading Cormen’s Introduction to Algorithms 3rd edition, and in examples of Master Method recursion solving Cormen gives two examples $3T( frac{n}{4} ) + nlog(n)$ $2T( frac{n}{2} ) + nlog(n)$ For the first example we have $a=3$ and $b=4$ Read More …
Problem Detail: From what I read in the preliminary version of a chapter of the book “Lectures on Scheduling” edited by R.H. M¨ohring, C.N. Potts, A.S. Schulz, G.J. Woeginger, L.A. Wolsey, to appear around 2011 A.D. This is the PTAS Definition: Read More …
Problem Detail: Which of the following interrupts has the highest priority in 8086 micro-processor: Overflow, NMI or Type 255? The book I read suggests that type 255 has highest priority. But most of the searches on google showed that it is Read More …
Problem Detail: So, as is known, ILP’s 0-1 decision problem is NP-complete. Showing it’s in NP is easy, and the original reduction was from SAT; since then, many other NP-Complete problems have been shown to have ILP formulations (which function as Read More …
Problem Detail: I have a question asking for the minimum and maximum height $h$ of a B-Tree with 1000 elements under following conditions: each block can save 1 to 4 records, the number of internal nodes is between 3 and 5 and Read More …
Problem Detail: When do we say that a artificial neural network is a multilayer Perceptron? And when do we say that a artificial neural network is a multilayer? Is the term perceptron related to learning rule to update the weights? Or Read More …
Problem Detail: A $k$-sorted array is one in which every element is at most distance $k$ from its position when the array is sorted. The complexity of sorting such array is $O(nlog k)$. But if $k=1$, then $log k=0$ so what Read More …
