Recent activity by swami_9 / GATE Overflow for GATE CSE

0 answers

1

coap 2023
I got IIT Gandhinagar in round 4 now I have to accept it or reject. should I reject it and go for top nit’s (my gate score is 709 cse 2023 gen) or If i accept then i will not get any other iit’s. please help

I got IIT Gandhinagar in round 4 now I have to accept it or reject. should I reject it and go for top nit’s (my gate score is 709 cse 2023 gen) or If i accept then i wi...

441 views

asked Jun 10, 2023

0 answers

2

Coap admissions 2023 counselling
Did IIT Jodhpur and Hyderabad take interviews this year for mtech and in their website nothing is mentioned, my gate score is 709 in round 2&3 I retained IIT Gandhinagar, in round 4 also I Got IIT Gandhinagar, I am confused about accepting or rejecting. anyone who has any idea please help.

Did IIT Jodhpur and Hyderabad take interviews this year for mtech and in their website nothing is mentioned, my gate score is 709 in round 2&3 I retained IIT Gandhinagar,...

252 views

asked Jun 10, 2023

1 answer

3

Counselling
which is better iIt Gandhinagar cse or iIt Ropar AI

which is better iIt Gandhinagar cse or iIt Ropar AI

397 views

asked May 28, 2023

2 answers

4

GO Classes Test Series 2023 | Operating Systems | Test 4 | Question: 8
Given the following piece of code main(int argc, char ** argv) { forkthem(5) } void forkthem(int n) { if(n > 0) { fork(); forkthem(n-1); } } How many processes are created if the above piece of code is run? (Hint: It may be easier to solve this problem by induction/recursion.)

Given the following piece of codemain(int argc, char argv) { forkthem(5) } void forkthem(int n) { if(n 0) { fork(); forkthem(n-1); } }How many processes are created if...

413 views

commented Jan 2, 2023

5 answers

5

GATE CSE 2009 | Question: 51
A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s \rangle$, where $c$ is the cylinder number, $h$ is the surface number ... $\langle 400, 16, 29 \rangle$ corresponds to sector number: $505035$ $505036$ $505037$ $505038$

A hard disk has $63$ sectors per track, $10$ platters each with $2$ recording surfaces and $1000$ cylinders. The address of a sector is given as a triple $\langle c, h, s...

19.8k views

commented Oct 8, 2022

4 answers

6

GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.

Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...

17.6k views

commented Oct 5, 2022

16 answers

7

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

54.1k views

answered Oct 1, 2022

3 answers

8

Throughput of the Pipeline
Consider a machine with 10 ns clock and it takes 4 clock cycle per ALU instruction, 5 clock cycle per branch instruction, 6 clock cycle memory instruction. There exists 40% ALU instruction, 20% branch instruction, and 40% memory instruction. What is throughput of pipeline system if overhead is 2 ns? ______________ MIPS (integer value only).

Consider a machine with 10 ns clock and it takes 4 clock cycle per ALU instruction, 5 clock cycle per branch instruction, 6 clock cycle memory instruction. There exists 4...

10.8k views

commented Sep 28, 2022

1 answer

9

#General #Compilers
If we have more than 1 parse tree,but one is LMD and other is RMD , Is Grammar Ambiguous? There are no other parse tree other than these two.

If we have more than 1 parse tree,but one is LMD and other is RMD , Is Grammar Ambiguous?There are no other parse tree other than these two.

819 views

commented Sep 27, 2022

5 answers

10

GATE CSE 2003 | Question: 74
The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions. global int i=100, j=5; void P(x) { int i=10; print(x+10); i=200; j=20; print (x); } main() {P(i ... by name parameter passing mechanism, the values printed by the above program are $115, 220$ $25, 220$ $25, 15$ $115, 105$

The following program fragment is written in a programming language that allows global variables and does not allow nested declarations of functions.global int i=100, j=5...

12.9k views

commented Sep 8, 2022

2 answers

11

GATE CSE 2006 | Question: 60
Consider the following C code segment. for (i = 0, i < n; i++) { for (j = 0; j < n; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } } } Which one of the following is false? ... computation There is scope of common sub-expression elimination in this code There is scope of strength reduction in this code There is scope of dead code elimination in this code

Consider the following C code segment. for (i = 0, i < n; i++) { for (j = 0; j < n; j++) { if (i%2) { x += (4*j + 5*i); y += (7 + 4*j); } } }Which one of the following is...

10.1k views

commented Sep 8, 2022

4 answers

12

GATE CSE 2016 Set 1 | Question: 29
Consider the following experiment. Step 1. Flip a fair coin twice. Step 2. If the outcomes are (TAILS, HEADS) then output $Y$ and stop. Step 3. If the outcomes are either (HEADS, HEADS) or (HEADS, TAILS), then output $N$ and stop. Step 4. If ... , TAILS), then go to Step $1.$ The probability that the output of the experiment is $Y$ is (up to two decimal places)

Consider the following experiment.Step 1. Flip a fair coin twice.Step 2. If the outcomes are (TAILS, HEADS) then output $Y$ and stop.Step 3. If the outcomes are either (H...

11.8k views

commented Aug 29, 2022

5 answers

13

GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .

Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...

20.6k views

commented Aug 29, 2022

3 answers

14

GATE IT 2005 | Question: 1
A bag contains $10$ blue marbles, $20$ green marbles and $30$ red marbles. A marble is drawn from the bag, its colour recorded and it is put back in the bag. This process is repeated $3$ ... $\left(\dfrac{1}{6}\right)$ $\left(\dfrac{1}{4}\right)$ $\left(\dfrac{1}{3}\right)$

A bag contains $10$ blue marbles, $20$ green marbles and $30$ red marbles. A marble is drawn from the bag, its colour recorded and it is put back in the bag. This process...

8.3k views

commented Aug 29, 2022

6 answers

15

GATE2014 EC-1: GA-4
The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four? ... $K$ $L$ $M$ $N$

The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four?$$\begin{array}{|c|c|c|} \...

5.5k views

answered Aug 18, 2022

2 answers

16

GATE Mechanical 2020 Set 2 | GA Question: 5
There are five levels $\{P, Q, R, S, T\}$ in a linear supply chain before a product reaches customers, as shown in the figure. At each of the five levels, the price of the product is increased by $25 \%$. If the product is produced at level $P$ ... . $120$ per unit, what is the price paid (in rupees) by the customers? $187.50$ $234.38$ $292.96$ $366.21$

There are five levels $\{P, Q, R, S, T\}$ in a linear supply chain before a product reaches customers, as shown in the figure.At each of the five levels, the price of the...

975 views

commented Aug 18, 2022

1 answer

17

GATE CSE 2021 Set 1 | GA Question: 8
There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag. The probability that at least two chocolates are identical is __________ $0.3024$ $0.4235$ $0.6976$ $0.8125$

There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag.The probability that at least two chocolates are iden...

10.8k views

commented Aug 17, 2022

12 answers

18

GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.

A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...

62.1k views

commented Aug 16, 2022

10 answers

19

GATE CSE 2010 | Question: 32
In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$ $10$, $11$, $01$, $00$ $10$, $00$, $01$, $11$ $11$, $10$, $00$, $01$

In the sequential circuit shown below, if the initial value of the output $Q_1Q_0$ is $00$. What are the next four values of $Q_1Q_0$? $11$, $10$, $01$, $00$$10$, $11$, $...

30.7k views

commented Aug 16, 2022

5 answers

20

GATE CSE 2001 | Question: 2.8
Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$ Consider the following timing diagrams of X and C. The clock period of $C \geq 40$ nanosecond. Which one is the correct plot of Y?

Consider the following circuit with initial state $Q_0 = Q_1 = 0$. The D Flip-flops are positive edged triggered and have set up times 20 nanosecond and hold times $0.$Co...

21.4k views

commented Aug 15, 2022

2 answers

21

GATE CSE 2001 | Question: 11
A sequential circuit takes an input stream of $0's$ and $1's$ and produces an output stream of $0's$ and $1's.$ Initially it replicates the input on its output until two consecutive $0's$ are encountered on the input. From then ... Give the minimized sum-of-product expression for $\text{J}$ and $\text{K}$ inputs of one of its state flip-flops

A sequential circuit takes an input stream of $0's$ and $1's$ and produces an output stream of $0's$ and $1's.$ Initially it replicates the input on its output until two ...

5.3k views

commented Aug 15, 2022

3 answers

22

GATE CSE 2012 | Question: 19
The amount of ROM needed to implement a $4\text{-bit}$ multiplier is $64$ bits $128$ bits $1$ Kbits $2$ Kbits

The amount of ROM needed to implement a $4\text{-bit}$ multiplier is$64$ bits$128$ bits$1$ Kbits$2$ Kbits

16.1k views

commented Aug 13, 2022

5 answers

23

GATE CSE 2001 | Question: 2.25
Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$. create table geq ( ib integer not null, ub integer not null, primary key ib, foreign key (ub) references geq on delete cascade ); Which ... (z,w) with z > x is deleted A tuple (z,w) with w < x is deleted The deletion of (x,y) is prohibited

Consider a relation geq which represents "greater than or equal to", that is, $(x,y) \in $ geq only if $y \geq x$.create table geq ( ib integer not null, ub integer not n...

10.7k views

commented Aug 7, 2022

4 answers

24

L(M) is infinite
$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$ $L$ is RE but $L'$ is not RE Both $L$ and $L'$ are RE $L$ is not RE but $L'$ is RE Both $L$ and $L'$ are not RE

$L= \{\langle M\rangle \mid L(M)\text{ is infinite}\}$$L$ is RE but $L'$ is not REBoth $L$ and $L'$ are RE$L$ is not RE but $L'$ is REBoth $L$ and $L'$ are not RE

5.8k views

commented Jul 27, 2022

4 answers

25

GATE CSE 2003 | Question: 15
If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? $L$ is necessarily finite $L$ is regular but not necessarily finite $L$ is context free but not necessarily regular $L$ is recursive but not necessarily context-free

If the strings of a language $L$ can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true?$L$ is necessarily fin...

15.6k views

commented Jul 26, 2022

5 answers

26

OS Memory Management
Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes. a - 4 b- 5 c -6 d -7 Internal fragmentation is always half the page size I guess So the answer should be 4 KB but it is 6 KB How????

Consider a paging system with page size of 8 KB. If a process of size 34 KB is in logical address space, find the internal fragmentation in Kbytes.a - 4b- 5c -6d -7 Inter...

7.5k views

commented Jul 17, 2022

1 answer

27

Context free language
Why the complement of a CFL is CSL?

Why the complement of a CFL is CSL?

551 views

asked Jul 16, 2022

2 answers

28

GATE CSE 2014 Set 3 | Question: 5
If $V_1$ and $V_2$ are $4$-dimensional subspaces of a $6$-dimensional vector space $V$, then the smallest possible dimension of $V_1 \cap V_2$ is _____.

If $V_1$ and $V_2$ are $4$-dimensional subspaces of a $6$-dimensional vector space $V$, then the smallest possible dimension of $V_1 \cap V_2$ is _____.

10.8k views

commented Aug 13, 2021

2 answers

29

GATE CSE 2021 Set 1 | Question: 51
In a pushdown automaton $P=(Q, \Sigma, \Gamma, \delta, q_0, F)$, a transition of the form, where $p,q \in Q$, $a \in \Sigma \cup \{ \epsilon \}$, and $X,Y \in \Gamma \cup \{ \epsilon \}$ ... $\Gamma = \{ \#, A\}$. The number of strings of length $100$ accepted by the above pushdown automaton is ___________

In a pushdown automaton $P=(Q, \Sigma, \Gamma, \delta, q_0, F)$, a transition of the form,where $p,q \in Q$, $a \in \Sigma \cup \{ \epsilon \}$, and $X,Y \in \Gamma \cup...

10.6k views

commented Aug 2, 2021

2 answers

30

GATE CSE 2013 | Question: 32
Consider the following languages. $L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$ $L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$ Which one of the following statements is FALSE? $L_2$ is context-free. $L_1\cap L_2$ is context-free. Complement of $L_2$ is recursive. Complement of $L_1$ is context-free but not regular.

Consider the following languages.$L_1 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0 \right \}$$L_2 = \left \{ 0^p1^q0^r \mid p,q,r \geq 0, p\neq r \right \}$Which one of the fol...

15.6k views

commented Aug 2, 2021

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