Cseoct18 617 PDF

*SLRTX312*
SLR-TX – 312
Seat
No.
Set P
S.E. (CSE) (Part – I) (New-CBCS) Examination, 2018
APPLIED MATHEMATICS – I
Day and Date : Tuesday, 4-12-2018 Max. Marks : 70

Time : 10.00 a.m. to 1.00 p.m.
N.B. : 1) Q. No. 1 is compulsory. It should be solved in first

30 minutes in Answer Book Page No. 3. Each question
carries one mark.
2) Answer MCQ/Objective type questions on Page No. 3
only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on
Top of Page.
MCQ/Objective Type Questions
Duration : 30 Minutes Marks : 14
1. Choose the correct answer : 14
1) 12 x 3 is equal to
D

x5  2 x3 
a) b) e x
–x 3
c) e  x +  d) None of these
x
20  3 
2) The general solution of (D4 + 2D2 + 1) y = 0 is

a) c1cosx + c2 sinx + c3 sin x + c4 cosx
b) (c1 + c2x) ex
c) (c1 + c2x) cosx + (c3 + c4x) sinx
d) (c1 + c2x + c3x2 + c4x3) e–x
3) The Laplace transform of e2tsint is
1 1 1 1
a) b) 2 c) 2 d) 2
s −4
2
s +1 s + 4s + 1 s − 4s + 5
1
4) (s − 3)2 is the Laplace transform of ________
a) te–3t b) t3 c) e3tt d) e–3tt2
P.T.O.
SLR-TX – 312 -2- *SLRTX312*
t
5) The Laplace transform of ∫ cos 2u du is
0
s 1 s 1
a) b) c) 2 d)
s +4
2
s +42
s −4 s −4
2
z
6) The inverse Z-transform of , |z|>a(k ≥ 0) is
z − a
a) ak b) a–k c) ak+1 d) a–k+1
7) If Z{f(k)} = F(z), then z{kf(k)}=
dF(z) −dF(z) dF(z) dF(z)
a) b) c) −z d) z
dz dz dz dz
8) The Fourier series expansion of F(x) = sin2x is
a) sinx + cosx b) 1 – cos2x
c) sin2x + cos2x d) 1 (1 – cos2x)
2
9) In the interval – π ≤ x < π the constant term in the Fourier series of f(x) =
|x| is,
a) π b) π c) π d) 0
2 4
10) The lines of regression are 10y = x + 17 and x = 5y – 7 the and are
a) 1 and 10 b) 1 and 5 c) 2 and 3 d) 3 and 2
11) Correlation analysis help us to __________ our activities.
a) control b) plan c) predict d) all of the above
12) If mean = 12 and variance = 4 then the binomial distribution constants n,
p, q are respectively
a) 9, 1 , 2 b) 4, 1 , 1 c) 18, 2 3 , 13 d) 9, 2 3 , 13
3 3 2 2
13) Idle time of the queuing system is
λ λ µ
a)
b) 1− c) µ d) 1−
µ µ λ λ
14) A waiting customer leave a queue due to impatience. This behaviour is
known as
a) Reneging b) Balking c) Jockeying d) Selection
_____________

Set P
*SLRTX312* -3- SLR-TX – 312
Seat
No.
Day and Date : Tuesday, 4-12-2018 Marks : 56

Time : 10.00 a.m. to 1.00 p.m.
Instructions : 1) All questions are compulsory.

2) Figures to right indicate full marks.
3) Use of non-programmable calculator is allowed.
SECTION – I
2. Solve any three of the following : 9

 2 sin 2t sin 6t 
a) Find L  .
 t 
b) Find inverse Laplace transform of Cot −1 s ( a) .
c) Solve (D3 + 2D2 + D) y = x3.
d) Solve y′′ − 4 y′ + 4 y = 8x ⋅ e cos 2x .
2 2x

e) Find Z{2k sin(3k + 2)}, k ≥ 0.

a) Find Laplace transform of (3t + 4)3 + 5t–cosh2t.
−1  s+2 
b) Find L  2 .
 s (s + 3) 
e−3 x
c) Solve (D + 6D + 9) y =
2
.
45
d) Find Z{k2 e–ak}, k ≥ 0.
1
e) Find inverse z-transform of , | z |< 5 .
(z − 5)2
4. Solve any two of the following : 10
d2 y
a) Solve 2
− y = (1+ x 2 )ex + x sin x
dx
b) Solve y′′ + by′ + 9y = 12t 2e−3 t , with y(0) = 0 = y′(0) by using Laplace
transform method.
Set P
SLR-TX – 312 -4- *SLRTX312*
1
c) Find inverse Z-transform of , where
(z − 3) (z − 2)
i) |z|< 2
ii) 2<|z|<3.
SECTION – II
5. Attempt any three :

a) In a partially destroyed laboratory record of analysis of correlation data,
the following results were legible. Variance of x = 9. Regression equations
4x – 5y + 33 = 0, 20x – 9y – 107 = 0
Find :
i) The mean values of x and y
ii) The correlation coefficient between x and y
iii) The standard derivation of y. 3
b) The following mistakes per page were observed in a book.
No. of mistakes : 0 1 2 3 4
No. of pages : 211 90 19 5 0
Fit a Poisson distribution. 3
c) Find half range cosine series for f(x) = (x – 1)2, 0 ≤ x ≤ 1. Hence find
∞
1
∑h
n=1
2
. 3

d) Find the Fourier expansion for f(x) = 1− cos x in (0, 2π). 3
e) A super market has two girls serving at the two counters the customers
arrive in Poisson Fashion at the rate of 12 per hours. The service time for
each customer is exponential with mean 6 minutes.
Find :
1) The probability that an arriving customer has to wait ?
2) The average time spent by a customer in the super market. 3
a) Obtain Fourier series for
π
f(x) = + x, − π < x < 0
2
π
= − x, 0 < x < π . 3
2
Set P
*SLRTX312* -5- SLR-TX – 312
b) Find the line of regression of x on y from the following data. 3
x : 2 4 6 8 10
y : 6 5 4 3 2
c) Weights of 4000 students are found to be normally distributed with mean
50 kgs and standard deviation 5 kgs. Find the number of students with
weights :
i) Less than 45 kgs and
ii) Between 45 and 60 kgs.
[Given – for SNV z, Area between z = 0 to z = 1 is 0.3413 and z = 0 to
z = 2 is 0.4772]. 3
d) Find the average waiting time per customer in the queue and in the
system for M|M|1|∞ model, if λ =9 and µ = 15 per hours. 3
e) People arrive to purchase railways tickets at the rate of 5 per minute.
On an average it takes 10 seconds to issue the ticket. A person arrives
5 min, before the train starts. It takes 4 min for him to get in the train after
purchasing the ticket.
i) Can he be expected in the train before the train starts ?
ii) What is the probability that he will be in the train before the train
starts ? 3
7. Attempt any two :

a) Calculate Karl Pearson’s coefficient of correlation from the following data. 5
x : 28 45 40 38 35 33 40 32 36 33
y : 23 34 33 34 30 26 28 31 36 35
b) Obtain the Fourier expansion of f(x) = e–x in (– a, a). 5
c) There are two typists in a type writing shop each typists can type on an
average 5 letters per hour. The rate of arrivals of letters is 8 per hours
i) What is the probability that both the typist are busy ?
ii) What is the average idle time for which both typist are idle ? 5
_____________
Set P
Set P
*SLRTX312* SLR-TX – 312
Seat
No.
Set Q

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

2
|x| is,
a) π b) π c) π d) 0
2 4
a) 9, 1 , 2 b) 4, 1 , 1 c) 18, 2 3 , 13 d) 9, 2 3 , 13
3 3 2 2
λ λ µ
a) b) 1− c) µ d) 1−
µ µ λ λ P.T.O.
SLR-TX – 312 -2- *SLRTX312*
known as
D

x5  x3 
a) b) e–xx3 c) ex  x 2 +  d) None of these
20  3 

b) (c1 + c2x) ex
d) (c1 + c2x + c3x2 + c4x3) e–x
1 1 1 1
a) b) 2 c) 2 d) 2
s −4 2
s +1 s + 4s + 1 s − 4s + 5
1
t
0
s 1 s 1
a) b) c) 2 d)
s +4
2
s +4 2
s −4 s −4
2
z
z − a
a) b) c) −z d) z
dz dz dz dz

_____________

Set Q
*SLRTX312* -3- SLR-TX – 312
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

a) Find L  .
 t 
c) Solve (D3 + 2D2 + D) y = x3.
2 2x

e) Find Z{2k sin(3k + 2)}, k ≥ 0.

−1  s+2 
b) Find L  2 .
 s (s + 3) 
e−3 x
c) Solve (D + 6D + 9) y =
2
.
45
1
(z − 5)2
d2 y
a) Solve 2
− y = (1+ x 2 )ex + x sin x
dx
transform method.
Set Q
SLR-TX – 312 -4- *SLRTX312*
1
(z − 3) (z − 2)
i) |z|< 2
ii) 2<|z|<3.
SECTION – II

4x – 5y + 33 = 0, 20x – 9y – 107 = 0
Find :
No. of pages : 211 90 19 5 0
∞
1
∑h
n=1
2
. 3

Find :
π
f(x) = + x, − π < x < 0
2
π
= − x, 0 < x < π . 3
2
Set Q
*SLRTX312* -5- SLR-TX – 312
x : 2 4 6 8 10
y : 6 5 4 3 2
weights :
z = 2 is 0.4772]. 3
starts ? 3

x : 28 45 40 38 35 33 40 32 36 33
y : 23 34 33 34 30 26 28 31 36 35
_____________
Set Q
Set Q
Seat
No.
Set R

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

t
0
s 1 s 1
a) b) c) 2 d)
s +4
2
s +4 2
s −4 s −4
2
z
z − a
a) b) c) −z d) z
dz dz dz dz
2
|x| is,
a) π b) π c) π d) 0
2 4 P.T.O.
SLR-TX – 312 -2- *SLRTX312*

a) 9, 1 , 2 b) 4, 1 , 1 c) 18, 2 3 , 13 d) 9, 2 3 , 13
3 3 2 2
λ λ µ
a)
b) 1− c) µ d) 1−
µ µ λ λ
known as
D

x5  2 x3 
a) b) e x
–x 3
c) e  x +  d) None of these
x
20  3 

b) (c1 + c2x) ex
d) (c1 + c2x + c3x2 + c4x3) e–x
1 1 1 1
a) b) 2 c) 2 d) 2
s −4 2
s +1 s + 4s + 1 s − 4s + 5
1
_____________

Set R
*SLRTX312* -3- SLR-TX – 312
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

a) Find L  .
 t 
c) Solve (D3 + 2D2 + D) y = x3.
2 2x

e) Find Z{2k sin(3k + 2)}, k ≥ 0.

−1  s+2 
b) Find L  2 .
 s (s + 3) 
e−3 x
c) Solve (D + 6D + 9) y =
2
.
45
1
(z − 5)2
d2 y
a) Solve 2
− y = (1+ x 2 )ex + x sin x
dx
transform method.
Set R
SLR-TX – 312 -4- *SLRTX312*
1
(z − 3) (z − 2)
i) |z|< 2
ii) 2<|z|<3.
SECTION – II

4x – 5y + 33 = 0, 20x – 9y – 107 = 0
Find :
No. of pages : 211 90 19 5 0
∞
1
∑h
n=1
2
. 3

Find :
π
f(x) = + x, − π < x < 0
2
π
= − x, 0 < x < π . 3
2
Set R
*SLRTX312* -5- SLR-TX – 312
x : 2 4 6 8 10
y : 6 5 4 3 2
weights :
z = 2 is 0.4772]. 3
starts ? 3

x : 28 45 40 38 35 33 40 32 36 33
y : 23 34 33 34 30 26 28 31 36 35
_____________
Set R
Set R
Seat
No.
Set S

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) 9, 1 , 2 b) 4, 1 , 1 c) 18, 2 3 , 13 d) 9, 2 3 , 13
3 3 2 2
λ λ µ
a) b) 1− c) µ d) 1−
µ µ λ λ
known as
P.T.O.
SLR-TX – 312 -2- *SLRTX312*
D

x5  x3 
a) b) e–xx3 c) ex  x 2 +  d) None of these
20  3 

b) (c1 + c2x) ex
d) (c1 + c2x + c3x2 + c4x3) e–x
1 1 1 1
a) b) c) d)
s2 − 4 s2 + 1 s2 + 4s + 1 s − 4s + 5
2
1
t
0
s 1 s 1
a) b) c) 2 d)
s +4
2
s +4 2
s −4 s −4
2
z
z − a
a) b) c) −z d) z
dz dz dz dz
2
|x| is,
a) π b) π c) π d) 0
2 4
Set S
_____________

*SLRTX312* -3- SLR-TX – 312
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

a) Find L  .
 t 
c) Solve (D3 + 2D2 + D) y = x3.
2 2x

e) Find Z{2k sin(3k + 2)}, k ≥ 0.

−1  s+2 
b) Find L  2 .
 s (s + 3) 
e−3 x
c) Solve (D + 6D + 9) y =
2
.
45
1
(z − 5)2
d2 y
a) Solve 2
− y = (1+ x 2 )ex + x sin x
dx
transform method.
Set S
SLR-TX – 312 -4- *SLRTX312*
1
(z − 3) (z − 2)
i) |z|< 2
ii) 2<|z|<3.
SECTION – II

4x – 5y + 33 = 0, 20x – 9y – 107 = 0
Find :
No. of pages : 211 90 19 5 0
∞
1
∑h
n=1
2
. 3

Find :
π
f(x) = + x, − π < x < 0
2
π
= − x, 0 < x < π . 3
2
Set S
*SLRTX312* -5- SLR-TX – 312
x : 2 4 6 8 10
y : 6 5 4 3 2
weights :
z = 2 is 0.4772]. 3
starts ? 3

x : 28 45 40 38 35 33 40 32 36 33
y : 23 34 33 34 30 26 28 31 36 35
_____________
Set S
Set S
Seat
No.
Set P
S.E. (CSE) (Part – I) (New CBCS Pattern) Examination, 2018
Computer Science and Engineering (CSE)
Discrete Mathematical Structure (DMS)
Day and Date : Thursday, 6-12-2018 Max. Marks : 70

Time : 10.00 a.m. to 1.00 p.m.
Note : 1) Q. No. 1 is compulsory. It should be solved in first

carries one mark.
Top of Page.
1. Choose the correct answer : (14�1=14)

1) The set A∩B = Φ is called as
a) Subset b) Proper subset
c) Disjoint set d) None of these
2) If a*b = a*c then b = c is called as
a) Commutative b) Cancellation
c) Left cancellation d) Right cancellation
3) The relation R on set S if satisfies the reflexive, antisymmetric and
transitive property then relation is
a) Compatible relation b) Partial ordered relation
c) Equivalence relation d) None of these
4) GLB is called as
a) Join b) Supermum
c) Infimum d) Both a) and b)
P.T.O.
SLR-TX – 313 -2- *SLRTX313*
5) A group is said to ___________ if there exist an element a € G such that
every element of G can be written as some power of a
a) Acyclic b) Cyclic c) Abalian d) Angular
6) A ∪ Φ= A is represent
a) Identity law b) Idempotent law
c) Domination law d) Complement law
7) (P ↓ P) is equivalent to
a) (P ∨ P) b) P ^ P c) P d) All of these
¬
¬
8) Let R be the Binary relation on X and Y sets, which of the following is true
a) Domain (R) is the subset of Y b) Domain (R) is the not subset of Y
c) Domain (R) is the subset of X d) All are true
9) Let X = {a, b, c} and Y = {0, 1} how many possible mapping are listed as
f : X → Y.
a) 2 b) 32 c) 16 d) 8
10) Monoids satisfies the property
a) Inverse b) Identity
c) Idempotent d) Absorption
11) In polish expression rank of well-formed formula is always
a) 1 b) 0 c) –1 d) 2
12) The complement and distributive lattice is ______________
a) LUB b) Boolean function
c) GLB d) Boolean algebra
13) {↑} and {↓} are functionally complete set of connective.
a) True b) False c) Only {↑} d) Only {↓}
14) <L, *, > and <S, ^, v> be the two lattices a mapping g : L → S is isomorphic if
a) g is into b) g is onto c) g is bijective d) both b) and c)
_____________

Set P
*SLRTX313* -3- SLR-TX – 313
Seat
No.
Day and Date : Thursday, 6-12-2018 Marks : 56

Time : 10.00 a.m. to 1.00 p.m.
Note : All questions are compulsory.
SECTION – I
2. Answer the following (any 3) : (3�4=12)

1) Define power set. Given S = {a1, a2, a3, ... a8}. What subsets are
represented by B19, B31 and B124.
2) Define the following with example :
a) ordered pair and order n-tuple b) proposition
3) Let A = {1, 2, 3, ...., 10} and relation R on set A is R = {<x, 2x>|x€A}
obtain the relation matrix and graph of relation.
4) What is equivalence of formula, show the following equivalence ?
(p ∨ q) ^ ( p ^ ( p ^ q)) < = > ( p ^ q).
¬

1) Explain operation of set with example and show the following set identities
a) (A – C) ∩ (C – B) = Φ b) A + A = Φ.
2) Obtain PCNF and PDNF of the following :
a) ( p → r) ^ (q ↔ p) b) p → (p ^ (q → p))
¬
4. Given relation matrix MR of binary relation R on set {a, b, c}, find relation
matrices of :
a) R–1 b) R o R = R2

c) R2 o R = R3 d) R o R–1. (1�8=8)
MR = 1 0 1
1 1 0
1 1 1
Set P
SLR-TX – 313 -4- *SLRTX313*
SECTION – II

1) Define inverse function and explain it with example.
2) Define semigroup and explain the homomorphism of semigroup with types.
3) Define lattice as a partial ordered set and explain properties with example.
4) Show that the lattices given in diagram are distributive or not.
a)
b)

1) Obtain sum of product canonical form of the following Boolean
expression in three variable :
a) X1 * X2
b) X1 ⊕ X2.
2) Give the following representation to the Boolean function
F = x′y′z + x′yz′ + xy′z′ :
a) Circuit diagram
b) Truth table
c) K-Map
d) Cube.
7. Define algebraic system and explain the properties with an example. (1�8=8)
_____________
Set P
Seat
No.
Set Q

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

f : X → Y.
a) 2 b) 32 c) 16 d) 8
a) 1 b) 0 c) –1 d) 2
P.T.O.
SLR-TX – 313 -2- *SLRTX313*
11) GLB is called as
a) Join b) Supermum
¬
_____________

Set Q
*SLRTX313* -3- SLR-TX – 313
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

(p ∨ q) ^ ( p ^ ( p ^ q)) < = > ( p ^ q).
¬

a) (A – C) ∩ (C – B) = Φ b) A + A = Φ.
a) ( p → r) ^ (q ↔ p) b) p → (p ^ (q → p))
¬
matrices of :
a) R–1 b) R o R = R2

c) R2 o R = R3 d) R o R–1. (1�8=8)
MR = 1 0 1
1 1 0
1 1 1
Set Q
SLR-TX – 313 -4- *SLRTX313*
SECTION – II

a)
b)

a) X1 * X2
b) X1 ⊕ X2.
F = x′y′z + x′yz′ + xy′z′ :
a) Circuit diagram
b) Truth table
c) K-Map
d) Cube.
_____________
Set Q
Seat
No.
Set R

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

¬
f : X → Y.
a) 2 b) 32 c) 16 d) 8
P.T.O.
SLR-TX – 313 -2- *SLRTX313*
a) 1 b) 0 c) –1 d) 2
14) GLB is called as
a) Join b) Supermum
_____________

Set R
*SLRTX313* -3- SLR-TX – 313
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

(p ∨ q) ^ ( p ^ ( p ^ q)) < = > ( p ^ q).
¬

a) (A – C) ∩ (C – B) = Φ b) A + A = Φ.
a) ( p → r) ^ (q ↔ p) b) p → (p ^ (q → p))
¬
matrices of :
a) R–1 b) R o R = R2

c) R2 o R = R3 d) R o R–1. (1�8=8)
MR = 1 0 1
1 1 0
1 1 1
Set R
SLR-TX – 313 -4- *SLRTX313*
SECTION – II

a)
b)

a) X1 * X2
b) X1 ⊕ X2.
F = x′y′z + x′yz′ + xy′z′ :
a) Circuit diagram
b) Truth table
c) K-Map
d) Cube.
_____________
Set R
Seat
No.
Set S

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) 1 b) 0 c) –1 d) 2
a) True b) False
c) Only {↑} d) Only {↓}
a) g is into b) g is onto
c) g is bijective d) both b) and c)
P.T.O.
SLR-TX – 313 -2- *SLRTX313*
9) GLB is called as
a) Join b) Supermum
¬
f : X → Y.
a) 2 b) 32 c) 16 d) 8
_____________

Set S
*SLRTX313* -3- SLR-TX – 313
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

(p ∨ q) ^ ( p ^ ( p ^ q)) < = > ( p ^ q).
¬

a) (A – C) ∩ (C – B) = Φ b) A + A = Φ.
a) ( p → r) ^ (q ↔ p) b) p → (p ^ (q → p))
¬
matrices of :
a) R–1 b) R o R = R2

c) R2 o R = R3 d) R o R–1. (1�8=8)
MR = 1 0 1
1 1 0
1 1 1
Set S
SLR-TX – 313 -4- *SLRTX313*
SECTION – II

a)
b)

a) X1 * X2
b) X1 ⊕ X2.
F = x′y′z + x′yz′ + xy′z′ :
a) Circuit diagram
b) Truth table
c) K-Map
d) Cube.
_____________
Set S
Seat
Set P
No.
Data Communication
Day and Date : Saturday, 8-12-2018 , -2018 Total Marks : 70

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
Instructions : 1) Q. No. 1 is compulsory. It should be solved in first

carries one mark.
Top of Page.
3) All questions are compulsory.
4) Figures to the right indicate full marks.
1. Choose the correct answer :

1) The signal which uses more than two signal levels for encoding is
a) Multilevel binary b) NRZ c) Biphase d) None of these
2) In __________ encoding, there is a transition at the middle of each bit period.
a) NRZ – I b) NRZ – L c) AMI d) Manchester
3) __________ is a least expensive guided transmission medium.
a) Fiber optic b) Twisted pair
c) Co-axial cable d) None of these
4) It is upto the ___________ layer to detect, and if necessary correct errors.
a) Application b) Session c) Data Link d) Physical
5) A network provides _________ by having alternative sources of supply.
a) High reliability b) Scalability
c) Money d) None of these
P.T.O.
SLR-TX – 314 -2- *SLRTX314*
6) An n-bit unit containing data and checkbits is often referred as
a) Word b) Parity
c) Codeword d) Checksum
7) Protocol in which the sender sends one frame and then waits for an
acknowledgement before proceeding is called as __________ protocol.
a) IP b) Sliding window
c) Stop-and-wait d) None of these
8) In ____________ protocols, the channel efficiency improves as the load
increases.
a) Contension b) Collision free
c) Both a and b d) None of these
9) Protocols in which station listens for a carrier and act accordingly are called
_________ protocols.
c) ALOHA d) Carrier sense
10) __________ is used to synchronize receiver’s clock with sender.
a) Start of frame b) Type
c) Preamble d) Pad
11) In 802.3 cabling 10 Base F, F stands for
a) Frequency b) Frame
c) Flexibility d) Fiber optics
12) Preamble field of IEEE std. 802.3 contains a bit pattern
a) 10101010 b) 11110000
c) 11001100 d) 00001111
13) ____________ packets are the warning packets to reduce the transmission
rate and traffic.
a) Warning b) Datagram
c) VC d) Choke
14) ___________ algorithms, change their routing decisions to reflect changes
in the topology or traffic.
a) Non adaptive b) Static
c) Adaptive d) None of these
____________
Set P
*SLRTX314* -3- SLR-TX – 314
Seat
No.
Data Communication
Day and Date : Saturday, 8-12-2018, -2018 Marks : 56

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

SECTION – I
2. Write answer to any four questions (4 marks for each). 16

A) Describe physical description and list the applications of coaxial cable.
B) What is PAN, LAN, MAN and WAN ?
C) What is the relationship between a service and a protocol ?
D) Write a short note on ‘‘Physical layer coding violations’’ framing method.
E) Describe the unacknowledged connectionless service provided by DLL to
Network Layer.
3. Write answer to any one question. 6

A) What is channel capacity ? Explain Nyquist bandwidth and Shannons
capacity.
B) Explain unrestricted simplex protocol.
4. Describe TCP/IP reference model. 6
SECTION – II

A) Briefly describe 1-persistent CSMA and nonpersistent CSMA.
B) Briefly describe the pure ALOHA and slotted ALOHA protocols for
controlling the multiple access to a communication medium. What are
their throughput per frame time ?
Set P
SLR-TX – 314 -4- *SLRTX314*
C) In which TCP/IP communication layer Router, Bridge, Switch, Repeater
devices operate ?
D) What is flooding of IP packets in WAN ? Briefly describe the techniques
to damp the IP packet flooding process.
E) What is tunneling of IP packets in Internet working ?

A) Explain the distance vector routing with suitable network example.
B) Explain basic bit-map collision-free protocol.
7. Describe IEEE 802.6 standard (DQDB). 6

________________
Set P
Seat
Set Q
No.
Data Communication

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

increases.
c) Preamble d) Pad
P.T.O.
SLR-TX – 314 -2- *SLRTX314*
a) 10101010 b) 11110000
c) 11001100 d) 00001111
rate and traffic.
c) VC d) Choke
a) Word b) Parity
___________
Set Q
*SLRTX314* -3- SLR-TX – 314
Seat
No.
Data Communication

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

SECTION – I

Network Layer.

capacity.
SECTION – II

Set Q
SLR-TX – 314 -4- *SLRTX314*
devices operate ?


________________
Set Q
Seat
Set R
No.
Data Communication

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

a) Word b) Parity
increases.
P.T.O.
SLR-TX – 314 -2- *SLRTX314*
c) Preamble d) Pad
a) 10101010 b) 11110000
c) 11001100 d) 00001111
rate and traffic.
c) VC d) Choke
____________

Set R
*SLRTX314* -3- SLR-TX – 314
Seat
No.
Data Communication

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

SECTION – I

Network Layer.

capacity.
SECTION – II

Set R
SLR-TX – 314 -4- *SLRTX314*
devices operate ?


________________
Set R
Seat
Set S
No.
Data Communication

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

c) Preamble d) Pad
a) 10101010 b) 11110000
c) 11001100 d) 00001111
rate and traffic.
c) VC d) Choke
P.T.O.
SLR-TX – 314 -2- *SLRTX314*
a) Word b) Parity
increases.
____________ Set S

*SLRTX314* -3- SLR-TX – 314
Seat
No.
Data Communication

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.

SECTION – I

Network Layer.

capacity.
SECTION – II

Set S
SLR-TX – 314 -4- *SLRTX314*
devices operate ?


________________
Set S

Seat
No. Set P
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

1. Choose the correct answer : (14×1=14)

1) Convert decimal 64 to binary
a) 01010010 b) 01000000 c) 00110110 d) 01001000
2) Which of the following Boolean Algebra rule is correct ?
a) A.Ā = 1 b) A + AB = A + B
c) A + ĀB = A + B d) A(A + B) = B
3) When using even parity, where is the parity bit placed ?
a) Before the MSB b) After the LSB
c) In the parity word d) After the odd parity bit
4) A device which converts BCD to seven segment is called
a) Encoder b) Decoder c) Multiplexer d) Demultiplexer
5) In a 4 variable K-map, the function contains all minterms then the minimal
a) A b) 1 c) 0 d) Don’t care
6) The term in standard POS form are known as
a) Maxterm b) Minterm c) Don’t care d) None
7) Which IC is used as an universal Gate ?
a) IC7408 b) IC7432 c) IC7404 d) IC7400
8) A SR latch can be implemented by using
a) AND, OR b) NAND, NOR c) NAND, XOR d) NOT, XOR
P.T.O.
SLR-TX – 315 -2- *SLRTX315*
9) A counter with 10 state is known as
a) Cascading asynchronous counter b) Asynchronous ripple counter
c) Decade counter d) Ripple counter
10) This type of register accepts input data serially
a) PIPO b) SIPO c) PISO d) SISO
11) The bitwise NOT is represented by symbol
a) ~ b) & c) | d) ^
12) Verilog is an IEEE standard
a) IEEE 1346 b) IEEE 1364 c) IEEE 1394 d) IEEE 1349
13) Identify port in a verilog.
a) Input b) All c) Output d) Inout
14) The symbol used for multiple comment
a) */*/ b) //
c) /**/ d) None of above
______________
Set P
*SLRTX315* -3- SLR-TX – 315
Seat
No.

Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

2) Figures to right indicate full marks
SECTION – I
2. Attempt any one : 8

1) Write a short note on Number System with example.
2) Design and explain driver for 7 segment display using IC 7447.
3. Attempt any two : 10

1) Minimize the following logic function using K-map and realize it using the
basic gates
F(A, B, C, D) = ∑m (0, 1, 2, 3, 4, 5, 13, 15) + d (8, 9, 10, 11)
2) Perform the addition using 2’s complement of the following number.
a) 28 + 23
b) – 28 + 23
c) 23 – 48
3) Obtain 1 : 8 demux using 1 : 2 demux.

1) What is Universal gate concept ? Implement basic gates using NAND gate.
2) Write a short note on IC74151.
3) Explain Full subtractor using K-Map.
Set P
SLR-TX – 315 -4- *SLRTX315*
SECTION – II
5. Attempt any one : (8×1=8)

1) What is flip flop ? Draw and explain how to construct SR flip flop, D flip flop
from JK flip flop.
2) Write a HDL code for half subtractor and full subtractor.
6. Attempt any two : (5×2=10)

1) Design up down counter.
2) Write a verilog code for D and T flip flop.
3) What is verilog HDL ?

1) What is Module and write a program for counter.
2) Explain synchronous mod 5 counter.
3) Write a HDL code for 4 : 1 multiplexer.
_____________________
Set P

Seat
No. Set Q
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


a) ~ b) & c) | d) ^
a) */*/ b) //
a) 01010010 b) 01000000 c) 00110110 d) 01001000
P.T.O.
SLR-TX – 315 -2- *SLRTX315*
a) A.Ā = 1 b) A + AB = A + B
c) A + ĀB = A + B d) A(A + B) = B
a) IC7408 b) IC7432 c) IC7404 d) IC7400
______________
Set Q
*SLRTX315* -3- SLR-TX – 315
Seat
No.

Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I


basic gates
F(A, B, C, D) = ∑m (0, 1, 2, 3, 4, 5, 13, 15) + d (8, 9, 10, 11)
a) 28 + 23
b) – 28 + 23
c) 23 – 48

Set Q
SLR-TX – 315 -4- *SLRTX315*
SECTION – II

from JK flip flop.


_____________________
Set Q

Seat
No. Set R
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


a) IC7408 b) IC7432 c) IC7404 d) IC7400
a) ~ b) & c) | d) ^
P.T.O.
SLR-TX – 315 -2- *SLRTX315*
a) */*/ b) //
a) 01010010 b) 01000000 c) 00110110 d) 01001000
a) A.Ā = 1 b) A + AB = A + B
c) A + ĀB = A + B d) A(A + B) = B
______________
Set R
*SLRTX315* -3- SLR-TX – 315
Seat
No.

Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I


basic gates
F(A, B, C, D) = ∑m (0, 1, 2, 3, 4, 5, 13, 15) + d (8, 9, 10, 11)
a) 28 + 23
b) – 28 + 23
c) 23 – 48

Set R
SLR-TX – 315 -4- *SLRTX315*
SECTION – II

from JK flip flop.


_____________________
Set R

Seat
No. Set S
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


a) ~ b) & c) | d) ^
a) */*/ b) //
a) 01010010 b) 01000000 c) 00110110 d) 01001000
a) A.Ā = 1 b) A + AB = A + B
c) A + ĀB = A + B d) A(A + B) = B
P.T.O.
SLR-TX – 315 -2- *SLRTX315*
a) IC7408 b) IC7432 c) IC7404 d) IC7400
______________
Set S
*SLRTX315* -3- SLR-TX – 315
Seat
No.

Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I


basic gates
F(A, B, C, D) = ∑m (0, 1, 2, 3, 4, 5, 13, 15) + d (8, 9, 10, 11)
a) 28 + 23
b) – 28 + 23
c) 23 – 48

Set S
SLR-TX – 315 -4- *SLRTX315*
SECTION – II

from JK flip flop.


_____________________
Set S
Seat
No.

Set P
Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

30 minutes in Answer book Page No. 3. Each question
carries one mark.
2) Answer MCQ/Objective type questions on Page No.
3 only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on
Top of Page.

1) Picture definition is stored in the memory are called __________
a) Frame buffer b) Available frame
c) Scan buffer d) All above
2) The maximum number of points that can be displayed without overlap on
a CRT is ___________
a) Frame buffer b) Aspect ratio
c) Resolution d) None of above
3) A simple seed fill algorithm for a boundary-defined region can be developed
using
a) Queue b) Stack
c) List d) None of above
4) Inbresenham’s integer algorithm the speed of the algorithm is increase by
using integer arithmetic. Because only the sign of error term is important.
a) True b) False
c) Can’t say d) None of above
P.T.O.
SLR-TX – 316 -2- *SLRTX316*
5) The diagonal terms of the general 4×4 transformation matrix produced

__________ in 3D.
a) Translation b) Scaling c) Reflection d) All above
6) ___________ results in the distortion of shape of object.
a) Translation b) Scaling c) Reflection d) Shearing
7) Rotation of an object other than origin point is possible with the help of
Rotation about an arbitrary point method.
a) True b) False c) Can’t say d) None of above
8) __________ operation removes segment from refreshing cycle.
a) Post b) Unpost c) Delete d) Undo
9) Dynamic graphics demands for __________
a) speed regeneration b) selective modification
c) both a) and b) d) none of the above
10) ___________ is unit of display file.
a) Segment b) Pixel
c) File unit d) None of the above
11) Z buffer initializes frame buffer values to ___________
a) Background value b) Minimum z value
c) 0 d) 1
12) Warnock algorithm uses ___________
a) Greedy method b) Dynamic programming
c) Brute force algorithm d) Divide and conquer method
13) Curve is represented as a collection of a _____________
a) Edges b) Points
c) Vertex d) None of the above
14) If curve passes through all control points then its ___________
a) Interpolation b) Intrapolation
c) Entrepolation d) None of the above
_____________________
Set P
*SLRTX316* -3- SLR-TX – 316
Seat
No.

Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.
N.B. : 1) All questions are compulsory.
SECTION – I
2. Attempt any three : (3×4=12)

A) Describe and compare between Raster Scan Display and Random Scan
Display.
B) Explain DDA line drawing algorithm.
C) Explain the seed fill algorithm.
D) Describe 2D reflection with diagram.
3. Describe Bresenham’s circle generation algorithm in detail. 8

OR
List the 3D transformation matrices for : 3D rotation, 3D reflection and 3D scaling.
Perform 3D translation of unit cube in xyz direction with –2, –4 and –6
respectively. 8
4. Describe color CRT monitor with the help of shadow-mask CRT. Draw
appropriate diagram for the same. 8
SECTION – II
5. Attempt any 3 : 12
a) Describe posting and unposting a segment function with example.
b) What is need of viewing transformation ? Explain.
c) State advantages and disadvantages of Z-Buffer.
d) Explain antialasing and effects of aliasing.
e) Describe curve representation in detail.
6. Explain region code algorithm with region code representation. 8

OR
Describe in detail B-spline curves. 8
7. Explain Warnock algorithm with quadtree structure. 8

_____________________
Set P
SLR-TX – 316 -4- *SLRTX316*
Set P
Seat
No.

Set Q
Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) Segment b) Pixel
c) 0 d) 1
a) Edges b) Points
P.T.O.
SLR-TX – 316 -2- *SLRTX316*

a CRT is ___________
using
a) Queue b) Stack
a) True b) False
__________ in 3D.
_____________________
Set Q
*SLRTX316* -3- SLR-TX – 316
Seat
No.

Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

Display.

OR
respectively. 8
SECTION – II

OR

_____________________
Set Q
SLR-TX – 316 -4- *SLRTX316*
Set Q
Seat
No.

Set R
Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

__________ in 3D.
a) Segment b) Pixel
P.T.O.
SLR-TX – 316 -2- *SLRTX316*

c) 0 d) 1
a) Edges b) Points
a CRT is ___________
using
a) Queue b) Stack
a) True b) False
_____________________
Set R
*SLRTX316* -3- SLR-TX – 316
Seat
No.

Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

Display.

OR
respectively. 8
SECTION – II

OR

_____________________
Set R
SLR-TX – 316 -4- *SLRTX316*
Set R
Seat
No.

Set S
Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) Segment b) Pixel
c) 0 d) 1
a) Edges b) Points
P.T.O.
SLR-TX – 316 -2- *SLRTX316*

a CRT is ___________
using
a) Queue b) Stack
a) True b) False
__________ in 3D.
_____________________
Set S
*SLRTX316* -3- SLR-TX – 316
Seat
No.

Computer Graphics
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

Display.

OR
respectively. 8
SECTION – II

OR

_____________________
Set S
SLR-TX – 316 -4- *SLRTX316*
Set S
Seat
No.
Set P
S.E. (CSE) (Part – I) (Old CGPA) Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.
1. Choose the correct alternative : 14

1
1) cos ax is equal to _______________
D + a2
2
x x x
a) x cos ax b) cos ax c) sin ax d) sin ax
2a 2
2a 2a 2
2a

2) The complete solution of (D4 – 2D3 + D2) y = 0 if y = ______________
a) C1 + C2x + C3x2e–x b) C1 + C2x + (C3 + C4x)ex
c) (C1 + C2x)e–x+(C3+ C4x) ex d) (C1 + C2x + C3x2)e–x
3) The Laplace transform of e–2t + sin2t is
1 2 1 2 1 2 1 1
a) + 2 b) + 2 c) + 2 d) + 2
s−2 s +4 s+2 s −4 s+2 s +4 s+2 s +4

 s + s2 
4) The L−1  3  = ________________
 s 
a) t + t2 b) t + 1 c) t2 + 1 d) t – 1
5) If z{f(k)} = F(z), then z{kf(k)} =
dF ( z ) dF ( z ) dF ( z ) − dF ( z )
a) − z b) z c) d)
dz dz dz dz

P.T.O.
SLR-TX – 317 -2- *SLRTX317*
6) Fourier series of f(x) = 1 – x2 in (– π, π) contains
a) Only sine series b) Only cosine series
c) Both sine and cosine series d) None of these
7) Which of the following functions cannot be expanded in Fourier series in the interval (– d,d) ?
a) ex b) |x| c) cosec x d) x2
8) The magnitude of maximum directional derivative of ϕ = x2yz3 at the point (2, 1, – 1) is
a) 4 11 b) 44 c) 4 d) 40
9) If r = xi + yj + zk and r = r , then the grad r is,
a) r b) r c) r d) 0
r
10) For binomial distribution mean is 12, variance is 4, then the values of n, p, q are respectively
1 2 2 1 2 1
a) 9, , b) 9, , c) 4, 1 , 1 d) 18, ,
3 3 3 3 2 2 3 3

11) If x is Poisson variate such that p(x = 1) = p(x = 2), then the value of Poisson’s parameter is
a) 0 b) 1 c) 2 d) 3
12) For a certain data, the regression equations are 3x + 2y – 26 = 0 and 6x + y – 31 = 0, then
the coefficient of correlation ‘r’ is
a) 0.5 b) – 0.5 c) 2 d) – 2
13) The normal equations of the curve, y = ax + b are
a) ∑y = na + b∑x, ∑xy = a∑x + b∑x2
b) ∑y = na + b∑x, ∑(x + y) = a∑x + b∑x2
c) ∑y = a∑x + nb, ∑xy = a∑x2 + b∑x
d) ∑y = a∑x + nb, ∑(x + y) = a∑x2 + b∑x
14) The fraction of time the system is busy is
λ µ λ µ
a) b) c) d)
µ λ µ 2
λ2

____________

Set P
*SLRTX317* -3- SLR-TX – 317
Seat
No.
Time : 10.00 a.m. to 1.00 p.m.
N.B. : 1) Q. No. 2 and 8 are compulsory and attempt any two

questions from remaining questions of each Section.
3) Use of calculator is allowed.
SECTION – I
2. a) Solve (D2 + 2D + 1) y = e–xsinx. 3

b) Solve (D4 + 8D2 + 16)y = cosh2x. 3
c) Solve (D3 + 8)y = x4 + 2x+1. 4
OR
x 2
c) Solve y ′′ − y = e (1 + x ) . 4

∞
cos 6t − cos 4 t
a) Evaluate ∫ t
dt , by Laplace transform.
0
b) Find L{e3tsin5tsin3t}.

−1  s + 2 

c) Find L  2 .
 s ( s + 3 ) 

  s
d) Find L−1 Cot −1    .
  a
4. a) Find z{c cosαk}, k ≥ 0 where α is real.
k
3
4 , for k < 0

k
b) Find z{f(k)} , where f(k) =  . 3
k
3 , for k ≥ 0
 1 
−1 
c) Find z  3
, z < 5 . 3
 ( z − 5) 
5. a) Find the Fourier series for the function f(x) = ex in the interval (–π, π). 5
b) Find the Half-range cosine series for the function f(x) = C – x in (0, C). 4
Set P
SLR-TX – 317 -4- *SLRTX317*
SECTION – II
6. Attempt the following :
a) Prove that ∇ ⋅  r∇  = .
1 3
3
 r  r4
3
b) Find the unit tangent vector at any point on the curve, x = t2 + 2, y = 4t – 5, z = 2t2 – 6t
where ‘t’ is any variable. Also determine the unit tangent vector at the point t = 2. 3
c) Find directional derivative of ϕ = x2yz + 4xz2 at (1, – 2, – 1) in the direction of 2i – j – 2k. 3

a) The equations to the two lines of regression are 6y = 5x + 90 and 15x = 8y + 130. Find
the means of x and y and the coefficient of correlation. 3
b) In a room, there are three lamp-sockets. A bag contains 6 working and 4 non-working
bulbs. Three bulbs are selected at random and fitted in the sockets. Find the
probability that there will be some light in the room. 3
c) The income distribution of workers in a certain factory was found to be normal with
mean of ₹ 500 and standard deviation of ₹ 50. There were 228 persons above ₹ 600.
How many persons were there in all ? [Given : for SNV z area from z = 0 to z = 2 is
0.4772). 3

a) In sampling, a large number of parts manufactured by a machine, the number of
defectives in sample of 40 is 2. Out of 1000 such samples how many would be
expected to contain 3 defective parts. 3
b) Fit a straight line to the following data :
x : 1 2 3 4 6 8
y : 2.4 3 3.4 4 5 6 3
c) Find the equations of the lines of regression from the following data. Find also the best
estimate of y when x = 13.
x : 2 4 6 8 12 14
y : 4 2 5 10 11 12 4

a) There are three computers in a shop and three operators. Each operator on an
average can send 10 messages per hour by e-mail. If messages arrive for being
e-mailed at the rate of 25 per hour. 5
i) What is the probability that all the computers are busy ?
ii) What is the average number of messages waiting to be sent ?
b) Customers arrive at a clinic according to a Poisson process with mean interval of
25 min., the physician needs on an average 20 min. for a patient to examine. 4
i) Find the excepted number of patients at the clinic and in the queue.
ii) Find percentage of patients who are not required to wait.
Set P
___________________
Seat
No.
Set Q

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) 4 11 b) 44 c) 4 d) 40
a) r b) r c) r d) 0
r
1 2 2 1
a) 9, , b) 9, ,
3 3 3 3
2 1
c) 4, 1 , 1 d) 18, ,
2 2 3 3

a) 0 b) 1 c) 2 d) 3
a) 0.5 b) – 0.5
c) 2 d) – 2
P.T.O.
SLR-TX – 317 -2- *SLRTX317*
a) ∑y = na + b∑x, ∑xy = a∑x + b∑x2
b) ∑y = na + b∑x, ∑(x + y) = a∑x + b∑x2
c) ∑y = a∑x + nb, ∑xy = a∑x2 + b∑x
d) ∑y = a∑x + nb, ∑(x + y) = a∑x2 + b∑x
λ µ λ µ
a) b) c) d)
µ λ µ 2
λ2
1
8) cos ax is equal to _______________
D + a2
2
x x x
2a 2
2a 2a 2
2a

1 2 1 2 1 2 1 1
a) + 2 b) + 2 c) + 2 d) + 2
s−2 s +4 s+2 s −4 s+2 s +4 s+2 s +4

 s + s2 
11) The L−1  3  = ________________
 s 

a) t + t2 b) t + 1 c) t2 + 1 d) t – 1
dF ( z ) dF ( z ) dF ( z ) − dF ( z )
a) − z b) z c) d)
dz dz dz dz


____________

Set Q
*SLRTX317* -3- SLR-TX – 317
Seat
No.
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

b) Solve (D4 + 8D2 + 16)y = cosh2x. 3
c) Solve (D3 + 8)y = x4 + 2x+1. 4
OR
x 2
c) Solve y ′′ − y = e (1 + x ) . 4

∞
cos 6t − cos 4 t
a) Evaluate ∫ t
0

−1  s + 2 

c) Find L  2 .
 s ( s + 3 ) 

  s
d) Find L−1 Cot −1    .
  a
k
3
4 , for k < 0

k
k
3 , for k ≥ 0
 1 
−1 
c) Find z  3
, z < 5 . 3
 ( z − 5) 
Set Q
SLR-TX – 317 -4- *SLRTX317*
SECTION – II
a) Prove that ∇ ⋅  r∇  = .
1 3
3
 r  r4
3

0.4772). 3

x : 1 2 3 4 6 8
y : 2.4 3 3.4 4 5 6 3
x : 2 4 6 8 12 14
y : 4 2 5 10 11 12 4

Set Q
___________________
Seat
No.
Set R

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

dF ( z ) dF ( z ) dF ( z ) − dF ( z )
a) − z b) z c) d)
dz dz dz dz

a) 4 11 b) 44 c) 4 d) 40
a) r b) r c) r d) 0
r
1 2 2 1 2 1
a) 9, , b) 9, , c) 4, 1 , 1 d) 18, ,
3 3 3 3 2 2 3 3

P.T.O.
SLR-TX – 317 -2- *SLRTX317*
a) 0 b) 1 c) 2 d) 3
a) 0.5 b) – 0.5 c) 2 d) – 2
a) ∑y = na + b∑x, ∑xy = a∑x + b∑x2
b) ∑y = na + b∑x, ∑(x + y) = a∑x + b∑x2
c) ∑y = a∑x + nb, ∑xy = a∑x2 + b∑x
d) ∑y = a∑x + nb, ∑(x + y) = a∑x2 + b∑x
λ µ λ µ
a) b) c) d)
µ λ µ 2
λ2
1
11) cos ax is equal to _______________
D + a2
2
x x x
2a 2
2a 2a 2
2a

1 2 1 2 1 2 1 1
a) + 2 b) + 2 c) + 2 d) +
s−2 s +4 s+2 s −4 s+2 s +4 s + 2 s2 + 4

 s + s2 
14) The L−1  3  = ________________
 s 
a) t + t2 b) t + 1 c) t2 + 1 d) t – 1

____________

Set R
*SLRTX317* -3- SLR-TX – 317
Seat
No.
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

b) Solve (D4 + 8D2 + 16)y = cosh2x. 3
c) Solve (D3 + 8)y = x4 + 2x+1. 4
OR
x 2
c) Solve y ′′ − y = e (1 + x ) . 4

∞
cos 6t − cos 4 t
a) Evaluate ∫ t
0

−1  s + 2 

c) Find L  2 .
 s ( s + 3 ) 

  s
d) Find L−1 Cot −1    .
  a
k
3
4 , for k < 0

k
k
3 , for k ≥ 0
 1 
−1 
c) Find z  3
, z < 5 . 3
 ( z − 5) 
Set R
SLR-TX – 317 -4- *SLRTX317*
SECTION – II
a) Prove that ∇ ⋅  r∇  = .
1 3
3
 r  r4
3

0.4772). 3

x : 1 2 3 4 6 8
y : 2.4 3 3.4 4 5 6 3
x : 2 4 6 8 12 14
y : 4 2 5 10 11 12 4

Set R
___________________
Seat
No.
Set S

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

1 2 2 1 2 1
a) 9, , b) 9, , c) 4, 1 , 1 d) 18, ,
3 3 3 3 2 2 3 3

a) 0 b) 1 c) 2 d) 3
a) 0.5 b) – 0.5 c) 2 d) – 2
a) ∑y = na + b∑x, ∑xy = a∑x + b∑x2
b) ∑y = na + b∑x, ∑(x + y) = a∑x + b∑x2
c) ∑y = a∑x + nb, ∑xy = a∑x2 + b∑x
d) ∑y = a∑x + nb, ∑(x + y) = a∑x2 + b∑x
λ µ λ µ
a) b) c) d)
µ λ µ 2
λ2
P.T.O.
SLR-TX – 317 -2- *SLRTX317*
1
6) cos ax is equal to _______________
D + a2
2
x x x
2a 2
2a 2a 2
2a

1 2 1 2 1 2 1 1
a) + b) + c) + d) + 2
s − 2 s2 + 4 s + 2 s2 − 4 s + 2 s2 + 4 s+2 s +4

 s + s2 
9) The L−1  3  = ________________
 s 

a) t + t2 b) t + 1 c) t2 + 1 d) t – 1
dF ( z ) dF ( z ) dF ( z ) − dF ( z )
a) − z b) z c) d)
dz dz dz dz

a) 4 11 b) 44 c) 4 d) 40
a) r b) r c) r d) 0
r

____________

Set S
*SLRTX317* -3- SLR-TX – 317
Seat
No.
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

b) Solve (D4 + 8D2 + 16)y = cosh2x. 3
c) Solve (D3 + 8)y = x4 + 2x+1. 4
OR
x 2
c) Solve y ′′ − y = e (1 + x ) . 4

∞
cos 6t − cos 4 t
a) Evaluate ∫ t
0

−1  s + 2 

c) Find L  2 .
 s ( s + 3 ) 

  s
d) Find L−1 Cot −1    .
  a
k
3
4 , for k < 0

k
k
3 , for k ≥ 0
 1 
−1 
c) Find z  3
, z < 5 . 3
 ( z − 5) 
Set S
SLR-TX – 317 -4- *SLRTX317*
SECTION – II
a) Prove that ∇ ⋅  r∇  = .
1 3
3
 r  r4
3

0.4772). 3

x : 1 2 3 4 6 8
y : 2.4 3 3.4 4 5 6 3
x : 2 4 6 8 12 14
y : 4 2 5 10 11 12 4

Set S
___________________
Seat
No.
Set P
S.E. (Computer Science and Engineering) (Part – I) (Old CGPA)
Examination, 2018
discrete mathematical structures
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top
of Page.
4) Assume suitable data if necessary.



1) If set has 3 elements the number of possible proper subsets are
a) 8 b) 7 c) 3 d) 9
2) Which of the following are symmetric ?
a) R : x + y = 10 b) R : x + 4y = 10
c) R : x is greater than y d) None of the above
3) ¬ (P ∨ ¬ Q) is equivalent to
a) P ∧ ¬ Q b) ¬ P ∧ Q c) ¬ P ∨ Q d) P ∨ Q
a) ¬ (P ∨ P) b) ¬ P ∧ ¬ P
c) ¬ P d) All of the above
5) If f : X → Y, the codomain of a function is
a) X b) Subset of X c) Y d) Subset of Y
6) < I, + > is the given algebraic system where I = { 0, 1, 2, 3, 4} < I, + > is
a) Group b) Semigroup c) Monoid d) None of these
7) Permutation is _______________ mapping.
a) One to one b) One to one and onto
c) Onto d) None of the above
P.T.O.
SLR-TX – 318 -2- *SLRTX318*
8) Hasse diagrams are drawn for
a) POSET b) Boolean algebra
c) Lattice d) For all
9) In lattice L, GLB {a, b} is denoted by
a) a + b b) a * b
c) a < b d) none of the above
10) If < G, * > is a group and order of the group is 1 then G set is
a) ∅ b) {e}
c) {∅} d) {e, a}
11) If f : X → Y and g : Y → X then g will be called as inverse of f if
a) f • g = Ix and g • f = Iy b) g • f = Ix and f • g = Ix
c) g • f = Ix and f • g = Iy d) f • g = Iy and g • f = Iy
12) If A = ∅ and B = {a, b, c}, then the value of A × B is
a) {∅} b) ∅
c) {<a, a>, <b, b>, <c,c>} d) None of the above
13) [a] = R (a) = {x ∈ A | aRx } is called
a) Symmetric class b) Antisymmetric class
c) Equivalence class d) Irreflexive class
14) The disjunctive normal form of P ∧ (P → Q) is
a) (P ∨ ¬ P) ∧ (P ∧ Q) b) (P ∨ ¬ P) ∧ (P ∨ Q)
c) P ∧ Q d) (P ∧ ¬ P) ∨ (P ∧ Q)
_________________
Set P
*SLRTX318* -3- SLR-TX – 318
Seat
No.


Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.

3) Assume suitable data if necessary
SECTION – I
2. Solve any three : (3×4=12)

a) Explain with example matrix and graph representation of relation.
b) Convert the given formula into prefix and suffix form :
A ∨ (¬ B → C) ∧ (D ↔ E).
c) Define maxtermand PCNF and obtain PCNF (P ∧ Q) ∨ (¬ P ∧ R).
d) Draw Hasse diagram of partial ordering such that set with
{<A, B>| A subset of B} on the power set of S = {a, b}.
e) Define Tautological Implication and solve (P ∧ Q) => (P → Q).
3. Solve any one : 8

a) Let A be the set of factors of a particular positive integer m and let ≤ be a
relation ‘divides’ i.e. ≤ = { < x, y> | x∈A ∧ y∈A ∧ (x divides y)}. Write partial
order relation ‘divides’ and draw Hasse diagram for each example.
1) m = 45 2) m = 30 3) m = 28 4) m = 12
b) Explain the following terms :
1) Tautology and contradiction
2) Atomic statement and compound statement
3) Power set
4) Set inclusion and equality of sets.
Set P
SLR-TX – 318 -4- *SLRTX318*
4. Solve the following : 8

a) Obtain PDNF of (P ∧ Q) ∨ (¬ P ∧ R) ∨ (Q ∧ R) without constructing truth table.
b) Obtain PCNF of (P ∧ Q) ∨ (¬ P ∧ R) without constructing truth table.
SECTION – II

a) Explain with example semigroup and monoid.
b) Define lattice as an algebraic system and explain meet and join
operations.
c) Show that functions f(x) = x3 and g(x) = x1/3 for x ∈ R are inverse of each
other.
d) Let S be a nonempty set and P(S) be its power set. Show that the algebra
<P(S), ∩> is a monoid.
e) Show that identity element in a group is unique.
6. Solve any one :

a) Explain the following terms : 8
1) Complemented lattice.
2) Distributive lattice.
3) Lattice homomorphism.
4) Sub Boolean algebra.
b) Consider the algebraic system <G, *> where G is the set of all non-zero real
numbers and * is the binary operation defined by a * b = ab/4. Show that
<G, *> is an Abelian group.
7. Let L = {0, 1} and lattice <L, ≤ > is given as follows 8
0
1
Draw following lattices.
a) <L2, ≤2> b) <L3, ≤3>.
_____________________
Set P
Seat
No.
Set Q
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.



a) a + b b) a * b
a) ∅ b) {e}
c) {∅} d) {e, a}
P.T.O.
SLR-TX – 318 -2- *SLRTX318*
a) {∅} b) ∅
a) (P ∨ ¬ P) ∧ (P ∧ Q) b) (P ∨ ¬ P) ∧ (P ∨ Q)
c) P ∧ Q d) (P ∧ ¬ P) ∨ (P ∧ Q)
a) 8 b) 7 c) 3 d) 9
a) R : x + y = 10 b) R : x + 4y = 10
a) P ∧ ¬ Q b) ¬ P ∧ Q c) ¬ P ∨ Q d) P ∨ Q
a) ¬ (P ∨ P) b) ¬ P ∧ ¬ P
_________________
Set Q
*SLRTX318* -3- SLR-TX – 318
Seat
No.


Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

A ∨ (¬ B → C) ∧ (D ↔ E).

1) m = 45 2) m = 30 3) m = 28 4) m = 12
3) Power set
Set Q
SLR-TX – 318 -4- *SLRTX318*

SECTION – II

operations.
other.
6. Solve any one :

a) Explain the following terms 8
7. Let L = {0, 1} and lattice <L, ≤ > is given as follows : 8
0
1
a) <L2, ≤2> b) <L3, ≤3>.
_____________________
Set Q
Seat
No.
Set R
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.



a) a + b b) a * b
a) ∅ b) {e}
c) {∅} d) {e, a}
P.T.O.
SLR-TX – 318 -2- *SLRTX318*
a) {∅} b) ∅
a) (P ∨ ¬ P) ∧ (P ∧ Q) b) (P ∨ ¬ P) ∧ (P ∨ Q)
c) P ∧ Q d) (P ∧ ¬ P) ∨ (P ∧ Q)
a) 8 b) 7 c) 3 d) 9
a) R : x + y = 10 b) R : x + 4y = 10
a) P ∧ ¬ Q b) ¬ P ∧ Q c) ¬ P ∨ Q d) P ∨ Q
a) ¬ (P ∨ P) b) ¬ P ∧ ¬ P
_________________
Set R
*SLRTX318* -3- SLR-TX – 318
Seat
No.


Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

A ∨ (¬ B → C) ∧ (D ↔ E).

1) m = 45 2) m = 30 3) m = 28 4) m = 12
3) Power set
Set R
SLR-TX – 318 -4- *SLRTX318*

SECTION – II

operations.
other.
6. Solve any one :

0
1
a) <L2, ≤2> b) <L3, ≤3>.
_____________________
Set R
Seat
No.
Set S
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.



a) ∅ b) {e}
c) {∅} d) {e, a}
a) {∅} b) ∅
a) (P ∨ ¬ P) ∧ (P ∧ Q) b) (P ∨ ¬ P) ∧ (P ∨ Q)
c) P ∧ Q d) (P ∧ ¬ P) ∨ (P ∧ Q)
a) 8 b) 7 c) 3 d) 9
P.T.O.
SLR-TX – 318 -2- *SLRTX318*

a) R : x + y = 10 b) R : x + 4y = 10
a) P ∧ ¬ Q b) ¬ P ∧ Q c) ¬ P ∨ Q d) P ∨ Q
a) ¬ (P ∨ P) b) ¬ P ∧ ¬ P
a) a + b b) a * b
_________________
Set S
*SLRTX318* -3- SLR-TX – 318
Seat
No.


Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

A ∨ (¬ B → C) ∧ (D ↔ E).

1) m = 45 2) m = 30 3) m = 28 4) m = 12
3) Power set
Set S
SLR-TX – 318 -4- *SLRTX318*

SECTION – II

operations.
other.
6. Solve any one :

0
1
a) <L2, ≤2> b) <L3, ≤3>.
_____________________
Set S

Seat
No.
Set P

Advanced C Concept
Day and Date : Saturday, 8-12-2018 Max. Marks : 70
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


1) All recursive functions can be implemented iteratively.
A) True B) False
2) Which of following sorting method is slower ?
A) Quick B) Shell C) Heap D) Bubble
3) The library function used to find the last occurrence of character in string is
A) strchar ( ) B) strnstr ( )
C) strrstr ( ) D) laststr ( )
4) Recursive function will be executed in a
A) First in first out order B) Last in first out order
C) Both (A) and (B) D) None
5) The average search time of hashing with linear hashing probing will be less if
A) Load factor is far less than 1 B) Load factor is equal to 1
C) Load factor is greater than 1 D) All
6) Which of the following is not a valid variable name declaration ?
A) float PI = 3.14 B) double PI = 3.14
C) int PI = 3.14 D) #define PI 3.14
P.T.O.
SLR-TX – 319 -2- *SLRTX319*
7) What would happen if you create a file stdio.h and use #include “stdio.h” ?
A) The predefined library file will be selected
B) The user-defined library file will be selected
C) Both the files will be included
D) The compiler won’t accept the program
8) Register storage class can be specified to global variables.
A) True B) False
C) Depends on the compiler D) Depends on the standard
9) In function free(p), p is a
A) int
B) pointer returned by malloc( )
C) pointer returned by calloc( )
D) pointer returned by malloc( ) and calloc( )
10) Automatic variables are allocated memory in
A) Heap B) Data segment
C) Code segment D) Stack
11) The variable declaration with no storage class specified is by default
A) Auto B) Extern C) Static D) Register
12) What is the output of this C code ?
#include <stdio.h>
void main ( )
{
char *s = “hello”;
char *p = s;
printf (“%c\t%c”, *(p + 3), s[1]);
}
A) h e B) I I C) I o D) I e
13) When fopen( ) is not able to open a file, it returns
A) EOF B) NULL
C) Runtime error D) Compiler Dependent
14) _________ sort is also known as diminishing increment sort.
A) Quick B) Heap C) Shell D) None of these

______________
Set P
*SLRTX319* -3- SLR-TX – 319
Seat
No.

Advanced C Concept
Day and Date : Saturday, 8-12-2018 Marks : 56
Time : 10.00 a.m. to 1.00 p.m.
2. Attempt any four : (4�4=16)
1) Write a short note dynamic memory allocation.
2) What are the advantages and disadvantages of recursive function ?
3) Explain pointer in details.
4) Explain storage classes.
5) Explain and list out different string operation.
3. Attempt any one : (6�1=6)
1) Write C program to perform
i) Count the length string ii) Copy the string from one to another
OR
2) Write a C program to implement concept of recursion for the following :
a) Factorial of given number b) Fibonacci series
4. Explain array of pointer by considering suitable example. (6�1=6)
1) Explain “omega” notation.
2) List out and explain different file operation in short.
3) Write a short note on space complexity.
4) Explain and list out different file operation.
5) What is double hashing ?
1) Write a C program to implement concept of Bubble sort by considering
suitable example.
OR
2) Write a C program to implement concept of Merge sort.
7. Compare different hashing function. (6�1=6)
_____________________
Set P
Set P

Seat
No.
Set Q

Advanced C Concept
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


A) True
B) False
C) Depends on the compiler
D) Depends on the standard
A) int
A) Auto B) Extern
C) Static D) Register
P.T.O.
SLR-TX – 319 -2- *SLRTX319*

#include <stdio.h>
void main ( )
{
char *p = s;
printf (“%c\t%c”, *(p + 3), s[1]);
}
A) EOF B) NULL
A) True B) False
A) strchar ( ) B) strnstr ( ) C) strrstr ( ) D) laststr ( )
______________
Set Q
*SLRTX319* -3- SLR-TX – 319
Seat
No.

Advanced C Concept
Time : 10.00 a.m. to 1.00 p.m.
OR
suitable example.
OR
_____________________
Set Q
Set Q

Seat
No.
Set R

Advanced C Concept
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


A) True B) False
A) int
P.T.O.
SLR-TX – 319 -2- *SLRTX319*

#include <stdio.h>
void main ( )
{
char *p = s;
printf (“%c\t%c”, *(p + 3), s[1]);
}
A) EOF B) NULL
A) True B) False

______________
Set R
*SLRTX319* -3- SLR-TX – 319
Seat
No.

Advanced C Concept
Time : 10.00 a.m. to 1.00 p.m.
OR
suitable example.
OR
_____________________
Set R
Set R

Seat
No.
Set S

Advanced C Concept
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


#include <stdio.h>
void main ( )
{
char *p = s;
printf (“%c\t%c”, *(p + 3), s[1]);
}
A) EOF B) NULL
P.T.O.
SLR-TX – 319 -2- *SLRTX319*

A) True B) False
A) True B) False
A) int

______________
Set S
*SLRTX319* -3- SLR-TX – 319
Seat
No.

Advanced C Concept
Time : 10.00 a.m. to 1.00 p.m.
OR
suitable example.
OR
_____________________
Set S
Set S
Seat
No.
Set P
Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.
Instructions : 1) Q. No. 1 is compulsory. It should be solved in first 30 minutes

in Answer Book Page No. 3. Each question carries one mark.
2) Answer MCQ/Objective type questions on Page No. 3 only.
Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top of Page.

1. Choose correct answer. (14×1=14)
1) The output of Ex-NOR gate is 1. Find out correct combination of inputs.
a) 1, 0 b) 0, 1 c) 0, 0 d) both a) and b)
2) What is minimum number of invertors required to get the expression,
Y = AB′C + A′BC + A′B′C ?
a) 1 b) 2 c) 3 d) 4
3) (23.6)10 = (?)2
a) 11111.10011 b) 10111.10011
c) 11111.10111 d) 10111.10111
4) In JK flip flop if initial output is 1 and next output is also 1 then inputs J and
K will have values
a) J = K = 0 b) J = 0, K = 1 c) J = 1, K = 0 d) None of the above
5) Race around condition can be removed using _______ flip flop.
a) MS b) SR c) modified SR d) all of these
6) When input R and S are complement of each other then it is called as
______ flip flop.
a) Clocked RS b) Clocked SR c) D d) T
P.T.O.
SLR-TX – 320 -2- *SLRTX320*
7) NAND gate is equivalent to ________ gate.
a) NOR b) AND followed by NOT
c) Bubbled OR d) Both b) and c)
8) In VHDL, which object/s is/are used to connect entities together for the
model formation ?
a) Constant b) Variable c) Signal d) All of the above
9) If the number of n selected input lines is equal to 2m then it requires _______
select lines.
a) 2 b) m c) n d) None
10) A demultiplexer has
a) one data input and a number of selection inputs, and they have several
outputs
b) one input and one output
c) several inputs and several outputs
d) several inputs and one output
11) In M×N memory chip, what is M ?
a) Number of location b) Number of bits in given data
c) Number of address lines d) None of above
12) Which among the following is pre-defined in the standard package as
one-dimensional array type comprising each element of BIT type ?
a) Bit type b) Bit_vector type
c) Boolean type d) All of the above
13) Among the VHDL features, which language statements are executed at the
same time in parallel flow ?
a) Concurrent b) Sequential c) Net-list d) Test-bench
14) The storage element for a static RAM is the
a) Diode b) Capacitor c) Resistor d) Flip-flop
____________

Set P
*SLRTX320* -3- SLR-TX – 320
Seat
No.
Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

a) Design full adder.
b) Explain minterm, maxterm and relationship between them.
c) Explain different techniques to simplify the boolean expression.
d) Perform (58 – 68) using 2’s complement arithmetic.
3. What is an excitation table ? Draw excitation table for SR and JK flip flop. (8×1=8)
OR
Design Mod 10 counter using JK flip flop.
4. Design circuit using NAND gates only for the expression

Y = Σm (2, 4, 8, 10) + d (0, 6, 7). 8
SECTION – II

a) Implement of full adder using 4:1 multiplexer.
b) Obtain a 16 × 8 memory using 16 × 4 memory ICs.
c) Write VHDL code for T flip flop.
d) Implement 16:1 multiplexer using 4:1 multiplexer.
Set P
SLR-TX – 320 -4- *SLRTX320*
6. Solve any two : (2×8=16)
a) What is Multiplexer ? Implement the following expression using 8:1 MUX
f (A, B, C, D) = Σm (0, 2, 3, 7, 13, 14).
b) What is De multiplexer ? What is the difference between a demultiplexer
and a decoder with example ?
c) Write VHDL code for the circuit shown below
______________
Set P
Seat
No.
Set P
Q

Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.


model formation ?
a) Constant b) Variable
c) Signal d) All of the above
select lines.
outputs
P.T.O.
SLR-TX – 320 -2- *SLRTX320*
a) 1, 0 b) 0, 1 c) 0, 0 d) both a) and b)
a) 1 b) 2 c) 3 d) 4
10) (23.6)10 = (?)2
a) 11111.10011 b) 10111.10011
c) 11111.10111 d) 10111.10111
K will have values
______ flip flop.
____________

Set Q
*SLRTX320* -3- SLR-TX – 320
Seat
No.
Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

OR

Y = Σm (2, 4, 8, 10) + d (0, 6, 7). 8
SECTION – II

Set Q
SLR-TX – 320 -4- *SLRTX320*
f (A, B, C, D) = Σm (0, 2, 3, 7, 13, 14).
______________
Set Q
Seat
No.
Set P
R

Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.


a) MS b) SR
c) modified SR d) all of these
______ flip flop.
model formation ?
a) Constant b) Variable
c) Signal d) All of the above
select lines.
P.T.O.
SLR-TX – 320 -2- *SLRTX320*
outputs
a) 1, 0 b) 0, 1 c) 0, 0 d) both a) and b)
a) 1 b) 2 c) 3 d) 4
13) (23.6)10 = (?)2
a) 11111.10011 b) 10111.10011
c) 11111.10111 d) 10111.10111
K will have values
____________

Set R
*SLRTX320* -3- SLR-TX – 320
Seat
No.
Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

OR

Y = Σm (2, 4, 8, 10) + d (0, 6, 7). 8
SECTION – II

Set R
SLR-TX – 320 -4- *SLRTX320*
f (A, B, C, D) = Σm (0, 2, 3, 7, 13, 14).
______________
Set R
Seat
No.
Set P
S

Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.


outputs
a) Concurrent b) Sequential
c) Net-list d) Test-bench
P.T.O.
SLR-TX – 320 -2- *SLRTX320*
a) 1, 0 b) 0, 1 c) 0, 0 d) both a) and b)
a) 1 b) 2 c) 3 d) 4
8) (23.6)10 = (?)2
a) 11111.10011 b) 10111.10011
c) 11111.10111 d) 10111.10111
K will have values
______ flip flop.
model formation ?
a) Constant b) Variable c) Signal d) All of the above
select lines.
____________

Set S
*SLRTX320* -3- SLR-TX – 320
Seat
No.
Examination, 2018
Digital Techniques
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

OR

Y = Σm (2, 4, 8, 10) + d (0, 6, 7). 8
SECTION – II

Set S
SLR-TX – 320 -4- *SLRTX320*
f (A, B, C, D) = Σm (0, 2, 3, 7, 13, 14).
______________
Set S

Seat
No.
Set P
S.E. (Computer Science and Engineering) (Part – I) (Old – CGPA)
Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.
3) All the questions are compulsory.

1. Choose correct alternative : (14×1=14)

1) The amount of light emitted by the phosphor coating depends on the
a) Number of electrons striking the screen
b) Speed of electrons striking the screen
c) Distance from the cathode to the screen
d) None of above
2) Refreshing is not needed in DVST because of the presence of
a) Primary gun b) Flood gun
c) Focusing anode d) Control grid
3) In __________ algorithm initial pixel must be provided by user.
a) Edge fill b) Edge flag c) Seed fill d) Fence fill
4) The transformation in which an object is moved in a minimum distance path
from one position to another is called
a) Rotation b) Replacement
c) Scaling d) Translation
P.T.O.
SLR-TX – 321 -2- *SLRTX321*
5) Two dimensional color model are

a) RGB and CMYK b) RBG and CYMK
c) RGB and CMKY d) None
6) Which technique of color CRT is used for production of realistic image ?
a) Beam penetration b) Shadow mask
c) Both a) and b) d) None of above
7) The transformation in which an object is moved from one position to another
in circular path around a specified pivot point is called
a) Scaling b) Shearing c) Rotation d) Translation
8) The process of extracting a portion of a database or a picture inside or
outside a specified region are called
a) Transformation b) Projection c) Mapping d) Clipping
9) A quad-tree is a data structure which is used for graphical representation of
a) 2D digital picture or object b) 3D picture or object
c) Both a) and b) d) None of these
10) A method used to test lines for total clipping is equivalent to the
a) logical XOR b) logical AND c) logical OR d) both a and b
11) The algorithm of hidden surface are
a) Object-space method b) Image-space method
12) The region code of a point within the window is
a) 1111 b) 1000 c) 0001 d) 0000
13) A Bezier curve is a polynomial of degree__________ the no. of control
points used.
a) One less than b) One more than
c) Two less than d) Two more than
14) ______and depth buffer are used in Z- buffer algorithm.
a) Data buffer b) Frame buffer
c) Display buffer d) None
______________
Set P
*SLRTX321* -3- SLR-TX – 321
Seat
No.

Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.
Instructions : 1) All the questions are compulsory.

SECTION – I
2. Solve any three (Each carries 4 marks) : 12

a) What is RLE ? Explain in detail with its advantages and disadvantages.
b) Explain DDA line drawing algorithm.
c) Explain Reflection through an arbitrary line in 2D.
d) Differentiate between raster scan display and random scan display.
3. Explain below 3D transformation with its matrices and diagram 8

a) Translation
b) Scaling
c) Rotation.
OR
Illustrate and draw the flowchart of Bresenham’s circle algorithm by considering

the origin centered circle of radius 6. 8
4. Consider the rectangle with co-ordinate A(2, 2), B(5, 2), C(5, 4) and D(2, 4)
perform the following combined transformation.
a) Translate the object with 3 units in X direction as well as 3 units in Y
direction.
b) Scale the object by scaling factor x = 2 and y = 2.
c) Reflect the object through the line y = x. 8
Set P
SLR-TX – 321 -4- *SLRTX321*
SECTION – II

a) Explain midpoint sub division algorithm in detail.
b) Explain display file compilation in detail.
c) Explain non parametric curve representation.
d) Write a short note on image and its applications.
6. Explain in detail Warnock algorithm. Also draw quadtree data structure. 8

OR
Explain in detail Cohen-Sutherland line clipping algorithm. 8
7. Explain antialising and halftoning techniques in detail. 8
_____________________
Set P

Seat
No.
Set Q
Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


a) 1111 b) 1000 c) 0001 d) 0000
P.T.O.
SLR-TX – 321 -2- *SLRTX321*

points used.
d) None of above
______________
Set Q
*SLRTX321* -3- SLR-TX – 321
Seat
No.

Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I


a) Translation
b) Scaling
c) Rotation.
OR

direction.
Set Q
SLR-TX – 321 -4- *SLRTX321*
SECTION – II


OR
_____________________
Set Q

Seat
No.
Set R
Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


P.T.O.
SLR-TX – 321 -2- *SLRTX321*

a) 1111 b) 1000 c) 0001 d) 0000
points used.
d) None of above
______________
Set R
*SLRTX321* -3- SLR-TX – 321
Seat
No.

Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I


a) Translation
b) Scaling
c) Rotation.
OR

direction.
Set R
SLR-TX – 321 -4- *SLRTX321*
SECTION – II


OR
_____________________
Set R

Seat
No.
Set S
Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
of Page.


a) 1111 b) 1000 c) 0001 d) 0000
points used.
P.T.O.
SLR-TX – 321 -2- *SLRTX321*

d) None of above
______________
Set S
*SLRTX321* -3- SLR-TX – 321
Seat
No.

Examination, 2018
computer Graphics
Time : 10.00 a.m. to 1.00 p.m.

SECTION – I


a) Translation
b) Scaling
c) Rotation.
OR

direction.
Set S
SLR-TX – 321 -4- *SLRTX321*
SECTION – II


OR
_____________________
Set S
Seat
No.
Set P
S.E. CSE (Part – I) (Old) Examination, 2018
Data Structure – I
Day and Date : Tuesday, 18-12-2018, -2018 Total Marks : 100
Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
carries one mark.
Top of Page.

1) Which of the following data structure is used in recursion ?
a) Stack b) Queue c) Link list d) Tree
2) abc[ ] and xyz[ ] are two strings and we have to copy xyz[ ] at the end of
abc[ ] . Which of the following function is used ?
a) strcmp( ) b) strcat( ) c) strcpy( ) d) strconcat( )
3) The ftell( ) function is used to
a) Set the position to desired point in the file
b) Give current position in the file
c) Set the position to the beginning of the file
d) None of these
4) Pointer to an array means
a) A variable which keeps the address of all array elements
b) A variable which keeps the address of first array element
c) An array which contains all addresses of different elements
d) None of the above
5) char X[10] [5] ; declaration tells that
a) X is a matrix with 5 rows and 10 columns
b) X is an 1 D array with 10 rows and 5 columns
c) x is a matrix with 10 rows and 5 columns
P.T.O.
SLR-TX – 322 -2- *SLRTX322*
6) Pointer to pointer of type integer is
a) A variable which keeps the address of an integer variable
b) A variable which keeps value at address of an integer variable
c) A variable which keeps the address of address of an integer variable
d) A integer variable which keeps the address of another integer variable
7) Which function is appropriate for writing records in a binary file ?
a) fputc( ) b) fgets( ) c) fputs( ) d) fwrite( )
8) If n is number of disks, the number of disk movements in Towers of Hanoi are
a) 2n – 1 b) 2n – 1 c) n2 – 1 d) none of above
9) Function strlen( ) returns
a) a string b) a character value
c) an integer value d) a float value
10) __________ function is used to read the file line by line.
a) fgetc( ) b) fputs( ) c) fgets( ) d) fread( )
11) Which of the following is not a file opening mode ?
a) r + b) wb+ c) ab d) rw
12) In linked lists there are no NULL links in
a) single linked list b) linear doubly linked list
c) circular linked list d) linked list
13) Which of the following is not an inherent application of stack ?
a) Reversing a string b) Evaluation of postfix expression
c) Implementation of recursion d) Job scheduling
14) Each node in doubly linked list has _________ fields.
a) 2 b) 3 c) 1 d) 4
15) Ascending priority queue is one in which the item removed is
a) the smallest item b) the largest item
c) any item d) none
16) In linked representation of stack __________ holds the elements of the stack.
a) INFO fields b) TOP fields c) LINK fields d) NULL fields
17) The situation in a linked list when START = NULL means
a) list is created b) list is overflow
c) list is empty d) new node is created
18) What is postfix form of * + A B – C D prefix expression ?
a) A B + * C D – b) A B C + * – c) A B + * C D – d) A B + C D – *
19) The situation when PTR-> NEXT = START in a circular linked list, means
a) PTR is at the first node in the linked list
b) PTR is at the last but one node in the linked list
c) PTR is at the last node in the linked list
d) PTR is at the middle node in the linked list
20) Which of the following is an application of stack ?
a) finding factorial b) towers of Hanoi
c) evaluation of postfix expression d) none of the above
____________

Set P
*SLRTX322* -3- SLR-TX – 322
Seat
No.
Day and Date : Tuesday, 18-12-2018, -2018 Marks : 80

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
Instruction : Figures to the right indicate full marks.
SECTION – I
2. Attempt any four : (4×5=20)

a) What is recursion ? How it works ? Explain with the help of a program.
b) Explain the concept of pointer to an array with an example.
c) Explain strcat( ) and strcmp( ) built in functions with example.
d) Write a program to find out length of a string using user defined function.
e) Discuss file functions to open, read, write and to bring file pointer to a
desired location.
3. Write a program to copy the contents of one file into another file. 10
OR
Discuss different file opening modes in detail.
4. Write a program to allocate memory for an array dynamically, store elements

and display them. 10
SECTION – II
5. Answer any four : (4×5=20)

a) What is stack ? Discuss insert, delete and display functions of stack.
b) Explain operations of circular queue with examples and changes made in
front and rear variables during operations.
c) What is linked list ? How it differs from an array ?
d) Write a function to insert a given node in the beginning in a singly circular
linked list.
e) Discuss addition of two polynomials using linked list with example. Set P
SLR-TX – 322 -4- *SLRTX322*
6. Answer any one : 10
Write a menu driven program to implement Singly Linked List showing
operations.
1) Insert a node in the beginning of the list
2) Insert a node at a given position in the list
3) Display the linked list.
OR
Write a menu driven program to implement Doubly Linked List showing
operations.
2) Delete a given node
7. How an infix expression is converted to postfix using stack ? Convert following

expression into postfix by providing proper explanation and showing the
content of stack. 10
(A + B) * C/D + E ∧ F/G
_____________
Set P
Seat
Set Q
No.
Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
carries one mark.
Top of Page.

P.T.O.
SLR-TX – 322 -2- *SLRTX322*
d) None of these
a) 2 b) 3 c) 1 d) 4
c) any item d) none
____________
Set Q

*SLRTX322* -3- SLR-TX – 322
Seat
No.

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
SECTION – I

desired location.
OR

SECTION – II

linked list.
e) Discuss addition of two polynomials using linked list with example. Set Q
SLR-TX – 322 -4- *SLRTX322*
operations.
OR
operations.

(A + B) * C/D + E ∧ F/G
_____________
Set Q
Seat
Set R
No.
Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
carries one mark.
Top of Page.

a) 2 b) 3 c) 1 d) 4
c) any item d) none
d) PTR is at the middle node in the linked list P.T.O.
SLR-TX – 322 -2- *SLRTX322*
d) None of these
____________
Set R
*SLRTX322* -3- SLR-TX – 322
Seat
No.

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
SECTION – I

desired location.
OR

SECTION – II

linked list.
e) Discuss addition of two polynomials using linked list with example. Set R
SLR-TX – 322 -4- *SLRTX322*
operations.
OR
operations.

(A + B) * C/D + E ∧ F/G
_____________
Set R
Seat
Set S
No.
Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
carries one mark.
Top of Page.

a) 2 b) 3 c) 1 d) 4
P.T.O.
SLR-TX – 322 -2- *SLRTX322*
c) any item d) none
d) None of these
____________
Set S
*SLRTX322* -3- SLR-TX – 322
Seat
No.

Time : 10.00 a.m. to 1.00 p.m..00 .m. to .00 .m.
SECTION – I

desired location.
OR

SECTION – II

linked list.
e) Discuss addition of two polynomials using linked list with example. Set S
SLR-TX – 322 -4- *SLRTX322*
operations.
OR
operations.

(A + B) * C/D + E ∧ F/G
_____________
Set S

Seat
No.
Set P
S.E. (C.S.E.) (Part – I) (Old) Examination, 2018
switching theory and logic design
Day and Date : Wednesday, 19-12-2018 Max. Marks : 100
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


1) RAM is
a) Volatile b) Non-volatile
2) Number of inputs for full-subtractor are
a) Two b) Three c) Four d) Five
3) Memory element present in _________ ckt. to store past information.
a) Sequential ckt. b) Combinational ckt.
4) A Minterm corresponding to don’t care condition have a value of
a) 1 b) 0 c) 2 d) 0 and 1
5) ‘n’ variable k-map having ____________ cells.
a) n no. of cells b) N no. of cells
c) 2 no. of cells
n
d) 2N no. of cells
6) Race round condition is occurred when J and K i/p’s are
a) J = 1, K = 0 b) J = 0, K = 1 c) J = 1, K = 1 d) J = 0, K= 0.
7) In AND operation, O/P is logic 1 if and only if all I/P’s are
a) 1 b) 0 c) Both a) and b) d) None of above
P.T.O.
SLR-TX – 323 -2- *SLRTX323*
8) Two’s complement of 01001110 is
a) 10110001 b) 10110011 c) 10110010 d) None
9) State counter is also known as
a) Up-down counter b) Ripple counter
c) Multiple choice counter d) MOD counter
10) All FF’s are clocked simultaneously in __________ counter.
a) Synchronous counter b) Asynchronous counter
c) Both a) and b) d) None
11) In __________ ckt. o/p at any instant of time depends upon the present i/p
as well as past i/p or o/p.
a) Universal ckt. b) Combinational ckt.
c) Sequential ckt. d) None
12) D-type FF is also called as
a) Data FF b) Distance FF c) Both a) and b) d) Delay FF
13) Half substractor is use to performed
a) Two 1-bit substraction b) Multibit Substraction
c) Three 1-bit substraction d) Four 1-bit substraction
14) NAND-NAND realization is ______________ level realization.
a) One level b) Two level c) Three level d) Four level
15) To increase the speed of adder ___________ technique is used.
a) Cascading Adder b) LAC
c) Adder d) Half Adder
16) RTL stands for
a) Resistance-transfer level b) Register-transfer level
c) Register-two level d) None of above
17) Multiplexer is also known as
a) Decoder b) Encoder c) Counter d) Data Selector
18) Race – around condition is in ___________ Flip-flop.
a) SR Flip-flop b) D Flip-flop c) JK Flip-flop d) T Flip-flop
19) In _____________ ckt. inputs pass through select i/p according to code.
a) MUX b) DEMUX c) Encoder d) Decoder
20) IC 7447 is use for performing
a) BCD to 7-Seg. Display b) BCD to Decimal decoder driver
________________
Set P
*SLRTX323* -3- SLR-TX – 323
Seat
No.

Day and Date : Wednesday, 19-12-2018 Marks : 80
Time : 10.00 a.m. to 1.00 p.m.
Instructions : 1) Figures to the right indicate full marks.

SECTION – I
2. Attempt any four (each carries 5 marks) : (4×5=20)
a) Minimize the four-variable logic function using K-map.
f(A, B, C, D) = ∏M(4, 6, 10, 12, 13, 15)
b) Write a short note on Full Adder.
c) What is BCD-to-7 segment Decoder ? Explain with neat diagram.
d) Write a short note on Race-Around condition.
e) Draw and explain excitation table of JK and SR flip-flop.
3. Attempt any two (each carries 10 marks) : (2×10=20)
a) For a given logical function f(A, B, C, D) = Sm(0, 1, 2, 3, 11, 12, 14, 15).
Minimize using k-map and realize using NAND gates only.
b) What is Shift register ? Draw SISO shift register for 5 bit data (10111).
c) What is UP-DOWN counter ?
SECTION – II
a) Draw 3-line-to-8-line decoder using 74155 ICs.
b) Write a short note on Digital comparator.
c) Compare Multiplexer and Demultiplexer.
d) Explain Look-Ahead-Carry in detail.
e) Write a short note on Digital comparator.
a) Design 1 : 8 DEMUX also draw logic diagram for 1 : 8 DEMUX.
b) Explain RAM architecture in detail.
c) Design 8K × 8 memory using 4K × 8 memory chips using 3 : 8 decoder.
_____________________
Set P
Set P

Seat
No.
Set Q
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


1) RTL stands for
6) RAM is
P.T.O.
SLR-TX – 323 -2- *SLRTX323*
a) 1 b) 0 c) 2 d) 0 and 1
c) 2 no. of cells
n
d) 2N no. of cells
a) J = 1, K = 0 b) J = 0, K = 1 c) J = 1, K = 1 d) J = 0, K= 0.
a) 10110001 b) 10110011 c) 10110010 d) None
________________
Set Q
*SLRTX323* -3- SLR-TX – 323
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I
f(A, B, C, D) = ∏M(4, 6, 10, 12, 13, 15)
SECTION – II
_____________________
Set Q
Set Q

Seat
No.
Set R
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


6) RTL stands for
P.T.O.
SLR-TX – 323 -2- *SLRTX323*
11) RAM is
a) 1 b) 0 c) 2 d) 0 and 1
c) 2 no. of cells
n
d) 2N no. of cells
a) J = 1, K = 0 b) J = 0, K = 1 c) J = 1, K = 1 d) J = 0, K= 0.
a) 10110001 b) 10110011 c) 10110010 d) None
________________
Set R
*SLRTX323* -3- SLR-TX – 323
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I
f(A, B, C, D) = ∏M(4, 6, 10, 12, 13, 15)
SECTION – II
_____________________
Set R
Set R

Seat
No.
Set S
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.


a) J = 1, K = 0 b) J = 0, K = 1 c) J = 1, K = 1 d) J = 0, K= 0.
a) 10110001 b) 10110011 c) 10110010 d) None
P.T.O.
SLR-TX – 323 -2- *SLRTX323*
11) RTL stands for
16) RAM is
a) 1 b) 0 c) 2 d) 0 and 1
c) 2 no. of cells
n
d) 2N no. of cells
________________
Set S
*SLRTX323* -3- SLR-TX – 323
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I
f(A, B, C, D) = ∏M(4, 6, 10, 12, 13, 15)
SECTION – II
_____________________
Set S
Set S
Seat
No. Set P
S.E. (CSE) (Part – II) (CBCS) Examination, 2018
Applied Mathematics – II (New)
Day and Date : Monday, 19-11-2018 Max. Marks : 70
Time : 2.30 p.m. to 5.30 p.m.

30 minutes in Answer Book Page No. 3. Each question carries
one mark.

1) The order of convergence in Newton’s Raphson method is
a) 1.6 b) 2 c) 1.5 d) 3
2) In solving algebraic and transcendental equation f(x) = 0, which of the following method
is called method chord ?
a) False position b) Newton’s Raphson
rd
1
c) Power method d) Simpson’s
3
3) The interval in which a positive real root of the equation x3 – 4x – 9 = 0 lies is
a) (3, 4) b) (0, 1) c) (1, 2) d) (2, 3)
4) In solving simultaneous linear equation Ax = B by Jordan method, the coefficient matrix
A reduced to
a) Lower triangular matrix b) Upper triangular matrix
c) Diagonal matrix d) Null matrix
5) Which of the following method is used to find dominant eigen value and corresponding
eigen vector of a matrix ?
a) Newton’s Raphson b) Power method
c) Gauss elimination d) Jacobi’s method
3 th
6) The number of strips required in Simpson’s rule is a
8
a) multiple of 2 b) multiple of 4 c) multiple of 6 d) multiple of 3
P.T.O.
SLR-TX – 326 -2- *SLRTX326*
1
7) If f(0) = 1, f(0.5) = 0.8, f(1) = 0.5 and h = 0.5 then by Trapezoidal rule the value of ∫ f(x) dx
is 0
a) 0.775 b) 1.55 c) 3.10 d) 0.155

8) Consider the fuzzy sets
0.4 0.2 0.5 0.4 1
A= + + + +
x y z u v
0.3 1 0.5 0.6 0.3
B= + + + +
x y z u v
A ∩B =

a) 2.5 b) 2.3 c) 1.7 d) 3.6
9) The α – cut of fuzzy set defined by
π
tan x 0≤x≤
A( x ) = 4 is given by
0 otherwise
π π π
a) [tan−1 α , ] b) (tan−1 α , ] c) (cot −1 α , ] d) [0 , tan−1 α)
4 4 4
10) Which of the following is not true ?
A ∩B α α A ∩B
a) S(B, A ) = b) A = ∑ c) B = ∑ d) S(A, B) =
B α α A α αB B
11) The α-cut of any fuzzy set is
a) subsethood b) fuzzy set c) ordinary set d) fuzzy number
12) Which of the following is true ? (A | B) (x) =
– – – –
a) (A ∩ B) (x) b) (A ∩ B) (x) c) (A ∩ B) (x) d) (A ∩ B ) (x)
13) For maximization LP model, the simplex method is terminated when all values.
a) zj – cj ≥ 0 b) zj – cj ≤ 0 c) zj – cj = 0 d) zj ≤ 0
14) If there are n workers and n jobs, there would be
a) n solutions b) n ! solutions
c) (n – 1) ! solutions d) (n !)n solutions
____________

Set P
*SLRTX326* -3- SLR-TX – 326
Seat
No.
Day and Date : Monday, 19-11-2018 Marks : 56
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Solve any three from the following : (3×3=9)

a) Find a positive real root of the equation xlog10x = 1.2 by False position method correct
to three decimal places.
b) Using Newton’s Raphson iterative formula, find approximate value of 29 correct to
four decimal places.
c) Using Gauss elimination method solve the equation
x + 2y + 3z – u = 10, 2x + 3y – 3z – u = 1
2x – y + 2z + 3u = 7, 3x + 2y – 4z + 3u = 2.
d) Apply Gauss seidal iteration method to solve the equations 20x + y – 2z = 17,
3x + 20y – z = – 18, 2x – 3y + 20z = 25 (perform three iterations).
0 .5
 x  rd
1 rule taking h = 0.125.
e) Evaluate ∫  sin x 
 
dx using simpson’s
3
0

2 4
1
a) Evaluate ∫∫ (x + y )2
dxdy , taking h = k = 0.5 by Trapezoidal rule.
1 3 5 .2
b) Evaluate the integral ∫ loge (x) dx using Weddle’s rule.
4
4 2 
c) Find the largest eigen value and corresponding eigen vector of a matrix   by
 1 3
 =  0 
using power method, taking x 0  1 as initial eigen vector (Perform five iterations).
 
d) Find a positive real root of the equation xex – 2 = 0 correct to three places of decimals
using Newton’s Raphson method.
e) Solve the following simultaneous equations by Jordan method.
x + 2y + z = 3, 2x + 3y + 3z = 10, 3x – y + 2z = 13.
Set P
SLR-TX – 326 -4- *SLRTX326*
4. Solve any two from the following : 10

a) Solve the system of non-linear equations x2 + y = 11, y2 + x = 7 with x0 = 3.5, y0 = – 1.8
by Newton’s Raphson method (in two iteration).
2 1
b) Evaluate ∫ 0 x2 + 4 dx by Trapezoidal rule with h = 0.5 and h = 0.25, then improve the
value of integration by Romberg’s method.
c) Solve the following system by Factorization method x + y + z = 1, 4x + 3y – z = 6,
3x + 5y + 3z = 4.
Section – II
5. Attempt any three from the following : (3×3=9)

a) Solve the following equation A + X = B where A and B are fuzzy numbers given as
0 .1 0 .6 0 .9 1 0 .4 0 .1
A (x) = + + + + +
[0, 1) [1, 2) [2, 3) 3 (3, 4] (4, 5]
0.1 0.2 0.6 0.7 0 .9 1 0 .4 0.4 0. 1

B (x) = + + + + + + + +
[0, 1) [1, 2) [2, 3) [3, 4) [4, 5) 5 (5,, 6] (6, 7] (7, 8]
b) Calculate the following fuzzy operations on the intervals

i) [– 1, 2] – [1, 3]
[ − 4, 6]
ii)
[2, 4]
iii) [– 3, 4]  [– 3, 5]
0.5 0.8 0.92 0.36 0.25
c) For the given fuzzy set. A = + + + + Find special fuzzy set for
x1 x2 x3 x4 x5
α = 0.8, 0.25, 0.5.
d) Define the following :
i) Support of a fuzzy set
ii) Height of a fuzzy set
iii) Equilibrium point.

e) Max Z = 7x1 + 5x2
Subject to
– x1 – 2x2 ≥ – 6
4x1 + 3x2 ≤ 12
x1, x2 ≥ 0
Solve by using simplex method.
Set P
*SLRTX326* -5- SLR-TX – 326
6. Attempt any three from the following. (3×3=9)
a) Find the optimal solution for the assignment with following cost matrix .

Persons
1 2 3 4
A 10 12 19 11
B 5 10 7 8
Tasks
C 12 14 13 11
D 8 15 11 9
b) If A, B are two fuzzy numbers given by membership function below
x −1
A( x ) = 1< x ≤ 4 B (x) = 0 x > 7, x ≤ 1
3
7−x x−7
= 4<x≤7 = 7 < x ≤ 10
3 13
13 − x
= 0 otherwise = 10 < x ≤ 13
13
Find α B – A.

c) Find strong α-cut for the following fuzzy set defined on universal set X = [ 0, 10] by the
x
membership function A(x ) = for α = 0.2, 0.8, 1.
x+2
d) If X = {0, 1, 2, 3, 4} is a universal set given A, B, C are the three fuzzy sets defined on X
by membership function
1 1 1
A( x ) = , B(x) = , C(x ) =
1 + 20 x 1
(1 + 10x )2
(1 + 10 x ) 2
then find scalar cardinality of A, B, C.
e) Given fuzzy set A defined on universal set X = {–3, –2, –1, 0, 1, 2, 3, 4, 5} by membership
12 − x
function A(x ) = and f(x) = x2 + 2 is a crisp function ∀x ∈ x then by using extension
15
principle find f(A).
7. Attempt any two from the followings : (2×5=10)
a) For given fuzzy number find MIN (A, B) where
x−2
A( x ) = 2<x≤5 B(x ) = x − 3 3 < x ≤ 4
3
7−x 9−x
= 5<x≤7 = 4<x≤9
2 5
=0 otherwise = 0 otherwise
Set P
SLR-TX – 326 -6- *SLRTX326*
b) Use simplex method to
Minimize z = x2 – 3x3 + 2x5
Subject to the constraints
3x2 – x3 + 2x5 ≤ 7, –2x2 + 4x3 ≤ 12
– 4x2 + 3x3 + 8x5 ≤ 10
x2 ≥ 0, x3 ≥ 0 and x5 ≥ 0
c) Let A and B are two fuzzy numbers with membership function given by
x −1
A( x ) = 1< x ≤ 4
3
7−x
= 4<x≤7
3
= 0 x > 7, x ≤ 1
B(x ) = 0 x ≤ 7, x > 13
x−7
= 7 < x ≤ 10
3
13 − x
= 10 < x ≤ 13
13
Calculate fuzzy number A.B.
___________
Set P
Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.

one mark.

0.4 0.2 0.5 0.4 1
A= + + + +
x y z u v
0.3 1 0.5 0.6 0.3
B= + + + +
x y z u v
A ∩B =

a) 2.5 b) 2.3 c) 1.7 d) 3.6
π
tan x 0≤x≤
0 otherwise
π π π
4 4 4
A ∩B α α A ∩B
a) S(B, A ) = b) A = ∑ c) B = ∑ d) S(A, B) =
B α αA α αB B
P.T.O.
SLR-TX – 326 -2- *SLRTX326*
– – – –
a) 1.6 b) 2 c) 1.5 d) 3
1rd
3
a) (3, 4) b) (0, 1) c) (1, 2) d) (2, 3)
A reduced to
th
3
8
1
is 0
a) 0.775 b) 1.55 c) 3.10 d) 0.155
____________

Set Q
*SLRTX326* -3- SLR-TX – 326
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

x + 2y + 3z – u = 10, 2x + 3y – 3z – u = 1
2x – y + 2z + 3u = 7, 3x + 2y – 4z + 3u = 2.
0 .5
 x  rd
e) Evaluate ∫  sin x  dx using simpson’s
  3
0

2 4
1
1 3 5 .2
4
4 2 
c) Find the largest eigen value and corresponding eigen vector of a matrix  by
 1 3 
using power method, taking x  = 0  as initial eigen vector (Perform five iterations).
0  1
 
x + 2y + z = 3, 2x + 3y + 3z = 10, 3x – y + 2z = 13.
Set Q
SLR-TX – 326 -4- *SLRTX326*

2 1
3x + 5y + 3z = 4.
Section – II

0 .1 0 .6 0 .9 1 0 .4 0 .1
A (x) = + + + + +
[0, 1) [1, 2) [2, 3) 3 (3, 4] (4, 5]
0.1 0.2 0.6 0.7 0 .9 1 0 .4 0.4 0. 1

B (x) = + + + + + + + +
[0, 1) [1, 2) [2, 3) [3, 4) [4, 5) 5 (5,, 6] (6, 7] (7, 8]

i) [– 1, 2] – [1, 3]
[ − 4, 6]
ii)
[2, 4]
iii) [– 3, 4]  [– 3, 5]
0.5 0.8 0.92 0.36 0.25
x1 x2 x3 x4 x5
α = 0.8, 0.25, 0.5.

e) Max Z = 7x1 + 5x2
Subject to
– x1 – 2x2 ≥ – 6
4x1 + 3x2 ≤ 12
x1, x2 ≥ 0
Set Q
*SLRTX326* -5- SLR-TX – 326

Persons
1 2 3 4
A 10 12 19 11
B 5 10 7 8
Tasks
C 12 14 13 11
D 8 15 11 9
x −1
A( x ) = 1< x ≤ 4 B (x) = 0 x > 7, x ≤ 1
3
7−x x−7
= 4<x≤7 = 7 < x ≤ 10
3 13
13 − x
=0 otherwise = 10 < x ≤ 13
13
Find α B – A.

x
x+2
1 1 1
A( x ) = , B(x) = , C(x ) =
1 + 20 x 1
(1 + 10x )2
(1 + 10 x ) 2
12 − x
15
x−2
A( x ) = 2<x≤5 B(x ) = x − 3 3 < x ≤ 4
3
7−x 9−x
= 5<x≤7 = 4<x≤9
2 5
Set Q
SLR-TX – 326 -6- *SLRTX326*
3x2 – x3 + 2x5 ≤ 7, –2x2 + 4x3 ≤ 12
– 4x2 + 3x3 + 8x5 ≤ 10
x2 ≥ 0, x3 ≥ 0 and x5 ≥ 0
x −1
A( x ) = 1< x ≤ 4
3
7−x
= 4<x≤7
3
= 0 x > 7, x ≤ 1
B(x ) = 0 x ≤ 7, x > 13
x−7
= 7 < x ≤ 10
3
13 − x
= 10 < x ≤ 13
13
___________
Set Q
Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.

one mark.
th
3
8
1
is 0
a) 0.775 b) 1.55 c) 3.10 d) 0.155

0.4 0.2 0.5 0.4 1
A= + + + +
x y z u v
0.3 1 0.5 0.6 0.3
B= + + + +
x y z u v
A ∩B =

a) 2.5 b) 2.3 c) 1.7 d) 3.6
P.T.O.
SLR-TX – 326 -2- *SLRTX326*
π
tan x 0≤x≤
0 otherwise
π π π
4 4 4
A ∩B α α A ∩B
a) S(B, A ) = b) A = ∑ c) B = ∑ d) S(A, B) =
B α αA α αB B
– – – –
a) 1.6 b) 2 c) 1.5 d) 3
1rd
3
a) (3, 4) b) (0, 1) c) (1, 2) d) (2, 3)
A reduced to
____________

Set R
*SLRTX326* -3- SLR-TX – 326
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

x + 2y + 3z – u = 10, 2x + 3y – 3z – u = 1
2x – y + 2z + 3u = 7, 3x + 2y – 4z + 3u = 2.
0 .5
 x  rd
e) Evaluate ∫  sin x 
 
dx using simpson’s
3
0

2 4
1
1 3 5 .2
4
4 2 
c) Find the largest eigen value and corresponding eigen vector of a matrix   by
 1 3
 =  0 
using power method, taking x 0  1 as initial eigen vector (Perform five iterations).
 
x + 2y + z = 3, 2x + 3y + 3z = 10, 3x – y + 2z = 13.
Set R
SLR-TX – 326 -4- *SLRTX326*

2 1
3x + 5y + 3z = 4.
Section – II

0 .1 0 .6 0 .9 1 0 .4 0 .1
A (x) = + + + + +
[0, 1) [1, 2) [2, 3) 3 (3, 4] (4, 5]
0.1 0.2 0.6 0.7 0 .9 1 0 .4 0.4 0. 1

B (x) = + + + + + + + +
[0, 1) [1, 2) [2, 3) [3, 4) [4, 5) 5 (5,, 6] (6, 7] (7, 8]

i) [– 1, 2] – [1, 3]
[ − 4, 6]
ii)
[2, 4]
iii) [– 3, 4]  [– 3, 5]
0.5 0.8 0.92 0.36 0.25
x1 x2 x3 x4 x5
α = 0.8, 0.25, 0.5.

e) Max Z = 7x1 + 5x2
Subject to
– x1 – 2x2 ≥ – 6
4x1 + 3x2 ≤ 12
x1, x2 ≥ 0
Set R
*SLRTX326* -5- SLR-TX – 326

Persons
1 2 3 4
A 10 12 19 11
B 5 10 7 8
Tasks
C 12 14 13 11
D 8 15 11 9
x −1
A( x ) = 1< x ≤ 4 B (x) = 0 x > 7, x ≤ 1
3
7−x x−7
= 4<x≤7 = 7 < x ≤ 10
3 13
13 − x
=0 otherwise = 10 < x ≤ 13
13
Find α B – A.

x
x+2
1 1 1
A( x ) = , B(x) = , C(x ) =
1 + 20 x 1
(1 + 10x )2
(1 + 10 x ) 2
12 − x
15
x−2
A( x ) = 2<x≤5 B(x ) = x − 3 3 < x ≤ 4
3
7−x 9−x
= 5<x≤7 = 4<x≤9
2 5
Set R
SLR-TX – 326 -6- *SLRTX326*
3x2 – x3 + 2x5 ≤ 7, –2x2 + 4x3 ≤ 12
– 4x2 + 3x3 + 8x5 ≤ 10
x2 ≥ 0, x3 ≥ 0 and x5 ≥ 0
x −1
A( x ) = 1< x ≤ 4
3
7−x
= 4<x≤7
3
= 0 x > 7, x ≤ 1
B(x ) = 0 x ≤ 7, x > 13
x−7
= 7 < x ≤ 10
3
13 − x
= 10 < x ≤ 13
13
___________
Set R
Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.

one mark.

A ∩B α α A ∩B
a) S(B, A ) = b) A = ∑ c) B = ∑ d) S(A, B) =
B α α A α αB B
– – – –
a) 1.6 b) 2 c) 1.5 d) 3
rd
1
3
P.T.O.
SLR-TX – 326 -2- *SLRTX326*
a) (3, 4) b) (0, 1) c) (1, 2) d) (2, 3)
A reduced to
th
3
8
1
is 0
a) 0.775 b) 1.55 c) 3.10 d) 0.155

0.4 0.2 0.5 0.4 1
A= + + + +
x y z u v
0.3 1 0.5 0.6 0.3
B= + + + +
x y z u v
A ∩B =

a) 2.5 b) 2.3 c) 1.7 d) 3.6
π
tan x 0≤x≤
0 otherwise
π π π
4 4 4
____________

Set S
*SLRTX326* -3- SLR-TX – 326
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

x + 2y + 3z – u = 10, 2x + 3y – 3z – u = 1
2x – y + 2z + 3u = 7, 3x + 2y – 4z + 3u = 2.
0 .5
 x  rd
e) Evaluate ∫  sin x  dx using simpson’s
  3
0

2 4
1
1 3 5 .2
4
4 2 
c) Find the largest eigen value and corresponding eigen vector of a matrix  by
 1 3 
using power method, taking x  = 0  as initial eigen vector (Perform five iterations).
0  1
 
x + 2y + z = 3, 2x + 3y + 3z = 10, 3x – y + 2z = 13.
Set S
SLR-TX – 326 -4- *SLRTX326*

2 1
3x + 5y + 3z = 4.
Section – II

0 .1 0 .6 0 .9 1 0 .4 0 .1
A (x) = + + + + +
[0, 1) [1, 2) [2, 3) 3 (3, 4] (4, 5]
0.1 0.2 0.6 0.7 0 .9 1 0 .4 0.4 0. 1

B (x) = + + + + + + + +
[0, 1) [1, 2) [2, 3) [3, 4) [4, 5) 5 (5,, 6] (6, 7] (7, 8]

i) [– 1, 2] – [1, 3]
[ − 4, 6]
ii)
[2, 4]
iii) [– 3, 4]  [– 3, 5]
0.5 0.8 0.92 0.36 0.25
x1 x2 x3 x4 x5
α = 0.8, 0.25, 0.5.

e) Max Z = 7x1 + 5x2
Subject to
– x1 – 2x2 ≥ – 6
4x1 + 3x2 ≤ 12
x1, x2 ≥ 0
Set S
*SLRTX326* -5- SLR-TX – 326

Persons
1 2 3 4
A 10 12 19 11
B 5 10 7 8
Tasks
C 12 14 13 11
D 8 15 11 9
x −1
A( x ) = 1< x ≤ 4 B (x) = 0 x > 7, x ≤ 1
3
7−x x−7
= 4<x≤7 = 7 < x ≤ 10
3 13
13 − x
=0 otherwise = 10 < x ≤ 13
13
Find α B – A.

x
x+2
1 1 1
A( x ) = , B(x) = , C(x ) =
1 + 20 x 1
(1 + 10x )2
(1 + 10 x ) 2
12 − x
15
x−2
A( x ) = 2<x≤5 B(x ) = x − 3 3 < x ≤ 4
3
7−x 9−x
= 5<x≤7 = 4<x≤9
2 5
Set S
SLR-TX – 326 -6- *SLRTX326*
3x2 – x3 + 2x5 ≤ 7, –2x2 + 4x3 ≤ 12
– 4x2 + 3x3 + 8x5 ≤ 10
x2 ≥ 0, x3 ≥ 0 and x5 ≥ 0
x −1
A( x ) = 1< x ≤ 4
3
7−x
= 4<x≤7
3
= 0 x > 7, x ≤ 1
B(x ) = 0 x ≤ 7, x > 13
x−7
= 7 < x ≤ 10
3
13 − x
= 10 < x ≤ 13
13
___________
Set S
Seat
No. Set P
S.E. (CSE) (Part – II) (New CBCS) Examination, 2018
theory of computation
Day and Date : Tuesday, 20-11-2018 Total Marks : 70

Time : 2.30 p.m. to 5.30 p.m.


1) How many strings of length less than 4 contains the language described by the
regular expression (x + y)*y(a + ab)* ?
a) 7 b) 10 c) 12 d) 11
2) The behavior of a NFA can be stimulated by DFA
a) always b) sometimes c) never d) depend on NFA
3) Context free language can be recognized by
a) Finite state automaton b) Linear bounded automaton
c) Pushdown automaton d) Both b and c
4) An FSM can be used to add two given integers. This remark is
a) True b) False
c) May be true d) None of the above
5) Given the language L = {ab, aa, baa}, which of the following strings are in L* ?
1) abaabaaabaa 2) aaaabaaaa
3) baaaaabaaaab 4) baaaaabaa
a) 1, 2 and 3 b) 2, 3 and 4 c) 1, 2 and 4 d) 1, 3 and 4
6) An instantaneous description of turing machine consists of
a) Present state and input to be processed
b) Present state and entire input to be processed
c) Present input only
d) None of these
P.T.O.
SLR-TX – 327 -2- *SLRTX327*
7) Which of the following is true for the language {ap | p is prime} ?
a) It is not accepted by a Turing Machine
b) It is regular but not context-free
c) It is context-free but not regular
d) It is neither regular nor context-free, but accepted by a Turing machine
8) Consider the following grammar.
S –> AB
A –> a
A –> BaB
B –> bbA
Which of the following is false ?
a) No string produced by the grammar has four consecutive b s
b) No string produced by the grammar has three consecutive a s
c) No string produced by the grammar has an odd number of consecutive b s
d) The length of every string produced by the grammar is even
9) The regular expression corresponding to the language L where L = {x ∈ {0, 1}* | x
ends with 1 and does not contain substring 00 } is
a) (1 + 01)*(10 + 01) b) (1 + 01)* 01 c) (1 + 01)*(1 + 01) d) (10 + 01)* 01
10) If a CFG has a null production, then it is possible to construct another CFG accepting
the same language without null production
a) True b) False
11) PDA can be represented with the help of
a) Instantaneous description b) Transition diagram
c) Transition table d) All of these
12) Which type of symbols contain in the stack of PDA ?
a) Variable b) Terminal c) Both a and b d) None of these
13) The language which is generated by the grammar S –> aSa I bSb I a I b over the
alphabet {a, b} is the set of
a) Strings that begin and end with the same symbol
b) All odd and even length palindromes
c) All odd length palindromes
d) All even length palindromes
14) Which of the following statement is false ?
a) Context free language is the subset of context sensitive language
b) Regular language is the subset of context sensitive language
c) Recursively enumerable language is the super set of regular language
d) Context sensitive language is a subset of context free language
__________________
Set P
*SLRTX327* -3- SLR-TX – 327
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Answer any three : (4×3=12)
a) Differentiate between DFA and NFA.
b) Define ^ - closure with example.
c) In each case, what is language generated by context free grammar with
indicated grammar with the indicated productions
1) S ->aSa|bSb|a|b 2) S ->SaS|b.
d) Find Context Free Grammar, generating each of these language
{ai bj ck | j = i + k}.

a) Draw DFA for regular expression
1) ab (a + b)*ab 2) (0+1)*(00+11).
b) Consider following NFA – ^

Find whether particular string is accepted or not
1) ∂*(q0,010) 2) ∂*(q0,11) 3) ∂*(q0,101) 4) ∂*(q0,010)
Set P
SLR-TX – 327 -4- *SLRTX327*
4. Minimize the following Finite Automata 8
Section – II
5. Answer any three. (4×3=12)

a) Explain Universal Turing machine.
b) Define DPDA and compare with NPDA.
c) Explain Multitape Turing machine.
d) State and prove pumping lemma of CFL.
6. Solve any one. 8

a) Give transition table for PDA to recognize balanced strings of 2 types “( )” and “[ ]”.
b) Draw Turing machine to accept {a, b}*{aba} {a,b}*.
7. Design a PDA to accept the language having more number of a’s than b’s. 8
___________________

Set P
Seat
No. Set Q

Time : 2.30 p.m. to 5.30 p.m.


S –> AB
A –> a
A –> BaB
B –> bbA
a) (1 + 01)*(10 + 01) b) (1 + 01)* 01 c) (1 + 01)*(1 + 01) d) (10 + 01)* 01
a) True b) False
P.T.O.
SLR-TX – 327 -2- *SLRTX327*
a) 7 b) 10 c) 12 d) 11
a) True b) False
d) None of these
__________________
Set Q
*SLRTX327* -3- SLR-TX – 327
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
{ai bj ck | j = i + k}.

1) ab (a + b)*ab 2) (0+1)*(00+11).

1) ∂*(q0,010) 2) ∂*(q0,11) 3) ∂*(q0,101) 4) ∂*(q0,010)
Set Q
SLR-TX – 327 -4- *SLRTX327*
Section – II

6. Solve any one. 8

___________________

Set Q
Seat
No. Set R

Time : 2.30 p.m. to 5.30 p.m.


d) None of these
S –> AB
A –> a
A –> BaB
B –> bbA
P.T.O.
SLR-TX – 327 -2- *SLRTX327*
a) (1 + 01)*(10 + 01) b) (1 + 01)* 01 c) (1 + 01)*(1 + 01) d) (10 + 01)* 01
a) True b) False
a) 7 b) 10 c) 12 d) 11
a) True b) False
__________________
Set R
*SLRTX327* -3- SLR-TX – 327
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
{ai bj ck | j = i + k}.

1) ab (a + b)*ab 2) (0+1)*(00+11).

1) ∂*(q0,010) 2) ∂*(q0,11) 3) ∂*(q0,101) 4) ∂*(q0,010)
Set R
SLR-TX – 327 -4- *SLRTX327*
Section – II

6. Solve any one. 8

___________________

Set R
Seat
No. Set S

Time : 2.30 p.m. to 5.30 p.m.


a) True b) False
a) 7 b) 10 c) 12 d) 11
P.T.O.
SLR-TX – 327 -2- *SLRTX327*
a) True b) False
d) None of these
S –> AB
A –> a
A –> BaB
B –> bbA
a) (1 + 01)*(10 + 01) b) (1 + 01)* 01 c) (1 + 01)*(1 + 01) d) (10 + 01)* 01
__________________
Set S
*SLRTX327* -3- SLR-TX – 327
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
{ai bj ck | j = i + k}.

1) ab (a + b)*ab 2) (0+1)*(00+11).

1) ∂*(q0,010) 2) ∂*(q0,11) 3) ∂*(q0,101) 4) ∂*(q0,010)
Set S
SLR-TX – 327 -4- *SLRTX327*
Section – II

6. Solve any one. 8

___________________

Set S

Seat
No. Set P
S.E. (Computer Science and Engineering) (Part – II) (New CBCS)
Examination, 2018
microprocessors
Time : 2.30 p.m. to 5.30 p.m.
Instructions : a) Figures in right indicates full marks.

b) Assume suitable data if necessary.
c) Q. No. 1 is compulsory. It should be solved in first
carries one mark.
d) Answer MCQ/Objective type questions on Page No. 3
of Page.


i) Address bus of 8085 is can transmit __________ bits.
a) 8 b) 16 c) 24 d) 32
ii) Data bus of 8085 is
a) bidirectional b) unidirectional
c) 16 bit d) 32 bit
iii) ____________ generate interrupt signal to microprocessor and receive
acknowledge.
a) priority resolver b) control logic
c) interrupt request register d) interrupt register
iv) How many modes 8255 can operate ?
a) two modes b) three modes
c) one mode d) six modes
P.T.O.
SLR-TX – 328 -2- *SLRTX328*
v) In 8086 microprocessor the following has the highest priority among all
type interrupts ?
a) NMI b) DNO c) Type 255 d) OVER FLOW
vi) What is the addressing mode used in instruction MOV M, C ?
a) Direct b) Indirect
c) Immediate d) None of the above
vii) Number of address lines required to interface 1 KB memory are
a) 10 b) 11 c) 12 d) 13
viii) MOV DS, BX is _________ type of addressing mode.
a) Register b) Immediate
c) Direct d) Register Indirect
ix) The ________ translates byte from one code to another code.
a) XLAT b) XCHG
c) POP d) PUSH
x) DMA stands for
a) Direct Memory Allocation b) Distinct Memory Allocation
c) Direct Memory Access d) Distinct Memory Access
xi) Which of the following is the non-maskable interrupt ?
a) RST 7.5 b) TRAP
c) INTR d) RST 6.5
xii) 8085 has total 16 address lines therefore it can address upto ______
memory.
a) 32 K b) 64 K c) 128 K d) 1M
xiii) An instruction consist of
a) Date and Address b) Register and Memory
c) Opcode and Operand d) Input and O/P
xiv) The work of EV in 8086 is
a) encoding b) decoding
c) processing d) calculation
______________
Set P
*SLRTX328* -3- SLR-TX – 328
Seat
No.

Examination, 2018
microprocessors

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

a) What is the program counter and stack pointer of 8085 ?
b) What are basic features of 8086 ?
c) Write an program to arrange numbers in ascending order of the given array
using 8086.
d) With neat pin diagram explain maximum mode pins of 8086.

a) Draw the functional architecture of 8085 microprocessor neatly labeling the
data paths, registers etc. Briefly explain function of each.
b) Draw and explain pin diagram of 8086.
c) Explain the following instruction with example.
i) LDS reg 16, memptr 16
ii) LEA reg 16, memptr or variable
iii) MUL BH
iv) DIV CL
v) MOV dst, src
vi) XCHG dst, src
Set P
SLR-TX – 328 -4- *SLRTX328*
SECTION – II

a) Explain interrupt sequence in detail. Also explain interrupt sequence for
INTR interrupt.
b) Explain control register of 8087 coprocessor in detail.
c) Draw 8257 architecture (DMA controller).
d) Explain control word format for I/O mode of 8255.

a) Draw and explain Programmable Interrupt Controller (8259).
b) With neat pin diagram explain pins of 8087 coprocessor.
c) Draw and explain 80386 Architecture.
____________
Set P

Seat
No. Set Q
Examination, 2018
microprocessors
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


i) MOV DS, BX is _________ type of addressing mode.
ii) The ________ translates byte from one code to another code.
a) XLAT b) XCHG
c) POP d) PUSH
iii) DMA stands for
iv) Which of the following is the non-maskable interrupt ?
a) RST 7.5 b) TRAP
c) INTR d) RST 6.5
P.T.O.
SLR-TX – 328 -2- *SLRTX328*
v) 8085 has total 16 address lines therefore it can address upto ______
memory.
a) 32 K b) 64 K c) 128 K d) 1M
vi) An instruction consist of
vii) The work of EV in 8086 is
viii) Address bus of 8085 is can transmit __________ bits.
a) 8 b) 16 c) 24 d) 32
ix) Data bus of 8085 is
c) 16 bit d) 32 bit
x) ____________ generate interrupt signal to microprocessor and receive
acknowledge.
xi) How many modes 8255 can operate ?
xii) In 8086 microprocessor the following has the highest priority among all
type interrupts ?
xiii) What is the addressing mode used in instruction MOV M, C ?
xiv) Number of address lines required to interface 1 KB memory are
a) 10 b) 11 c) 12 d) 13
______________
Set Q
*SLRTX328* -3- SLR-TX – 328
Seat
No.

Examination, 2018
microprocessors

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

using 8086.

iii) MUL BH
iv) DIV CL
v) MOV dst, src
vi) XCHG dst, src
Set Q
SLR-TX – 328 -4- *SLRTX328*
SECTION – II

INTR interrupt.

____________
Set Q

Seat
No. Set R
Examination, 2018
microprocessors
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


i) In 8086 microprocessor the following has the highest priority among all
type interrupts ?
a) NMI b) DNO
c) Type 255 d) OVER FLOW
ii) What is the addressing mode used in instruction MOV M, C ?
iii) Number of address lines required to interface 1 KB memory are
a) 10 b) 11 c) 12 d) 13
iv) MOV DS, BX is _________ type of addressing mode.
P.T.O.
SLR-TX – 328 -2- *SLRTX328*
v) The ________ translates byte from one code to another code.

a) XLAT b) XCHG
c) POP d) PUSH
vi) DMA stands for
vii) Which of the following is the non-maskable interrupt ?
a) RST 7.5 b) TRAP
c) INTR d) RST 6.5
viii) 8085 has total 16 address lines therefore it can address upto ______
memory.
a) 32 K b) 64 K c) 128 K d) 1M
ix) An instruction consist of
x) The work of EV in 8086 is
xi) Address bus of 8085 is can transmit __________ bits.
a) 8 b) 16 c) 24 d) 32
xii) Data bus of 8085 is
c) 16 bit d) 32 bit
xiii) ____________ generate interrupt signal to microprocessor and receive
acknowledge.
xiv) How many modes 8255 can operate ?
______________
Set R
*SLRTX328* -3- SLR-TX – 328
Seat
No.

Examination, 2018
microprocessors

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

using 8086.

iii) MUL BH
iv) DIV CL
v) MOV dst, src
vi) XCHG dst, src
Set R
SLR-TX – 328 -4- *SLRTX328*
SECTION – II

INTR interrupt.

____________
Set R

Seat
No. Set S
Examination, 2018
microprocessors
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


i) DMA stands for
ii) Which of the following is the non-maskable interrupt ?
a) RST 7.5 b) TRAP
c) INTR d) RST 6.5
iii) 8085 has total 16 address lines therefore it can address upto ______
memory.
a) 32 K b) 64 K c) 128 K d) 1M
iv) An instruction consist of
P.T.O.
SLR-TX – 328 -2- *SLRTX328*
v) The work of EV in 8086 is

vi) Address bus of 8085 is can transmit __________ bits.
a) 8 b) 16 c) 24 d) 32
vii) Data bus of 8085 is
c) 16 bit d) 32 bit
viii) ____________ generate interrupt signal to microprocessor and receive
acknowledge.
ix) How many modes 8255 can operate ?
x) In 8086 microprocessor the following has the highest priority among all
type interrupts ?
xi) What is the addressing mode used in instruction MOV M, C ?
xii) Number of address lines required to interface 1 KB memory are
a) 10 b) 11 c) 12 d) 13
xiii) MOV DS, BX is _________ type of addressing mode.
xiv) The ________ translates byte from one code to another code.
a) XLAT b) XCHG
c) POP d) PUSH
______________
Set S
*SLRTX328* -3- SLR-TX – 328
Seat
No.

Examination, 2018
microprocessors

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

using 8086.

iii) MUL BH
iv) DIV CL
v) MOV dst, src
vi) XCHG dst, src
Set S
SLR-TX – 328 -4- *SLRTX328*
SECTION – II

INTR interrupt.

____________
Set S

Seat
No. Set P
data structure
Time : 2.30 p.m. to 5.30 p.m.
Instructions : 1) Q. No. 1 is compulsory. It should be solved in first 30
minutes in Answer Book Page No. 3. Each question
carries one mark.
of Page.

1. Choose the correct alternative : (14×1=14)

1) Stack is a ___________data structure.
a) Non-linear b) Linear
c) Both d) None of the above
2) An infix expression can be converted to a postfix expression using a
a) Stack b) Queue
c) Dequeue d) None of the above
3) Enque operation of queue makes
a) rear = rear + 1 b) front = rear + 1
c) front = rear – 1 d) none of the above
4) The result of an illegal attempt to remove an element from an empty
queue is
a) underflow b) empty c) full d) error
5) How many files are contained in each node in Doubly linked list
a) atmost 2 b) atleast 3
c) exactly 2 d) none of the above
6) ________ traversal of binary search tree outputs the value in sorted order.
a) Pre-order b) In-order
c) Post-order d) None of the above
7) A binary search tree is generated by inserting in order the following integers :
90, 15,62, 120, 98,91,3,8,97,160, 124
a) (4,6) b) (5, 5) c) (3,7) d) None of the above
P.T.O.
SLR-TX – 329 -2- *SLRTX329*
8) Pre-order traversal is also called
a) Depth first b) Breadth first c) Level order d) In-order
9) The depth of root node is
a) 0 b) 1 c) 2 d) 3
10) An edge that has identical end-points is called a
a) Multi-path b) Loop c) Cycle d) Multi-edge
11) Every internal node of an M-way search tree consists of pointer to M
sub-tree and contains how many keys ?
a) M b) M –1 c) 2 d) M + 1
12) Every node in a B tree has at most ________ children.
a) M b) M –1 c) 2 d) M + 1
13) In the worst case, a binary search tree will take how much time to search
an elements ?
a) O(n) b) O(log n) c) O(n2) d) O(n log n)
14) How much time does an AVL tree take to perform search, insert, and delete
operations in the average case as well as the worst case?
______________
Set P
*SLRTX329* -3- SLR-TX – 329
Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

a) Define stack. Explain PUSH and POP operation using array.
b) Write a C program to implement queue operations using array.
c) Explain insertion operation in doubly linked list at the end of the list.
d) Define the following with example :
i) Binary search tree
ii) Complete binary tree
e) Explain applications of STACK.
f) Explain data structure and its importance.

a) Write a C Program to convert the given infix expression to postfix
expression.
b) Write an program to implement the following for the singly Circular Linked
List (CLL).
i) add new element at end of the list
ii) display all the elements
iii) search particular element in the CLL
c) Explain Priority queue. Explain operations with example.
d) What is threaded binary tree ? Explain the insertion of a node in threaded
binary tree.
Set P
SLR-TX – 329 -4- *SLRTX329*
SECTION – II

a) Explain balanced tree with example.
b) Differentiate between B and B+ Tree.
c) Explain type of rotation in AVL tree.
d) Explain what kind of problem occurs while deleting a node from AVL tree.
e) Explain the terminologies.
a) source
b) sink
c) DAG
d) clique
f) Explain BFS algorithm.

a) Construct B tree of order 3
84 17 82 78 81 45 42 2 11
b) Insert the following element in AVL tree and Delete 37.
37, 25, 52, 73, 84, 48, 81, 18, 72, 27
c) Write a program to represent Graph using adjacency list.
_____________________
Set P

Seat
No. Set Q
data structure
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) 0 b) 1 c) 2 d) 3
a) M b) M –1 c) 2 d) M + 1
a) M b) M –1 c) 2 d) M + 1
an elements ?
P.T.O.
SLR-TX – 329 -2- *SLRTX329*
a) Stack b) Queue
queue is
90, 15,62, 120, 98,91,3,8,97,160, 124

______________
Set Q
*SLRTX329* -3- SLR-TX – 329
Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


expression.
List (CLL).
binary tree.
Set Q
SLR-TX – 329 -4- *SLRTX329*
SECTION – II

a) source
b) sink
c) DAG
d) clique

84 17 82 78 81 45 42 2 11
37, 25, 52, 73, 84, 48, 81, 18, 72, 27
_____________________
Set Q

Seat
No. Set R
data structure
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


90, 15,62, 120, 98,91,3,8,97,160, 124
a) 0 b) 1 c) 2 d) 3
a) M b) M –1 c) 2 d) M + 1
a) M b) M –1 c) 2 d) M + 1
P.T.O.
SLR-TX – 329 -2- *SLRTX329*
an elements ?
a) Stack b) Queue
queue is
______________
Set R
*SLRTX329* -3- SLR-TX – 329
Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


expression.
List (CLL).
binary tree.
Set R
SLR-TX – 329 -4- *SLRTX329*
SECTION – II

a) source
b) sink
c) DAG
d) clique

84 17 82 78 81 45 42 2 11
37, 25, 52, 73, 84, 48, 81, 18, 72, 27
_____________________
Set R

Seat
No. Set S
data structure
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) Multi-path b) Loop
c) Cycle d) Multi-edge
a) M b) M –1 c) 2 d) M + 1
a) M b) M –1 c) 2 d) M + 1
an elements ?
a) O(n) b) O(log n)
c) O(n )
2
d) O(n log n)
a) Stack b) Queue
P.T.O.
SLR-TX – 329 -2- *SLRTX329*
queue is
90, 15,62, 120, 98,91,3,8,97,160, 124
a) 0 b) 1 c) 2 d) 3
______________
Set S
*SLRTX329* -3- SLR-TX – 329
Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


expression.
List (CLL).
binary tree.
Set S
SLR-TX – 329 -4- *SLRTX329*
SECTION – II

a) source
b) sink
c) DAG
d) clique

84 17 82 78 81 45 42 2 11
37, 25, 52, 73, 84, 48, 81, 18, 72, 27
_____________________
Set S

Seat
No. Set P
S.E. (C.S.E.) (Part – II) (New) (CBCS) Examination, 2018
Computer Networks
Time : 2.30 p.m. to 5.30 p.m.
2) First question is objective type.
4) Q. No. 1 is compulsory. It should be solved in first
carries one mark.
of Page.

1. Choose correct alternative : 14

1) Address space of IPv4 is
a) 28 b) 216 c) 232 d) 264
2) A computer that uses the ____________ system stores the LSB of data in
the starting address of the data unit.
a) Little-Endian b) Big-Endian
3) ___________ of SCTP involves multiple streams.
a) Packets b) Association
c) Multihoming d) None of above
4) In ___________ addressing the whole address space is divided into variable
length blocks.
a) Classfull b) Classless
5) Error control in TCP is achieved through
a) Checksum b) Acknowledgement
c) Time-out d) All the above
6) Port addresses are ___________ bits in length.
a) 32 Bits b) 64 Bits c) 48 Bits d) 16 Bits
P.T.O.
SLR-TX– 330 -2- *SLRTX330*
7) In out-of-band signalling, which of the following command is act as Urgent
Pointer ?
a) DM b) IP c) IAC d) All the above
8) Port forwarding is also known as
a) Component forwarding b) SSH packet forwarding
c) SSH - application forwarding d) SSH tunnelling
9) SSH uses ___________ communication protocol.
a) UDP b) TCP c) SCTP d) FTP
10) In ___________ sequence of character is without structure.
a) Flat Name Space b) Hierarchical Name Space
c) Zone Name Space d) None of above
11) A packet in SCTP is called as
a) Datagram b) Segment c) Chunk d) Block
12) Which of the following is/are Message Transfer Agent ?
a) POP b) IMAP c) SMTP d) Both a) and b)
13) The ___________ is a technology that creates and handles Dynamic
web documents. It defines how document is written, how data are input to
program and how output result is used.
a) CGI b) NVT c) SSH d) TELNET
14) Which of the following statement is incorrect ?
Statement 1 : UDP is connectionless, unreliable transport protocol
Statement 2: UDP provide flow control.
Statement 3: UDP provide encapsulation and decapsulation service
a) Statement 1 and 2 b) Statement 1 and 3
c) Statement 2 and 3 d) Statement 2

______________
Set P
*SLRTX330* -3- SLR-TX – 330
Seat
No.

Computer Networks
Time : 2.30 p.m. to 5.30 p.m.

2) Each Section carries 28 marks.
3) Attempt all questions in each Section.
SECTION – I
2. Attempt any three (Each carries 4 marks) : (3×4=12)

1) Explain IP Datagram in detail.
2) What is Queuing in UDP ? Explain with diagram.
3) Explain SCTP packet format in detail.
4) The following is the dump of UDP header in Hexadecimal format
CB84000D001C001C
Find Source port number, Destination port number, Total length of the
user datagram, length of the data, Direction of packet and Name of client
process.
5) What do you mean by Concurrency in client and server ?

1) Explain Windows in TCP.
2) Explain Socket structure also explain any 4 Socket System calls with
syntax.
3) What is Fragmentation in IP ? Explain with example.
Set P
SLR-TX – 330 -4- *SLRTX330*
SECTION – II

1) Explain BOOTP operation. Why need of DHCP ?
2) Explain Generic and Country Domains of DNS.
3) Explain Message Access Agent in detail.
4) What is SSH ? Explain format of SSH Packet.
5) Write a short note on FTP.

1) Explain DHCP packet format in detail.
2) Explain Email architecture with its third scenario.
3) What is Remote Login ? Explain the concept of NVT.s.
_____________________
Set P

Seat
No. Set Q
Computer Networks
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) POP b) IMAP
c) SMTP d) Both a) and b)
a) CGI b) NVT
c) SSH d) TELNET
P.T.O.
SLR-TX– 330 -2- *SLRTX330*
a) 28 b) 216 c) 232 d) 264
length blocks.
Pointer ?

______________
Set Q
*SLRTX330* -3- SLR-TX – 330
Seat
No.

Computer Networks
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

CB84000D001C001C
process.

syntax.
Set Q
SLR-TX – 330 -4- *SLRTX330*
SECTION – II


_____________________
Set Q

Seat
No. Set R
Computer Networks
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


Pointer ?
P.T.O.
SLR-TX– 330 -2- *SLRTX330*
a) 28 b) 216 c) 232 d) 264
length blocks.

______________
Set R
*SLRTX330* -3- SLR-TX – 330
Seat
No.

Computer Networks
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

CB84000D001C001C
process.

syntax.
Set R
SLR-TX – 330 -4- *SLRTX330*
SECTION – II


_____________________
Set R

Seat
No. Set S
Computer Networks
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


P.T.O.
SLR-TX– 330 -2- *SLRTX330*
a) 28 b) 216 c) 232 d) 264
length blocks.
Pointer ?

______________
Set S
*SLRTX330* -3- SLR-TX – 330
Seat
No.

Computer Networks
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

CB84000D001C001C
process.

syntax.
Set S
SLR-TX – 330 -4- *SLRTX330*
SECTION – II


_____________________
Set S

Seat
No. Set P
S.E. (CSE) (Part – II) (Old CGPA) Examination, 2018
applied mathematics – ii
Time : 2.30 p.m. to 5.30 p.m.
Instructions : 1) Attempt any three questions from each Section.
3) Use of scientific calculator is allowed.
carries one mark.
of Page.


1) The rate of convergence of regula falsi method is
a) 1.235 b) 3.141 c) 1.618 d) None of these
2) Newton’s iterative formula to find the value of N is
1 N 1 N
a) xn+1 =  xn −  b) xn+1 =  xn + 
2 Xn  2 xn 

1 1
c) xn+1 = [ xn − Nxn ] d) xn+1 = [ xn + Nxn ]
2 2
3) Which of the following is a direct method ?
a) Newton-Raphson b) Bisection
c) Gauss Elimination d) Gauss Seidal
4) In solving simultaneous equations by Gauss Jordan method the coefficient
matrix is reduced to
a) Unit matrix b) Diagonal matrix
c) Null matrix d) Square matrix
5) The process of evaluating a definite integral from a set of tabulated
values of the intergrated F(x) is
a) Numerical value b) Numerical differentiation
c) Numerical integration d) None of these
P.T.O.
SLR-TX – 331 -2- *SLRTX331*
6) Simpson’s one-third rule is used when number of subintervals are in
a) Multiples of 1 b) Multiples of 2 c) Multiples of 3 d) None of these
7) Using Bisection method, a second approximation to the root of the equation
x3 – 4x – 9 = 0 between 2 and 3 is
a) 2.95 b) 2.85 c) 2.75 d) 2.25
8) If XA = [2x – 1, 3 – 2x] and XB = [2x + 1, 5 – 2x] then for x ∈ (0, 1], XA+B =
a) [4x – 6, 2 – 4x] b) [4x, 8 – 4x] c) [4x, 8 + 4x] d) [3x, 8 – 4x]
9) Fuzzy cardinality of fuzzy set is
a) Level set b) Fuzzy number
c) Fuzzy set d) A real number
10) A ordinary fuzzy set is also called as
a) Type 2 fuzzy set b) Level 2 fuzzy set
c) Type 1 level 1 fuzzy set d) Type 2 level 2 fuzzy set
11) The crisp rule p → q : q → r ∴ p → R is known as
a) disjunctive syllogism b) hypothetical syllogism
c) modus ponens d) modus tollens
2
1  1 
12) If C ( x ) = and D ( x ) =   x ≥ 0 then ordering of fuzzy set is
1 + 5x  1 + 5x 
a) D ≤ C b) C ≤ D c) C = D d) C = D
13) If A is a fuzzy set, A(x) = A ( x ) , x ∈ X then x is called as
a) Special point b) Equilibrium point
c) Middle point d) Point of intersections
x
14) For the fuzzy set A(x) = x ∈ {1, 2, 3, 4, 5} scalar cardinality of A ( x ) is
x+2
approximately
a) 2.1857 b) 2.8143 c) 2.8157 d) 1.1857
______________
Set P
*SLRTX331* -3- SLR-TX – 331
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Solve the following : (3×3=9)
a) Perform 4 iterations of Gauss-Jacobi’s method to find the solution of

the following system correct upto 4 decimal places 10x + y – 2z = 7.74,
x + 12y + 3z = 39.66, 3x + 4y + 15z = 54.8.
b) Solve the following system of equations using Gauss Elimination method
x + y + z = 9, 2x – 3y + 4z = 13, 3x + 4y + 5z = 40.
c) Perform three iterations of power method to find largest eigenvalue of the

following matrix correct upto three decimal places taking X0 = [0, 0, 1] T as
1 3 −1
initial approximation  3 2 4  .

 −1 4 10 
a) Find a positive real root of the equation cosx = 3x – 1 correct to 4 decimal

places using method of false position.
b) Perform six iterations of Bisection method to find positive real root of the
equation x3 – 2x – 5 = 0 correct upto 4 decimal places.
Set P
SLR-TX – 331 -4- *SLRTX331*

7
∫ sin ( x ) dx taking 7 ordinates using Trapezoidal rule. Correct

2
a) Evaluate
1
upto 4 decimal places.
π/2
th π
b) Evaluate ∫ cos x dx using Simpson’s 3 rule taking h =
12
correct upto
0 8
4 decimal places.
2
dx
c) Use Romberg’s method to compute ∫ x
correct upto 4 decimal places by
1
taking h = 0.5, 0.25.
5. Solve the following (Attempt any three) : (3×3=9)

a) Find a real root of the equation x3 – x – 4 = 0 correct to 4 decimal places
using Newton-Raphson method taking initial approximation x0 = 1.5.
b) Solve the following system of equations using Gauss Jordan method
x + 3y + z = 3, x + 4y + 2z = 3, –x – 2y + 3z = –6.
2
−x
c) Evaluate ∫e x dx using Weddle’s rule taking 7 ordinates correct upto
1
4 decimal places.
1
dx
d) Evaluate ∫ 1+ x2 using Gauss formula for n = 2.
−1
SECTION – II
6. a) Sketch the graphs of fuzzy sets A and B defined by

i) A(x) = 2–x x ∈ X = [0, 10]
x
ii) B ( x ) = x ∈ X = [0, 10]
x + 2
also find their α-cut interval. 4
Set P
*SLRTX331* -5- SLR-TX – 331
b) If A and B are fuzzy sets defined on universal set X given by

0 .5 1 0 .5 0 .3
A (x) =
+ + +
−1 0 1 2
0 .5 1 0 .5 0 .3
B(x) = + + +
2 3 4 5
and let f : X × X → X be defined by f(x1, x2) = x2 – x1, x1x2 ∈ X then find
f(A, B) by using an extension principle. 5
7. a) Define the following terms :

ii) Degree of subsethood. 4
b) Solve the fuzzy equation A.X = B where 6
x − 4 4 < x ≤ 5

A ( x ) = 6 − x 5 < x ≤ 6
 0 otherwise

 x − 10 10 < x ≤ 20
 10

 35 − x 20 < x ≤ 35
B (x) = 
 15
 0 otherwise


OR
b) Let A and B be two fuzzy numbers whose membership functions are given by
 x + 1 −1 < x ≤ 1
 2

3 − x 1< x ≤ 3
A (x) = 
 2
 0 otherwise


 x − 1 1< x ≤ 3
 2

5 − x 3 < x ≤ 5
B(x) = 
 2
 0 otherwise


then find MIN (A, B). 6
Set P
SLR-TX – 331 -6- *SLRTX331*
8. a) Let A be a fuzzy set defined by

0 .5 0 .4 0 .7 0 .8 1
A= + + + +
1 1 .5 2 2 .5 3
List all α-cuts and strong α-cuts of A. 4

b) Calculate the fuzzy number B – A with the membership functions as 5
 x − 1 1< x ≤ 4
 3

7 − x 4 < x ≤ 7
A (x) = 
 3
 0 x > 7, x ≤ 1



 0 x ≥ 7, x < 13

 x−7 7 < x ≤ 10
B(x) = 
 13
13 − x 10 < x ≤ 13
 13

9. a) Explain the concept of fuzzy quantifiers. 4

b) Write down the conditions for a fuzzy set to qualify as a fuzzy number.
Determine which of the following functions are fuzzy numbers 5
sin x for 0 ≤ x ≤ π
i) A ( x ) = 
 0 otherwise
min{1, x} for x ≥ 0
ii) B ( x ) = 
 0 otherwise

_____________________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) [4x – 6, 2 – 4x] b) [4x, 8 – 4x] c) [4x, 8 + 4x] d) [3x, 8 – 4x]
2
1  1 
1 + 5x  1 + 5x 
a) D ≤ C b) C ≤ D c) C = D d) C = D
P.T.O.
SLR-TX – 331 -2- *SLRTX331*
x
x+2
approximately
a) 2.1857 b) 2.8143 c) 2.8157 d) 1.1857
1 N 1 N
a) xn+1 =  xn −  b) xn+1 =  xn + 
2 Xn  2 xn 

1 1
2 2
a) 2.95 b) 2.85 c) 2.75 d) 2.25
______________
Set Q
*SLRTX331* -3- SLR-TX – 331
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

x + 12y + 3z = 39.66, 3x + 4y + 15z = 54.8.
x + y + z = 9, 2x – 3y + 4z = 13, 3x + 4y + 5z = 40.

1 3 −1

 −1 4 10 

Set Q
SLR-TX – 331 -4- *SLRTX331*

7

2
a) Evaluate
1
π/2
th π
12
correct upto
0 8
4 decimal places.
2
dx
1
taking h = 0.5, 0.25.

x + 3y + z = 3, x + 4y + 2z = 3, –x – 2y + 3z = –6.
2
−x
1
4 decimal places.
1
dx
−1
SECTION – II

i) A(x) = 2–x x ∈ X = [0, 10]
x
ii) B ( x ) = x ∈ X = [0, 10]
x + 2
Set Q
*SLRTX331* -5- SLR-TX – 331

0 .5 1 0 .5 0 .3
A (x) =
+ + +
−1 0 1 2
0 .5 1 0 .5 0 .3
B(x) = + + +
2 3 4 5

x − 4 4 < x ≤ 5

A ( x ) = 6 − x 5 < x ≤ 6
 0 otherwise

 x − 10 10 < x ≤ 20
 10

 35 − x 20 < x ≤ 35
B (x) = 
 15
 0 otherwise


OR
 x + 1 −1 < x ≤ 1
 2

3 − x 1< x ≤ 3
A (x) = 
 2
 0 otherwise


 x − 1 1< x ≤ 3
 2

5 − x 3 < x ≤ 5
B(x) = 
 2
 0 otherwise


Set Q
SLR-TX – 331 -6- *SLRTX331*

0 .5 0 .4 0 .7 0 .8 1
A= + + + +
1 1 .5 2 2 .5 3

 x − 1 1< x ≤ 4
 3

7 − x 4 < x ≤ 7
A (x) = 
 3
 0 x > 7, x ≤ 1



 0 x ≥ 7, x < 13

 x−7 7 < x ≤ 10
B(x) = 
 13
13 − x 10 < x ≤ 13
 13


i) A ( x ) = 
 0 otherwise
ii) B ( x ) = 
 0 otherwise

_____________________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) 2.95 b) 2.85
c) 2.75 d) 2.25
a) [4x – 6, 2 – 4x] b) [4x, 8 – 4x] c) [4x, 8 + 4x] d) [3x, 8 – 4x]
P.T.O.
SLR-TX – 331 -2- *SLRTX331*
2
1  1 
1 + 5x  1 + 5x 
a) D ≤ C b) C ≤ D c) C = D d) C = D
x
x+2
approximately
a) 2.1857 b) 2.8143 c) 2.8157 d) 1.1857
1 N 1 N
a) xn+1 =  xn −  b) xn+1 =  xn + 
2 Xn  2 xn 

1 1
2 2
______________
Set R
*SLRTX331* -3- SLR-TX – 331
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

x + 12y + 3z = 39.66, 3x + 4y + 15z = 54.8.
x + y + z = 9, 2x – 3y + 4z = 13, 3x + 4y + 5z = 40.

1 3 −1

 −1 4 10 

Set R
SLR-TX – 331 -4- *SLRTX331*

7

2
a) Evaluate
1
π/2
th π
12
correct upto
0 8
4 decimal places.
2
dx
1
taking h = 0.5, 0.25.

x + 3y + z = 3, x + 4y + 2z = 3, –x – 2y + 3z = –6.
2
−x
1
4 decimal places.
1
dx
−1
SECTION – II

i) A(x) = 2–x x ∈ X = [0, 10]
x
ii) B ( x ) = x ∈ X = [0, 10]
x + 2
Set R
*SLRTX331* -5- SLR-TX – 331

0 .5 1 0 .5 0 .3
A (x) =
+ + +
−1 0 1 2
0 .5 1 0 .5 0 .3
B(x) = + + +
2 3 4 5

x − 4 4 < x ≤ 5

A ( x ) = 6 − x 5 < x ≤ 6
 0 otherwise

 x − 10 10 < x ≤ 20
 10

 35 − x 20 < x ≤ 35
B (x) = 
 15
 0 otherwise


OR
 x + 1 −1 < x ≤ 1
 2

3 − x 1< x ≤ 3
A (x) = 
 2
 0 otherwise


 x − 1 1< x ≤ 3
 2

5 − x 3 < x ≤ 5
B(x) = 
 2
 0 otherwise


Set R
SLR-TX – 331 -6- *SLRTX331*

0 .5 0 .4 0 .7 0 .8 1
A= + + + +
1 1 .5 2 2 .5 3

 x − 1 1< x ≤ 4
 3

7 − x 4 < x ≤ 7
A (x) = 
 3
 0 x > 7, x ≤ 1



 0 x ≥ 7, x < 13

 x−7 7 < x ≤ 10
B(x) = 
 13
13 − x 10 < x ≤ 13
 13


i) A ( x ) = 
 0 otherwise
ii) B ( x ) = 
 0 otherwise

_____________________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


2
1  1 
1 + 5x  1 + 5x 
a) D ≤ C b) C ≤ D c) C = D d) C = D
x
x+2
approximately
a) 2.1857 b) 2.8143 c) 2.8157 d) 1.1857
P.T.O.
SLR-TX – 331 -2- *SLRTX331*
1 N 1 N
a) xn+1 =  xn −  b) xn+1 =  xn + 
2 Xn  2 xn 

1 1
2 2
a) 2.95 b) 2.85 c) 2.75 d) 2.25
a) [4x – 6, 2 – 4x] b) [4x, 8 – 4x] c) [4x, 8 + 4x] d) [3x, 8 – 4x]
______________
Set S
*SLRTX331* -3- SLR-TX – 331
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

x + 12y + 3z = 39.66, 3x + 4y + 15z = 54.8.
x + y + z = 9, 2x – 3y + 4z = 13, 3x + 4y + 5z = 40.

1 3 −1

 −1 4 10 

Set S
SLR-TX – 331 -4- *SLRTX331*

7

2
a) Evaluate
1
π/2
th π
12
correct upto
0 8
4 decimal places.
2
dx
1
taking h = 0.5, 0.25.

x + 3y + z = 3, x + 4y + 2z = 3, –x – 2y + 3z = –6.
2
−x
1
4 decimal places.
1
dx
−1
SECTION – II

i) A(x) = 2–x x ∈ X = [0, 10]
x
ii) B ( x ) = x ∈ X = [0, 10]
x + 2
Set S
*SLRTX331* -5- SLR-TX – 331

0 .5 1 0 .5 0 .3
A (x) =
+ + +
−1 0 1 2
0 .5 1 0 .5 0 .3
B(x) = + + +
2 3 4 5

x − 4 4 < x ≤ 5

A ( x ) = 6 − x 5 < x ≤ 6
 0 otherwise

 x − 10 10 < x ≤ 20
 10

 35 − x 20 < x ≤ 35
B (x) = 
 15
 0 otherwise


OR
 x + 1 −1 < x ≤ 1
 2

3 − x 1< x ≤ 3
A (x) = 
 2
 0 otherwise


 x − 1 1< x ≤ 3
 2

5 − x 3 < x ≤ 5
B(x) = 
 2
 0 otherwise


Set S
SLR-TX – 331 -6- *SLRTX331*

0 .5 0 .4 0 .7 0 .8 1
A= + + + +
1 1 .5 2 2 .5 3

 x − 1 1< x ≤ 4
 3

7 − x 4 < x ≤ 7
A (x) = 
 3
 0 x > 7, x ≤ 1



 0 x ≥ 7, x < 13

 x−7 7 < x ≤ 10
B(x) = 
 13
13 − x 10 < x ≤ 13
 13


i) A ( x ) = 
 0 otherwise
ii) B ( x ) = 
 0 otherwise

_____________________
Set S
Seat
No.
Set P
THEORY OF COMPUTATION

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.
1. Choose the correct alternative (s) from the following : 14
1) Finite automata has

a) Finite Memory b) Finite control
c) Read only head d) All a), b), c)
2) The language accepted by finite automata is

a) Context free b) Regular
c) Non-regular d) None
3) A FA can be used for

a) String recognition b) Arithmetic operations
4) A finite automata is a/an

a) Acceptor b) Computing device
P.T.O.
SLR-TX – 332 -2- *SLRTX332*
5) Regular expressions are
a) Compact representation of strings
b) Representation of strings over some alphabet
c) Compact representation of certain set of strings in algebric manner
d) None
6) If L1 and L2 are two regular languages, then concatenation of L1 and L2 is
a) L1L2 b) L1.L2 c) L1 × L2 d) None
7) Turing machine was invented by :
a) Alan Turing b) Turing man c) Turing taring d) None of these
8) Turing machine is more powerful than
a) Finite automata b) Push down automata
9) A UTM is a
a) Programmable TM b) Two tape TM
c) Single tape TM d) None
10) Turing machine can be represented using
a) Transition table b) Transition diagram
c) Instantaneous description d) All of these
11) Which of the following is an extension to the basic model of turing machine ?
a) Multitude turing machine b) Multi head turing machine
c) Offline turing machine d) All of the above
12) A PDA accepts
a) Regular language b) CFL
c) CSL d) Both a) and b)
13) A grammer G can be described by
a) (Vn,∑, P, S) b) (∑, P, S) c) (Vn, P, S) d) (Vn,∑, P)
____________

Set P
*SLRTX332* -3- SLR-TX – 332
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
1) Compare between NFA and DFA.
2) L = {x|x contains substring 010} Draw Finite Automata.
3) Derive CFC to accept lang. L = {ai bi ck | j > i + k}.
4) Define ^ - closure.
1) Construct NFA-^ for (00 + 1) * (10) * using Kleen’s thermo.
2) Convert the following CFG to CNF.
S ->AACD
A -> aAb | ^
C ->cC |a
D->aDa |bDb| ^
3) Using subset construction method converts following NFA to FA.
Set P
SLR-TX – 332 -4- *SLRTX332*
SECTION – II
1) What is PDA ?
2) Explain basic Turing machine model.
3) Obtain a Turing Machine to accept the language containing string of 0’s

and 1’s and ending with 011.
4) Explain pumping lemma for regular language.
1) Design a PDA to accept a language of odd length Palindromes.
2) Design a Turing machine to accept the lang. L = {anbn ≥ 1}. Show an ID

for the string aaabbb with tape symbols.
3) What are the types of acceptance by a PDA ?
_________________

Set P
Seat
No.
Set q

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

2) A UTM is a
5) A PDA accepts
P.T.O.
SLR-TX – 332 -2- *SLRTX332*




d) None

____________
Set Q
*SLRTX332* -3- SLR-TX – 332
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
S ->AACD
A -> aAb | ^
C ->cC |a
D->aDa |bDb| ^
Set Q
SLR-TX – 332 -4- *SLRTX332*
SECTION – II
1) What is PDA ?


_________________

Set Q
Seat
No.
Set R

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

d) None
5) A UTM is a
P.T.O.
SLR-TX – 332 -2- *SLRTX332*
8) A PDA accepts





____________
Set R
*SLRTX332* -3- SLR-TX – 332
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
S ->AACD
A -> aAb | ^
C ->cC |a
D->aDa |bDb| ^
Set R
SLR-TX – 332 -4- *SLRTX332*
SECTION – II
1) What is PDA ?


_________________

Set R
Seat
No.
Set S

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

3) A PDA accepts
P.T.O.
SLR-TX – 332 -2- *SLRTX332*



d) None
14) A UTM is a

____________
Set S
*SLRTX332* -3- SLR-TX – 332
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
S ->AACD
A -> aAb | ^
C ->cC |a
D->aDa |bDb| ^
Set S
SLR-TX – 332 -4- *SLRTX332*
SECTION – II
1) What is PDA ?


_________________

Set S

Seat
No. Set P
microprocessors
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


1) The addressing mode used in MVI A, 04H is
a) Absolute b) Indirect
c) Immediate d) Direct
2) Vector address of RST 7.5 interrupt is
a) 0024 H b) 003 CH
c) 0034 H d) 002 CH
3) Special purpose register is
a) Program array b) Stack pointer
c) Index pointer d) Queue pointer
4) Mention the type of machine cycle for the following status and control
signals
IO/M = 1, S1 = 1, S0 = 0 RD = 0
a) I/O Read b) I/O Write
c) Opcode fetch d) Memory Read
5) The no. of address lines required to address a memory of size 64 KB is
a) 15 lines b) 16 lines
c) 18 lines d) 14 lines
P.T.O.
SLR-TX – 333 -2- *SLRTX333*
6) Register B contains 65 H and accumulator has 97 H, what is status of s, z, cy

flags after subtracting contents of Register B from accumulator ?
a) s = 0, z = 1, cy = 0 b) s = 1, z = 0, cy = 0
c) s = 0, z = 0, cy = 0 d) s = 1, z = 0, cy = 1
7) JMP 3200 is how many byte instruction ?
a) 1 byte instruction b) 2 byte instruction
c) 3 byte instruction d) 4 byte instruction
8) Which interrupt has highest priority ?
a) INTR b) TRAP
c) RST 6.5 d) RST 5.5
9) Which IC is used for USART ?
a) 8279 b) 8255
c) 8251 d) 8085
10) The unit that subjects the processor operation to boundary scan tests is
a) parity generation and control unit
b) prefetcher unit
c) boundary scan and control unit
d) segmentation unit
11) The common register(s) for all the four channels of 8257 are
a) DMA address register
b) Terminal count register
c) Mode set register and status register
d) None of the mentioned
12) In cascaded mode, the number of vectored interrupts provided by 8259 A is
a) 4 b) 8 c) 16 d) 64
13) In real addressing mode, the 80286 operates at a speed
a) faster than that of 8086 b) half of that of 8086
c) slower than that of 8086 d) same as that of 8086
14) The segments in 80386 real mode are
a) overlapped
b) non-overlapped
c) either overlapped or non-overlapped
d) none of the mentioned
______________
Set P
*SLRTX333* -3- SLR-TX – 333
Seat
No.

microprocessors
Time : 2.30 p.m. to 5.30 p.m.
Instruction : Figures to right indicate full marks.

SECTION – I
a) Draw and explain flag register of 8085.
b) Interface 1K × 8 memory to 8085 using 1K × 4 memory chips. Interface it at
address C400 H.
c) Write a program to subtract two 16 bit numbers stored at memory address
starting from 4000 H. The result should be stored at 4008 H.
d) Describe instruction register and instruction decoder.
a) Explain the working of following instructions with example :
A) LDAX B B) POP PSW C) XTHL D) PCHL
b) Draw pin diagram of Intel 8085 and explain the various pins of 8085.
c) Draw and explain timing diagram of OUT instruction.
SECTION – II
a) Write a short note on Hardware and Software interrupts.
b) Explain the different modes of operations of 8255 PPI.
c) Draw and explain block diagram of DMA controller 8257.
d) Draw and explain block diagram of 8259 PIC.
a) Explain interrupt sequence in detail. Also explain interrupt sequence for INTR
interrupts.
b) Draw and explain block diagram of 8251 USART.
c) Explain with neat architecture 80286 microprocessor.
____________ Set P
Set P

Seat
No. Set Q
microprocessors
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) INTR b) TRAP
c) RST 6.5 d) RST 5.5
a) 8279 b) 8255
c) 8251 d) 8085
b) prefetcher unit
a) 4 b) 8 c) 16 d) 64
P.T.O.
SLR-TX – 333 -2- *SLRTX333*

a) overlapped
b) non-overlapped
a) 0024 H b) 003 CH
c) 0034 H d) 002 CH
signals
IO/M = 1, S1 = 1, S0 = 0 RD = 0
a) s = 0, z = 1, cy = 0 b) s = 1, z = 0, cy = 0
c) s = 0, z = 0, cy = 0 d) s = 1, z = 0, cy = 1
______________
Set Q
*SLRTX333* -3- SLR-TX – 333
Seat
No.

microprocessors
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
address C400 H.
SECTION – II
interrupts.
____________ Set Q
Set Q

Seat
No. Set R
microprocessors
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) s = 0, z = 1, cy = 0 b) s = 1, z = 0, cy = 0
c) s = 0, z = 0, cy = 0 d) s = 1, z = 0, cy = 1
a) INTR b) TRAP
c) RST 6.5 d) RST 5.5
a) 8279 b) 8255
c) 8251 d) 8085
P.T.O.
SLR-TX – 333 -2- *SLRTX333*
b) prefetcher unit
a) 4 b) 8 c) 16 d) 64
a) overlapped
b) non-overlapped
a) 0024 H b) 003 CH
c) 0034 H d) 002 CH
signals
IO/M = 1, S1 = 1, S0 = 0 RD = 0
______________
Set R
*SLRTX333* -3- SLR-TX – 333
Seat
No.

microprocessors
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
address C400 H.
SECTION – II
interrupts.
____________ Set R
Set R

Seat
No. Set S
microprocessors
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


b) prefetcher unit
a) 4 b) 8 c) 16 d) 64
P.T.O.
SLR-TX – 333 -2- *SLRTX333*

a) overlapped
b) non-overlapped
a) 0024 H b) 003 CH
c) 0034 H d) 002 CH
signals
IO/M = 1, S1 = 1, S0 = 0 RD = 0
a) s = 0, z = 1, cy = 0 b) s = 1, z = 0, cy = 0
c) s = 0, z = 0, cy = 0 d) s = 1, z = 0, cy = 1
a) INTR b) TRAP
c) RST 6.5 d) RST 5.5
a) 8279 b) 8255
c) 8251 d) 8085
______________
Set S
*SLRTX333* -3- SLR-TX – 333
Seat
No.

microprocessors
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
address C400 H.
SECTION – II
interrupts.
____________ Set S
Set S
Seat
No.

Set P

data structure
Time : 2.30 p.m. to 5.30 p.m.
N.B. : 1) Q. No. 1 is compulsory. It should be solved in first 30 minutes in

Answer Book on Page No. 3. Each question carries one mark.
2) Answer MCQ/Objective type questions on Page No. 3 only. Don’t
forget to mention, Q.P. Set (P/Q/R/S) on Top of Page.
1. Choose the correct answer. (1�14=14)

1) Stack cannot be used to
a) Allocate resource and scheduling
b) Implementation of recursion
c) Reverse string
d) Postfix expression evaluation
2) The result of evaluating the postfix expression 123*+4 – is
a) 6 b) 3 c) 10 d) 7
3) Following sequence of operations are performed on a stack.
Push( 1), push( 2 ), pop, push( 1 ), push( 2 ), pop, pop, pop, push( 2 ), pop.
The sequence of popped out values are
a) 2, 2, 1, 1, 2 b) 2, 2, 1, 2, 2
c) 2, 1, 2, 2, 1 d) 2, 1, 2, 2, 2
4) What can be said about the array representation of a circular queue when it
contains only one element ?
a) Front = Rear = Null b) Front = Rear + 1
c) Front = Rear – 1 d) Front = Rear
a) The item with highest priority b) The item with lowest priority
c) Any item d) None
P.T.O.
SLR-TX – 334 -2- *SLRTX334*
6) Which of the following operations is performed more efficiently by doubly linked
list than by singly linked list ?
a) Inserting a new mode after node whose location is given
b) Searching of an unsorted list for a given item
c) Deleting a node whose location is given
d) All above
7) A complete binary tree of level 5 (considering root at level 1) has how many nodes ?
a) 63 b) 31 c) 15 d) 32
8) Which of the following tree is typically used for “External Search” ?
a) B tree b) AVL tree
c) Red Black tree d) BST
9) In a graph if e=[u, v], then u and v are called __________
a) End points of e b) Adjacent nodes
c) Neighbors d) All of the above
10) If we draw an AVL tree using following elements 50, 45, 80, 95, 26, 43, 105, 2.
What will be balance factor of node 43 in finally produced AVL tree ?
a) 0 b) –1 c) +2 d) +1
11) Topological sort can be apply to only __________
a) Directed Acyclic graph b) Cyclic graph
c) All types of graph d) None of the above
12) Consider B+ tree in which the search key is 12 bytes long, block size is
1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The
maximum number of keys that can be accommodated in each “non-leaf node” of
the tree is
a) 49 b) 50 c) 51 d) 52
13) Dijkestra Algorithms is used for finding __________
a) Cycle in the graph b) Topological sort
c) Shortest path d) Tree in a graph
14) In AVL tree the __________ of node is the height of its left subtree minus the
height of its right subtree.
a) Ordering b) Balanced factor
c) Cardinality d) Multiplicity
_________________
Set P
-3-

Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Answer the following questions (any three) : (4�3=12)
a) Write a C function to insert a node at the end of a singly linked list.
b) What are various applications of stack ? Evaluate postfix expression A B + C * D /

if A = 2, B = 3, C = 4 and D = 5 by providing proper explanation and content of
stack.
c) Explain different traversal techniques of Binary tree.
d) Write the properties of Threaded Binary Trees with example.
a) Write a menu driven program to implement circular queue showing operations,

Insertion, Deletion and Display.
b) Write a program to implement a stack using singly linked list.
4. Write a program to implement doubly linked list and perform the operations : 8
1) Insert a node in the beginning of the list.
2) Insert a node at the end of the list.
3) Delete a given node.
Set P
SLR-TX – 334 -4- *SLRTX334*
Section – II
5. Attempt any three : (3�4=12)
A) Discuss B+ Tree with an example. What is difference between B tree and

B+ tree ?
B) Explain depth first search algorithm for graph with proper example.
C) What is multiway search tree ? List difference between binary search tree
and multiway search tree.
D) Define the following terms with proper diagram :

i) Graph
ii) Path
iii) Cycle
iv) Weighted graph.
E) What is AVL tree ? With an example, explain the single rotation in AVL.
6. Attempt any two : (8�2=16)

A) What are the properties of a B tree ? Construct the B-tree of order 4 and 5 for the
following elements :
23, 43, 46, 21, 66, 76, 54, 38, 89, 95, 77, 82, 11 (with explanation for every step.)
B) Insert the following key in order to build an AVL tree (Explain every step and
rotation) :
a) 12,23,33,45,51,69,72,84,3,27
b) represent deletion of node 23, 72,84.
C) With an example, explain the Dijkstra shortest path algorithm.
_________________
Set P
Seat
No.

Set Q

data structure
Time : 2.30 p.m. to 5.30 p.m.


a) 0 b) –1 c) +2 d) +1
the tree is
a) 49 b) 50 c) 51 d) 52
P.T.O.
SLR-TX – 334 -2- *SLRTX334*
c) Reverse string
a) 6 b) 3 c) 10 d) 7
a) 2, 2, 1, 1, 2 b) 2, 2, 1, 2, 2
c) 2, 1, 2, 2, 1 d) 2, 1, 2, 2, 2
c) Any item d) None
d) All above
a) 63 b) 31 c) 15 d) 32
_________________
Set Q
-3-

Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

stack.

Set Q
SLR-TX – 334 -4- *SLRTX334*
Section – II

B+ tree ?

i) Graph
ii) Path
iii) Cycle
iv) Weighted graph.

rotation) :
a) 12,23,33,45,51,69,72,84,3,27
_________________
Set Q
Seat
No.

Set R

data structure
Time : 2.30 p.m. to 5.30 p.m.


c) Any item d) None
d) All above
a) 63 b) 31 c) 15 d) 32
P.T.O.
SLR-TX – 334 -2- *SLRTX334*
a) 0 b) –1 c) +2 d) +1
the tree is
a) 49 b) 50 c) 51 d) 52
c) Reverse string
a) 6 b) 3 c) 10 d) 7
a) 2, 2, 1, 1, 2 b) 2, 2, 1, 2, 2
c) 2, 1, 2, 2, 1 d) 2, 1, 2, 2, 2
_________________
Set R
-3-

Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

stack.

Set R
SLR-TX – 334 -4- *SLRTX334*
Section – II

B+ tree ?

i) Graph
ii) Path
iii) Cycle
iv) Weighted graph.

rotation) :
a) 12,23,33,45,51,69,72,84,3,27
_________________
Set R
Seat
No.

Set S

data structure
Time : 2.30 p.m. to 5.30 p.m.


a) 0 b) –1 c) +2 d) +1
the tree is
a) 49 b) 50 c) 51 d) 52
P.T.O.
SLR-TX – 334 -2- *SLRTX334*
c) Reverse string
a) 6 b) 3 c) 10 d) 7
a) 2, 2, 1, 1, 2 b) 2, 2, 1, 2, 2
c) 2, 1, 2, 2, 1 d) 2, 1, 2, 2, 2
c) Any item d) None
d) All above
a) 63 b) 31 c) 15 d) 32

_________________
Set S
-3-

Seat
No.

data structure
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

stack.

Set S
SLR-TX – 334 -4- *SLRTX334*
Section – II

B+ tree ?

i) Graph
ii) Path
iii) Cycle
iv) Weighted graph.

rotation) :
a) 12,23,33,45,51,69,72,84,3,27
_________________
Set S
Seat
Set P
No.
S.E. (CSE) (Part II) (Old CGPA) Examination, 2018
Data Communication

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.
1. Choose the correct answer: (14×1=14)

1) The ATM cells are __________ bytes long.
a) 64 b) 128 c) 32 d) 53
2) The sine wave is the fundamentals ___________ signals.
a) periodic b) digital c) non periodic d) all
3) The AAL Layer is splits into a
a) AAT and CS b) AAP and SR c) SAR and CS d) CS and OSI
4) FTP and TELNET are used in ___________ layers of TCP/IP.
a) Transport b) Internet
c) Host to network d) Application
5) _____________ have a single Communication Channel that is shared by
all the machine on the network.
a) Point to point b) Broadcast c) Unicast d) None of these
P.T.O.
SLR-TX – 335 -2- *SLRTX335*
6) Breaking a bit stream into frames is necessary for
a) Error control b) Flow control
c) Congestion d) None of these
7) The IP addresses 192.168.1.0 is belong to
a) Class A b) Class C c) Class B d) Class E
8) Count-to-infinity problem can occur in
a) Link state routing b) Distance vector routing
c) Shortest path routing d) none of these
9) ____________ Protocol converts physical address to IP addresses.
a) ARP b) RARP c) Both a and b d) None of these
10) IPv6 has __________ bit addresses.
a) 32 b) 64 c) 128 d) constant
11) According to ___________ if router J is on the minimum path from router
I to router K, then the minimum path from J to K also falls along the same
route.
a) Bellman-Ford Principle
b) For-Fulkerson Principle
c) Optimality Principle
d) Both a and b
12) Open Loop technique attempt to solve problem by good design before
occurring congestion in network.
a) True b) False
13) LANs can be connected by device called as a
a) Bridge b) Modern c) both a and b d) none of these
14) The variation in the packet arrival times is called
a) Piggybacking b) Jitter
c) Delayed delivery d) none of these
____________

Set P
*SLRTX335* -3- SLR-TX – 335
Seat
No.
Data Communication

Time : .2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
Instruction : F
igures to the right indicate full marks.
SECTION – I

a) Define the following terms :
1) Frequency 2) Phase
3) Spectrum 4) Wavelength
b) List and explain uses of computer network.
c) Describe a Unrestricted Simplex Protocol.
d) Explain different types of Network Topologies with diagrams.
e) Explain different types of noise.

a) List and explain design issues of Data Link Layers.
b) What is error detection ? Describe CRC with examples.
c) Describe twisted pair transmission medium along with its physical
description, characteristics and application.
SECTION – II

a) Write short note on : NAT.
b) Explain flow based routing algorithm in detail.
c) Explain limited contention protocol in detail.
d) Describe IEEE Std. 802.5 frame format with explaining each fields.
e) What is count-to-infinity problem ? State a solution for the same.
Set P
SLR-TX – 335 -4- *SLRTX335*
a) What is Adaptive and Non-adaptive routing algorithm ? Explain Link State
Routing algorithm with all steps in detail.
b) Explain design issues of Network layers with suitable diagrams.
6. Attempt the following : (1×6=6)
Draw and explain all classes of IP addresses. What is sub netting ? What is
Subnet Mask explain with suitable examples ?
__________________
Set P
Seat
Set Q
No.
Data Communication

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

route.
d) Both a and b
P.T.O.
SLR-TX – 335 -2- *SLRTX335*
a) True b) False
a) 64 b) 128 c) 32 d) 53
____________

Set Q
*SLRTX335* -3- SLR-TX – 335
Seat
No.
Data Communication

Time : .2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
Instruction : F
SECTION – I


SECTION – II

Set Q
SLR-TX – 335 -4- *SLRTX335*
__________________
Set Q
Seat
Set R
No.
Data Communication

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

P.T.O.
SLR-TX – 335 -2- *SLRTX335*
route.
d) Both a and b
a) True b) False
a) 64 b) 128 c) 32 d) 53
____________
Set R
*SLRTX335* -3- SLR-TX – 335
Seat
No.
Data Communication

Time : .2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
Instruction : F
SECTION – I


SECTION – II

Set R
SLR-TX – 335 -4- *SLRTX335*
__________________
Set R
Seat
Set S
No.
Data Communication

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

route.
d) Both a and b
a) True b) False
P.T.O.
SLR-TX – 335 -2- *SLRTX335*
a) 64 b) 128 c) 32 d) 53
____________
Set S
*SLRTX335* -3- SLR-TX – 335
Seat
No.
Data Communication

Time : .2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
Instruction : F
SECTION – I


SECTION – II

Set S
SLR-TX – 335 -4- *SLRTX335*
__________________
Set S

Seat
No. Set P
S.E. (CSE) (Part – II) (Old) Examination, 2018
data structure – ii
Time : 2.30 p.m. to 5.30 p.m.
Instructions : 1) Each Section carries 40 marks.
2) Attempt all question in each Section.
3) Q. No. 1 is compulsory. It should be solved in first 30 minutes in Answer
Book Page No. 3. Each question carries one mark.
4) Answer MCQ/Objective type questions on Page No. 3 only. Don’t forget
to mention, Q.P. Set (P/Q/R/S) on Top of Page.


1) Running merge sort on an array of size n which is already sorted is
a) O(n) b) O(nlogn) c) O(n2) d) None
2) If the given input array is sorted or nearly sorted, which of the following algorithm gives the best
performance ?
a) Insertion sort b) Selection sort c) Quick sort d) Merge sort
3) The worst case complexity of binary search matches with
a) Interpolation search b) Linear search c) Merge sort d) None of the above
4) Consider a hash table of size seven, with starting index zero and a hash function (3x + 4)mod 7.
Assuming the hash table is initially empty, which of the following is the contents of the table when
the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Note that ‘–’ denotes an
empty location in the table.
a) 8, _, _, _, _, _, 10 b) 1, 8, 10, _, _, _, 3 c) 1, _, _, _, _, _, 3 d) 1, 10, 8, _, _, _, 3
5) Quick sort running time depends on the selection of
a) size of array b) pivot element c) sequence of values d) none of the above
6) Given the following input (4322, 1334, 1471,9679, 1989, 6171, 6173,4199) and the hash function
x mod 10, which of the following statements are true ?
i. 9679,1989, 4199 hash to the same value
ii. 1471,6171 hash to the same value
iii. All elements hash to the same value
iv. Each element hashes to a different value
a) i only b) ii only c) i and ii only d) iii or iv
7) What is direct addressing ?
a) Distinct array position for every possible key
b) Fewer array positions than keys
c) Fewer keys than array positions
8) Binary trees can have how many children
a) 2 b) any number of children
c) 0 or 1 or 2 d) 0 or 1
P.T.O.
SLR-TX – 336 -2- *SLRTX336*
9) Advantages of linked list representation of binary trees over arrays?
a) Dynamic size b) Ease of insertion/deletion
c) Ease in randomly accessing a node d) Both dynamic size and ease in insertion/deletion
10) For the tree below, write the post-order traversal.
a) 2, 7, 2, 6, 5,11, 5, 9, 4 b) 2, 7, 5, 2, 6, 9, 5, 11, 4
c) 2, 5, 11, 6, 7, 4, 9, 5, 2 d) 2, 7, 5, 6, 11, 2, 5, 4, 9
11) The number of edges from the root to the node is called _________ of the tree.
a) Height b) Depth c) Length d) None of the mentioned
12) What is the time complexity for finding the height of the binary tree ?
a) h = O(loglogn) b) h = O(nlogn) c) h = O(n) d) h = O(log n)
13) Why we need to a binary tree which is height balanced ?
a) to avoid formation of skew trees b) to save memory
c) to attain faster memory access d) to simplify storing
14) Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given
without performing any rotations ?
a) just build the tree with the given input
b) find the median of the set of elements given, make it as root and construct the tree
c) use trial and error
d) use dynamic programming to build the tree
15) What are null nodes filled with in a threaded binary tree?
a) in order predecessor for left node and inorder successor for right node information
b) right node with inorder predecessor and left node with inorder successor information
c) they remain null
d) some other values randomly
16) Which of the following ways can be used to represent a graph ?
a) Adjacency list and adjacency matrix
b) Incidence Matrix
c) Adjacency List, Adjacency Matrix as well as Incidence Matrix
17) What sequence would the BFS traversal of the given graph yield ?
a) A F D B C E b) C B A F D c) A B D C F d) F D C B A
18) Nonleaf nodes of B+- tree structure form a
a) Multilevel clustered indices b) Sparse indices
c) Multilevel dense indices d) Multilevel sparse indices
19) Most widely used structure for index structures, is known to be
a) B+- trees structure b) Balanced tree structure
c) Unbalanced tree structure d) Sequential tree structure
20) Which of the following is false about a binary search tree ?
a) The left child is always lesser than its parent
b) The right child is always greater than its parent
c) The left and right sub-trees should also be binary search trees
______________
Set P
*SLRTX336* -3- SLR-TX – 336
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Solve any four : (5×4=20)

1) Write a program for bouble sort.
2) What is data structure ? Explain its types.
3) What is Tree? Explain traversal of binary tree.
4) Perform insertion sort (ascending) of following numbers-show every iteration.
199, 13, 21, 5, 11, 45, 34
5) Explain the concept of asymptotic notations with corresponding graphs.
6) Give any three Hashing functions with examples.
3. What is Hashing ? Discuss complexity of hashing. Explain different open addressing techniques to
resolve collision in detail by giving suitable examples.
4. Write a C program for implementing Merge sort using recursive technique. 10

OR
What is threaded-Binary tree? Explain with example. 10
a) Left-in threaded Binary Tree
b) Right-in threaded Binary Tree
c) Fully threaded Binary Tree.
SECTION – II

1) What is B+ tree? Explain node structure of B+ tree.
2) Compare between tree and graph.
3) Insert the following nodes in B tree( n = 3) , show all steps.
7, 2, 9, 4,11, 6, 23, 45, 99, 67, 43
4) What is height balance tree. Discuss its properties.
5) Give the Depth first traversal algorithm for graph. Also explain with example.
6) Define the Graph and explain adjacency list and adjacency matrix representation of Graph.
Set P
SLR-TX – 336 -4- *SLRTX336*
6. Explain with example rotations in AVL tree. Also Give an AVL tree for following elements.
12, 45, 66, 21, 88, 45, 32, 89, 14, 76, 46, 91, 33, 28 10
7. Explain finding the shortest path in a given graph using Dijkstra algorithm, (state and assume
suitable data). 10
OR
Explain with example and algorithm the topological ordering of graph.
_____________________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.


b) Incidence Matrix
performance ?
P.T.O.
SLR-TX – 336 -2- *SLRTX336*
a) 8, _, _, _, _, _, 10 b) 1, 8, 10, _, _, _, 3 c) 1, _, _, _, _, _, 3 d) 1, 10, 8, _, _, _, 3
c) 0 or 1 or 2 d) 0 or 1
a) 2, 7, 2, 6, 5,11, 5, 9, 4 b) 2, 7, 5, 2, 6, 9, 5, 11, 4
c) 2, 5, 11, 6, 7, 4, 9, 5, 2 d) 2, 7, 5, 6, 11, 2, 5, 4, 9
c) they remain null
______________
Set Q
*SLRTX336* -3- SLR-TX – 336
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

199, 13, 21, 5, 11, 45, 34

OR
SECTION – II

7, 2, 9, 4,11, 6, 23, 45, 99, 67, 43
Set Q
SLR-TX – 336 -4- *SLRTX336*
12, 45, 66, 21, 88, 45, 32, 89, 14, 76, 46, 91, 33, 28 10
suitable data). 10
OR
_____________________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.


c) they remain null
b) Incidence Matrix
P.T.O.
SLR-TX – 336 -2- *SLRTX336*
performance ?
a) 8, _, _, _, _, _, 10 b) 1, 8, 10, _, _, _, 3 c) 1, _, _, _, _, _, 3 d) 1, 10, 8, _, _, _, 3
c) 0 or 1 or 2 d) 0 or 1
a) 2, 7, 2, 6, 5,11, 5, 9, 4 b) 2, 7, 5, 2, 6, 9, 5, 11, 4
c) 2, 5, 11, 6, 7, 4, 9, 5, 2 d) 2, 7, 5, 6, 11, 2, 5, 4, 9
______________
Set R
*SLRTX336* -3- SLR-TX – 336
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

199, 13, 21, 5, 11, 45, 34

OR
SECTION – II

7, 2, 9, 4,11, 6, 23, 45, 99, 67, 43
Set R
SLR-TX – 336 -4- *SLRTX336*
12, 45, 66, 21, 88, 45, 32, 89, 14, 76, 46, 91, 33, 28 10
suitable data). 10
OR
_____________________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.


a) i only b) ii only
c) i and ii only d) iii or iv
c) 0 or 1 or 2 d) 0 or 1
a) 2, 7, 2, 6, 5,11, 5, 9, 4 b) 2, 7, 5, 2, 6, 9, 5, 11, 4
c) 2, 5, 11, 6, 7, 4, 9, 5, 2 d) 2, 7, 5, 6, 11, 2, 5, 4, 9
a) h = O(loglogn) b) h = O(nlogn)
c) h = O(n) d) h = O(log n)
P.T.O.
SLR-TX – 336 -2- *SLRTX336*
c) they remain null
b) Incidence Matrix
performance ?
a) 8, _, _, _, _, _, 10 b) 1, 8, 10, _, _, _, 3 c) 1, _, _, _, _, _, 3 d) 1, 10, 8, _, _, _, 3
______________
Set S
*SLRTX336* -3- SLR-TX – 336
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

199, 13, 21, 5, 11, 45, 34

OR
SECTION – II

7, 2, 9, 4,11, 6, 23, 45, 99, 67, 43
Set S
SLR-TX – 336 -4- *SLRTX336*
12, 45, 66, 21, 88, 45, 32, 89, 14, 76, 46, 91, 33, 28 10
suitable data). 10
OR
_____________________
Set S
Seat
No. Set P
formal system and automata
Day and Date : Wednesday, 19-12-2018 Total Marks : 100

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) A FA with null string accepting capability is known as
a) NFA b) DFA c) NFA – ∧ d) NULL
2) A FA with deterministic transition capability is known as
a) DFA b) NFA c) NFA – ∧ d) All of the above
3) The behavior of NFA can be simulated by a DFA
a) Always b) Sometime c) Never d) Depends
4) The CFG G, S -> aS|bS|a|b generates
a) (a + b)* b) (a + b) (a + b)*
c) (a + b)* (a + b) d) All of above
5) Language of finite automata is
a) Type 0 b) Type 1 c) Type 2 d) Type 3
6) Finite automata requires minimum ___________ number of stacks.
a) 1 b) 0
c) 2 d) None of the mentioned
7) Regular expression for all strings starts with ab and ends with bba is
a) aba*b*bba b) ab(ab)*bba
c) ab(a + b)*bba d) All of the mentioned
8) FSM with output capability can be used to add two given integer in binary
representation. This is
a) True b) False
c) May be true d) None of the mentioned
P.T.O.
SLR-TX – 337 -2- *SLRTX337*
9) NFA, in its name has ‘non-deterministic’ because of
a) The result is undetermined
b) The choice of path is non-deterministic
c) The state to be transited next is non-deterministic
d) All of the mentioned
10) Given :
L1 = {x∈∑*|x contains even no’s of 0’s}
L2 = {x∈∑*|x contains odd no’s of 1’s}
No of final states in Language L1 ∪ L2 ?
a) 1 b) 2 c) 3 d) 4
11) The sum of minimum and maximum number of final states for a DFA n
states is equal to
a) n + 1 b) n c) n – 1 d) n + 2
12) A CFG is ambiguous if
a) It has more than one rightmost derivations
b) It has more than one leftmost derivations
c) No parse tree can be generated for the CFG
13) (a + b)* is equivalent to
a) b*a* b) (a*b*)*
c) a*b* d) None of the mentioned
14) The production of the form A -> B, where A and B are non terminals is called
a) Null production b) Unit production
c) Greibach Normal Form d) Chomsky Normal Form
15) Halting states are of two types. They are
a) Accept and Reject b) Reject and Allow
c) Start and Reject d) None of the mentioned
16) A regular language over an alphabet a is one that can be obtained from
a) union b) concatenation
c) kleene d) all of the mentioned
17) Regular expression {0, 1} is equivalent to
a) 0 ∪ 1 b) 0/1
c) 0 + 1 d) All of the mentioned
18) The instantaneous PDA is has the following elements
a) State b) Unconsumed input
c) Stack content d) All of the mentioned
19) State true or false :
Statement : Every context free grammar can be transformed into an
equivalent non deterministic push down automata.
a) true b) false
20) Subset Construction method refers to
a) Conversion of NFA to DFA b) DFA minimization
c) Eliminating Null references d) ε-NFA to NFA
____________ Set P

*SLRTX337* -3- SLR-TX – 337
Seat
No.
Day and Date : Wednesday, 19-12-2018 , -2018 Marks : 80

Time : 2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
SECTION – I

b) Define ∧ – closure with example.
1) S -> aSa | bSb | a | b
2) S -> SaS | b
d) Define Grammar with example.
e) Explain extended transition function for NFA.
1) ab (a + b)* ab
2) (0 + 1) * (00 + 11)
b) Consider following NFA – ∧
Set P

SLR-TX – 337 -4- *SLRTX337*

1) ∂*(q0, 010)
2) ∂*(q0, 11)
3) ∂*(q0, 101)
4) ∂*(q0, 100)
4. Minimize the following Finite Automata. 10
SECTION – II

c) Explain Multitape turing machine.
d) State and Prove Pumping lemma of CFL.
e) Define Push down automata with example.

a) Give transition table for PDA to recognize balanced strings of 2 types “()”
and “[]”.
OR
a) Draw Turing machine to compute the function f(x) = 2x where x is non
negative integer, using unary representation.
–––––––––––––
Set P
Seat
No. Set Q

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) 0 ∪ 1 b) 0/1
a) true b) false
P.T.O.
SLR-TX – 337 -2- *SLRTX337*
a) (a + b)* b) (a + b) (a + b)*
a) 1 b) 0
a) True b) False
15) Given :
a) 1 b) 2 c) 3 d) 4
states is equal to
a) n + 1 b) n c) n – 1 d) n + 2
a) b*a* b) (a*b*)*
____________ Set Q

*SLRTX337* -3- SLR-TX – 337
Seat
No.

Time : 2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
SECTION – I

1) S -> aSa | bSb | a | b
2) S -> SaS | b
1) ab (a + b)* ab
2) (0 + 1) * (00 + 11)
Set Q

SLR-TX – 337 -4- *SLRTX337*

1) ∂*(q0, 010)
2) ∂*(q0, 11)
3) ∂*(q0, 101)
4) ∂*(q0, 100)
SECTION – II


and “[]”.
OR
–––––––––––––
Set Q
Seat
No. Set R

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

states is equal to
a) n + 1 b) n c) n – 1 d) n + 2
a) b*a* b) (a*b*)*
a) 0 ∪ 1 b) 0/1
P.T.O.
SLR-TX – 337 -2- *SLRTX337*
a) true b) false
a) (a + b)* b) (a + b) (a + b)*
a) 1 b) 0
a) True b) False
20) Given :
a) 1 b) 2 c) 3 d) 4
____________ Set R

*SLRTX337* -3- SLR-TX – 337
Seat
No.

Time : 2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
SECTION – I

1) S -> aSa | bSb | a | b
2) S -> SaS | b
1) ab (a + b)* ab
2) (0 + 1) * (00 + 11)
Set R

SLR-TX – 337 -4- *SLRTX337*

1) ∂*(q0, 010)
2) ∂*(q0, 11)
3) ∂*(q0, 101)
4) ∂*(q0, 100)
SECTION – II


and “[]”.
OR
–––––––––––––
Set R
Seat
No. Set S

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) 1 b) 0
a) True b) False
5) Given :
a) 1 b) 2 c) 3 d) 4
states is equal to
a) n + 1 b) n c) n – 1 d) n + 2
P.T.O.
SLR-TX – 337 -2- *SLRTX337*
a) b*a* b) (a*b*)*
a) 0 ∪ 1 b) 0/1
a) true b) false
a) (a + b)* b) (a + b) (a + b)*
____________

Set S
*SLRTX337* -3- SLR-TX – 337
Seat
No.

Time : 2.30 p.m. to 5.30 p.m. 00 .m. to .00 .m.
SECTION – I

1) S -> aSa | bSb | a | b
2) S -> SaS | b
1) ab (a + b)* ab
2) (0 + 1) * (00 + 11)
Set S

SLR-TX – 337 -4- *SLRTX337*

1) ∂*(q0, 010)
2) ∂*(q0, 11)
3) ∂*(q0, 101)
4) ∂*(q0, 100)
SECTION – II


and “[]”.
OR
–––––––––––––
Set S
Seat
No.
Set P
S.E. (Computer Science and Engg.) (Part – II) (Old) Examination, 2018
computer networks – i
Time : 2.30 p.m. to 5.30 p.m.
Instructions : 1) Q. No. 1 is compulsory. It should be solved in first 30 minutes in

Answer Book Page No. 3. Each question carries one mark.

1. I) Which of the situations might not require multiple routing protocols in a network ?
a) When a new Layer 2-only switch is added to the network
b) When you are migrating from one routing protocol to another
c) When you are using routers from multiple vendors
d) When there are host-based routers from multiple vendors
II) Considers be the average number of new frames generated per frame time. If s > 1, then
a) Frames not at all collide b) Every frame will suffer collision
c) Maximum utilization of channel d) No change in throughput
III) What does administrative distance rank ?
a) Metrics b) Sources of routing information
c) Router reliability d) Best paths
IV) This layer in an addition to OSI model
a) Application layer b) Presentation layer
c) Session layer d) Both b) and c)
V) Which of the following might be used by a company to satisfy its growing communication
needs ?
a) Front end processor b) Multiplexer
c) Controller d) All of the above
VI) Bytes of data being transferred in each connection are numbered by TCP. These numbers
starts with a
a) Random number b) Zero
c) One d) Sequence of zero’s and one’s
VII) To achieve reliable transport in TCP, ________ is used to check the safe and sound
arrival of data.
a) Packet b) Buffer c) Segment d) Acknowledgment
P.T.O.
SLR-TX – 338 -2- *SLRTX338*
VIII) UTP is commonly used in
a) DSL b) FTTP
c) HTTP d) None of the mentioned
IX) Terrestrial radio channels are broadly classified into _______ groups.
a) 2 b) 3 c) 4 d) 1
X) In which topology if there are n devices in a network each device has n-1 ports for cables ?
a) Mesh b) Star c) Bus d) Ring
XI) Which protocol should you select if the network diameter is more than 17 hops ?
a) RIPv1 b) RIPv2 c) EIGRP d) All of the above
XII) This is not a application layer protocol
a) HTTP b) SMTP c) FTP d) TCP
XIII) Fiber optics posses following properties
a) Immune electromagnetic interference b) Very less signal attenuation
c) Very hard to tap d) All of the mentioned
XIV) The receiver of the data controls the amount of data that are to be sent by the sender is
referred as
a) Flow control b) Error control
c) Congestion control d) Error detection
XV) On which layer of the OSI model the router configuration reside
a) Transport b) Network c) Logical link d) Physical
XVI) The process of, A client that wishes to connect to an open server tells its TCP that it
needs to be connected to that particular server is
a) Active open b) Active close c) Passive close d) Passive open
XVII) Which one of the following task is not done by data like layer ?
a) Framing b) Error control c) Flow control d) Channel coding
XVIII) CRC stands for
a) Cyclic Redundancy Check b) Code Repeat Check
c) Code Redundancy Check d) Cyclic Repeat Check
XIX) An endpoint of an inter-process communication flow across a computer network is called
a) Socket b) Pipe
c) Port d) None of the mentioned
XX) TCP/IP model does not have ___________ layer but OSI model have this layer.
a) Session layer b) Transport layer
c) Application layer d) None of the mentioned
__________
Set P
*SLRTX338* -3- SLR-TX – 338
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Attempt any four questions : 20

A) Explain Error Correction Technique.
B) Explain Mesh topology.
C) Explain Security issues LAN.
D) Write a note on UDP.
E) Write a short note on presentation layer and session layer OSI model.
3. Write note on Error Detection Techniques. 10

OR
Write a note on TCP/IP reference model.
4. Write short note on (any two) : 10

A) Network software.
B) DLL protocols.
C) ATM reference model.
SECTION – II

A) Explain CSMA.
B) Explain repeater networking device.
C) Write note on Layer 2 device.
D) Write a note on Slotted ALOHA.
E) Explain classes of IPv4.
Set P
SLR-TX – 338 -4- *SLRTX338*
6. Explain Congestion control algorithms. 10
OR
Explain different network layer design issues.

A) OSFP.
B) Distance vector routing protocol.
C) RARP and ARP.
______________
Set P
Seat
No.
Set Q
Time : 2.30 p.m. to 5.30 p.m.


1. I) The process of, A client that wishes to connect to an open server tells its TCP that it needs
to be connected to that particular server is
II) Which one of the following task is not done by data like layer ?
III) CRC stands for
IV) An endpoint of an inter-process communication flow across a computer network is called
a) Socket b) Pipe
V) TCP/IP model does not have ___________ layer but OSI model have this layer.
VI) Which of the situations might not require multiple routing protocols in a network ?
VII) Considers be the average number of new frames generated per frame time. If s > 1, then
VIII) What does administrative distance rank ?
c) Router reliability d) Best paths P.T.O.
SLR-TX – 338 -2- *SLRTX338*
IX) This layer in an addition to OSI model
X) Which of the following might be used by a company to satisfy its growing communication
needs ?
XI) Bytes of data being transferred in each connection are numbered by TCP. These numbers
starts with a
XII) To achieve reliable transport in TCP, ________ is used to check the safe and sound
arrival of data.
XIII) UTP is commonly used in
a) DSL b) FTTP
XIV) Terrestrial radio channels are broadly classified into _______ groups.
a) 2 b) 3 c) 4 d) 1
XV) In which topology if there are n devices in a network each device has n-1 ports for cables ?
XVI) Which protocol should you select if the network diameter is more than 17 hops ?
XVII) This is not a application layer protocol
XVIII) Fiber optics posses following properties
XIX) The receiver of the data controls the amount of data that are to be sent by the sender is
referred as
XX) On which layer of the OSI model the router configuration reside
__________
Set Q
*SLRTX338* -3- SLR-TX – 338
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


OR

B) DLL protocols.
SECTION – II

A) Explain CSMA.
Set Q
SLR-TX – 338 -4- *SLRTX338*
OR

A) OSFP.
C) RARP and ARP.
______________
Set Q
Seat
No.
Set R
Time : 2.30 p.m. to 5.30 p.m.


1. I) Which protocol should you select if the network diameter is more than 17 hops ?
II) This is not a application layer protocol
III) Fiber optics posses following properties
IV) The receiver of the data controls the amount of data that are to be sent by the sender is
referred as
V) On which layer of the OSI model the router configuration reside
VI) The process of, A client that wishes to connect to an open server tells its TCP that it
VII) Which one of the following task is not done by data like layer ?
VIII) CRC stands for
IX) An endpoint of an inter-process communication flow across a computer network is called
a) Socket b) Pipe
P.T.O.
SLR-TX – 338 -2- *SLRTX338*
X) TCP/IP model does not have ___________ layer but OSI model have this layer.
XI) Which of the situations might not require multiple routing protocols in a network ?
XII) Considers be the average number of new frames generated per frame time. If s > 1, then
XIII) What does administrative distance rank ?
XIV) This layer in an addition to OSI model
XV) Which of the following might be used by a company to satisfy its growing communication
needs ?
XVI) Bytes of data being transferred in each connection are numbered by TCP. These numbers
starts with a
XVII) To achieve reliable transport in TCP, ________ is used to check the safe and sound
arrival of data.
XVIII) UTP is commonly used in
a) DSL b) FTTP
XIX) Terrestrial radio channels are broadly classified into _______ groups.
a) 2 b) 3 c) 4 d) 1
XX) In which topology if there are n devices in a network each device has n-1 ports for cables ?

__________
Set R
*SLRTX338* -3- SLR-TX – 338
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


OR

B) DLL protocols.
SECTION – II

A) Explain CSMA.
Set R
SLR-TX – 338 -4- *SLRTX338*
OR

A) OSFP.
C) RARP and ARP.
______________
Set R
Seat
No.
Set S
Time : 2.30 p.m. to 5.30 p.m.


1. I) Bytes of data being transferred in each connection are numbered by TCP. These numbers
starts with a
II) To achieve reliable transport in TCP, ________ is used to check the safe and sound
arrival of data.
III) UTP is commonly used in
a) DSL b) FTTP
IV) Terrestrial radio channels are broadly classified into _______ groups.
a) 2 b) 3 c) 4 d) 1
V) In which topology if there are n devices in a network each device has n-1 ports for cables ?
VI) Which protocol should you select if the network diameter is more than 17 hops ?
VII) This is not a application layer protocol
VIII) Fiber optics posses following properties
IX) The receiver of the data controls the amount of data that are to be sent by the sender is
referred as
P.T.O.
SLR-TX – 338 -2- *SLRTX338*
X) On which layer of the OSI model the router configuration reside
XI) The process of, A client that wishes to connect to an open server tells its TCP that it
XII) Which one of the following task is not done by data like layer ?
XIII) CRC stands for
XIV) An endpoint of an inter-process communication flow across a computer network is called
a) Socket b) Pipe
XV) TCP/IP model does not have ___________ layer but OSI model have this layer.
XVI) Which of the situations might not require multiple routing protocols in a network ?
XVII) Considers be the average number of new frames generated per frame time. If s > 1, then
XVIII) What does administrative distance rank ?
XIX) This layer in an addition to OSI model
XX) Which of the following might be used by a company to satisfy its growing communication
needs ?
__________
Set S
*SLRTX338* -3- SLR-TX – 338
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


OR

B) DLL protocols.
SECTION – II

A) Explain CSMA.
Set S
SLR-TX – 338 -4- *SLRTX338*
OR

A) OSFP.
C) RARP and ARP.
______________
Set S
Seat
No. Set P
T.E. (CSE) (Part – I) (CBCS) Examination, 2018
operating system concepts (new)
Day and Date : Friday, 30-11-2018, -2018 Max. Marks : 70

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

one mark.
1) The primary job of the operating system of a computer is to
A) Command resources B) Manage resources
C) Provide utilities D) Be user friendly
2) The variable turn can have values 0 or 1
Void Process (i)
{
while(1)
{
//Non-critical section
while (turn!=i);
//Critical section
turn= j;
}
}
The above code does not provide
A) Mutual exclusion B) Progress
C) Bounded wait D) None of these
3) In a time-sharing operating system, when the time slot given to process is completed,
the process goes from the running state to the
A) Blocked state B) Ready state
C) Suspended state D) Terminated state
4) A high level synchronization construct, characterized by a set of programmer defined
operators is known as
A) Semaphore B) Hardware synchronization
C) Monitor D) None of the above
P.T.O.
SLR-TX – 339 -2- *SLRTX339*
5) What is dispatch Latancy
A) The time taken by the dispatcher to stop one process and start another
B) Time taken by processor to write a file into disk
C) The whole time taken by all processor
D) Time taken by CPU sheduler to shedule next process
6) Which of the following statements are true ?
I. Shortest remaining time first scheduling may cause starvation
II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
A) I only B) I and II only C) I, II, III D) II and III
7) A ________ system is often used as a control device in a dedicated application and has
a well defined and fixed time constraints.
A) Soft-real time systems B) Distributed systems
C) Hard real time systems D) Time-shairing
8) The state of a process is defined by
A) the final activity of the process
B) the activity just executed by the process
C) the activity to next be executed by the process
D) the current activity of the process
9) _______ page replacement policy generates minimum number of page fault.
A) LRU B) LFU C) FIFO D) Optimal
10) Which of the following is deadlock prevention mechanism ?
A) Bankers algorithm B) Avoiding hold and wait
C) No preemption of resource D) All of these
11) Syntax for ioctl system call is
A) ioctl(); B) ioctl(int,fd, ptr)
C) ioctl(fd, int, ptr) D) ioctl(ptr,int,fd);
12) What does turn around time mean ?
A) Time from the process enters the ready queue to the time it starts execution
B) The difference between the arrival time and the completion time of the process
C) Time taken from start to completion of I/O
D) Time a process waits in the ready queue
13) The hardware that measure elapsed time and to trigger operations is called a
A) Programmable Interval timer B) Program interrupt timer
C) Clock D) None of these
14) ________ is a set of wires and rigidly defined protocol that specifies a set of messages
that can be sent on wires.
A) Bios B) Port C) Bus D) Controller
____________
Set P
*SLRTX339* -3- SLR-TX – 339
Seat
No.
Day and Date : Friday, 30-11-2018, -2018 Marks : 56
Time : 2.30 p.m. to 5.30 p.m..2
SECTION – I

1) Draw queing diagram and state different types of queues used by processes during
execution.
2) Write a short note on Time Sharing Operating System.
3) What is dispatcher ? List all scheduling criteria and explain in detail.
4) Compare FCFS, SJF, Priority and round Robin scheduling algorithms.
5) How processes communicate with each other using direct or indirect communication,
write its primitives.
3. Consider a set of process A, B, C, D arriving in the same order at time zero in the ready
queue. Their burst times are 4, 1, 8, 1 respectively. Using Round Robin scheduling, with
time slice of 1 unit.
a) Draw Gantt Chart.
b) What is the time at which process B completes execution ?
c) Find waiting time and turn around time for all processes.
d) Find Avg. waiting time and turn around time. 8
OR
3. How synchronization is achieved by using hardware Test and Set instruction ? 8
4. Using state transition diagram explain how process undergoes in different states during its
lifetime. Also describe process control block. 8
SECTION – II

1) Explain with example how Resource Allocation Graph (RAG) can be used to describe a
deadlock.
2) Describe how process termination helps in recovery of deadlock.
Set P
SLR-TX – 339 -4- *SLRTX339*
3) Differentiate between paging and segmentation.
4) How memory can be allocated using First Fit, Best Fit and Worst Fit strategies ?
5) Write a short note on streams.
6. What is page fault ? When it occurs ? What are different steps for handling a page fault ? 8
OR
6. What is the approach of an operating system to detect a deadlock for single instance of
resource type and multiple instance of resource type ? Explain with example. 8
7. Consider below given reference string and number of frames available as 3, find page fault
using FIFO, LRU and optimal page replacement algorithms.
State which algorithm results belody’s Anomoly and which is best for page replacement.
Reference String : 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. 8
_______________
Set P
Seat
No. Set Q

Time : 2.30 p.m. to 5.30 p.m..00 .

one mark.
P.T.O.
SLR-TX – 339 -2- *SLRTX339*
Void Process (i)
{
while(1)
{
while (turn!=i);
//Critical section
turn= j;
}
}
____________
Set Q
*SLRTX339* -3- SLR-TX – 339
Seat
No.
Time : 2.30 p.m. to 5.30 p.m..2
SECTION – I

execution.
OR
SECTION – II

deadlock.
Set Q
SLR-TX – 339 -4- *SLRTX339*
OR
_______________
Set Q
Seat
No. Set R

Time : 2.30 p.m. to 5.30 p.m..00 .

one mark.
P.T.O.
SLR-TX – 339 -2- *SLRTX339*
Void Process (i)
{
while(1)
{
while (turn!=i);
//Critical section
turn= j;
}
}
____________
Set R
*SLRTX339* -3- SLR-TX – 339
Seat
No.
Time : 2.30 p.m. to 5.30 p.m..2
SECTION – I

execution.
OR
SECTION – II

deadlock.
Set R
SLR-TX – 339 -4- *SLRTX339*
OR
_______________
Set R
Seat
No. Set S

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

one mark.
P.T.O.
SLR-TX – 339 -2- *SLRTX339*
Void Process (i)
{
while(1)
{
while (turn!=i);
//Critical section
turn= j;
}
}
____________
Set S
*SLRTX339* -3- SLR-TX – 339
Seat
No.
Time : 2.30 p.m. to 5.30 p.m..2
SECTION – I

execution.
OR
SECTION – II

deadlock.
Set S
SLR-TX – 339 -4- *SLRTX339*
OR
_______________
Set S
Seat
No.

Set P
T.E. (Computer Science and Engineering) (Part – I) (New CBCS)

Examination, 2018
system programming
Time : 2.30 p.m. to 5.30 p.m.

minutes in Answer Book on Page No. 3. Each question
carries one mark.
Top of Page.

1) The output of the lexical and syntax analyzer can stated as
a) parse stream, parse tree b) token tree, parse tree
c) token stream, parse tree d) all of the mentioned
2) Which of the following is not advanced assembler directive ?
a) START b) EQU c) ORIGIN d) LTORG
3) Intermediate code for “ORIGIN” is
a) (IS, 03) b) (DL, 02) c) (AD, 03) d) (AD, 04)
4) A __________ statement declares the name of macro.
a) Macro prototype b) Macro definition
c) Macro identification d) None of the above
5) Expansion time variables are used
a) Before expansion of micro calls b) Only during expansion of macro calls
c) After expansion of micro calls d) None of the above
P.T.O.
SLR-TX – 340 -2- *SLRTX340*
6) The optimization technique which is typically applied on loops is
a) Removal of invariant computation
b) Constant folding
c) Peephole optimization
d) All of these
7) Relocation table is generated in
a) Loader b) Binary program
c) Object module d) Translator
8) The linker has utilities needed for ________ within the translated program.
a) Input b) Output c) Processing d) All of these
9) In direct linking loader which is not related with object program ?
a) ESD b) RLD c) BSS d) TXT
10) Loading is _________ with the task of storage management of operating
system and mostly preformed after assembly.
a) Bound b) Expanded
c) Overlaps d) All of these
11) Choose correct statement from following .
a) The symbol table built during Lexical Analysis
b) The symbol table built during Semantic Analysis
c) The symbol table built during Syntax Analysis
d) All of these
12) If translated origin and linked origin are different, then relocation is
performed by
a) Linker b) Loader c) Translator d) Both a) and b)
13) The operand descriptor has the fields
a) Attributes b) Addressability
14) File with .exe extension contains
a) Non relocated object program b) Relocated program
c) Linked program d) None of these
_________________
Set P
*SLRTX340* -3- SLR-TX – 340
Seat
No.


Examination, 2018
system programming

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Attempt any 3 : (4×3=12)

a) What is language processor pass ? How forward references are handled
in two pass assembler ? Elaborate.
b) Elaborate Analysis and synthesis phase structure of an assembler.
c) What is the difference in positional parameters and keyword parameters ?
Explain with example.
d) What is Lex used for ? Elaborate with an example.
e) Explain intermediate code in two pass assemble.

Elaborate the back end of a Toy compiler with an example.
OR
List the tables required for the design of a macro preprocessor with their fields.
4. Elaborate the data structures (table) used in Assembler pass-I with an example. 8
Set P
SLR-TX – 340 -4- *SLRTX340*
SECTION – II
5. Attempt any 3 : (4×3=12)

a) List and explain the contents of Object Module w.r.t. Linkers.
b) Explain overlay structured program with example.
c) Explain the concept of “Triples” with respect to intermediate codes for
expression and show the contents of “Triples” for the following expression.
Source string = a + b * c + d * e ↑ f
d) Write a short note on :
i) Register descriptor
ii) Operand descriptor.
e) Explain the use of relocation bits and transfer vector with proper example.

a) Write and explain “Evaluation order for operators” using RR label with
proper example.
OR
b) Draw and explain Pass-I flow chart of direct linking loader.
7. Explain any two loader schemes with its advantages and disadvantages. 8
_________________
Set P
Seat
No.

Set Q

Examination, 2018
system programming
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

d) All of these
P.T.O.
SLR-TX – 340 -2- *SLRTX340*
performed by
a) (IS, 03) b) (DL, 02) c) (AD, 03) d) (AD, 04)
b) Constant folding
d) All of these
_________________
Set Q
*SLRTX340* -3- SLR-TX – 340
Seat
No.


Examination, 2018
system programming

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Attempt any 3 : (4×3=12)


OR
Set Q
SLR-TX – 340 -4- *SLRTX340*
SECTION – II
5. Attempt any 3 : (4×3=12)


proper example.
OR
_________________
Set Q
Seat
No.

Set R

Examination, 2018
system programming
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

b) Constant folding
d) All of these
P.T.O.
SLR-TX – 340 -2- *SLRTX340*
d) All of these
performed by
a) (IS, 03) b) (DL, 02) c) (AD, 03) d) (AD, 04)
_________________
Set R
*SLRTX340* -3- SLR-TX – 340
Seat
No.


Examination, 2018
system programming

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Attempt any 3 : (4×3=12)


OR
Set R
SLR-TX – 340 -4- *SLRTX340*
SECTION – II
5. Attempt any 3 : (4×3=12)


proper example.
OR
_________________
Set R
Seat
No.

Set S

Examination, 2018
system programming
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

d) All of these
performed by
P.T.O.
SLR-TX – 340 -2- *SLRTX340*
a) (IS, 03) b) (DL, 02) c) (AD, 03) d) (AD, 04)
b) Constant folding
d) All of these
_________________
Set S
*SLRTX340* -3- SLR-TX – 340
Seat
No.


Examination, 2018
system programming

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Attempt any 3 : (4×3=12)


OR
Set S
SLR-TX – 340 -4- *SLRTX340*
SECTION – II
5. Attempt any 3 : (4×3=12)


proper example.
OR
_________________
Set S
Seat
No.

Set P
T.E. (Computer Science and Engineering) New CBCS (Part – I)

Examination, 2018
database engineering
Time : 2.30 p.m. to 5.30 p.m.


1) Logical level describes _____________ data are stored in the DB.
a) which b) where c) what d) when
2) To delete a particular column in a relation the command used is _____________
a) update b) drop c) alter d) delete
3) The database schema is written in _____________
a) hll b) dml c) ddl d) dcl
4) Which of the following is a legal expression in SQL ?
a) select null from employee
b) select name from employee
c) select name from employee where salary=null
5) S1 : Primary key can be composite search key
S2 : Primary key is also a candidate keys.
a) S1 and S2 are true b) S1 is only true
c) S2 is only true d) S1 and S2 are false
6) In tuple relational calculus P1 → P2 is equivalent to _____________
a) ¬P1 ∨ P2 b) P1 ∨ P2
c) P1 ∧ P2 d) P1 ∧ ¬ P2
P.T.O.
SLR-TX – 341 -2- *SLRTX341*
7) Entities are identified from the word statement of a problem by
a) picking words which are adjectives
b) picking words which are verbs
c) picking words which are pronouns
d) picking words which are nouns
8) Canonical cover is a
a) subset of F b) super set of F
c) proper subset of F d) None of these
9) ___________ index has an index entry for every search key value in the data file.
a) Sparse b) Dense c) Both a) and b) d) None
10) A transaction is in _________ state after the final statement has been executed.
a) active b) partially committed
c) committed d) none of the above
11) Isolation of the transactions is ensured by
a) Transaction management b) Application programmer
c) Concurrency control d) Recovery management
12) Precedence graphs help to find a __________ schedule.
a) Serializable b) Deadlock free
c) Recoverable d) Cacadeless
13) Which of the following are valid reason for concurrency ?
i) Improved throughput
ii) Resource utilization
iii) Reduced transaction failure
iv) Improved consistency
a) Only iii and ii b) Only iii and i
c) Only ii and i d) Only iv and i
14) ‘dump’ log record is written to
a) Stable storage b) Log record buffer
c) Disk block d) None of these
_________________
Set P
-3-

Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
2. Solve any three : (3�4=12)
a) What is data independence ? Explain different forms of it.
b) Explain with example group by and having clause.
c) Explain with example lossless decomposition.
d) Explain different types of keys in relational model with example.
e) Explain with example canonical cover and how to detect extraneous attribute.
a) What is functional dependency ? Describe the different types of functional

dependency with an example.
b) Define the following terms with an example.
1) Referential integrity.
2) 2NF.
3) Strong and weak entity sets.
4) Set membership.
Set P
SLR-TX – 341 -4- *SLRTX341*
4. Consider the following schema : 8
Employee (Empid, First_Name, Last_Name, salary, department)
Write SQL statements for following queries.
a) Get employee details from employee table whose first name starts with ‘J’.
b) Get department, total salary with respect to a department from employee table
order by total salary descending.
c) Get First_Name from employee table whose salary is more than 10000 and who
is from sales department.
d) Find the names of the employees whose department and salary is same as
employee “Albert King”.
Section – II
a) Explain Thomas write rule.
b) Explain secondary index with an example.
c) Explain ACID properties with an example.
d) Write a short note on Bitmap indices. And give example.
e) Explain types of failures.
a) Explain deadlock detection and recovery from deadlock.
b) Explain recovery with concurrent transactions.
7. Explain two phase locking protocol along with its variations. 8
_________________
Set P
Seat
No.

Set Q

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.


a) Sparse b) Dense
P.T.O.
SLR-TX – 341 -2- *SLRTX341*
a) ¬P1 ∨ P2 b) P1 ∨ P2
c) P1 ∧ P2 d) P1 ∧ ¬ P2
_________________
Set Q
-3-

Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

2) 2NF.
4) Set membership.
Set Q
SLR-TX – 341 -4- *SLRTX341*
Section – II
_________________
Set Q
Seat
No.

Set R

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.


a) ¬P1 ∨ P2 b) P1 ∨ P2
c) P1 ∧ P2 d) P1 ∧ ¬ P2
a) Sparse b) Dense
P.T.O.
SLR-TX – 341 -2- *SLRTX341*
_________________
Set R
-3-

Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

2) 2NF.
4) Set membership.
Set R
SLR-TX – 341 -4- *SLRTX341*
Section – II
_________________
Set R
Seat
No.

Set S

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.


P.T.O.
SLR-TX – 341 -2- *SLRTX341*
a) ¬P1 ∨ P2 b) P1 ∨ P2
c) P1 ∧ P2 d) P1 ∧ ¬ P2
a) Sparse b) Dense c) Both a) and b) d) None

_________________
Set S
-3-

Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

2) 2NF.
4) Set membership.
Set S
SLR-TX – 341 -4- *SLRTX341*
Section – II
_________________
Set S

Seat
No. Set P
T.E. (CSE) (Part – I) (New CBCS) Examination, 2018
design and analysis of algorithm
Day and Date : Friday, 7-12-2018 Max. Marks : 70
Time : 2.30 p.m. to 5.30 p.m.

1. Choose the correct alternatives : 14

1) Which of the following standard algorithms is not a Greedy algorithm ?
a) Dijkstra’s shortest path algorithm b) Prim’s algorithm
c) Kruskal algorithm d) None of the above
2) The Floyd-Warshall all-pairs shortest path algorithm for finding the shortest distances
between nodes in a graph is an example of
a) A Dynamic Programming formulation
b) A Greedy Algorithm
c) A recursion based divide and conquer technique
3) Which of the following sorting algorithms has the lowest worst–case complexity ?
a) Merge sort b) Bubble sort c) Quick sort d) Selection sort
4) Quick sort is run on two inputs shown below to sort in ascending order
i) 1, 2, 3 ,. . . , n ii) N, n – 1, n – 2 . . . 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively. Then
a) C1 < C2 b) C1 > C2 c) C1 = C2 d) We cant say
5) Consider following graph for Dijkstra’s single source shortest path. In what order do the
nodes gets included into set of vertices for which shortest path distances are finalized ?
1
Q R
1 4 2
P 6 S 1
2
7 3

T 2 U
a) P, Q, R, S, T, U b) P, Q, R, U, S, T c) P, Q, R, U, T, S d) P, Q, T, R, U, S
P.T.O.
SLR-TX – 342 -2- *SLRTX342*
6) Let G be an undirected connected graph with distinct edge weights. Let emax be the edge
with maximum weight and emin be the edge with minimum weight. Which of the following
statement is false ?
a) Every minimum spanning tree of G must contain emin
b) If emax is in a minimum spanning tree, then its removal must disconnect G
c) No minimum spanning tree contains emax
d) G has unique minimum spanning tree
1. The problem of determining whether there exists a cycle in an undirected graph is in P.
2. The problem of determining whether there exists a cycle in an undirected graph is in NP.
3. If a problem A is NP-complete, there exists a non deterministic polynomial time
algorithm to solve A
a) 1, 2 and 3 b) 1 and 3 c) 2 only d) 3 only
8) Two alternate packages A and B are available for processing a database having 10k
records. Package A requires 0.0001 n2 time unit and package B requires 10nlog10n units
to process records. What is the smallest value of k for which package B will be preferred
over A.
a) 12 b) 10 c) 6 d) 5
9) The average number of key comparisons done on a successful sequential search in a list
of length of n is
a) Log n b) n–1/2 c) n/2 d) n + 1/2
10) Although it requires more complicated data structures, Prim’s algorithm for a minimum
spanning tree is better than Kruskal’s when the graph has a large number of vertices.
a) True b) False
11) The correct matching for the following pair is
A. All pair shortest path 1. Greedy
B. Quick sort 2. Depth First Search
C. Minimum weight spanning tree 3. Dynamic programming
D. Connected components 4. Divide and conquer
a) A – 2, B – 4, C – 1, D – 3 b) A – 3, B – 4, C – 1, D – 2
c) A – 3, B – 4, C – 2, D – 1 d) A – 4, B – 1, C – 2, D – 3
12) Which one of the following correctly determines the solution of the recurrence relation
with T(1) = 1 ?
T(n) = 2T(n/2) + log n.
a) θ(n) b) θ(n logn) c) θ(n2) d) θ(logn)
13) The minimum number of comparisons required to determine if an integer appears more
than n/2 times in a sorted array of n integer is
a) θ(n) b) θ(logn) c) θ(log2n) d) θ(1)
14) For merging two sorted list of size m and n into sorted list of size m + n, we required
comparisons of
a) 0(m) b) 0 (n)
c) 0(m + n) d) 0(log m + log n)
______________
Set P
*SLRTX342* -3- SLR-TX – 342
Seat
No.

Day and Date : Friday, 7-12-2018 Marks : 56
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1) Compare the two functions n2 and 2n/4 for various values of n. Determine when the second
becomes larger than first.
2) Determine the frequency count for all the statements in the following algorithm
segments
Algorithm Transpose (a, n)
{
For i = 1 to n – 1 do
For j = i + 1 to n do
{
t = a[i, j]; a[i, j] = a[j, i]; a[j, i] = t;
}
}
3) Differentiate between Kruskal and Prims algorithm.
4) Device a binary search algorithm that splits the set not into two sets of (almost) equal
sizes but into two sets, one of which is twice the size of other.
3. Solve any one : (8×1=8)

A) Show how Quicksort sorts the following sequence of keys
5, 5, 8, 3, 4, 3, 2
OR
A) Find an optimal solution to the knapsack instance
n = 7, m = 15, (p1, p2,. .., p7) = (10, 5, 15, 7, 6, 18, 3) and (w1, w2, ..., w7) = (2, 3, 5, 7, 1, 4, 1)
Set P
SLR-TX – 342 -4- *SLRTX342*
4. Solve 8
Symbol Frequency
A 70 million
B 3 million
C 20 million
D 37 million
Find decode tree and code for above symbol table.
SECTION – II

1) Write difference between Greedy algorithm and Dynamic Programming.
2) Generate the sets Si, 0 < = i > = 4, when (w1, w2, w3, w4) = [10, 15, 6, 9) and
(p1, p2, p3, p4) = (2, 5, 8, 1)
3) Define P, NP, NP-complete and NP-Hard problem.
4) Define tractable and intractable problem.

A) Let w = (5, 7, 10, 12, 15, 18, 20) and m = 35. Find all possible subset of w that sum to m.
Draw portion of state space tree.
OR
A) Find optimal binary search tree for given data
n = 4 ,identifier(a1, a2, a3, a4)=(do, if, int, while) p(1 : 4) = (3, 3, 1, 1) and
q(0 : 4) = (2, 3, 1, 1, 1).
7. Find a minimum cost path from S to T in multistage graph using forward approach. 8
Stage 2 Stage 3
A 3
D
6 4
1 8
Stage 1
Stage 4
S 2 B 10 2
E T
3
7 10
C

_____________________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.


over A.
a) 12 b) 10 c) 6 d) 5
of length of n is
a) Log n b) n–1/2 c) n/2 d) n + 1/2
a) True b) False
a) A – 2, B – 4, C – 1, D – 3 b) A – 3, B – 4, C – 1, D – 2
c) A – 3, B – 4, C – 2, D – 1 d) A – 4, B – 1, C – 2, D – 3
with T(1) = 1 ?
T(n) = 2T(n/2) + log n.
P.T.O.
SLR-TX – 342 -2- *SLRTX342*
comparisons of
a) 0(m) b) 0 (n)
c) 0(m + n) d) 0(log m + log n)
i) 1, 2, 3 ,. . . , n ii) N, n – 1, n – 2 . . . 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively.
Then
1
Q R
1 4 2
P 6 S 1
2
7 3

T 2 U
a) 1, 2 and 3 b) 1 and 3 c) 2 only d) 3 only Set Q
______________
*SLRTX342* -3- SLR-TX – 342
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

segments
{
{
t = a[i, j]; a[i, j] = a[j, i]; a[j, i] = t;
}
}

5, 5, 8, 3, 4, 3, 2
OR
n = 7, m = 15, (p1, p2,. .., p7) = (10, 5, 15, 7, 6, 18, 3) and (w1, w2, ..., w7) = (2, 3, 5, 7, 1, 4, 1)
Set Q
SLR-TX – 342 -4- *SLRTX342*
4. Solve 8
Symbol Frequency
A 70 million
B 3 million
C 20 million
D 37 million
SECTION – II

(p1, p2, p3, p4) = (2, 5, 8, 1)

OR
q(0 : 4) = (2, 3, 1, 1, 1).
Stage 2 Stage 3
A 3
D
6 4
1 8
Stage 1
Stage 4
S 2 B 10 2
E T
3
7 10
C

_____________________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
1
Q R
1 4 2
P 6 S 1
2
7 3

T 2 U
over A.
a) 12 b) 10 c) 6 d) 5
P.T.O.
SLR-TX – 342 -2- *SLRTX342*
of length of n is
a) Log n b) n–1/2 c) n/2 d) n + 1/2
a) True b) False
a) A – 2, B – 4, C – 1, D – 3 b) A – 3, B – 4, C – 1, D – 2
c) A – 3, B – 4, C – 2, D – 1 d) A – 4, B – 1, C – 2, D – 3
with T(1) = 1 ?
T(n) = 2T(n/2) + log n.
comparisons of
a) 0(m) b) 0 (n)
c) 0(m + n) d) 0(log m + log n)
i) 1, 2, 3 ,. . . , n ii) N, n – 1, n – 2 . . . 2, 1
Then
______________
Set R
*SLRTX342* -3- SLR-TX – 342
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

segments
{
{
t = a[i, j]; a[i, j] = a[j, i]; a[j, i] = t;
}
}

5, 5, 8, 3, 4, 3, 2
OR
n = 7, m = 15, (p1, p2,. .., p7) = (10, 5, 15, 7, 6, 18, 3) and (w1, w2, ..., w7) = (2, 3, 5, 7, 1, 4, 1)
Set R
SLR-TX – 342 -4- *SLRTX342*
4. Solve 8
Symbol Frequency
A 70 million
B 3 million
C 20 million
D 37 million
SECTION – II

(p1, p2, p3, p4) = (2, 5, 8, 1)

OR
q(0 : 4) = (2, 3, 1, 1, 1).
Stage 2 Stage 3
A 3
D
6 4
1 8
Stage 1
Stage 4
S 2 B 10 2
E T
3
7 10
C

_____________________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.


a) True b) False
a) A – 2, B – 4, C – 1, D – 3 b) A – 3, B – 4, C – 1, D – 2
c) A – 3, B – 4, C – 2, D – 1 d) A – 4, B – 1, C – 2, D – 3
with T(1) = 1 ?
T(n) = 2T(n/2) + log n.
comparisons of
a) 0(m) b) 0 (n)
c) 0(m + n) d) 0(log m + log n)
P.T.O.
SLR-TX – 342 -2- *SLRTX342*
i) 1, 2, 3 ,. . . , n ii) N, n – 1, n – 2 . . . 2, 1
Then
1
Q R
1 4 2
P 6 S 1
2
7 3

T 2 U
over A.
a) 12 b) 10 c) 6 d) 5
of length of n is
a) Log n b) n–1/2 c) n/2 d) n + 1/2 Set S
__________________
*SLRTX342* -3- SLR-TX – 342
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

segments
{
{
t = a[i, j]; a[i, j] = a[j, i]; a[j, i] = t;
}
}

5, 5, 8, 3, 4, 3, 2
OR
n = 7, m = 15, (p1, p2,. .., p7) = (10, 5, 15, 7, 6, 18, 3) and (w1, w2, ..., w7) = (2, 3, 5, 7, 1, 4, 1)
Set S
SLR-TX – 342 -4- *SLRTX342*
4. Solve 8
Symbol Frequency
A 70 million
B 3 million
C 20 million
D 37 million
SECTION – II

(p1, p2, p3, p4) = (2, 5, 8, 1)

OR
q(0 : 4) = (2, 3, 1, 1, 1).
Stage 2 Stage 3
A 3
D
6 4
1 8
Stage 1
Stage 4
S 2 B 10 2
E T
3
7 10
C

_____________________
Set S

Seat
No. Set P

Computer Organization
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.
3) Answer all the questions from Section – I and Section – II.
5) Assume data whenever necessary.


1) In process DMA stands for
A) Direct memory access
B) Division memory access
C) Direct mapping access
D) All of the above
2) The periods of time when the unit is idle is called as
A) Stalls B) Bubbles
C) Hazards D) Both A) and B)
3) Smallest addressable memory item binary __________ coded decimal.
A) Bit B) Byte
C) Half word D) Word
4) The average time required to reach a storage location in memory and obtain
its contents is called the
A) seek time B) turnaround time
C) access time D) transfer time
P.T.O.
SLR-TX – 343 -2- *SLRTX343*
5) The idea of cache memory is based

A) on the property of locality of reference
B) on the heuristic 90-10 rule
C) on the fact that references generally tend to cluster
D) all of the above
6) Which of the following is lowest in memory hierarchy ?
A) Cache memory B) Secondary memory
C) Registers D) RAM
7) Cache memory acts between
A) CPU and RAM B) RAM and ROM
C) CPU and Hard Disk D) None of these
8) A Stack-organised Computer uses instruction of
A) Indirect addressing B) Two-addressing
C) Zero addressing D) Index addressing
9) The multiplicand register and multiplier register of a hardware circuit
implementing booth’s algorithm have (11101) and (1100). The result shall
be
A) (812) 10 B) (–12) 10 C) (12) 10 D) (–812) 10
10) The circuit converting binary data in to decimal is
A) Encoder B) Multiplexer
C) Decoder D) Code converter
11) MRI indicates
A) Memory Reference Information
B) Memory Reference Instruction
C) Memory Registers Instruction
D) Memory Register information
12) Which of the following interrupt is non maskable ?
A) INTR B) RST 7.5 C) RST 6.5 D) TRAP
13) Which of the following are not a machine instructions ?
A) MOV B) ORG C) END D) B) and C)
14) When necessary, the results are transferred from the CPU to main memory
by
A) I/O devices B) CPU C) Shift registers D) none of these
______________
Set P
*SLRTX343* -3- SLR-TX – 343
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
Instructions : 1) Answer all the questions from Section – I and Section – II.
SECTION – I
1) List out the different functional units of computer and explain any 2.
2) Differentiate between RlSC and CISC.
3) Divide 29/3 with non restoring algorithm.
4) Explain full adder circuit dig by using two half adder.
5) Explain page segmentation.
1) Describe look aside and look -through organization of cache.
2) List out different types of instruction with example.
3) Explain in brief Electronics generation of computer.
SECTION – II
1) Draw and explain the detailed hardwired control organization.
2) Differentiate between Memory mapped I/O and Isolated I/O.
3) Differentiate between linear and non linear pipelining.
4) list out different IO techniques and explain any one.
5) Write a short note on DMA.
1) List out different types of hazard in pipelining and explain data hazard and
give the advantages of Pipelining.
2) Explain Multiplier control unit.
3) Draw and explain loosely coupled and tightly coupled multiprocessor.
____________
Set P
Set P

Seat
No. Set Q

Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


be
A) (812) 10 B) (–12) 10 C) (12) 10 D) (–812) 10
4) MRI indicates
P.T.O.
SLR-TX – 343 -2- *SLRTX343*

by
D) All of the above
A) Bit B) Byte
D) all of the above
C) Registers D) RAM
______________
Set Q
*SLRTX343* -3- SLR-TX – 343
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
SECTION – II
____________
Set Q
Set Q

Seat
No. Set R

Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


D) all of the above
C) Registers D) RAM
P.T.O.
SLR-TX – 343 -2- *SLRTX343*

be
A) (812) 10 B) (–12) 10 C) (12) 10 D) (–812) 10
7) MRI indicates
by
D) All of the above
A) Bit B) Byte
______________
Set R
*SLRTX343* -3- SLR-TX – 343
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
SECTION – II
____________
Set R
Set R

Seat
No. Set S

Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


2) MRI indicates
by
P.T.O.
SLR-TX – 343 -2- *SLRTX343*

D) All of the above
A) Bit B) Byte
D) all of the above
C) Registers D) RAM
be
A) (812) 10 B) (–12) 10 C) (12) 10 D) (–812) 10
______________
Set S
*SLRTX343* -3- SLR-TX – 343
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
SECTION – II
____________
Set S
Set S
Seat Set P
No.
T.E. (CSE) (Part – I) (Old – CGPA) Examination, 2018
OPERATING SYSTEM CONCEPTS

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) The degree of multi-programming is
a) The number of processes executed per unit time
b) The number of processes in the ready queue
c) The number of processes in the I/O queue
d) The number of processes in memory
2) The primary distinction between the short term scheduler and the long
term scheduler is
a) The length of their queues b) The type of processes they schedule
c) The frequency of their execution d) None of these
3) A monitor is a module that encapsulates
a) Shared data structures
b) Procedures that operate on shared data structure
c) Synchronization between concurrent procedure invocation
4) The child process can
a) be a duplicate of the parent process
b) have another program loaded into it
c) Both a) and b)
d) Only a)
P.T.O.
SLR-TX – 349 -2- *SLRTX349*
5) Spinlocks are
a) CPU cycles wasting locks over critical sections of programs
b) Locks that avoid time wastage in context switches
c) Locks that work better on multiprocessor systems
d) All of these
6) Preemptive Shortest Job First scheduling is sometimes called
a) Fast SJF scheduling
b) EDF (Earliest Deadline First)
c) HRRN (Highest Response Ratio Next)
d) SRTN (Shortest Remaining Time Next)
7) A solution to the problem of indefinite blockage of low-priority processes
is
a) Starvation b) Wait queue c) Ready queue d) None of these
8) A problem encountered in multitasking when a process is perpetually
denied necessary resources is called
a) Deadlock b) Starvation c) Inversion d) Aging
9) Deadlock prevention is a set of methods
a) To ensure that at least one of the necessary conditions cannot hold
b) To ensure that all of the necessary conditions do not hold
c) To decide if the requested resources for a process have to be given or
not
d) To recover from a deadlock
10) What is compaction ?
a) a technique for overcoming internal fragmentation
b) a paging technique
c) a technique for overcoming external fragmentation
d) a technique for overcoming fatal error
11) Operating System maintains the page table for
a) Each process b) Each thread
c) Each instruction d) Each address
12) The pager concerns with the
a) Individual page of a process b) Entire process
c) Entire thread d) First page of a process
13) When a program tries to access a page that is mapped in address space
but not loaded in physical memory, then ?
a) Segmentation fault occurs b) Fatal error occurs
c) Page fault occurs d) No error occurs
14) The _____________ present a uniform device-access interface to the I/O
subsystem, much as system calls provide a standard interface between
the application and the operating system.
a) Devices b) Buses
c) Device drivers d) I/O systems
_____________ Set P

*SLRTX349* -3- SLR-TX – 349
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

1) Explain Reader Writer problem.
2) Write a note on multiprocessor systems.
3) What is operating system ? Explain its functionalities.
4) Describe multi-level feedback queue with diagram.
5) Describe PCB with diagram.
3. Solve any two : (2�8=16)

1) Consider the following set of processes with arrival time and burst time in
milliseconds as given below :
P. No. AT BT
1 5 5
2 4 6
3 3 7
4 1 9
5 2 2
6 6 3
i) Draw Gantt Chart illustrating the execution of processes using Round
Robin scheduling algorithm with time quantum of 3 ms.
ii) Calculate average waiting time for the above scheduling algorithm.
iii) Calculate average turn around for the above time scheduling
algorithm.
2) What is semaphore ? Explain Dinning Philosopher problem using
semaphore.
3) What is inter-process communication ? Explain the two models of inter-
process communication.
Set P
SLR-TX – 349 -4- *SLRTX349*
SECTION – II
4. Solve any three : 12

a) Explain different ways for deadlock recovery.
b) Explain resource allocation graph and resource allocation graph algorithm.
c) Explain Demand Paging.
d) Write note on :
1) Logical address and Physical address.
2) Best fit, Worst fit, First fit and Compaction.

a) Explain Paging in detail.
Suppose that we have free segments with sizes : 6, 17, 25, 14 and 19.
Place a program with size 13 kB in the free segment using first-fit, best-fit
and worst-fit ?
b) Prove Belady’s Anomaly with an example. (Show with graph)
c) What are the responsibilities of DMA Controller and the advantages of
DMA ? Explain the steps process to perform DMA transfer.
_____________
Set P
Seat Set Q
No.
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
not
P.T.O.
SLR-TX – 349 -2- *SLRTX349*
a) Devices b) Buses
term scheduler is
c) Both a) and b)
d) Only a)
12) Spinlocks are
d) All of these
is
_____________

Set Q
*SLRTX349* -3- SLR-TX – 349
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


P. No. AT BT
1 5 5
2 4 6
3 3 7
4 1 9
5 2 2
6 6 3
algorithm.
semaphore.
Set Q
SLR-TX – 349 -4- *SLRTX349*
SECTION – II

d) Write note on :

and worst-fit ?
_____________
Set Q
Seat Set R
No.

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) Spinlocks are
d) All of these
is
not
P.T.O.
SLR-TX – 349 -2- *SLRTX349*
a) Devices b) Buses
term scheduler is
c) Both a) and b)
d) Only a)
_____________

Set R
*SLRTX349* -3- SLR-TX – 349
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


P. No. AT BT
1 5 5
2 4 6
3 3 7
4 1 9
5 2 2
6 6 3
algorithm.
semaphore.
Set R
SLR-TX – 349 -4- *SLRTX349*
SECTION – II

d) Write note on :

and worst-fit ?
_____________
Set R
Seat Set S
No.

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) Devices b) Buses
P.T.O.
SLR-TX – 349 -2- *SLRTX349*
term scheduler is
c) Both a) and b)
d) Only a)
10) Spinlocks are
d) All of these
is
not
_____________

Set S
*SLRTX349* -3- SLR-TX – 349
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


P. No. AT BT
1 5 5
2 4 6
3 3 7
4 1 9
5 2 2
6 6 3
algorithm.
semaphore.
Set S
SLR-TX – 349 -4- *SLRTX349*
SECTION – II

d) Write note on :

and worst-fit ?
_____________
Set S
*SLETX350* SLR-TX – 350

Seat
No.
Set P
T.E. (Part – I) (CSE) (Old-CGPA) Examination, 2018
system programming
Day and Date : Monday 3-12-2018 Max. Marks : 70
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


1) An Operator grammar is a grammar none of whose productions contain
a) One or more consecutive NT’s in any RHS alternative
b) Two or more consecutive NT’s in any RHS alternative
c) Only one NT
2) Code optimization aims at improving
a) Processor efficiency b) Execution efficiency
c) Semantic gap d) Specification gap
3) Relocation Factor (RF) is calculated using
a) Relocation_factor = I_originp – t_originp
b) Relocation_factor = t_originp- I_originpsymb
c) Relocation_factor = t_originp _ dsymb
d) Relocation_factor = I_origin _ dsymb
4) Binary Symbolic Subroutine (BSS) is an example of
a) Absolute loader b) General loading scheme
c) Direct linking loader d) Relocating loader
5) Which one of the following is considered as limitation in designing one-pass
assembler ?
a) Forward reference b) Intermediate code
c) Symbol table d) Op-code table P.T.O.
SLR-TX – 350 -2- *SLETX350*
6) A macro definition consist of

a) A macro prototype statement b) One or more model statements
c) Macro pre-processor statement d) All of the above
7) Following Intermediate code is in ______ format.
Source Code IR
START 200 (AD, 01) (C, 200)
READ A (IS, 09) A
LOOP MOVER AREG, A (IS, 04) AREG, A
SUB AREG, = ‘1’ (IS, 02) AREG, (L, 01)

BC GT, LOOP (IS, 07) GT, LOOP
STOP (IS, 00)
A DS 1 (DL, 02) (C, 1)
LTORG (DL, 05)
a) Variant I b) Variant II c) Variant III d) None
8) Nested macro expansion follows ______ rule.
a) LIFO b) FIFO c) FILO d) None of these
9) Which of the following is not a valid binding time ?
a) Execution init time of proc. b) Language implementation time of L
c) Language definition time of L d) Language execution time of L
10) Linking Table (LINKTAB) is generated by
a) Linker b) Translator
c) Binary Program d) Dynamic Loader
11) Dead code elimination is carried out in
a) Front end b) Back end
c) Optimization phase d) None of the above
12) Which of the following is an input to the linker ?
a) Object modules b) Source program
c) Binary program d) None
13) A language translator converts C ++ program into
a) Assembly language b) ‘C’ language
c) Machine language d) ‘C++’ language
14) In BSS Loader the transfer Vector is used for
a) Allocation b) Relocation
c) Linking d) Loading Set P
–––––––––––––

*SLETX350* -3- SLR-TX – 350
Seat
No.
T.E. (Part – I) (CSE)(Old-CGPA) Examination, 2018

system programming
Day and Date : Monday 3-12-2018 Marks : 56

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1) Describe program execution steps in detail with schematic.
2) Define forward reference and explain it with example.
3) Define Language processor and explain with example, Specification and
Execution Gap.
4) Describe Program generation through Macro facility with example.
3. Solve any two : 16

1) Explain Single pass Assembler in detail.
2) Write and explain Assembler Pass I algorithm in detail.
3) Explain Design of a Macro preprocessor in detail.
SECTION – II

1) Write algorithm for program linking with example.
2) Describe subroutine linkages with example.
3) Explain the evaluation order for operators Algorithm in detail.
4) Describe the aspects of compilation.

5) Explain Data flow analysis and Control flow analysis.
6) Explain Compile and go loader Scheme with its advantages and
disadvantages.
7) Explain Memory allocation in block structured languages.
_____________________ Set P
Set P

Seat
No.
Set Q
system programming
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


P.T.O.
SLR-TX – 350 -2- *SLETX350*

c) Linking d) Loading
c) Only one NT
assembler ?
c) Symbol table d) Op-code table
Source Code IR
START 200 (AD, 01) (C, 200)
READ A (IS, 09) A
SUB AREG, = ‘1’ (IS, 02) AREG, (L, 01)

STOP (IS, 00)
A DS 1 (DL, 02) (C, 1)
LTORG (DL, 05)
Set Q
–––––––––––––

*SLETX350* -3- SLR-TX – 350
Seat
No.

system programming

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

Execution Gap.

SECTION – II


disadvantages.
_____________________ Set Q
Set Q

Seat
No.
Set R
system programming
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


assembler ?
Source Code IR
START 200 (AD, 01) (C, 200)
READ A (IS, 09) A
SUB AREG, = ‘1’ (IS, 02) AREG, (L, 01)

STOP (IS, 00)
A DS 1 (DL, 02) (C, 1)
LTORG (DL, 05)
P.T.O.
SLR-TX – 350 -2- *SLETX350*

c) Only one NT
Set R
______________
*SLETX350* -3- SLR-TX – 350
Seat
No.

system programming

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

Execution Gap.

SECTION – II


disadvantages.
_____________________ Set R
Set R

Seat
No.
Set S
system programming
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
of Page.


c) Only one NT
P.T.O.
SLR-TX – 350 -2- *SLETX350*

assembler ?
Source Code IR
START 200 (AD, 01) (C, 200)
READ A (IS, 09) A
SUB AREG, = ‘1’ (IS, 02) AREG, (L, 01)

STOP (IS, 00)
A DS 1 (DL, 02) (C, 1)
LTORG (DL, 05)
Set S
–––––––––––––

*SLETX350* -3- SLR-TX – 350
Seat
No.

system programming

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

Execution Gap.

SECTION – II


disadvantages.
_____________________ Set S
Set S
Seat
No. Set P
T.E. C.S.E. (Part – I) (Old-CGPA) Examination, 2018
computer networks

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) A computer that uses the ____________ system stores the MSB of data in
c) Both a & b d) None of the above
2) _____________ of SCTP involves multiple streams.
c) Multihoming d) None of the above
3) After sending DHCPDISCOVER message to server, the client goes to
the
a) Requesting State b) Bound State
c) Renewal State d) Selecting State
4) Association establishment in SCTP required
a) Two-way-handshaking b) Three-way-handshaking
c) Four-way-handshaking d) All of the above
P.T.O.
SLR-TX – 351 -2- *SLRTX351*
5) Header of the UDP user datagram consist following fields
a) Source and destination port number
b) Total length
c) Checksum
d) All of the above
7) In TCP ____________ flag is used for synchronizing the sequence no. And
__________ flag is for terminate the connection.
a) URG, SYN b) PSH, FIN c) SYN, FIN d) ACK, SYN
8) To make control character effective in special situation, TELNET uses
a) Out-of-band signalling b) In-band signalling
c) Synchronous signalling d) All of the above
c) SSH-application forwarding d) SSH tunnelling
Pointer ?
a) DM b) IP c) IAC d) All of the above
11) SSH uses _____________ communication protocol.
12) In ____________ sequence of character is without structure.
c) Zone Name Space d) None of the above
13) TSN’s in SCTP are ____________ bits long and randomly initialized.
14) Which of the following is Message access agent ?
a) POP b) IMAP c) SMTP d) Both a & b
____________

Set P
*SLRTX351* -3- SLR-TX – 351
Seat
No.
computer networks
Day and Date : Wednesday, 5-12-2018, -2018 Marks : 56

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

SECTION – I
2. Attempt any four (Each carries 5 marks) : (4×5=20)
a) Explain Port address and Application specific address with examples.
b) For a given UDP Header in hexadecimal format 0045DF000058FE20,
find source port number, destination port number, total length of the user
datagram, length of the data, direction of the packet and kind of client
process ?
c) Explain UDP Package with neat diagram.
d) Write a short note on Persistence Timer.
e) Explain socket structure in detail.
f) Draw and explain TCP Segment format.
3. Attempt any one of the following : (1×8=8)
a) Draw and explain State-transistion diagram of SCTP.
b) Explain connectionless iterative client and server socket interface in detail.
SECTION – II
a) Explain packet format of DHCP.
b) Explain the terms used in DNS: Flat Name Space, Hierarchical Name
Space, Zone, FQDN and PQDN.
c) Write a short note on Port forwarding.
d) Explain the concept of NVT. Also explain NVT Character set.
e) Explain HTTP with diagram.
f) Explain Out-of-band signalling.
a) What is MTA and MAA of SMTP ? Explain MTA commands and responses.
b) Explain need for DNS. What are the DNS domains ? List the types of
DNS records.
–––––––––––––
Set P
Set P
Seat
No. Set Q
computer networks

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

Pointer ?
P.T.O.
SLR-TX – 351 -2- *SLRTX351*
the
b) Total length
c) Checksum
d) All of the above
____________

Set Q
*SLRTX351* -3- SLR-TX – 351
Seat
No.
computer networks

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

SECTION – I
process ?
SECTION – II
DNS records.
–––––––––––––
Set Q
Set Q
Seat
No. Set R
computer networks

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

b) Total length
c) Checksum
d) All of the above
P.T.O.
SLR-TX – 351 -2- *SLRTX351*
Pointer ?
the
____________

Set R
*SLRTX351* -3- SLR-TX – 351
Seat
No.
computer networks

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

SECTION – I
process ?
SECTION – II
DNS records.
–––––––––––––
Set R
Set R
Seat
No. Set S
computer networks

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

Pointer ?
P.T.O.
SLR-TX – 351 -2- *SLRTX351*
the
b) Total length
c) Checksum
d) All of the above
____________

Set S
*SLRTX351* -3- SLR-TX – 351
Seat
No.
computer networks

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

SECTION – I
process ?
SECTION – II
DNS records.
–––––––––––––
Set S
Set S
Seat
No.
Set P
T.E. (CSE) (Part – I) (Old CGPA) Examination, 2018
DESIGN AND ANALYSIS OF ALGORITHM
Day and Date : Friday, 7-12-2018 Total Marks : 70

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.
1. Choose the correct alternative for the following : (1×14=14)

1) Three algorithm do the same task. Algorithm 1 needs O(sqrt(n)) time
algorithm 2 is O(n) and algorithm 3 is O(n.logn). Whch algorithm should
execute faster for large n ?
a) O(sqrt(n)) b) O(n) c) O(n.logn) d) None of these
2) Finite and effective steps, which are when carried out perform certain task
is called as
a) Algorithm b) Pseudo code c) Strategy d) Optimization
3) _______________ method is used for solving recurrence relation.
a) Division b) Replacement c) Substitution d) None of these
4) ______________ can only point to the presence of errors, but not to their
absence.
a) Profiling b) Debugging c) Testing d) Analyzing
5) In this sort, file is divided into subfiles which are to be independently sorted
and then merges
a) quick sort b) heap sort c) bubble sort d) none of these
6) Mean retrieval time is obtained by storing the programs on tape in ________
of their lengths.
a) Non increasing b) Non decreasing
c) Either a) or b) d) Both a) and b)
P.T.O.
SLR-TX – 352 -2- *SLRTX352*
7) Huffman code is an application of
a) Optimal storage b) Optimal merge
c) Optimal retrieval d) None of above
8) A graph is said to be __________ iff it can be drawn in a plane in such a
way that no two edges cross each other.
a) Planar b) Direct
c) Coloured d) Cross
9) The tree organization of solution space is
a) Answer tree b) State space tree
c) Dynamic tree d) Dead tree
10) In n-queen problem two queens are attacking each other it.
a) They are at same diagonal b) They are at same row
c) They are at same column d) All of above
11) Which of the following standard algorithms is not Dynamic Programming
based ?
a) Travelling sales person problem
b) Floyd algorithm for all pair shortest path
c) 0 – 1 knapsack problem
d) Prim’s minimum Spanning tree
12) A _________ is a round trip path along n edges of G that visits every vertex
once and returns to it’s starting position.
a) MST b) TSP
c) Multistage graph d) Hamiltonian Cycle
13) An algorithm that calls itself directly or indirectly is known as
a) Sub algorithm b) Polish algorithm
c) Recursion d) Traversal algorithm
14) In which of the following scheduling process the processing of task on any
processor is not terminated till the task is completed ?
a) Preemptive b) Non preemptive
c) Round-robin d) FIFO
____________

Set P
*SLRTX352* -3- SLR-TX – 352
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

a) Explain Performance Analysis of algorithm.
b) Write algorithm for binary search using divide and conquer.
c) Find the time complexity of following algorithm by introducing count variable.
Algorithm add(a, b, c, m, n)
{
for i = 1 to m do
for j = 1 to n do
c[i, j] = a[i, j] + b[i, j];
}
d) What is spanning tree ? What are applications of spanning tree ?

a) Write the algorithm and prove that complexity of merge sort is O(n.logn)
(Use the recurrence relation).
OR
a) Find shortest path from 1 to all.
Set P
15

SLR-TX – 352 -4- *SLRTX352*
b) Write Prim’s algorithm and find minimum cost spanning tree of following
graph.
SECTION – II

a) What is tractable and intractable problems ?
b) Find all pair shortest path.
11

c) Write a short note on optimal binary search tree.
d) Solve the 0/1 knapsack instance with n = 3(W1, W2, W3) = (4, 6, 8) and
(P1, P2, P3) = (10, 12, 15) and m = 6 using dynamic programming.

a) Consider a set S = {5, 10, 12, 13, 15, 18) and M = 30 solve it for obtaining
sum of subset and also draw state space tree.
OR
a) State and explain Cook’s theorem.
b) Write short note on :
i) 8 queen problem ii) Graph coloring.
_ ___________________
Set P
Seat
No.
Set Q

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) Planar b) Direct
based ?
P.T.O.
SLR-TX – 352 -2- *SLRTX352*
a) MST b) TSP
is called as
absence.
and then merges
of their lengths.

____________
Set Q

*SLRTX352* -3- SLR-TX – 352
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

{
for i = 1 to m do
for j = 1 to n do
c[i, j] = a[i, j] + b[i, j];
}

OR
Set Q
15

SLR-TX – 352 -4- *SLRTX352*
graph.
SECTION – II

11


OR
_ ___________________
Set Q
Seat
No.
Set R

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

and then merges
of their lengths.
a) Planar b) Direct
P.T.O.
SLR-TX – 352 -2- *SLRTX352*
based ?
a) MST b) TSP
is called as
absence.

____________

Set R
*SLRTX352* -3- SLR-TX – 352
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

{
for i = 1 to m do
for j = 1 to n do
c[i, j] = a[i, j] + b[i, j];
}

OR
Set R
15

SLR-TX – 352 -4- *SLRTX352*
graph.
SECTION – II

11


OR
_ ___________________
Set R
Seat
No.
Set S

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

based ?
a) MST b) TSP
P.T.O.
SLR-TX – 352 -2- *SLRTX352*
is called as
absence.
and then merges
of their lengths.
a) Planar b) Direct
____________

Set S
*SLRTX352* -3- SLR-TX – 352
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

{
for i = 1 to m do
for j = 1 to n do
c[i, j] = a[i, j] + b[i, j];
}

OR
Set S
15

SLR-TX – 352 -4- *SLRTX352*
graph.
SECTION – II

11


OR
_ ___________________
Set S
Seat
No.
Set P
T.E. (CSE) (Part – I) (Old) (CGPA) Examination, 2018
COMPUTER ORGANIZATION

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) Von Neumann was introduced new computer for its predecessors stored
and processed numbers in binary of base 2 form called as
a) ENIAC b) EDVAC c) IBM d) IAS
2) RISC Architecture are based on ___________ control unit.
a) Micro Programmed control unit b) Delay element method
c) Hardwired control unit d) State table method
3) Multiply X, C, C is a
a) Zero address instruction b) One address instruction
c) Two address instruction d) Three address instruction
4) OP A is a
a) EDVAC one address information format
b) ENIVAC one address information format
c) IAS one address information format
d) None of these
P.T.O.
SLR-TX – 353 -2- *SLRTX353*
5) HDL stands for
a) Hardware Definition Language b) Hardware Description Language
c) Hardware Domain Language d) None of these
6) PLA in hardwired control unit design stands for
a) Parallel architecture b) Parallel loop array
c) Programmable logic arrays d) Parallel loop architecture
7) What does the hardwired control generator consist of ?
a) Decoder/encoder b) Condition codes
c) Control step counter d) All of the above
8) The average time tA for the CPU to access a word in the two level
memory is given by
a) tA = (1 + H)tA1 + HtA2 b) tA = (1 – H)tA1 + HtA2
c) tA = HtA1 – (1 + H)tA2 d) tA = HtA1 + (1 – H)tA2
9) The most significant bits of address of memory that are used for
comparison are called
a) Index b) Offset c) Tag d) Word
10) A single instruction replacing multiple (scalar) instructions is a
characteristic of which processor ?
a) Multiprocessor b) Uniprocessor
c) Concurrent processor d) Vector processor
11) Linear pipeline applied in case of
a) Instruction execution b) Arithmetic computation
c) Memory access operation d) All
12) Consider two instructions i and j, with i occuring before j. If j tries to read
a source before i writes it, then type of hazard is
a) RAW b) WAW c) WAR d) None
13) In memory-mapped I/O
a) The I/O devices and the memory share the same address space
b) The I/O devices have a separate address space
c) The memory and I/O devices have an associated address space
d) A part of the memory is specifically set aside for the I/O operation
14) The method which offers higher speeds of I/O transfer is
a) Interrupts b) Memory mapping
c) Program-controlled I/O d) DMA
_____________

Set P
*SLRTX353* -3- SLR-TX – 353
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

1) What are the functional units of computer ? Define the function of each
functional unit ? How functional units are arranged in computer ?
2) Perform (–8 * 2) using Booth’s algorithm ?
3) Compute X2 by the method of difference represent computation and
corresponding difference engine configuration ?
4) Solve the division by restoring method 7/3.
5) Write a program to evaluate operation X =A*B + C*C using zero, one
address machine instruction.

1) Draw and explain the structure of Babbage’s analytical engine.
2) Represent (1259.125)10 in single precision and double precision format.
3) Explain the sequence counter method of hardwired control unit ?
SECTION – II

1) Write a short note on Cache Read Operation.
2) Explain with neat diagram I/O interfaces with modes of transfer.
3) Differentiate linear and non linear pipelining.
4) What is least recently used replacement policy ? Explain with example.
Set P
SLR-TX – 353 -4- *SLRTX353*
1) Draw and explain DMA function.
2) Explain with example non-preemptive main memory allocation.
3) Define pipeline Hazard and list the pipelining hazards ? Explain each
type of hazards in details.
_____________
Set P
Seat
No.
Set Q

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

memory is given by
P.T.O.
SLR-TX – 353 -2- *SLRTX353*
11) OP A is a
d) None of these
12) HDL stands for
_____________

Set Q
*SLRTX353* -3- SLR-TX – 353
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


SECTION – II

Set Q
SLR-TX – 353 -4- *SLRTX353*
_____________
Set Q
Seat
No.
Set R

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) HDL stands for
memory is given by
P.T.O.
SLR-TX – 353 -2- *SLRTX353*
14) OP A is a
d) None of these
_____________

Set R
*SLRTX353* -3- SLR-TX – 353
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


SECTION – II

Set R
SLR-TX – 353 -4- *SLRTX353*
_____________
Set R
Seat
No.
Set S

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

P.T.O.
SLR-TX – 353 -2- *SLRTX353*
9) OP A is a
d) None of these
10) HDL stands for
memory is given by

_____________

Set S
*SLRTX353* -3- SLR-TX – 353
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


SECTION – II

Set S
SLR-TX – 353 -4- *SLRTX353*
_____________
Set S
Seat
No.
Set P
T.E. (Computer Science and Engineering) (Part – II) (CGPA)
Examination, 2018
DATABASE ENGINEERING
Day and Date : Monday, 19-11-2018 Total Marks : 70

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

1) Logical level describes ____________ data are stored in the database.
a) Which b) What c) How d) All
2) AS clause is used in SQL for
a) Selection b) Projection c) Rename d) None
3) Relational Algebra is
a) Procedural Language b) Non-procedural Language
c) Data High Level Language d) None
4) Structure of the database can be changed using _____________ statement.
a) CREATE b) MODIFY c) MAKE d) ALTER
5) Which of the following is true for BCNF ?
a) α→ β must always be non-trivial
b) α is not a superkey
c) Not every BCNF decomposition is dependency preserving
d) None
P.T.O.
SLR-TX – 359 -2- *SLRTX359*
6) Which of the following is not a drawback of bad database design ?
a) Repetition of Information b) Null Values
c) Inability to represent Data d) Redundancy Reduction
7) Which of the following is not a rule for finding Closure of Set of Functional
Dependency ?
a) Transitivity b) Associativity
c) Reflexivity d) Pseudo transitivity
8) Secondary Index is
a) Sparse b) Dense
9) Which of the following is a reason for Bucket Overflow ?
a) Insufficient number of buckets b) Skew in record distribution
10) The point in the schedule where the transaction obtains its final lock is called as
a) Final Point b) End Point c) Lock Point d) All
11) Two-Phase Locking Protocol ensures
a) Serializability b) Freedom from Deadlocks
c) Cascadeless Schedule d) None
12) Which of the following is a factor for selecting a particular transaction as a
victim if deadlock has occurred ?
a) How long transaction has computed
b) How many data items transaction has used
c) How many more data items transaction needs
d) All
13) For a set N transactions, which of the following is true ?
a) There will be more N ! Serial Schedules
b) There will be N ! Serial Schedules
c) There will be (N-1)/2 Serial Schedules
d) There will be N/2 Serial Schedules
14) Which of the following is not a log record ?
a) <T COMMIT> b) <T START>
c) <T ABORT> d) <T ROLLBACK>
Set P
____________

*SLRTX359* -3- SLR-TX – 359
Seat
No.
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Attempt any three of the following : (3×4=12)

a) Explain different types of Attributes.
b) Explain Specialization and Generalization.
c) Define and explain Second Normal Form.
d) Explain the following terms :
i) Weak Entity Set
ii) Total Participation
iii) Partial Participation
iv) Foreign Key.
3. Explain Lossless Decomposition and Dependency Preservation. 8

OR
3. What is Functional Dependency ? What is the use of Closure of Set of Attributes ?

Explain the procedure to find Closure of Set of attributes. Find (AG)+ for the
following example.
R = (A, B, C, G, H, I)
F = {A → B
A→C
CG → H
CG → I
B → H}
4. List and explain the drawbacks of File System. 8

Set P
SLR-TX – 359 -4- *SLRTX359*
SECTION – II

a) Explain the structure of Leaf and Non-leaf Node of B+ Tree Index.
b) Explain different states of transaction with neat diagram.
c) Explain different types of locks with compatibility matrix and example.
d) What is Conflict Serializability ? Show that a Concurrent Schedule is
Conflict serializable with an example.
6. Example Recoverable and Cascadeless Schedules. 8

OR
6. Explain the following terms with example :

i) Primary Index
ii) Clustering Index
iii) Secondary Index
iv) Hash File Organization.
7. Explain Two-Phase Locking Protocol. What are its disadvantages ? Explain

its two variations. 8
_________________
Set P
Seat
No.
Set Q
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) Sparse b) Dense
d) All
P.T.O.
SLR-TX – 359 -2- *SLRTX359*
d) None
Dependency ?
____________

Set Q
*SLRTX359* -3- SLR-TX – 359
Seat
No.
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

i) Weak Entity Set
iv) Foreign Key.

OR

following example.
R = (A, B, C, G, H, I)
F = {A → B
A→C
CG → H
CG → I
B → H}

Set Q
SLR-TX – 359 -4- *SLRTX359*
SECTION – II


OR

i) Primary Index

_________________
Set Q
Seat
No.
Set R
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

d) None
Dependency ?
a) Sparse b) Dense
c) Both a) and b) d) None P.T.O.
SLR-TX – 359 -2- *SLRTX359*
d) All
____________ Set R

*SLRTX359* -3- SLR-TX – 359
Seat
No.
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

i) Weak Entity Set
iv) Foreign Key.

OR

following example.
R = (A, B, C, G, H, I)
F = {A → B
A→C
CG → H
CG → I
B → H}

Set R
SLR-TX – 359 -4- *SLRTX359*
SECTION – II


OR

i) Primary Index

_________________
Set R
Seat
No.
Set S
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

d) All
P.T.O.
SLR-TX – 359 -2- *SLRTX359*
d) None
Dependency ?
a) Sparse b) Dense
c) Both a) and b) d) None Set S

____________

*SLRTX359* -3- SLR-TX – 359
Seat
No.
Examination, 2018

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

i) Weak Entity Set
iv) Foreign Key.

OR

following example.
R = (A, B, C, G, H, I)
F = {A → B
A→C
CG → H
CG → I
B → H}

Set S
SLR-TX – 359 -4- *SLRTX359*
SECTION – II


OR

i) Primary Index

_________________
Set S

Seat
No. Set P
T.E. (CSE) (Part – II) (CGPA Pattern) Examination, 2018
compiler construction
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


1) The lexical analyzer takes ________ as input and produces a stream of
________ as output.
a) Source program, tokens b) Tokens, source program
c) Both a) and b) d) None of the above
2) Parsing is also known as
a) Syntax analysis b) Semantic analysis
c) Lexical analysis d) Code generation
3) Shift reduce parsers are
a) Top down parsers
b) Bottom up parser
c) May be top down or bottom up parser
4) Type checking is normally done during
a) Lexical analysis b) Syntax analysis
c) Syntax directed translation d) Code optimization
5) ________ is a graphical representation of a derivation.
a) The parse tree b) The oct tree
c) The binary tree d) None of the above
P.T.O.
SLR-TX – 360 -2- *SLRTX360*
6) Which of the following parser is most powerful ?

a) Operator precedence b) Canonical LR
c) LALR d) SLR
7) lnherited attribute is a natural choice in
a) Keeping track of variable declaration
b) Checking for the correct use of L values and R values
c) Both a) and b)
d) None of these
8) LR stands for
a) Left to Right
b) Left to Right reduction
c) Right to Left
d) Left to right and Right most derivation in reverse
9) An intermediate code form is
a) Postfix notation b) Syntax trees
c) Three address code d) All of the above
10) Intermediate code generation phase gets input from
a) Lexical analyser b) Syntax analyser
c) Semantic analyser d) Error handling
11) We can optimize code by
a) Dead code elimination b) Common subprograms
c) Copy intermediate loop d) Loop declaration
12) Which of the following is not the function preserving transforming ?
a) Copy propagation b) Dead code elimination
c) Constant folding d) Elimination of left recursion
13) Peephole optimization is a __________ technique.
a) Machine dependant local optimization
b) Global optimization
c) Machine independent local optimization
14) Which of the following is not the storage allocation strategy ?
a) Stack b) Static c) Linked list d) Heap
______________
Set P
*SLRTX360* -3- SLR-TX – 360
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

a) Explain the language processors with diagrams.
b) Describe the following terms with examples.
1) Token 2) Pattern 3) Lexeme
c) Draw a transition diagram that recognizes the lexeme matching the token
relop.
d) Find FIRST and FOLLOW for the following grammar.
E → TE’
E’ → + TE’ | ε
T → FT’
T’ → ∗ FT’ | ε
F → (E)
F → id

a) Explain shift reduce parser with all four actions and perform SR parsing of
input string “id1-id2∗id3” by considering following grammar
E → E-E
E → E∗E
E → id
Set P
SLR-TX – 360 -4- *SLRTX360*

i) Ambiguity of grammar
ii) S-attributed definition
iii) L-attributed definition
iv) Syntax directed translation schemes.
4. Sketch and explain all phases of compiler with example. 8
SECTION – II

a) State and explain types of intermediate code representations.
b) Generate optimized three address code for an expression.
x = a + b∗c + d
Assume x and a as real and b, c and d are integer.
c) State and explain any four issues in the machine code generation.
d) Note on register allocation and assignment.

a) Explain principle sources of optimization.
b) Write an algorithm for partitioning into basic blocks by considering following
program code.
prod = 0;
i = 1;
do
{
prod=prod+a[i]∗b[i];
i=i+1;
}while(i<=10);
7. Explain peephole optimization with example. 8
____________
Set P

Seat
No. Set Q
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


1) LR stands for
a) Left to Right
c) Right to Left
P.T.O.
SLR-TX – 360 -2- *SLRTX360*

________ as output.
a) Top down parsers
b) Bottom up parser
c) LALR d) SLR
c) Both a) and b)
d) None of these
______________
Set Q
*SLRTX360* -3- SLR-TX – 360
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

relop.
E → TE’
E’ → + TE’ | ε
T → FT’
T’ → ∗ FT’ | ε
F → (E)
F → id

E → E-E
E → E∗E
E → id
Set Q
SLR-TX – 360 -4- *SLRTX360*

SECTION – II

x = a + b∗c + d

program code.
prod = 0;
i = 1;
do
{
i=i+1;
}while(i<=10);
____________
Set Q

Seat
No. Set R
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


c) LALR d) SLR
c) Both a) and b)
d) None of these
4) LR stands for
a) Left to Right
c) Right to Left
P.T.O.
SLR-TX – 360 -2- *SLRTX360*

________ as output.
a) Top down parsers
b) Bottom up parser
______________
Set R
*SLRTX360* -3- SLR-TX – 360
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

relop.
E → TE’
E’ → + TE’ | ε
T → FT’
T’ → ∗ FT’ | ε
F → (E)
F → id

E → E-E
E → E∗E
E → id
Set R
SLR-TX – 360 -4- *SLRTX360*

SECTION – II

x = a + b∗c + d

program code.
prod = 0;
i = 1;
do
{
i=i+1;
}while(i<=10);
____________
Set R

Seat
No. Set S
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


P.T.O.
SLR-TX – 360 -2- *SLRTX360*

________ as output.
a) Top down parsers
b) Bottom up parser
c) LALR d) SLR
c) Both a) and b)
d) None of these
13) LR stands for
a) Left to Right
c) Right to Left
______________
Set S
*SLRTX360* -3- SLR-TX – 360
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

SECTION – I

relop.
E → TE’
E’ → + TE’ | ε
T → FT’
T’ → ∗ FT’ | ε
F → (E)
F → id

E → E-E
E → E∗E
E → id
Set S
SLR-TX – 360 -4- *SLRTX360*

SECTION – II

x = a + b∗c + d

program code.
prod = 0;
i = 1;
do
{
i=i+1;
}while(i<=10);
____________
Set S
Seat
No. Set P
T.E. (CSE) (Part – II) (CGPA) Examination, 2018
Unix operating systems
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

1) An exception refers to unexpected
a) Event b) Address c) Inode d) Block
2) Every directory contains the file name dot (.) whose inode no. is equivalent
to inode no. of
a) Directory b) Parent director
c) Root d) None
3) The Kernel finds the block on its hash queue but the buffer is currently busy.
a) First scenario b) Second scenario
c) Third scenario d) Fifth scenario
4) The inode is on free list only if its reference count is
a) 1 b) –1 c) 0 d) 2
5) Which of the following is UNIX system call for I/O ?
a) nice b) pipe c) create d) wakeup
P.T.O.
SLR-TX – 361 -2- *SLRTX361*
6) The Kernel organizes the buffers into separate queues, based as a function
of
a) Logical device number b) Block number
c) Both a and b d) None of above
7) Fork returns _________ when it fails to create a child process.
a) two b) minus one c) zero d) one
8) The __________ registers contains data generated by the process during
its execution.
a) Data b) Stack
c) Processor status d) General purpose
9) _________ algorithm used to handle signals after recognizing their
existence.
a) issig b) sig c) psig d) none
10) A process may increase or decrease the size of its data region by using
the _______ system call.
a) Grow process b) Brk
c) Extend region d) None
11) When a process accesses a page that is not a part of its working set, it
incurs a _______ page fault.
a) Validity b) Invalid c) Modification d) Recent
12) To create a special file _________ system call is used.
a) Create b) Fork c) Pipe d) Mknod
13) CPU usage is calculated by ________ function.
a) Usage b) R-usage c) Time d) Decay
14) Shell interprets the first word of command line as a
a) Parameter b) Command name
c) Library call d) System call
____________
Set P
*SLRTX361* -3- SLR-TX – 361
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

Section – i

1) Explain link () and unlink () system call in detail.
2) Describe Kernel data structure for file.
3) Describe advantage and disadvantage of buffer header.
4) Write a note on directories.

1) Explain the architecture of UNIX operating system with help of block diagram.
2) Explain the algorithm of inode assignment of newly created file.(ialloc
algorithm)
3) Explain getblk algorithm for buffer allocation scenarios.
Section – iI

1) Write and explain allocreg algorithm.
2) Write a short note on system call for time.
3) Write a short note on clists.
Set P
SLR-TX – 361 -4- *SLRTX361*
4) What is terminal driver ? List functions of line discipline.

5) Explain the operations performed by Kernel in handling interrupts and
exceptions.

1) What is context of a process ? Explain all the fields of user level context,
register level context and system level context.
2) Describe in detail the algorithm used for recognizing the signals and the
algorithm for handling the signals.
3) Explain how kernel manages space on swap device in detail.
4) What is validity page fault ? Explain the function of a validity page fault
handler with the help of algorithm.
___________
Set P
Seat
No. Set Q
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

its execution.
a) Data b) Stack
existence.
P.T.O.
SLR-TX – 361 -2- *SLRTX361*
to inode no. of
c) Root d) None
a) 1 b) –1 c) 0 d) 2
of
____________
Set Q
*SLRTX361* -3- SLR-TX – 361
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

Section – i


algorithm)
Section – iI

Set Q
SLR-TX – 361 -4- *SLRTX361*

exceptions.

___________
Set Q
Seat
No. Set R
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

of
its execution.
a) Data b) Stack
existence.
P.T.O.
SLR-TX – 361 -2- *SLRTX361*
to inode no. of
c) Root d) None
a) 1 b) –1 c) 0 d) 2
____________
Set R
*SLRTX361* -3- SLR-TX – 361
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

Section – i


algorithm)
Section – iI

Set R
SLR-TX – 361 -4- *SLRTX361*

exceptions.

___________
Set R
Seat
No. Set S
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

P.T.O.
SLR-TX – 361 -2- *SLRTX361*
to inode no. of
c) Root d) None
a) 1 b) –1 c) 0 d) 2
of
its execution.
a) Data b) Stack
existence.
____________
Set S
*SLRTX361* -3- SLR-TX – 361
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.

Section – i


algorithm)
Section – iI

Set S
SLR-TX – 361 -4- *SLRTX361*

exceptions.

___________
Set S
Seat
No. Set P
Examination, 2018
software engineering
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

1) Which metric is used to quantify the resistance of a design to the potential
ripple effects that are caused by changes in modules ?
a) Network metric b) Stability metric
c) Information flow metric d) None
2) The graph impurity is zero only when
a) Number of nodes is equal to number of edges
b) Number of edges one more than number of nodes
c) Number of nodes one more than number of edges
d) Number of edges half the number of edges
3) The software entity is open for ________, but closed for ________
a) Alteration and Modification b) Modification and Beautification
c) Extension and Modification d) Extension and Accommodation
4) __________ objects specify the control mechanism for the proposed system.
a) Interface b) Application c) Utility d) None
5) Sub class gets all the features from its super class is called as
a) Single inheritance b) Multiple inheritance
c) Strict inheritance d) Non-strict inheritance
P.T.O.
SLR-TX – 362 -2- *SLRTX362*
6) ___________ is used to represent the design in function oriented.
a) Class diagram b) Sequence diagram
c) Structure charts d) Both a and b
7) Quality of the product comes under which type of measures ?
a) Indirect measures b) Direct measures
c) Coding d) None of the above
8) SPC stands for
a) Statistical Process Control b) Statistical Project Control
c) Status Project Control d) Status Process Control
9) White box testing is also called as
a) Structural testing b) Glass Box Testing
10) In CMM, ________ level focus on continuously improvement in process.
a) Initial level b) Manage level
c) Optimizing level d) Repeatable level
11) Which of the following is not a validation activity ?
a) Unit testing b) System testing
c) Structured walkthrough d) Acceptance testing
12) MSP stands for
a) Microsoft Product b) Micosoft Process
c) Microsoft Project d) None of the above
13) SEPG is
a) Software Engineering Process Group
b) Software Engineering Project Group
c) Software Engineering Product Group
d) Software Engineering Program Group
14) Pareto analysis is also called as
a) 20 – 80 rule b) 50 – 50 rule
c) 80 – 20 rule d) none of the above
____________

Set P
*SLRTX362* -3- SLR-TX – 362
Seat
No.
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
Section – i

1) Explain Software Requirement Specification.
2) Explain the change management process.
3) What is effort estimation and scheduling ? Explain briefly.
4) Explain the risk assessments and how to control the risks.
5) What is project control list ? Explain what is the task of project control list
in iterative model.

1) Explain the phased development process.
2) Explain the concepts of effort estimation and scheduling in detail.
3) Explain the role of the CMM in a process management.
Section – iI

a) Write a note on APM.
b) Explain Pareto analysis.
c) Explain milestone analysis.
d) Describe risk assessment in detail.

a) What is risk management ? Explain risk management activities.
b) Discuss white box testing and black box testing in detail.
c) Describe Adaptive Project Management Life Cycle in detail.
___________
Set P
Set P
Seat
No. Set Q
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

1) SPC stands for
5) MSP stands for
P.T.O.
SLR-TX – 362 -2- *SLRTX362*
6) SEPG is
a) 20 – 80 rule b) 50 – 50 rule
____________

Set Q
*SLRTX362* -3- SLR-TX – 362
Seat
No.
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
Section – i

in iterative model.

Section – iI


___________
Set Q
Set Q
Seat
No. Set R
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

4) SPC stands for
P.T.O.
SLR-TX – 362 -2- *SLRTX362*
8) MSP stands for
9) SEPG is
a) 20 – 80 rule b) 50 – 50 rule
____________

Set R
*SLRTX362* -3- SLR-TX – 362
Seat
No.
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
Section – i

in iterative model.

Section – iI


___________
Set R
Set R
Seat
No. Set S
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
Top of Page.

3) MSP stands for
4) SEPG is
P.T.O.
SLR-TX – 362 -2- *SLRTX362*
a) 20 – 80 rule b) 50 – 50 rule
13) SPC stands for
____________

Set S
*SLRTX362* -3- SLR-TX – 362
Seat
No.
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
Section – i

in iterative model.

Section – iI


___________
Set S
Set S
Seat
No.

Set P

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.
Instructions: 1) Q. No. 1 is compulsory. It should be solved in first 30

carries one mark.
Top of Page.

1) Android applications are made up of ____________
a) Loosely tied components b) Tightly tied components
c) Coupled components d) None of above
2) Mandatory for mobile IP is ___________ encapsulation as specified for
mobile IP.
a) IP-in-IP b) Minimal
c) Generic routing d) Maximum
3) ___________ is popularly known as Wi-Fi.
a) IEEE 802.11a b) IEEE 802.11b
c) IEEE 802.11g d) IEEE 802.11n
4) “Every terminal has its own frequency, uninterrupted”, is true for
a) sdma b) tdma
c) fdma d) cdma
5) Example of explicit reservation is
a) prma b) dama
c) Reservation tdma d) csma P.T.O.
SLR-TX – 363 -2- *SLRTX363*
6) Spread spectrum is resistant to ___________ interference.
a) Narrow band b) Broad band
c) Wide band d) All of the above
7) Sky waves are
a) 2 – 30 MHz b) 4 – 40 MHz c) 1 – 10 MHz d) 2 – 20 MHz
8) I-TCP stands for ___________
a) Indirect TCP b) Interrelated TCP
c) Inactive TCP d) Indicated TCP
9) Number of devices can be connected in one piconet is ___________
a) 6 b) 8 c) 10 d) 4
10) Emergency number is which type of service provided by GSM ?
a) Bearer b) Tele
c) Supplementary d) None of these
11) Foreign agents and home agents advertise their presence periodically
using special ______________ messages.
a) Agent advertisement
b) Foreign agent advertisement
c) Home agent advertisement
d) Periodic agent advertisement
12) ______________ is used for initial connection setup between MS and BTS.
a) Access burst
b) Dummy burst
c) Frequency burst
d) Synchronization burst
13) ______________ range is used for communication under water.
a) Infrared (IR) b) Low Frequency (LF)
c) Medium Frequency (MF) d) Super High Frequency (SHF)
14) An associated BS collects the information gathered by the sensors on a
__________ basis.
a) Data-centric b) Data-collection
c) Data-owner d) None of these

_________________
Set P
-3-

Seat
No.

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.
Instruction: Make suitable assumptions if necessary and state them clearly.
SECTION – I
A) What is spread spectrum ? Explain with neat diagram.
B) Differentiate among 1G, 2G, 3G and 4G.
C) Draw the sinusoidal wave and represent amplitude, frequency, cycle,

wavelength on it.
D) Compare AM, FM, PM.
E) How MACA avoids problem of exposed terminals ?
A) Illustrate CDMA, two transmitters A and B are transmitting at same frequency

and power, the keys and data of A and B are as given below :
Ad = 1, Ak = 110110
Bd = 0, Bk = 101101 8
B) Explain the architecture of GSM with neat diagram.
4. Attempt the following : (6�1=6)

What is MANET ? What are characteristics and application of MANET ?
Set P
SLR-TX – 363 -4- *SLRTX363*
SECTION – II

A) Discuss how packet delivery takes place to and from mobile node with
suitable diagram.
B) What is Hawaii ? Why is it used ? Give and discuss its basic architecture.
C) Write a short note on agent advertisement in mobile IP.
D) Give DHCP configuration. Discuss in detail how client gets initialized via
DHCP.
E) What are advantages and disadvantages of wireless LAN.

A) Explain overall architecture of android system with suitable diagram.
B) What is NFC ? How RFID and NFC are related ? Give and discuss general
architecture of NFC enabled phones.

Which are the classical enhancements to TCP for mobility ? Explain any three
in detail.
_________________
Set P
Seat
No.

Set Q

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) 6 b) 8 c) 10 d) 4
a) Bearer b) Tele
a) Agent advertisement b) Foreign agent advertisement
c) Home agent advertisement d) Periodic agent advertisement
a) Access burst b) Dummy burst
c) Frequency burst d) Synchronization burst
P.T.O.
SLR-TX – 363 -2- *SLRTX363*
__________ basis.
mobile IP.
a) IEEE 802.11a b) IEEE 802.11b
c) IEEE 802.11g d) IEEE 802.11n
a) sdma b) tdma
c) fdma d) cdma
a) prma b) dama
c) Reservation tdma d) csma
14) Sky waves are
a) 2 – 30 MHz b) 4 – 40 MHz
c) 1 – 10 MHz d) 2 – 20 MHz
_________________
Set Q
-3-

Seat
No.

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

wavelength on it.

Ad = 1, Ak = 110110
Bd = 0, Bk = 101101 8

Set Q
SLR-TX – 363 -4- *SLRTX363*
SECTION – II

suitable diagram.
DHCP.


in detail.
_________________
Set Q
Seat
No.

Set R

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) prma b) dama
3) Sky waves are
a) 6 b) 8 c) 10 d) 4
a) Bearer b) Tele
P.T.O.
SLR-TX – 363 -2- *SLRTX363*
a) Access burst
b) Dummy burst
c) Frequency burst
d) Synchronization burst
__________ basis.
mobile IP.
a) IEEE 802.11a b) IEEE 802.11b
c) IEEE 802.11g d) IEEE 802.11n
a) sdma b) tdma
c) fdma d) cdma

_________________
Set R
-3-

Seat
No.

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

wavelength on it.

Ad = 1, Ak = 110110
Bd = 0, Bk = 101101 8

Set R
SLR-TX – 363 -4- *SLRTX363*
SECTION – II

suitable diagram.
DHCP.


in detail.
_________________
Set R
Seat
No.

Set S

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

a) Bearer b) Tele
a) Access burst b) Dummy burst
c) Frequency burst d) Synchronization burst
P.T.O.
SLR-TX – 363 -2- *SLRTX363*
__________ basis.
mobile IP.
a) IEEE 802.11a b) IEEE 802.11b
c) IEEE 802.11g d) IEEE 802.11n
a) sdma b) tdma
c) fdma d) cdma
a) prma b) dama
12) Sky waves are
a) 6 b) 8 c) 10 d) 4

_________________
Set S
-3-

Seat
No.

Examination, 2018
mobile computing
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

wavelength on it.

Ad = 1, Ak = 110110
Bd = 0, Bk = 101101 8

Set S
SLR-TX – 363 -4- *SLRTX363*
SECTION – II

suitable diagram.
DHCP.


in detail.
_________________
Set S

Seat
No. Set P
Self Learning (HSS/technical) – network setup and
management tools
Time : 10.00 a.m. to 12.00 noon
Instructions : 1) Q. No. 1 is compulsory. It should be solved in Answer

of Page.

Marks : 10

1) A modem is a network device which
A) Converts analog signal to digital signal
B) Acts as a relay
C) Convert analog signal to digital data
D) None of these
2) ________ management is the set of functions that detect, isolate and correct
malfunctions in a network.
A) Device B) Error
C) Network D) Fault
3) Performance Management is closely related to
A) Fault Management B) Risk Management
C) Security Management D) Configuration Management
4) SOA from the web service is
A) Set Oriented Architecture B) Service Open Architecture
C) Service Oriented Architecture D) None of these
P.T.O.
SLR-TX –364 -2- *SLRTX364*
5) Which of the following filters the unwanted information ?

A) Sality B) Firewall
C) Logic Bomb D) All of these
6) Hub is a multiport
A) Bridge B) Repeater
C) Router D) Gateway
7) Which is the fastest port for data transfer ?
A) Parallel B) Fire Wire 800
C) Serial D) USB 3.0
8) __________ protocol works at the application layer.
A) HTTP B) FTP
C) SMTP D) All of these
9) OSPF is used for
A) Creation of packets
B) Simulation of packets
C) Shortest path routing of packets
D) None of these
10) Switch works at __________ layer.
A) Data Link B) Physical
C) Session D) All
______________
Set P
*SLRTX364* -3- SLR-TX –364
Seat
No.

self learning (hss/Technical) – network setup and
management tools
Time : 10.00 a.m. to 12.00 noon
Attempt any four : (10×4=40)
2. Write a note on :
1) Hub
2) Switches.
3. What is Network Interface Card (NIC) ? Explain various functions of NIC.
4. Explain Abstract Syntax Notation One (ASN.1). Explain objects and Data types
in ASN.1.
5. Write a note on Security Management.
6. What is Fault ? Which are the five – step process involved in Fault Management ?
Explain Fault Detection in detail.
1) Cryptography
2) Network Topology.
____________
Set P
Set P

Seat
No. Set Q
management tools

Time : 10.00 a.m. to 12.00 noon

of Page.

Marks : 10

1) OSPF is used for
D) None of these
C) Session D) All
A) HTTP B) FTP
P.T.O.
SLR-TX –364 -2- *SLRTX364*

B) Acts as a relay
D) None of these
A) Device B) Error
C) Network D) Fault
______________
Set Q
*SLRTX364* -3- SLR-TX –364
Seat
No.

management tools
Time : 10.00 a.m. to 12.00 noon
1) Hub
2) Switches.
in ASN.1.
1) Cryptography
____________
Set Q
Set Q

Seat
No. Set R
management tools

Time : 10.00 a.m. to 12.00 noon

of Page.

Marks : 10

3) OSPF is used for
D) None of these
C) Session D) All
P.T.O.
SLR-TX –364 -2- *SLRTX364*

B) Acts as a relay
D) None of these
A) Device B) Error
C) Network D) Fault
A) HTTP B) FTP
______________
Set R
*SLRTX364* -3- SLR-TX –364
Seat
No.

management tools
Time : 10.00 a.m. to 12.00 noon
1) Hub
2) Switches.
in ASN.1.
1) Cryptography
____________
Set R
Set R

Seat
No. Set S
management tools

Time : 10.00 a.m. to 12.00 noon

of Page.

Marks : 10

P.T.O.
SLR-TX –364 -2- *SLRTX364*

A) HTTP B) FTP
7) OSPF is used for
D) None of these
C) Session D) All
B) Acts as a relay
D) None of these
A) Device B) Error
C) Network D) Fault
______________
Set S
*SLRTX364* -3- SLR-TX –364
Seat
No.

management tools
Time : 10.00 a.m. to 12.00 noon
1) Hub
2) Switches.
in ASN.1.
1) Cryptography
____________
Set S
Set S
Seat
No. Set P
Examination, 2018
software licensing and practices
(self Learning – HSS/ Technical)
Time : 10.00 a.m. to 12.00 noon
Instruction : All questions are compulsory.
1. Attempt any five of the following : (5�6=30)

1) Write a short note on Open Source Software Licensing.
2) Compare Copyright and Contract.
3) What is Warranty ? Explain with example.
4) Explain Classic Proprietary Licence.
5) Discuss issues with respect to Patents.
6) Explain in detail about Forking.
2. Attempt any two of the following : (2�10=20)

1) Discuss Application and its Philosophy.
2) Describe issues with Copyrights.
3) Explain the choice of Open Source or Free Software Licensing.

___________________

Seat
No. Set P
T.E. (C.S.E.) (Part – II) (CGPA) Examination, 2018
Self-learning (HSS/Technical)
COMPUTER MODELING AND SIMULATION
Time : 10.00 a.m. to 12.00 noon
Instructions : 1) Q. No. 1 is compulsory. It should be solved in Answer Book

Page No. 3. Each question carries one mark.
of Page.
Marks : 10

1) The term _________ is used to describe activities and events in the
environment that affect the system.
a) endogenous b) exogenous
c) event d) simulation
2) A _________ is defined as a representation of a system for the purpose of
studying the system.
a) system b) event c) model d) activity
3) ________ is defined as an instantaneous occurrence that may change the
state of the system.
a) component b) model c) activity d) event
4) NAM is
a) Network Analyzer b) Network Animator
c) Network Analysis Machine d) None of these
5) NS has two different types of event schedulers; _______ and ________
a) real time and virtual b) real time and non real time
c) discrete and continuous d) none of these
6) TCL is
a) Tool command language b) Terminal common language
c) Terminal command language d) Text command language
P.T.O.
SLR-TX – 366 -2- *SLRTX366*
7) Simulation can be used to

a) verify analytic solutions
b) determine the requirements
c) reinforce analytic solution methodologies
d) all of the above
8) Static simulations can be also called as
a) Monte Carlo simulation b) Stephan Carlo simulation
c) Newton Raphson d) None of these
9) __________ is a subprogram that updates system state when a particular
type of event occurs.
a) Simulation clock b) Statistical routine
c) Timing routine d) Event routine
10) To simulate is to try to _________ the features, appearance and characteristics
of a real system.
a) Develop b) Duplicate c) Analyze d) Multiply
______________
Set P
*SLRTX366* -3- SLR-TX – 366
Seat
No.


Time : 10.00 a.m. to 12.00 noon
2. Attempt any four (each 10 marks) : (4×10=40)

1) Describe when simulation is appropriate tool and when it is not.
2) Explain different types of simulation model.
3) What is OTcl ? Explain features of OTcl with sample script.
4) Describe event scheduler in detail. Explain different types of event
schedulers.
5) Explain ns packet format with neat diagram.
6) Explain features and applications of TCL.
_____________________
Set P
Set P

Seat
No. Set Q
Time : 10.00 a.m. to 12.00 noon

of Page.
Marks : 10

of a real system.
d) all of the above
P.T.O.
SLR-TX – 366 -2- *SLRTX366*

8) NAM is
10) TCL is
______________
Set Q
*SLRTX366* -3- SLR-TX – 366
Seat
No.


Time : 10.00 a.m. to 12.00 noon

schedulers.
_____________________
Set Q
Set Q

Seat
No. Set R
Time : 10.00 a.m. to 12.00 noon

of Page.
Marks : 10

2) TCL is
of a real system.
6) NAM is
P.T.O.
SLR-TX – 366 -2- *SLRTX366*

d) all of the above
______________
Set R
*SLRTX366* -3- SLR-TX – 366
Seat
No.


Time : 10.00 a.m. to 12.00 noon

schedulers.
_____________________
Set R
Set R

Seat
No. Set S
Time : 10.00 a.m. to 12.00 noon

of Page.
Marks : 10

2) NAM is
4) TCL is
d) all of the above
P.T.O.
SLR-TX – 366 -2- *SLRTX366*

of a real system.
______________
Set S
*SLRTX366* -3- SLR-TX – 366
Seat
No.


Time : 10.00 a.m. to 12.00 noon

schedulers.
_____________________
Set S
Set S
Seat
No.
Set P
T.E. (CSE) (Part – II) Examination, 2018
artificial intelligence (Old)
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


1) Al research is that ___________ requires knowledge.
a) intelligence b) solution c) facts d) inference
2) Which search method takes less memory ?
a) Breadth-First search b) Depth-First search
c) Optimal search d) Linear search
3) Which is not a property of representation of knowledge ?
a) Inferential Adequacy b) Representational Adequacy
c) Representational Verification d) Inferential Efficiency
4) What is state space ?
a) The whole problem
b) Your definition to a problem
c) Problem you design
d) Representing your problem with variable and parameter
5) The first requirement of a good control strategy is that it causes
a) motion b) acceleration c) efficient d) performance
6) A _____________ is a special kind of local maximum.
a) plateau b) ridge
c) heuristic function d) all
7) An __________ attributes are used in predicate logic.
a) Facts and isa b) Object and is
c) Instance and Isa d) None of these
P.T.O.
SLR-TX – 367 -2- *SLRTX367*
8) A difference table is used in _______ algorithm.
a) generate and test b) constraint satisfaction
c) problem reduction d) mean-end analysis
9) The _____________ at which representation of objects at the knowledge level
are defined in terms of symbols that can be manipulated by programs.
a) Symbol level b) Representation level
c) Data level d) Knowledge level
10) The Generate-Test algorithm is a ___________ search procedure is
generate distance complete solutions must be generated before they can
be tested.
a) Generate and Test b) Depth-first
c) Breadth-first search d) All
11) AND-OR graphs are the part of the ________.
a) Production rules b) Problem characteristics
c) Problem reduction d) None of above
12) Constraint satisfaction is a search procedure that operate in a space of
________ sets.
a) conditional b) inverse c) reverse d) constraint
13) Solving a Cryptarithmetic problem is a ___________ example.
a) Constraint satisfaction b) Depth-first search
c) Best first search d) All
14) The ______________ process centers around the detection of differences
between current state and goal state.
a) mean analysis b) means-ends analysis
c) median-ends analysis d) both a and b
15) Truths in some relevant world is called as
a) relations b) mappings c) facts d) data store
16) Expert system use _____________ representation for knowledge.
a) architectural b) structural c) formal d) symbolic
17) The development of MYCIN began at ______________ university.
a) Stanford b) Haward c) Cambridge d) Boston
18) CASNET is based on
a) Decision trees b) Associative network
c) Neural network d) Blackboard architecture
19) ______________ networks in which we preserve the formalism and rely
instead on the modularity of the world we are trying to model.
a) CASNET b) Structural c) Bayesian d) None of these
20) _____________ is computerized advice-giver, that is capable of reasoning
but which is usually confined to a rather narrow field of knowledge.
a) Communication system b) Knowledge system
c) Common system d) Expert system
_________________ Set P
*SLRTX367* -3- SLR-TX – 367
Seat
No.


Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

a) Define AI and explain AI any one technique in detail.
b) Differentiate between best first search and depth first search algorithms.
c) Explain Means- Ends analysis algorithm.
d) Explain constraint satisfaction algorithm by using suitable example.
e) What are the different issues in knowledge representation ?
f) Describe the frame problem in detail.
3. Explain production system characteristics and also describe issues in the design
of search programs. 10
OR
Explain following algorithms in detail. 10

a) Generate and test algorithm.
b) Hill climbing algorithm.
4. Write note on (any two) : (2×5=10)
a) The level of the model.
b) Problem characteristics.
c) Representation and mappings.
Set P
SLR-TX – 367 -4- *SLRTX367*
SECTION – II
a) Explain resolution in knowledge representation techniques.
b) Explain Bayesian Networks with an example.
c) What is resolution in knowledge representation techniques ?
d) Explain non monotonic reasoning.
e) Explain conceptual dependency used in slot and filter structure.
f) What are the different characteristic features of expert system ?
6. Explain Bayesian Networks and Demster Shafer Theory in detail. 10

OR
6. Explain Semantic Nets and Frames in used in slot and filter structure. 10
7. What is an expert system ? Also explain importance and all applications of

expert system. 10
_____________________
Set P
Seat
No.
Set Q
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


P.T.O.
SLR-TX – 367 -2- *SLRTX367*
a) plateau b) ridge
be tested.
________ sets.
_________________ Set Q
*SLRTX367* -3- SLR-TX – 367
Seat
No.


Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

OR

Set Q
SLR-TX – 367 -4- *SLRTX367*
SECTION – II

OR

expert system. 10
_____________________
Set Q
Seat
No.
Set R
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


________ sets.
P.T.O.
SLR-TX – 367 -2- *SLRTX367*
a) plateau b) ridge
be tested.
c) Breadth-first search d) All Set R
_________________
*SLRTX367* -3- SLR-TX – 367
Seat
No.


Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

OR

Set R
SLR-TX – 367 -4- *SLRTX367*
SECTION – II

OR

expert system. 10
_____________________
Set R
Seat
No.
Set S
Time : 10.00 a.m. to 1.00 p.m.
carries one mark.
of Page.


a) plateau b) ridge
be tested.
________ sets.
P.T.O.
SLR-TX – 367 -2- *SLRTX367*
_________________
Set S
*SLRTX367* -3- SLR-TX – 367
Seat
No.


Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

OR

Set S
SLR-TX – 367 -4- *SLRTX367*
SECTION – II

OR

expert system. 10
_____________________
Set S
Seat
No.

Set P
B.E. (Computer Science and Engineering) (Part – I)
(CGPA) Examination, 2018
Advanced Computer Architecture
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) __________ parallelism which arises from the logic of a problem solution.
a) Functional parallelism b) Data parallelism
c) Regular d) Coarse grained
2) Output dependence and ____________ are called as name
dependences.
a) True data dependence b) Anti dependence
c) Control dependence d) Structural dependence
3) Success rate of 1-bit branch prediction is __________
a) 70% b) 100% c) 90% d) 80%
4) In dynamic scheduling instructions are scheduled by __________
a) Hardware b) Software
c) Both hardware and software d) None of these
5) Pipelining and __________ are used as basic parallel techniques.
a) Replication b) Data parallelism
c) Function parallelism d) Process level parallelism
P.T.O.
SLR-TX – 368 -2- *SLRTX368*
6) Which of the following factor influence vector execution time ?

a) Length of operand vector b) Structural hazards
c) Data dependencies d) All of the options
7) Basic vector architecture have __________ vector registers.
a) 16 b) 32 c) 64 d) 8
8) One to one mapping is known as __________
a) Complete fine granularity b) Coarse granularity
c) Partial fine granularity d) None of above
9) __________ is an example for COMA machines.
a) KSR-1 b) DDM
10) In MPP there is square array of ____________ active processing
elements.
a) 64 * 64 b) 256 * 256 c) 16 * 16 d) 128 * 128
11) __________ is a special purpose memory for data format conversion.
a) Associative memory b) Systolic memory
c) Flash memory d) Staging memory
12) Performance of CM5 machine for matrix multiply is _________ MFLOPS.
a) 128 b) 64 c) 100 d) 164
13) __________ is a solution for Remote load as well as synchronization
problems.
a) Use of cache memory
b) Pre fetching
c) Threads and fast context switching
d) None of above
14) Pyramid is combination of ___________
a) NN and hypercube b) NN and Mesh
c) NN, Mesh and tree d) NN and tree
_____________________
Set P
*SLRTX368* -3- SLR-TX – 368
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Answer any three questions : (3×4=12)

1) Explain concept of concurrent and parallel execution with suitable
diagram.
2) Explain vector length and vector stride.
3) What is hazard ? Explain different types of hazards.
4) Write a vector program to implement operation DAXPY.
3. Answer any two questions : (2×8=16)

1) Explain 1-bit and 2-bit prediction schemes with suitable diagram.
2) Explain score boarding with suitable diagram.
3) Explain basic vector architecture with suitable diagram.
SECTION – II

1) List and explain alternative architectural classes.
2) List and explain problems of scalable computers with suitable example.
3) List and explain main design issues of scalable MIMD computers.
4) Explain static data flow machine with suitable diagram.
Set P
SLR-TX – 368 -4- *SLRTX368*
5. List and explain aspects of CM5 system design. (1×8=8)

OR
5. Explain MPP processing element IC with suitable diagram. (1×8=8)
6. List and explain operators used for construction of data flow graphs and draw
data flow graph for following FORTRAN program. (1×8=8)
P=X+Y
Q = P/Y
R=X*P
S=R–Q
T=R*P
U = S/T
_____________________
Set P
Seat
No.

Set Q
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) KSR-1 b) DDM
elements.
a) 64 * 64 b) 256 * 256 c) 16 * 16 d) 128 * 128
a) 128 b) 64 c) 100 d) 164
P.T.O.
SLR-TX – 368 -2- *SLRTX368*

problems.
b) Pre fetching
d) None of above
dependences.
a) 70% b) 100% c) 90% d) 80%
a) 16 b) 32 c) 64 d) 8
_____________________
Set Q
*SLRTX368* -3- SLR-TX – 368
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

diagram.

SECTION – II

Set Q
SLR-TX – 368 -4- *SLRTX368*

OR
P=X+Y
Q = P/Y
R=X*P
S=R–Q
T=R*P
U = S/T
_____________________
Set Q
Seat
No.

Set R
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) 16 b) 32 c) 64 d) 8
a) KSR-1 b) DDM
P.T.O.
SLR-TX – 368 -2- *SLRTX368*

elements.
a) 64 * 64 b) 256 * 256 c) 16 * 16 d) 128 * 128
a) 128 b) 64 c) 100 d) 164
problems.
b) Pre fetching
d) None of above
dependences.
a) 70% b) 100% c) 90% d) 80%
_____________________
Set R
*SLRTX368* -3- SLR-TX – 368
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

diagram.

SECTION – II

Set R
SLR-TX – 368 -4- *SLRTX368*

OR
P=X+Y
Q = P/Y
R=X*P
S=R–Q
T=R*P
U = S/T
_____________________
Set R
Seat
No.

Set S
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

elements.
a) 64 * 64 b) 256 * 256 c) 16 * 16 d) 128 * 128
a) 128 b) 64 c) 100 d) 164
problems.
b) Pre fetching
d) None of above
P.T.O.
SLR-TX – 368 -2- *SLRTX368*

dependences.
a) 70% b) 100% c) 90% d) 80%
a) 16 b) 32 c) 64 d) 8
a) KSR-1 b) DDM
_____________________
Set S
*SLRTX368* -3- SLR-TX – 368
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

diagram.

SECTION – II

Set S
SLR-TX – 368 -4- *SLRTX368*

OR
P=X+Y
Q = P/Y
R=X*P
S=R–Q
T=R*P
U = S/T
_____________________
Set S
Seat
No.
Set P
B.E. (CSE) (Part – I) (CGPA) Examination, 2018
DISTRIBUTED SYSTEMS
Day and Date : Saturday, 1-12-2018 Total Marks : 70

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) A __________ system consists of concurrent processors accessing
distributed resources.
a) Distributed b) Concurrent
c) Isolated d) None of these
2) Following is one of the feature of message passing systems.
a) Maintainability b) Correctness
c) Economy d) None of these
3) Whose state consists of the execution status and scheduling information
of the process ?
a) Thread’s b) Node’s c) Process’s d) All
4) ____________ is the relocation of a process from its source node to
destination node.
a) Process Allocation b) Process Elimination
c) Process termination d) Process Migration
5) ___________ requires each node to read the other node’s clock value.
a) Clock synchronization b) Process synchronization
c) Event synchronization d) All
P.T.O.
SLR-TX – 369 -2- *SLRTX369*
6) Threads are a popular way to improve application performance through
parallelism.
a) False b) True
7) For proper synchronization in distributed systems
a) Prevention from the deadlock is must
b) Prevention from the starvation is must
c) Prevention from the deadlock and starvation is must
8) The concept of _________ forms the basis for under unifying different
non-token based mutual exclusion algorithm.
a) Optimization b) Concurrency
c) Authorization d) Information scheme
9) In Maekawa’s algorithm, a site can grant permission to _________ site at
a time.
a) Many site b) Requesting site
c) Current site d) Only one
10) A ____________ is a collection of name which may or may not share an
identical resolution mechanism.
a) Naming b) Name resolution
c) Name space d) Name server
11) In ____________ sharing a file is open at multiple clients and at least
one client has it open for writing.
a) Sequential write b) Client-initiated
c) Server-initiated d) Concurrent-write
12) IVY means
a) Integrated virtual memory at DSM
b) International shared virtual memory at Yale
c) Integrated shared virtual memory at Yale
13) Grid basically perform function of ________
a) Computer b) Unused CPU
c) Resource discovery d) Resource
14) In grid computing, a _________ determine where the job should be
scheduled to run.
a) Scheduler b) CPU c) Co-ordinator d) User

_____________
Set P
*SLRTX369* -3- SLR-TX – 369
Seat
No.
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

a) Explain evolution of distributed computing system.
b) Explain the message passing system in distributed system.
c) Describe process synchronization in distributed system.
d) Explain Mutual Exclusion in distributed system.
e) Describe Failure Handling in distributed system.

a) Explain all process migration mechanisms in detail.
b) Explain minicomputer model, workstation model and workstation server
model in detail.
4. What are the different issues in interprocess communication ? 8
SECTION – II
5. Answer any three : (4�3=12)

1) Explain Suzuki-Kasami’s broadcast algorithm.
2) State and explain components of load distribution algorithm.
3) Explain any two design issues of distributed file system.
4) Explain working of grid computing.
Set P
SLR-TX – 369 -4- *SLRTX369*
6. Answer any one : (1�8=8)
1) Explain different mechanism for building distributed file system.
2) Explain sender initiated load distributing algorithm.

1) Explain Ho-Ramamoorthy centralized deadlock detection algorithm.
2) What is grid ? Explain different types of grid.
_____________
Set P
Seat
No.
Set Q
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a time.
P.T.O.
SLR-TX – 369 -2- *SLRTX369*
5) IVY means
scheduled to run.
of the process ?
destination node.
parallelism.
a) False b) True

_____________

Set Q
*SLRTX369* -3- SLR-TX – 369
Seat
No.
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


model in detail.
SECTION – II

Set Q
SLR-TX – 369 -4- *SLRTX369*

_____________
Set Q
Seat
No.
Set R
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

parallelism.
a) False b) True
a time.
P.T.O.
SLR-TX – 369 -2- *SLRTX369*
8) IVY means
scheduled to run.
of the process ?
destination node.

_____________

Set R
*SLRTX369* -3- SLR-TX – 369
Seat
No.
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


model in detail.
SECTION – II

Set R
SLR-TX – 369 -4- *SLRTX369*

_____________
Set R
Seat
No.
Set S
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

3) IVY means
P.T.O.
SLR-TX – 369 -2- *SLRTX369*
scheduled to run.
of the process ?
destination node.
parallelism.
a) False b) True
a time.

_____________

Set S
*SLRTX369* -3- SLR-TX – 369
Seat
No.
DISTRIBUTED SYSTEMS

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


model in detail.
SECTION – II

Set S
SLR-TX – 369 -4- *SLRTX369*

_____________
Set S
*SLTX370* SLR-TX – 370

Seat
No. Set P
Modern database system
Time : 2.30 p.m. to 5.30 p.m.
2) Assume suitable data, if necessary.
carries one mark.
of Page.


1) A heterogeneous distributed database is which of the following ?
a) The same DBMS is used at each location and data are not distributed
across all nodes
b) The same DBMS is used at each location and data are distributed across
all nodes
c) A different DBMS is used at each location and data are not distributed
across all nodes
d) A different DBMS is used at each location and data are distributed across
all nodes
2) The real use of the Two-phase commit protocol is
a) Deadlock will not occur b) Concurrency control can be avoided
c) Atomicity, i.e. all-or-nothing d) None of the above
3) What is the default HDFS block size ?
a) 32 MB b) 64 KB c) 128 KB d) 64 MB
4) Some of the columns of a relation are at different site is which of the following ?
a) Data Replication b) Horizontal Partitioning
c) Vertical Partitioning d) Horizontal and Vertical Partitioning
5) A star schema has what type of relationship between a dimension and fact
table ?
a) Many-to-many b) One-to-one
c) One-to-many d) All of the above
P.T.O.
SLR-TX – 370 -2- *SLTX370*
6) A semijoin is which of the following ?
a) Only the joining attributes are sent from one site to another and then all
of the rows are returned
b) All of the attributes are sent from one site to another and then all of the
rows are returned
c) Only the joining attributes are sent from one site to another and then
only the required rows are returned
d) All of the attributes are sent from one site to another and then only the
required rows are returned
7) Which algorithm uses equality comparison on a key attribute with a primary
index to retrieve a single record that satisfies the corresponding equality
condition ?
a) A2 b) A4 c) A5 d) A6
8) Parallel execution of multiple individual operations within a given query is
called
a) Interoperation b) Intraoperation c) Interquery d) Intraquery
9) _______NameNode is used when the Primary NameNode goes down.
a) Rack b) Data c) Secondary d) None of above
10) In a __________the system makes repeated requests for tuples from the
operation at the top of the pipeline.
a) Demand-driven pipeline b) Producer-driven pipeline
c) Demand pipeline d) All of the mentioned
11) MongoDB is
a) RDBMS b) Document-oriented DBMS
c) Objet Oriented DBMS d) Key-value store
12) Select item name, color, clothes size, sum (quantity) from sales group by
rollup (item name, color, clothes size); How many grouping is possible in
this rollup ?
a) 8 b) 4 c) 2 d) 3
13) Number of block transfers from disk and number of disk seeks are used to
estimate cost of
a) Query-execution plan b) Query-evaluation plan
c) Query-processing plan d) Query-implementing plan
14) Hadoop was first introduced by
a) Doug Laney b) Brewer
c) Carlo Strozzi d) Doug cutting
______________
Set P
*SLTX370* -3- SLR-TX – 370
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

1) Explain a typical transaction server system with diagram.
2) Explain two cases of fragment and replicate join with diagram.
3) Consider the data warehouse storing sales details of various cloths sold.
Using this example describe the following OLAP operations
1) Cube 2) Rollup
4) Explain association rules and clustering applications of Data Mining.
3. Answer any two : (2×8=16)

1) What is data warehouse ? Draw its architecture and explain the star schema
of data warehouse.
2) What do you mean by I/O parallelism ? Explain various partitioning techniques
in detail with their comparison.
3) Explain any four locking protocols used to handle concurrency control in
distributed databases.
SECTION – II

1) Give any four Equivalence rules.
2) Explain worst case and best case cost of Nested loop join for two relations
R and S w.r.t. following.
a) No. of block transfer b) Seek time
3) Give the difference between SQL and NoSQL.
4) Explain External sort-merge algorithm with example diagram.
Set P
SLR-TX – 370 -4- *SLTX370*

1) Explain following concepts with SQL query examples in Object based
Databases.
a) Structured types
b) Type inheritance
c) Table inheritance
d) Array and multiset
2) Define Query Processing. Explain different steps involved in Query
processing with diagram. What are different measures of Query cost ?
3) Explain high level architecture of Hadoop with the help of diagram. With
one example explain how Map Reduce works.
_____________________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


called
a) Interoperation b) Intraoperation
c) Interquery d) Intraquery
a) Rack b) Data
c) Secondary d) None of above
4) MongoDB is
this rollup ?
a) 8 b) 4
c) 2 d) 3
P.T.O.
SLR-TX – 370 -2- *SLTX370*
estimate cost of
a) Doug Laney b) Brewer c) Carlo Strozzi d) Doug cutting
across all nodes
all nodes
across all nodes
all nodes
a) 32 MB b) 64 KB c) 128 KB d) 64 MB
table ?
a) Many-to-many b) One-to-one c) One-to-many d) All of the above
rows are returned
condition ?
a) A2 b) A4 c) A5 d) A6
______________
Set Q
*SLTX370* -3- SLR-TX – 370
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

1) Cube 2) Rollup

of data warehouse.
SECTION – II

Set Q
SLR-TX – 370 -4- *SLTX370*

Databases.
a) Structured types
b) Type inheritance
_____________________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


table ?
rows are returned
condition ?
a) A2 b) A4 c) A5 d) A6
called
P.T.O.
SLR-TX – 370 -2- *SLTX370*
7) MongoDB is
this rollup ?
a) 8 b) 4 c) 2 d) 3
estimate cost of
across all nodes
all nodes
across all nodes
all nodes
a) 32 MB b) 64 KB c) 128 KB d) 64 MB
______________
Set R
*SLTX370* -3- SLR-TX – 370
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

1) Cube 2) Rollup

of data warehouse.
SECTION – II

Set R
SLR-TX – 370 -4- *SLTX370*

Databases.
a) Structured types
b) Type inheritance
_____________________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


2) MongoDB is
this rollup ?
a) 8 b) 4
c) 2 d) 3
estimate cost of
P.T.O.
SLR-TX – 370 -2- *SLTX370*
across all nodes
all nodes
across all nodes
all nodes
a) 32 MB b) 64 KB c) 128 KB d) 64 MB
table ?
rows are returned
condition ?
a) A2 b) A4 c) A5 d) A6
called
______________
Set S
*SLTX370* -3- SLR-TX – 370
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

1) Cube 2) Rollup

of data warehouse.
SECTION – II

Set S
SLR-TX – 370 -4- *SLTX370*

Databases.
a) Structured types
b) Type inheritance
_____________________
Set S

Seat
No.
Set P
B.E. (Computer Science and Engineering) (Part – I) (CGPA) Examination, 2018
Elective – I : HUMAN COMPUTER INTERACTION
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


1) ___________ reasoning derives the logically necessary conclusion from
the given premises.
A) Deductive B) Inductive C) Abductive D) None of these
2) ___________ controls and displays are organized to reflect the order of
their use in a typical interaction.
A) Functional B) Sequential C) Frequency D) None of these
3) The multiplicity of ways in which the user and system exchange information is
A) Learnability B) Flexibility C) Robustness D) None of these
4) QOC is
A) Query-Objective-Control B) Question-Option-Criterion
C) Question-Objective-Consistent D) None of these
5) ___________ focuses on the user’s ability to determine the effect of future
interactions.
A) Predictability B) Synthesizability
C) Familiarity D) Generalizability
6) ___________ can be used as a means of describing the user’s day-to-day
activities.
A) Storyboarding B) Workshops
C) Brainstorming D) Pencil and paper exercises
P.T.O.
SLR-TX – 371 -2- *SLRTX371*
7) Which utterance points of clarification and elaborations ?
A) Substantive B) Annotative
C) Procedural D) None of these
8) Capturing common understanding is
A) Computer-mediated Communication
B) Meeting and Decision Support System
C) Shared Applications and Artifacts
D) None of these
9) Some hypertexts are downloaded or installed permanently on a computer is
A) On the computer delivery technique
B) On the web delivery technique
C) On the move delivery technique
D) None of these
10) __________authoring tools are becoming prevalent with the success of
Flash.
A) Map B) Audio
C) Video D) Animation
11) Social form of filtering allows groups of users to combine their evaluations
to help one another to find interesting items in large collections
A) Multilingual Searchers B) Faceted Metadata
C) Collaborative filtering D) None of these
12) Simple scripting language and easy to produce graphical interfaces - by
using
A) Help and Documentation
B) Rapid Prototyping
C) Education and E-learning
D) Collaboration and Community
13) Users can allow retrieving of sub-collections and of the query parameters
is known as
A) Details-on-Demand task B) Relate Task
C) History Task D) Extract Task
14) ____________ allow documents to be linked in a non-linear fashion.
A) Hypertext B) Video
C) Animation D) Text
________________
Set P
*SLRTX371* -3- SLR-TX – 371
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Answer any four of the following : (4×4=16)

a) Explain the problem-solving process of finding a solution.
b) Explain any devices for virtual reality and 3D interaction.
c) Explain Local and global structure of navigation design.
d) Explain evaluation through monitoring physiological responses.
e) Explain GOMS.
f) What you mean by direct manipulation ? Explain.
3. Answer any two of the following : (6×2=12)

a) Define and explain the Ergonomics of Interaction.
b) Explain the OSTA Methodology.
c) Explain the organizational issues that affect the acceptance and relevance
of information and communication systems.
SECTION – II

a) Explain the importance of quality of service.
b) Write a note on groupware systems.
c) Explain multimedia document searches in information search.
d) Write a note on Ubiquitous Computing.
e) Define Hypertext. And explain the relationship between hypertext, multimedia
and www.
f) Explain static and dynamic web content.
Set P
SLR-TX – 371 -4- *SLRTX371*

a) Explain OAI Model for website design.
b) Write a note on Virtual Reality and Augmented Reality devices and
applications.
c) Explain the issues of web technology.
_____________________
Set P

Seat
No.
Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


D) None of these
D) None of these
Flash.
A) Map B) Audio
A) Multilingual Searchers
B) Faceted Metadata
C) Collaborative filtering
D) None of these
P.T.O.
SLR-TX – 371 -2- *SLRTX371*
using
is known as
the given premises.
11) QOC is
interactions.
activities.
________________
Set Q
*SLRTX371* -3- SLR-TX – 371
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

e) Explain GOMS.

SECTION – II

and www.
Set Q
SLR-TX – 371 -4- *SLRTX371*

applications.
_____________________
Set Q

Seat
No.
Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


interactions.
A) Predictability
B) Synthesizability
C) Familiarity
D) Generalizability
activities.
A) Substantive
B) Annotative
C) Procedural
D) None of these
D) None of these
P.T.O.
SLR-TX – 371 -2- *SLRTX371*
D) None of these
Flash.
A) Map B) Audio
using
is known as
A) Hypertext B) Video C) Animation D) Text
the given premises.
14) QOC is
________________
Set R
*SLRTX371* -3- SLR-TX – 371
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

e) Explain GOMS.

SECTION – II

and www.
Set R
SLR-TX – 371 -4- *SLRTX371*

applications.
_____________________
Set R

Seat
No.
Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


Flash.
A) Map B) Audio
using
is known as
A) Details-on-Demand task
B) Relate Task
C) History Task
D) Extract Task
P.T.O.
SLR-TX – 371 -2- *SLRTX371*
the given premises.
9) QOC is
interactions.
activities.
D) None of these
D) None of these
________________
Set S
*SLRTX371* -3- SLR-TX – 371
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

e) Explain GOMS.

SECTION – II

and www.
Set S
SLR-TX – 371 -4- *SLRTX371*

applications.
_____________________
Set S
Seat
No.
Set P

B.E. (Computer Science and Engineering) (Part – I) (CGPA)
Examination, 2018
Elective – I : DIgital signal processing
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
only. Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top of
Page.
1) Discrete-time signals are __________
a) Continuous in amplitude and continuous in time
b) Continuous in amplitude and discrete in time
c) Discrete in amplitude and discrete in time
d) Discrete in amplitude and continuous in time
2) Both continuous-time and discrete-time signals are further classified as
a) Deterministic and non-deterministic signals
b) Periodic and a periodic signals
c) Even and odd signal
d) Any one of the given option
3) Laplace transform plays a very important role in
a) Analysis of analog signals
b) Analysis of systems
c) Solving linear constant coefficient differential equations
d) All of the options
4) What is the ROC of the signal x(n) = δ(n-k), k > 0 ?
a) z = 0 b) z = ∞
c) Entire z-plane, except at z = 0 d) Entire z-plane, except at z = ∞
5) What is the ROC of z-transform of finite duration anti-causal sequence ?
a) z = 0 b) z = ∞
6) The advantage of representing the digital system in block diagram form is/are
a) Just by inspection, the computation algorithm can be easily written
b) The hardware requirement can be easily determined
c) The relation between the output and the input can be determined
d) All of the options P.T.O.
SLR-TX – 372 -2- *SLRTX372*
7) What is the duration of the unit sample response of a digital filter ?
a) Finite b) Infinite c) Impulse (very small) d) Zero
8) The magnitude response of Butterworth filter has
1. Flat stop band
2. Flat pass band
3. Tapering pass band
4. Tapering stop band
a) 1 and 2 are correct b) 2 and 4 are correct
c) 2 and 3 are correct d) All the four are correct
9) For a system function H(s) to be stable
a) The zeros lie in left half of the s plane b) The zeros lie in right half of the s plane
c) The poles lie in left half of the s plane d) The poles lie in right half of the s plane
10) Which of the following is true regarding the number of computations required to
compute DFT at any one value of ‘k’ ?
a) 4N – 2 real multiplications and 4N real additions
b) 4N real multiplications and 4N – 4 real additions
c) 4N – 2 real multiplications and 4N + 2 real additions
d) 4N real multiplications and 4N – 2 real additions
11) If x(n) and X(k) are an N-point DFT pair, then X(k + N) = ?
a) X(– k) b) – X (k)
c) X(k) d) None of the mentioned
12) Which of the following is introduced in the frequency sampling realization of the
FIR filter ?
a) Poles are more in number on unit circle
b) Zeros are more in number on the unit circle
c) Poles and zeros at equally spaced points on the unit circle
13) Which of the following is the second generation processor ?
a) TMS320C1X b) TMS320C2X
c) Both option a) and b) d) None of the option
14) Both discrete-time and continues-time signals can be modeled using the
following _________ method.
a) A linear difference/differential equation
b) The impulse response sequence
c) A state variable or matrix
_____________
Set P
*SLRTX372* -3- SLR-TX – 372
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Answer any three questions : (3�4=12)

1) What are the advantages of digital signal processing over analog signal
processing ?
2) Determine the z-transform for the analog input signal x(t) = e– at applied to digital
filter.
3) Determine the parallel realization of the IIR digital filter transfer function.
H(z) = 3 (2z2 + 5z + 4)/(2z + 1) (z + 2)
4) Explain the linearity and shift of a sequence properties of the discrete Fourier series.
3. Answer any two questions : (2�8=16)

1) What are the applications of DSP ?
2) What are the important properties of the ROC for the z-transform.
3) Explain the following properties of the discrete Fourier series.
a) Duality
b) Symmetry
c) Periodic concolution.
SECTION – II

1) Explain basic system for discrete-time filtering of continuous-time signals with
block diagram.
2) Explain the flow graph of 8-point DFT using the butterfly computation.
3) With neat diagram, explain full duplex analog voice privacy system for
transmitter and receiver.
Set P
SLR-TX – 372 -4- *SLRTX372*
4) What are the salient features required for efficient performance of DSP
operation ?
5) Write a note on Bilinear transformation. 8
OR
Write note on following filters :
a) Low pass
b) High pass
c) Band pass
d) Band stop.
6) Explain the following filters :
a) Time domain filters
b) Frequency domain filters (IIR). 8
_____________
Set P
Seat Set Q
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Page.
1. Flat stop band
2. Flat pass band
a) X(– k) b) – X (k)
FIR filter ?
P.T.O.
SLR-TX – 372 -2- *SLRTX372*
a) z = 0 b) z = ∞
a) z = 0 b) z = ∞
_____________
Set Q
*SLRTX372* -3- SLR-TX – 372
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

processing ?
filter.
H(z) = 3 (2z2 + 5z + 4)/(2z + 1) (z + 2)

a) Duality
b) Symmetry
SECTION – II

block diagram.
Set Q
SLR-TX – 372 -4- *SLRTX372*
operation ?
OR
a) Low pass
b) High pass
c) Band pass
d) Band stop.
_____________
Set Q
Seat
No.
Set R

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Page.
a) z = 0 b) z = ∞
1. Flat stop band
2. Flat pass band
P.T.O.
SLR-TX – 372 -2- *SLRTX372*
a) X(– k) b) – X (k)
FIR filter ?
a) z = 0 b) z = ∞
_____________
Set R
*SLRTX372* -3- SLR-TX – 372
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

processing ?
filter.
H(z) = 3 (2z2 + 5z + 4)/(2z + 1) (z + 2)

a) Duality
b) Symmetry
SECTION – II

block diagram.
Set R
SLR-TX – 372 -4- *SLRTX372*
operation ?
OR
a) Low pass
b) High pass
c) Band pass
d) Band stop.
_____________
Set R
Seat
No.
Set S

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Page.
a) X(– k) b) – X (k)
FIR filter ?
d) Any one of the given option P.T.O.
SLR-TX – 372 -2- *SLRTX372*
a) z = 0 b) z = ∞
a) z = 0 b) z = ∞
1. Flat stop band
2. Flat pass band
_____________
Set S
*SLRTX372* -3- SLR-TX – 372
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

processing ?
filter.
H(z) = 3 (2z2 + 5z + 4)/(2z + 1) (z + 2)

a) Duality
b) Symmetry
SECTION – II

block diagram.
Set S
SLR-TX – 372 -4- *SLRTX372*
operation ?
OR
a) Low pass
b) High pass
c) Band pass
d) Band stop.
_____________
Set S
Seat
No. Set P
Software Testing and Quality Assurance (Elective – I)
Day and Date : Thursday, 6-12-20182018 Total Marks : 70
Time : 2.30 p.m. to 5.30 p.m.00 .

one mark.
5) Figures must be drawn wherever necessary.

1) This approach involves testing software system after development work is completed.
a) Total Quality Management b) Big Bang
c) Destruction d) Demonstration
2) To check whether a right process is followed or not during development life cycle is termed
as
a) Validation b) Verification
c) Quality Assurance d) Quality Control
3) ____________ testing is done on the basis of internal structures of software as defined
by requirements, designs, coding standards and guidelines as well as the functional and
non-functional requirement specifications.
a) White box b) Black box
c) Gray box d) None of the above
4) The simplest form of path testing is called
a) Line Coverage Testing b) Equivalence Partitioning
c) Branch Coverage Testing d) None
5) In ___________ testing, the software tester has access to the program’s code and can
examine it for clues to help him with his testing.
a) White Box b) Black Box
c) Beta d) Gamma
P.T.O.
SLR-TX – 373 -2- *SLRTX373*
6) ____________ is performed without any formal test plan, test strategies, test scenario,
test data or test cases.
a) Adhoc Testing b) Sanity Testing
c) Execution Testing d) All
7) This testing talks about the system resources required by the transactions that have been
planned to be undertaken.
a) Sanity Testing b) Stress Testing
c) Usability Testing d) Compatibility Testing
8) Bug can be described as
a) Minimal b) Singular c) Reproducible d) All
9) Test Planning is a job that should involve _________ from across the entire product team.
a) Testers b) Developers
c) Key players only d) all
10) Cost of quality depends on
a) Prevention b) Appraisals c) Failure d) All
11) This is a software quality assurance activity that focuses on the identification and
assessment of potential hazards that may affect software negatively and causes an entire
system to fail
a) Software Reliability b) Software Availability
c) Software Safety d) All
12) Quality views are
a) Transcendental b) Users c) Manufacturer d) All
13) __________ are tools used to control and operate the software being tested.
a) Viewers and Monitors b) Drivers
c) Stubs d) Stress and Load Tools
14) _____________ doesn’t know anything about the software being tested. It just clicks or
types randomly.
a) Smart monkey b) Dumb monkey
c) Semi-Smart monkey d) All

___________

Set P
*SLRTX373* -3- SLR-TX – 373
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.00 .

SECTION – I
2. Answer the following questions (any three) : (3×4=12)
A) What are the important features of testing process ?
B) What are the different skills required by tester ?
C) Write note on Testing Vs Debugging.
D) Explain Smoke Testing and Sanity testing.
E) What is proposal testing and requirement testing ?
3. Answer any two questions. (2×8=16)
A) Explain Defect Life Cycle.
B) Explain V and V model.
C) Explain Graphical user Interface testing with different advantages and disadvantages.
SECTION – II
A) Explain the McCall’s Quality Factors.
B) Explain in brief severity and priority of bugs.
C) Explain Elements of Software Quality Assurance.
D) Write note on Six Sigma Standard.
E) Explain Viewers and Monitors test tool in detail.
A) Explain Test Design, Test Cases and Test Procedure.
B) Explain ISO 9000 and CMM Quality Standard.
C) Explain in detail the Selenium testing tool.
___________
Set P
Set P
Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.00 .

one mark.

system to fail
P.T.O.
SLR-TX – 373 -2- *SLRTX373*
types randomly.

as
c) Beta d) Gamma

___________

Set Q
*SLRTX373* -3- SLR-TX – 373
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.00 .

SECTION – I
SECTION – II
___________

Set Q
Set Q
Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.00 .

one mark.

c) Beta d) Gamma
P.T.O.
SLR-TX – 373 -2- *SLRTX373*
system to fail
types randomly.

as

___________

Set R
*SLRTX373* -3- SLR-TX – 373
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.00 .

SECTION – I
SECTION – II
___________

Set R
Set R
Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.00 .

one mark.

system to fail
types randomly.

P.T.O.
SLR-TX – 373 -2- *SLRTX373*
as
c) Beta d) Gamma

___________

Set S
*SLRTX373* -3- SLR-TX – 373
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.00 .

SECTION – I
SECTION – II
___________

Set S
Set S

Seat
No. Set P
Examination, 2018
Elective – i : business intelligence
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


1) ________ is a broad category of applications and technologies for gathering,
storing, analyzing and providing access to data to help enterprise users
make better business decisions.
a) Data mart b) Business information warehouse
c) Business intelligence d) Business warehouse
2) Data Warehouse bus matrix is a combination of
a) Dimensions and detailed facts b) Dimensions and data marts
c) Facts and data marts d) Only dimensions
3) ________ modeling is suitable for Analysis and not for Modification.
a) Relational b) Object-oriented
c) Dimensional d) Both relational and Dimensional
4) _________cardinality exists between dimension tables to fact table.
a) one-to-many b) many-to-one
c) many-to-many d) none of the above
P.T.O.
SLR-TX – 374 -2- *SLRTX374*
5) Multiple dimension tables and multiple fact tables are present in

a) star-schema b) snowflake schema
c) galaxy schema d) none of the above
6) Keys that do not have in-built meaning and are independent of operational
system keys are called
a) Primary key b) Surrogate key
c) Foreign keys d) None of the above
7) Which of the following is/are category of Fact attributes ?
a) Additive Measures b) Semi-additive
c) Non-additive d) All the above
8) ________ is a systematic examination of the quality, scope and context of
data sources.
a) ETL b) Data cleansing
c) Data Profiling d) None of the above
9) A __________ is used to define roles for different users to enforce security
in ETL.
a) Web Server b) Domain Name Server
c) LDAP Server d) OLAP Server
10) Clever processing algorithms, parallel processing and patent hardware are
required to
a) reduce storage b) reduce data latency
c) clean the data d) none of the above
11) In pyramid data model, base of the pyramid represents
a) Data marts b) Enterprise data warehouse
c) OLPT data sources d) None of the above
12) Drill across reports can be generated using conforming dimensions.
a) True b) False
13) Compliance includes
a) Proof of the complete transaction flow that changed any data results
b) Fully documented algorithms for allocations, adjustments and derivations
c) Neither a) nor b)
d) Both a) and b)
14) Data Integration is a _______ view of the customer.
a) 90 degree b) 180 degree c) 360 degree d) None
______________
Set P
*SLRTX374* -3- SLR-TX – 374
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
a) What is Business Intelligence ? List the functions of Business intelligence.
b) List the differences between Star schema and Snowflake schema.
c) Draw information package diagram for automaker sales analysis.
d) Illustrate four steps of dimensional modeling with example.
3. Answer any one : (1×8=8)

a) Draw Technical architecture of Business intelligence system and explain
the functions of Front room and Back room components.
b) What is role-based security approach ? List the provisions used in security

policy of data warehouse.
4. Write down the characteristics of fact table attributes and dimension table
attributes. 8
Set P
SLR-TX – 374 -4- *SLRTX374*
SECTION – II
a) Explain the concept of data quality via data profiling.
b) What is data Integration ? Explain.
c) List different types of Business Intelligence Applications and state their
functions.
d) Why Business Intelligence Applications are important ?

a) Mention the user delivery Interfaces and Legacy licenses requirements in
ETL.
b) What are the Business requirements and Archiving and lineage requirements
in ETL ?
7. Explain the subsystems of Managing the ETL Environment. 8
____________
Set P

Seat
No. Set Q
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


data sources.
in ETL.
required to
P.T.O.
SLR-TX – 374 -2- *SLRTX374*

a) True b) False
d) Both a) and b)
______________
Set Q
*SLRTX374* -3- SLR-TX – 374
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


attributes. 8
Set Q
SLR-TX – 374 -4- *SLRTX374*
SECTION – II

functions.

ETL.
in ETL ?
____________
Set Q

Seat
No. Set R
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


data sources.
P.T.O.
SLR-TX – 374 -2- *SLRTX374*

in ETL.
required to
a) True b) False
d) Both a) and b)
______________
Set R
*SLRTX374* -3- SLR-TX – 374
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


attributes. 8
Set R
SLR-TX – 374 -4- *SLRTX374*
SECTION – II
functions.

ETL.
in ETL ?
____________
Set R

Seat
No. Set S
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


required to
a) True b) False
d) Both a) and b)
P.T.O.
SLR-TX – 374 -2- *SLRTX374*

data sources.
in ETL.
______________
Set S
*SLRTX374* -3- SLR-TX – 374
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


attributes. 8
Set S
SLR-TX – 374 -4- *SLRTX374*
SECTION – II
functions.

ETL.
in ETL ?
____________
Set S
Seat
No.

Set P
Object Oriented Modeling and Design (Elective – II)
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) Which of the following is not a part of DFD ?
a) process b) data flow
c) event d) actor
2) Object’s interact with each other with the help of ___________
a) messages b) role
c) port d) protocol
3) Class model gives __________ structure of project.
a) static b) dynamic
c) static and dynamic d) none of these
4) Which of the following is correct representation ?
a) “stereotype name” b) <stereotype name>
c) <<stereotype name>> d) $stereotype name$
5) __________ is data value held by object in class.
a) Object instance b) Attribute
c) Event d) State
P.T.O.
SLR-TX – 375 -2- *SLRTX375*
6) State diagram is a graph whose nodes are __________

a) states b) operations
c) objects d) events
7) Links are implemented as __________ in programming.
a) functions b) data types
c) structures d) pointer
8) Interaction model describes interaction between __________
a) objects b) classes
c) operations d) methods
9) _________ model provides graphic representation of system.
a) Class b) Object
c) State d) Dynamic
10) OO Development is way of __________
a) thinking b) programming
c) designing d) testing
11) A qualified association relates two __________
a) object, classes and qualifier b) a role and qualifier
c) roll names d) object classes
12) An activity is associated with ___________
a) event b) state
c) condition d) transaction
13) I) A state has duration.
II) An event has no duration.
a) only II is true b) only I is true
c) both I and II are true d) both I and II are false
14) Notation used from analysis to implementation are ___________
a) same b) different
c) depends on designer d) depends on depth
_____________________
Set P
*SLRTX375* -3- SLR-TX – 375
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Explain advanced dynamic modelling concepts. 8
3. Draw and explain state diagram for phone call system. 8

OR
What is link ? How it differ from association ?
4. Write notes on (any three) : (4×3=12)

a) DFD
b) Generalization and inheritance
c) Class diagram
d) OMT methodology.
SECTION – II
5. Explain collaboration diagram in detail. 8
6. Explain activity diagram with example. 8

OR
What is meant by component ? Explain its use in OOD.

a) Use case diagram
b) Process and thread
c) Pattern categories
d) Interaction diagram.
_____________________
Set P
SLR-TX – 375 -4- *SLRTX375*
Set P
Seat
No.

Set Q
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) Class b) Object
c) State d) Dynamic
a) event b) state
P.T.O.
SLR-TX – 375 -2- *SLRTX375*

c) event d) actor
a) messages b) role
c) port d) protocol
c) Event d) State
_____________________
Set Q
*SLRTX375* -3- SLR-TX – 375
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

OR

a) DFD
c) Class diagram
d) OMT methodology.
SECTION – II

OR

a) Use case diagram
_____________________
Set Q
SLR-TX – 375 -4- *SLRTX375*
Set Q
Seat
No.

Set R
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

c) Event d) State
a) Class b) Object
c) State d) Dynamic
P.T.O.
SLR-TX – 375 -2- *SLRTX375*

a) event b) state
c) event d) actor
a) messages b) role
c) port d) protocol
_____________________
Set R
*SLRTX375* -3- SLR-TX – 375
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

OR

a) DFD
c) Class diagram
d) OMT methodology.
SECTION – II

OR

a) Use case diagram
_____________________
Set R
SLR-TX – 375 -4- *SLRTX375*
Set R
Seat
No.

Set S
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

a) event b) state
P.T.O.
SLR-TX – 375 -2- *SLRTX375*

c) event d) actor
a) messages b) role
c) port d) protocol
c) Event d) State
a) Class b) Object
c) State d) Dynamic
_____________________
Set S
*SLRTX375* -3- SLR-TX – 375
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

OR

a) DFD
c) Class diagram
d) OMT methodology.
SECTION – II

OR

a) Use case diagram
_____________________
Set S
SLR-TX – 375 -4- *SLRTX375*
Set S
Seat
Set P
No.
Wireless Adhoc Network (Elective II)
Day and Date : Saturday, 8-12-2018 , -2018 Max. Marks : 70

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.
1. Choose correct answer : 14

1) The L2CAP protocol header contains
a) Logical Channels identification bits
b) RFCOMM
c) Active bits
d) Control bits
2) ACL is ___________ Unlicensed National Information Infrastructure.
a) Asynchronous contact less b) Asynchronous connection link
c) Asynchronous connection less d) None of these
3) UNII stands for
a) Understanding National Information Infrastructure
b) Undestined Node In Infrastructure
c) Unlicensed Node Information Infrastructure
d) Unlicensed National Information Infrastructure
4) Which of the following is energy saving routing strategy ?
a) Nearest-Neighbor b) Random finding
c) Both d) None
P.T.O.
SLR-TX – 376 -2- *SLRTX376*
5) RF-Layer of Bluetooth is built on a synchronous fast-frequency hopping
paradigm with a symbol rate of 1 Mbps operating in a publically available
___________ ISM band.
a) 2.4 GHz b) 2.4 THz c) 1.5 GHz d) 1.5 THz
6) __________ bit node addressing inside Piconets.
a) 6 b) 5 c) 2 d) 3
7) ___________ is generally refer to any reduction in the strength of a signal.
a) Attenuation b) AWGN c) Fading d) None
8) In ________ model, error free transmission is provided if the distance is
suitably lower than the distance from the destination node to any other node
in network.
a) Physical b) Protocol c) RBS d) None
9) In __________, tentative multi-hop route from source to destination is
created.
a) RBS b) DP c) ONRBS d) None
10) The mobility status of a node can be described in terms of its
a) Mobility direction b) Speed
c) Range d) None
11) The regulatory body in charge of the national radio frequency resources is the
a) Frequency Committee of Communication
b) Federal Communications Commission
c) Federal Committee of Communication
d) Frequency Communication Commission
12) Distance between two neighboring nodes of regular grid topology is
a) spatial density b) dlink c) theta d) none of these
13) SDP stands for
a) Service Datagram Protocol b) Standard Discovery Protocol
c) Standard Datagram Protocol d) Service Discovery Protocol
14) Link communication model in Adhoc Wireless scenario without INI is defined
as
a) r(t) = f(t) + s(a) + wthermal + wint(t) b) r(t) = f(t) s(a) + wthermal
c) r(t) = f(t) s(a) + wthermal + wint(t) d) r(t) = f(t) + s(a) + wthermal
____________
Set P

*SLRTX376* -3- SLR-TX – 376
Seat
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.
SECTION – I
2. Attempt any three questions : 12
1) What is Fading ? Explain its types with neat diagram.
2) Define Quasi-Regular Topology with neat diagram.
3) Explain Reactive and Proactive protocol in detail.
4) Write a short note on MAC protocols.
3. Attempt any two questions: 16
1) Explain in detail definitions of Quasi Regular topology with neat diagram.
2) Draw and explain Link communication model in Adhoc wireless scenario
with INI and without INI. Also derive an expression for them.
3) Explain with neat diagram Bluetooth Technological Design.
SECTION – II
1) Write a short note on Two-Dimensional Poisson Topology.
2) Derive the equation for average sustainable number of hops for Transport
Capacity.
3) List out five assumptions of Transport Capacity in Adhoc Wireless Network.
4) Explain ONRBS and RBS switching model in details.
5. Attempt any two questions : 16
1) What are the switching schemes in Route Reservation ? Explain any one
of them in details.
2) Explain performance matrix in Transmission power for Adhoc wireless
network.
3) Explain Aggregate Effective transport capacity with ideal and realistic
scenario.
___________________ Set P
Set P
Seat
Set Q
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

in network.
created.
c) Range d) None
P.T.O.
SLR-TX – 376 -2- *SLRTX376*
6) SDP stands for
as
b) RFCOMM
c) Active bits
d) Control bits
10) UNII stands for
c) Both d) None
___________ ISM band.
a) 6 b) 5 c) 2 d) 3
____________
Set Q

*SLRTX376* -3- SLR-TX – 376
Seat
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.
SECTION – I
SECTION – II
Capacity.
of them in details.
network.
scenario.
___________________ Set Q
Set Q
Seat
Set R
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

___________ ISM band.
a) 6 b) 5 c) 2 d) 3
in network.
created.
P.T.O.
SLR-TX – 376 -2- *SLRTX376*
c) Range d) None
9) SDP stands for
as
b) RFCOMM
c) Active bits
d) Control bits
13) UNII stands for
c) Both d) None
____________ Set R

*SLRTX376* -3- SLR-TX – 376
Seat
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.
SECTION – I
SECTION – II
Capacity.
of them in details.
network.
scenario.
___________________ Set R
Set R
Seat
Set S
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.

carries one mark.
Top of Page.

c) Range d) None
4) SDP stands for
P.T.O.
SLR-TX – 376 -2- *SLRTX376*
as

b) RFCOMM
c) Active bits
d) Control bits
8) UNII stands for
c) Both d) None
___________ ISM band.
a) 6 b) 5 c) 2 d) 3
in network.
created.
____________ Set S
*SLRTX376* -3- SLR-TX – 376
Seat
No.

Time : 2.30 p.m. to 5.30 p.m..00 .m. to .00 .m.
SECTION – I
SECTION – II
Capacity.
of them in details.
network.
scenario.
___________________ Set S
Set S
Seat
No.
Set P
B.E. (Computer Science & Engineering) (Part – I) (CGPA)
Examination, 2018
Elective – II : intelligent systems
Time : 2.30 p.m. to 5.30 p.m.
N.B. : 1) Q. No. 1 is compulsory. It should be solved in first 30 minutes


1) What were the two main streams of research that led to the evolution and development
of the concept of Decision Support Systems ?
A) Theoretical studies of organizational decision making and technical work on interactive
computer systems
B) Theoretical studies of organizational behaviour and technical work on relational data
bases
C) Empirical studies of graphical displays and technical work on artificial intelligence
D) None of these
2) What should be a major characteristic of a DSS ?
A) Automates decision making
B) Includes a spreadsheet model
C) Responds quickly to the changing needs of decision makers
D) None of these
3) In which of Steven Alter’s categories of DSS would you place data warehouses ?
A) Analysis Information systems B) Accounting and financial models
C) Data analysis systems D) None of these
4) What would one conclude after visiting DSS-related sites on the World-Wide Web ?
A) There is limited support for DSS researchers and practitioners on the World-Wide
Web
B) The Web is where the DSS research and development action is occurring
C) The quality and value of DSS-related Web sites is outstanding
D) None of these
5) What is a data warehouse ?
A) A database application that searches for hidden patterns in a data base
B) A database designed to support decision making in organizations. It is batch updated
and structured for rapid on -line queries and managerial summaries
C) An interactive computer based system which helps decision makers utilize data and
models to identify and solve problems and make decisions
D) None of these
P.T.O.
SLR-TX – 377 -2- *SLRTX377*
6) What general type of DSS would include file drawer sytems, data warehouses, On-line
Analytical Processing (OLAP) systems, and executive information systems ?
A) Communications-Driven DSS B) Data-Driven DSS
C) Document-Driven DSS D) None of these
7) What type of computerized system recordes current information and emphasizes data
integrity and consistency ?
A) Data Analysis System B) File Drawer System
C) Transaction Processing System D) None of these
8) What is the most important component of a Decision Support System ?
A) Architecture and network design B) Database
C) User interface D) None of these
9) Which of the following web sites provides organized information on a wide variety of
Decision Support Systems topics ?
A) http://DSSRResources.COM B) http://www.usatoday.com
C) http://www.zoogdisney.com D) http://www.hotmail.com
10) What category of software technology enables analysts, managers and executives to
gain insight into data through fast, consistent, interactive access to a wide variety of
possible views of information that has been transformed from raw data to reflect the real
dimensionality of the enterprise as understood by the user.
A) Data Warehouse software
B) On-line Analytical Processing (OLAP) software
C) On-line Transaction Processing (OLTP) software
D) None of these
11) Which of the following level of managers develop short- and medium- range plans,
schedules, and budgets and specify the policies, procedures, and business objectives
for their sub-units of the company ?
A) Strategic B) Tactical C) Operational D) None of these
12) Information that is outdated, inaccurate, or hard to understand would be very meaningful,
useful or valuable to you or other business professionals.
A) True B) False
13) Information has three dimensions. There are
A) Time, consent and form B) Time, content and form
C) Cost, content and form D) None of these
14) The growth of corporate intranets, extranets, as well as the web, has accelerated the
development and use of “executive class” information delivery and decision support
software tools by lower levels of management and by individuals and teams of business
professionals. This dramatic expansion has opened the door to the use of which of the
following tool ?
A) Business Intelligence (BI) B) Business Knowledge (BK)
C) Business Ideas (BI) D) None of these
_________________
Set P
*SLRTX377* -3- SLR-TX – 377
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
a) What are Expert Systems ?
b) What is a DSS ?
c) What is DSS development ?
d) List the phases of decision making probes.
e) What are ANN’s ?
a) List characteristics and capabilities of DSS.
b) Illustrate the DSS development.
c) How does a KBMS work ?
a) What is prototyping ? State the steps involved.
b) What are the components of a DSS ? Illustrate each.
Set P
SLR-TX – 377 -4- *SLRTX377*
SECTION – II
a) What is a Group decision making ?

b) What is an Executive IS ?
c) Compare between ERP and SCM.
d) What is Knowledge management ?
e) What is the role of people in KM ?
a) What is the impact of MSS ?
b) What are the approaches to knowledge management ?
c) How is success ensured in management ?

a) State characteristics of MRP, ERP and SCM.
b) State the impact of MSS.
_____________________
Set P
Seat
No.
Set Q
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.


D) None of these
A) True B) False
P.T.O.
SLR-TX – 377 -2- *SLRTX377*
following tool ?
computer systems
bases
D) None of these
D) None of these
Web
D) None of these
D) None of these
_________________
Set Q
*SLRTX377* -3- SLR-TX – 377
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
b) What is a DSS ?
Set Q
SLR-TX – 377 -4- *SLRTX377*
SECTION – II


_____________________
Set Q
Seat
No.
Set R
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.


D) None of these
P.T.O.
SLR-TX – 377 -2- *SLRTX377*
D) None of these
A) True B) False
following tool ?
computer systems
bases
D) None of these
D) None of these
Web
D) None of these
_________________
Set R
*SLRTX377* -3- SLR-TX – 377
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
b) What is a DSS ?
Set R
SLR-TX – 377 -4- *SLRTX377*
SECTION – II


_____________________
Set R
Seat
No.
Set S
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.


D) None of these
A) True B) False
following tool ?
C) Business Ideas (BI) D) None of these P.T.O.
SLR-TX – 377 -2- *SLRTX377*
computer systems
bases
D) None of these
D) None of these
Web
D) None of these
D) None of these
_________________ Set S
*SLRTX377* -3- SLR-TX – 377
Seat
No.

Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I
b) What is a DSS ?
Set S
SLR-TX – 377 -4- *SLRTX377*
SECTION – II


_____________________
Set S

Seat
No. Set P
Examination, 2018
mobile application development (Elective – II)
Time : 2.30 p.m. to 5.30 p.m.
N. B. : 1) All questions are compulsory.
carries one mark.
of Page.

1. Choose the correct option : 14

1) Parent class of Service
a) Object b) Context
c) Context wrapper d) Context Theme Wrapper
2) When content provider would be activated ?
a) Using Intent b) Using SQLite
c) Using Content Resolver d) None of the above
3) What are the Direct subclasses of Activity ?
a) Account Authenticator Activity b) Activity Group
c) Expandable List Activity d) All of the above
4) Which are the screen sizes in Android ?
a) Small b) Normal
c) Large d) All of the above
5) You can shut down an activity by calling its _________ method.
a) onDestory() b) finishActivity()
c) finish() d) none of the above
P.T.O.
SLR-TX – 378 -2- *SLRTX378*
6) If you want share the data accross the all applications, you should go for ?
a) Shared Preferences b) Internal Storage
c) SQLite Databases d) Content provider
7) What is the name of the folder that contains the mp3 music file ?
a) raw b) res c) drawable d) layout
8) Permission needed to access location using gps are
a) ACCESS_FINE_LOCATION b) ACCESS_COARSE_LOCATION
9) _________ property in xml file decide transparency of the drawable object
in view animation.
a) FromXScale, toXScale b) FromAlpha, toAlpha
c) FromDegrees, toDegrees d) None
10) ________ element in XML is used to indicate multiple animation effect has
to be applied for view object in view animation.
a) raw b) collection c) set d) none
11) _________ permission is needed create files on sd card.
a) UPDATE_EXTERNAL_STORAGE
b) WRITE_EXTERNAL_STORAGE
c) MODIFY_EXTERNAL_STORAGE
d) None
12) _________ method in Cursor returns number of rows in selection query
result set.
a) getColumnCount b) getCount
c) getRowCount d) None
13) Shared preference entry can be deleted by _________ method.
a) remove and commit b) delete and commit
c) remove d) delete
14) ________ is valid sqlite statement to delete entry in sqlite database table.
Tablename : student columns : {studentname, rollno, percentage)
SqliteDatabase db=helper.getWritable();//assume helper is object of class
extended from SqliteOpenHelper
a) db.delete(“student”,“rollno=l”,null);
b) db.execSQL(“delete from student where rollno=1”);
c) both a) and b)
d) none
______________
Set P
*SLRTX378* -3- SLR-TX – 378
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
N. B. : All questions are compulsory.
SECTION – I
a) Define mobile native platforms with example.
b) Elaborate Local and Remote binding concepts of Services.
c) Outline the process of Intent resolution.
d) Define Layouts with example.
a) Illustrate Activity Lifecycle states and respective callback methods.
b) Describe various logical components of an Android App with proper
example.
4. Elaborate the procedure with pseudo code to navigate between Activities and
exchange data between them. (1×8=8)
SECTION – II
a) Write a note on Cursor and Content value classes.
b) Explain black box testing.
c) Explain frame animation.
d) What is LBS ? Explain cell triangulation method.
a) Explain steps to upload signed app on playstore.
b) Explain types of sensor along with steps to access accelerometer.
7. Explain shared preference in detail. Write code for function to add data and
remove data in shared preference file. (1×8=8)
____________
Set P
Set P

Seat
No. Set Q
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


in view animation.
d) None
result set.
P.T.O.
SLR-TX – 378 -2- *SLRTX378*

c) remove d) delete
c) both a) and b)
d) none
a) Small b) Normal
______________
Set Q
*SLRTX378* -3- SLR-TX – 378
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
example.
SECTION – II
____________
Set Q
Set Q

Seat
No. Set R
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


in view animation.
P.T.O.
SLR-TX – 378 -2- *SLRTX378*

d) None
result set.
c) remove d) delete
c) both a) and b)
d) none
a) Small b) Normal
______________
Set R
*SLRTX378* -3- SLR-TX – 378
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
example.
SECTION – II
____________
Set R
Set R

Seat
No. Set S
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


d) None
result set.
c) remove d) delete
P.T.O.
SLR-TX – 378 -2- *SLRTX378*
c) both a) and b)
d) none
a) Small b) Normal
in view animation.
______________
Set S
*SLRTX378* -3- SLR-TX – 378
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
example.
SECTION – II
____________
Set S
Set S
Seat
No.

Set P
B.E. (CSE) (Part – I) (Old) Examination, 2018
Network Security
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

1) A process that is designed to detect, prevent or recover from security attack is
a) Security b) Security mechanism
c) Security services d) Threat
2) OSI security architecture focuses on
a) Security attacks b) Security mechanism
c) Security services d) All the above
3) Rail fence technique comes under __________ technique of encryption.
a) Substitution b) Poly alphabetic
c) Transposition d) Blinding
4) Rotor machine is the important application of the principle of multiple stages
of encryption
5) The most widely used encryption scheme is based on DES is not adopted
by NIST.
6) A _________ cipher is one in which a block of plaintext is treated as a whole
and used to produce a cipher text block of equal length.
a) block b) stream c) digit d) none of above
P.T.O.
SLR-TX – 379 -2- *SLRTX379*
7) The term _________ and __________ were introduced by Claude Shannon

to capture the two basic building blocks for any cryptographic system.
a) possible and feasible b) infeasible and feasible
c) diffusion and confusion d) all of above
8) The difficulty of attacking RSA is based on difficulty of finding the prime
factors of a composite number.
9) In RSA, both sender and receiver must know the value of ___________
a) e b) d c) n d) none of above
10) One means of forming a MAC is to combine a cryptographic hash function
in some fashion with a secret key.
11) Triple DES algorithm uses the key size of
a) 56 bits b) 64 bits c) 128 bits d) 256 bits
12) Anderson identified three classes of intruder namely Misfeasor, Masquerade
and ___________
a) Suspicious user b) Clandestine c) Cliff stoll d) None of above
13) In S/MIME, S indicates
a) Safety b) Serial c) Secure d) Set
14) IPSec encompasses which of the following functional area
a) Authentication b) Confidentiality
c) Key management d) All above
15) ________ provides security services between TCP and applications that
uses TCP.
a) SSL b) HTTP c) SA d) SHA
16) Which of the following server is sued by Kerberos ?
a) Authentication server b) Notarization server
c) Ticket-Granting server d) Both a) and c)
17) Password selection strategies uses which of the following technique.
a) User education b) Reactive password checking
c) Proactive password checking d) All above
18) The set of services provided depends on options selected at the time of
_________ establishment.
a) AH b) ESP c) SA d) None of above
19) In IPSec, transport and tunnel modes are supported by
a) AH b) ESP c) PGP d) Both a) and b)
20) In Web Security, users will trust a personalized service that their profile is
not misused.
_____________________
Set P
*SLRTX379* -3- SLR-TX – 379
Seat
No.

Network Security
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Attempt any four (each carries 5 marks) : 20

a) Explain play fair Cipher with help of example.
b) What is the purpose of S-boxes in DES algorithm ? Explain.
c) Explain Hash functions and security of Hash functions.
d) What is stream and block cipher ? Compare between them.
e) Write a note on :Digital signatures.

a) What is passive and active attack ? List and explain all types of active
attacks.
b) Describe three basic uses of message authentication code with diagram.
4. Explain the RSA algorithm with the help of suitable example. 10
SECTION – II
5. Attempt any four (Each carries 5 marks) : 20

a) What is Kerberos ? List the requirements of Kerberos.
b) List and explain the functions of S/MIME.
c) Explain transport and tunnel mode of IPSec.
d) Describe privacy consideration in Web Services.
e) Explain security and privacy aspects of service oriented architecture.

A) What is intrusion detection ? Explain different approaches to intrusion
detection.
B) Describe X.509 authentication service. Draw and explain X.509 formats.
7. What is SET ? Describe the key features of SET and SET participant with
diagram. 10
_____________________
Set P
SLR-TX – 379 -4- *SLRTX379*
Set P
Seat
No.

Set Q
Network Security
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

not misused.
P.T.O.
SLR-TX – 379 -2- *SLRTX379*

of encryption
by NIST.
and ___________
uses TCP.
_____________________
Set Q
*SLRTX379* -3- SLR-TX – 379
Seat
No.

Network Security
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I


attacks.
SECTION – II


detection.
diagram. 10
_____________________
Set Q
SLR-TX – 379 -4- *SLRTX379*
Set Q
Seat
No.

Set R
Network Security
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

and ___________
uses TCP.
P.T.O.
SLR-TX – 379 -2- *SLRTX379*

not misused.
of encryption
by NIST.
_____________________
Set R
*SLRTX379* -3- SLR-TX – 379
Seat
No.

Network Security
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I


attacks.
SECTION – II


detection.
diagram. 10
_____________________
Set R
SLR-TX – 379 -4- *SLRTX379*
Set R
Seat
No.

Set S
Network Security
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Top of Page.

and ___________
P.T.O.
SLR-TX – 379 -2- *SLRTX379*
uses TCP.
not misused.
of encryption
by NIST.
_____________________
Set S
*SLRTX379* -3- SLR-TX – 379
Seat
No.

Network Security
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I


attacks.
SECTION – II


detection.
diagram. 10
_____________________
Set S
SLR-TX – 379 -4- *SLRTX379*
Set S

Seat
No.
Set P
B.E. (Computer Science and Engg.) (Part – I) (Old)
Examination, 2018
object oriented modelling and design (Elective)
Time : 10.00 a.m. to 1.00 p.m.
Instructions : 1) Q. No. 1 is compulsory. It should be solved in first 30 minutes in Answer



1) By encapsulation in object-oriented modelling we mean
a) Encapsulating data and programs
b) Hiding attributes of an object from users
c) Hiding operations on object from users
d) Hiding implementation details of methods from users of objects
2) Link is connection among
a) classes b) entity c) packages d) none
3) The fact that the same operation may apply to two or more classes is called what ?
a) Inheritance b) Polymorphism
c) Encapsulation d) Multiple classification
4) Pattern identifies a specific ________ that are above the single classes and instances.
a) Encapsulation b) Abstraction
c) Polymorphism d) None of the above
5) The subscribers are
a) Developer b) Observers
c) Software Tester d) Designer
6) ______ is a collection of operations that are used to specify a service of a class or a
component.
a) Abstraction b) Objects c) Classes d) Interface
7) The specification is a contract between the ______ and the __________ of the class.
i. Producer ii. Designer iii. Consumer iv. Software Tester
a) i and ii b) i and iii c) ii and iv d) iii and iv
8) Functional transformations are expressed in terms of
a) Primitive operators of the language b) Calls to subprograms
P.T.O.
SLR-TX – 380 -2- *SLRTX380*
9) Data Flow Diagram is part of

a) Object Model b) Dynamic Model
c) Behavioural Model d) Functional Model
10) A ________ is an abstraction of the attribute values and links of an object.
a) Event b) State c) Use cases d) DFD
11) What is the programming style of the object oriented conceptual model ?
a) Invariant relationships
b) Algorithms
c) Classes and objects
d) Goals, often expressed in a predicate calculus
12) What shows the configuration of run time processing nodes and the components that live on them ?
a) Deployment Diagram b) Component Diagram
c) Collaboration Diagram d) Sequence Diagram
13) A collaboration is a society of
a) classes and functions
b) classes and objects
c) objects and interfaces
d) classes, interfaces and other elements
14) You apply the use case diagram to model _________ view of a system.
a) Dynamic use case b) Static use case
c) Model use case d) None of the above
15) A _______ is the special attribute that reduces the effective multiplicity of an association.
a) Role Name b) Qualifier c) Link Attribute d) None of the above
16) A __________ transforms data values in data flow diagram.
a) Data store b) Actor c) Data flow d) Processes
17) __________ represents a named object that is dispatched asynchronously by one object and they
received by another.
a) Signals b) Events c) State d) Activity
18) The use case diagram are important for _________ behavioural element.
a) Visualizing b) Specifying c) Documenting d) All of the above
19) A
ll software development methodologies emphasize the importance of first ________ then
_____
i. Testing ii. Communication/Planning
iii. Designing iv. Coding
a) i and ii b) iv and i c) iii and ii d) iii and iv
20) Aggregation is a ________ relationship between object classes.
a) Part-whole
b) Hierarchical
c) Unqualified
d) Qualified
______________
Set P
*SLRTX380* -3- SLR-TX – 380
Seat
No.

Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Attempt any 4 : (5×4=20)

1) Explain modelling as a design technique in detail.
2) Write a note on Generalization and Inheritance.
3) What is Multiple Inheritance ? Explain it in briefly with an example.
4) Explain OMT as a software engineering methodology and the OMT methodology.
5) Explain functional modelling in detail.
3. Explain DFD in detail. Also draw DFD for “Hotel Management System”. 10
OR
Explain the impact of an object oriented approach and the overview of analysis with the problem
statement. 10
4. Write the comparison of Object model, Dynamic model and Functional model in detail. 10
SECTION – II

1) What is Use Case ? Explain Use Case diagram.
2) Explain the use of database system for the implementation of OMT.
3) What is deployment ? Explain it with “ATM machine deployment diagram”.
4) Explain the robustness in object oriented style.
5) What is pattern ? What makes a pattern ?

1) Draw a deployment diagram for Home Network.
(Hint: Modern homes usually have a network of interconnected devices of different kinds and with
various types of connections and communication protocols. It contains cable modem, wireless
router, various computers and devices.)
2) Write a short note on :
i) Component diagram
ii) Deployment diagram
7. What is Interaction ? Explain Interaction diagram and activity diagram in detail with example. 10
Set P
____________________
Set P

Seat
No.
Set Q
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.



4) A
_____
a) Part-whole b) Hierarchical
c) Unqualified d) Qualified
P.T.O.
SLR-TX – 380 -2- *SLRTX380*
component.
b) Algorithms
______________
Set Q
*SLRTX380* -3- SLR-TX – 380
Seat
No.

Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Attempt any 4 : (5×4=20)

OR
statement. 10
SECTION – II


Set Q
____________________
Set Q

Seat
No.
Set R
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.



b) Algorithms
P.T.O.
SLR-TX – 380 -2- *SLRTX380*
9) A
_____
a) Part-whole
b) Hierarchical
c) Unqualified
d) Qualified
component.
______________
Set R
*SLRTX380* -3- SLR-TX – 380
Seat
No.

Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Attempt any 4 : (5×4=20)

OR
statement. 10
SECTION – II


Set R
____________________
Set R

Seat
No.
Set S
Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.



component.
b) Algorithms
a) classes and functions b) classes and objects
c) objects and interfaces d) classes, interfaces and other elements
P.T.O.
SLR-TX – 380 -2- *SLRTX380*
14) A
_____
a) Part-whole
b) Hierarchical
c) Unqualified
d) Qualified
______________
Set S
*SLRTX380* -3- SLR-TX – 380
Seat
No.

Examination, 2018
Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Attempt any 4 : (5×4=20)

OR
statement. 10
SECTION – II


Set S
____________________
Set S
Seat
No.
Set P

Information retrieval (Elective)
Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Don’t forget to mention, Q.P. Set (P/Q/R/S) on Top of
Page.

1. Choose correct the answers : (1×20=20)

1) Documents have no match in vector model if cosine value is
a) zero b) one c) ninety d) sixty
2) Structural queries allow querying based on
a) text b) structure
c) text and structure d) none of these
3) In Boolean Model index term weights are __________ values.
a) hexadecimal b) octal c) binary d) decimal
4) An inverted file is ________ oriented mechanism.
a) sentences b) data c) word d) letter
5) Use of IR is more concerned with retrieving
a) information b) data c) words d) sentences
6) Recall is fraction of relevant and _________ documents.
a) modified b) deleted
c) retrieved d) whole text collection
7) SGML stands for
a) Structured Generalized Markup Language
b) Standard Generalized Markup Language
c) Sequential Generalized Markup Language
d) Soft Generalized Markup Language
P.T.O.
SLR-TX – 381 -2- *SLRTX381*
8) Phrase query is sequence of ________ queries.
a) boolean b) single word c) proximity d) context
9) _________ is the technique used in allowing error pattern matching.
a) distance function b) LCS
c) edit distance d) None of these
10) Precision is the ratio of retrieved and __________ documents.
a) relevant b) non relevant
c) all doc. of database d) modified
11) Object index is pair of
a) (BI, IMH) b) (MF, IMH) c) (BI, MF) d) none of these
12) MULTOS stands for
a) Multimedia Office Server b) Multimedia Offline Server
c) Multimedia Oriented Server d) Multimedia Online Server
13) GEMINI has also been applied for colour images with the ______ project
of IBM.
a) QDIC b) QCIC c) QBIC d) QQIC
14) Trying all possible pattern positions in text is _______ algorithm.
a) KMP b) Boyer-Moore Family
c) BF d) None of these
15) TIFF Stands for
a) Tagged Image Frame Format b) Tagged Image File Format
c) Tagged Image Form Format d) None of the above
16) Harvest uses __________ architecture.
a) client /server b) centralized c) distributed d) none of these
17) Crawler is the ________ that sends request to different remote web servers.
a) process b) program c) data d) information
18) An important Meta data format is
a) MARC b) CARC c) FARC d) DARC
19) MULTOS data model is based on ________ architecture.
a) client b) server c) client-server d) Two-tier
20) Digital Libraries are the part of _______ information infrastructure.
a) whole b) global c) domestic d) none of these
__________
Set P
*SLRTX381* -3- SLR-TX – 381
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I
2. Explain SGML, XML, and HTML in detail. 10

a) Keyword Based Querying
b) Boolean Model
4. Write notes on (any four) : (5×4=20)

a) Difference between data retrieval and information retrieval.
b) BF algorithm.
c) Structural Queries.
d) KMP .
e) Vector Model.
SECTION – II
5. Describe MULTOS Query Language Form. 10

a) Architectural issues of Digital Library.
b) Problems posed by web.

a) Data Retrieval Steps
b) Document Model
c) Browsing in Web
d) GEMINI
e) MULTOS Data Model.
___________
Set P
Set P
Seat
No.
Set Q

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Page.


P.T.O.
SLR-TX – 381 -2- *SLRTX381*
12) SGML stands for
of IBM.
20) TIFF Stands for
__________
Set Q
*SLRTX381* -3- SLR-TX – 381
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

b) Boolean Model

b) BF algorithm.
d) KMP .
e) Vector Model.
SECTION – II


b) Document Model
c) Browsing in Web
d) GEMINI
___________
Set Q
Set Q
Seat
No.
Set R

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Page.


of IBM.
5) TIFF Stands for
P.T.O.
SLR-TX – 381 -2- *SLRTX381*
17) SGML stands for
__________
Set R
*SLRTX381* -3- SLR-TX – 381
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

b) Boolean Model

b) BF algorithm.
d) KMP .
e) Vector Model.
SECTION – II


b) Document Model
c) Browsing in Web
d) GEMINI
___________
Set R
Set R
Seat
No.
Set S

Time : 10.00 a.m. to 1.00 p.m.

carries one mark.
Page.


2) SGML stands for
P.T.O.
SLR-TX – 381 -2- *SLRTX381*
of IBM.
10) TIFF Stands for
__________
Set S
*SLRTX381* -3- SLR-TX – 381
Seat
No.

Time : 10.00 a.m. to 1.00 p.m.
SECTION – I

b) Boolean Model

b) BF algorithm.
d) KMP .
e) Vector Model.
SECTION – II


b) Document Model
c) Browsing in Web
d) GEMINI
___________
Set S
Set S

Seat
No. Set P
B.E. (CSE) (Part – II) (CGPA) Examination, 2018
Management Information system
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


1) _________ covers the planning, control and administration of the operations
of a concern.
a) Management b) Information c) System d) Transaction
2) The _________ are informed about the progress, achievements and
shortfalls in the activity and the targets.
a) Logical managers b) Functional managers
c) Customers d) Top level managers
3) The information of MIS comes from the
a) Internal source b) External source
c) Both internal and external source d) None of the above
4) The basic components of DSS is are
a) Database b) Model base
c) DSS software system d) All of the above
5) GDSS means
a) Group Decision Support System
b) Group Dedicated Support System
c) General Decision Support System
d) Group Decision Service System
6) _________ competitive strategy develop products and services which are
different from what the competition offers.
a) Cost leadership b) Differentiation c) Cost focus d) Tactical
P.T.O.
SLR-TX – 382 -2- *SLRTX382*
7) _________ systems are developed in response to corporate business
initiative and give competitive advantage to the organization.
a) Operational information b) Decision information
c) Strategic information d) All
8) Who are the primary users of SCM systems ?
a) Sales, marketing, customer service
b) Accounting, finance, logistics and production
c) Customers, resellers, partners, suppliers and distributors
d) All of the above
9) What are the primary business benefits of an ERP system ?
a) Sales forecasts, sales strategies and marketing campaigns
b) Market demand, resource and capacity constraints and real-time
scheduling
c) Forecasting, planning, purchasing , material management, warehousing,
inventory and distribution
d) All of the above
10) Who are the primary users of ERP systems ?
d) All of the above
11) If configured correctly, the _________ will prevent interaction with your
computer after a specified time period.
a) firewall b) Filter c) Screen saver d) Popup blocker
12) To recover files from a backup, you perform a
a) Restore b) Scan c) Unerase d) Copy
13) Which segment do eBay, Amazon.com belong ?
a) B2Bs b) B2Cs c) C2Bs d) C2Cs
14) Which type of e-commerce focuses on consumers dealing with each
other ?
a) B2B b) B2C c) C2B d) C2C
______________
Set P
*SLRTX382* -3- SLR-TX – 382
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

a) What are the different uses of Management Information System ?
b) What are the different characteristics of MIS ?
c) How GDSS can enhance group decision-making in the organization ?
d) What is ESS ? Explain benefits of ESS.
e) What is the concept of strategic information system ?
f) Describe overview of system development life cycle.

a) Explain about Information System Software in detail.
b) What is Decision Support Systems (DSS) and also explain characteristics
and applications of decision support systems.
c) Explain causes of information system success and failure in detail.
SECTION – II

1) Explain managing information resources in information system.
2) Explain security audit.
3) Explain the concept of e-commerce.
4) Explain the role of CIO.
5. What is ERP ? Explain need features, advantages and growth of ERP. 8

OR
What is e-commerce ? Explain the different types and applications of e-commerce.
6. Write note on : 8
1) Payment Gateway in e-commerce.
2) Supply Chain Management (SCM).
_____________________ Set P
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


d) All of the above
scheduling
d) All of the above
d) All of the above
P.T.O.
SLR-TX – 382 -2- *SLRTX382*
other ?
of a concern.
12) GDSS means
______________
Set Q
*SLRTX382* -3- SLR-TX – 382
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II


OR
_____________________ Set Q
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


1) GDSS means
d) All of the above
scheduling
d) All of the above P.T.O.
SLR-TX – 382 -2- *SLRTX382*
d) All of the above
other ?
of a concern.
______________
Set R
*SLRTX382* -3- SLR-TX – 382
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II


OR
_____________________ Set R
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


d) All of the above
other ?
of a concern.
P.T.O.
SLR-TX – 382 -2- *SLRTX382*
10) GDSS means
d) All of the above
scheduling
d) All of the above
______________
Set S
*SLRTX382* -3- SLR-TX – 382
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II


OR
_____________________ Set S
Set S

Seat
No. Set P
Information and Cyber Security
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


1) In DES algorithm, if input of an s-box is 110011 then we look for _____ row
of s-box to obtain output.
A) 0 B) 1 C) 2 D) 3
2) Which of the following(s) is (are) block cipher ?
A) DES B) AES C) RC5 D) All of above
3) What is the plaintext of the following ciphertext “I dp d erb” (using Caesar
cipher decryption method k = 3) ?
A) i am a boy B) i am a toy
C) j is b bos D) j am b bos
4) Which of the following algorithm is not used for asymmetric key cryptography ?
A) RSA B) Diffi-Hellman
C) Electronic code book algorithm D) None of mentioned
5) ITU-T Recommendation X-800 defines
A) Security Attack B) Security Service
C) Security Mechanism D) All of above
6) With the ________ mode if there is an error in a block of the transmitted
ciphertext only the corresponding plaintext block is affected.
A) ECB B) CTR C) CBC D) TSR
P.T.O.
SLR-TX – 383 -2- *SLRTX383*
7) gcd(11, –5) and gcd (–11, 5) are ________ and ________ respectively.
A) 1, 1 B) 2, 3 C) 1, 5 D) 2, 5
8) “It is easy to generate a code given a message, but virtually impossible to
generate a message given a code” describes the __________ hash function
property.
A) Collision resistance B) Strong Collision resistance
C) Preimage resistance D) Second preimage resistance
9) SSL Record protocol provides
A) Confidentiality B) Message Intigrity
C) Availability D) Both A) and B)
10) PGP provide _______ and __________ service that can be used for
electronic mail and file storage applications.
A) Integrity, Confidentiality B) Confidentiality, Authentication
C) Integrity, Authentication D) None of above
11) ______ is an open encryption and security specification designed to protect
credit card transaction on internet.
A) SSL B) KET C) SET D) SMTP
12) Following is a tool which attempt to make activity on the internet
untraceable.
A) Proxy Server B) Anonymizer
C) Logic Bomb D) Spywares
13) _______ infect the storage media on which OS is stored and which is
used to start the computer system.
A) Program virus B) Multipartite virus
C) Boot Sector virus D) Polymorphic virus
14) _____ is a software program, self-replicating in nature, which spread through
network also it can send copies through the network with or without user
intervention.
A) Antivirus B) Computer Worm
C) Computer Virus D) All of these

______________
Set P
*SLRTX383* -3- SLR-TX – 383
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1) Give the encryption and decryption function of Caesar cipher and encrypt
the message with Caesar Cipher technique with key = 3;
“defend the east wall of the castle”
2) Differentiate between conventional encryption and public key encryption.
3) Write a note on Rotor Machine.
4) List and explain message authentication functions.
5) Explain the term confusion and diffusion.

1) Perform encryption and decryption using RSA
A) p = 3, q = 11, e = 7, M = 5
B) P = 5, q = 11, e = 3, M = 9
2) what are the strength of DES algorithm and explain in detail working of
single round of DES with diagram.
3) Explain different types of security attack.
Set P
SLR-TX – 383 -4- *SLRTX383*
SECTION – II

1) What is IPSec ? List the application of IPSec.
2) Write short note on transport mode and tunnel mode.
3) Explain the concept of steganography.
4) What is random password ? And give the guidelines applicable to the
password policies.
5) What is phishing ? How it work ?

1) Explain in detail classification of cybercrime.
2) What are different types of viruses ? Explain in detail.
3) Explain with respect to SSL protocol.
a) Architecture and services
b) SSL Record Protocol.
_____________________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


property.
untraceable.
P.T.O.
SLR-TX – 383 -2- *SLRTX383*
intervention.
A) 0 B) 1 C) 2 D) 3
A) 1, 1 B) 2, 3 C) 1, 5 D) 2, 5

______________
Set Q
*SLRTX383* -3- SLR-TX – 383
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


A) p = 3, q = 11, e = 7, M = 5
B) P = 5, q = 11, e = 3, M = 9
Set Q
SLR-TX – 383 -4- *SLRTX383*
SECTION – II

password policies.

_____________________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


A) ECB B) CTR
C) CBC D) TSR
A) 1, 1 B) 2, 3
C) 1, 5 D) 2, 5
property.
P.T.O.
SLR-TX – 383 -2- *SLRTX383*
untraceable.
intervention.
A) 0 B) 1 C) 2 D) 3

______________
Set R
*SLRTX383* -3- SLR-TX – 383
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


A) p = 3, q = 11, e = 7, M = 5
B) P = 5, q = 11, e = 3, M = 9
Set R
SLR-TX – 383 -4- *SLRTX383*
SECTION – II

password policies.

_____________________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


untraceable.
intervention.
P.T.O.
SLR-TX – 383 -2- *SLRTX383*
A) 0 B) 1 C) 2 D) 3
A) 1, 1 B) 2, 3 C) 1, 5 D) 2, 5
property.

______________
Set S
*SLRTX383* -3- SLR-TX – 383
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


A) p = 3, q = 11, e = 7, M = 5
B) P = 5, q = 11, e = 3, M = 9
Set S
SLR-TX – 383 -4- *SLRTX383*
SECTION – II

password policies.

_____________________
Set S

Seat
No. Set P
Data warehousing and Mining (Elective – III)
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


1) Which of the following are data mining task ?
a) Classification b) SQL query c) Trigger d) None of these
2) In data mining output is Fuzzy.
a) True b) False
3) _________ is an approach to handle missing data.
a) Ignore the missing value b) Assume a value for missing data
c) Fill missing value manually d) All the above
4) Which of the following is a measure task in data preprocessing ?
a) Data transformation b) Classification
c) Clustering d) None of above
5) Which among the following is an example of spatial databases ?
a) Stock price database b) Daily temperature
c) VLSI database d) Super market transaction
6) _________ is one of the method to handle noisy data.
a) Catching b) Crawling
c) Binning d) None of the above
7) Full form of SPADE is
a) Sequential Pattern Discovery using Equivalence Classes
b) Serial Pattern Discovery using Equal Closure
c) Sequence Pattern Disclosure using Equal Classes
d) None
P.T.O.
SLR-TX – 384 -2- *SLRTX384*
8) Which of the following is collection of data object that are similar to one
another within same group ?
a) Partition b) Grid c) Cluster d) Table
9) Classification rules are extracted from
a) Root node b) Decision tree c) Siblings d) Branches
10) In clustering class labels are
a) Known b) Unknown c) Can’t say d) None of these
11) The “IF” - part of a rule is known as
a) Rule antecedent b) Rule consequent
c) Action d) None of these
12) Trend analysis can be done on __________ data.
a) Spatial b) Transaction data
c) Temporal d) None
13) Social network mining can be done by
a) Graph mining b) Tree mining c) Tree pruning d) None
14) _________ is a spatial database primitive.
a) Time b) Direction
c) Transaction item d) None
______________
Set P
*SLRTX384* -3- SLR-TX – 384
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Answer any three of the following : (3×4=12)
1) Explain difference between database processing versus data mining
processing.
2) What are difficulties in Data mining processing ?
3) Explain what do you mean by supervised and unsupervised learning ?
4) Explain OLTP vs OLAP in detail.
3. Solve any one of the following : (1×8=8)

1) Explain classification by decision tree induction.
2) Explain data warehouse design process in detail.
4. Explain KDD process in detail with diagram. 8
SECTION – II

1) Explain k-means clustering method.
2) Explain in brief spatial data mining and its primitives.
3) Write a note on web mining.
4) Write a note on PAM algorithm.

1) Explain graph mining and its applications.
2) Explain agglomerative algorithm with example.
7. Explain any five data mining applications in detail. 8
_____________________
Set P
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


c) Temporal d) None
P.T.O.
SLR-TX – 384 -2- *SLRTX384*
a) True b) False
d) None
______________
Set Q
*SLRTX384* -3- SLR-TX – 384
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
processing.

SECTION – II


_____________________
Set Q
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


d) None
P.T.O.
SLR-TX – 384 -2- *SLRTX384*
c) Temporal d) None
a) True b) False
______________
Set R
*SLRTX384* -3- SLR-TX – 384
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
processing.

SECTION – II


_____________________
Set R
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


c) Temporal d) None
a) True b) False
P.T.O.
SLR-TX – 384 -2- *SLRTX384*
d) None
______________
Set S
*SLRTX384* -3- SLR-TX – 384
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
processing.

SECTION – II


_____________________
Set S
Set S
Seat
No.

Set P
B.E. (Computer Science and Engineering) (Part – II)
Elective – III : Image Processing
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) The range of values spanned by the gray scale is called as __________ of
an image.
a) Resolution b) Histogram
c) Dynamic range d) Contrast
2) Black color in image processing is usually represented by the
a) 0 b) 1 c) 255 d) 256
3) Image enhancement approaches fall into two broad categories
a) Spatial domain methods and frequency domain methods
b) Image sensing and acquisition
c) Visible and infrared bands
d) None of these
4) DFT stands for
a) Discrete Fourier transform b) Digital function transform
c) Digital frequency tranform d) None of these
P.T.O.
SLR-TX – 385 -2- *SLRTX385*
5) To remove the correlated image data which of the following image transform
is used.
a) DCT b) DFT
c) K – L transform d) Walsh
6) What is image ?
a) Picture b) Matrix of pixel
c) Collection of pixel d) All of these
7) Detect the three basic types of gray-level discontinuities
a) Points b) Lines c) Edges d) All of these
8) If salt as well as pepper noise is present then it is called
a) Uni-polar b) Bipolar
c) Tri-polar d) Quadra-polar
9) Entropy is measured in terms of
a) bytes/pixel b) bits/pixel
c) both a) and b) d) None of these
10) Hough transform is ___________ processing technique used for edge
linking.
a) Local b) Global c) Point d) Histogram
11) __________ are used to represent a boundary connected by a connected
sequence of straight line segments of specified length and direction.
a) Signatures b) Skeletons
c) Chain codes d) Boundary descriptors
12) A measure of the degree to which a pure color is diluted by white light is
given by
a) Hue b) Intensity c) Cyan d) Saturation
13) For a 8-bit gray scale image, 0-255 is the
a) Gray scale b) Gray level
c) Intensity level d) None of these
14) If the pixels of an image are shuffled then the parameter that may
change is
a) Histogram b) Mean c) Entropy d) Covariance
_____________________
Set P
*SLRTX385* -3- SLR-TX – 385
Seat
No.



Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Attempt any four : 20
1) What do you mean sampling and quantization ? Explain in detail.
2) Write note on : Region based segmentation.
3) Compare spatial and frequency domain methods.
4) Discuss any four low level image processing operations.
5) Write note on : Geometric transformation.
3. Write note on following, also give its application : 8
1) Contrast stretching
2) Intensity level slicing
3) Bit plane slicing
4) Histogram processing.
OR
Explain different techniques to sharpen the image in frequency domain.
Set P
SLR-TX – 385 -4- *SLRTX385*
SECTION – II
1) Explain length of a boundary.
2) Specify the various image representation approaches.
3) What is DFT ? Explain.
4) Write note on wavelet transform.
5) What is segmentation ? Explain.
5. Define image compression. Explain the characteristics of lossy and lossless

compression. 8
OR
Define chain codes. Explain the three different types of polygonal

approximations.
_____________________
Set P
Seat
No.

Set Q
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

linking.
given by
P.T.O.
SLR-TX – 385 -2- *SLRTX385*

change is
an image.
a) 0 b) 1 c) 255 d) 256
d) None of these
11) DFT stands for
is used.
a) DCT b) DFT
13) What is image ?
_____________________
Set Q
*SLRTX385* -3- SLR-TX – 385
Seat
No.



Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
OR
Set Q
SLR-TX – 385 -4- *SLRTX385*
SECTION – II

compression. 8
OR

approximations.
_____________________
Set Q
Seat
No.

Set R
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

is used.
a) DCT b) DFT
2) What is image ?
P.T.O.
SLR-TX – 385 -2- *SLRTX385*

linking.
given by
change is
an image.
a) 0 b) 1 c) 255 d) 256
d) None of these
14) DFT stands for
_____________________
Set R
*SLRTX385* -3- SLR-TX – 385
Seat
No.



Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
OR
Set R
SLR-TX – 385 -4- *SLRTX385*
SECTION – II

compression. 8
OR

approximations.
_____________________
Set R
Seat
No.

Set S
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

linking.
given by
change is
P.T.O.
SLR-TX – 385 -2- *SLRTX385*

an image.
a) 0 b) 1 c) 255 d) 256
d) None of these
9) DFT stands for
is used.
a) DCT b) DFT
11) What is image ?
_____________________
Set S
*SLRTX385* -3- SLR-TX – 385
Seat
No.



Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
OR
Set S
SLR-TX – 385 -4- *SLRTX385*
SECTION – II

compression. 8
OR

approximations.
_____________________
Set S

Seat
No. Set P
B.E. (Computer Science and Engineering) (Part – II) Examination, 2018
INFORMATION RETRIEVAL (elective – III) (CGPA)
Time : 2.30 p.m. to 5.30 p.m.

minutes in Answer Book Page No. 3. Each question carries
one mark.
of Page.
1) The order in which the words are listed in a dictionary or telephone guide is
called
a) Lexicographical order b) Chronological order
c) Archival order d) None of the above
2) Index terms are generally
a) Nouns b) Adverbs c) Adjectives d) Connectives
3) All the documents in an IR system are stored in
a) Secondary memory b) Central repository system
c) Tape drive d) All of these
4) An information retrieval model is a ___________ model.
a) Single b) Double
c) Quadruple d) None of the above
5) Boolean model is a simple retrieval model based on _________ theory.
a) Logic b) Set and binary
c) Octal number d) Relational
6) Phrase is a sequence of __________ queries.
a) Double word b) Single word
c) Boolean d) Vector
7) Abusive availability of commercial information disguised in form of
informational content is
a) Web spam b) Web crawling
c) Web hosting d) None of these
P.T.O.
SLR-TX – 386 -2- *SLRTX386*
8) Sequential scanning may be slow, because

i) Distance computation might be expensive
ii) The database size ‘N’ might be huge
iii) It uses spatial access method
iv) None of these
a) ii and iii b) i and ii c) i and iii d) only iv
9) MULTOS data model is based on
a) Client architecture b) Server architecture
c) Client/server architecture d) None of the above
10) Multimedia system contain
a) Only text b) Images and graphics
c) Sound and Video d) All above ‘3’ options
11) LOB data types in the multimedia data support can be used to stored
a) Large unstructured data object b) Binary large object
c) Character large object data d) None of the above
12) Metacrawler and savvy search are the example of
a) Metasearches b) Crawlers
c) Gatherers d) Brokers
13) Harvest uses a _________ architecture, to gather and distribute data.
a) Distributed b) Hybrid
c) Centralized d) None of these
14) GEMINI approach is based on
a) ‘Quick-and-dirty’ test b) ‘Quick’ test
c) SGML d) HTML
______________
Set P
*SLRTX386* -3- SLR-TX – 386
Seat
No.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

a) State the difference between data retrieval and information retrieval.
b) Write a short note on information retrieval.
c) Define and describe the Boolean model for information retrieval.
d) In brief explain the probabilistic model.
e) Explain the concept of recall and precision.

a) With a neat block schematic explain the process of retrieving information.
b) Explain the construction of suffix arrays for large text.
c) How BM (Boyer-Moore Family) algorithm works for the following pattern
“abracadabra” ?
SECTION – II

a) Explain attribute predicates, structural predicates and semantic
predicates.
b) Explain the MULTOS data model using conceptual structure in detail with
example.
c) Discuss any four challenges posed by web.
d) Explain spatial access methods of multimedia IR indexing and searching.

Set P
SLR-TX – 386 -4- *SLRTX386*

a) Explain the basic idea of GEMINI and show how GEMINI overcomes the
two disadvantages of sequential searching.
OR
b) Explain the architectural issues in the digital libraries in details.
6. Attempting this question is compulsory : (1×8=8)

Explain and draw the complete conceptual structure of the type generic-letter
and business-product-letter using the MULTOS data model.
_____________________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.

one mark.
of Page.
iv) None of these
P.T.O.
SLR-TX – 386 -2- *SLRTX386*

c) SGML d) HTML
called
a) Single b) Double
______________
Set Q
*SLRTX386* -3- SLR-TX – 386
Seat
No.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


“abracadabra” ?
SECTION – II

predicates.
example.

Set Q
SLR-TX – 386 -4- *SLRTX386*

OR

_____________________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.

one mark.
of Page.
iv) None of these
P.T.O.
SLR-TX – 386 -2- *SLRTX386*

c) SGML d) HTML
called
a) Single b) Double
______________
Set R
*SLRTX386* -3- SLR-TX – 386
Seat
No.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


“abracadabra” ?
SECTION – II

predicates.
example.

Set R
SLR-TX – 386 -4- *SLRTX386*

OR

_____________________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.

one mark.
of Page.
c) SGML d) HTML
called
P.T.O.
SLR-TX – 386 -2- *SLRTX386*

a) Single b) Double
iv) None of these
______________
Set S
*SLRTX386* -3- SLR-TX – 386
Seat
No.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


“abracadabra” ?
SECTION – II

predicates.
example.

Set S
SLR-TX – 386 -4- *SLRTX386*

OR

_____________________
Set S

Seat
No.
Set P
cloud computing (Elective – III)
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
1) Which of the following architectural standards is working with cloud computing
industry ?
a) Service-oriented architecture b) Standardized web services
c) Web-application frameworks d) All of the mentioned
2) Which of the following is one of the unique attribute of Cloud Computing ?
a) utility type of delivery b) elasticity
c) low barrier to entry d) all of the mentioned
3) Which of the following is a virtual machine technology now owned by Oracle
that can run various operating systems ?
a) V machines b) Virtual Box
c) Thought Police d) None of the mentioned
4) The technology used to distribute service requests to resources is referred
to as
a) load performing b) load scheduling
c) load balancing d) all of the mentioned
5) Point out the correct statement
a) PaaS supplies the infrastructure
b) IaaS adds application development frameworks, transactions, and control
structures
c) SaaS is an operating environment with applications, management, and
the user interface
P.T.O.
SLR-TX – 387 -2- *SLRTX387*
6) Which of the following area of cloud computing is uniquely troublesome ?
a) Auditing b) Data integrity
c) e-Discovery for legal compliance d) All of the mentioned
7) Which of the following is cross-platform API based on generalizing the major
cloud vendors APIs ?
a) Deltacloud b) Simple Cloud API
c) Design Cloud d) All of the mentioned
8) ___________ supports load balancing.
a) Amazon b) Sales Force
c) Microsoft Azure d) All of the mentioned
9) Which of the following network resources can be load balanced ?
a) Connections through intelligent switches
b) DNS
c) Storage resources
10) An operating system running on a Type _____ VM is a full virtualization.
a) 1 b) 2
c) 3 d) All of the mentioned
11) Which of the following is application and infrastructure management software
for hybrid multi-clouds ?
a) VMware Hyperic b) Webmetrics
c) Univa UD d) Tapinsystems
12) How many aspects needs to be considered while assessing network
capacity ?
a) one b) two
c) three d) all of the mentioned
13) Which of the following service provider provides the highest level of service ?
a) SaaS b) PaaS
c) IaaS d) All of the mentioned
14) For the __________ model, the security boundary may be defined for the
vendor to include the software framework and middleware layer.
a) SaaS b) PaaS
________________
Set P
*SLRTX387* -3- SLR-TX – 387
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

a) Discuss benefits and challenges of cloud computing.
b) Which are the building blocks of private cloud ? Explain any two in detail.
c) Write short note on public cloud.
d) Explain server security challenges in cloud computing.

a) Discuss role of virtualization in cloud computing.
b) Give cloud security reference model and explain the same.
4. Give implementation steps for any one of the public cloud ( AWS, Windows
Azure, IBM or Rackspace). 8
SECTION – II
5. Attempt any three questions : (4×3=12)

a) Explain selection criteria for cloud deployment.
b) Explain future technology trends in cloud computing service models.
c) Explain various Biz clouds focused on Education industry domains.
d) Explain advantages and disadvantages of multi cloud management.
e) Explain security issues with multi cloud architecture.
6. Attempt any one question : (1×8=8)

a) Explain Multi-Cloud management concept.
b) Explain current issues in cloud computing.
7. Attempt the following question : (1×8=8)

Explain various Biz clouds focused on retail industry domains.
_____________________
Set P
Set P

Seat
No.
Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
b) DNS
a) 1 b) 2
capacity ?
a) one b) two
a) SaaS b) PaaS
P.T.O.
SLR-TX – 387 -2- *SLRTX387*
a) SaaS b) PaaS
industry ?
to as
structures
the user interface
________________
Set Q
*SLRTX387* -3- SLR-TX – 387
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II



_____________________
Set Q
Set Q

Seat
No.
Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
structures
the user interface
b) DNS
P.T.O.
SLR-TX – 387 -2- *SLRTX387*
a) 1 b) 2
capacity ?
a) one b) two
a) SaaS b) PaaS
a) SaaS b) PaaS
industry ?
to as
________________
Set R
*SLRTX387* -3- SLR-TX – 387
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II



_____________________
Set R
Set R

Seat
No.
Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
a) 1 b) 2
capacity ?
a) one b) two
a) SaaS b) PaaS
a) SaaS b) PaaS
industry ?
P.T.O.
SLR-TX – 387 -2- *SLRTX387*
to as
structures
the user interface
b) DNS
________________
Set S
*SLRTX387* -3- SLR-TX – 387
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II



_____________________
Set S
Set S

Seat
No.
Set P
B.E. (Computer Science and Engineering) (Part – II) (CGPA Pattern)
Examination, 2018
storage aRea network (Elective – IV)
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
1) I/O requests to disk storage on a SAN are called
a) File I/Os b) SAN I/Os c) Block I/Os d) Disk I/Os
2) What is the name of raid module in a Linux kernel ?
a) lvm b) raidsoft
c) md d) none of the mentioned
3) What is the most basic level of storage ?
a) SAN b) DAS c) NAS d) ISCSI
4) Which topology is best suited for medium sized enterprise ?
a) NAS b) SAN
c) DAS d) None of the mentioned
5) Which FC layer is responsible for exchange/frame and sequence
management ?
a) Layer 0 b) Layer 1 c) Layer 2 d) Layer 4 (ULP)
6) Which of the following backup technique is most space efficient ?
a) Full backup b) Incremental backup
c) Differential backup d) All of the mentioned
7) Network level virtualization in a SAN fabric can be implemented by having
virtualization engine running in
a) HBA b) FC switch
c) Raid array d) None of the mentioned P.T.O.
SLR-TX – 388 -2- *SLRTX388*
8) SMI-S Standard uses
a) Java RMI b) CIM-XML/HTTP
c) CORBA d) .NET
9) What is the unique characteristic of RAID 6 (Choose one) ?
a) Distributed parity
b) Striping
c) Two independent distributed parity
d) Mirroring
10) Backup of the source data can be created
a) On the same device b) On another device
c) At some other location d) All of the mentioned
11) Which are all the statements valid statements w.r.t. volume manager ?
a) Achieve protection against single/multiple disk failures
b) Sustain system/node failure
c) Get better performance compared to using individual disk
12) This is the pooling of physical storage from multiple network storage devices
into what appears to be a single storage device that is managed from a
central console.
a) Server provisioning b) Data mining
c) Disk/Tape virtualization d) None of the mentioned
13) There are endless rules and regulations in this area of storage
technology.
a) Data Protection b) Data Storage Management
c) Database Management d) Meta Data Management
14) Which command is used to view NFS shared directories ?
a) share b) shareall c) sharetab d) dfshares
________________
Set P
*SLRTX388* -3- SLR-TX – 388
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
a) Explain instant copy and remote mirroring.
b) Explain storage centric IT architecture.
c) Explain point to point topology of fibre SAN.
d) Explain shared disk file system.
e) Explain definition of storage virtualization with neat diagram.
a) Limitations of server centric architecture and application of storage centric
architecture.
b) Explain fibre channel protocol stack.
c) Explain storage virtualization on various levels of storage network.
SECTION – II
a) How clustering is used for load distribution ?
b) Write a note on dynamic tape library sharing.
c) What are different components of server backup ?
d) Write and explain general condition of network backup.
e) Explain Network management data protocol.
a) Explain adaptability and scalability of IT system.
b) Explain any two next generation backup.
c) Write performance bottleneck of network backup.
_____________________
Set P
Set P

Seat
No.
Set Q
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
c) CORBA d) .NET
b) Striping
d) Mirroring
central console.
c) Disk/Tape virtualization d) None of the mentioned P.T.O.
SLR-TX – 388 -2- *SLRTX388*
technology.
a) lvm b) raidsoft
a) NAS b) SAN
management ?
a) HBA b) FC switch
c) Raid array d) None of the mentioned
________________
Set Q
*SLRTX388* -3- SLR-TX – 388
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
architecture.
SECTION – II
_____________________
Set Q
Set Q

Seat
No.
Set R
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
management ?
a) HBA b) FC switch
c) CORBA d) .NET
b) Striping
d) Mirroring
P.T.O.
SLR-TX – 388 -2- *SLRTX388*
central console.
technology.
a) lvm b) raidsoft
a) NAS b) SAN

________________
Set R
*SLRTX388* -3- SLR-TX – 388
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
architecture.
SECTION – II
_____________________
Set R
Set R

Seat
No.
Set S
Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.
central console.
technology.
a) share b) shareall
c) sharetab d) dfshares
P.T.O.
SLR-TX – 388 -2- *SLRTX388*
a) lvm b) raidsoft
a) NAS b) SAN
management ?
a) HBA b) FC switch
c) CORBA d) .NET
b) Striping
d) Mirroring
________________
Set S
*SLRTX388* -3- SLR-TX – 388
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
architecture.
SECTION – II
_____________________
Set S
Set S
Seat
No.
Set P

B.E. (Computer Science and Engineering) (Part – II) (CGPA)

Examination, 2018
Elective – IV : Web 2.0 And RicH internet APplication
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.

1. Choose correct alternative :

1) Mashups are generally ___________ or hosted online.
a) Client applications b) Server side
2) ___________ is to protect data and passwords.
a) Encryption b) Authentication
c) Authorization d) Non-repudiation
3) ___________ function creates a message digest out of a message.
a) Encryption b) Decryption
c) Hash d) None of the above
4) Message ________ means that the sender and the receiver expect privacy.
a) Confidentiality b) Integrity
c) Authentication d) None of the above
5) Which of the following jQuery method removes all child nodes from the
set of matched elements ?
a) empty ( ) b) delete ( )
c) remove (expr) d) None of the above
P.T.O.
SLR-TX – 389 -2- *SLRTX389*
6) Which of the following is true about Web services ?
a) Web services are open standard (XML, SOAP, HTTP etc.) based Web
applications
b) Web services interact with other web applications for the purpose of
exchanging data
c) Web services can convert your existing applications into web-applications
d) All of the above
7) What are all the controls of AJAX ?
a) Script Manager b) Script
c) Manager d) None of the above
8) AJAX stands for
a) Asynchronous Javascript and XML
b) Abstract JSON and XML
c) Another Java Abstraction for X-windows
d) Another Java and XML Library
9) Validation kind of parsers is
a) Well-formed b) Well-documented
c) Non-validating and validating d) None of the above
10) Which of the following HTTP method more secure ?
a) GET b) DELETE c) POST d) PUT
11) The primary goal of the ________ protocol is to provide a private channel
between communicating application, which ensures privacy of data
authentication of the partners and integrity.
a) SSL b) ESP c) TSL d) PSL
12) A piece of icon or image on a web page associated with another web
page is called
a) url b) hyperlink
c) plugin d) none of the mentioned
13) What is the name of the DLL that contains Ajax control tool kit ?
a) Controltoolkit.dll b) Ajaxcontroltoolkit.dll
c) ajax.dll d) Allcontroltoolkit.dll
14) XPath is syntax for defining parts of __________
a) XML document b) HTML document
c) DTD document d) All of the above
_____________
Set P
*SLRTX389* -3- SLR-TX – 389
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1) What is a web feed ?
2) What is the different between Web 1.0 and Web 2.0 ?
3) Mention what are the HTTP methods supported by REST.
4) What are all the controls of Ajax ?
5) Explain the working of XSLT.

1) Explain syndication and microformats in brief.
2) Explain XLink, XPath and XForms with an example.
3) What is REST ? Explain in brief.
SECTION – II

1) Why we use mashups ? Explain in detail.
2) What is JSON and how JSON can be served in WS ?
3) What are the Business strategies in web 2.0 ?
4) How the message encryption is done in web security ?

1) Give a syntax rules for XQuery.
2) Define authentication and authorization in web.
3) Explain Mapping mashup. Give an example for mapping mashup.
_____________
Set P
Set P
Seat
No.
Set Q


Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


1) AJAX stands for
page is called
a) url b) hyperlink
P.T.O.
SLR-TX – 389 -2- *SLRTX389*
applications
exchanging data
d) All of the above
_____________
Set Q
*SLRTX389* -3- SLR-TX – 389
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II


_____________
Set Q
Set Q
Seat
No.
Set R


Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


applications
exchanging data
d) All of the above
4) AJAX stands for
d) Another Java and XML Library P.T.O.
SLR-TX – 389 -2- *SLRTX389*
page is called
a) url b) hyperlink
_____________
Set R
*SLRTX389* -3- SLR-TX – 389
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II


_____________
Set R
Set R
Seat
No.
Set S


Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
Top of Page.


page is called
a) url b) hyperlink
P.T.O.
SLR-TX – 389 -2- *SLRTX389*
applications
exchanging data
d) All of the above
13) AJAX stands for
_____________
Set S
*SLRTX389* -3- SLR-TX – 389
Seat
No.

Examination, 2018
Time : 2.30 p.m. to 5.30 p.m.
SECTION – I


SECTION – II


_____________
Set S
Set S
Seat
No. Set P
Examination, 2018
Artificial Neural Networks (Elective – IV)

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

1) Widrow-Hoff learning law is a special case of __________ learning law.
a) Hardlimit b) Hebbs c) Delta d) Correlation
2) Delta learning law is applicable only if the activation function is differentiable.
a) True b) False c) Can’t say d) None
3) In _________, group of input patterns corresponds to the same output
pattern.
a) Pattern Mapping b) Pattern Classification
c) Pattern Association d) None
4) MaxNet is Competitive Neural Network.
5) _________ neural network is used for Consonant Vowel Recognition.
a) Multilayer Perceptron b) Adaline
c) Time-delay neural networks d) None
P.T.O.
SLR-TX – 390 -2- *SLRTX390*
6) Competitive neural network is used for
a) Pattern Association b) Pattern Storage
c) Pattern Grouping d) None
7) There exists central control for processing information in brain as in
computer.
8) Which of the following model has ability to learn ?
a) McCulloch-pitts model
b) Perceptron model
c) Both Perceptron and McCulloch-Pitts model
d) None
9) __________ carry signal from one cell body to another cell body.
a) Dendrite b) Synapse c) Axon d) None
10) In Perceptron learning law, weight can be initialized to any random value.
11) Convolutional network is multilayer feedforward neural network.
12) Feedforward neural network is used for
a) Pattern Association b) Pattern Classification
c) Pattern Mapping d) All of these
13) In supervised learning, for given set of input target output is known.
14) In Hebbs law, weights are initialized to any random value.
____________

Set P
*SLRTX390* -3- SLR-TX – 390
Seat
No.
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
a) Describe Adaline Model.
b) Explain Widrow-Hoff learning law.
c) What is linear separability ? Explain with example.
d) Explain Perceptron learning law.
e) Describe McCulloch-Pitts Model.
f) Explain Hebb’s learning law.

1) Explain the working of Backpropagation algorithm in detail. Also derive
weight change rule for input to hidden weights and hidden to output weights.
2) Explain briefly the terms Cellbody, Axon, Synapse and Dendrite with
reference to Biological Neural Network.
3) Design and Train Perceptron Neural Network to recognize following pattern.
(Initialize learning rate eta = 0.3, Weights w1 = 0.2, w2 = 0.3, bias b = 0.1)
Input 1 Input 2 Output
1 1 0
1 0 0
0 1 1
0 0 0
Find number of Iterations/Epoch required to train the network and also
determine updated weight values.
Set P
SLR-TX – 390 -4- *SLRTX390*
SECTION – II

a) Explain Pattern Mapping.
b) Differentiate between Feedforward and Feedback Neural Network.
c) Explain the working of Hamming Neural Network.
d) Differentiate between Pattern Association and Pattern Classification.
e) Explain working of MaxNet Competitive Network.
f) Differentiate between Feedback and Competitive Neural Network.

a) Explain application of neural network in recognition of consonant vowel
segments.
b) Explain application of Hamming Network in Recognition of Olympic Game
Symbols.
c) Explain application of neural network NETTalk in conversion of text to
speech.
_______________
Set P
Seat
No. Set Q
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

b) Perceptron model
d) None
P.T.O.
SLR-TX – 390 -2- *SLRTX390*
pattern.
computer.
____________

Set Q
*SLRTX390* -3- SLR-TX – 390
Seat
No.
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1 1 0
1 0 0
0 1 1
0 0 0
Set Q
SLR-TX – 390 -4- *SLRTX390*
SECTION – II


segments.
Symbols.
speech.
_______________
Set Q
Seat
No. Set R
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

computer.
b) Perceptron model
d) None
P.T.O.
SLR-TX – 390 -2- *SLRTX390*
pattern.
____________

Set R
*SLRTX390* -3- SLR-TX – 390
Seat
No.
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1 1 0
1 0 0
0 1 1
0 0 0
Set R
SLR-TX – 390 -4- *SLRTX390*
SECTION – II


segments.
Symbols.
speech.
_______________
Set R
Seat
No. Set S
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Top of Page.

P.T.O.
SLR-TX – 390 -2- *SLRTX390*
pattern.
computer.
b) Perceptron model
d) None
____________

Set S
*SLRTX390* -3- SLR-TX – 390
Seat
No.
Examination, 2018

Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

1 1 0
1 0 0
0 1 1
0 0 0
Set S
SLR-TX – 390 -4- *SLRTX390*
SECTION – II


segments.
Symbols.
speech.
_______________
Set S

Seat
No. Set P
BIG DATA ANALYTICS (Elective – IV)
Time : 2.30 p.m. to 5.30 p.m.
3) Q. No. 1 is compulsory. It should be solved in first 30
carries one mark.
of Page.


1) _______ used to transmit data between web server and web application.
a) XML b) JSON
2) MS-Excels are under the category of _________ data.
a) Structured data b) Semi-structured data
c) Unstructured data d) None
3) Real time processing deals with __________ characteristic of data.
a) Variety b) Velocity
c) Variability d) Volume
4) The 3V’s term of big data was first introduced by
c) Carlo Strozzi d) Doug Cutting
5) _________ has no support for ACID properties.
a) SQL b) MySQL
c) NewSQL d) NoSQL
P.T.O.
SLR-TX – 391 -2- *SLRTX391*
6) A coordinated processing of a program by multiple processors, each working

on different part of the program and using its own operating system and
memory is called
a) In memory analysis b) Distributed system
c) Massively parallel processing d) Shared disk
7) Node manager is responsible for launching application
a) Resources b) Job c) Containers d) None
8) Which of the following format is supported by MongoDB ?
a) XML b) SQL
c) BSON d) All of the mentioned
9) Core MongoDB operation are
a) Create, Select, Update, Delete
b) Create, Read, Update, Delete
c) Create, Read, Update, Drop
d) None
10) Which of the following is correct command to update a document ?
a) db.books.update({item:’book”,qty:{$gt:7},{$set:{x:5},$inc:{y:8})
b) db.books.find( ).update({item:“book”,qty:{$gt:7},{$set:{x:5},$inc:{y:8})
c) db.books.update({item:’book”,qty:{$gt:7},{$set:{x:5},$inc:{y:8},{multi:true})
d) db.books.find( ).update({item:’book”,qty:{$gt:7},{$set:{x:5},$inc:{y:8},
{multi:true})
11) Which of the following is wide column store ?
a) MongoDB b) Cassandra c) Riak d) Redis
12) MetaStore contains _________ of Hive tables.
a) System catalog b) Drivers
c) Database d) CLI
13) The interactive mode of pig is
a) Pig Engine b) Grunt c) ETL d) Pig Latin
14) In Cassandra __________ is called peer to peer communication protocol
used for intra ring communications.
a) Anti-Entropy b) Gossip protocol
c) Hinted Handoffs d) All
______________
Set P
*SLRTX391* -3- SLR-TX – 391
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I

a) Explain unstructured data and its different sources.
b) What is big data ? Explain different characteristic of big data.
c) Write difference between NOSQL and NewSQL.
d) Explain Hoodoop 1.0 and Hadoop 2.0.
e) Explain massively parallel processing terminologies used in big data.

a) Explain high level architecture of Hadoop with its components.
b) Describe YARN architecture in detail.
c) What is big data analytics ? Explain classification of Big Data Analytics.
SECTION – II

1) Explain different CRUD operations in MongoDB.
2) List out features of Hive.
3) What is pig ? Explain its features.
Set P
SLR-TX – 391 -4- *SLRTX391*
4) Write MongoDB query for an objective given below.

Create a collection “food” and insert 5 documents into the food collection by
“_id” and “fruits” array. Check these documents are present in food collection.
Find that document from food collection where “grapes” is present in 2nd
index position of the fruit array.
5) Write difference between MongoDB and SQL.

1) Explain CRUD operations in Cassandra with example query.
2) What is MongoDB ? Explain Map reduce programming in MongoDB with
example.
3) What is pig philosophy ? Explain ETL processing in Pig.
____________
Set P

Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) XML b) SQL
d) None
{multi:true})
P.T.O.
SLR-TX – 391 -2- *SLRTX391*

c) Database d) CLI
a) XML b) JSON
a) SQL b) MySQL
c) NewSQL d) NoSQL
memory is called
______________
Set Q
*SLRTX391* -3- SLR-TX – 391
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


SECTION – II

Set Q
SLR-TX – 391 -4- *SLRTX391*


example.
____________
Set Q

Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) SQL b) MySQL c) NewSQL d) NoSQL
memory is called
a) XML b) SQL
d) None
P.T.O.
SLR-TX – 391 -2- *SLRTX391*

{multi:true})
c) Database d) CLI
a) XML b) JSON
______________
Set R
*SLRTX391* -3- SLR-TX – 391
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


SECTION – II

Set R
SLR-TX – 391 -4- *SLRTX391*


example.
____________
Set R

Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


{multi:true})
c) Database d) CLI
P.T.O.
SLR-TX – 391 -2- *SLRTX391*

a) XML b) JSON
a) Variety b) Velocity c) Variability d) Volume
a) SQL b) MySQL c) NewSQL d) NoSQL
memory is called
a) XML b) SQL
d) None
______________
Set S
*SLRTX391* -3- SLR-TX – 391
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.

SECTION – I


SECTION – II

Set S
SLR-TX – 391 -4- *SLRTX391*


example.
____________
Set S
Seat
No. Set P
mobile Computing (Old)
Time : 2.30 p.m. to 5.30 p.m.

30 minutes in Answer Book Page No. 3. Each question carries one
mark.

1) Characteristics of communication device is/are
a) Fixed and wired/wireless b) Mobile and wired/wireless
c) Options a and b d) None of the options
2) _________ configuration describes the typical desktop computer in an office.
a) Fixed and wired b) Mobile and wired
c) Fixed and wireless d) Mobile and wireless
3) _________ are typically used for directed microwave links and fixed satellite services.
a) Super high frequencies b) Infra red
c) Low frequency d) High frequency
4) Several directed antennas can be combined on a single pole to construct a ________ antenna.
a) Simple b) Directional c) Sectorized d) Diversity
5) Radio waves can exhibit _________ fundamental propagation behaviors depending on their
frequency.
a) Ground wave b) Sky wave
c) Line of sight d) All of the options
6) Multiplexing describes how several users can share a medium with ________ interference.
a) Minimum b) No
c) Either minimum or no d) None of the options
7) The task of multiplexing is to assign space, time, frequency and code to each communication
channel with a
a) Minimum of interference and a maximum of medium utilization
b) Maximum of interference and a maximum of medium utilization
c) Minimum of interference and a minimum of medium utilization
d) Maximum of interference and a minimum of medium utilization
P.T.O.
SLR-TX – 392 -2- *SLRTX392*
8) Advantage of TDMA is
a) Very simple, increases capacity per km2
b) Established, fully digital, very flexible
c) Simple established, robust
d) Flexible, less planning needed, soft handover
9) The idea of SDMA is
a) Segment space into cells/sectors
b) Segment sending time into disjoint time slots
c) Segment the frequency band into disjoint sub-bands
d) Spread the spectrum using orthogonal codes
10) The idea of FDMA is
11) Supplementary services offered by GSM is/are
a) Identification of call b) Redirection of call
c) Forwarding of call d) All of the options
12) Primary goal of IEEE 802.11 is/are
a) Simple WLAN b) Robust WLAN c) Option a and b d) None of the above
13) Elimination-yield non preemptive priority multiple access (EY-NPMA) divides the medium
access of different competing nodes into __________ phases.
a) Prioritization b) Contention c) Transmission d) None of the option
14) Elimination-yield non preemptive priority multiple access (EY-NPMA) has
a) Elimination phase b) Yield phase
c) Both elimination phase and yield phase d) None of these
15) ad-hoc piconets has
a) limited coverage b) no infrastructure c) option a and b d) none of the options
16) _________ is the mechanism of taking a packet consisting of packet header and data and
putting it into the data part of a new packet.
a) Decapsulation b) Encapsulation c) Tunneling d) None of the options
17) The optimized mobile IP protocol needs _________ messages.
a) Binding request/update b) Binding acknowledgement
c) Binding warning d) All of the options
18) In traditional TCP data transmission takes place using
a) network adaptors b) fiber optics c) copper wires d) all of the options
19) Advantages of M-TCP is/are
a) It maintains the TCP end to end semantics
b) If the MH is disconnected, it avoids useless retransmission
c) Since it does not buffer data in the SH as I-TCp does, it is not necessary to forward buffers
to a new SH
20) Advantages of indirect TCP is
a) Isolation of wireless link, simple
b) Transparent for end to end connection, MAC integration possible
c) Maintains end to end semantics, handles long term and frequent disconnections
d) Simple and efficient
____________
Set P
*SLRTX392* -3- SLR-TX – 392
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
Section – i
2. Solve any four questions : (4×5=20)
1) Write a note on follow on services and location aware services.
2) Explain any two applications of wireless communication.
3) With neat diagram, explain how modulation takes in a transmitter and demodulation in a receiver.
4) Explain Classical aloha and Slotted aloha.
5) Show four possible handover scenarios in GSM and explain each one
3. With neat diagram explain the following :
a) Advanced frequency shift keying.
b) Advanced phase shift keying.
OR
Write a note on following :
a) PRMA packet reservation multiple access.
b) Multiple access with collision avoidance. 10
4. Explain the algorithms used for security services in GSM. 10
Set P
SLR-TX – 392 -4- *SLRTX392*
Section – iI
1) With neat diagram explain Bluetooth scatternet.
2) Explain the three phases of elimination-yield non preemptive priority multiple access (EY-NPMA).
3) Explain the following entities that are used in Mobile IP. Mobile node, Correspondent node, Home
network, Foreign network and care of address.
4) What are the advantages of I-TCP ?
5) What are the advantages of Mobile TCP ?
6. With neat diagram explain the following architecture :
a) Architecture of an infrastructure based IEEE 802.11.
b) Architecture of IEEE 802.11 ad-hoc wireless LANs.
OR
With neat diagram explain the IEEE 802.11 protocol architecture bridging and management. 10
7. Explain the working mechanism and list the advantages and disadvantages of following approach :
Fast and selective retransmission and recovery, snooping TCP. 10
___________
Set P
Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.

mark.

to a new SH
P.T.O.
SLR-TX – 392 -2- *SLRTX392*
frequency.
a) Minimum b) No
channel with a
____________

Set Q
*SLRTX392* -3- SLR-TX – 392
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
Section – i
OR
Set Q
SLR-TX – 392 -4- *SLRTX392*
Section – iI
OR
___________
Set Q
Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.

mark.

to a new SH
P.T.O.
SLR-TX – 392 -2- *SLRTX392*
frequency.
a) Minimum b) No
channel with a
____________

Set R
*SLRTX392* -3- SLR-TX – 392
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
Section – i
OR
Set R
SLR-TX – 392 -4- *SLRTX392*
Section – iI
OR
___________
Set R
Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.

mark.

a) Minimum b) No
channel with a
P.T.O.
SLR-TX – 392 -2- *SLRTX392*
to a new SH
frequency.
____________

Set S
*SLRTX392* -3- SLR-TX – 392
Seat
No.
Time : 2.30 p.m. to 5.30 p.m.
Section – i
OR
Set S
SLR-TX – 392 -4- *SLRTX392*
Section – iI
OR
___________
Set S
Seat
No. Set P
B.E. (Computer Science and Engg.) (Part – II) Examination, 2018
data mining (elective – II) (Old)
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


1) In data mining output is precise.
a) True b) False
2) ___________ is an approach to handle missing data.
3) ___________ is unsupervised learning.
a) Classification b) Regression
4) Which of the following is a measure task in data preprocessing
a) Data reduction b) Classification
a) Transaction database b) Daily humidity
c) VLSI database d) Video data
6) _____________ is one of the method to handle noisy data.
a) Catching b) Crawling c) Binning d) None of the above
7) Full form of SPADE is ________________
a) Sequential Pattern Discovery using Equivalence classes
d) None
P.T.O.
SLR-TX – 393 -2- *SLRTX393*
8) In clustering class labels of training data are ____________
a) Known b) Unknown c) Predefined d) None of above
9) In classification by decision tree method root node contains __________
a) NULL b) Values c) Links d) None of above
10) Choosing the splitting attribute is required in classification by __________
method.
a) Decision tree b) K means
c) Nearest neighbor d) All of above
11) _______________ is a spatial database primitive.
12) Seasonal effects will be seen in __________ data.
a) Spatial b) Transaction item sets
c) Time series d) None of above
13) Dendrogram is a data structure used to solve _____________ problems.
a) Agglomerative clustering b) Classification
c) k-means d) Dendrogram
14) ______________ is an approach to index spatial data represented as
MBRs.
a) Quad Tree b) B-Tree c) R-Tree d) None of above
15) Stream data is a type of data which is _______________
a) Ordered b) Continuous
c) Changing and fast d) All the above
16) The “Then” – part of a rule is known as ______________
a) Rule Antecedent b) Rule Consequent
17) “Find all houses south to bus stand” is a __________ type of query.
a) Temporal b) Spatial c) Web Content d) None of these
18) Mining biochemical structure is an application of ____________
a) Time series analysis b) Image mining
c) Graph mining d) None of these
19) BIRCH algorithm is used for ______________
a) Clustering b) Classification
c) Association rule generation d) None of these
20) K-means clustering is a ___________ clustering method.
a) Partitional b) Sampling c) Hierarchical d) Categorical
___________________
Set P
*SLRTX393* -3- SLR-TX – 393
Seat
no.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I
2. Solve any four : (4�5=20)

a) Explain difference between database processing versus data mining
processing.
b) Why there is a need of data preprocessing ?
c) What are difficulties in data mining processing ?
d) What is difference between supervised and unsupervised learning ?
e) Describe any five data mining applications.
3. With neat diagram, explain KDD process in detail. 10

OR
Explain in detail how Bayesian classification is done ? Explain with example.
4. Explain KNN classification algorithm with example. 10
SECTION – II

a) What do you mean by web usage mining ? Explain.
b) Write a note on graph data mining.
Set P
SLR-TX – 393 -4- *SLRTX393*
c) Explain page rank and clever in detail.
d) Write a note on Web usage mining.
e) Explain K-means partitioning algorithm.
6. Explain frequent itemset mining using appriori algorithm with suitable example. 10
OR
Write in detail note on temporal data mining.
7. Write short notes on : 10

a) R-trees
b) Spatial data mining.
_____________________
Set P
Seat
No. Set Q
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


a) True b) False
P.T.O.
SLR-TX – 393 -2- *SLRTX393*
d) None
method.
MBRs.
___________________
Set Q
*SLRTX393* -3- SLR-TX – 393
Seat
no.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

processing.

OR
SECTION – II

Set Q
SLR-TX – 393 -4- *SLRTX393*
OR

a) R-trees
_____________________
Set Q
Seat
No. Set R
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


MBRs.
P.T.O.
SLR-TX – 393 -2- *SLRTX393*
a) True b) False
d) None
method.
___________________
Set R
*SLRTX393* -3- SLR-TX – 393
Seat
no.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

processing.

OR
SECTION – II

Set R
SLR-TX – 393 -4- *SLRTX393*
OR

a) R-trees
_____________________
Set R
Seat
No. Set S
Time : 2.30 p.m. to 5.30 p.m.
carries one mark.
of Page.


d) None
method.
P.T.O.
SLR-TX – 393 -2- *SLRTX393*
MBRs.
a) True b) False
___________________
Set S
*SLRTX393* -3- SLR-TX – 393
Seat
no.


Time : 2.30 p.m. to 5.30 p.m.
SECTION – I

processing.

OR
SECTION – II

Set S
SLR-TX – 393 -4- *SLRTX393*
OR

a) R-trees
_____________________
Set S
Seat
No.
Set P
B.E. (CSE) (Part – II) (Old) Examination, 2018

software testing and quality assurance (stqa) (Elective – II)
Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Page.


1) Following is one of the view of software quality
a) Product view b) Sales view
c) Consumer view d) Process view
2) SQC means
a) Software Quality Control b) Statistical Quality Control
c) Structural Quality Control d) None of these
3) ________ testing is called as functional testing technique.
a) White box b) Regression c) Black box d) System
4) Shewhart cycle is also called as _____ cycle.
a) Edward cycle b) Software life cycle
c) Juse cycle d) PDCA
5) Quality is design’s __________ attribute.
a) External b) Internal c) Implicit d) All
6) The code in the unit was reused with fewer than 25% modifications is called as
a) reused verbatim b) slightly modified
c) extensively modified d) new reused document
7) ________ are entities required by a process activity.
a) Products b) Facts c) Resources d) Designs
P.T.O.
SLR-TX – 394 -2- *SLRTX394*
8) ________ plots are constructed from three summary statistics the median,
the upper quartile and the lower quartile.
a) scatter b) control c) implicit d) box
9) The _________ addresses the sequence in which instructions are executed
in a program.
a) control structure b) data structure
c) data flow d) none of these
10) _______ complexity where the resource is computer memory.
a) Error b) Space c) Time d) Design
11) ________ data flow testing is performed by analyzing the source code and
it does not involve actual execution of source code.
a) Dynamic b) Linear c) Static d) Compound
12) A __________ error occurs when an input value causes the program to
execute the wrong path.
a) internal b) static c) system d) domain
13) A control flow graph is a detailed ________ representation of a program unit.
a) graphical b) analytical c) structural d) linear
14) Failure ________ is a measure of the reliability of a software system
operating in a given environment.
a) density b) intensity c) quantity d) none of these
15) Tabular representation is one of the _________ profile in software reliability.
a) reliable b) professional c) operational d) none of these
16) In _______ characteristics, a test engineer must be very attentive to the details.
a) competent b) considerate c) critical d) comprehensive
17) The _______ concerns the extent to which a product meets user needs and
expectations.
a) user view b) product view
c) value based view d) transcendental view
18) Maintainability quality factor falls into _________ quality category.
a) product transition b) product revision
c) product operation d) all
19) A Quality _________ is an attribute of a quality factor that is related to
software development.
a) component b) assurance c) criterion d) none of these
20) Quality factor represents a _________ characteristic of a system.
a) static b) dynamic c) linear d) behavioral
__________
Set P
*SLRTX394* -3- SLR-TX – 394
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
Section – I

1) Explain white-box testing in detail.
2) Explain objectives of testing with an example.
3) Describe software measurement validation.
4) Explain box plot and scatter plot simple analysis technique in software
measurement.
5) Explain software size and length in measurement of software engineering.
6) Which data structures are used in software engineering measurement ?
3. Define software quality. Also explain software quality revolution in detail. 10

OR
What are the different types of coupling and cohesion used in models of
modularity and information flow in software engineering measurement. 10
4. Write note on (any two) : 10

1) Test Levels
2) Overview of statistical test
3) Object oriented metrics.
Set P
SLR-TX – 394 -4- *SLRTX394*
Section – II

1) Explain concept of domain testing.
2) Explain five views of software quality in detail.
3) What are the different factors influencing software reliability ?
4) Explain acceptance testing in detail.
5) Explain the structure of software quality assurance group.
6) What are the six phases of recruiting test Engineer ?
6. Define software reliability and also explain applications of software reliability. 10

OR
Explain black box testing in detail. 10
7. Explain McCalls Quality Factors and Criteria in detail.

Also explain relationship between McCall’s quality factors and quality criteria. 10
___________
Set P
Seat
No.
Set Q

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Page.


expectations.
P.T.O.
SLR-TX – 394 -2- *SLRTX394*
7) SQC means
in a program.
__________
Set Q
*SLRTX394* -3- SLR-TX – 394
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
Section – I

measurement.

OR

1) Test Levels
Set Q
SLR-TX – 394 -4- *SLRTX394*
Section – II


OR

___________
Set Q
Seat
No.
Set R

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Page.


expectations.
P.T.O.
SLR-TX – 394 -2- *SLRTX394*
12) SQC means
in a program.
__________
Set R
*SLRTX394* -3- SLR-TX – 394
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
Section – I

measurement.

OR

1) Test Levels
Set R
SLR-TX – 394 -4- *SLRTX394*
Section – II


OR

___________
Set R
Seat
No.
Set S

Time : 2.30 p.m. to 5.30 p.m.

carries one mark.
Page.


in a program.
P.T.O.
SLR-TX – 394 -2- *SLRTX394*
expectations.
17) SQC means
__________
Set S
*SLRTX394* -3- SLR-TX – 394
Seat
No.

Time : 2.30 p.m. to 5.30 p.m.
Section – I

measurement.

OR

1) Test Levels
Set S
SLR-TX – 394 -4- *SLRTX394*
Section – II


OR

___________
Set S

Cseoct18 617 PDF

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Cseoct18 617 PDF

Caricato da

Copyright:

Formati disponibili

*SLRTX312*

Day and Date : Tuesday, 4-12-2018 Max. Marks : 70

N.B. : 1) Q. No. 1 is compulsory. It should be solved in first

MCQ/Objective Type Questions

Duration : 30 Minutes Marks : 14

1. Choose the correct answer : 14

2) The general solution of (D4 + 2D2 + 1) y = 0 is

Day and Date : Tuesday, 4-12-2018 Marks : 56

Instructions : 1) All questions are compulsory.

2. Solve any three of the following : 9

3. Solve any three of the following : 9

5. Attempt any three :

7. Attempt any two :

Day and Date : Tuesday, 4-12-2018 Max. Marks : 70

N.B. : 1) Q. No. 1 is compulsory. It should be solved in first

MCQ/Objective Type Questions

Duration : 30 Minutes Marks : 14

1. Choose the correct answer : 14

9) The general solution of (D4 + 2D2 + 1) y = 0 is

Day and Date : Tuesday, 4-12-2018 Marks : 56

Instructions : 1) All questions are compulsory.

2. Solve any three of the following : 9

3. Solve any three of the following : 9

5. Attempt any three :

7. Attempt any two :

Day and Date : Tuesday, 4-12-2018 Max. Marks : 70

N.B. : 1) Q. No. 1 is compulsory. It should be solved in first

MCQ/Objective Type Questions

Duration : 30 Minutes Marks : 14

1. Choose the correct answer : 14

6) The lines of regression are 10y = x + 17 and x = 5y – 7 the and are

12) The general solution of (D4 + 2D2 + 1) y = 0 is

Day and Date : Tuesday, 4-12-2018 Marks : 56

Instructions : 1) All questions are compulsory.

2. Solve any three of the following : 9

3. Solve any three of the following : 9

5. Attempt any three :

7. Attempt any two :

Day and Date : Tuesday, 4-12-2018 Max. Marks : 70

N.B. : 1) Q. No. 1 is compulsory. It should be solved in first

MCQ/Objective Type Questions

Duration : 30 Minutes Marks : 14

1. Choose the correct answer : 14

7) The general solution of (D4 + 2D2 + 1) y = 0 is

Day and Date : Tuesday, 4-12-2018 Marks : 56

Instructions : 1) All questions are compulsory.

2. Solve any three of the following : 9

3. Solve any three of the following : 9

5. Attempt any three :

7. Attempt any two :

Day and Date : Thursday, 6-12-2018 Max. Marks : 70

Note : 1) Q. No. 1 is compulsory. It should be solved in first

MCQ/Objective Type Questions

Duration : 30 Minutes Marks : 14

1. Choose the correct answer : (14�1=14)

Day and Date : Thursday, 6-12-2018 Marks : 56

Note : All questions are compulsory.

2. Answer the following (any 3) : (3�4=12)

3. Answer the following (any 1) : (1�8=8)

5. Answer the following (any 3) : (3�4=12)

6. Answer the following (any 1) : (1�8=8)

Day and Date : Thursday, 6-12-2018 Max. Marks : 70

Note : 1) Q. No. 1 is compulsory. It should be solved in first

SLRTX312