<--BACK
26. Given the
following statements :
S1 : SLR uses follow information to guide
reductions. In case of LR and LALR parsers, the lookaheads are associated with the items and
they make use of the left context available to the parser.
S2 : LR grammar is a larger subclass
of context free grammar as compared to that SLR and LALR grammars.
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 = {an bm | 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 ∈ LR} is also regular.
S2 : L = {wwR} 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
31. The dual of a
Boolean expression is obtained by interchanging
(A) Boolean sums and Boolean products
(B) Boolean sums and Boolean products
or interchanging 0’s and 1’s
(C) Boolean sums and Boolean products
and interchanging 0’s & 1’s
(D) Interchanging 0’s and 1’s
32. Given that (292)10 = (1204)x in some number
system x. The base x of that number system is
(A) 2 (B) 8 (C) 10 (D) None of the above
33. The sum of
products expansion for the function F(x, y, z) = (x + y)–z is given as
(A) –x –yz + xy–z + –x y–z (B)
xyz + xy–z + x–y –z
(C) x–y –z + –x –y –z + xy–z (D) x y–z + x–y –z + –x y–z
34. Let P(m, n) be
the statement “m divides n” where the universe of discourse for both the
variables is the set of positive integers. Determine the truth values of each
of the following propositions :
I. ∀m
∀n P(m, n),
II. ∃m ∀n
P(m, n)
(A) Both I and II are true (B) Both I and II are false
(C) I – false & II – true (D) I – true & II – false
35. Big – O estimate
for f(x) = (x + 1) log(x2 + 1) + 3x2 is given as
(A) O(x log x) (B) O(x2) (C)
O(x3) (D) O(x2 log x)
36. How many edges
are there in a forest of t-trees containing a total of n vertices ?
(A) n + t (B) n – t (C)
n ∗ t (D) nt
37. Let f and g be
the functions from the set of integers to the set integers defined by
f(x) = 2x + 3 and
g(x) = 3x + 2 Then the composition of f and g and g and f is
given as
(A) 6x + 7, 6x + 11 (B) 6x + 11, 6x + 7
(C) 5x + 5, 5x + 5 (D) None of the above
38. If n and r are
non-negative integers and n ≥
r,
then p(n + 1, r) equals to
(A) p(n, r) (n + 1)/ (n + 1 – r)
(B) p(n, r) (n + 1) /(n – 1 + r)
(C) p(n, r) (n – 1) /(n + 1 – r)
(D) p(n, r) (n + 1) /(n + 1 + r)
39. A graph is
non-planar if and only if it contains a subgraph homomorphic to
(A) K3, 2 or K5 (B) K3, 3 and K6 (C) K3, 3 or K5 (D) K2, 3 and K5
40. Which of the
following statements are true ?
I. A circuit that adds two bits, producing
a sum bit and a carry bit is called half adder.
II. A circuit that adds two bits,
producing a sum bit and a carry bit is called full adder.
III. A circuit that adds two bits
and a carry bit producing a sum bit and a carry bit is called full
adder.
IV. A device that accepts the
value of a Boolean variable as input and produces its complement is called an
inverter.
(A) I & II (B) II & III (C) I, II, III (D) I,
III & IV
41. Active X controls
are Pentium binary programs that can be embedded in ________
(A) Word pages (B) URL pages (C) Script pages (D) Web pages
42. Match the
following :
List – I List
– II
a. Wireless Application Environment i. HTTP
b. Wireless Transaction Protocol ii.
IP
c. Wireless Datagram Protocol iii.
Scripts
d. Wireless iv.
UDP
Codes :
a b c
d
(A) ii iv i iii
(B) iv iii ii i
(C) iv iii i ii
(D) iii i iv ii
43. Which of the
following is widely used inside the telephone system for long-haul data traffic
?
(A) ISDN (B) ATM (C)
Frame Relay (D) ISTN
44. The document
standards for EDI were first developed by large business house during the 1970s
and are now under the control of the following standard organisation :
(A) ISO (B) ANSI (C)
ITU-T (D) IEEE
45. Electronic Data
Interchange Software consists of the following four layers :
(A) Business application,
Internal format conversion, Network translator, EDI envelope
(B) Business application,
Internal format conversion, EDI translator,
EDI envelope
(C) Application layer, Transport layer,
EDI translator, EDI envelope
(D) Application layer, Transport layer,
IP layer, EDI envelope
46. Consider a
preemptive priority based scheduling algorithm based on dynamically changing
priority. Larger priority number implies higher priority. When the process is waiting
for CPU in the ready queue (but not yet started execution), its priority
changes at a rate a = 2. When it starts running, its priority changes at a rate
b = 1. All the processes are assigned priority value 0 when they enter ready
queue. Assume that the following processes want to execute :
Process Arrival Service
ID Time Time
P1 0
4
P2 1
1
P3 2
2
P4 3
1
The time quantum q = 1. When two processes
want to join ready queue simultaneously, the process which has not executed
recently is given priority. The finish time of processes P1, P2, P3 and P4 will
respectively be
(A) 4, 5, 7 and 8 (B) 8, 2, 7 and 5 (C) 2, 5, 7 and 8 (D) 8, 2, 5 and 7
47. The virtual
address generated by a CPU is 32 bits. The Translation Look-aside Buffer (TLB)
can hold total 64 page table entries and a 4-way set associative (i.e. with 4- cache
lines in the set). The page size is 4 KB. The minimum size of TLB tag is
(A) 12 bits (B) 15 bits (C) 16 bits (D) 20
bits
48. Consider a disk
queue with request for input/output to block on cylinders 98, 183, 37, 122, 14,
124, 65, 67 in that order. Assume that disk head is initially positioned at
cylinder 53 and moving towards cylinder number 0. The total number of head movements
using Shortest Seek Time First (SSTF) and SCAN algorithms are respectively
(A) 236 and 252 cylinders (B) 640 and 236 cylinders
(C) 235 and 640 cylinders (D) 235 and 252 cylinders
49. How much space
will be required to store the bit map of a 1.3 GB disk with 512 bytes block
size ?
(A) 332.8 KB (B) 83.6 KB (C)
266.2 KB (D) 256.6 KB
50. Linux operating
system uses
(A) Affinity Scheduling (B) Fair Preemptive Scheduling
(C) Hand Shaking (D) Highest Penalty Ratio
Next
