search
Log In

Recent activity by Vineeta Garg

1 answer
1
commented Feb 10, 2017 in Databases 105 views
2 answers
2
asked Feb 5, 2017 in Compiler Design 113 views
0 answers
3
here nothing is given whether language is decidable or not.so how to solve it
asked Dec 27, 2016 in Theory of Computation 91 views
0 answers
4
asked Dec 27, 2016 in Theory of Computation 36 views
2 answers
8
Consider the following CFG. S $\rightarrow$aAb|aBc|bAd|bBe A$\rightarrow$g B$\rightarrow$g The number of states exist in DFA using LALR (1) construction for the above grammar ____________?? (Doubt): In CLR(1) it takes 14 states and clubbing two states into one state will take 13 states in ... DFA....!!! So 14 is the answer, I think.. But answer in Made Easy given as 13 Only.. Explain....???!!!
commented Dec 10, 2016 in Compiler Design 457 views
3 answers
9
Station X needs to send a message consisting of 12 packets to station Y using a sliding window protocol (Window Size 4) and Go back n error control strategy. All packets are ready and immediately available for transmission. If every 7th packet that X transmits gets lost (but no acks from Y ever gets lost), then the number of packets that X will transmit for sending the message to Y are _____.
commented Nov 24, 2016 in Computer Networks 482 views
1 answer
10
Here ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for expression 3 ∗ 4 __________.
answered Oct 6, 2016 in Compiler Design 136 views
...