Total No. of Questions : 5] SEAT No.

P-1294 [Total No. of Pages : 2

[6055]-201
S.Y. B.Sc. (Semester - IV)
COMPUTER SCIENCE
CS 241 : Data Structures and Algorithms - II
(2019 Pattern) (CBCS) (24121)

Time : 2 Hours] [Max. Marks : 35

Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn whenever necessary.
4) Your answers will be value as whole.

Q1) Attempt any eight of the following : [8 × 1 = 8]

a) Define min heap.
b) What is level order traversal?
c) What is descendant in tree?
d) In B+ tree data can only be stored in leaf node. State true or false.
e) List AVL tree Rotations.
f) List any two minimum spanning tree algorithms.
g) "DFS uses queue implementation". State true or false.
h) What is weighted graph?
i) What is load factor?
j) What is hashing?

Q2) Attempt any four of the following : [4 × 2 = 8]

a) Write a note on minimum spanning tree.
b) Write a note on splay tree.
c) Give any two differences between DFs & BFs.
d) Explain any two properties of good hash function.
e) Write a note on B tree.

P.T.O.
Q3) Attempt any two of the following : [2 × 4 = 8]
a) Write a 'C' function to calculate
i) leaf nodes
ii) non leaf nodes
b) Write a program that accepts adjacency matrix and print indegree and
outdegree of each vertex.
c) Write a program to insert new element in hash table.

Q4) Attempt any two of the following : [2 × 4 = 8]

a) Construct Red Black Tree for 2, 10, 7, 20, 30, 25, 50.
b) Consider following adjacency matrix

1 1 1 0
0 1 1 0
 
1 0 1 1
 
0 0 0 1

i) Draw the graph

ii) Give adjacency list
c) Construct minimum spanning tree using Kruskal's algorithm.

Q5) Attempt any one of the following : [1 × 3 = 3]

a) Define the following terms :
i) Terminal node
ii) depth of node
iii) root node
b) Give inorder, preorder and postorder traversal for :


[6055]-201 2
Total No. of Questions : 5] SEAT No. :
P1295 [Total No. of Pages : 2
[6055]-202
S.Y.B.Sc. (Computer Science)
CS-242 : COMPUTER NETWORKS - I
(2019 Pattern) (Semester - IV) (24122)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Neat diagram must be drawn if necessary.

Q1) Attempt any EIGHT of the following (out of TEN). [8×1=8]

a) Define Bandwidth.
b) What is throughput?
c) What is Jitter?
d) List the control access protocols.
e) Define packetizing.
f) Write IPv6 address space.
g) List UDP services.
h) Write the list of states for TcP.
i) What is full duplex communication?
j) Write the registered ports.

Q2) Attempt any Four of the following (out of FIVE). [4×2=8]

a) Write a note on BSS.
b) What are the different layers in the TCP/IP reference model?
c) Write the netid & host ID of IP address: 117. 149. 29.4.
d) What are the two sub layers of data link layer?
e) Write the different control bits or flags in control field of TCP segment.

P.T.O.
Q3) Attempt any TWO of the following (out of THREE). [2×4=8]
a) What is the propagation time for a 2.5 Kbyte message if the bandwidth of
the network is 1 Gbps? Assume that the distance between the sender and
the receiver is 12,000 km and that light travels at 2.4×108 m/s.
b) Write the some important design issues of the data link layer.
c) What are the main properties of routing?

Q4) Attempt any TWO of the following (out of THREE). [2×4=8]

a) Write the difference between TCP & UDP.
b) Explain sliding window in TCP.
c) Write the base header format of IPv6.

Q5) Attempt any ONE of the following (out of TWO). [1×3=3]

a) Describe bus topology in detail.
b) Write the difference between IPv4 and IPv6.

  

[6055]-202 2
Total No. of Questions :3] SEAT No. :

P1296 [Total No. of Pages : 3

[6055]-203
S.Y. B.Sc.(Computer Science)
MATHEMATICS (Paper-I)
MTC-241: Computational Geometry
(2019 Pattern) (Semester - IV) (24221)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) All questions are compulsory.
2) Figures to the right indicate full marks.
3) Non-Programmable scientific calculator is allowed.

Q1) Attempt any Five of the following. [5 × 2 = 10]

a) Write any two properties of Bezier curve

 4 3
b) If the transformation matrix [T]=   is used to transform rectangle
 1 2 
with length 3 cm and breadth 5 cm respectively, then find area of
transfermed figure.

1 3 
2 2

c) Is [T]=   3 1
 gives a solid body transformation? Justify.
 2 2 
 
d) Determine forshortening factors fx and fz, if transformations matrix for

0.5 0.43 0 0 
0 0.86 0 0 
 
0.86 0.25 0 0 
axonometrix projection is [T]=  
0 0 0 1

e) Find δθ to generate uniformly spaced 20 point on the circle x2+y2=?

( δθ is the angle of rotation)

P.T.O.
 1 0  2 0
0 1 3 0
 
f) Explain the effect of transformation matrix [T]= 0 0 1 0  on three
 
0 0 0 1
dimensional object.

g) Give transformation matrix in three dimensional space which gives

trimetric projection for θ = 30º and θ = 45º.

Q2) Attempt any Three of the following. [3×5=15]

a) Find combine transformation matrix for the following sequence of

transformations.

i) Scaling in x and y co-ordinary by factors –1 and 2 units respectively.

ii) Reflection through X-axis.

iii) Rotation about origin by an angle 270°. Apply this combine

transformation matrix on the point P [2–3]

b) Reflect  ABC through the line y = 3, where A[–2–3], B[–10–6] C[–15–10].

c) Find combine transformation matrix for the following sequence of

transformations.

i) Rotation about y–axis by an angle –30°

ii) Rotation about x–axis by an angle 45°

iii) Perspective projection with centre of projection on z-axis at the

point [0.0,2.5,1]

d) Obtain isometric projection of the line segment joining the points [1–2 1]
and [31–6] (θ > 0,    .

e) Consider the line with direction ratios 1,1,1 and passing through the
origin. Determine angles through which the line should be rotated about
x-axis and then about y-axis so that it coincide with z-axis.

[6055]-203 2
Q3) Attempt any One of the following. [1×10=10]

a) Find parametric equation of Bezier curve determined by control points

B0[–1–1] B1[2 3] B2 [3 3], B3[5 2]. Also find P(0.6), P(0.7), P(0.8).

b) i) Obtain uniformly spaced three points in the first quadrant of the

circle x2+y2=16.

ii) Find cavalier and cabinet projection of the object represented by

the following position vector matrix [X] with horizontal inclination

1 2 1 
3 4  1
 =25°, where [X]   
1  2 1
 
 2 1 1



[6055]-203 3
Total No. of Questions : 3] SEAT No. :
P-1297 [Total No. of Pages : 4

[6055]-204
S.Y. B.Sc. (Computer Science)
MATHEMATICS
MTC - 242 : Operations Research
(2019 Pattern) (Semester - IV) (Paper - II) (24222)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) All questions are compulsory.
2) Figures to the right indicates full marks.
3) Non-programmable scientific calculator is allowed.

Q1) Attempt any Five of the following : [2 × 5 = 10]

a) Draw a feasible region for the following constraints.
3x + y  6
x + 2y = 4
b) Give any two fields where operations research is used.
c) Define degeneracy in transportation problem.
d) Solve the following assignment problem for minimization.
A B C
1 12 10 8
2 8 9 11
3 14 11 12
e) Obtain Initial Basic Feasible Solution of the transportation problem by
using least cost entry method.
D1 D2 D3 Supply
O1 7 3 12 20
O2 5 6 10 14
Demand 10 11 13
P.T.O.
 f) Write dual of the following linear programming problem
Minimize Z = 3x1 + 25x2
Subject to
2x1 + 4x2  40
3x1 + 2x2  50
x1, x2  0
g) Write standard form of the following linear programming problem
Minimize Z = 4x1 + 3x2
Subject to
2x1 + x2  10
–3x1 + 2x2  6
x1, x2  0

Q2) Attempt any Three of the following : [3 × 5 = 15]

a) Solve the following assignment problem.
I II III IV V
A 10 5 13 15 16
B 3 9 18 13 6
C 10 7 2 2 2
D 7 11 9 7 12
E 7 9 10 4 12
b) Solve the linear programming problem by graphical method.
Minimize Z = 5x + 2y
Subject to
10x + 2y  20
5x + 5y  30
x, y  0

[6055]-204 2
 c) Solve the following linear programming problem by Big-M method.
Max Z = 2x1 + x2
Subject to
2x1 – x2  1
x1 – x2  1
x1, x2  0
d) Obtain an Initial Basic Feasible solution to the following transportation
problem by North-West corner method.
W1 W2 W3 W4 Capacity
F1 19 30 50 10 7
F2 70 30 40 60 9
F3 40 8 70 20 18
Requirement 5 8 7 14 34
e) Find an Initial Basic Feasible to the following Transportation Problem
Using Vogel's Approximation method.
D1 D2 D3 D4 Supply
P1 2 3 11 7 6
P2 1 0 6 1 1
P3 5 8 15 9 10
Demand 7 5 3 2 17

Q3) Attempt any One of the following : [1 × 10 = 10]

a) Obtain initial basic feasible solution of the following transportation problem
using modified Distribution method.
D1 D2 D3 D4
W1 35 6 35 1 9 3 70
W2 5 11 5 50 2 8 55
W3 45 10 12 4 45 7 90
85 35 50 45 215

[6055]-204 3
 b) i) Solve the following linear programming problem by simplex method
Max Z = 7x1 + 5x2
Subject to
x1 + 2x2  6
4x1 + 3x2  12
x1, x2  0
ii) Solve the following assignment problem.
Machines
A B C D
Jobs J1 5 5 – 2
J2 7 4 2 3
J3 9 3 5 –
J4 7 2 6 7



[6055]-204 4
Total No. of Questions : 5] SEAT No. :
P1298 [Total No. of Pages : 2
[6055]-205
S.Y.B.Sc. (Computer Science)
ELECTRONICS SCIENCE
ELC - 241 : Embedded System Design
(2019 Pattern) (Semester - IV) (24321) (Paper - I)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Q.1 is compulsory.
2) Solve any three questions from Q.2 to Q.5.
3) Figures to the right indicates full marks.
4) Neat diagrams must be drawn whenever neccessary.
5) Use of calculator is allowed.

Q1) Attempt any Five. [5×1=5]

a) State use of UART in communication.
b) What does the term flexibility related to soc’s?
c) State role of watchdog module in soc’s.
d) What is the use of ‘print str[o]’ instruction in python?
e) List any two standard datatypes in python.
f) State use of ‘GPIO. Cleanup ()’ function.

Q2) Answer the following. [2×5=10]

a) Explain embedded system with a general layout diagram.
b) Draw the proper interfacing diagram of PIR sensor to Raspberry Pi.
Write a python program for defection of motion.

Q3) Answer the following. [2×5=10]

a) Explain Branch prediction and folding concept.
b) List any four assignment operators in python. Write a python program
for multiplication of two numbers.

Q4) Answer the following. [2×5=10]

a) What is the library function? State the use of following instructions.
i) print tuple [o]
ii) dict (d)
iii) time ( )
b) With proper circuit diagram explain LCD interfacing to Raspberry Pi.

P.T.O.
Q5) Write short note on any four of the following. [4×2.5=10]
a) SOC.
b) Microcontroller.
c) Digital signal processors.
d) Network on a chip.
e) NOOBS.
f) Bluetooth module.

  

[6055]-205 2
Total No. of Questions : 5] SEAT No. :
P-1299 [Total No. Of Pages : 2

[6055]-206
S.Y.B.Sc. (Computer Science)
ELECTRONICS
ELC 242-Wireless Communication and Internet of Things
(Semester-IV) (2019 Pattern) (Paper II) (24322)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates :
1) Q.1 is compulsory.
2) Solve any three questions for Q2 to Q5.
3) Figures to the right indicate full marks.
4) Use of calculator is allowed.

Q1) Answer the following in one or two sentences each (any Five) [5 × 1 = 5]
a) What is handoff?
b) What do you mean by scalability of IoT?
c) State act least two applications of IoT.
d) What does GPS stand for?
e) What is full form of
i) Iaas ii) Saas
f) List four elements of RFID system.

Q2) Answer the following: [2 × 5 = 10]

a) Explain GPS architecture with neat lebelled diagram.

b) Compare between Zigbee and Bluetooth technologies.

P. T. O
Q3) Answer the following: [2 × 5 = 10]

a) Draw block diagram of mobile handset and describe function of any two
blocks.

b) Draw diagram of zigbee architecture and state functions of each layer.

Q4) Answer the following: [2 × 5 = 10]

a) Compare M2M and IoT.

b) Draw block diagram and explain concept of smart city system using IoT.

Q5) Write a short note on any four of the following: [4 × 2.5 = 10]

a) VLR block of NSS of GSM system

b) Private cloud

c) Mesh topology in zigbee network

d) Features of Z-wave

e) Secure connectivity in IoT

f) 4G - LTE.

  

[6055]-206 2