Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE?

1.Cannot be merged since look aheads are different.

2.Can be merged but will result in S-R conflict.

3.Can be merged but will result in R-R conflict.

4.Cannot be merged since goto on c will lead to two different sets.

Which of the following grammar rules violate the requirements of an operator grammar ? P, Q, R are nonterminals, and r, s, t are terminals.

1.P Q R

2.P Q s R

3.P

4.P Q t R r

The grammar A AA | (A) | is not suitable for predictive-parsing because the grammar is

(A) ambiguous

(B) left-recursive

(C) right-recursive

(D) an operator-grammar

Given the following expression g...

[8:01 AM, 5/11/2021] Amani: Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of n nodes? Consider the languages L1 =and L2 = {a}. Which one of the following represents L1 L2* U L1* What is the complement of the language accepted by the NFA shown below? Assume = {a} and is the empty string The lexical analysis for a modern language such as Java needs the power of which one of the following machine models in a necessary and sufficient sense?

Let P be a regular language and Q be context-free language such that Q P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn|n N}). Then which of the following is ALWAYS regular? Definition of a language L ...

[8:09 AM, 5/11/2021] Amani: Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should use?

Station A needs to send a message consisting of 9 packets to Station B using a sliding window (window size 3) and go-back-n error control strategy. All packets are ready and immediately available for transmission. If every 5th packet that A transmits gets lost (but no acks from B ever get lost), then what is the number of packets that A will transmit for sending the message to B?

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect odd number of bits in error? Frames of 1000 bits are sent over a 10^6 bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link).

What is the minimum number of bits (i) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.

Consider the data of previous question. Suppose that the sliding window protocol is used with the sender window size of 2^i where is the number of bits identified in the previous question and acknowledgments are always piggybacked. After sending 2^i frames, what is the minimum time the sender will have to wait before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time.)

The bandwidth of the line is 1.5 Mbps with round trip time(RTT) as 45 milliseconds.If the size of each packet is 1 KB(kilobytes), then what is the efficiency in Stop and wait protocol?A 1 km long broadcast LAN has bandwidth (BW) of 107 bps and uses CSMA/CD, then what is the minimum size of the packet? Consider Subnet mask of class B network on the internet is 255.255.240.0 then, what is the maximum number of hosts per subnets?

In which of the following protocol(s) it is possible for sender to receive acknowledgement for a packet that falls outside its current window?An Internet Service Provider(ISP) has the following chunk of CIDR-based IP addresses available with it:245.248.128.0/20. The ISP wants to give half of this chunk of addreses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of addresses to A and B?