Register
Filter

Recent activity by raahul

1 answer
3
Cfg doubt
S→ aSb/epsilon is this linear grammar? I know it's a cfg but is it linear as well?
S→ aSb/epsilonis this linear grammar? I know it's a cfg but is it linear as well?
1 answer
4
Self doubt- Min no of NOR gates
What is the minimum number of 2 input NOR gates required to realise: F(A,B,C) = (A'+B')(B'+C')(C'+A') Case 1- Compliments of A,B,C are not available Case 2- Compliments of A,B,C are available
What is the minimum number of 2 input NOR gates required to realise:F(A,B,C) = (A'+B')(B'+C')(C'+A')Case 1- Compliments of A,B,C are not availableCase 2- Compliments of A...
0 answers
5
Self doubt
Which fields of DLL, NL and TL header get changed during routing?
Which fields of DLL, NL and TL header get changed during routing?
1 answer
6
Self doubt
The major difference betwen Full binary tree, Complete binary tree, and strict binary tree
The major difference betwen Full binary tree, Complete binary tree, and strict binary tree
1 answer
11
made easy test series
Consider the state diagram shown in the figure below: The minimum number of flip-flops required to implement this state diagram is ________.
Consider the state diagram shown in the figure below: The minimum number of flip-flops required to implement this state diagram is ________.
0 answers
12
madeeasy test series
Is the solution correct?Why keys do not include attribute F ?
Is the solution correct?Why keys do not include attribute F ?
0 answers
13
made easy test
what is question asking for. Can any one explain the question bit
what is question asking for. Can any one explain the question bit
1 answer
14
Time complexity
0 answers
15
ME C programming
Let X be the number of times the comparison inside the while loop (i.e. m <= n ) is performed, when mystery(127, 255) is called. Then the value of X is, 125 65 64 66
Let X be the number of times the comparison inside the while loop (i.e. m <= n ) is performed, when mystery(127, 255) is called. Then the value of X is,125656466
0 answers
16
Self doubts
T(n)=T(√n) + n, n>2 =1 , n<= 2 Solution = ?
T(n)=T(√n) + n, n>2 =1 , n<= 2Solution = ?
1 answer
17
nptel
Q.1 In a country there are coins of denominations $2, $3, $5 and $7. How many different ways are there to pay exactly $10? approach??
Q.1 In a country there are coins of denominations $2, $3, $5 and $7. How many different ways are there to pay exactly $10?approach??
4 answers
18
No. of View equivalent schedules
how many view equivalent schedules are possible for the Sch given below:
how many view equivalent schedules are possible for the Sch given below:
1 answer
19
DS and programming
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
in a sorted array of n distinct element finding i th largest element take o(1) . true / false
0 answers
21
made east test
1 answer
24
me test
Consider the basic block given below: u=u+v v=v+w x=v-w y=v-x z=u+v The minimum number of nodes and edges present in the DAG representations of the above basic block respectively are:
Consider the basic block given below:u=u+vv=v+wx=v-wy=v-xz=u+vThe minimum number of nodes and edges present in the DAG representations of the above basic block respective...
0 answers
26
ME test series
1 answer
28
Gateforum Test Series: Operating System - Virtual Memory
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano seconds.
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano sec...
0 answers
29
ME Test
A 12 B 8 C 13 D 16
A 12B 8C 13D 16
0 answers
30
made easy
The probability of a man hitting a target in one fire is 1/4 The number of times at least he must fire at the target in order that his chance of hitting the target at least once will exceed 2/3 will be _______.
The probability of a man hitting a target in one fire is 1/4 The number of times at least he must fire at the target in order that his chance of hitting the target at l...