0% found this document useful (0 votes)
10 views8 pages

Sem III - It - Rev - 19 C - May-2024

The document contains examination papers for various subjects including Engineering Mathematics, Data Structure & Analysis, Database Management System, Principles of Communication, and Paradigms & Computer Programming. Each paper outlines compulsory and optional questions, covering topics such as Laplace transforms, graph algorithms, SQL commands, signal processing, and programming paradigms. The structure includes time limits, marks distribution, and instructions for answering the questions.

Uploaded by

Pornima Godiwale
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views8 pages

Sem III - It - Rev - 19 C - May-2024

The document contains examination papers for various subjects including Engineering Mathematics, Data Structure & Analysis, Database Management System, Principles of Communication, and Paradigms & Computer Programming. Each paper outlines compulsory and optional questions, covering topics such as Laplace transforms, graph algorithms, SQL commands, signal processing, and programming paradigms. The structure includes time limits, marks distribution, and instructions for answering the questions.

Uploaded by

Pornima Godiwale
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Paper / Subject code: 5r42r / Enginering Mathematics Irr

sE ff Pp nn -rrr" / f_, y / ; n _,,,'<,;)";:i"_ ;" i - "",q


q,F. CoJe-
Time: 3 hours ff.ff*?
.-.-:
N.B. (1) Question No. I is compulsory. ,..-

(2) Answer any three quediions fro-m e.2 to g.i


(3) Use of Statistical Tables permitted.

(4) Figures to the right indicate full marks

Ql A Ir f(0 =(/, * , find L[r(t)] and hence find L1e2rr1t;y


+)'
!

BI'
Find L-r {, "' }
|\* ". -:.f(s2+4)' .r"
C Obtain half-range cosine series for f(x) = x(2-x) in 0<x<2
,'.' D Fipd moment'gdnerating function of the following distribution.
Hbnce find mean and variance.
x 7 3 4 5
P(X) .*.' 0.4 0.1 o.2 '^;.'
0.3 _,

family of curves 6
.:\i-
*j,eo I xsiny--yCosy]. _;.c

P:i, Find t{t(T)'}


.*' C Fin-d the Fou-ffi series exli sion forf(x):2, '2<x<0.
,i. ' ...:*'
.Ttzl -.r"".
.]

l7
=0, 0<x<2
Hencededucethat-= -* _I...lt
L, 872 --l-
3-
^2
|
-)

find L-r{log(1 - *ll


J-
6

'rFind \
the analyic funCtion f(z): u*iv where
' u*v: stn2x
cosltZy-cosZx
uslng 6
' Milne:Jhompsont Method*.'-
Fit a parabolq.*: a +by +ct' for the following data:

X: I 2 3 4 5
Y: l0 l2 t5 14 l5

f '.'

5s380
t'
-''

.i .' x822y 7 0837 EX822y 7 AW EX822y 7 0837 EX822y 7 0837 E


Paper / Subject Code: 51421/ Enginbring Mathematics III

Q4A The first 4 moments of a distribution about origin of the random variable ,,.6
X are -1.5, 17, -30 and 108. Compute Mean, variance, p3 and pa.
B Consider the equations of regession linei Sx-y:ii and,- 64x.4'5y:24. 16
Find x, y and correlation coefficient r.

Findl-rtffi) ( c ta\?

,:.'. "...r."
8
.:...
"':,.

Qs A 6 ,.-,tl
B Find spearmah's rank coirelation coeificient for the data b-elow: 6 :,''

X: 32 55 49 60 43 '3;,7 43
"'49
..
1o--r 20
Y: 40 30 70 20 30 50 72 60 4S 25

Obtain Fourier Series fo-r f(x) : ] [n - x) in:(0,2n).


1 i-:''

that I = 1; 1 ;E
Hence, deduce 1 - 5* 5 "'.l'" 7 -+'.. ...''

Q6 If f(x) is probability density function of a contifiuous randofi variable{,


6
find k, mean and variance. ...1 ".:

r/_.\_ {
ilxr:
( kxz,0<x<1
.
i ,.,', ... ' i' ..1

^
l(2-x)','). 1x12 -. ,-

Check if there exists an analytic functlon whose real part' is 6


u: sinx*3xz - t'+Sy+4. Justify youranswer.
'""''
'i
'- 'lj
:,,,

Evaluate the folowing integral by usurg Laplace,tifisforms


..
!f, ,-r, ttirrydu)dt --
." ,,-,-rl'i'

ss380 Page 2 of 2
et
u"/
x822y 7 0837 EX822y',7 0837 EX822y 7 0837 EX822y 7 0837 E
Paper / Subject Code: 51422 lData Structure &
I I t
Analysis t4 ,{l > c2,
?r
3E , r Itseno l,t I Artrlt R-l'lli rtl >Czq
* I -

-t ef LCLk : 5q 13
(3 Hours)
[Marks:80]
N.B.: 1) Question No. 1 is compulsory.
2) Ansrver any three out of remaining questions.
3) Assume suitable data if necessary.
4) Figures to the right indicate full marks.

Q1. (a) Define directed and undirected graph with example. (s)
(b) Explain first fit, best fit and worst fit method with example. (s)
(c) Explain threaded binary tree. (s)
(d) Briefly explain memory fragmentarion. (s)

Q2.(a) Design an algorithm to perform the following operations on stack using link list: (I0)
i) Push
ii) Pop
iii) Display

Q2. (b)Explain merge sort by giving its algorithm and sort the following data using merge
sort' (ro)
39, 27 , 43, 3 . g, 92, 70

Q3. (a) Evaluate the following expression using srack- (10)


(2-3++7 * (5+6*7)

Q3.(b) Explain Double Ended eueue and v,riants of Double Ended eueue. ( l0)

Q4. (a) construct a minimum spanning tree for the graph shown in figure I using Kruskal's
and Prim's Algorithm and find out the cost rvith all intermediate steps.
(l 0)

Figure 1: Graph
Q4. (b) Define AVL tree. Step by step consrruct an AVL tree flor the following data: (10)
30,20, I 0,25,40.50,5 5,22,23

Q5. (a) Explain different hash functions. Assume a table has 8 slots (m:8). Using Linear
probing, insert the following elements into rhe hash table. 36, lg, j2,4j,6,
10, 5, and l5 are
inserted in the order
(10)

54513 Page I of2

X822YOFE8B 1X822YOFE8I] I X822YOFE8B IX822YOFE8B I


Paper / Subject Code: 51422 lData Structure & Analysis

Q5.(b) Define Binary Search Tree. Construct the binary search tree from following
traversal: (10)
In-order:DBHEAIFJCG

Determine the post-order of the tree drawn. '

Q6' Solve any Four: (20)


. -: -,.
a) Graph Traversal Algorithm
b) Game Tree
c) Radix Sort
d) B-tree
e) Round Robin Scheduling

54513 Page 2 of2


h
x822y0FE8B I X822y0FE8B lX822y0FE8B 1X822yoFE8B 1
Paper / Subject Code: 51423 / Database Management System

9 E-I r I se--rn D I R -, 7 I Fu - *+ I to* 06 -eo.e-r*

Time:3hrs
@f ; {76 {7. Max. Marks:80

N.B.:
I' Question no. I is compulsory.
2. Attempt any Three out of rernaining Five questions.
3. Assume suitable data wherever necessary.
4. Figures at right indicates full marks.

Ql. Attempt All questions 20M


(a) Explain DDL Commands
(b) Discuss various Aggregate Functions
(c) Write a short note on View serializability.
(d) Explain DML commands in detail.

Q2.
(a) Discus$ traditional file system for database management how relational system is
differ then file system discuss with.surtable examples. r0M
(b) Draw EER diagram for automobile insurance company. t0M

Q3.
(a) Explain generalization and Specialization with example. 10M
(b) Draw and expiain nota:tions of ERIEER diagram 10M

Q4.
(a) Explain the concept of Grant and Revoke in SQL with example l0M
(b) Explain deadlock handling in concurrency control l0M

Qs.
(a) Defme normalization. Explain INF'and 2 NF in detail with example l0M
(b) E;plain ACID properties in details with example. l0M

Q6,Write short note on 20M


- (a) JDEC in Database Systems

(c).'l0rder by Group by'clause


(d)- Data independenpy in database

5765i,7 Page 1 of I
x822y 13 C A3 CX822y 7 3 C A3 CX822Y 7 3 C A3 CX822Y 73C A 3 C
Paper / Subject Code: 51424 / Principle of Communication

'rtj-T) lser"iff/ {-{1 | pH-z{z-\ l?e--a,{-2"L\


Time: 3 Hours Marks: 80

N.B. (1). Question No.1 is compulsory. qr L,Lr"-: s{401


(2). Out of remaining attempt any three.

(3). Assume & mention suitable data wherever required.

(4). Figures to right indicates fullmarks.

Q.1. Solve any four I20l

a). The signal power & noise power measured at the input of an amplifier are 150 pw & 1.5 pw
respectively. If the signal power at the o/p is 1.5w and noise power is 40mw, calculate amplifier
noise factor & noise figure.
ll
b). Calculate the percentage power saving for DSB-SC signal for percentage modulation

of a) 100 % b) 50%

c). Compare PAM, PWM & PPM

d). State advantages of digital transmission.

e). Explain in brief different fypes of communication channels.

f . Explain the principle of reflection and refraction.

Q.2 a) Explain FDM with neat block diagram [101

b). State and prove the following properties of Fourier transform with example

i) Convolution in time domain ii) Time scaling tl0l

Q.3. a) In an AM radio receiver, loaded Q of an antenna circuit at the input to the mixer

is 100.if the intermediate frequency is 455 KHz. calculate the image frequency &

its rejection at I MHz UOl

b),With the help of neat circuit diagram explain varactor diode method of FM Generation
I l0l

56409 Page 1 of2

(_
]
x822Y |8645DX822Y I 8645 DX822Y I 8645DX822y I 8645D
Paper / subject code: st4z4 / principre of communication

Q.1 a). With reference to sky wave propagation explain

(i) virtualheight (ii) critical Frequency

(iii) maximum usable frequency (MUF) (iv) skip distance

(v) Skip Zone


t10l

b). Derive the mathematical expression for FM with neat sketch.


ll0l

Q.5 a) define/Explain the following

( l) Aliasing or fold over error (2) Slope overload error (3) quantization process

(4) TDM (5) Inter symbol interference (ISf tl0l

b)' Draw the block diagram of BSK generation & detection explain the working giving
waveforms
t10l

Q6' a)' Consider that bit sequence given below is to be transmitted


Bit sequence :101 1001 I .
Draw the resulting waveform if the sequence is transmitted using

l. Unipolar RZ 2. polar RZ 3. AMI

4. Split phase Manchester 5. M-ary where M:4 (polar quaternary) t10I

b) . Write short note on following (any two)

l. Need of modulation

2. Role of balance modulator

3. Delta modulation

4. Friss Formula of noise.

,k lr * r< :t ** rt * * * rt *'k * * * * * * * * rt * * * * * * * * * * * * * * * * * * *

56409 page2of2
{-)
x822y 1 8 645 DX822y t 8 64 sD X822y I 8 645 DX8 2 2 y 18 645 D
paper / Subject Code: 5X425/ Paradigms & Computer Progra*iinile notin0ltion'
j'
| .,.,'."

)E-r; I ,*r -E I rrn I Arvr lr I --i..l


F] zoz-g
.,,,,'
I
.,: 'q ,:I "6lzaz4
.. .. l

Marksl80
Tirne:3 Hours ..'.''

N"B.: 1" Question l\o.f is cornpulsory' .'


questions'
'.',' Q P,,'t}Ae.:j,'91 B 13
2. Answen" any three out of rernaining
3. Assurne suitable data if necess-ary' :. ::''
4' Figures to the right intlicate'full marks'

does'it differ,ftorn abglraction? (10)


a) Explain en*apsulation witli'example. How
,

Q1.
along wit|'pn example (10)
b) Describe the use of scripting in,-web development
:

Q2. a) Fjxplain Type and r*",.3,*""'i'I{utk*Itr^ :' ..-"1


'"
(10)."

l,. b) Explairr clifferent stol'd$e allocation mechanisms' 'it' ;"-' ''


(10)

r ,,. r l, -.,",,
Explaip,'ivith expqrple thi,differci::
Y-"
Q3, a) what do you mean by Programming Paradig{i ','""
;;r*o,. ct*ctamtive uri i'***tive prigramu.;ng paradigm. , (10)

athread' (10)
bJ Describe various meihods to.create ,--"

..'
&ehniques'in Concurrent
b) iixplain the differeniiommunication and synchr.o'nization
(10)
Prograrnrning model.

,,,
cc,mmaiidi in Prolog with ao:exampie'
manipulation (10)
Q5" a)-Explain clatabase
'.,-. ,, .:.. ,

b) what is Inireritahbe? Exp$in dilTerent twes


oPP' lnheritan'e in (10)
lf
.il'

(20)
Shcrrt nttte on: (AnY 4)

b) Forward chaining vs. Backward chaining


rr) List operations in Prolog
r1,t Currying in Hasttqll .' ,,,1,
e) Prograrnming ldnguages.vs. Scripting languages

* >F* **f * {< {< {.* * r. ** * r<{< * * {' *

s?813 t
x822Y 2320i 2X822Y 23207 2X822v 2320',7 2X822Y 23207 2

You might also like