Recent activity by Ankita87077 / GATE Overflow for GATE CSE

1 answer

1

Demand Paging
Is this statement correct? " Demad paging can bring entire process into memory at load time" How it is correct? If it is, then anybody can explain it please.

Is this statement correct? " Demad paging can bring entire process into memory at load time"How it is correct? If it is, then anybody can explain it please.

1.2k views

commented Dec 7, 2021

1 answer

2

Made Easy test series
int a = 50, b = 50; a = a+++++b; b = b+++++a; Value of b after executing these . I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify it please.

int a = 50, b = 50;a = a+++++b;b = b+++++a; Value of b after executing these .I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify ...

582 views

asked Dec 2, 2021

4 answers

3

#self doubt
Every unambiguous grammar is LR(0) grammar?

Every unambiguous grammar is LR(0) grammar?

1.3k views

answered Nov 18, 2021

1 answer

4

GATE Overflow | Mock GATE | Test 1 | Question: 37
Consider the context switch of a CPU from the context of process $P1$ to that of process $P2$. Consider the following two events in the chronological order of the events during the context switch. (P) The Stack Pointer (SP) shifts ... via an atomic hardware instruction The relative ordering of $P$ and $Q$ varies from one context switch to the other

Consider the context switch of a CPU from the context of process $P1$ to that of process $P2$. Consider the following two events in the chronological order of the events ...

1.1k views

answer edited Oct 30, 2021

1 answer

5

Directed acyclic graph
Consider the following three address code: T1= a+b T2= c+d T3=a-b T4= T1+T3 T5= T2+T1 T6 = T5+T4 T7 = c + T6 Number of nodes and edges in DAG of the above code? If we'll do simplification , then T4 would be T4 = a+b+a-b => a+a , after this simplification T3 is not used anywhere in the program, so it can be eliminated or we'll include it in DAG??

Consider the following three address code:T1= a+bT2= c+dT3=a-bT4= T1+T3T5= T2+T1T6 = T5+T4T7 = c + T6Number of nodes and edges in DAG of the above code?If we'll do simpli...

1.0k views

commented Oct 29, 2021

1 answer

6

Compiler Design (register allocation)
In such questions, In which it is asked " minimum number of registers required for executing this three address code without spilling", can we apply code motion optimization or not? As in a question of made easy test series : T1 = a; ... = R1} So,which one is correct, made easy one or second one applying code motion? Can anybody please clarify this.

In such questions, In which it is asked " minimum number of registers required for executing this three address code without spilling", can we apply code motion optimizat...

543 views

commented Oct 28, 2021

0 answers

7

DAG ( compiler Design)
How Directed acyclic graph would be constructed for this instruction? b[j] = a ;

How Directed acyclic graph would be constructed for this instruction?b[j] = a ;

588 views

asked Oct 28, 2021

2 answers

8

Made Easy Test series
Consider the following language : P1 : {<M, x, k>| M is a TM and M does not halt on x within k steps} P2 : {<M>| M is TM and L(M) = $\phi$} P3 : {<M>| M is a TM and L(M) = finite language} The number of problems which are not RE is/are _______ ?

Consider the following language :P1 : {<M, x, k>| M is a TM and M does not halt on x within k steps}P2 : {<M>| M is TM and L(M) = $\phi$}P3 : {<M>| M is a TM and L(M) = f...

652 views

answered Oct 26, 2021

4 answers

9

Find number of variables in optimized code
Consider following 3 address code t1 = t+e t2 = g+a t3 = t1*t2 t4 = t2+t2 t5 = t4+t3 The minimum number of temporary variables that can be used in equivalent 3-address code of above code is Approach: t = t+e, g = g+a, t = t*g, g = g+g,t = t+g. Hence 4 temporary variables are needed. Is this right?

Consider following 3 address codet1 = t+et2 = g+at3 = t1*t2t4 = t2+t2t5 = t4+t3The minimum number of temporary variables that can be used in equivalent 3-address code of ...

2.4k views

answered Oct 26, 2021

1 answer

10

3-Address Code Generation
Hi Everyone, For this the Given Answer is 5, I got 4. I am now confused about how the 3 address code is generated here.

Hi Everyone,For this the Given Answer is 5, I got 4. I am now confused about how the 3 address code is generated here.

1.5k views

answered Oct 15, 2021

1 answer

11

LR(k) and CFL
I am quite confused in this . I have seen in many answers related to LR(k), that DCFL have one to one correspondence with LR(k) grammars. Means if a language is DCFL then it would definitely have a LR(k) grammar and if there is an LR(k) ... any ncfl. So, how for some unambiguous ncfl there exists an LR(k) grammar??? Please someone can provide a correct argument regarding this.

I am quite confused in this . I have seen in many answers related to LR(k), that DCFL have one to one correspondence with LR(k) grammars. Means if a language is DCFL then...

628 views

asked Sep 19, 2021

1 answer

12

CFL or DCFL?
Is the language L = {a^nb^m : n = m or n = m + 2} deterministic? Please anybody can clarify it.

Is the language L = {a^nb^m: n = m or n = m + 2} deterministic? Please anybody can clarify it.

279 views

asked Sep 17, 2021

1 answer

13

Peter Linz Edition 4 Exercise 7.1 Question 9 (Page No. 183)
Is it possible to find a dfa that accepts the same language as the pda $M= (${$q_0,q_1$},{$a,b$},{$z$},$\delta,q_0,z,${$q_1$}), with $\delta(q_0,a,z)=${$(q_1,z)$}, $\delta(q_0,b,z)=${$(q_0,z)$}, $\delta(q_1,a,z)=${$(q_1,z)$}, $\delta(q_1,b,z)=${$(q_0,z)$} ?

Is it possible to find a dfa that accepts the same language as the pda $M= (${$q_0,q_1$},{$a,b$},{$z$},$\delta,q_0,z,${$q_1$}),with ...

527 views

answered Sep 17, 2021

2 answers

14

Chomskey Normal Form
State true/false In CNF , S-> espilon and Start symbol can appear on RHS side of production.

State true/falseIn CNF , S- espilon and Start symbol can appear on RHS side of production.

2.9k views

answer edited Sep 16, 2021

1 answer

15

Peter Linz Edition 4 Exercise 5.2 Question 5 (Page No. 145)
Let $G = (V, T, S, P)$ be an s-grammar. Give an expression for the maximum size of $P$ in terms of $|V|$ and $|T|$.

Let $G = (V, T, S, P)$ be an s-grammar. Give an expression for the maximum size of $P$ in terms of $|V|$ and $|T|$.

197 views

answered Sep 13, 2021

1 answer

16

Peter Linz Edition 4 Exercise 4.2 Question 14 (Page No. 114)
Find an algorithm for determining whether a regular language $L$ contains an infinite number of even-length strings.

Find an algorithm for determining whether a regular language $L$ contains an infinite number of even-length strings.

371 views

answered Sep 11, 2021

10 answers

17

GATE CSE 2010 | Question: 39
Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular expressions below represents $L$? $(0^*10^*1)^*$ $0^*(10^*10^*)^*$ $0^*(10^*1)^*0^*$ $0^*1(10^*1)^*10^*$

Let $L=\{ w \in \:(0+1)^* \mid w\text{ has even number of }1s \}$. i.e., $L$ is the set of all the bit strings with even numbers of $1$s. Which one of the regular express...

22.4k views

answered Sep 5, 2021

6 answers

18

GATE CSE 2011 | Question: 55
An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each edge $(v_i,v_j)$ is assigned a weight $i+j$. A sample graph with $n=4$ is shown below. The length of the path from $v_5$ to $v_6$ in the MST of previous question with $n=10$ is $11$ $25$ $31$ $41$

An undirected graph $G(V,E)$ contains $n \: (n>2)$ nodes named $v_1,v_2, \dots, v_n$. Two nodes $v_i, v_j$ are connected if and only if $ 0 < \mid i-j\mid \leq 2$. Each ...

11.7k views

answered Aug 27, 2021

3 answers

19

GATE CSE 2002 | Question: 18-b
The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C function int TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: return y; } Complete the following C functions for implementing code ... -free? For the above solution, show by an example that mutual exclusion is not ensured if TEST-AND-SET instruction is not atomic?

The functionality of atomic TEST-AND-SET assembly language instruction is given by the following C functionint TEST-AND-SET (int *x) { int y; A1: y=*x; A2: *x=1; A3: retu...

3.4k views

commented Nov 10, 2020

1 answer

20

GATE Overflow Test Series | Computer Organization and Architecture | Test 1 | Question: 16
Which option is the correct order for transfer of a block of data? The peripheral device (such as disk controller) will request the service of DMA by pulling DREQ high CPU will finish the present bus cycle (not necessary the present instruction) and respond ... $(a)(b)(c)(d)(e)(f)(g)$ $(c)(b)(a)(d)(e)(f)(g)$

Which option is the correct order for transfer of a block of data?The peripheral device (such as disk controller) will request the service of DMA by pulling DREQ highCPU ...

202 views

answered Oct 13, 2020

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