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 …
Blog
Is Karnaugh Map possible for Maxterms?
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 …
Compile a programming language with itself
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 …
DFA – Equivalence classes
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 …
Does a Universal Turing Machine have more computational power than a non-universal one?
Problem Detail: I’m a bit confused about these concepts. As far as I understand, something is Turing complete when it can simulate a Turing machine. And there is this thing called a Universal Turing machine which is universal because it can Read More …
Trying to understand this Quicksort Correctness proof
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 …
Is C actually Turing-complete?
Problem Detail: I was trying to explain to someone that C is Turing-complete, and realized that I don’t actually know if it is, indeed, technically Turing-complete. (C as in the abstract semantics, not as in an actual implementation.) The “obvious” answer Read More …
What is the origin of the client server model?
Problem Detail: I was wondering if someone knew the origin of the client server model. Where does the term come from (paper, software application, book)? Asked By : marcmagransdeabril Answered By : Jukka Suomela This is a good question. It appears that the Read More …
Proof of the Stable Matching Problem
Problem Detail: Looking at the document Fundamentals of Computing Series, The Stable Marriage Problem. Theorem 1.2.3 – page 12: In a man-optimal version of stable matching, each woman has worst partner that she can have in any stable matching. Proof: Suppose Read More …
Why is a (collision-less) hashtable lookup really O(1)?
Problem Detail: Disclaimer: I know there are similar sounding questions already here and on Stackoverflow. But they are all about collisions, which is not what I am asking for. My question is: why is collision-less lookup O(1) in the first place? Read More …
