Author: ignougroup

Problem Detail: I don’t understand why $n log log n $ is not $Theta (n)$. Suppose we give $n$ a value of $10,000$. Then $n log log n$ is $6020.6$. So isn’t $n log log n$ upper- and lower-bounded by $n$, Read More …

Problem Detail: $T(n)=2T(n/2) + nlog^2(n)$. If I try to substitute $m = log(n)$ I end up with $T(2^m)=2 T(2^{m-1}) + 2^mlog^{2}(2^m)$. Which isn’t helpful to me. Any clues? PS. hope this isn’t too localized. I specified that the problem was a Read More …

Problem Detail: Is there a rule that either every DFA contains or not, a loop(cycle in graph terminology)? I do not seem to be able to generalize this idea in either direction. Also if either of these is true, can we Read More …

Problem Detail: SAT [5] can be solved with resolution definitively, i.e. if the formula has a true assignment, resolution can find it, and if it cant be satisfied, resolution can show that no assignment exists (at least in exponential time/space.). [4] Read More …

Problem Detail: SML uses pass‑by‑value, Haskell uses call‑by‑need. Unless I’m wrong (the purpose of this question), one can do call‑by‑need with SML, passing a function instead of a value; a function to be later evaluated when needed. Adapting a classical example: Read More …

Problem Detail: I had a question on an assignment where we were supposed to write a regular expression for a language where every $a$ in $w$ is immediately preceded and followed by a $b$. My answer was $epsilon + (b + Read More …

Problem Detail: I learned that there are two types of services in Windows , one called -service- which is in user-mode , other is called -driver service / device driver– which is in kernel-mode. What I wonder is , do kernel-level Read More …

Problem Detail: I’m a bit confused how worst case complexity is estimated for the DPLL algorithm. Is it in terms of number of clauses, number of variables, or something else? Asked By : Rich Answered By : Kyle Jones In the papers I’ve Read More …