Gate 2016 set no 2 question no 17
closed

sakshi nawab asked Dec 13, 2016 • closed Dec 13, 2016 by pC

254 views

See all

Related questions

22 votes

2 answers

Akash Kanase asked Feb 12, 2016

7,862 views

GATE CSE 2016 Set 2 | Question: 17
Language $L_{1}$ is defined by the grammar: $S_{1} \rightarrow a S_{1} b \mid \varepsilon$ Language $L_{2}$ is defined by the grammar: $S_{2} \rightarrow a b S_{2} \mid \varepsilon$ Consider the following statements: P: $L_{1}$ is regular Q: $L_{2}$ is regular ... $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.

Language $L_{1}$ is defined by the grammar: $S_{1} \rightarrow a S_{1} b \mid \varepsilon$Language $L_{2}$ is defined by the grammar: $S_{2} \rightarrow a b S_{2} \mid \v...

Akash Kanase

7.9k views

Akash Kanase asked Feb 12, 2016

32 votes

4 answers

Sandeep Singh asked Feb 12, 2016

8,586 views

GATE CSE 2016 Set 1 | Question: 17
Which of the following decision problems are undecidable? Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$ Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in \Sigma^{*}$, does $x \in L(G)$} ? Given CFGs $G_1$ and $G_2$, is $L (G_1) = L(G_2)$? Given a TM $M$, is $L(M)=\Phi$ ? I and IV only II and III only III and IV only II and IV only

Which of the following decision problems are undecidable?Given NFAs $N_1$ and $N_2$ , is $L(N_1) \cap L(N_2) = \Phi$Given a CFG $G = (N,\Sigma,P,S)$ and a string $x \in ...

Sandeep Singh

8.6k views

Sandeep Singh asked Feb 12, 2016

6 votes

0 answers

padmaja asked May 1, 2016

1,513 views

Is variable entrant map(VEM) at k-map there in gate 2016/17 syllabus?
And Can anybody share the roots of the cse gate subjects to prepare topic/sub topic wise?

And Can anybody share the roots of the cse gate subjects to prepare topic/sub topic wise?

padmaja

1.5k views

padmaja asked May 1, 2016

2 votes

2 answers

makhdoom ghaya asked Sep 24, 2016

1,670 views

UGC NET CSE | August 2016 | Part 2 | Question: 17
Relational database schema normalization is NOT for : Reducing the number of joins required to satisfy a query. Eliminating uncontrolled redundancy of data stored in the database. Eliminating number of anomalies that could otherwise occur with inserts and deletes. Ensuring that functional dependencies are enforced.

Relational database schema normalization is NOT for :Reducing the number of joins required to satisfy a query.Eliminating uncontrolled redundancy of data stored in the da...

makhdoom ghaya

1.7k views

makhdoom ghaya asked Sep 24, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Gate 2016 set no 2 question no 17
closed

Please log in or register to add a comment.

0 Answers

Related questions

0 reply

Please log in or register to add a comment.

0 Answers

Related questions

0