Recent activity by Aghori / GATE Overflow for GATE CSE

3 answers

1

Gate 2018
What is the ans of last question if no is divided then reminder is 7

What is the ans of last question if no is divided then reminder is 7

947 views

answered Feb 4, 2018

4 answers

2

Gate 2018
Number System Question...What are all the options that can't be exactly represented...Question is like b7 b6 ....

Number System Question...What are all the options that can't be exactly represented...Question is like b7 b6 ....

2.1k views

commented Feb 4, 2018

1 answer

3

What was probability question?
Attempted in last 2 mintues. got 0.28 something using Bay's theorem. What is the answer for that?

Attempted in last 2 mintues. got 0.28 something using Bay's theorem. What is the answer for that?

961 views

asked Feb 4, 2018

7 answers

4

GATE CSE 2018 | Question: 37
A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$. $T_1: a?(b \mid c)^\ast a$ $T_2: b?(a \mid c)^\ast b$ ... the string $bbaacabc$ is processed by the analyzer, which one of the following is the sequence of tokens it outputs? $T_1T_2T_3$ $T_1T_1T_3$ $T_2T_1T_3$ $T_3T_3$

A lexical analyzer uses the following patterns to recognize three tokens $T_1, T_2$, and $T_3$ over the alphabet $\{a, b, c\}$.$T_1: a?(b \mid c)^\ast a$$T_2: b?(a \mid c...

21.3k views

commented Feb 4, 2018

11 answers

5

GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$

Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$?$\frac...

22.7k views

commented Feb 4, 2018

5 answers

6

ISI2012-PCB-CS-2a
A machine $\mathcal{M}$ has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given within parentheses: $F$-stage - instruction fetch ($9$ ns), $D$-stage - instruction decode and register fetch ($3$ ns), $X$-stage ... $3$rd instruction needs a $1$ - cycle stall before the $X$-stage. Calculate the CPU time in seconds for completing $P$.

A machine $\mathcal{M}$ has the following five pipeline stages; their respective time requirements in nanoseconds (ns) are given within parentheses:$F$-stage — instruct...

2.6k views

commented Jan 31, 2018

14 answers

7

GATE CSE 2014 Set 1 | Question: 49
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. The set of all possible $1-$pennants is ${(1)}$, the set of all possible ... $(1,2)$ is not the same as the pennant $(2,1)$. The number of $10-$pennants is________

A pennant is a sequence of numbers, each number being $1$ or $2$. An $n-$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4-$pennant. ...

11.5k views

answered Jan 29, 2018

7 answers

8

GATE CSE 1999 | Question: 2.2
Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves? $1638$ $2100$ $2640$ None of the above

Two girls have picked $10$ roses, $15$ sunflowers and $15$ daffodils. What is the number of ways they can divide the flowers among themselves?$1638$$2100$$2640$None of th...

12.3k views

commented Jan 28, 2018

2 answers

9

Generalized permutation and combination
How many positive integers less than 1,000,000 have the sum of their digits equal to 19? (using generating function)

How many positive integers less than 1,000,000 have the sum of their digits equal to 19? (using generating function)

2.9k views

commented Jan 28, 2018

5 answers

10

GATE CSE 1989 | Question: 4-i
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.

How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.

7.0k views

commented Jan 28, 2018

1 answer

11

Decidability
L={R | R is a regular expression, with atleast one w belongs to L(R), i.e. 101 is substring of w} Which one true? a)L is decidable b) L is undecidable c)L is partially decidable

L={R | R is a regular expression, with atleast one w belongs to L(R), i.e. 101 is substring of w}Which one true?a)L is decidableb) L is undecidablec)L is partially decida...

414 views

commented Jan 27, 2018

6 answers

12

GATE CSE 2014 Set 2 | Question: 7
Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit binary up counter. $k$-bit binary down counter. $k$--bit ring counter. $k$-bit Johnson counter.

Let $k=2^n$. A circuit is built by giving the output of an $n$-bit binary counter as input to an $n\text{-to-}2^n$ bit decoder. This circuit is equivalent to a $k$-bit bi...

19.7k views

answered Jan 26, 2018

5 answers

13

GATE CSE 2007 | Question: 48
Which of the following is TRUE about formulae in Conjunctive Normal Form? For any formula, there is a truth assignment for which at least half the clauses evaluate to true. For any formula, there is a truth assignment for which all the clauses ... formula such that for each truth assignment, at most one-fourth of the clauses evaluate to true. None of the above.

Which of the following is TRUE about formulae in Conjunctive Normal Form?For any formula, there is a truth assignment for which at least half the clauses evaluate to true...

14.9k views

commented Jan 26, 2018

4 answers

14

GATE CSE 1999 | Question: 2.11
Which of the following is/are advantage(s) of virtual memory? Faster access to memory on an average. Processes can be given protected address spaces. Linker can assign addresses independent of where the program will be loaded in physical memory. Program larger than the physical memory size can be run.

Which of the following is/are advantage(s) of virtual memory?Faster access to memory on an average.Processes can be given protected address spaces.Linker can assign addre...

13.9k views

commented Jan 25, 2018

10 answers

15

GATE CSE 2013 | Question: 45
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$

Consider an instruction pipeline with five stages without any branch prediction:Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (...

47.9k views

commented Jan 23, 2018

4 answers

16

GATE CSE 2015 Set 2 | Question: 24
Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a program, it was observed that $80\%$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ______.

Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a pro...

13.9k views

commented Jan 22, 2018

5 answers

17

GATE CSE 2006 | Question: 74
Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but direct mapped. The size of an address is $32\; \text{bits}$ in both cases . A $2\text{-to-}1$ multiplexer has ... The value of $h_1$ is: $2.4 \text{ ns} $ $2.3 \text{ ns}$ $1.8 \text{ ns}$ $1.7 \text{ ns}$

Consider two cache organizations. First one is $32 \; \textsf{KB}\;2\text{-way}$ set associative with $32 \; \text{byte}$ block size, the second is of same size but dire...

29.0k views

commented Jan 22, 2018

8 answers

18

GATE CSE 2005 | Question: 65
Consider a three word machine instruction $\text{ADD} A[R_0], @B$ The first operand (destination) $ A[R_0] $ uses indexed addressing mode with $R_0$ as the index register. The second operand (source) $ @B $ uses indirect addressing mode. $A$ and $B$ ... (first operand). The number of memory cycles needed during the execution cycle of the instruction is: $3$ $4$ $5$ $6$

Consider a three word machine instruction$\text{ADD} A[R_0], @B$The first operand (destination) $“A[R_0]”$ uses indexed addressing mode with $R_0$ as the index regist...

34.3k views

comment edited Jan 22, 2018

2 answers

19

TIFR CSE 2012 | Part B | Question: 12
Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$? $0$ $I$ $A$ $1 + A + A^{2} + ...+ A^{k - 1}$ Inverse is not guaranteed to exist.

Let $A$ be a matrix such that $A^{k}=0$. What is the inverse of $I - A$?$0$$I$$A$$1 + A + A^{2} + ...+ A^{k - 1}$Inverse is not guaranteed to exist.

3.2k views

commented Jan 21, 2018

6 answers

20

GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$

A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...

17.7k views

commented Jan 21, 2018

4 answers

21

GATE CSE 2001 | Question: 1.24
Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra expression of constant length? List all vertices adjacent to a given ... self loops List all vertices which belong to cycles of less than three vertices List all vertices reachable from a given vertex

Suppose the adjacency relation of vertices in a graph is represented in a table Adj $(X,Y).$ Which of the following queries cannot be expressed by a relational algebra ex...

7.9k views

commented Jan 20, 2018

8 answers

22

GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$

Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$

32.9k views

commented Jan 20, 2018

5 answers

23

GATE CSE 2017 Set 1 | Question: GA-1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished

After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur.was wishingis wishingwishedhad wished

7.5k views

commented Jan 14, 2018

5 answers

24

GATE CSE 2017 Set 2 | Question: GA-10
An air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical region. Contour lines are shown at $0.05$ bar intervals in this plot. If the possibility of a ... over a region, which of the following regions is most likely to have a thunderstorm? $P$ $Q$ $R$ $S$

An air pressure contour line joins locations in a region having the same atmospheric pressure. The following is an air pressure contour plot of a geographical region. Con...

8.1k views

commented Jan 5, 2018

9 answers

25

GATE CSE 2011 | Question: 29
We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a binary search tree? $0$ $1$ $n!$ $\frac{1} {n+1} .^{2n}C_n$

We are given a set of $n$ distinct elements and an unlabeled binary tree with $n$ nodes. In how many ways can we populate the tree with the given set so that it becomes a...

31.8k views

commented Jan 1, 2018

2 answers

26

Highest normal form achieved by given $FDs$ is?
Following are the $FDs$ on $R(ABCDEF)$ - $A \rightarrow BCDEF$ $BC \rightarrow ADEF$ $B \rightarrow F$ $D \rightarrow E$ I think it is in $2NF$ because $F \ and \ E$ in the $3^{rd}$ & $4^{th}$ $FDs$ respectively are transitively dependent on $C.K - A \ or BC$ . Am I correct?

Following are the $FDs$ on $R(ABCDEF)$ -$A \rightarrow BCDEF$$BC \rightarrow ADEF$ $B \rightarrow F$$D \rightarrow E$ I think it is in $2NF$ because $F \ and \ E$ in ...

1.3k views

answer selected Dec 31, 2017

1 answer

27

Binary tree
What is maximum possible height of BFS tree,if BSF is run on complete bipartisan graph Km,n where m>=1,n>=1 and starting vertex is S

What is maximum possible height of BFS tree,if BSF is run on complete bipartisan graph Km,n where m>=1,n>=1 and starting vertex is S

646 views

commented Dec 22, 2017

3 answers

28

stack underflow
A stack of size (1 to N) and the initial position of top pointer is 0. Get (i, S) is a routine to get ith element from stack ‘S’ with respect to top. Then, what is the underflow condition on stack to perform get() operation. top – i < N top – i + 1 ≤ N top – i ≤ 0 top – i + 1 ≤ 0

A stack of size (1 to N) and the initial position of top pointer is 0.Get (i, S) is a routine to get ith element from stack ‘S’ with respect to top.Then, what is the ...

1.8k views

answered Dec 21, 2017

6 answers

29

GATE CSE 2015 Set 1 | Question: 53
Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time ... . Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.

Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume th...

26.5k views

commented Dec 13, 2017

1 answer

30

TIFR CSE 2018 | Part B | Question: 7
Consider the recursive quicksort algorithm with "random pivoting". That is, in each recursive call, a pivot is chosen uniformly at random from the sub-array being sorted.When this randomized algorithm is applied to an array of size $n$ all whose elements are distinct, ... $\Theta\left(\dfrac{1}{n \log^{2} n}\right)$

Consider the recursive quicksort algorithm with "random pivoting". That is, in each recursive call, a pivot is chosen uniformly at random from the sub-array being sorted....

8.3k views

commented Dec 11, 2017

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