Recent activity by shu / GATE Overflow for GATE CSE

2 answers

1

Arrays
How to solve this question ?

How to solve this question ?

1.5k views

asked Feb 2, 2017

1 answer

2

MadeEasy Subject Test 2019: Computer Networks - Sliding Window
How it is coming answer 8 ?

How it is coming answer 8 ?

340 views

asked Feb 2, 2017

2 answers

3

MadeEasy Subject Test: Digital Logic - Circuit Output
Some please tell how to solve this question ?

Some please tell how to solve this question ?

563 views

asked Feb 2, 2017

6 answers

4

GATE CSE 2006 | Question: 19
Let $L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$, $L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and $L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT context free? $L_1$ only $L_3$ only $L_1$ and $L_2$ $L_2$ and $L_3$

Let$L_1=\{0^{n+m}1^n0^m\mid n,m\geq 0 \}$,$L_2=\{0^{n+m}1^{n+m}0^m\mid n,m\geq 0\}$ and$L_3=\{0^{n+m}1^{n+m}0^{n+m}\mid n,m\geq 0\} $. Which of these languages are NOT c...

15.3k views

commented Jan 23, 2017

5 answers

5

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 Jan 20, 2017

4 answers

6

GATE CSE 2012 | Question: 9
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are One, at $\dfrac{\pi}{2}$ One, at $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{2}$ and $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{4}$ and $\dfrac{3\pi}{2}$

Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are...

14.0k views

commented Jan 18, 2017

7 answers

7

GATE IT 2007 | Question: 23
A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division. $(0, 0) \in P.$ $(a, b) \in P$ if and only if $(a \% 10) \leq (b \% 10$) and $(\frac{a}{10},\frac{b}{10})\in P.$ ... $P$? (i) and (iii) (ii) and (iv) (i) and (iv) (iii) and (iv)

A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division.$(0, 0) \in P.$$(a, b) \in P$ if and only if $(a \% 1...

11.4k views

commented Jan 8, 2017

8 answers

8

GATE CSE 2013 | Question: 26
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if ... planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only

The line graph $L(G)$ of a simple graph $G$ is defined as follows:There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$.For any two edges $e$ and $e'$ in ...

19.0k views

commented Jan 5, 2017

3 answers

9

GATE CSE 1999 | Question: 1.21
The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is $O(n^2)$ $O(n)$ $O(\log n)$ $O(1)$

The maximum gate delay for any output to appear in an array multiplier for multiplying two $n$ bit numbers is$O(n^2)$$O(n)$$O(\log n)$$O(1)$

11.5k views

commented Jan 1, 2017

9 answers

10

GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...

Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...

14.8k views

commented Dec 31, 2016

5 answers

11

GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$

A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...

13.8k views

commented Dec 30, 2016

1 answer

12

GATE IT 2004 | Question: 38
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula? 8 8(1/3) 8(2/3) 9

If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula?88(1/3)8(2/3)9

3.7k views

commented Dec 30, 2016

4 answers

13

GATE CSE 2000 | Question: 2.14
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + B executed on a computer where floating point numbers are represented with $32$ bits. The values for $X$ and $Y$ will be $X = 1.0, Y = 1.0$ $X = 1.0, Y = 0.0$ $X = 0.0, Y = 1.0$ $X = 0.0, Y = 0.0$

Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + Bexecuted on a computer where fl...

12.0k views

commented Dec 30, 2016

5 answers

14

GATE CSE 2004 | Question: 58
A circuit outputs a digit in the form of $4$ bits. $0$ is represented by $0000, 1$ by $0001, \ldots, 9$ by $1001$. A combinational circuit is to be designed which takes these $4$ bits as input and outputs $1$ if the digit $\geq$ $5$, and $0$ otherwise ... $\textsf{NOT}$ gates may be used, what is the minimum number of gates required? $2$ $3$ $4$ $5$

A circuit outputs a digit in the form of $4$ bits. $0$ is represented by $0000, 1$ by $0001, \ldots, 9$ by $1001$. A combinational circuit is to be designed which takes t...

11.9k views

commented Dec 29, 2016

1 answer

15

made easy test series
Q. The minimal function that can detect a 'divisible by 3' 8421 BCD code digit(representation is D8 D4 D2 D1 ) is given by

Q. The minimal function that can detect a 'divisible by 3' 8421 BCD code digit(representation is D8 D4 D2 D1 ) is given by

2.0k views

commented Dec 27, 2016

0 answers

16

made easy test series
The digital circuit acts as - a. 9's complement circuit b. 0's complement circuit c. 5's complement circuit d.9's complement circuit if C3=0 and 10's complement if C3=1

The digital circuit acts as - a. 9's complement circuitb. 0's complement circuitc. 5's complement circuitd.9's complement circuit if C3=0 and 10's complement if C3=1

634 views

asked Dec 24, 2016

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