Problem Detail: I am preparing for my exam in formal languages and I need some help with one question from one old exam. I know that the number of equivalence classes of some regular language L, is the number of states Read More …
IgnouGroup Social Campus
Problem Detail: I am preparing for my exam in formal languages and I need some help with one question from one old exam. I know that the number of equivalence classes of some regular language L, is the number of states Read More …
Problem Detail: I’m a computer science student. I want to create my own programming language (A basic language with few instructions). I know how to do a syntactic analyser, I already did it in Perl. In an article, I read something Read More …
Problem Detail: I read about Minterms i.e. sums of products, simplification using Karnaugh Graph. Can this graph be used for Maxterms, i.e. products of sums, as well? If yes, then how? If not, then is there some other similar way to Read More …
Problem Detail: Suppose there are $n$ tasks, which need to be scheduled by a pre-emptive scheduler. Each task $T_i$ has a deadline $d_i$ and a total processing time $t_i$ associated with it. Now, all $n$ tasks are given a priory to Read More …
Problem Detail: The wikipedia page on multiplication algorithms mentions an interesting one by Donald Knuth. Basically, it involves combining fourier-transform multiplication with a precomputed table of logarithmically-sized multiplications. It runs in linear time. The article acts like this algorithm somehow doesn’t Read More …
Problem Detail: First of all, I have just started studying computer science by myself and maybe I just need some clarification of what “polynomial time” means regarding the time complexity of an algorithm and references to study it well. As I Read More …
Problem Detail: For a formal language $L subseteq Sigma^{*}$ I define the set Pref(L) to be: $text{pref}(L) = {alpha in Sigma^{*} : exists beta in Sigma^{*} text{ such that } alpha beta in L}$ ie. the set of all (not necessarily Read More …
Problem Detail: What are the types of things that need to be considered if I need to sort a large random array of 0s and 1s? You can assume large array is in the order of million or billions. I understand Read More …
Problem Detail: When doing mental calculus one can do: Given an integer k, sum all the digits (in base 10), and if the result is a multiple of 3, then k is a multiple of 3. Do you know of any Read More …
Problem Detail: This proof is a proof by induction, and goes as follows: P(n) is the assertion that “Quicksort correctly sorts every input array of length n.” Base case: every input array of length 1 is already sorted (P(1) holds) Inductive Read More …