Problem Detail: I need to analyze the time complexity of an online algorithm to keep track of minimum $K$ numbers from a stream of $R$ numbers. The algorithm is Suppose the $i$th number in the stream is $S_i$. Keep a max Read More …
Author: ignougroup
[Solved]: What is the exact meaning of a Predicate, decidability and computability?
Problem Detail: In the Computability, Complexity and Languages book written by Davis in page 5 he defines a predicate as: By a predicate or a Boolean-valued function on a set $S$ we mean a total function $P$ on $S$ such that Read More …
[Solved]: Hardware interrupts from keystrokes
Problem Detail: If there is an interrupt from every keypress (or one for keydown, one for keyup, one for keypress?) how does the OS handle so many interrupts at the same time. A person typing at 120WPM would be sending more Read More …
[Solved]: Are there any open source SAT solvers with UNSAT core extraction algorithm built in?
Problem Detail: Just like the title says. I need to use a SAT solver on a series of CNF formulas but not only do I need an answer of the type satisfiable/unsatisfiable but also some subset of clauses whose conjunction is Read More …
[Solved]: Isn’t Functional Programming just Imperative Programming in disguise?
Problem Detail: A YouTube video I was watching explained the differences between Imperative and Functional programming by demonstrating how the numbers from 1 to 10 are summed up in Java and in Haskell respectively. In Java, you must explicitly state each Read More …
[Solved]: Is this grammar really LL(1) while not being LR(1)?
Problem Detail: $S rightarrow S$, $L(G) = {}$ LL(1) analysis: We estabilish $FIRST(S)$ to be empty and $FOLLOW(S)$ to be ${$}$. $FIRST(S)$ doesn’t contain ε, so the parse table looks like this: +—+—+ | | $ | +—+—+ | S | Read More …
[Solved]: Big-O Notation of Anagram solution algorithm
Problem Detail: In Solution 1: Checking Off of Problem Solving with Algorithms and Data Structures, just beneath the ActiveCode: 1 extract (included at the bottom of this post for reference), it is stated: each of the n characters in s1 will Read More …
[Solved]: Are there complete problems for P and NP under other kinds of reductions?
Problem Detail: I know that the complexity class $mathsf{P}$ has complete problems w.r.t. $mathsf{NC}$ and $mathsf{L}$ reductions. Are these two classes the only possible classes of reductions under which $mathsf{P}$ has complete problems? Also, what classes of reduction can be used Read More …
[Solved]: How to solve an arrangement problem at the Archive Nationale of France using graph theory?
Problem Detail: Good evening! I’m actually doing an internship at the Archives Nationales of France and I encountered a situation I wanted to solve using graphs… I. The dusty situation We want to optimize the arrangement of books of my library Read More …
[Solved]: What different lines of reasoning and traditions lead to the conclusion that Software Engineering is or isn’t part of Computer Science?
Problem Detail: Background: Some people consider Software Engineering as a branch of Computer Science, while others consider that they are, or should be, separate. The former stance seems to be well presented in written works. On Wikipedia, Software Engineering is classified Read More …
