Answers by Arjun / GATE Overflow for GATE CSE

1 votes

331

ISI2012-PCB-CS-1b
Two processes $P_1$ and $P_2$ have a common shared variable count. While $P_1$ increments it, $P_2$ decrements it. Given that $R_0$ is a register, the corresponding assembly language codes are: $P_1$ count++ $P_2$ count-- MOV $count$ $R_0$ ... $P_1$ and $P_2$ are executed simultaneously.

Two processes $P_1$ and $P_2$ have a common shared variable count. While $P_1$ increments it, $P_2$ decrements it. Given that $R_0$ is a register, the corresponding assem...

596 views

answered May 19, 2019

11 votes

332

GATE CSE 1989 | Question: 4-vii
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.

In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.

2.8k views

answered May 17, 2019

8 votes

333

GATE CSE 2001 | Question: 17
The syntax of the repeat-until statement is given by the following grammar $S \rightarrow\text{ repeat }S_1\text{ until }E$ where E stands for expressions, $S$ and $S_1$ stand for statements. The non-terminals $S$ and $S_1$ have an ... Use the operator '\\' to concatenate two strings and the function gen(s) to generate a line containing the string s.

The syntax of the repeat-until statement is given by the following grammar$S \rightarrow\text{ repeat }S_1\text{ until }E$where E stands for expressions, $S$ and $S_1$ st...

2.1k views

answered May 17, 2019

15 votes

334

GATE CSE 1994 | Question: 7
An array $A$ contains $n$ integers in locations $A[0], A[1], \dots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $K$ places, where $1\leq K \leq n-1$. An incomplete algorithm for doing this in linear time, without using another array ... j]:=____; j:=(j+K) mod n; if j<min then min:=j; end; A[(n+i-K)mod n]:=____; i:=______; end;

An array $A$ contains $n$ integers in locations $A[0], A , \dots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $K$ places, where $1...

4.0k views

answered May 17, 2019

41 votes

335

GATE CSE 2019 | Question: 36
Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the non-terminals $D, T, L$ or $L_1$ ... $X_1=T, \: X_2=L, \: X_3=T, \: X_4 = L_1$

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders...

16.7k views

answered May 17, 2019

16 votes

336

CMI2010-B-04b
Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers. A DFA that has $n$ states and accepts an infinite language must accept at least one string $x$ such that $2n < |x| < 3n$, where $|x|$ denotes the length of $x$.

Indicate whether the following statement is true or false, providing a short explanation to substantiate your answers.A DFA that has $n$ states and accepts an infinite la...

4.1k views

answered May 2, 2019

13 votes

337

GATE CSE 2005 | Question: 16, ISRO2009-18, ISRO2015-2
The range of integers that can be represented by an $n$ bit $2’s$ complement number system is: $-2^{n-1} \text{ to } (2^{n-1} -1)$ $-(2^{n-1} -1) \text{ to } (2^{n-1} -1)$ $-2^{n-1} \text{ to } 2^{n-1}$ $-(2^{n-1} +1) \text{ to } (2^{n-1} -1)$

The range of integers that can be represented by an $n$ bit $2’s$ complement number system is:$-2^{n-1} \text{ to } (2^{n-1} -1)$$-(2^{n-1} -1) \text{ to } (2^{n-1} -1)...

9.8k views

answered May 1, 2019

19 votes

338

GATE IT 2007 | Question: 78
Consider the following expression $a\bar d + \bar a\bar c + b\bar cd$ Which of the following Karnaugh Maps correctly represents the expression?

Consider the following expression$a\bar d + \bar a\bar c + b\bar cd$Which of the following Karnaugh Maps correctly represents the expression?

4.8k views

answered Apr 29, 2019

4 votes

339

GATE CSE 1999 | Question: 10
Suppose we have a function HALTS which when applied to any arbitrary function $f$ and its arguments will say TRUE if function $f$ terminates for those arguments and FALSE otherwise. Example: Given the following function definition. FACTORIAL (N) ... have a function like HALTS which for arbitrary functions and inputs says whether it will terminate on that input or not.

Suppose we have a function HALTS which when applied to any arbitrary function $f$ and its arguments will say TRUE if function $f$ terminates for those arguments and FALSE...

1.7k views

answered Apr 27, 2019

5 votes

340

P and np doubt
Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(either ntm or dtm). So np and p both should be recursive. Am i right here? Please answer

Are p and np languages all recursive? Because p and np both correspond to languages which have algorithms and algorithms means that there is a halting turning machine(eit...

1.2k views

answered Apr 18, 2019

1 votes

341

GO pdf hard copy
Pre booking for GO pdf hardcopy available?

Pre booking for GO pdf hardcopy available?

713 views

answered Apr 14, 2019

8 votes

342

#arrays
i write this program, during initialization of array i given the size as 11 means the number of elements stored in an array is 11. as we know array is not assigned a value of index 12 and above. but in in the program array a is initialized of index from 0 to 19,my question is how the array is ... i=0;i<20;i++) { a[i]=i+1; } for(i=0;i<20;i++) { printf("%d\n",a[i]); } }

i write this program, during initialization of array i given the size as 11 means the number of elements stored in an array is 11.as we know array is not assigned a value...

708 views

answered Apr 7, 2019

4 votes

343

self doubt
difference between empty language and empty string

difference between empty language and empty string

421 views

answered Apr 6, 2019

4 votes

344

#gate2020
Hello!! all the respected members of gate overflow.. I am a gate 2020 aspirant Our paper is going to be made by IIT Delhi as per i got the information Can u all please guide me how to prepare and what topics I must focus on more ...What will be my strategy and all..& if i get a timetable I would be greatful to u all Thank you

Hello!! all the respected members of gate overflow..I am a gate 2020 aspirantOur paper is going to be made by IIT Delhi as per i got the informationCan u all please guide...

485 views

answered Mar 19, 2019

1 votes

345

Set Theory Self Doubt
Is the subset of a countably infinite set countable?

Is the subset of a countably infinite set countable?

231 views

answered Mar 19, 2019

1 votes

346

Peter Linz Edition 5 Exercise 11.1 Question 12 (Page No. 284)
Let $L_1$ be recursive and $L_2$ recursively enumerable. Show that $L_2-L_1$ is necessarily recursively enumerable.

Let $L_1$ be recursive and $L_2$ recursively enumerable. Show that $L_2-L_1$ is necessarily recursively enumerable.

337 views

answered Mar 16, 2019

11 votes

347

TIFR CSE 2019 | Part A | Question: 12
Let $f$ be a function with both input and output in the set $\{0,1,2, \dots ,9\}$, and let the function $g$ be defined as $g(x) = f(9-x)$. The function $f$ is non-decreasing, so that $f(x) \geq f(y)$ for $x \geq y$. Consider the following statements ... and $g$ ? Only $\text{(i)}$ Only $\text{(i)}$ and $\text{(ii)}$ Only $\text{(iii)}$ None of them All of them

Let $f$ be a function with both input and output in the set $\{0,1,2, \dots ,9\}$, and let the function $g$ be defined as $g(x) = f(9-x)$. The function $f$ is non-decreas...

1.7k views

answered Mar 14, 2019

23 votes

348

GATE CSE 2019 | Question: 48
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______

Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$...

20.4k views

answered Feb 20, 2019

12 votes

349

GATE2019 CE-2: GA-7
Population of state $X$ increased by x$\%$ and the population of state $Y$ increased by y$\%$ from $2001$ to $2011.$ Assume that $x$ is greater than $y$. Let $P$ be the ratio of the population of state $X$ to state $Y$ in a given year. The percentage increase in $P$ from $2001$ to $2011$ is ________ $\frac{x}{y}$ $x-y$ $\frac{100(x-y)}{100+x}$ $\frac{100(x-y)}{100+y}$

Population of state $X$ increased by x$\%$ and the population of state $Y$ increased by y$\%$ from $2001$ to $2011.$ Assume that $x$ is greater than $y$. Let $P$ be the ...

1.9k views

answered Feb 14, 2019

2 votes

350

GATE19 Admission [Rank - 631/28326 Marks - 61.67]
Is the rank of 631/28326 a good rank? What college I must apply to? or any advice/suggestion will be helpful and r welcome. Marks – 61.67 Accuracy – 98%+ (Only 1 -ve in Tag bit question) Category – SC but ok with OPEN too. Thank You in Advance (^_^)

Is the rank of 631/28326 a good rank?What college I must apply to? or any advice/suggestion will be helpful and r welcome.Marks – 61.67Accuracy – 98%+ (Only 1 -ve in ...

1.3k views

answered Feb 14, 2019

1 votes

351

gate overflow rank prediction 2019
Is this gate overflow rank prediction 2019 working fine because it seem more marks are needed for good rank as compare to previous years

Is this gate overflow rank prediction 2019 working fine because it seem more marks are needed for good rank as compare to previous years

6.0k views

answered Feb 14, 2019

0 votes

352

Gate 2019
When you are going to create Gate 2019 mark calculator for chemical engineering...?

When you are going to create Gate 2019 mark calculator for chemical engineering...?

1.1k views

answered Feb 9, 2019

17 votes

353

Test Series For Gate 2020
Which are the best Test-Series for gate 2020.In terms of quality of question and for practice purposes. Just solving PYQ’s is it enough?

Which are the best Test-Series for gate 2020.In terms of quality of question and for practice purposes.Just solving PYQ’s is it enough?

4.3k views

answered Feb 9, 2019

3 votes

354

#General #GO
How can I bookmark questions on GO?

How can I bookmark questions on GO?

387 views

answered Feb 9, 2019

2 votes

355

Qualifying marks for general candidates gate cse 2019?
I heard that the qualifying marks may increase from 25 marks for the general candidates since the gate paper was comparatively easy this time. Please tell me how much it may increase as I am a bit scared.

I heard that the qualifying marks may increase from 25 marks for the general candidates since the gate paper was comparatively easy this time. Please tell me how much it ...

1.3k views

answered Feb 8, 2019

135 votes

356

GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at ...

31.0k views

answered Feb 7, 2019

63 votes

357

GATE CSE 2019 | Question: 45
A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a cache miss, the memory controller first takes $1$ cycle to accept ... for the memory system when the program running on the processor issues a series of read operations is ______$\times 10^6$ bytes/sec.

A certain processor deploys a single-level cache. The cache block size is $8$ words and the word size is $4$ bytes. The memory system uses a $60$-MHz clock. To service a ...

20.6k views

answered Feb 7, 2019

5 votes

358

Less than equal to 40 In OBC ,branch CSE
Will I get any IITs under 40 marks in gate 2018 in OBC category ?

Will I get any IITs under 40 marks in gate 2018 in OBC category ?

992 views

answered Jan 26, 2019

4 votes

359

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar

Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...

3.3k views

answered Jan 26, 2019

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