21. What is the value of the postfix expression ?
a b c d + – ∗ (where a = 8, b = 4, c = 2 and d = 5)
(A) – 38
(B) – 83
(C) 24
(D) –24
22. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue ?
(A) Neither of the pointers change
(B) Only front pointer changes
(C) Only rear pointer changes
(D) Both of the pointers changes
23. _______ is often used to prove the correctness of a recursive function.
(A) Diagonalization
(B) Communitivity
(C) Mathematical Induction
(D) Matrix Multiplication
24. For any B-tree of minimum degree t ≥ 2, every node other than the root
must have atleast ________ keys and every node can have at most ________ keys.
(A) t – 1, 2t + 1
(B) t + 1, 2t + 1
(C) t – 1, 2t – 1
(D) t + 1, 2t – 1
25. Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparison needed in the worst case by the merge sort algorithm will be
(A) m × n
(B) max (m, n)
(C) min (m, n)
(D) m + n – 1
26. Given the following statements :
S1: SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look- aheads are associated with the items and they make use of the left context available to the parser.
S2: LR grammar is a greater subclass of context free grammar as compared to SLR and LALR grammar.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct
27. The context free grammar for the language
L = {a^n b^n | n ≤ m + 3, n ≥ 0, m ≥ 0} is
(A) S → aaa A; A → aAb | B, B → Bb | λ
(B) S → aaaA|λ, A → aAb | B, B → Bb | λ
(C) S → aaaA | aa A | λ, A → aAb | B, B → Bb| λ
(D) S → aaaA | aa A | aA | λ, A → aAb | B, B → Bb | λ
28. Given the following statements :
S1 : If L is a regular language then the language {uv | u ∈ L, v ∈ L^R} is also regular.
S2 : L = {ww^R} is regular language.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
29. The process of assigning load addresses to the various parts of the program and adjusting the code and
data in the program to reflect the assigned addresses is called _______.
(A) Symbol resolution
(B) Parsing
(C) Assembly
(D) Relocation
30. Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right.
(A) Leftmost derivation
(B) Leftmost derivation traced out in reverse
(C) Rightmost derivation traced out in reverse
(D) Rightmost derivation
a b c d + – ∗ (where a = 8, b = 4, c = 2 and d = 5)
(A) – 38
(B) – 83
(C) 24
(D) –24
22. If the queue is implemented with a linked list, keeping track of a front pointer and a rear pointer, which of these pointers will change during an insertion into a non-empty queue ?
(A) Neither of the pointers change
(B) Only front pointer changes
(C) Only rear pointer changes
(D) Both of the pointers changes
23. _______ is often used to prove the correctness of a recursive function.
(A) Diagonalization
(B) Communitivity
(C) Mathematical Induction
(D) Matrix Multiplication
24. For any B-tree of minimum degree t ≥ 2, every node other than the root
must have atleast ________ keys and every node can have at most ________ keys.
(A) t – 1, 2t + 1
(B) t + 1, 2t + 1
(C) t – 1, 2t – 1
(D) t + 1, 2t – 1
25. Given two sorted list of size ‘m’ and ‘n’ respectively. The number of comparison needed in the worst case by the merge sort algorithm will be
(A) m × n
(B) max (m, n)
(C) min (m, n)
(D) m + n – 1
26. Given the following statements :
S1: SLR uses follow information to guide reductions. In case of LR and LALR parsers, the look- aheads are associated with the items and they make use of the left context available to the parser.
S2: LR grammar is a greater subclass of context free grammar as compared to SLR and LALR grammar.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct
27. The context free grammar for the language
L = {a^n b^n | n ≤ m + 3, n ≥ 0, m ≥ 0} is
(A) S → aaa A; A → aAb | B, B → Bb | λ
(B) S → aaaA|λ, A → aAb | B, B → Bb | λ
(C) S → aaaA | aa A | λ, A → aAb | B, B → Bb| λ
(D) S → aaaA | aa A | aA | λ, A → aAb | B, B → Bb | λ
S1 : If L is a regular language then the language {uv | u ∈ L, v ∈ L^R} is also regular.
S2 : L = {ww^R} is regular language.
Which of the following is true ?
(A) S1 is not correct and S2 is not correct.
(B) S1 is not correct and S2 is correct.
(C) S1 is correct and S2 is not correct.
(D) S1 is correct and S2 is correct.
data in the program to reflect the assigned addresses is called _______.
(A) Symbol resolution
(B) Parsing
(C) Assembly
(D) Relocation
30. Which of the following derivations does a top-down parser use while parsing an input string ? The input is scanned from left to right.
(A) Leftmost derivation
(B) Leftmost derivation traced out in reverse
(C) Rightmost derivation traced out in reverse
(D) Rightmost derivation
Next
0 comments:
Post a Comment