Answers by lambda / GATE Overflow for GATE CSE

9 votes

1

GATE CSE 1987 | Question: 2c
State whether the following statements are TRUE or FALSE: It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?

State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?

6.5k views

answered Apr 17, 2018

2 votes

2

GATE CSE 1987 | Question: 6a
A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements and $[]$ is a nil list. Five functions are defined below: $car (l)$ returns the first element of its argument ... $f ([32, 16, 8], [9, 11, 12])$ $g ([5, 1, 8, 9])$

A list of $n$ elements is commonly written as a sequence of $n$ elements enclosed in a pair of square brackets. For example. $[10, 20, 30]$ is a list of three elements an...

2.9k views

answered Apr 14, 2018

–1 votes

3

GATE CSE 1987 | Question: 16-a
A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below: The realization is

A Boolean function $f$ is to be realized only by $\text{NOR}$ gates. Its $K$-map is given below:The realization is

4.2k views

answered Mar 28, 2018

58 votes

4

GATE CSE 2006 | Question: 25
Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is the number of sets $X_j$ that contain the element $i.$ That is $f(i)=\left | \left\{j \mid i\in X_j \right\} \right|$ then $ \sum_{i=1}^{m} f(i)$ is: $3m$ $3n$ $2m+1$ $2n+1$

Let $S = \{1, 2, 3,\ldots, m\}, m >3.$ Let $X_1,\ldots,X_n$ be subsets of $S$ each of size $3.$ Define a function $f$ from $S$ to the set of natural numbers as, $f(i)$ is...

11.1k views

answered Jan 9, 2018

46 votes

5

GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$

Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume th...

31.1k views

answered Dec 27, 2017

21 votes

6

GATE IT 2004 | Question: 35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$

In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $...

11.5k views

answered Dec 22, 2017

27 votes

7

GATE IT 2004 | Question: 32
Let $A$ be an $n \times n$ ...

Let $A$ be an $n \times n$ matrix of the following form.$$A = \begin{bmatrix}3&1&0&0&0&\ldots&0&0&0\\1&3&1&0&0&\ldots&0&0&0\\0&1&3&1&0&\ldots&0&0&0\\0&0&1&3&1&\ldots&0&0&...

8.0k views

answered Dec 22, 2017

35 votes

8

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

answered Dec 19, 2017

3 votes

9

GATE IT 2007 | Question: 43
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected? $0$ $1$ $2$ $3$

An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected?...

25.7k views

answered Dec 8, 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