IgnouGroup Social Campus
Problem Detail: I created a simple regular expression lexer and parser to take a regular expression and generate its parse tree. Creating a non-deterministic finite state automaton from this parse tree is relatively simple for basic regular expressions. However I can’t Read More …
Problem Detail: Planar 3SAT is NP-complete. A planar 3SAT instance is a 3SAT instance for which the graph built using the following rules is planar: add a vertex for every $x_i$ and $bar{x_i}$ add a vertex for every clause $C_j$ add Read More …
Problem Detail: I have been reading up on algorithm for finding the strongly connected components in a directed graph $G=(V,E)$. It considers two DFS search and the second step is transposing the original graph $G^T$. The algorithm is the following : Read More …
Problem Detail: I am reading Computer Architecture & Organization by William Stallings to understand I/O operations. Stallings pretty well explains why Programmed I/O (CPU keeps checking the I/O module register status) & Interrupt I/O (CPU still has to over look data Read More …
Problem Detail: I’m a little bit confused about the analysis of binary search. In almost every paper, the writer assumes that the array size $n$ is always $2^k$. Well I truly understand that the time complexity becomes $log(n)$ (worst case) under Read More …
Problem Detail: The document I am reading is here: Turing Machines Before getting into the question, here is the notation used on the picture: Here $Delta$ denotes the blank and R, L and S denote move the head right, left and Read More …
Problem Detail: Ok, I have done a lot of research on Quantum computers. I understand that they are possibly the future of computers and may be commonplace in approximately 30-50 years time. I know that a Binary is either 0 or Read More …
Problem Detail: A Turing machine that returns to a previously encountered state with its read/write head on the same cell of the exact same tape will be caught in a loop. Such a machine doesn’t halt. Can someone give an example Read More …
Problem Detail: I’m talking about this one research project: but MS closed it in 2008. I’ve read many articles about it, about high perfomance (30+% faster against tradinional monolithic kernels), much more secure etc. So it should be really a revolution Read More …
Problem Detail: Could anyone point me to simple tutorial on greedy algorithm for Minimum Spanning tree – Kruskal’s and Prims’ Method I am looking for a tutorial which does not include all the mathematical notation explains algorithm along with the analysis Read More …
