Register
Filter

Recent activity by richa116

0 answers
1
MAde easy
0 answers
2
Made easy
2 answers
3
Labeled binary tree
Number of labeled binary trees are there on vertices {1,2,3,4} that have only vertex 1 as leaf and every binary trees has 4 nodes are _______.
Number of labeled binary trees are there on vertices {1,2,3,4} that have only vertex 1 as leaf and every binary trees has 4 nodes are _______.
1 answer
5
Integration
3 answers
6
GATE CSE 2003 | Question: 57
Consider the grammar shown below. $S \rightarrow C \ C$ $C \rightarrow c \ C \mid d$ This grammar is LL(1) SLR(1) but not LL(1) LALR(1) but not SLR(1) LR(I) but not LALR(1)
Consider the grammar shown below. $S \rightarrow C \ C$$C \rightarrow c \ C \mid d$This grammar isLL(1)SLR(1) but not LL(1)LALR(1) but not SLR(1)LR(I) but not LALR(1)
3 answers
7
Finding maximum size of file
Given answer: 128 Please explain how to solve this problem
Given answer: 128Please explain how to solve this problem
5 answers
10
GATE IT 2004 | Question: 7
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$? $(a^* + b^* + c^*)^*$ $(a^*b^*c^*)^*$ $((ab)^* + c^*)^*$ $(a^*b^* + c^*)^*$
Which one of the following regular expressions is NOT equivalent to the regular expression $(a + b + c)^*$?$(a^* + b^* + c^*)^*$$(a^*b^*c^*)^*$$((ab)^* + c^*)^*$$(a^*b^* ...
7 answers
16
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?...
5 answers
17
GATE IT 2005 | Question: 51
Let $T(n)$ be a function defined by the recurrence $T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and $T(1) = 1$ Which of the following statements is TRUE? $T(n) = \Theta(\log n)$ $T(n) = \Theta(\sqrt n)$ $T(n) = \Theta(n)$ $T(n) = \Theta(n \log n)$
Let $T(n)$ be a function defined by the recurrence$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and$T(1) = 1$Which of the following statements is TRUE?$T(n) = \Theta(\log n)$...
2 answers
19
Integration in Sinx and Cosx
My answer is coming 0. Please explain.
My answer is coming 0. Please explain.
4 answers
23
Lattice
0 answers
24
Statistics
2 answers
25
Complexity
1 answer
26
Are differential equations and laplace transform in the gate syllabus!!!
Are differential equations and laplace transform in the gate syllabus!!!
Are differential equations and laplace transform in the gate syllabus!!!
2 answers
30
DataStructure
Which of the following data structures would programmer be least likely to use to implement an abstract data type that must include an efficient implementation of the operation " find the maximum"? Ordered array. Binary search. Heap. Ordered linked list.
Which of the following data structures would programmer be least likely to use to implement an abstract data type that must include an efficient implementation of the ope...