IgnouGroup Social Campus
Problem Detail: I’ve been trying to convert a regular expression to a non-deterministic finite automata (NFA) first using Thompson’s construction, giving: , which looks correct. I am then using subset construction to create the DFA from the NFA, shown here. But Read More …
Problem Detail: When converting a CFG to a PDA I know that you get three main states, Qstart, Qloop and Qaccept. But Qloops will need a various amount of states, and my question is how many? Is there a way to Read More …
Problem Detail: I’m studying the worst case runtime of quicksort under the condition that it will never do a very unbalanced partition for varying definitions of very. In order to do this I ask myself the question what the runtime $T(n, Read More …
Problem Detail: The term “Turing completeness” has been discussed in several of the Computer Science classes that I’ve taken. However, I’ve never gotten an intuitive feel for what Turing completeness actually requires. I found this question, but the answers are a Read More …
Problem Detail: I am trying to solve this problem, and i have tried multiple methods, but i must be missing something, here is the problem: Given a matrix MxN. Find the shortest path from (1,1) to (M,N), where each number in Read More …
Problem Detail: For a rational number 1/3 below is the floating point representation(64 bit) of decimal expansion 0.3333333…. As per the above bit structure, I would like to interpret the value of exponent(11 bits) and value of fraction(52 bits). exponent has Read More …
Problem Detail: Suppose we define an operation such that $$A text{ avoiding } B = {w in A mid wtext{ has no substring in }B},.$$ How can I prove that, if $A$ and $B$ are regular then $Atext{ avoiding }B$ is Read More …
Problem Detail: Let’s say OS is using preemptive CPU scheduling. A process P1 gets a chance to run for some time and then next higher priority process comes and preempts P1. After that higher priority processes are coming regularly and P1 Read More …
Problem Detail: A machine has 48-bit virtual addresses and 32-bit physical addresses. Pages are 8K. How many entries are needed for a conventional page table ? The answer is 2^35 entries Why not (2^32) / (2^13) = 2^19 entries…? My doubt Read More …
Problem Detail: I’m doing an exercise from my book that says: Let $r$ and $s$ be arbitrary regular expressions over the alphabet $Sigma$. Find a simpler equivalent regular expression: a. $r(r^*r + r^*) + r^*$ b. $(r + Lambda)^*$ c. $(r Read More …
