121. What will be the value of n, if turing machines is defined using n-tuples ?
(A) 7
(B) 6
(C) 5
(D) 8
Answer: (A)
122. Consider the following CFG :
S ->■ aB I bA
A ^ b I aS I bAA
B -> b I bS I aBB.
Which of the following strings of termi nals generated by this CFG ?
(A) Odd numbers of a's and odd number of b's
(B) Equal number of a's and equal number of b's
(C) Even number of a's and even number of b's
(D) Odd numbers of a's even number of b's
Answer: Deleted
123. Turing machine accepts :
(A) Universal languages
(B) Recursive languages
(C) Recursively enumerable languages
(D) Non-recursive languages
Answer: (C)
124. Which of the following is not a
regular language?
(A) L = {an bn+3|n>=0}
(B) L = { an an+3|n>=0}
(C) L = { an an+3 an |n>=0}
(D) All of the above
Answer: (A)
125. A problem is NP-complete if:.
(A) Solution can be verified easily
(B) A quick algorithm to solve this problem can be used to solve all other NP problem quickly
(C) It can be solved in polynomial time
(D) All of the above
Answer: (D)
126. Consider the following grammar :
S à ABSc I Abc
BA-> AB
Bb -> bb
Ab -> ab
Aa -> aa
Which of the following statements can be derived by this grammar ?
(A) aab
(B) abc
(C) abcc
(D) abbe
Answer: (B)
127. Non-recursive predictive parsing is constructed using stack that contains :
(A) Parsing table
(B) Sequence of grammar symbols
(C) Only terminals
(D) E
Answer: (B)
128. A dangling reference occurs when there is a reference to storage that has been
(A) Allocated
(B) Reallocated
(C) Deallocated
(D) None of the above
Answer: (C)
129. Consider the following C-code segment:
a = b + c
c = a + I
d = b + c
f=d+1
g= e + +
Suppose this code segment is represented internally as directed acyclic graph, then the number of nodes in the DAG is :
(A) 4
(B) 5
(C) 6
(D) 3
Answer: Deleted
130. Which of the following represents intermediate codes ?
(A) Triples
(B) Quadriples
(C) Indirected Triples
(D) All of the above
Answer: (D)
No comments:
Post a Comment