Total No. of Questions : 9] SEAT No.

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

S.E. (Computer/Information Technology)

ENGINEERING MATHEMATICS - III
(2019 Pattern ) (Semester - IV)
Time : 2 ½Hours] [Max. Marks : 70
Instructions to the candidates:
1) Q.1 is compulsory.
2) Attempt Q2, or Q.3, Q4 or Q5, Q6 or Q7, Q8 or Q9.
3) Neat diagrams must be drawn wherever necessary.
4) Figures to the right indicate full marks.
5) Use of electronic pocket calculator is allowed.
6) Assume suitable data, if necessary.

Q1) Write the correct option for the following multiple choice questions.
a) For a given set of bivariate data, x  2, y   3 . The regression coefficient
of x on y is –0.11. By using the regression equation of x on y , the most
probable value of x when y=0 is ______. [2]
i) 0.57 ii) 0.87
iii) 0.77 iv) 1.77

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

defined by

1
 , 2  x  2
f ( x)   4
 0,otherwise

then P  x  1 is ______. [2]

1 1
i) ii)
4 2
1 3
iii) iv)
3 4

[5869] - 286 1
P.T.O.
 c) Lagrange’s polynomial through the points
x 0 1 2
y 4 0 6
is given by ________. [2]
i) y = 5x2–3x+4 ii) y = 5x3+3x+4
iii) y = 5x2–9x+4 iv) y = x2–9x+4

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

1 1 15 9 5 19
x y  z  1, y  z  3, y  z  3 is ______ [2]
4 4 4 4 4 4

1 1
i) x  1, y  2, z  3 ii) x  , y  1, z 
2 2

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

e) The first four central moments of a distribution are 0,16,–64 and 162.
The coefficient of Kurtosis  is ______. [1]
i)  ii) 0.6328
iii) 1 iv) 0.3286

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

initial approximation x0 by bisection method is ______ [1]

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

i) x0  ii) x0 
2 2

ab ab
iii) x0  iv) x0 
2 ab

[5869] - 286 2
Q2) a) If marks scored by five students in statistics test of 100 marks, are given
in following table. [5]
Student 1 2 3 4 5
Marks(/100)x 46 34 52 78 65
Find standard deviation and arithmetic mean x .
b) Fit a law of the form y=ap+b by least square method for the data, [5]
p 100 120 140 160 180 200
y 0.9 1.1 1.2 1.4 1.6 1.7
c) If the two lines of regression are 9x+y–=0 and 4x+y= and the means
of x & y are 2 & –3 respectively. Find values of  and correlation
coefficient between x & y. [5]
OR
Q3) a) The first four moments of a distribution about 5 are 2,20,40 and 50. Find
first four moments about mean, and 1,2. [5]
b) Fit a parabola y=ax2 + bx + c, by using least square method to the
following data, [5]
x 0 1 2 3
y 2 2 4 8
c) Calculate the coefficient of correlation from the following information,
n=10,x=40,x2=190,y2=200,xy=150,y=40. [5]

Q4) a) Bag 1 contains 2 white and 3 red balls. Bag 2 contains 4 white and 5 red
balls. One ball is drawn randomly from bag 1 and is placed in bag2.
Later, one ball is drawn randomly from bag2. Find the probability that it
is red. [5]
b) The expected number of matches those will be won by India in a series
of five one day matches between India and England is three. If the
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
that India wins the series, using Binomial distribution. Assume that each
match ends with a result. [5]

[5869] - 286 3
 c) The lifetime of an article has a normal distribution with mean 400 hours
and standard deviation 50 hours. Find the expected number of articles
out of 2,000 whose lifetime lies between 335 hours to 465 hours.
(Given : Z=1.3,A=0.4032) [5]

OR

Q5) a) Find the expected value of the number of heads obtained when three fair
coins are tossed simultaneously. [5]

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

road. Using Poisson distribution, find the probability that at least two
cars pass the point in any one minute. [5]

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

of a country are known to be in the ratio 49:38:9:4 respectively. A research
team observed the frequencies of the blood types as 88,80,22 and 10
respectively in a community of that country. Test the hypothesis at 5%
level of significance that the proportions for this community are in
accordance with the general population of that country.
(Given : tab=7.815) [5]

Q6) a) Find the root of the equation x4+2x3–x–1=0, lying in the interval [0,1]
using the bisection method at the end of fifth iteration. [5]

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

method at the end of fifth iteration. [5]

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

20x1 + x2 –2x3 = 17

3x1 + 20x2 –x3 = –18

2x1 – 3x2 + 20x3 =25 [5]

OR

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

2x1 + x2 +x3 = 10

3x1 + 2x2 +3x3 = 18

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

b) Solve by Jacobi’s iteration method, the system of equations:

4x1 + 2x2 +x3 = 14

x1 + 5x2 –x3 = 10
x1 + x2 + 8x3 =20 [5]

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

correct to three decimal places. [5]

Q8) a) Using Newton’s forward interpolation formula, find y at x=8 from the
following data.

x 0 5 10 15 20 25

y 7 11 14 18 24 32 [5]

1
dx
b) Evaluate x
0
2
1

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

dy
c) Use Euler’s method, to solve  x  y, y (0)  1
dx

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

OR

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

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

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

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

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

from the following data

x 150 152 154 156

y x 12.247 12.329 12.410 12.490 [5]



[5869] - 286 6
Total No. of Questions : 8] SEAT No. :
P649 [5869]-277
[Total No. of Pages : 3

S.E. (Computer Engineering)

DATA STRUCTURES AND ALGORITHMS
(2019 Pattern) (Semester - II)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
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.
3) Figures to the right indicate full marks.
4) Assume suitable data, if necessary.

Q1) a) Draw any directed graph with minimum 6 nodes and represent graph
using adjacency matrix, adjacency list and adjacency multi list. [6]

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

1 2 3 4 5 6
1 0 6 1 5 0 0
2 6 0 5 0 3 0
3 1 5 0 5 6 4
4 5 0 5 0 0 2
5 0 3 6 0 0 6
6 0 0 4 2 6 0

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

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

OR

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

b) Consider the given graph and find the shortest path by using Dijkstra’s
algorithm. From source to all other nodes. [6]

P.T.O.
 c) Show BFS and DFS for the following graph with starting vertex as 1.
Explain with proper steps. [6]

Q3) a) Explain with example [6]

i) Red - Black Tree
ii) Splay Tree

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

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

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

OR

Q4) a) Explain the following:

i) Static and dynamic tree tables with suitable example. [3]
ii) Dynamic programming with principle of optimality. [3]

b) Write short note on: [6]

i) AA tree
ii) K - dimensional tree

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

[5869]-277 2
Q5) a) Construct B tree of order 5 for the following data: [6]
78, 21, 14, 11, 97, 85, 74, 63, 45, 42, 57
b) Explain B+ tree delection with example. [6]
c) What is B+ tree? Give structure of it’s internal note. What is the difference
between B and B+ tree. [6]

OR

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

data:
F, S, Q, K, C, L, H, T, V, W, M, R [6]
b) Write an algorithm of B tree deletion. [6]
c) Explain with example trie.tree. Give advantage and applications of trie
tree. [6]

Q7) a) Define sequential file organization. Give it’s advantages and disadvantages.
[6]
b) What is file? List different file opening modes in C++. Explain concept
of inverted files. [6]
c) Write short note on external sort. [5]

OR

Q8) a) A write a C++ program to create a file. Insert records into the file by
opening file in append mode. Search for a specific record into file. [6]
b) Sort the following elements using two way merge sort with m = 3.
20, 47, 15, 8, 9, 4, 40, 30, 12, 17, 11, 56, 28, 35 [6]
c) Explain indexed sequential file organization. Compare it with direct access
file. [5]

 

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

P2297 [Total No. of Pages : 2

[5869]-278
S.E. (Computer Engineering)
SOFTWARE ENGINEERING (210253)
(2019 Pattern) (Semester - IV)

Time : 2½ Hours] [Max. Marks : 70

Instructions to the candidates:
1) Sovle 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.
3) Assume suitable data, if necessary.

Q1) a) Design and discuss the project decomposition and work task
communication process. [8]
b) Discuss any 2 of the following with suitable example: [10]
i) FP-Based Estimation
ii) Object Point (OP)-based estimation.
iii) Process-Based Estimation.
OR
Q2) a) Describe any two software size estimation techniques. [8]
b) Discuss any 2 of the following with suitable example: [10]
i) Problem-Based Estimation
ii) LOC-Based Estimation
iii) Project Scheduling and basic principles of project scheduling.

Q3) a) List the design concepts. Explain refinement and refactoring. Give the
importance of Refactoring in improving the quality of software. [9]
b) List the different architectural styles. Explain any two in detail. [8]
OR
Q4) a) Enlist and explain Component level design steps in detail. [9]
b) Differentiate between followings. [8]
i) Cohesion and coupling in context of software design? How are
these useful for good design of a system?
ii) Abstraction and Refinement.

P.T.O.
Q5) a) Explain Risk identification process? What are the different categories
of risks? [8]
b) Write Short Note: [10]
i) Layers of SCM Process
ii) RMMM Plan
OR
Q6) a) Explain Risk Projection and Risk Refinement in detail. [8]
b) Explain the change control mechanism in SCM. [10]

Q7) a) Explain STLC (Software Testing Life Cycle). [7]

b) Explain the following: [10]
i) Unit testing and integration testing.
ii) White box testing and black box testing.
OR
Q8) a) Explain phases in Verification and Validation model with suitable
diagram. [7]
b) Discuss any 2 of the following in detail. [10]
i) Acceptance Testing
ii) Tools for Automated Testing and feature.
iii) Defect Life Cycle.



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

P650 [Total No. of Pages : 2

[5869]-279
S.E. (Computer)
MICROPROCESSOR
(2019 Pattern) (Semester - IV) (210254)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
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 whenever necessary.
3) Figures to the right side indicate full marks.
4) Assume suitable data if necessary.

Q1) a) With the help of a neat diagram, explain the Page Translation Process
in 80386. [6]

b) Draw and explain General Selector Format. [6]

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

OR

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

i) SGDT ii) LIDT iii) SLDT

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

[6]

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

Explain their use in brief. [6]

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

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

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

OR

P.T.O.
Q4) a) What is call gate? Explain how it is used in calling functions with higher
privilege levels. [6]
b) Define the functions of Type Checking and Limit Checking in protection.
[6]
c) Explain different levels of protection? State the rules of protection check.
[5]

Q5) a) Explore the role of Task Register in multitasking and the instructions
used to modify and read Task Register. [6]
b) Draw and Explain the Task State Segment of 80386. [6]
c) Difference between Real Mode and Virtual 8086 Mode. [6]
OR
Q6) a) Explain the TSS descriptor of 80386 with a neat diagram. [6]
b) Explore memory management in the Virtual 8086 Mode. [6]
c) List and explain various features of virtual 8086 Mode. [6]

Q7) a) Explain the process of Enabling and Disabling Interrupts in 80386. [6]
b) Differentiate and Explain the Interrupt gate and Trap gate descriptor. [6]
c) Differentiate between Microprocessor and Microcontroller. [5]
OR
Q8) a) With the help of the necessary diagram, explain the structure of IDT in
80386. [6]
b) Explain different types of exceptions in 80386 with suitable examples.
[6]
c) Draw and Explain the Architecture of a Typical Microcontroller. [5]



[5869]-279 2
Total No. of Questions : 8] SEAT No. :
P651 [Total No. of Pages : 2
[5869]-280
S.E. (Computer Engineering)
PRINCIPLES OF PROGRAMMING LANGUAGES
(2019 Pattern) (Semester - IV) (210255)

Time : 2½ Hours] [Max. Marks : 70

Instructions to the candidates:
1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
2) Neat diagrams must be drawn wherever necessary.
3) Assume suitable data if necessary.

Q1) a) Describe primitive data types. List the primitive data types in Java and
their respective storage capacity. [6]
b) Write short notes on Java Virtual Machine(JVM) with diagram. [6]
c) State the uses of the final keyword in Java? [6]
OR
Q2) a) Define String in Java. Explain following operations of class strings in
Java with example. [6]
i) To find length of the string
ii) To compare two strings
iii) To extract a character from a string
iv) To concatenate two strings
b) Explain Java’s role in Internet. Justify the following features of Java. [6]
i) Secure
ii) Architectural Neutral
iii) Distributed.
c) Summarize different access controls in Java. Explain the situation if you
remove static modifier from the main method. [6]

Q3) a) State the difference between character and byte stream in Java. Give any
two input and any two output classes for character streams. [6]

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

finally related to exception handling. [6]
c) Define package and interfaces in Java? Explain it with suitable example.[5]
OR
[5869]-280 1 P.T.O.
Q4) a) Define is inheritance. List the advantages of Inheritance. Explain Simple
inheritance in java with example. [6]
b) Elaborate the significance of key word “Super” in Java. Demonstrate
with example for Super keyword in Java constructor. [6]
c) State the importance of finally blocks. Illustrate the ways finally block
differ from finalize() method. [5]

Q5) a) Interpret the terms multitasking and multiprocessing and multithreading

in Java with example. [6]
b) List the Features, advantages and limitations of Angular JS. [6]
c) Write the JavaScript code to create Login page Form. [6]
OR
Q6) a) Compare React JS and Angular JS and Vue JS. [6]
b) Elaborate the terms getPriority() and setPriority() methods with example.
[6]
c) Explain the uses of isAlive() and Join() methods in Java thread with
example. [6]

Q7) a) Describe Functional Programming. Enlist its features. Also list the
commonly used functional programming languages. [6]
b) Write sequences of CAR’s and CDR’s that will pick the atom pear our
of the following s-expression : [6]
i) (apple orange pear grapes)
ii) ((apple orange) (pear grapes))
iii) (((apple)(orange) (pear) (grapes)))
c) Explain the concept of “Structures” in Prolog with example. [5]
OR
Q8) a) Describe Logical Programming. Enlist its features. Also list the commonly
used Logical programming languages. [6]
b) Write a LISP program to find the factorial of n numbers using recursion
concept. [6]
c) Explain the following number predicates using suitable example. [5]
i) NUMBERP
ii) ZEROP
iii) PLUSP
iv) EVENP
v) ODDP



[5869]-280 2