Answers by Arjun / GATE Overflow for GATE CSE

31 votes

161

GATE CSE 2021 Set 2 | Question: 42
Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes spawns two threads $T_1$ and $T_2$: int x = 0; // global Lock L1; // global main () { create a ... the value of $y$ as $2.$ Both $T_1$ and $T_2$, in both the processes, will print the value of $y$ as $1.$

Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes ...

10.4k views

answered Feb 20, 2021

65 votes

162

GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.

There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that:The fastest computer g...

11.9k views

answered Feb 19, 2021

20 votes

163

GATE CSE 2021 Set 1 | Question: 55
Consider the following instruction sequence where registers $\text{R1}, \text{R2}$ and $\text{R3}$ are general purpose and $\text{MEMORY[X]}$ denotes the content at the memory location $\text{X}.$ ... . Assume that the memory is byte addressable. After the execution of the program, the content of memory location $3010$ is ____________

Consider the following instruction sequence where registers $\text{R1}, \text{R2}$ and $\text{R3}$ are general purpose and $\text{MEMORY[X]}$ denotes the content at the m...

8.8k views

answered Feb 18, 2021

15 votes

164

GATE CSE 2000 | Question: 2.8
What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states? $L$ must be $\{a^n \mid n \ \text{ is odd}\}$ $L$ must be $\{a^n \mid n \ \text{ is even}\}$ $L$ must be $\{a^n \mid n \geq 0\}$ Either $L$ must be $\{a^n \mid n \text{ is odd}\}$, or $L$ must be $\{a^n \mid n \text{ is even}\}$

What can be said about a regular language $L$ over $\{ a \}$ whose minimal finite state automaton has two states?$L$ must be $\{a^n \mid n \ \text{ is odd}\}$$L$ must be...

9.0k views

answered Feb 14, 2021

4 votes

165

Test by Bikram | General Aptitude | Test 2 | Question: 30
A, B, and C worked together to complete a job in $10$ days. However, C only worked for the first three days when $37/100$ of the job was done. Also, the work done by A in $5$ days is equal to the work done by B in $4$ days. How many days would be required by the fastest worker to complete the entire job? $30$ $28$ $20$ $45$

A, B, and C worked together to complete a job in $10$ days. However, C only worked for the first three days when $37/100$ of the job was done. Also, the work done by A in...

472 views

answered Jun 1, 2020

5 votes

166

NIELIT 2016 DEC Scientist B (CS) - Section B: 57
The output of lexical analyzer is: A set of regular expressions Strings of character Syntax tree Set of tokens

The output of lexical analyzer is:A set of regular expressionsStrings of characterSyntax treeSet of tokens

1.8k views

answered Apr 2, 2020

53 votes

167

GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order? $\Theta(n)$ $\Theta(n \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$

What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...

26.6k views

answered Feb 18, 2020

37 votes

168

GATE CSE 2020 | Question: 53
Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $\textsf{TLB}$ lookup takes $20$ ns. Each page transfer to/from the disk ... $1$ decimal places) is ___________

Consider a paging system that uses $1$-level page table residing in main memory and a $\textsf{TLB}$ for address translation. Each main memory access takes $100$ ns and $...

46.8k views

answered Feb 13, 2020

4 votes

169

difference between compulsory miss, conflict miss and capacity miss
I want to clearly understand the difference between compulsory miss, conflict miss and capacity miss what I understood is compulsory miss: when a block of main memory is trying to occupy fresh empty line of cache, it ... Because in associative mapping, no block of main memory tries to occupy already filled line. is this correct?

I want to clearly understand the difference between compulsory miss, conflict miss and capacity misswhat I understood iscompulsory miss: when a block of main memory is tr...

18.7k views

answered Jan 3, 2020

15 votes

170

GATE2014 AG: GA-5
The population of a new city is $5$ million and is growing at $20\%$ annually. How many years would it take to double at this growth rate? $3-4$ years $4-5$ years $5-6$ years $6-7$ years

The population of a new city is $5$ million and is growing at $20\%$ annually. How many years would it take to double at this growth rate? $3-4$ years$4-5$ years $5-6$ ye...

7.1k views

answered Nov 8, 2019

28 votes

171

GATE IT 2005 | Question: 50
In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h > 0$, then the minimum number of nodes in the tree is $2^{h-1}$ $2^{h-1} + 1$ $2^h - 1$ $2^h$

In a binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most $2$. If the height of the tree is $h 0$, then the m...

22.9k views

answered Oct 19, 2019

3 votes

172

REGARDING DISCRETE MATHS SYLLABUS
FIELD AND RING ARE IN SYLLABUS???

FIELD AND RING ARE IN SYLLABUS???

826 views

answered Sep 10, 2019

6 votes

173

Gateforum mock 2

462 views

answered Aug 12, 2019

2 votes

174

TM Decidablity
Why this statement Turing Machine accepts the null string epsilon ? is not Decidable ? explain with an example.

Why this statement Turing Machine accepts the null string epsilon ? is not Decidable ? explain with an example.

1.4k views

answered Aug 7, 2019

8 votes

175

GATE CSE 1997 | Question: 73
A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the range $1 \dots 3$, $3$ being the highest priority. It is required to synchronize ... =true; else begin V(proceed [priority]); busy:=true; end V(mutex) Give the pseudo code for the procedure release_R.

A concurrent system consists of $3$ processes using a shared resource $R$ in a non-preemptible and mutually exclusive manner. The processes have unique priorities in the ...

1.9k views

answered Jul 15, 2019

9 votes

176

GATE CSE 1988 | Question: 9iii
In the program scheme given below indicate the instructions containing any operand needing relocation for position independent behaviour. Justify your answer. ...

In the program scheme given below indicate the instructions containing any operand needing relocation for position independent behaviour. Justify your answer.$$\begin{arr...

3.6k views

answered Jul 14, 2019

15 votes

177

GATE CSE 1993 | Question: 6.2
If the state machine described in figure should have a stable state, the restriction on the inputs is given by $a.b=1$ $a+b=1$ $\bar{a} + \bar{b} =0$ $\overline{a.b}=1$ $\overline{a+b} =1$

If the state machine described in figure should have a stable state, the restriction on the inputs is given by$a.b=1$$a+b=1$$\bar{a} + \bar{b} =0$$\overline{a.b}=1$$\over...

7.1k views

answered Jul 14, 2019

8 votes

178

GATE CSE 2014 Set 1 | Question: 33
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using the optimal replacement policy is__________.

Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using ...

7.4k views

answered Jul 14, 2019

5 votes

179

GATE CSE 1988 | Question: 11
A number of processes could be in a deadlock state if none of them can execute due to non-availability of sufficient resources. Let $P_i, 0 \leq i \leq 4$ represent five processes and let there be four resources types $r_j, 0 \leq j \leq 3$. Suppose the following ... Is the system currently in a safe state? If yes, explain why.

A number of processes could be in a deadlock state if none of them can execute due to non-availability of sufficient resources. Let $P_i, 0 \leq i \leq 4$ represent five...

3.1k views

answered Jul 14, 2019

13 votes

180

GATE CSE 1997 | Question: 72
Following floating point number format is given $f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (includes sign hit) in sign magnitude form and $n=(f, e) = f. 2^e$ ... addition of $A$ and $B.$ What is the percentage error (up to one position beyond decimal point) in the addition operation in (b)?

Following floating point number format is given$f$ is a fraction represented by a $6-bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4-bit$ exponent (...

3.1k views

answered Jul 13, 2019

21 votes

181

GATE CSE 2014 Set 2 | Question: 45
The value of a $\text{float}$ type variable is represented using the single-precision $\text{32-bit}$ floating point format of $\text{IEEE-754}$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ for biased exponent and ... . The representation of $X$ in hexadecimal notation is $\text{C1640000H}$ $\text{416C0000H}$ $\text{41640000H}$ $\text{C16C0000H}$

The value of a $\text{float}$ type variable is represented using the single-precision $\text{32-bit}$ floating point format of $\text{IEEE-754}$ standard that uses $1$ $\...

11.3k views

answered Jul 13, 2019

17 votes

182

GATE CSE 1988 | Question: 3a-b
The Karnaugh map of a function of $(A, B, C)$ is shown on the left hand side of the above figure. The reduced form of the same map is shown on the right hand side, in which the variable $C$ is entered in the map itself. Discuss, ... reduced map has been derived and the rules (or steps) by which the boolean function can be derived from the entries in the reduced map.

The Karnaugh map of a function of $(A, B, C)$ is shown on the left hand side of the above figure.The reduced form of the same map is shown on the right hand side, in whic...

1.8k views

answered Jul 13, 2019

68 votes

183

GATE CSE 2003 | Question: 61
In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i > a_j$. If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of $1. . . n$? $\frac{n(n-1)}{2}$ $\frac{n(n-1)}{4}$ $\frac{n(n+1)}{4}$ $2n[\log_2n]$

In a permutation $a_1 ... a_n$, of n distinct integers, an inversion is a pair $(a_i, a_j)$ such that $i < j$ and $a_i a_j$.If all permutations are equally likel...

22.1k views

answered Jul 6, 2019

9 votes

184

GATE CSE 1993 | Question: 25
A simple Pascal like language has only three statements. assignment statement e.g. x:=expression loop construct e.g. for i:=expression to expression do statement sequencing e.g. begin statement ; ; statement end Write a context-free grammar (CFG) for statements in ... CFG. Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end

A simple Pascal like language has only three statements.assignment statement e.g. x:=expressionloop construct e.g. for i:=expression to expression do statementsequencing ...

1.5k views

answered Jul 6, 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