Total No. of Questions : 8] SEAT No.

8
-23
P649 [5869]-277
[Total No. of Pages : 3

tic
S.E. (Computer Engineering)

sta
DATA STRUCTURES AND ALGORITHMS

:47
(2019 Pattern) (Semester - II)

1
:26
6/2 309
08
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:

2
01
02
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
2) Neat diagrams must be drawn wherever necessary.
GP

3) Figures to the right indicate full marks.

3/0

4) Assume suitable data, if necessary.

CE
82

8
23
.23

ic-
16

Q1) a) Draw any directed graph with minimum 6 nodes and represent graph

tat
8.2

using adjacency matrix, adjacency list and adjacency multi list. [6]

7s
.24

6:4
91
b) Consider the graph represented by the following adjacency matrix : [6]
49

8:2
30

1 2 3 4 5 6
20

1 0 6 1 5 0 0
01
02

2 6 0 5 0 3 0
6/2
GP

3 1 5 0 5 6 4
3/0

4 5 0 5 0 0 2
CE
82

8
23
5 0 3 6 0 0 6
.23

6 0 0 4 2 6 0
ic-
16

tat
8.2

7s

Find minimum spanning tree of this graph using prim’s Algorithm.

.24

6:4
91
49

8:2

c) Write a short note on topological sorting. [6]

30
20
01
02
6/2
.23 GP

OR
3/0
E

Q2) a) Write non-recursive pseudo for Depth First Search (DFS). [6]
82
C

b) Consider the given graph and find the shortest path by using Dijkstra’s
16

algorithm. From source to all other nodes. [6]

8.2
.24
49

P.T.O.
 8
-23
tic
sta
:47
1
:26
6/2 309
08
c) Show BFS and DFS for the following graph with starting vertex as 1.

2
Explain with proper steps. [6]
01
02
GP
3/0
CE
82

8
23
.23

ic-
16

tat
8.2

7s
.24

6:4
91
Q3) a) Explain with example [6]
49

8:2
i) Red - Black Tree
30
20

ii) Splay Tree

01
02
6/2
GP

b) Construct AVL tree for following sequence of keys. [6]

3/0

1, 2, 3, 4, 8, 7, 6, 5, 11, 10
CE
82

8
23
.23

c) What is OBST in data structure? and what are advantages of OBST?[5]

ic-
16

tat
8.2

7s

OR
.24

6:4
91
49

8:2

Q4) a) Explain the following:

30
20

i) Static and dynamic tree tables with suitable example. [3]

01
02

ii) Dynamic programming with principle of optimality. [3]

6/2
.23 GP
3/0

b) Write short note on: [6]

E
82

i) AA tree
C

ii) K - dimensional tree

16
8.2

c) Explain AVL tree rotations with example. [5]

.24
49

[5869]-277 2
 8
-23
Q5) a) Construct B tree of order 5 for the following data: [6]

tic
78, 21, 14, 11, 97, 85, 74, 63, 45, 42, 57

sta
b) Explain B+ tree delection with example. [6]

:47
c) What is B+ tree? Give structure of it’s internal note. What is the difference

1
between B and B+ tree. [6]

:26
6/2 309
08
OR

2
01
02
GP

Q6) a) Build B+ tree of order 3 for the following

3/0

data:
CE
82

8
F, S, Q, K, C, L, H, T, V, W, M, R [6]

23
.23

ic-
b) Write an algorithm of B tree deletion. [6]
16

tat
c) Explain with example trie.tree. Give advantage and applications of trie
8.2

7s
tree. [6]
.24

6:4
91
49

8:2
30
20

Q7) a) Define sequential file organization. Give it’s advantages and disadvantages.
01

[6]
02
6/2

b) What is file? List different file opening modes in C++. Explain concept
GP

of inverted files. [6]

3/0
CE

c) Write short note on external sort. [5]

82

8
23
.23

OR ic-
16

tat
8.2

7s

Q8) a) A write a C++ program to create a file. Insert records into the file by
.24

6:4
91

opening file in append mode. Search for a specific record into file. [6]
49

8:2

b) Sort the following elements using two way merge sort with m = 3.
30
20

20, 47, 15, 8, 9, 4, 40, 30, 12, 17, 11, 56, 28, 35 [6]
01
02

c) Explain indexed sequential file organization. Compare it with direct access

6/2
.23 GP

file. [5]
3/0
E
82
C

 
16
8.2
.24
49

[5869]-277 3
Total No. of Questions: 8] SEAT No. :

8
-23
PA-1239 [5925]-261
[Total No. of Pages : 3

tic
S.E. (Computer Engineering)

sta
DATA STRUCTURES AND ALGORITHMS

:15
(2019 Pattern) (Semester-IV) (210252)

1
:46
1/2 309
13
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:

3
01
02
1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
2) Neat diagrams must be drawn wherever necessary.
GP

3) Figures to the right indicate full marks.

7/0

4) Assume suitable data, if necessary.

CE
80

8
23
Q1) a) Find minimum spanning tree of the following graph using kruskals
.23

ic-
algorithm. [6]
16

tat
8.2

5s
.24

6:1
91
49

3:4
30
31
01
02
1/2
GP
7/0
CE
80

8
23
.23

ic-
16

tat
8.2

5s
.24

6:1
91
49

3:4

b) Write algorithm for Breadth First Traversal of the graph. Also write its
30
31

complexity. [6]
01
02

c) Write Kruskal’s algorithm for minimum spanning trees and explain with
1/2
.23 GP

example. [6]
7/0
E
80
C

OR
16
8.2
.24
49

P.T.O.
Q2) a) Apply Prim’s Algorithm to construct Minimum Spanning Tree, for below

8
-23
drawn graph: Starting vertex is ‘a’. [6]

tic
sta
:15
1
:46
1/2 309
3 13
01
02
GP
7/0
CE
80

8
23
.23

ic-
16

tat
b) Develop pseudo code with one example to traverse a graph using BFS.
8.2

5s
[6]
.24

6:1
c) Find the shortest path from a to f, in the following graph using Dijkstra’s
91
49

Algorithm. [6]
3:4
30
31
01
02
1/2
GP
7/0
CE
80

8
23
.23

ic-
16

tat
8.2

5s
.24

6:1
91

Q3) a) What is OBST? List binary search tree with 3 words (w1, w2, w3) =
49

3:4

(do, if, stop) words occurs with probabilities (P1, P2, p3) = (0.4,0.5,0.1)
30
31

find expected access time in each case. [6]

01
02

b) Build AVL tree for given sequence of data. Show balance factor of all
1/2
.23 GP

nodes and name the rotation used for balancing the tree
7/0

40,60,80,50,45,47,44,42,75,46,41. [6]
E

c) Write short notes on: [5]

80
C

i) Red Black tree

ii) Splay tree
16
8.2

OR
.24
49

[5925]-261 2
Q4) a) Construct OBST for given data using dynamic programming approach.

8
-23
Explain stepwise. [6]
Index 0 1 2 3

tic
Data 10 20 30 40

sta
Frequency 4 2 6 3

:15
b) Demonstrate Deletion Operation in AVL with example. [6]

1
:46
c) Explain following terms w.r.t. height balance tree LL, RR, LR, RL. [5]

1/2 309
13
Q5) a) Construct B-tree of order 4 by inserting the following data one at a time.

3
01
20, 10, 30, 15, 12, 40, 50 [6]
b) 02
Write an algorithm to insert a node in B Tree. [6]
GP

c) Construct the B+ Tree of order 4 for the following data: 1, 4, 7, 10, 17,
7/0

21, 31, 25, 19, 20, 28, 42. [6]

CE
80

8
23
.23

OR

ic-
16

Q6) a) Build B+ tree of order 3 for the following:

tat
8.2

1, 42, 38, 21, 31, 10, 17, 7, 31, 25, 20, 18. [6]

5s
b) Write an algorithm to delete a node from B+tree. [6]
.24

6:1
91
c) Insert the keys to a 5-way B-tree:
49

3:4
3, 7, 9, 23, 45, 1, 5, 14, 25, 24, 13, 11, 08, 19, 04, 31, 35, 56 [6]
30
31

Q7) a) Write short notes on: [6]

01
02

i) Factors affecting the file organization

1/2
GP

ii) Indexed sequential files

7/0

iii) Indexing techniques

CE
80

8
b) Compare sequential indexed sequential and direct access files. [6]

23
.23

c) Explain any 4 modes of opening the file in C or C++. [5]

ic-
16

tat
OR
8.2

5s

Q8) a) Explain following operations carried out on sequential files. [6]

.24

6:1

i) Add
91
49

3:4

ii) Delete
30
31

iii) Search
b) Explain any 3 operations carried out on sequentail file and its pseudo
01
02

code. [6]
1/2
.23 GP

c) A file of employees records, has ‘employee no’ as primary key and the
7/0

‘department code’ and the ‘designation code’ as the secondary keys.

E
80

Write a procedure to answer the following query – ‘Which employees

C

from systems department are above designation level 4? [5]

16
8.2


.24
49

[5925]-261 3
Total No. of Questions : 9] SEAT No. :

8
-23
P657 [5869] - 286
[Total No. of Pages : 6

tic
S.E. (Computer/Information Technology)

sta
ENGINEERING MATHEMATICS - III

:51
(2019 Pattern ) (Semester - IV)

1
:23
6/2 309
08
Time : 2 ½Hours] [Max. Marks : 70
Instructions to the candidates:

2
01
02
1) Q.1 is compulsory.
2) Attempt Q2, or Q.3, Q4 or Q5, Q6 or Q7, Q8 or Q9.
GP

3) Neat diagrams must be drawn wherever necessary.

0/0

4) Figures to the right indicate full marks.

CE
82

5) Use of electronic pocket calculator is allowed.

8
23
6) Assume suitable data, if necessary.
.23

ic-
16

tat
8.2

1s
.24

3:5
Q1) Write the correct option for the following multiple choice questions.
91
49

8:2
a) For a given set of bivariate data, x  2, y   3 . The regression coefficient
30
20

of x on y is –0.11. By using the regression equation of x on y , the most

01
02

probable value of x when y=0 is ______. [2]

6/2
GP

i) 0.57 ii) 0.87

0/0

iii) 0.77 iv) 1.77

CE
82

8
23
.23

b) If Probability density function f(x) of a continuous random variable x is

ic-
16

defined by
tat
8.2

1s

1
 , 2  x  2
.24

3:5

f ( x)   4
91
49

8:2

 0,otherwise
30
20
01
02

then P  x  1
6/2

is ______. [2]
.23 GP
0/0

1 1
E

i) ii)
82

4 2
C

1 3
16

iii) iv)
3 4
8.2
.24
49

[5869] - 286 1
P.T.O.
 c) Lagrange’s polynomial through the points

8
-23
x 0 1 2

tic
y 4 0 6

sta
:51
is given by ________. [2]

1
:23
i) y = 5x2–3x+4 ii) y = 5x3+3x+4

6/2 309
08
iii) y = 5x2–9x+4 iv) y = x2–9x+4

2
01
02
GP
0/0

d) Using Gauss elimination method, the solution of system of equations

CE
82

8
23
1 1 15 9 5 19
.23

x y  z  1, y  z  3, y  z  3 is ______

ic-
[2]
4 4 4 4 4 4
16

tat
8.2

1s
1 1
x  1, y  2, z  3 x  , y  1, z 
.24

3:5
i) ii)
2 2
91
49

8:2
30

1 1 1
20

iii) x  2, y  , z  2 iv) x  1, y  , z  
01

2 2 2
02
6/2
GP
0/0

e) The first four central moments of a distribution are 0,16,–64 and 162.
CE
82

8
The coefficient of Kurtosis  is ______. [1]

23
.23

i)  ii) 0.6328

ic-
16

tat
8.2

iii) 1 iv) 0.3286

1s
.24

3:5
91
49

8:2

f) If f(x) is continuous on [a,b] and f(a)f(b)<0. then to find a root of f(x)=0,

30
20

initial approximation x0 by bisection method is ______ [1]

01
02

ab f (a)  f (b)

6/2

x0  x0 
.23 GP

i) ii)
2 2
0/0
E
82

ab ab
C

iii) x0  iv) x0 
2 ab
16
8.2
.24
49

[5869] - 286 2
Q2) a) If marks scored by five students in statistics test of 100 marks, are given

8
-23
in following table. [5]

tic
Student 1 2 3 4 5

sta
Marks(/100)x 46 34 52 78 65

:51
1
:23
Find standard deviation and arithmetic mean x .

6/2 309
08
b) Fit a law of the form y=ap+b by least square method for the data, [5]

2
01
02
p 100 120 140 160 180 200
GP

y 0.9 1.1 1.2 1.4 1.6 1.7

0/0
CE
82

c) If the two lines of regression are 9x+y–=0 and 4x+y= and the means

8
23
of x & y are 2 & –3 respectively. Find values of  and correlation
.23

ic-
coefficient between x & y. [5]
16

tat
8.2

1s
OR
.24

3:5
Q3) a) The first four moments of a distribution about 5 are 2,20,40 and 50. Find
91
49

8:2
first four moments about mean, and 1,2. [5]
30
20

b) Fit a parabola y=ax2 + bx + c, by using least square method to the

01
02

following data, [5]

6/2
GP

x 0 1 2 3
0/0
CE
82

y 2 2 4 8

8
23
.23

ic-
c) Calculate the coefficient of correlation from the following information,
16

tat
n=10,x=40,x2=190,y2=200,xy=150,y=40. [5]
8.2

1s
.24

3:5
91
49

8:2

Q4) a) Bag 1 contains 2 white and 3 red balls. Bag 2 contains 4 white and 5 red
30
20

balls. One ball is drawn randomly from bag 1 and is placed in bag2.
01
02

Later, one ball is drawn randomly from bag2. Find the probability that it
6/2

is red. [5]
.23 GP
0/0

b) The expected number of matches those will be won by India in a series

E
82

of five one day matches between India and England is three. If the
C

probability of India’s win in each match remains the same and the results
of all the five matches are independent of each other, find the probability
16

that India wins the series, using Binomial distribution. Assume that each
8.2

match ends with a result. [5]

.24
49

[5869] - 286 3
 c) The lifetime of an article has a normal distribution with mean 400 hours

8
-23
and standard deviation 50 hours. Find the expected number of articles
out of 2,000 whose lifetime lies between 335 hours to 465 hours.

tic
(Given : Z=1.3,A=0.4032) [5]

sta
:51
OR

1
:23
6/2 309
2 08
Q5) a) Find the expected value of the number of heads obtained when three fair
01
02
coins are tossed simultaneously. [5]
GP
0/0

b) On an average, 180 cars per hour pass a specified point on a particular

CE
82

road. Using Poisson distribution, find the probability that at least two

8
23
cars pass the point in any one minute. [5]
.23

ic-
16

tat
c) The proportions of blood types O,A,B and AB in the general population
8.2

1s
of a country are known to be in the ratio 49:38:9:4 respectively. A research
.24

3:5
team observed the frequencies of the blood types as 88,80,22 and 10
91
respectively in a community of that country. Test the hypothesis at 5%
49

8:2
level of significance that the proportions for this community are in
30
20

accordance with the general population of that country.

01
02

(Given : tab=7.815) [5]

6/2
GP
0/0
CE
82

8
Q6) a) Find the root of the equation x4+2x3–x–1=0, lying in the interval [0,1]

23
.23

using the bisection method at the end of fifth iteration. [5]

ic-
16

tat
b) Find a real root of the equation x3+2x–5=0 by applying Newton-Raphson
8.2

1s

method at the end of fifth iteration. [5]

.24

3:5
91
49

8:2

c) Solve by Gauss-Seidel method, the system of equations:

30
20

20x1 + x2 –2x3 = 17
01
02
6/2

3x1 + 20x2 –x3 = –18

.23 GP
0/0

2x1 – 3x2 + 20x3 =25

E

[5]
82
C

OR
16
8.2
.24
49

[5869] - 286 4
Q7) a) Solve by Gauss elimination method, the system of equations:

8
-23
2x1 + x2 +x3 = 10

tic
sta
3x1 + 2x2 +3x3 = 18

:51
x1 +4x2 + 9x3 =16 [5]

1
:23
6/2 309
08
b) Solve by Jacobi’s iteration method, the system of equations:

2
01
4x1 + 2x2 +x3 = 14
02
GP

x1 + 5x2 –x3 = 10
0/0
CE

x1 + x2 + 8x3 =20 [5]

82

8
23
.23

c) Use Regula-Falsi method to find a real root of the equation ex–4x=0

ic-
16

correct to three decimal places. [5]

tat
8.2

1s
.24

3:5
91
49

8:2
30
20

Q8) a) Using Newton’s forward interpolation formula, find y at x=8 from the
01
02

following data.
6/2
GP

x 0 5 10 15 20 25
0/0
CE

y 7 11 14 18 24 32
82

[5]

8
23
.23

ic-
1
dx
x
16

tat
b) Evaluate 2
1
8.2

1s

0
.24

3:5
91

rd
49

8:2

1
using Simpson’s rule. (Take h=0.2) [5]
30
20

3
01
02

dy
6/2

 x  y, y (0)  1
.23 GP

c) Use Euler’s method, to solve

dx
0/0
E
82

Tabulate values of y for x=0 to x=0.3 (Take h=0.1) [5]

C

OR
16
8.2
.24
49

[5869] - 286 5
Q9) a) Use Runge-Kutta method of 4th order, to solve

8
-23
tic
dy
 xy, y (1)  2 at x=1.2 with h=0.2. [5]

sta
dx

:51
1
b) Using Modified Euler’s method, find y(0.2),

:23
6/2 309
08
dy

2
 xy 2  0, y (0)  2 Take h=0.2 (Two iterations only)
01
given [5]
02
dx
GP
0/0

c) Using Newton’s backward difference formula, find the value of 155

CE
82

8
from the following data

23
.23

ic-
16

x 150 152 154 156

tat
8.2

1s
.24

3:5
y x 12.247 12.329 12.410 12.490 [5]
91
49

8:2
30
20
01
02
6/2
GP
0/0
CE
82

8
23
.23

ic-
16


tat
8.2

1s
.24

3:5
91
49

8:2
30
20
01
02
6/2
.23 GP
0/0
E
82
16
.24
C
8.2
49

[5869] - 286 6
Total No. of Questions : 9] SEAT No. :

8
-23
PA-1238 [Total No. of Pages : 7

tic
[5925]-260

sta
S.E. (Computer/I.T./AI&ML)

:03
ENGINEERING MATHEMATICS - III

1
:33
1/2 309
(2019 Pattern) (Semester - IV) (207003)

3 13
01
Time : 2½ Hours] 02 [Max. Marks : 70
GP

Instructions to the candidates:

6/0

1) Q.1 is compulsory.
CE
80

8
2) Attempt Q2 or Q3, Q4 or Q5, Q6 or Q7, Q8 or Q9.

23
.23

ic-
3) Neat diagrams must be drawn wherever necessary.
16

tat
4) Figures to the right indicate full marks.
8.2

3s
5) Use of electronic pocket calculator is allowed.
.24

3:0
6) Assume suitable data, if necessary.
91
49

3:3
30
31

Q1) Write the correct option for the following multiple choice questions :
01
02

i) y:123
1/2
GP

x:159
6/0
CE

The least square fit of the form x = ay + b to the above data is ________.
80

8
23
[2]
.23

a) x = 2y – 5 ic-
16

tat
8.2

3s

b) x = 4y + 4
.24

3:0

c) x = 4y + 1
91
49

3:3

d) x = 4y – 3
30
31

2 3 1
01
02

ii) For two events A and B, P (A ) = , P (B) = and P (A Ç B) = , then

1/2

3 8 4
.23 GP

the events A and B are __________. [2]

6/0
E
80

a) mutually exclusive and independent

C

b) not mutually exclusive and not independent

16

c) independent, but not mutually exclusive

8.2

d) mutually exclusive, but not independent

.24
49

P.T.O.
 iii) Using Gauss elimination method, the solution of system of equations

8
-23
5 7
x + 4 y - z = -5, y + z = and -13 y + 2 z = 19 is _________. [2]

tic
3 3

sta
:03
117 81 148
a) x= , y =- , z =

1
:33
71 71 71

1/2 309
13
71 71 71
x= , y =- , z =

3
b)
01
02
117 81 148
GP
6/0

117 81 148
c) x =- , y = , z =-
CE
80

71 71 71

8
23
.23

ic-
d) x = 1, y = 2, z = 0
16

tat
8.2

3s
1
x 0 1
.24

ò ydx =
3:0
iv) If Lagrange's polynomial passes through then
91
y 1 2
49

3:3
0
30

_________. [2]
31
01
02

2
1/2

a)
GP

3
6/0
CE
80

8
3

23
b)
.23

2
ic-
16

tat
8.2

1
3s

c)
.24

2
3:0
91
49

3:3

d) 3
30
31

If å xy = 2638, x = 14, y = 17, n = 10, then cov ( x, y ) = _________.

01
02

v)
1/2
.23 GP

[1]
6/0

a) 25.8
E
80
C

b) 23.9
16

c) 20.5
8.2

d) 24.2
.24
49

[5925]-260 2
 vi) If x0, x1 are two initial approximations to the root of f(x) = 0, by secant

8
-23
method the next approximation x2 is given by ________. [1]

tic
x0 + x1

sta
a) x2 =
2

:03
1
:33
f ( x1 )

1/2 309
13
b) x2 = x1 -
f 1 ( x1 )

3
01
02
GP

( x1 - x0 )
x2 = x1 -
6/0

c) f
( f1 - f 0 ) 1
CE
80

8
23
.23

ic-
( x1 + x0 )
16

x2 = x1 +

tat
d) f
( f1 + f 0 ) 1
8.2

3s
.24

3:0
91
49

3:3
30
31

Q2) a) The first four moments of a distribution about 4 are –1.4, 17, –30 and
01

108. Obtain the first four central moments and coefficient of skewness
02
1/2

& kurtosis. [5]

GP
6/0

b) Fit a linear curve of the type y = ax + b, to following data, [5]

CE
80

8
23
x 10
.23

15 20 25 30
ic-
16

tat
y 0.75 0.935 1.1 1.2 1.3
8.2

3s
.24

3:0

c) Find the correlation coefficient for the following data, [5]

91
49

3:3

Population density 200 500 400 700 800

30
31
01
02

Death rate 12 18 16 21 10
1/2
.23 GP

OR
6/0
E
80

Q3) a) Find coefficient of variability for following data, [5]

C

C.I. 0-10 10-20 20-30 30-40 40-50 50-60 60-70

16
8.2

Freq. (f) 4 7 8 12 25 18 10
.24
49

[5925]-260 3
 b) Fit a linear curve y = ax + b, by least square method to the data, [5]

8
-23
tic
x 100 120 140 160 180 200

sta
y 0.9 1.1 1.2 1.4 1.6 1.7

:03
1
:33
1/2 309
c) The regression equations are 8x – 10y + 66 = 0 and 40x – 18y = 214.

13
The value of variance of x is 9. Find [5]

3
01
02
GP

i) the mean values of x and y

6/0
CE
80

ii) the correlation x and y and

8
23
.23

ic-
iii) the standard deviation of y
16

tat
8.2

3s
.24

3:0
91
49

3:3
Q4) a) Three factories A, B and C produce light bulbs. 20%, 50% and 30% of
30
31

the bulbs are available in the market by factories A, B and C respectively.

01
02

Among these, 2%, 1% and 3% of the bulbs produced by factories A, B

1/2
GP
6/0

and C are defective. A bulb is selected at random in the market and

CE
80

8
found to be defective. Find the probability that this bulb was produced

23
.23

by factory B.
ic-
[5]
16

tat
8.2

3s

b) On an average, 20% of the computers in a firm are virus infected. If 10

.24

3:0

computers are chosen at random from this firm, find the probability that
91
49

3:3

at least one computer is virus infected, using Binomial distribution. [5]

30
31
01
02

c) The height of a student in a school follows a normal distribution with

1/2
.23 GP

mean 190 cm and variance 80 cm2. Among the 1,000 students from the
6/0

school, how many are expected to have height above 200 cm? [5]
E
80
C

(Given : z = 1.118, A = 0.3686)

16
8.2

OR
.24
49

[5925]-260 4
Q5) a) A die is tampered in such a way that the probability of observing an

8
-23
even number is twice as likely to observe an odd number. Find the

tic
expected value of the upper most face obtained after rolling the die.[5]

sta
:03
b) The number of industrial injuries per working week in a factory is known

1
:33
1/2 309
to follow a Poisson distribution with mean 0.5. Find the probability that

3 13
during a particular week, at least two accidents will take place. [5]
01
02
GP

c) A pea cultivating experiment was performed. 219 round yellow peas, 81

6/0
CE
80

round green peas, 61 wrinkled yellow peas and 31 wrinkled green peas

8
23
.23

were noted. Theory predicts that these phenotypes should be obtained

ic-
16

tat
in the ratios 9:3:3:1. Test the compatibility of the data with theory, using
8.2

3s
5% level of significance. (Given : ctab
2
= 7.815)
.24

[5]
3:0
91
49

3:3
30
31
01
02
1/2

Q6) a) Obtain the root of the equation x3 – 4x – 9 = 0 that lies between 2 and 3
GP
6/0

by Newton-Raphson method correct to four decimal places. [5]

CE
80

8
23
.23

b) Solve 2x – cosx – 3 = 0 by using the method of successive

ic-
16

tat
approximations correct of three decimal places. [5]
8.2

3s
.24

3:0

c) Solve by Gauss - Seidel method, the system of equations : [5]

91
49

3:3
30
31

2x1 + x2 + 6x3 = 9
01
02
1/2
.23 GP

8x1 + 3x2 + 2x3 = 13

6/0
E
80
C

x1 + 5x2 + x3 = 7
16

OR
8.2
.24
49

[5925]-260 5
Q7) a) Solve by Gauss elimination method, the system of equations : [5]

8
-23
tic
4x1 + x2 + x3 = 4

sta
x1 + 4x2 – 2x3 = 4

:03
1
:33
3x1 + 2x2 – 4x3 = 6

1/2 309
3 13
b) Solve by Jacobi's iteration method, the system of equations : [5]
01
02
GP

20x1 + x2 – 2x3 = 17
6/0
CE
80

3x1 + 20x2 – x3 = –18

8
23
.23

ic-
2x1 – 3x2 + 20x3 = 25
16

tat
8.2

3s
c) Find a real root of the equation x3 – 2x – 5 = 0 by the method of false
.24

3:0
91
position at the end of fifth iteration. [5]
49

3:3
30
31
01
02

Q8) a) Using Newton's backward difference formula, find y at x = 4.5 for the
1/2
GP

following data. [5]

6/0
CE

x 1 2 3 4 5
80

8
23
.23

y 3.47 6.92 11.25 16.75 22.94

ic-
16

tat
7
8.2

3s

b) th
Use Simpson's 3/8 rule, to estimate ò f ( x) dx from the following
.24

3:0

1
91
49

3:3

data. [5]
30
31

x 1 2 3 4 5 6 7
01
02

f(x) 81 75 80 83 78 70 60
1/2
.23 GP
6/0

dy
c) Use Euler's method to solve = x 2 + y, y (0) = 1. Tabulate values of
E
80

dx
C

y for x = 0 to x = 0.3. (Take h = 0.1) [5]

16

OR
8.2
.24
49

[5925]-260 6
 dy y - x

8
Q9) a) Use Runge-Kutta method of 4th order to solve = , y ( 0) = 1

-23
dx y + x

tic
at x = 0.2 with h = 0.2. [5]

sta
:03
dy
b) Using modified Euler's method, find y(1.1). Given = 2 + xy , y (1) = 1.

1
dx

:33
1/2 309
Take h = 0.1. (Two iterations only) [5]

3 13
Determine the value of y = 151, using Newton's forward difference formula,
01
02
c)
from the following data. [5]
GP
6/0

x 150 152 154 156

CE
80

8
23
y= x 12.247 12.329 12.410 12.490
.23

ic-
16

tat
8.2

3s

.24

3:0
91
49

3:3
30
31
01
02
1/2
GP
6/0
CE
80

8
23
.23

ic-
16

tat
8.2

3s
.24

3:0
91
49

3:3
30
31
01
02
1/2
.23 GP
6/0
E
80
16
.24
C
8.2
49

[5925]-260 7
Total No. of Questions : 8] SEAT No. :

8
-23
P650 [Total No. of Pages : 2

tic
sta
[5869]-279

:54
S.E. (Computer)

1
:30
MICROPROCESSOR

6/2 309
08
(2019 Pattern) (Semester - IV) (210254)

2
Time : 2½ Hours] [Max. Marks : 70
01
02
Instructions to the candidates:
GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

0/0

2) Neat diagrams must be drawn whenever necessary.

CE

3) Figures to the right side indicate full marks.

83

8
23
4) Assume suitable data if necessary.
.23

ic-
16

tat
Q1) a) With the help of a neat diagram, explain the Page Translation Process
8.2

4s
in 80386. [6]
.24

0:5
91
b) Draw and explain General Selector Format. [6]
49

8:3
30
20

c) What is a Logical address, Linear address and Physical address? [6]

01
02

OR
6/2
GP

Q2) a) Explain the use of following instructions in detail :

0/0

[6]
CE
83

8
i) SGDT ii) LIDT iii) SLDT

23
.23

b) Explain the Segment Translation Process with a neat diagram of 80386. ic-
16

tat
[6]
8.2

4s
.24

0:5

c) Enlist various types of system and non-system descriptors in the 80386.

91

Explain their use in brief. [6]

49

8:3
30
20
01
02

Q3) a) Write a short note on CPL, DPL, and RPL. [6]

6/2
.23 GP
0/0

b) Explore the role of various fields in Page Level Protection. [6]

E
83

c) List and explain various Privilege Instructions. [5]

C

OR
16
8.2
.24

P.T.O.
49
Q4) a) What is call gate? Explain how it is used in calling functions with higher

8
-23
privilege levels. [6]

tic
b) Define the functions of Type Checking and Limit Checking in protection.

sta
[6]

:54
c) Explain different levels of protection? State the rules of protection check.

1
:30
[5]

6/2 309
2 08
01
02
Q5) a) Explore the role of Task Register in multitasking and the instructions
GP

used to modify and read Task Register. [6]

0/0

b) Draw and Explain the Task State Segment of 80386. [6]

CE
83

8
23
c) Difference between Real Mode and Virtual 8086 Mode. [6]
.23

ic-
OR
16

tat
8.2

4s
Q6) a) Explain the TSS descriptor of 80386 with a neat diagram. [6]
.24

0:5
b) Explore memory management in the Virtual 8086 Mode. [6]
91
49

8:3
c) List and explain various features of virtual 8086 Mode. [6]
30
20
01
02
6/2

Q7) a) Explain the process of Enabling and Disabling Interrupts in 80386. [6]
GP
0/0

b) Differentiate and Explain the Interrupt gate and Trap gate descriptor. [6]
CE
83

8
23
c) Differentiate between Microprocessor and Microcontroller. [5]
.23

OR ic-
16

tat
8.2

4s

Q8) a) With the help of the necessary diagram, explain the structure of IDT in
.24

80386. [6]
0:5
91
49

8:3

b) Explain different types of exceptions in 80386 with suitable examples.

30

[6]
20
01
02

c) Draw and Explain the Architecture of a Typical Microcontroller. [5]

6/2
.23 GP
0/0
E
83


16
.24
C
8.2

[5869]-279 2
49
Total No. of Questions : 8] SEAT No. :

8
-23
PA-1240 [Total No. of Pages : 2

tic
[5925]-263

sta
S.E. (Computer)

:22
MICROPROCESSOR

1
:37
1/2 309
(2019 Pattern) (Semester - IV) (210254)

3 13
01
02
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
GP

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

0/0

2) Neat diagrams should be drawn wherever necessary.

CE
81

8
3) Use of Non-programmable Calculator is allowed.

23
.23

4) Assume suitable data if necessary.

ic-
16

tat
8.2

2s
Q1) a) Explain the Segment Translation Process with a neat diagram of 80386.[6]
.24

7:2
91
b) Differentiate and explain GDTR, LDTR, and IDTR. [6]
49

3:3
30

c) Demonstrate General Selector Format in brief. [6]

31
01
02

OR
1/2
GP

Q2) a) Demonstrate General Descriptor Format available in various descriptor

0/0

tables. [6]
CE
81

8
23
b) With the necessary diagram, explain the page translation process in 80386.[6]
.23

ic-
16

c) Explain the use of following instructions in detail: [6]

tat
8.2

2s

i) LGDT
.24

7:2
91

ii) SIDT
49

3:3
30
31

iii) LLDT
01
02
1/2
.23 GP

Q3) a) What is call gate? Explain how it is used in calling functions with higher
0/0

privilege levels. [6]

E
81
C

b) Explore five aspects of protection applied in segmentation. [6]

16

c) Explore the need for a protection mechanism in 80386. [5]

8.2

OR
.24

P.T.O.
49

[5925]-263 1
Q4) a) Explain the following terminologies. [6]

8
-23
i) CPL

tic
ii) DPL

sta
iii) RPL

:22
b) Explain different levels of protection. Describe the rules of protection

1
:37
1/2 309
check? [6]

13
c) Elaborate on the concept of combining segment protection and page

3
01
02
level protection in 80386. [5]
GP
0/0

Q5) a) Explore memory management in the Virtual 8086 Mode. [6]

CE
81

8
23
b) Explain the TSS descriptor of 80386 with a neat diagram. [6]
.23

ic-
c) Explore the role of Task Register in multitasking and the instructions
16

tat
used to modify and read Task Register. [6]
8.2

2s
.24

OR
7:2
91
49

3:3
Q6) a) Draw and explain the Task State Segment of 80386. [6]
30
31

b) With the necessary diagram, explain entering and leaving the virtual mode
01
02

of 80386. [6]
1/2
GP

c) Difference between Real Mode and Virtual 8086 Mode. [6]

0/0
CE
81

8
Q7) a) Explain the following exception conditions with an example: Faults, Traps,

23
.23

and Aborts. [6]

ic-
16

tat
b) With the help of the necessary diagram, explain the structure of IDT in
8.2

2s

80386. [6]
.24

7:2
91

c) List and elaborate on different applications of microcontrollers. [5]

49

3:3
30

OR
31
01
02

Q8) a) Differentiate and explain the Interrupt gate and Trap gate descriptor.[6]
1/2
.23 GP

b) How interrupts are handled in protection mode. Explain with the help of
0/0

a neat diagram. [6]

E
81
C

c) Differentiate between Microprocessor and Microcontroller. [5]

16

  
8.2
.24
49

[5925]-263 2
Total No. of Questions : 8] SEAT No. :

8
-23
P651 [Total No. of Pages : 2
[5869]-280

tic
sta
S.E. (Computer Engineering)

:34
PRINCIPLES OF PROGRAMMING LANGUAGES

1
:30
(2019 Pattern) (Semester - IV) (210255)

7/2 309
2 08
Time : 2½ Hours] [Max. Marks : 70
01
02
Instructions to the candidates:
GP

1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

4/0

2) Neat diagrams must be drawn wherever necessary.

CE
80

8
3) Assume suitable data if necessary.

23
.23

ic-
16

tat
Q1) a) Describe primitive data types. List the primitive data types in Java and
8.2

4s
their respective storage capacity. [6]
.24

0:3
b) Write short notes on Java Virtual Machine(JVM) with diagram. [6]
91
49

8:3
c) State the uses of the final keyword in Java? [6]
30

OR
20

Q2) a) Define String in Java. Explain following operations of class strings in

01
02

Java with example. [6]

7/2
GP

i) To find length of the string

4/0

ii) To compare two strings

CE
80

8
iii) To extract a character from a string

23
.23

iv) To concatenate two strings

ic-
16

b) Explain Java’s role in Internet. Justify the following features of Java. [6]
tat
8.2

i) Secure
4s

ii) Architectural Neutral

.24

0:3
91

iii) Distributed.
49

8:3

c) Summarize different access controls in Java. Explain the situation if you

30
20

remove static modifier from the main method. [6]

01
02
7/2
.23 GP

Q3) a) State the difference between character and byte stream in Java. Give any
4/0

two input and any two output classes for character streams. [6]
E
80
C

b) Describe Exception. Explain keywords try, catch, throw, throws and

finally related to exception handling. [6]
16

c) Define package and interfaces in Java? Explain it with suitable example.[5]

8.2

OR
.24

[5869]-280 P.T.O.
49

1
Q4) a) Define is inheritance. List the advantages of Inheritance. Explain Simple

8
-23
inheritance in java with example. [6]
b) Elaborate the significance of key word “Super” in Java. Demonstrate

tic
with example for Super keyword in Java constructor. [6]

sta
c) State the importance of finally blocks. Illustrate the ways finally block

:34
differ from finalize() method. [5]

1
:30
7/2 309
08
Q5) a) Interpret the terms multitasking and multiprocessing and multithreading
in Java with example. [6]

2
01
02
b) List the Features, advantages and limitations of Angular JS. [6]
c) Write the JavaScript code to create Login page Form. [6]
GP
4/0

OR
CE

Q6) a) Compare React JS and Angular JS and Vue JS. [6]

80

8
23
b) Elaborate the terms getPriority() and setPriority() methods with example.
.23

ic-
[6]
16

tat
c) Explain the uses of isAlive() and Join() methods in Java thread with
8.2

4s
example. [6]
.24

0:3
91
49

Q7) a) Describe Functional Programming. Enlist its features. Also list the
8:3
30

commonly used functional programming languages. [6]

20

b) Write sequences of CAR’s and CDR’s that will pick the atom pear our
01
02

of the following s-expression : [6]

7/2
GP

i) (apple orange pear grapes)

4/0

ii) ((apple orange) (pear grapes))

CE

iii) (((apple)(orange) (pear) (grapes)))

80

8
23
c) Explain the concept of “Structures” in Prolog with example. [5]
.23

OR
ic-
16

tat
Q8) a) Describe Logical Programming. Enlist its features. Also list the commonly
8.2

4s

used Logical programming languages. [6]

.24

0:3

b) Write a LISP program to find the factorial of n numbers using recursion

91
49

concept. [6]
8:3
30

c) Explain the following number predicates using suitable example. [5]

20

i) NUMBERP
01
02

ii) ZEROP
7/2
.23 GP

iii) PLUSP
4/0

iv) EVENP
E
80

v) ODDP
C


16
8.2
.24

[5869]-280
49

2
Total No. of Questions : 8] SEAT No. :

8
-23
PA-1241 [Total No. of Pages : 2

tic
[5925]-264

sta
S.E. (Computer Engineering)

:13
PRINCIPLES OF PROGRAMMING LANGUAGES

1
:34
(2019 Pattern) (Semester - IV) (210255)

1/2 309
3 13
Time : 2½ Hours] [Max. Marks : 70
01
02
Instructions to the candidates:
GP

1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

1/0

2) Neat diagrams must be drawn whenever necessary.

CE
81

3) Assume suitable data if necessary.

8
23
.23

ic-
16

Q1) a) Justify the meaning of each characteristic of Java in the statement “Java

tat
8.2

is simple, architecture neutral portable, interpreted and robust and secured

3s
programming language”. [6]
.24

4:1
91
b) Write a program in Java to perform the addition of two matrices
49

3:3
(multidimensional arrays) and set the diagonal elements of resultant matrix
30
31

to 0. [6]
01
02

c) Write a program in Java using switch-case statement to perform addition,

1/2
GP

subtraction, Multiplication and Division of given two numbers and print

1/0

the result. [6]

CE
81

8
OR

23
.23

Q2) a) Explain in brief below keywords with example in Java. [6]

ic-
16

tat
i) Final ii) Static iii) This
8.2

3s

b) Define Constructor. List its different types. Demonstrate with suitable

.24

4:1

example the different types of constructors used in Java. [6]

91
49

3:3

c) Write a program which receives n integers. Store the integers in an array.

30
31

Program outputs the number of odd and even numbers present in this
array. [6]
01
02
1/2
.23 GP
1/0

Q3) a) Define Inheritance and list the advantages. Explain the types of Inheritance
E

in Java with suitable Java code. [9]

81
C

b) Describe Exception. Write any two examples of exception. Explain

keywords try, catch, throw, throws and finally related to exception
16

handling. [8]
8.2

OR
.24
49

P.T.O.
Q4) a) Demonstrate the methods of creating packages and importing them in

8
-23
other java programs with example. Write about the access protection in
packages. [9]

tic
b) Explain abstract classes and polymorphism in Java with appropriate java

sta
codes. [8]

:13
1
:34
1/2 309
Q5) a) Write short notes on React JS. Enlist and explain the feature of it. [6]

13
b) Explain life cycle of Thread model in Java. [6]

3
01
02
c) State the term thread synchronization. Explain how to achieve thread
synchronization in Java. [6]
GP
1/0

OR
CE
81

8
Q6) a) List the features of JavaScript and write a JavaScript program to display

23
.23

Welcome message. [6]

ic-
16

b) Write short note angular JS. List its advantages and disadvantages. [6]

tat
8.2

3s
c) Differentiate Multiprocessing and Multi-threading. [6]
.24

4:1
91
49

3:3
Q7) a) Write a program to find the factorial of a given number using LISP. [6]
30
31

b) Evaluate the following forms of LISP. [5]

01
02

i) (car (cdr '(1 2 3 4 5)))

1/2
GP

ii) (car (cdr '(a(b c)d e)))

1/0

iii) (car (cdr(cdr '(1 2 3 4 5 6 7 8))))

CE
81

8
c) Explain the basic list manipulation in prolog. [6]

23
.23

ic-
OR
16

tat
Q8) a) Explain the following Equality predicates using suitable example. [6]
8.2

3s

i) EQUAL
.24

4:1
91

ii) EQ
49

3:3
30

iii) EQL
31

iv) =
01
02

b) Comparisons between functional programming and logic programming.[5]

1/2
.23 GP

c) Explain the phrases - “Term”, “Facts”, “Rule”, Goals” used in Prolog

1/0

with example. [6]

E
81
C


16
8.2
.24

[5925]-264
49

2
Total No. of Questions : 8] SEAT No. :

8
-23
P2297 [Total No. of Pages : 2

tic
[5869]-278

sta
S.E. (Computer Engineering)

:22
SOFTWARE ENGINEERING (210253)

1
:43
6/2 309
(2019 Pattern) (Semester - IV)

2 08
01
02
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
GP
7/0

1) Sovle Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

CE

2) Neat diagrams must be drawn wherever necessary.

82

8
23
3) Assume suitable data, if necessary.
.23

ic-
16

tat
8.2

2s
Q1) a) Design and discuss the project decomposition and work task
.24

3:2
communication process. [8]
91
49

8:4
b) Discuss any 2 of the following with suitable example: [10]
30
20

i) FP-Based Estimation
01

ii) Object Point (OP)-based estimation.

02
6/2

iii) Process-Based Estimation.

GP
7/0

OR
CE
82

Q2) a) Describe any two software size estimation techniques. [8]

8
23
b) Discuss any 2 of the following with suitable example: [10]
.23

i) Problem-Based Estimation ic-

16

tat
8.2

ii) LOC-Based Estimation

2s
.24

iii) Project Scheduling and basic principles of project scheduling.

3:2
91
49

8:4
30

Q3) a) List the design concepts. Explain refinement and refactoring. Give the
20

importance of Refactoring in improving the quality of software. [9]

01
02

b) List the different architectural styles. Explain any two in detail. [8]
6/2
.23 GP

OR
7/0

Q4) a) Enlist and explain Component level design steps in detail. [9]
E
82
C

b) Differentiate between followings. [8]

i) Cohesion and coupling in context of software design? How are
16

these useful for good design of a system?

8.2

ii) Abstraction and Refinement.

.24
49

P.T.O.
Q5) a) Explain Risk identification process? What are the different categories

8
-23
of risks? [8]
b) Write Short Note: [10]

tic
sta
i) Layers of SCM Process

:22
ii) RMMM Plan

1
:43
OR

6/2 309
08
Q6) a) Explain Risk Projection and Risk Refinement in detail. [8]

2
01
02
b) Explain the change control mechanism in SCM. [10]
GP
7/0

Q7) a) Explain STLC (Software Testing Life Cycle).

CE

[7]
82

8
23
.23

b) Explain the following: [10]

ic-
16

i) Unit testing and integration testing.

tat
8.2

2s
ii) White box testing and black box testing.
.24

3:2
OR
91
49

8:4
Q8) a) Explain phases in Verification and Validation model with suitable
30
20

diagram. [7]
01
02

b) Discuss any 2 of the following in detail. [10]

6/2
GP

i) Acceptance Testing
7/0

ii) Tools for Automated Testing and feature.

CE
82

8
23
iii) Defect Life Cycle.
.23

ic-
16

tat

8.2

2s
.24

3:2
91
49

8:4
30
20
01
02
6/2
.23 GP
7/0
E
82
.24
16
8.2 C
49

[5869]-278 2
Total No. of Questions : 8] SEAT No. :

8
-23
PA-2628 [Total No. of Pages : 2

tic
sta
[5925]-262

:20
S.E. (Computer/AI&DS)

1
:39
Software Engineering

1/2 309
13
(2019 Pattern) (Semester - IV) (210253)

3
01
02
Time : 2½ Hours] [Max. Marks : 70
GP

Instructions to the candidates:

9/0

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8

CE
80

8
2) Neat diagrams must be drawn wherever necessary.

23
.23

3) Assume suitable data if necessary.

ic-
16

tat
8.2

0s
Q1) a) Explain object oriented view of component level design with suitable
.24

9:2
example. [6]
91
49

3:3
b) Explain FP based estimation technique? [6]
30
31

c) What is project scheduling? What are the basic principles of project

01
02

scheduling? [6]
1/2

OR
GP
9/0

Q2) a) Explain COCOMO Model for project estimation with suitable example.
CE

[9]
80

8
23
b) How LOC and FP used during project Estimation? Explain both Estimation
.23

techniques with suitable example. [9]

ic-
16

tat
8.2

0s

Q3) a) Explain guidelines for component level design. [6]

.24

9:2
91

b) Enlist the golden rules of User Interface Design. [6]

49

3:3

c) Explain layered system architecture with neat diagram. [5]

30
31

OR
01
02

Q4) a) Describe notations used for deployment diagram. Describe the importance
1/2
.23 GP

of Deployment diagram. [9]

9/0

b) Explain the following architectural styles with merits/demerits : [8]

E
80

i) Data-centered Architecture
C

ii) Data-flow architecture

16
8.2
.24

P.T.O.
49
Q5) a) What is Risk Identification? What are different categories of Risk? [6]

8
-23
b) Define software Risk in detail. What are different types of Software

tic
Risk? [6]

sta
c) What are the advantages of SCM Repository? Explain functions performed

:20
by SCM Repository. [6]

1
OR

:39
1/2 309
Q6) a) What is Software Configuration Management (SCM) [9]

13
b) What is RMMM? Write short note on it? [9]

3
01
02
GP

Q7) a) What are difference between white box testing and black box testing.
9/0

[6]
CE
80

8
b) Explain the software testing life cycle in detail. [6]

23
.23

c) Explain bottom-up testing with its advantages. [5]

ic-
16

tat
OR
8.2

0s
Q8) a) What is system testing? Explain any three types system testing. [9]
.24

9:2
b) Write note on Alpha and Beta Testing. [8]
91
49

3:3
30
31
01
02
1/2
GP


9/0
CE
80

8
23
.23

ic-
16

tat
8.2

0s
.24

9:2
91
49

3:3
30
31
01
02
1/2
.23 GP
9/0
E
80
16
.24
C
8.2

[5925]-262 2
49