IgnouGroup Social Campus
Problem Detail: I am currently reading and watching about genetic algorithm and I find it very interesting (I haven’t had the chance to study it while I was at the university). I understand that mutations are based on probability (randomness is Read More …
Problem Detail: I would appreciate an intuitive way to find the time complexity of dynamic programming problems. Can anyone explain me “#subproblems * time/subproblem”? I am not able to grok it. Code for LCS – public static String findLCS(String str1, String Read More …
Problem Detail: Below are two questions I found in Theory of Computation book but couldn’t find its correct answers, can anyone please give correct answers with explanation? It is undecidable, whether an arbitrary Turing machine(TM) has 15 states an arbitrary TM Read More …
Problem Detail: Suppose a system in which addresses (physical and logical) occupy 32 bits, page size is 1024 bytes (210), and physical memory is of size 32MB. How many frames are in physical memory? Is the logical address space larger than Read More …
Problem Detail: I am new to automata, and I have been given a brief introduction to regular expressions only yesterday. I have read the various rules which to define a regular expression. But I am unable to differentiate between regular expressions Read More …
Problem Detail: I am looking for an algorithm to generate an array of N random numbers, such that the sum of the N numbers is 1, and all numbers lie within 0 and 1. For example, N=3, the random point (x, Read More …
Problem Detail: I recently learned how to implement merge-sort, using a standard recursive algorithm. Can the algorithm be implemented in a way that allows for a tail-recursive implementation? Can it be implemented in an iterative style? In general how can a Read More …
Problem Detail: Assembly language is converted in to machine language by assembler. Why would a compiler convert high-level language to assembly? Can’t it directly convert from the high-level language to machine code? Asked By : CODERSAM Answered By : Martin Berger Other reason Read More …
Problem Detail: I have this context-free grammar and I want to find out whether its language is finite or infinite. S -> XY|bb Step 1 X -> XY|SS Step 2 Y -> XY|SS Step 3 So I would do S -> Read More …
Problem Detail: when converting an NFA to DFA, we create sub-sets of states in the NFA. does it mean that every DFA-converted-from-NFA contain 2^Q states? or if some sub-sets are unreachable then they are not included in it? Asked By : Tom Read More …
