Recent activity by Danishgupta / GATE Overflow for GATE CSE

2 answers

1

GATE CSE 1993 | Question: 7.6
A simple two-pass assembler does the following in the first pass: It allocates space for the literals. It computes the total length of the program. It builds the symbol table for the symbols and their values. It generates code for all the load and store register instructions. None of the above.

A simple two-pass assembler does the following in the first pass:It allocates space for the literals.It computes the total length of the program.It builds the symbol tabl...

19.8k views

commented Nov 23, 2022

5 answers

2

GATE CSE 2004 | Question: 7
Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true? $9679, 1989, 4199$ hash to the same value $1471, 6171$ hash to the same value All elements hash to the same value Each element hashes to a different value I only II only I and II only III or IV

Given the following input $(4322, 1334, 1471, 9679, 1989, 6171, 6173, 4199)$ and the hash function $x$ mod $10$, which of the following statements are true?$9679, 1989, 4...

9.9k views

commented Aug 16, 2022

1 answer

3

loader can perform linking. how?
loader can perform linking .it is true how?and what are combined features that loader can perform ?

loader can perform linking .it is true how?and what are combined features that loader can perform ?

631 views

answered Jun 29, 2022

1 answer

4

NIELIT Scientist B 2020 November: 34
Two taps $A$ and $B$ can fill a tank in $12$ minutes and $15$ minutes respectively. The tank can be emptied by a third tap $C$ in $6$ minutes. If $A$ and $B$ are kept open for $5$ minutes in the beginning and then $C$ is opened along with $A$ and $B$ being kept open, the time taken to empty the tank is: $60$ minutes $45$ minutes $30$ minutes $75$ minutes

Two taps $A$ and $B$ can fill a tank in $12$ minutes and $15$ minutes respectively. The tank can be emptied by a third tap $C$ in $6$ minutes. If $A$ and $B$ are kept ope...

527 views

commented Jul 1, 2021

4 answers

5

NIELIT Scientist B 2020 November: 21
There are $6$ boxes numbered $1, 2, \dots\dots,6$. Each box is to be filled up either with a red or a green ball in such a way that at least $1$ box contains a green ball and the boxes containing green balls are consecutively numbered. The total number of ways in which this can be done is : $18$ $19$ $20$ $21$

There are $6$ boxes numbered $1, 2, \dots\dots,6$. Each box is to be filled up either with a red or a green ball in such a way that at least $1$ box contains a green ball...

1.4k views

commented Jul 1, 2021

1 answer

6

ISI2018-DCG-2
If $P$ is an integer from $1$ to $50$, what is the probability that $P(P+1)$ is divisible by $4$? $0.25$ $0.50$ $0.48$ none of these

If $P$ is an integer from $1$ to $50$, what is the probability that $P(P+1)$ is divisible by $4$?$0.25$$0.50$$0.48$none of these

778 views

commented Jun 30, 2021

9 answers

7

GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$

Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...

34.9k views

commented Dec 24, 2020

4 answers

8

NIELIT 2017 DEC Scientist B - Section B: 47
INCA(Increase register A by $1$) is an example of which of the following addressing mode? Immediate addressing Indirect addressing Implied addressing Relative addressing

INCA(Increase register A by $1$) is an example of which of the following addressing mode?Immediate addressingIndirect addressingImplied addressingRelative addressing

2.6k views

commented Sep 19, 2020

3 answers

9

NIELIT 2018-2
Divide $88$ into four parts such as first part known as $a,$ second part $b,$ third part $c,$ and fourth part is $d,$ when $5$ is added to the first part, $5$ is subtracted from the second part, $3$ is multiplied by the third part and the fourth part is divided by $5,$ then all results ... $d$ respectively. $7, 17, 4, 60$ $8, 25, 5, 50$ $10, 30, 3, 45$ $17, 7, 4, 60$

Divide $88$ into four parts such as first part known as $a,$ second part $b,$ third part $c,$ and fourth part is $d,$ when $5$ is added to the first part, $5$ is subtract...

3.1k views

commented Sep 17, 2020

4 answers

10

GATE CSE 2006 | Question: 58
Consider the following grammar: $S\rightarrow FR$ $ R\rightarrow * S\mid \varepsilon $ $ F\rightarrow id $ In the predictive parser table $M$ of the grammar the entries $M[S,id]$ and $M[R,\$]$ respectively are $ \left \{ S\rightarrow FR \right \} $ and $ ... $ \left \{ F\rightarrow id \right \} $ and $ \left \{ R\rightarrow \varepsilon \right \} $

Consider the following grammar:$S\rightarrow FR$$ R\rightarrow * S\mid \varepsilon $$ F\rightarrow id $In the predictive parser table $M$ of the grammar the entries $M[S...

8.1k views

commented Sep 16, 2020

4 answers

11

GATE IT 2005 | Question: 83b
Consider the context-free grammar $E\rightarrow E+E$ $E\rightarrow (E *E)$ $E\rightarrow \text{id}$ where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\}$, and the set of non-terminals is $\{E\}$. For the terminal string $id + id + id + id$, how many parse trees are possible? $5$ $4$ $3$ $2$

Consider the context-free grammar$E\rightarrow E+E$$E\rightarrow (E *E)$$E\rightarrow \text{id}$where $E$ is the starting symbol, the set of terminals is $\{id, (,+,),*\}...

6.9k views

commented Sep 15, 2020

7 answers

12

GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$

Consider the following expression grammar $G$:$E \rightarrow E-T \mid T$$T \rightarrow T + F \mid F$$F \rightarrow (E) \mid id$Which of the following grammars is not left...

11.0k views

commented Sep 15, 2020

5 answers

13

GATE CSE 2010 | Question: 13
Which data structure in a compiler is used for managing information about variables and their attributes? Abstract syntax tree Symbol table Semantic stack Parse table

Which data structure in a compiler is used for managing information about variables and their attributes?Abstract syntax treeSymbol tableSemantic stackParse table

14.3k views

commented Sep 14, 2020

14 answers

14

GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.

Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...

38.1k views

commented Sep 10, 2020

6 answers

15

GATE CSE 2008 | Question: 64, ISRO2009-13
Which of the following statements about synchronous and asynchronous I/O is NOT true? An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O In both synchronous and asynchronous I/O, an ISR (Interrupt Service ... process waiting for the completion of I/O is woken up by the ISR that is invoked after the completion of I/O

Which of the following statements about synchronous and asynchronous I/O is NOT true?An ISR is invoked on completion of I/O in synchronous I/O but not in asynchronous I/O...

17.7k views

commented Sep 9, 2020

6 answers

16

GATE IT 2007 | Question: 26
Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$ ... the jobs? Non-decreasing order of $t_i$ Non-increasing order of $w_i$ Non-increasing order of $w_it_i$ Non-increasing order of $w_i/t_i$

Consider $n$ jobs $J_1, J_2 \dots J_n$ such that job $J_i$ has execution time $t_i$ and a non-negative integer weight $w_i$. The weighted mean completion time of the jobs...

14.6k views

commented Sep 9, 2020

6 answers

17

GATE CSE 2012 | Question: 31
Consider the $3$ processes, $P1, P2$ and $P3$ ... $P1, P3, P2$ FCFS: $P1, P2, P3$ RR2: $P1, P3, P2$ FCFS: $P1, P3, P2$ RR2: $P1, P2, P3$

Consider the $3$ processes, $P1, P2$ and $P3$ shown in the table. $$\small \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time} & \textbf{Time Units Req...

19.6k views

commented Sep 8, 2020

2 answers

18

ISRO2011-60
A total of 9 units of a resource type available, and given the safe state shown below, which of the following sequence will be a safe state? Process Used Max $P_1$ 2 7 $P_2$ 1 6 $P_3$ 2 5 $P_4$ 1 4 $\langle P_4, P_1, P_3, P_2\rangle$ $\langle P_4, P_2, P_1, P_3\rangle $ $\langle P_4, P_2, P_3, P_1\rangle $ $\langle P_3, P_1, P_2, P_4 \rangle$

A total of 9 units of a resource type available, and given the safe state shown below, which of the following sequence will be a safe state?ProcessUsedMax$P_1$27$P_2$16$P...

5.7k views

commented Dec 31, 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