Recent posts tagged motivation

3
You should know the precedence rule. $\to$ has higher precedence than quantification.
4
For empty string as language, q0 as final states gives 16 DFAs. But when both q0 and q1 are final states we must ensure none of the transitions go to q1 from q0. This red...
6
I doubt the correctness of this solution, the diagram below; in Red Rectangle shows what this solution is suggesting, on the other hand the image in the Green Rectangle s...
7
8
It is mentioned in the question itself Consider an instruction pipeline with five stages "without any branch prediction" i.e. target address is available after completio...
10
Acc. to me it should be (C) because: according to condition, out of all, one philosopher will get both the forks. So, deadlock should not be there.
11
A. thatWho and whom are people, not dogs.Regarding that and which...Restrictive Clause—ThatA restrictive clause is just part of a sentence that you can't get rid of bec...
12
Consider the finite automaton in the following figure: What is the set of reachable states for the input string $0011$?$\{q_0,q_1,q_2\}$$\{q_0,q_1\}$$\{q_0,q_1,q_2,q_3\}$...
13
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values:Choose an $i$ at random from $1..n$If $A[i...
15
These two links are very good for paging. https://courses.cs.washington.edu/courses/cse451/08wi/os-paging.ppthttp://www.cs.columbia.edu/~junfeng/10sp-w4118/lectures/l21-p...
To see more, click for the full list of questions or popular tags.