Recent activity by joshi_nitish

1 answer
1
0 answers
2
How is g(x) is many one ?
0 answers
3
Consider an array A[100] and each element occupies 4 word a 32-word cache is used and divided into an 8-word blockWhat is the hit ratio for for(i=0;i<100;i++...
0 answers
5
Are there resources for formulae of each subject of gate CSE?
0 answers
6
$f\left ( x \right )=$$\int_{-2}^{2}x^{-\frac{2}{7}}dx$Is this function f(x) is continuous, bounded and differentiable?(In exam hall is it possible to draw the graph for ...
0 answers
7
In this question the length of a given string is given as 12 in the solution but it should be 11 as strlen function exclude null value and give the length.Please give the...
0 answers
9
What is the output.My doubt is : What is meant by call by copy restore ? is it same as call by reference or there is some difference ?
1 answer
10
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?
2 answers
11
1 answer
12
1 answer
15
Please write grammar for it and explain with example.$L=\{w \: : n_a(w) n_b(w) \}$
1 answer
16
In the following figure, side QS is congruent to side SP, RPQ=50o and PSR=600Then among P,Q,R,S , which two angles are equal?
0 answers
17
$\sum = \left \{ a,b \right \}$Is it possible to create DFA for given language with less than 10 states?L = $\left \{ w: \left | w \right | mod 3 = 0, \left |w \right | \...
1 answer
18
The eigen value of the following matrix is $\begin{bmatrix}1&1&1\\1&1&1\\1&1&1\end{bmatrix}$ $1, 1, 1$$1, 0, 0$$3, 0, 0$$0, 0, 0$
1 answer
20
#include<stdio.h int main() { printf("%d\n",1==5==5); printf("%d\n",1==5!=5); printf("%d\n",1!=5!=5); printf("%d\n",1!=5==5); return 0; }What is the output?
0 answers
22
1. $L' = \sum^*−L$ for any language $L$2. $L=\{a^ma^nb^n\mid m>0 , n>0 \}$ is DCFL3. If a language is closed under complement,difference then it is closed under inters...
4 answers
23
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
2 answers
26
0 answers
30
Determine the number of vectors $\{x_{1}...x_{n}\}$, such that each $x_{i}$ is either $0$ or $1$ and$\displaystyle{\sum_{i=1}^{n}x_{i}\geq k}$