Register
Filter

Questions by shivanisrivarshini

1 votes
1 answer
2
Permutations
0 votes
0 answers
3
How to solve
1 votes
0 answers
4
ISI sample paper
0 votes
1 answer
5
ISI CSB 2017
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes: $\text{D K E F B G L M H I J C A.}$ For each node of $T$ ... $T$.
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:$$\text{D K E F B G L M H I J C A.}$$For each node of $T$, the deg...
0 votes
0 answers
7
ISI CSB 2017
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit. $\text{Determine the number of input combinations for which the output function F realised by }$ $\text{ the circuit becomes true (logic 1)}$ I'm getting $940$ Input combinations
Consider the Boolean function $F(x_1,x_2,......,x_{10})$ realised by the following combinational circuit.$\text{Determine the number of input combinations for which the o...
0 votes
1 answer
9
self doubt
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
Can we have a grammar $G$ which is $LL(1)$ but not $SLR(1)$ ,If so given example grammar
1 votes
1 answer
10
test_series
Consider the DFA M : Number of distinct strings of length $3$ such that $\delta(q_{0},w) = q_{0}$ $10$ $14$ $18$ $20$
Consider the DFA M :Number of distinct strings of length $3$ such that $\delta(q_{0},w) = q_{0}$$10$$14$$18$$20$
2 votes
2 answers
12
test_series
0 votes
1 answer
13
Test_series
4 votes
1 answer
14
Fragmentation
A router with MTU of $1024\text{ bytes}$ has received an IP packet of size $4240 \text{ bytes}$ with an IP header of $20\text{ bytes}$. The value of MF and offset of the $3^{rd}$ fragment is $MF =0$ $OFFSET =125$ $MF =1$ $OFFSET =125$ $MF =1$ $OFFSET =250$ $MF =1$ $OFFSET =375$
A router with MTU of $1024\text{ bytes}$ has received an IP packet of size $4240 \text{ bytes}$ with an IP header of $20\text{ bytes}$. The value of MF and offset of the...
0 votes
0 answers
15
which of the following are true
1. $L' = \sum^*−L$ for any language $L$ 2. $L=\{a^ma^nb^n\mid m>0 , n>0 \}$ is DCFL 3. If a language is closed under complement,difference then it is closed under intersection since $L1 - L2' = L1 \cap L2$
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...
0 votes
0 answers
17
Cache Miss
Can anyone Explain why Cache misses are reduced when Associativity is high
Can anyone Explain why Cache misses are reduced when Associativity is high
2 votes
1 answer
18
Structural Hazard
0 votes
1 answer
19
Asymtotic
If f(n)=O(g(n)) for f,g are non decreasing functions ,then f(n)*log2(f(n)c) =O(g(n) * log2g(n)) , c is power of f(n) is a)Always true b) Never c) Sometimes true , sometimes not depending on f,g d) Sometimes true, sometimes false depending on c
If f(n)=O(g(n)) for f,g are non decreasing functions ,thenf(n)*log2(f(n)c) =O(g(n) * log2g(n)) , c is power of f(n) isa)Always trueb) Neverc) Sometimes true , sometimes ...
Page: