Problem Detail: What is the difference between encoding and modulation? I have seen these terms used sometimes inter-changeably and sometimes differently (the ratio is 50:50). Can somebody clearly explain this with some non-technical and technical examples both? I have searched this Read More …
Category: Uncategorized
Will $L = {a^* b^*}$ be classified as a regular language?
Problem Detail: Will $L = {a^* b^*}$ be classified as a regular language? I am confused because I know that $L = {a^n b^n}$ is not regular. What difference does the kleene star make? Asked By : user6268553 Answered By : Yuval Filmus Read More …
What happens when time slices are too short or too long?
Problem Detail: What bad things can occur when the lengths of the time slices in a multitasking system are too small? What can happen when they are too big? How should the length of the time slice be chosen? Asked By Read More …
The Gas Station Problem – fast implementation
Problem Detail: Recently I was asking about the algorithm to solve The Gas Station Problem and I got useful answer. Unfortunately solution with transforming a graph to complete graph and then preparing another one to find the shortest path (as described Read More …
Why is the class NP-Complete important compared to NP-hard?
Problem Detail: I’m studying computational complexity and I was wondering why the NP-Complete (NPC) problems is an important class at all. I find it obvious why we’re interested in showing a given NP problem is NP-hard. I also understand the definition Read More …
Selection in expected linear time: Why am I getting $O(n)$ bound instead of $Omega(n lg n)$?
Problem Detail: The problem is from CLRS 9.3-1: In the algorithm SELECT, the input elements are divided into groups of $5$. Argue that SELECT does not run in linear time if groups of $3$ are used. If we do the “divide Read More …
Finding nested intervals efficiently
Problem Detail: The intervals are represented as two numbers, e.g. $(4.3, 5.6)$. The intervals are unique. If for $(x,y)$ and $(u,v)$, $x≤u$ and $v≤y$, $(u,v)$ is nested in $(x,y)$ How do I find out which intervals are nested in others efficiently? Read More …
Decidability of prefix language
Problem Detail: At the midterm there was a variant of the following question: For a decidable $L$ define $$text{Pref}(L) = { x mid exists y text{ s.t. } xy in L}$$ Show that $text{Pref}(L)$ is not necessarily decidable. But if I Read More …
A sufficient and necessary condition about regularity of a language
Problem Detail: Which of the following statements is correct? sufficient and necessary conditions about regularity of a language exist but not discovered yet. There’s no sufficient and necessary condition about regularity of a language. Pumping lemma is a necessary condition Read More …
Calculating traversal position of a node in a full binary tree, given its path
Problem Detail: Given a path down a full binary tree to a node (for example, a sequence of $1$s and $0$s, $0$ representing “go left” and $1$ representing “go right”), how would one find the position of the node in the Read More …
