 A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

 71. A shift reduce parser suffers from a. shift reduce conflict only b. reduce reduce conflict only c. both shift reduce conflict and reduce reduce conflict d. shift handle and reduce handle conflicts

 72. The context free grammar for language L = {a^nb^mc^k | k = |n - m|, n≥0,m≥0,k≥0} is a. S→S1S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ b. S→S1S3, S1→aS1S2c |λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ c. S→S1|S2, S1→aS1S2c|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ d. S→S1|S3, S1→aS1c |S2|λ, S2→aS2b|λ, S3→aS3b|S4| λ, S4→bS4c|λ

 73. The number of states in a minimal deterministic finite automaton corresponding to the language L = { an | n≥4 } is a. 3 b. 4 c. 5 d. 6

 74. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is a. (1 + 010)* b. (01 + 10)* c. (1 + 010)* (0 + λ) d. (1 + 01)* (0 + λ)

 75. Consider the following two languages: L1 = {a^n b^l a^k | n + l +k>5 } L2 = {a^n b^l a^k |n>5, l >3, k≤ l } Which of the following is true? a. L1 is regular language and L2 is not regular language b. Both L1 and L2 are regular languages c. Both L1 and L2 are not regular languages d. L1 is not regular language and L2 is regular language

 76. LL grammar for the language L = {a^n b^m c^n+m | m≥0, n≥0} is a. S → aSc | S1 ; S1 → bS1c | λ b. S → aSc | S1| λ ; S1 → bS1c c. S → aSc | S1| λ ; S1 → bS1c| λ d. S → aSc | λ ; S1 → bS1c| λ

 77. Assume the statements S1 and S2 given as: S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite. S2: There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true? a. S1 is correct and S2 is not correct b. Both S1 and S2 are correct c. Both S1 and S2 are not correct d. S1 is not correct and S2 is correct