automata

From the definition of adjacency matrix of G2, it is clear that any two vertices that were adjacent in G are also adjacent in G2. Also, for any two vertices m, n of G which were not adjacent in G will be adjacent in G2 iff there they are adjacent to some other common vertex(just try to find the value of N(m, n) for some m, n. You will see why this double implication is true). Also, take any path between any two vertex, say x and y in G. Let the vertex along this path be x, x1, x2,…,… [...]

Answered: GATE CSE 2021 Set 1 | GA Question: 9

Answer is D: Everyone is debating over C and D, Option C: Either conclusion I or II is correct. Remember when pathogens and Bacteria Intersects. Both the conclusions hold..therefore C cannot be the answer...D is correct [...]

Answered: GATE CSE 2021 Set 1 | Question: 33

Condition for:- Lossless Decomposition: R1 U R2 U R3….. = R (i.e all attribute present in decomposed relation) R1⋈R2 = R (Use if relation given) OR While combining relation common attribute should be Super key (SK) of at least one relation. [...]

Answered: NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 8

option b in best case if cond satisfy 1 time and return in wrost case root(n) time loop will itetrate [...]

Answered: NIELIT 2016 MAR Scientist C - Section C: 51

we can find the no of connected components by BFS DFS apply bfs dfs in graph no of times bfs/dfs applied to complete traversal =no of components so O(m+n) [...]

Answered: NIELIT 2019 Feb Scientist C - Section A: 19

Since, Seetha is $7^{th}$ from the left and Leena is $9^{th}$ from the right, when Seetha replace Leena, the position of Seetha from the right = $9.$ As per question, Seetha’s position from the left after interchanging $=11.$ Hence, the no. of girls in the row $$\begin{align}&=\text{(Seetha’s position from the left + Seetha’s position from the right)-1}\\&=(9+11) -1\\&= 20-1\\&= 19\end{align}$$ So, answer is None of the above. [...]

Answered: NIELIT 2017 DEC Scientific Assistant A - Section A: 6

All of the girls agree that the first three numbers are 995. Three of them agree that the fourth number is 9. Three agree that the fifth number is 2. Three agree that the sixth number is 6; three others agree that the seventh number is also 6. "Option A" is the best choice because it is made up of the numbers that most of the girls agree they saw. [...]

Answered: NIELIT 2016 MAR Scientist D: 8

Correct Answer: (D) Explanation: This game introduces the idea of reciprocal causation. For example, the constraint that says “If A, then B, and if B, then A” should be transcribed in one of the following two ways, based on the configurations of the other variables in the diagram: You will run into reciprocal causation in the final constraint of this logic game. Here are the final diagrams that you should create: Notice how the reciprocal causation constraints are diagrammed. Be aware of the implications of these constraints. For instance, if $B$ is not sent (diagram B), then $A$ cannot… [...]

Answered: NIELIT 2016 MAR Scientist D: 7

Answered: NIELIT 2016 MAR Scientist D: 6

Correct Answer: (A) Explanation: This game introduces the idea of reciprocal causation. For example, the constraint that says “If $A$, then $B$, and if $B$, then $A$” should be transcribed in one of the following two ways, based on the configurations of the other variables in the diagram: You will run into reciprocal causation in the final constraint of this logic game. Here are the final diagrams that you should create: Notice how the reciprocal causation constraints are diagrammed. Be aware of the implications of these constraints. For instance, if $B$ is not sent (diagram B), then $A$ cannot be sent… [...]

Answered: NIELIT 2016 MAR Scientist D: 33

The answer is (C). three [...]

%d bloggers like this:

automata

Grammar: Decidable and Undecidable Problems

Like this:

Closure Property of Language Families

Like this:

Discussion on Decidability

Like this:

Theory of Computation

Like this:

Skip links

automata

Share this:

Like this:

Share this:

Like this:

Share this:

Like this:

Share this:

Like this: