Recent activity by amitpawar / GATE Overflow for GATE CSE

5 answers

1

GATE CSE 2018 | Question: 55
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense based medium access protocol. A node that receives a ... allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s ongoing transmission is _______.

Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the follow...

19.3k views

commented Dec 15, 2018

3 answers

2

Test by Bikram | Algorithms | Test 2 | Question: 24
Given $n$ number of linearly ordered distinct elements, what will be the worst case time complexity to find $p$-th smallest element $(1 \leq p \leq n)$ from these $n$ elements when $n > 50$? $O(n \log n)$ $O(n^2)$ $O(n)$ $O(\log n)$

Given $n$ number of linearly ordered distinct elements, what will be the worst case time complexity to find$p$-th smallest element $(1 \leq p \leq n)$ from these $n$ elem...

745 views

commented Sep 12, 2017

1 answer

3

Test by Bikram | Compiler Design | Test 1 | Question: 2
The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce dependent on a situation

The default type of conflict resolution rule for the Yacc parser generator is _________________. in favor of shift in favor of reduce either shift or reduce depen...

550 views

commented Aug 30, 2017

4 answers

4

GATE CSE 1997 | Question: 11
Consider the grammar $S \rightarrow bSe$ $S \rightarrow PQR$ $P \rightarrow bPc$ $P \rightarrow \varepsilon$ $Q \rightarrow cQd$ $Q \rightarrow \varepsilon$ $R \rightarrow dRe$ $R \rightarrow \varepsilon$ where $S, P, Q, R$ ... $i, j, k, m$? Find the smallest string that has two parse trees.

Consider the grammar$S \rightarrow bSe$$S \rightarrow PQR$$P \rightarrow bPc$$P \rightarrow \varepsilon$$Q \rightarrow cQd$$Q \rightarrow \varepsilon$$R \rightarrow dRe...

6.5k views

commented Aug 29, 2017

1 answer

5

Test by Bikram | Theory of Computation | Test 2 | Question: 8
Which of the following Regular Expression is NOT the same as the other three? $100 ( ( (00)^* (10)^* )^* 100)^*$ $100 ( ( ( 0+1) 0)^* 100 )^*$ $100 ( (00 + 10)^* 100)^*$ $100 ( ((0+1)^* 0^* )^* 100)^*$

Which of the following Regular Expression is NOT the same as the other three?$100 ( ( (00)^* (10)^* )^* 100)^*$$100 ( ( ( 0+1) 0)^* 100 )^*$$100 ( (00 + 10)^* 100)^*$$10...

274 views

answered Aug 28, 2017

1 answer

6

Test by Bikram | Theory of Computation | Test 2 | Question: 2
Which of the following is correct? $(01)^* \cap (10)^* = \phi$ $(a + b + c)^* = a^*b^*c^* + a^*b^* + c^* + c^*a^*b^*$ $(p + q)^* p + (p + q)^* q + \epsilon = (p^* q^*)^*$ $( y + z)^* \cap (y + z)^* yz \neq ( y + z)^* yz$

Which of the following is correct?$(01)^* \cap (10)^* = \phi$$(a + b + c)^* = a^*b^*c^* + a^*b^* + c^* + c^*a^*b^*$$(p + q)^* p + (p + q)^* q + \epsilon = (p^* q^*)^*$$( ...

680 views

commented Aug 28, 2017

1 answer

7

Test by Bikram | Theory of Computation | Test 2 | Question: 1
Choose the appropriate context-free language $L_2$ that ensure that $L_1 \cap L_2$ is NOT context-free, where $L_1 = \{x^ny^m z^m \mid m > 0, n > 0 \}$: $L_2 = \{x^n y^n z^{2m} \mid n > 0, m > 0 \}$ $L_2 = \{x^n y^m z^p \mid n > m \text{ and } m > p \}$ $L_2 = \{x^n y^n z^n \mid n > 0 \}$ Both (A) and (B)

Choose the appropriate context-free language $L_2$ that ensure that $L_1 \cap L_2$ is NOT context-free, where $L_1 = \{x^ny^m z^m \mid m 0, n 0 \}$:$L_2 = \{x^n y^n z...

796 views

commented Aug 28, 2017

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