Consider the grammar shown below. S → C C C → c C | d The grammar is (A) LL(1) (B) SLR(1) but not LL(1)… Read More
Consider the grammar shown below S → i E t S S' | a S' → e S | ε E → b In the… Read More
Consider the NFA M shown below. Let the language accepted by M be L. Let L1 be the language accepted by the NFA M1, obtained… Read More
Define languages L0 and L1 as follows : L0 = {< M, w, 0 > | M halts on w} L1 = {< M, w,… Read More
A single tape Turing Machine M has two states q0 and q1, of which q0 is the starting state. The tape alphabet of M is… Read More
Consider two languages L1 and L2 each on the alphabet ∑. Let f : ∑ → ∑ be a polynomial time computable bijection such that… Read More
Let G = ({S}, {a, b} R, S) be a context free grammar where the rule set R is S → a S b |… Read More
Telephonic: 1. Determine if Two Trees are Identical 2. Transform to Sum Tree Round 1 1. Left View of Binary Tree 2. Peak element Round… Read More
Consider the following deterministic finite state automaton M. Let S denote the set of seven bit binary strings in which the first, the fourth, and… Read More
Given two sets represented by two arrays, how to check if the given two sets are disjoint or not? It may be assumed that the… Read More
Consider the following assembly language program for a hypothetical processor. A, B, and C are 8 bit registers. The meanings of various instructions are shown… Read More
Consider the following assembly language program for a hypothetical processor. A, B, and C are 8 bit registers. The meanings of various instructions are shown… Read More
Consider the following circuit composed of XOR gates and non-inverting buffers. The non-inverting buffers have delays d1 = 2 ns and d2 = 4 ns… Read More
Consider the ALU shown below. If the operands are in 2’s complement representation, which of the following operations can be performed by suitably setting the… Read More
The literal count of a boolean expression is the sum of the number of times each literal appears in the expression. For example, the literal… Read More