Recent activity by Tushar Garg / GATE Overflow for GATE CSE

4 answers

1

GATE CSE 2020 | Question: GA-7
If $P = 3$, $R = 27$, $T = 243$, then $Q + S =$ ________ $40$ $80$ $90$ $110$

If $P = 3$, $R = 27$, $T = 243$, then $Q + S =$ ________$40$$80$$90$$110$

5.9k views

commented Feb 12, 2020

3 answers

2

GATE CSE 2020 | Question: GA-4
The dawn of the $21$st century witnessed the melting glaciers oscillating between giving too much and too little to billions of people who depend on them for fresh water. The UN climate report estimates that without deep cuts to man- ... billions of people. Billions of people are responsible for man-made emissions. Billions of people are affected by melting glaciers.

The dawn of the $21$st century witnessed the melting glaciers oscillating between giving too much and too little to billions of people who depend on them for fresh water....

3.7k views

commented Feb 12, 2020

4 answers

3

GATE CSE 2020 | Question: 48
Consider the following C functions. int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } return (i); } int pp(int a, int b) { int arr[20]; int i, tot = 1, ex, len; ex = a; len = tob(b ... ; i<len ; i++) { if (arr[i] ==1) tot = tot * ex; ex= ex*ex; } return (tot) ; } The value returned by $pp(3,4)$ is _______.

Consider the following C functions.int tob (int b, int* arr) { int i; for (i = 0; b>0; i++) { if (b%2) arr [i] = 1; else arr[i] = 0; b = b/2; } ret...

11.6k views

commented Feb 12, 2020

2 answers

4

Modified GATE2014-2-36
Let $L=\left \{ w\in\{0,1\}^* | \text{number of occurances of }(110)=\text{number of occurances of}(011) \right \}$ What is $L$? I think $L$ is regular . Regular expression is -: $L=\left \{ 0^{*}+1^{*}+\left ( \left ( \varepsilon +0+1 \right ) \left ( \varepsilon +0+1 \right ) \right ) + 0^{*}\left ( 0110 \right )^*0^{*}+1^* \left ( 11011 \right )^{*}1^{*} \right \}$

Let $L=\left \{ w\in\{0,1\}^* | \text{number of occurances of }(110)=\text{number of occurances of}(011) \right \}$What is $L$?I think $L$ is regular .Regular expressio...

1.4k views

comment edited Dec 23, 2019

4 answers

5

ISI2015-PCB-CS-2a
You are given two strings $S$ and $T$, each of length $\alpha$, consisting only of lower case English letters $(a,b, \dots ,z)$. Propose an $O(\alpha)$-time algorithm to decide whether $S$ can be obtained by permuting the symbols of $T$ ... $\text{YES}$; but if $S \: = \text{ trainee}$, $T\: = \text{ retinaa}$, your algorithm should return $\text{NO}$.

You are given two strings $S$ and $T$, each of length $\alpha$, consisting only of lower case English letters $(a,b, \dots ,z)$. Propose an $O(\alpha)$-time algorithm to ...

1.1k views

answered Feb 14, 2019

10 answers

6

GATE CSE 2006 | Question: 54
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ ... time in the key comparison mode Takes $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number

Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a...

29.8k views

answered Feb 14, 2019

4 answers

7

Can anyone explain the below question in a detailed way?
A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is the present(final) value of the binary semaphore mutex?

A Binary semaphore variable mutex is initialized to '1' and the various binary semaphore operations like 9P(), 14V(), 6P(), 8V(), 3P(), 2V() are performed, then what is t...

3.6k views

answered Nov 12, 2018

1 answer

8

self dout
what is the difference between denumerable , enumerable , countable. please explain I confused with this term when i see some theorem "Power set of an infinite set(denumerable ) set is not denumerable." "Let S be an infinite countable set. Then its power set 2s is not countable."

what is the difference between denumerable , enumerable , countable.please explain I confused with this term when i see some theorem "Power set of an infinite set(denum...

234 views

answer edited Sep 25, 2018

1 answer

9

self dout
Suppose L is language accepted by dfa with some final state it we convert non final state to final and final state to no final than this dfa accept the reverse of language L(this is true) but in case of pda if we convert non final to final and final to ... ? suppose anbn is accepted by pda and if we change final to non final and non final to final than which language is accepted byy pda

Suppose L is language accepted by dfa with some final stateit we convert non final state to final and final state to no final than this dfa accept the reverse of languag...

280 views

answered Sep 24, 2018

2 answers

10

Why is bounded waiting not related to starvation ?
When BW isn't satisfied , it imply that process will wait for indefinite period of time , so obviously we will have starvation , so how come they both are not related to each other ?

When BW isn't satisfied , it imply that process will wait for indefinite period of time , so obviously we will have starvation , so how come they both are not related to ...

1.7k views

answered Aug 23, 2018

0 answers

11

peterson's process synchronisation
In peterson's process synchronisation the process which perform 4th statement i.e (turn= process )first will get the critical section but if this is happen then their is race condition happen and inconsitency in output happen.. please correct me if i think wrong.

In peterson's process synchronisation the process which perform 4th statement i.e (turn= process )first will get the critical section but if this is happen then their is...

434 views

commented Aug 22, 2018

18 answers

12

GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$

Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into ...

49.6k views

commented Jul 24, 2018

1 answer

13

Made easy
How to solve it?Q 5

How to solve it?Q 5

321 views

commented Jul 11, 2018

1 answer

14

Made easy workbook
In question 13 Can we directly apply the formulae or we have to change the bandwidth(if have to change then how can we change)

In question 13 Can we directly apply the formulae or we have to change the bandwidth(if have to change then how can we change)

278 views

asked Jul 11, 2018

1 answer

15

Made easy workbook
How option d is the answer??

How option d is the answer??

624 views

commented Jul 6, 2018

1 answer

16

Workbook
How option c is regular?

How option c is regular?

245 views

commented Jul 5, 2018

3 answers

17

Algorithm substitution method
How to find log n base2+ log n base 3+ log n base4+........log n base n?

How to find log n base2+ log n base 3+ log n base4+........log n base n?

1.7k views

commented Jul 4, 2018

0 answers

18

Work book
When we start with s3 then statement 3 fails becoz on taking 0 only it give us 1 so why answer is option c

When we start with s3 then statement 3 fails becoz on taking 0 only it give us 1 so why answer is option c

219 views

commented Jul 4, 2018

1 answer

19

Context Free Grammar
What is Non-Inheritant grammar and inheritant Grammar? Please explain with an example.

What is Non-Inheritant grammar and inheritant Grammar? Please explain with an example.

206 views

answered Jul 2, 2018

2 answers

20

Complexity!!!
Hello anyone can help me to find big O for this algorithm please.... f=1; x=3; for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) for (int k = 1; k <= j; k++) f=f*x;

Hello anyone can help me to find big O for this algorithm please.... f=1;x=3;for (int i = 1; i <= n; i*=2) for (int j = 1; j <= i * i; j++) if (i % j == 0) ...

317 views

answered Jul 2, 2018

6 answers

21

GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language

Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ isalways regularnever regularalways a deterministic context-free languagealways...

10.0k views

commented Mar 15, 2018

4 answers

22

GATE IT 2006 | Question: 33
Consider the pushdown automaton (PDA) below which runs over the input alphabet $(a, b, c)$. It has the stack alphabet $\{Z_0, X\}$ where $Z_0$ is the bottom-of-stack marker. The set of states of the PDA is $(s, t, u, f\}$ where $s$ is the start state and $f$ is the final state. The PDA ... $\{a^lb^mc^n \mid 2l = m + n\}$ $\{a^lb^mc^n \mid m = n\}$

Consider the pushdown automaton (PDA) below which runs over the input alphabet $(a, b, c)$. It has the stack alphabet $\{Z_0, X\}$ where $Z_0$ is the bottom-of-stack mark...

7.8k views

answered Mar 15, 2018

4 answers

23

GATE IT 2005 | Question: 4
Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ ... TRUE? It is necessarily regular but not necessarily context-free. It is necessarily context-free. It is necessarily non-regular. None of the above

Let $L$ be a regular language and $M$ be a context-free language, both over the alphabet $Σ$. Let $L^c$ and $M^c$ denote the complements of $L$ and $M$ respectively. Whi...

7.9k views

answered Mar 15, 2018

7 answers

24

GATE CSE 2015 Set 2 | Question: 21
Consider the following statements. The complement of every Turing decidable language is Turing decidable There exists some language which is in NP but is not Turing decidable If L is a language in NP, L is Turing decidable Which of the above statements is/are true? Only II Only III Only I and II Only I and III

Consider the following statements.The complement of every Turing decidable language is Turing decidableThere exists some language which is in NP but is not Turing decidab...

16.0k views

answered Mar 15, 2018

3 answers

25

GATE CSE 1987 | Question: 2j
State whether the following statements are TRUE or FALSE: A minimal DFA that is equivalent to an NDFA with $n$ nodes has always $2^{n}$ states.

State whether the following statements are TRUE or FALSE:A minimal DFA that is equivalent to an NDFA with $n$ nodes has always $2^{n}$ states.

5.3k views

answered Mar 15, 2018

4 answers

26

GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.

State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.

3.4k views

answered Mar 15, 2018

2 answers

27

GATE CSE 1987 | Question: 2m
State whether the following statements are TRUE or FALSE: The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.

State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.

4.0k views

answered Mar 15, 2018

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