Total No. of Questions : 5] SEAT No.

:
PB1877 [6237]-401
[Total No. of Pages : 2

S.Y. B.Sc.
COMPUTER SCIENCE
CS-241 : Data Structures and Algorithms - II
(Revised 2019 Pattern) (CBCS) (Semester - IV) (24121)
Time : 2 Hours] [Max. Marks : 35
Instructions to the candidates:
1) Figures to the right indicate full marks.
2) All questions are compulsory.
3) Your answers will be values as a whole.
4) Neat diagrams must be drawn whenever necessary.

Q1) Attempt any Eight of the following. [8×1=8]

a) What is Binary Search Tree?
b) What is childnode?
c) What is ancestors?
d) What is directed graph?
e) Define indegree of a node.
f) Define cycle.
g) What are valid possible values for balance factor?
h) Define multi way search tree.
i) What is hash address?
j) Define overflow in hashing.

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

a) Define following terms:
i) internal node
ii) max heap
b) Write a note on graph.
c) Give any two applications of Lexical Search Tree.
d) Write a note on hash function.
e) Explain min heap with suitable example.

[6237]-401 1 P.T.O.
Q3) Attempt any two of the following. [2×4=8]
a) Write a ‘C’ function to find out mirror tree.
b) Write a ‘C’ program to accept adjacency matrix and traverse using Depth
First Search (DFS) algorithm.
c) Write a ‘C’ function to insert element in hash table.

Q4) Attempt any Two of the following. [2×4=8]

a) Construct Red Black Tree for 75, 37, 52, 110, 130, 90.
b) Give adjacency matrix and adjacency list for?

c) Give the inorder, preorder & postorder for:

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

a) Construct the minimum spanning tree for the given graph using prim’s
algorithm.

b) Construct AVL tree for 5, 4, 22, 17, 20, 22, 30.

  

[6237]-401 2
Total No. of Questions : 5] SEAT No. :

PB-1878 [Total No. of Pages : 2

[6237]-402
S.Y. B.Sc.
COMPUTER SCIENCE
CS-242 : Computer Networks - I
(Rev.2019) (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) What are the different layers of OSI reference model?
b) Define routing algorithm.
c) What is subnet?
d) Which is a 32-bits IP address?
e) Define Port number.
f) Find the network id of IP address : 145.25.10.100.
g) What is pushing?
h) What is congestion control?
i) Write the transport layer protocols.
j) What is the window size of TCP segment?

Q2) Attempt any FOUR of the following (out of Five) : [4 × 2 = 8]

a) Write the Nyquist bit rate formula for noiseless channel.
b) A network with bandwidth of 10 Mbps can pass only an average of
12,000 frames per minute with each frame carrying an average of 10,000
bits. What is the throughput of this network?
c) Find the class of each address :
i) 00000001 00001011 00001011 11101111
ii) 10100111 11011011 10001011 01101111
d) Define the terms HA and FA in MIP
e) List any two features of TCP.

P.T.O.
Q3) Attempt any two of the following (out of Three) : [2 × 4 = 8]
a) Explain Mesh topology in details.
b) What is framing? Explain any two framing methods.
c) Describe the functions performed by Data Link layer.

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

a) Write the notations for IP address.
b) Find out class, netid, hostid & network address of IP address 126.25.21.1
c) Explain encapsulation and decapsulation process at transport layer.

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

a) Describe three types of stations in a wireless LAN.
b) Draw and explain UDP datagram.


[6237]-402 2
Total No. of Questions : 3] SEAT No. :

PB-1879 [Total No. of Pages : 2

[6237]-403
S.Y. B.Sc. (Computer Science)
MATHEMATICS
MTC - 241 : Computational Geometry
(Revised 2019) (Semester - IV) (24221) (Paper - I)
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]

 3 1
a) If the transformation matrix [T]    is used to transform circle of
 2 2 
radius 10 cm then find area of transformed circle.

 1 3 
 2 2
b) Is [T]    a pure rotation? Justify?
  3 2 1 
2 
c) Write transformation matrix for shearing in Y-co-ordinate proportional
to X and Z co-ordinates by factors 3 and 5 units respectively.
d) Give any two examples of parallel projection.
e) Find angle of rotation about origin so that the line y = 2x, coincides with
x-axis.
f) Determine the principle forshortening factors fx and fy of the matrix for

 0.87 0.05 0 0
 0 0.69 0 0
axonometric projection. [T]   
 0.08 0.74 0 0
 
 0 0 0 1

g) Write transformation matrix for translation so that the plane Z = 2 coincide

with XY - plane.

P.T.O.
Q2) Attempt any three of the following : [3 × 5 = 15]
a) Find combine transformation matrix for the following sequence of
transformations.
i) Rotation about origin by 50º
ii) Shearing in Y - direction by -2.1 units
iii) Uniform scaling by factor 2
Apply it on triangle with vertices O[0,0], A[1,2] and [3, –1]
b) Rotate the line segment between the points A[1,1] and B[3, 3] about
point [1, 2] by an angle 90°.
c) If a 2 × 2 transformation matrix [T] is applied on a pair of parallel lines
then prove that they are transformed to a pair of parallel lines.
d) Develop cavalier and cabinet projection for  = 120º of the object
1 2 2 1
[ x]   
 0 1 2 1

e) Develop the right view of the object whose position vector matrix is

1 0 0 1
0 1 0 1
given by [ x]   
0 0 1 1
 
0 0 0 1

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

a) If B0[2,1], B1[4,4], B2[5,3] and B3[5,1] are vertices of Be'zier polygon.
Find parametric equation of Be'zier curve also find p(t) at t = 0.2, t = 0.4
and t = 0.6.
b) i) Rotate the line segment AB where A [1,2,4] and B [2,2,1] about
local X - axis passes through the point [2,3,4] by an angle 65º.
ii) Generate uniformly spaced three points in first quadrant of circle
x2 +y2 = 49.



[6237]-403 2
Total No. of Questions : 3] SEAT No. :

PB-1880 [Total No. of Pages : 4

[6237]-404
S.Y. B.Sc. (Computer Science)
MATHEMATICS
MTC - 242 : Operations Research
(Rev.2019) (Semester - IV) (24222) (Paper - II)
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 the dual of the following linear programming problem.
Minimize Z = x1 – 2x2
Subject to,
2x1 + 3x2  5
x1 – 4x2  6
x1, x2  0
b) Find feasible region for the following linear programming problem.
Maximize Z = x + y
Subject to,
x5
y  10
x, y  0
c) Write any two applications of operations research.
d) Find initial basic feasible solution for the following Transportation problem
by North-West corner method.
1 0 2 4
3 5 4 6
1 2 3 10
3 5 12

P.T.O.
 e) Maximize Z = x1 + 2x2 + x3
Subject to, x1 + x2 + x3 = 1
x1 – x2 + x3 = 2
x1, x2, x3  0
obtain initial basic feasible solution of above linear programming problem.
f) Solve the following assignment problem for minimizing total time for
doing all Jobs
Jobs
I II III
Operators A 6 4 5
B 2 11 4
C 13 8 3
g) What is rim condition for Transportation problem.

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

a) Solve the following assignment problem for maximization.
Z1 Z2 Z3 Z4
S1 100 140 280 70
S2 130 160 200 60
S3 80 130 300 90
S4 150 110 250 50
b) Solve the following linear programming problem by graphical method.
Maximize Z = 6x1 + 11x2
Subject to 2x1 + x2  104
x1 + 2x2  76
x1, x2  0

[6237]-404 2
 c) Find the initial basic feasible solution for the following

Transportation problem by using Least cost entry method.

Destinations

D1 D2 D3 Supply

Origin O1 40 70 90 300

O2 12 80 30 400

O3 60 90 45 200

Demand 300 300 300

d) Solve the following linear programming problem by simplex method

Maximize Z = 2x + y

Subject to x – y – z  1

x – 2y + z  2

x  0, y  0, z  0

e) Find initial basic feasible solution by Vogel's Approximation method for

the following transportation problem.

D1 D2 D3 D4 Supply

O1 23 27 16 18 30

O2 12 17 20 51 40

O3 22 28 12 32 53

Demand 22 35 25 41

[6237]-404 3
Q3) Attempt any one of the following : [1 × 10 = 10]
a) Solve the following linear programming problem by simplex method
Maximize Z = 30x + 20y
Subject to 6x + 8y  480
– 3x + 3y  – 240
x  0, y  0
b) Obtain optimal solution of the following transportation problem by MODI
method
D1 D2 D3 D4
O1 2 3 4 5 6
6
O2 5 4 3 1 8
2 6
O3 1 3 3 2 10
4 6
4 6 8 6



[6237]-404 4
Total No. of Questions : 5] SEAT No. :

PB-1881 [Total No. of Pages : 2

[6237]-405
S.Y. B.Sc. (Computer Science)
ELECTRONICS SCIENCE
ELC - 241 : Embedded System Design
(Revised 2019) (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 indicate full marks.
4) Neat diagrams must be drawn whenever necessary.
5) Use of calculator is allowed.

Q1) Attempt any five : [5 × 1 = 5]

a) What is SBC?
b) What is the significance of DMA in SoCs?
c) What does the term flexibility related to SoCs?
d) What is the use of 'print tuple' instruction in python?
e) List any two standard datatypes in python.
f) What is significance of GPIO. Pins in Raspberry Pi?

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

a) Differentiate between microcontroller and single board computers?
b) Draw the proper circuit diagram for interfacing of LED to GPIO23 pin
of Raspberry Pi & Write program for blinking of LED.

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

a) With neat diagram explain functional blocks of SOC.
b) List any four bitwise operators in python. Write a python program to
subtract two numbers.

P.T.O.
Q4) Answer the following : [2 × 5 = 10]
a) What is the Library Function? State the use of
i) GPIO. cleanup ( )
ii) Ord (x)
iii) Frozenset (s)
b) Explain basic working principle of a fingerprint sensor. State any three
features of fingerprint sensor.

Q5) Write a short note on Any Four of the following : [4 × 2½ = 10]

a) Embedded system.
b) Network Access Devices of SBC's.
c) DMA controller.
d) Digital signal processor.
e) Time function in python.
f) Bluetooth module.



[6237]-405 2
Total No. of Questions : 5] SEAT No. :
[Total No. of Pages : 2
PB-1882
[6237]-406
S.Y.B.Sc.(Computer Science)
ELECTRONICS
ELC - 242 : Wireless Communication and Internet of Things
(Rev.2019) (Semester - IV) (Paper - II) (24322)

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 indicate full marks.
4) Use of calculator is allowed.

Q1) Answer the following in one or two sentence each (any five).[5 × 1 = 5]
a) What is full form of MQTT?
b) How many number of layer used in IOT architecture?
c) Write the IEEE specification used in zigbee?
d) What do you mean by IMEI?
e) Write any two challenges in implementation of IOT?
f) State any two application of RFID system.

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

a) Draw and explain smart irrigation system in agriculture field.
b) Compare active and passive RFID Tags.

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

a) What is GSM. Explain BSS and NMS of GSM.
b) Draw and explain block diagram of GPS receiver.

P.T.O
Q4) Answer the following. [2 × 5 = 10]
a) List different types of handover in GSM and explain any one of them.
b) Compare Sigfox and NBIOT.

Q5) Write a short notes (Any four). [4 × 2.5 = 10]

a) Hybrid cloud.
b) Secure data storage in IOT.
c) Write advantages of Zigbee Technologies.
d) Write classification of GPRS device and explain function of any one
device.
e) Scatternet.
f) Frequency Reuse concept.



[6237]-406 2