Question 12 S→aSa|bSb|a|b The language generated by the above grammar over the alphabet {a,b} is the set of A all palindromes. B all odd length palindromes. […]
Question 5 Given below are two statements: Statement I: Bharatha Muni prescribed popular dialects for communication among the elites. Statement II: Bharatha Muni also prescribed classical […]
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 as […]
Consider the following two statements about regular languages: S1: Every infinite regular language contains an undecidable language as a subset. S2: Every finite language is regular. […]
Suppose we want to design a synchronous circuit that processes a string of 0’s and 1’s. Given a string, it produces another string by replacing the […]
Question 13 Consider the following statements S1 and S2 about the relational data model: S1: A relation scheme can have at most one foreign key. S2: […]