# Recent posts tagged testimonials

2
(&forall;x&forall;yP(x,y))&rarr;(&forall;x&forall;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 from the same universe, if this is true, then their order doesn't matter for P(x, y).
4
its 3. draw a graph and colour it and check
5
Can you please give any source which contain r(*)=r*.Previous year question book gave answer b and their b is (r*s*)*=(r+s)*
6
i think the language would be L= 00(0000)* if L= 00 + (0000)* then 0000 cant reaches the final state .
8
For answering there is no need to execute the query, we can directly answer this as $2$ How? Group by Student_Names It means all name that are same should be kept in one row. There are $3$ names. But in that there is a duplicate with Raj being repeated $\implies$ Raj produces ...
9
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 $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ ... of $G$ that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$
11
M=14.25=1110.01= 1.11001*2^3 M=11001 MSB 1 is for sign bit , since exponent is 8 bit biased so, 2^8 -1= 127.. E= 127 +3= 130=10000010 So , 1 foe sign bit 10000010(8 bits) for exponent and 1100100000....0(23bits)= C1640000H
12
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 how patiently we go through all options.
13
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 statements is necessarily TRUE? If $L_1$ is regular then $L_2$ will also be regular If $L_1$ is regular and finite then $L_2$ will be regular If $L_1$ is regular and finite then $L_2$ will also be regular and finite None of these
15
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 of the following statements is always TRUE? There exists a cutset in $G$ having all edges of maximum ... in $G$ having all edges of maximum weight. Edge $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
16
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
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 $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
19
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 minimum number of records in the leaf nodes for such a B-tree with height $h, h \geq 1$. (Assume that the root of a tree is at height 0).
20
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 algorithm to decide if $L(M1) \subset L(M2)$. (note: strict subset)
21
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|$ becomes $\Theta\left(|V|^2\right)$. So overall time complexity becomes $\Theta\left(|V|^3\right)$. And given here is $n$ vertices. So, the answer ends up to be $\Theta\left(n^3\right)$. Correct Answer: $C$
22
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. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The main memory block ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v-1)$
23
(C) Every relation in BCNF is also in 3NF. Straight from definition of BCNF.
24
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$ $L$ is RE but $L'$ is not RE Both $L$ and $L'$ are RE $L$ is not RE but $L'$ is RE Both $L$ and $L'$ are not RE
25
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$ and $L_2$ are context free (B) $L_1$ is context free but $L_2$ is regular (C) $L_1$ is context free and $L_2$ is context sensitive (D) None of the above
26
We can get a DFA for $L = \{x \mid xx &#8714; A\}$ as follows: Take DFA for $A$ $\left(Q, \delta, \Sigma, S, F\right)$ with everything same except initially making $F = \phi$. Now for each state $D \in Q$, consider 2 separate DFAs, one with $S$ as the start state and $D$ as the final ... . But if we make $L$ from $A$ as per (d), it'll be $L = \{a^nb^nc^n \mid n \ge 0\}$ which is not context free..
28
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 regular, then so is $\{x \mid xx ∊ A\}$ For any $A ⊆ Σ^*$, if $A$ is context-free, then so is $\{xx \mid x ∊ A\}$ For any $A ⊆ Σ^*$, if $A$ is context-free, then so is $\{x \mid xx ∊ A\}$
To see more, click for the full list of questions or popular tags.