Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by lambda
5
answers
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
DS
gate1987
binary-tree
data-structures
normal
true-false
+
–
3
answers
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
DS
gate1987
data-structures
linked-list
descriptive
+
–
3
answers
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
Digital Logic
gate1987
digital-logic
k-map
+
–
11
answers
4
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
comment edited
Jan 30, 2018
Combinatory
gateit-2004
combinatory
normal
balls-in-bins
+
–
6
answers
5
GATE CSE 2007 | Question: 32
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$? P: $x'y'z' + w'xy' + wy'z + xz$ Q: $w'y'z' + wx'y' + xz$ ... $x'y'z' + wx'y'+ w'y$ P only Q and S R and S S only
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$?P: $x'y'z' + w'xy' + wy'z + xz$Q: $w'y'z' + wx'y...
10.4k
views
commented
Jan 27, 2018
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
5
answers
6
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$$8$$9$$10$
21.3k
views
commented
Jan 26, 2018
Digital Logic
gatecse-2007
digital-logic
normal
isro2011
decoder
+
–
4
answers
7
GATE CSE 2006 | Question: 57
Consider this C code to swap two integers and these five statements: the code void swap (int *px, int *py) { *px = *px - *py; *py = *px + *py; *px = *py - *px; } S1: will generate a compilation error S2: may generate a ... procedure correctly for some but not all valid input pointers S5: may add or subtract integers and pointers S1 S2 and S3 S2 and S4 S2 and S5
Consider this C code to swap two integers and these five statements: the codevoid swap (int *px, int *py) { *px = *px - *py; *py = *px + *py; *px = *py - *px; }S1...
21.0k
views
commented
Jan 10, 2018
Programming in C
gatecse-2006
programming
programming-in-c
normal
pointers
+
–
9
answers
8
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
comment edited
Jan 10, 2018
Set Theory & Algebra
gatecse-2006
set-theory&algebra
normal
functions
+
–
4
answers
9
GATE CSE 2005 | Question: 46
Consider the set $H$ of all $3 * 3$ matrices of the type $\left( \begin{array}{ccc} a & f & e \\ 0 & b & d \\ 0 & 0 & c \end{array} \right)$ where $a,b,c,d,e$ and $f$ ... the matrix multiplication operation, the set $H$ is: a group a monoid but not a group a semi group but not a monoid neither a group nor a semi group
Consider the set $H$ of all $3 * 3$ matrices of the type $$\left( \begin{array}{ccc} a & f & e \\ 0 & b & d \\ 0 & 0 & c \end{array} \right)$$ where $a,b,c,d,e$ and $f$ a...
7.6k
views
commented
Jan 7, 2018
Set Theory & Algebra
gatecse-2005
set-theory&algebra
group-theory
normal
+
–
12
answers
10
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
commented
Jan 3, 2018
DS
gatecse-2003
data-structures
stack
normal
+
–
7
answers
11
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
answer edited
Dec 23, 2017
Computer Networks
gateit-2007
computer-networks
error-detection
normal
+
–
3
answers
12
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
Linear Algebra
gateit-2004
linear-algebra
matrix
normal
+
–
4
answers
13
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
Compiler Design
gateit-2005
compiler-design
parsing
normal
+
–
2
answers
14
GATE IT 2008 | Question: 8
Consider the following Boolean function of four variables $f(A, B, C, D) = Σ(2, 3, 6, 7, 8, 9, 10, 11, 12, 13)$ The function is independent of one variable independent of two variables independent of three variable dependent on all the variables
Consider the following Boolean function of four variables$f(A, B, C, D) = Σ(2, 3, 6, 7, 8, 9, 10, 11, 12, 13)$The function isindependent of one variableindependent of tw...
6.4k
views
commented
Dec 6, 2017
Digital Logic
gateit-2008
digital-logic
normal
min-sum-of-products-form
+
–
5
answers
15
GATE CSE 2016 Set 2 | Question: 02
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
10.5k
views
comment edited
Dec 4, 2017
Calculus
gatecse-2016-set2
calculus
normal
numerical-answers
differentiation
+
–
7
answers
16
GATE CSE 2004 | Question: 51
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: $\rho$ ... of girl students with marks not less than some boy student names of girl students with more marks than all the boy students
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. Wha...
17.9k
views
commented
Nov 21, 2017
Databases
gatecse-2004
databases
relational-algebra
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register