Register
Filter

Answers by $ruthi

0 votes
1
Finding Handles in a grammer
Total number of Handles for $(w=aa)$ in the following grammar ? $S\rightarrow DT$ $D\rightarrow aa$ $T\rightarrow \epsilon$
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
1 votes
3
Gate 2018
One query is superset of another 3 queries
One query is superset of another 3 queries
2 votes
4
Gate 2018
NFA to DFA..no of states answer
NFA to DFA..no of states answer
2 votes
5
Gate 2018
Any one solve the safe stat question , Max need given and available resources are giveen and they ask about the question where state safe or not
Any one solve the safe stat question ,Max need given and available resources are giveen and they ask about the question where state safe or not
0 votes
6
ace test toc
Can anyone please explain method to solve such example which contains equivalence classes.
Can anyone please explain method to solve such example which contains equivalence classes.
1 votes
7
Cascadeless/ Recoverable
The given schedule: R1 (A) R2 (B) W2 (B) W1(A) W2 (A) Commit2 R1 (C) is revoreable, cascadeless or strict?
The given schedule:R1 (A) R2 (B) W2 (B) W1(A) W2 (A) Commit2 R1 (C)is revoreable, cascadeless or strict?
1 votes
11
Made Easy Test Series
b = b + c d = b + d b = b – d e = d + b The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ? 4 and 5 5 and 4 6 and 6 6 and 7
b = b + cd = b + db = b – de = d + bThe minimum number of nodes and edges present in the DAG representation of above basic block respectively are ?4 and 55 and 46 and 6...
2 votes
12
GENRAL
0 votes
13
TEST SERIES
0 votes
14
GATE CSE Digital Logic
The function f(A,B,C,D) = Σm(0,1,4,6,7,8,10,14,15). The number of prime implicants and essential prime implicants are a). 6,1 b). 6,2 c). 7,1 d). 7,2
The function f(A,B,C,D) = Σm(0,1,4,6,7,8,10,14,15). The number of prime implicants and essential prime implicants area). 6,1b). 6,2c). 7,1d). 7,2
0 votes
15
Gate model paper
Here 1LR + 1RL Rotation Then how many total rotation in avl tree ? LR/RL rotation count as 2or1 rotation? Please provide detailed answer.
Here 1LR + 1RL Rotation Then how many total rotation in avl tree ?LR/RL rotation count as 2or1 rotation?Please provide detailed answer.
0 votes
16
Time complexity
Worst case time complexity of following code? Please explain in detail. void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } }
Worst case time complexity of following code? Please explain in detail.void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i ==...
0 votes
18
doubt algo 2
0 votes
22
Time complexity
Consider the following statements The best case complexity of insertion sort is $\Omega \left ( n^{2} \right )$ The best case complexity of insertion sort is $O\left ( n \right )$ Which one true?
Consider the following statements The best case complexity of insertion sort is $\Omega \left ( n^{2} \right )$The best case complexity of insertion sort is $O\left ( n \...
2 votes
23
Follow
Please give detailed explanation.
Please give detailed explanation.
0 votes
25
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
To avoid left recursion can we do like this. I think this is incorrect way to do
0 votes
27
Number system
A 17 bit binary number has an accuracy equivalent to the decimal fraction... .. Please explain...
A 17 bit binary number has an accuracy equivalent to the decimal fraction... ..Please explain...
0 votes
28
Digital logic design
Please explain distributive property on nand nor gates??
Please explain distributive property on nand nor gates??
0 votes
29
Digital logic
Minimum number of half adders and OR gates required to build a n-bit binary adder is? (Give circuit diagram)
Minimum number of half adders and OR gates required to build a n-bit binary adder is?(Give circuit diagram)