0 answers
1
Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove th...
2 answers
2
Do the GATEOverflow pdf books contain ALL the pervious year questions? Some questions are missing. I need to know whether or not to buy a question bank.
1 answer
3
can you provide the link of checking mark of MT gate 2018
1 answer
4
How good is MSc CS data science at CMI.http://www.cmi.ac.in/teaching/courses.php?prog=mscdatascience
3 answers
10
Which among the following services is provided by the transport layer?Recovery from message loss.End to end delivery of individual messages.Correct order message delivery...
0 answers
12
Internet address always have at least:A country name or organization typeInternet service provider's nameName of organizationName of individualType of organization ii, ii...
4 answers
15
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$...
1 answer
17
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
0 answers
18
0 answers
19
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
1 answer
20
If the function f(x) defined by $\left\{\begin{matrix} \frac{log(1+ ax) - log(1-bx)}{x} &, if x \neq 0\\ k & ,if x = 0 \end{matrix}\right.$ is continuous at x = 0, then v...
1 answer
21
The value of the expression 1388 (mod 19), in the range 0 to 18, is Please explain Ans is given 9
1 answer
24
How many states will have the minimal DFA accepting the language L={w|wϵ{0,1}* and contains atleast one 0 and two 1's}a) 6b)7c)8d)12
2 answers
25
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
0 answers
27
Answer given is : 5119Please tell how to solve this question
2 answers
30
My Question $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$I have to check that it is Turing Recogniza...