Recent posts tagged testimonials

1
somebody solve here and tell .? that explanation does not suit me well.??
2
3
(∀x∀yP(x,y))→(∀x∀yP(y,x)) Here the LHS will be true only if P(x,y) is true for every possible x and y. Since both x and y are coming fro...
6
Can you please give any source which contain r(*)=r*.Previous year question book gave answer band their b is (r*s*)*=(r+s)*
7
i think the language would be L= 00(0000)*if L= 00 + (0000)* then 0000 cant reaches the final state .
9
For answering there is no need to execute the query, we can directly answer this as $2$How?Group by Student_NamesIt means all name that are same should be kept in one row...
10
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from ...
12
M=14.25=1110.01= 1.11001*2^3M=11001 MSB 1 is for sign bit , since exponent is 8 bit biased so, 2^8 -1= 127.. E= 127 +3= 130=10000010So , 1 foe sign bit 10000010(8 bits) f...
13
It is used for this question only actually whenever m=n the complete bipartite graph is regular. here they want to just test the concept whether we know this or not and h...
14
Given that a language $L_A = L_1 \cup L_2$, where $L_1$ and $L_2$ are two other languages. If $L_A$ is known to be a regular language, then which of the following stateme...
15
16
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which ...
17
In a depth-first traversal of a graph $G$ with $n$ vertices, $k$ edges are marked as tree edges. The number of connected components in $G$ is$k$$k+1$$n-k-1$$n-k$
18
19
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and ...
20
Consider a B-tree with degree $m$, that is, the number of children, $c$, of any internal node (except the root) is such that $m \leq c \leq 2m-1$. Derive the maximum and ...
21
Given that $A$ is regular and $(A \cup B)$ is regular, does it follow that $B$ is necessarily regular? Justify your answer.Given two finite automata $M1, M2$, outline an ...
22
Time complexity of Bellman-Ford algorithm is $\Theta(|V||E|)$ where $|V|$ is number of vertices and $|E|$ is number of edges. If the graph is complete, the value of $|E|$...
23
In a $k$-way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. ...
24
(C) Every relation in $\text{BCNF}$ is also in $\text{3NF}.$ Straight from definition of $\text{BCNF}.$More Read: https://gatecse.in/demystifying-database-normalization/
25
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$$L$ is RE but $L'$ is not REBoth $L$ and $L'$ are RE$L$ is not RE but $L'$ is REBoth $L$ and $L'$ are not RE
26
Consider the following languages$L_1$ = $\{a^nb^n\mid n \ge 0\}$ $L_2$ = Complement($L_1$)Chose the appropriate option regarding the languages $L_1$ and $L_2$(A) $L_1$ a...
27
We can get a DFA for $L = \{x \mid xx ∊ A\}$ as follows:Take DFA for $A$ $\left(Q, \delta, \Sigma, S, F\right)$ with everything same except initially making $F = \p...
29
Let $Σ = \{a, b, c\}$. Which of the following statements is true?For any $A ⊆ Σ^*$, if $A$ is regular, then so is $\{xx \mid x ∊ A\}$For any $A ⊆ Σ^*$, if $A$ is...
To see more, click for the full list of questions or popular tags.