If 4 bits are used to represent sequence numbers for flow control, what are sender and receiver window sizes in Go-Back-N?
Asked in Meghalaya PSC QUESTION BOOKLET: SERIES I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- Which of the following represents the polynomial x^5 + x^4 + x^0 using the CRC?
- Consider the regular expression R = 10 + (0 + 11)0* 1. The minimum number of states in any DFA accepting this regular expression is
- The language L that is generated over Σ = {0, 1} for regular expression L(r) = (0 + 10)* 1(1 + 10)* represents
- The grammar G1 is defined with productions S → 0A|1B, A → 0AA|1S|1, B → 1BB|0S|0. The grammar G2 is defined with productions S → AB|aaB, A → A|Aa, B → b. Which grammar is/are ambiguous?
- The language accepted by a pushdown automata is
- A context-free grammar is recognized by
- The pumping lemma is used to prove that
- Consider the grammar : S → a S → ab The given grammar is (A) LR(1) only (B) LL(1) only (C) Both LR(1) and LL(1) (D) LR(1) but not LL(1)