Professional Documents
Culture Documents
J-87-13-II (Computer Science & Applications) PDF
J-87-13-II (Computer Science & Applications) PDF
(Name) ____________________________
Roll No.
2. (Signature) __________________________
(Name) ____________________________
87
Roll No.________________________________
(In words)
1 3
Time : 1 /4 hours]
1.
2. -
3. , -
-
, :
(i) - /
- /
(ii) -
/
-
-
(iii) OMR -
4. (A), (B), (C) (D)
:
(C)
5. I OMR
OMR
,
6.
7. (Rough Work)
8. OMR ,
,
, ,
,
9. OMR
OMR
10. /
11. ()
12.
J-87-13
P.T.O.
2.
3.
4.
(C)
5.
V(G) = en+2
(C)
V(G) = e+n+2
2,2
(C)
1,1
(D) 1,2
Paper-II
7.
m2
(C)
m(m+1)
(D) m(m+2)
2
J-87-13
8.
13.
9.
14.
10.
11.
A Network Schema
(A) restricts to one to many
relationship
(B) permits
many
to
many
relationship
(C) stores Data in a Database
(D) stores Data in a Relation
J-87-13
(B)
D1D2 Dn
(C)
D1D2 Dn
(D) D1D2 Dn
12.
15.
16.
17.
18.
19.
20.
21.
23.
S 1| 2| 1A | 2A,
A 1A | 2A
(C)
S 1 | 2, A 1A | 2A
(D) S 1 | 2 | 1A | 2A,
A 1A | 2A |
24.
A a | Aa
Bb
and the production rules of a
grammar G2 as
S2 aS2bS2 | bS2aS2 |
Which of the following is correct
statement ?
(A) G1 is ambiguous and G2 is not
ambiguous.
(B) G1 is ambiguous and G2 is
ambiguous.
(C) G1 is not ambiguous and G2 is
ambiguous.
(D) G1 is not ambiguous and G2 is
not ambiguous.
Paper-II
22.
J-87-13
25.
29.
30.
31.
32.
for
are
is
is
are
1 1
(B) Atmost ln
1
1 1
(C) Atleast ln
1
1
(D) Atleast ln
27.
28.
J-87-13
Paper-II
33.
34.
35.
36.
38.
(A) M+NC
39.
(C)
MN+C
(B)
(p q r) ( p q r) ( q p r)
(C)
(p q r) ( p q r) ( p q r)
(D) (p r q) ( p q r) ( p q r)
40.
100
C2
(B)
(C)
41.
Which of the following connected
simple graph has exactly one
spanning tree ?
(A) Complete graph
(B) Hamiltonian graph
(C) Euler graph
(D) None of the above
Paper-II
MNC
(A) (p q r) ( p q r) ( p q r)
(C) 2100
(D) 3100
37.
(B)
(D) M+N+C
(B)
28
(C)
212
(D) 216
6
J-87-13
42.
43.
44.
45.
46.
J-87-13
47.
48.
49.
50.
Paper-II
J-87-13