Dark Mode

Recent activity by Mridul Sachan

8 answers

1

GATE CSE 1996 | Question: 2.3
Which of the following is NOT True? (Read $\wedge$ as AND, $\vee$ as OR, $\neg$ as NOT, $\rightarrow$ as one way implication and $\leftrightarrow$ as two way implication) $((x \rightarrow y) \wedge x) \rightarrow y$ ... $(x \rightarrow (x \vee y))$ $((x \vee y) \leftrightarrow (\neg x \rightarrow \neg y))$

answer edited in Mathematical Logic Mar 12, 2016

6.3k views

3 answers

2

GATE CSE 1993 | Question: 8.2
The proposition $p \wedge (\sim p \vee q)$ is: a tautology logically equivalent to $p \wedge q$ logically equivalent to $p \vee q$ a contradiction none of the above

answered in Mathematical Logic Mar 11, 2016

7.0k views

3 answers

3

TIFR CSE 2010 | Part A | Question: 8
Which of the following is NOT necessarily true? { Notation: The symbol ''$\neg$''notes negation; $P (x, y)$ means that for given $x$ and $y$, the property $P(x, y)$ is true }. $(∀x∀y P(x, y)) \Rightarrow (∀y∀x P(x, y))$ ... $(∃x∀y P(x, y)) \Rightarrow (∀y∃x P(x, y))$ $(∀x∃y P(x, y)) \Rightarrow (∃y∀x P(x, y))$

commented in Mathematical Logic Mar 11, 2016

2.6k views

4 answers

4

GATE CSE 2000 | Question: 1.5
Let $L$ denote the languages generated by the grammar $S \to 0S0 \mid 00$. Which of the following is TRUE? $L = 0^+$ $L$ is regular but not $0^+$ $L$ is context free but not regular $L$ is not context free

commented in Theory of Computation Jan 23, 2016

8.5k views

7 answers

5

GATE CSE 1998 | Question: 1.12
The string $1101$ does not belong to the set represented by $110^*(0 + 1)$ $1(0 + 1)^*101$ $(10)^*(01)^*(00 + 11)^*$ $(00 + (11)^*0)^*$

answered in Theory of Computation Jan 23, 2016

19.4k views

5 answers

6

GATE CSE 2004 | Question: 15
Choose the best matching between $\text{Group 1}$ and $\text{Group 2}$ ... $\text{P-2, Q-4, R-1}$ $\text{P-2, Q-3, R-1}$ $\text{P-1, Q-3, R-2}$

commented in Computer Networks Jan 21, 2016

5.4k views

2 answers

7

GATE CSE 2010 | Question: 17
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2 - L_1 \:\text{is recursively enumerable.}$ ... $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$

commented in Theory of Computation Nov 24, 2015

13.1k views

2 answers

8

GATE CSE 1996 | Question: 1.11
Which of the following is false? $100n \log n=O(\frac{n\log n}{100})$ $\sqrt{\log n} = O(\log\log n)$ If $0 < x < y \text{ then } n^x = O\left(n^y\right)$ $2^n \neq O\left(nk\right)$

commented in Algorithms Jun 27, 2015

16.0k views