Unix and Shell Programming, Q P Code: 60305. Additional Mathematics I Q P Code: 60306 Computer Organization and Architecture Q P Code: 62303 Data Structures Using C Q P Code: 60303 Discrete Mathematical Structures Q P Code: 60304 Engineering Mathematics - III Q P Code: 60301 Soft Skill Development Q P Code: 60307

1. Third Semester BE Degree Examination October 2021 18CS32
(CBCS Scheme)
Sub: Analog and Digital Electronics
Q P Codez 60302
n4
ADTcHuNCHANAGTRT uNtvERstry 3 €*" 6'5
Max Marks: 100 marks
4. write the same question numbers as they appear in this question paper. .r
-
5. Write Legibly ,r'',
Module-l , .. -.
,1.
Explain the working of Photodiodes. List there applications ,,,r.,,,,. .,''.1
Describe the working of Liquid Crystal Display with neat diagram . ' ,..'
'
Explain a stable multivibrators circuit using timer 555. '",'j'r,,,.,i
or .i"r::'..
."".'1"' "
Explain the working for Inverting and Non- Inverting'lffnolifiers using OPAMP.
i:{:{ a'- 1 1,
Design a inverting amplifier to obtain the followiirg'.oyQut voltage using OPAMP
Design a relaxation Oscillator using OP,AMP';J6 generate square wave having Frequency
ZKhz. '....-",
I",o r'
..
'l Modu lle - 2
. I,, ,... :J_:
Simplifythe following using K+,Map,.... ,'
i) Y:t(o. 1,2,7.8, r2, r 5) + d(3, rf ) "
ii) Y =x(1,2,3,4,6,70, 1 1, H)* d(7,13)
Simplifr the fol lowing uSing""Quine-McC luskyMethod
Y:E(0, 1,4, 8, r,,
lls":;fd
3,f +y + d(3, 1 o)
?,"*' Of
i ",
Write a VllDlflefilog code for the Full Subtractor. Draw the wave forms obtained after
simulatioil4 "
Si mgilify.the'fo I lowi ng using Quine-McCluskyMethod
10.._
".r.*.;,i: Y:E(o, 1,2,8,9,1 l,l2,l 4) + d(4,7 )
' 1'1-.
:'
'rt Module - 3
Explain the working of Parity generator and Parity checker circuit.
lmplement the full adder using PAL
Explain seven segment decoder.
Or
a Write a VHDL/FIDL code for 8:1 MUX
b Explain the working of Decoder. Implement Full Adder using Decoder
7 marks
6 marks
7 marks
8 marks
6 marks
6 marks
l0 marks
l0 marks
10 marks
10 marks
7 marks
6 marks
7 marks
7 marks
8 marks
PTO
Time: 3 Hours
Instructions: 1. Answer five full questions.
2. Choose one full question from each module.
3. Your answer should be specific to the questions asked.
a
b
c
a
b
a
b

2. c lmplement the following using 8:1 MUX
Y =2(0,2,4,5,6,7,9,1 0, 1 l, 1 2, 1 3, 1 5)
Module - 4
a Explain the race around condition in Master Slave JK Flip-Flops using NAND gate
b What is an gated Flip-Flop explain its working.
c Write a HDL code for 3 bit UP counter. Draw the simulated waveform also.
Or
a Write the working of 4 bit Parallel IN Serial OUT Shift Register using D flip Flop.
b Explain the working of Universal Shift Register'
c Explain the rvorking of serial Adder using a shift registers. *.. '"
a
b
Module - 5
Explain the rvorking of Asynchronous UP-DOWN counter.
Design a counter using D Flip Flop to count following sequence tqkqg into account the
unwanted states. o,.-.-3'i
,.}"
i !:L '+,.,1
5 marks
6 marks
6 marks
8 marks
7 marks
8 marks
5 marks
l0 marks
10 marks
r)3)4)6)2)5)1
Or
l0 a Explain the working of Binary Ladder for converting a bit $atqto its analog equivalent using 10 marks
,,*1.,-,
t'
oPAMP. "."."
,.1. o"n ..
b Describe the process of converting analog value to di.!itql'""U,ling Continuous Counter l0 marks
method ADC. "
':'o",,:'
*.f:!$*'!r."$
l'. !1.
r 'rl. "
.
'il .
,li'
* !.. al"
t. lili:,,...
!l
'i

3. Time: 3 Hours
ADICH UNCHANAGIRI UNIVERSITY
Third Semester BE Examination October 2021
(CBCS Scheme)
Max Marks: 100 marks
c ci1ian,:ilgorithm to find GCD of two numbers?
{.,;-
1;,
-",
Define Priority Queue? write 'c' Implementation of priority
Queue to insert, delete and g marks
display operations using dynam ic array?
Sub: Data Structures using C
e p Code: 60303
.. ::''' .
Instructions: 1. Answer five full questions.
".r,
,i;. i
2. Choose one full question from each module. ,,.. , .'.'.
3. your answer should be specific to the questions asked. .
4. write the same question numbers as they appear in this questio.p papd..
5. Write Legibly .",:
,.,
.
il't"ttt'
u)t_t''
':il' l:. .ri
Module-l ).,:,j.
'',."..''
.jt. "'."
a what are dynamic memory allocation techniques? Explala.h[il*,dynu,ni. allocation is done l0 marks
using malloc 0? i,i ,;i,_.1
'.
b what is polynomial? what is degree of poly-nbryiaiz"'furite a function to add two 8 marks
polynomials? - ' '- -. ', *''
c How pointers are declared and initializ
"d1n
,b,4
,r"'
---,ii" "".V' 2marks
a Explain classification of Data SF,.C'.u...p w;;:", diagram?
-i-l""i. - ! 8marks
b write a 'c' program to find wherher the given string is palindrome or not using the string g marks
library functions. ., It,,.,,.''" "'
c Write difference between St.u.tur. and Union.
{:"'i', -__ _" 4marks
tlt,,. ;;,i Module - 2
a Define stack? wriie"tire c implementation of push and pop operations for stack using arays. g marks
b convert thd'forowing infix expression into postfix expression using stack. g marks
1,?
,i','A$ ts,lC-D + E/F/(G+H)
Or
18CS33
4 marks
7 marks
5 marks
10 marks
l0 marks
b
c
Explain a Mazing problem with problem statement?
write a 'c' program to accomplish the task of transferring the n disks from tower I to tower
3 using recursion function.
Module _ 3
what is linked list? Explain the different types of linked list with diagram.
write 'c' Implementation of circurar Singly Linked rist using rast pointer.
a
b

4. Or
a write a 'c' program to implement queue using Singly linked list?
b Write the node structure for representation of polynomial. Explain the algorithm to add two
polynomials using linked list?
Module - 4
What is a tree? Explain
i. Root node
ii. Degree
iii. Siblings
iv. Binary tree
':"''i''" "l'- lj
What is the advantages of threaded binary tree over binary tree? Explain 1hr.g..q$d.d
'binary
tree contraction with suitable example. _,",:
-'
Write a suitable example illustrate how you transform a forest tree into{tiiilh.rj;tree
Or ,,,,. i..,,:i
"rlri!
w)1)
what is binary search tree? Draw the binary search tlgre&i"tne following input.
{14,5,6,2,19,20,16,19, _l,2ll
.,"*,:t":.
create threaded binary tree step by srep for {f"0p-0,10r40,50}. write advantages and
disadvantages of threaded binary tree? ;;-.,5"3 "r.
.." 'd:." .:i
Modriiil- 5"""
:4amples
i. Complete graph rr:'''":r 't"
ii. Subgraph ,'"',r, ,i,,.1
iii. Connected graph
iv. Cyclic graph ,"...,
Define hash functionf exptjiii,ait hash functions with examples
ii
",t.
Write differences bq,!,qzee4 BFS and DFS
']"t""ttt'ttt i''"'' Or
i.i,'.
]
P:,fi"..
Depth-fi"rst Sbarch? Write algorithm for DFS traversal and perform DFS traversal for
roilowlng g{aph.
.',"r,.'t"t'0.:l M /A
",,"t"'' 'l:.,."."d
{ !
_-
PTO
l0 marks
l0 marks
8 marks
b
c
l0 a
8 marks
4 marks
l0 marks
10 marks
8 marks
8 marks
4 marks
l0 marks
l0 marks
,ti .i:
,,.." { .:
,:.'?,.
.:
b write a 'c' programming fbr implementing the sequential file organization.
**rk**

5. Third
Time:3 Hours
ADICHUNCHANAGIRI UNIVERSITY
Semester BE Degree Examination October 2021
(cBcs scheme)
Max Marks:
Sub: Discrete Mathematical Structures
18C534
100 marks
Q P Code: 60304
lnstructions: 1. Answer five full questions'
2. Choose one full question from each module' ,'"'t'
t
3. Your answer should be specific to the questions asked' ".":'
4. write the same question numbers as they appear in this question PuP,?" ..',,..,:
5. Write LegiblY rr'. ''r"'"''l
':1. :.
i) Verify the principle of duality for the following logical equivalenqg1',,
i-6^d -)-pv(-Pvql e-(Pvq) 1i.;:r,,,,1i
ii) Prove that [(-pvq)n(pn(pnq))]epnq Hence deduce that...-''",. ''"''
[(-pnq)v(pv(pvq))]epvq -.'i..'n
'
Test whether the following arguments are valid:
""".'1"o
";i'
(i) p+r (ii) (: P v- q) -+(rn5)
. ..
-
-P J q f+t -.-,".
''t'',',,,i
q+s _t ., .;., . _.:.
,'.-fJS ."p :i.. "ii".
i"r::
Let p(x): 1z-l1+10:0, q(x): x2'2x-3:0,
-r(x[x<0'
determine the truth or falsity of the
following statements wririrr. univerye..JJ contains ontv
1ne 111egers
2 and 5.
If a statJment is false, provide a criiiirterexample or explanatton'
i) vl., p(x) -+-r(x) . i,,'"*,i"1)"yi'
q(x) +r(x)
iii) !x, q(x) -+r(x) 't' ' ' iv) 3x' p(x) +r(x)
Or
i' 'r,::.
Prove the following fbgi.ul"equivalence'
i)[pvqv(-gn,-gr^,r)]e(pvqvr) ii) [(-pv-q)+(pnqnr)]ep^q
Prove that the f8i:tp..l"ing are valid arguments:
i) p-";{.q-+r) ii) -P+'q
h"a3rP q+r
{*'-y-- -f
.1,.,", lt",,'.,ii r "'
P
Fini whether the.following argument is valid:
. No engmeenng studen't oirirst or Second semester studies Logic.
Anil iJan engineering student who studies Logic'
8 marks
7 marks
5 marks
7 marks
7 marks
6 marks
5 marks
5 marks
PTO
Module - 2
3 a Prove by mathematical induction, that
12i32a52a..........+(2n -2:l 13 n(2n-1 )(2n+1 )
bAbitiseither0orl.Abyteisasequenceof8bits'Find:
(i) The number of byes, (ii) Th; number of bytes that begin with 11 and end with 11'
(iii) The nr.nU., of tytes ihat begin *itl 11
and do not end with 11'
iiri fttt number of bytes that begin with 11 or end with 11'

6. c Find the number of permutations of the letters of the word MASSASAUGA. In how many 5 marks
of these, all four A's are together? How many of them begin with S?
d Find the coefficient of xr2 in the expansion of x3(1-2x;to
Or
If n is any positive integer, prove that 5 marks
7.2+2.3+3.4+....'...+n(n+Ll=713n(n+1)(n+2),usingmathematicalinduction
A string of length 'n' is a sequence of the form xlxzxr. . ..xn, where each xl is a digit' The sum 5 marks
xr*xz*i.:*....+x"iscalledtheweightofthestring.Ifeachxi'canbeof0, l, or2,findthe
number of strings of length n:10. Of these, find the number of strings whose weight is an
even number?
In how many ways one can distribute eight identical balls into four distinct containery3'b.that 5 marks
(i) no containe. is left empty? (ii) The fourth container gets an odd number of,.pft$ "
Find the coefficient of: ,"'"13*ll 5 marks
*'y'rt in the expansion of (3x-2y-42)7 ttt,,"..}
Module-3 r,1r"';' ":'
Let A:{ 1,2,3 andB:{2,4,5. Determine the following: . ,, ,,.' 't, 5 marks
(i) laxBl, (ii) Numter of relations from A to B, (iii) Number dfS.irtary relations on A
(iv; NumUer of relations from A to B that contain exactly""$vp oidered pairs.
iv)'Number of binary relations on A that contain at le-qfr,rbrdered pairs.
Let A:{ 1,2,3,4,5,6 and 8:{6,7,8,9,10}. If a funcilqfi."f, 4+.e is defined by, 5 marks
f= {(1,7 ),(2,7 ),(3,8),(4,6), ( 5, 9 ), ( 6, 9 ) } d eterm i ne f
- t
(f )'and f
-'
(9).
lf B1= {7, 8} and g2= {8, g,7.0},find f
'1(81) and'f':i(Be):"'
.1.!:r.
Find the lealt number of ways of choosin$tfliq&different numbers from I to 10 so that all 5 marks
choices have the same sum.
i,,r*.
Let f g,h be functions from Zto ?definBd by f(x)=x-I, g(x):3x, 5 marks
0. if x is even
_i
" -.,r:. r,,, ,;:
l, if x is odd . ,. ,,.
. ti,
5 marks
5 marks
5 marks
5 marks
6a
b
h(x)=
Determine (fo(goh)[$ and ((fog(oh)(x) and verify that fo(goh):(fog)oh.
,i"'',rr.. ''"'' Of
ri4" .,)"
Let A:{ 1.:2,3,!,5i,,6,1} and B={w,x,Y,z). Find the number of onto functions from A to B'
Let A.functibn f: R-+R be defined by f(x)=x2+1. Determine the images of the following
:*q::t",?fR.
i) Ar={2,31 ii) Az:{-2,0,3} iii) A::(0,1) iv) 4+:[-6,3]'
Sfrlts numbered consecutively from 1 to 20 are worn by 20 students of a class. When any 3
sthdents are chosen to be a debating team from the class, the sum of their shirt numbers is
used as the code number of the team. Show that if any 8 of the 20 are selected, then from
these 8 we may form at least two different teams having the same code number.
Let A: U,2,3,4| and let R be the relation on A defined by xRy if and only if "x divides y",
written xly.
i) Write down R as a set of ordered pairs.
ii) Draw the digraph of R.
iii) Represent the R as a Matrix
ivj Oeiermine the in-degrees and out-degrees of the vertices in the digraph.
5 marks

7. Module - 4
Let A: {1,2,3,4,6,72} on A, define the relation R by aRb if and only if a divides b'
i) Prove that R is a partial order on A'
ii) Draw the Hasse diagram'
iii; Write down the matrix of relation'
Determine the number of positive integers n such that 1Sn<I00 and n is not divisible by 2'3'
or5
In how many ways can the integers 1,2,3,....,10 be arranged in a line so that no even integer
is in its natural Place
Or
6 marks
7 marks
7 marks
6 marks
consider the Hasse diagram of a poset (A,R) given below.
I
d
l0 a
(A,R) B ' '1
If B: {3, 4, 5} find (if theY exist), .""'."", '"
i) All Upper e;Os of e' ii) All Lower BouJtddbtp'
iil rne reast Upper Bound of B i""i;'"-l'
a
In how many ways can the 26letters of the,"P..i.gts!'aiphabet be permuted so that none of the 7 marks
patterns CAR, DOG, PI-IN, BYTE occurs i',,,,,-.i t''
Find the rook polynomial for the 3X3;boaro tiusing the expansion formula 7 marks
' : Module-5
D
'
,rO: (V, E) i, asimp.tegriph pro'e that 2lElSlVI2-lVl' 5 marks
ii) uo* -urf'r.nl..iiifra fio* ,nuny edges are there in the complete bipartite graph
' K+.t and Kr.ri,.
Let G be a graph ofOqd"i"9 such that. each vertex has degree 5 or 6' Prove that at least 5 5 marks
vertices frave dq8ree,S oi at least 6 vertices have degree 5'
Show that t*o ffiph, need not be isomorphic even if they.have same number of vertices' 5 marks
the sameuJrumttEr or eoges and equal number of vertices with the same degree.
";*-
obtairitq! ilptimal prefix code for the message "ROAD IS GOOD". Indicate the code' 5 marks
,r'," '""r"*
{ .?"" or
d;r,.yrrr""'*;'i' 1^ / smafkS
6"#di-ir. the order lVl of the graph G:(V,E) in
1 i) G is cubic graPh with 9 edges
ii) G is regular with 15 edges
iii) G has I 0 edges with 2 iertices of degree 4 and all other vertices of degree 3 '
Given a graph Gt, c&rl there exist a graph Gz such that Gl.is a sub graph of Gz but not a 5 marks
spanning"subgraphofGzandyetGrandGzhavethesamesize?
With neat diagram explain the concept of Konigsberg bridge problem' 5 marks
Define optimal tree and construct an optimal tree for a given set of Weights {4,15'25'5'8'16}' 5 marks
Hence find the weight of the optimal tree'
,t(***{<
c
d

8. Time: 3 Hours
Instructions: 1. Answer five full questions'
2. Choose one full question from each module'
3.Youranswershouldbespecifictothequestionsasked.
4. write the same question numbers as they appear in this question paper'
5. Write LegiblY
Module - I iu;.. ,,, .
a With the neat diagram explain the architecture of IINIX' /
b By giving examples explain the following. , , '',
i)-echo ii; prinif iii) cal iv) date '
Or
a Explain the non-uniform behavior of terminals and keyboards.
b Explain the commands used to add, modify and delete the users.
Module,- 2.
/
a Explain the basic file tYPes ' ::
b Discuss the following commands.
".-''"
i) pwd. ii) cd iii) mkdir' ' iv) rmdir
Or
1 tl
a Write a note on the following (oinmands
i) pwd ii) cd iii) rqkdii''.. iv) rmdir
b Discuss ls comrpapd with its options'
ADICHUNCHANAGIRI UNIVERSITY
Third semester BE Degree Examination october 2021
(CBCS Scheme)
Sub: Unix and Shell Programming
Q P Code: 60305
Max Marks: 100 marks
:-, ,. :.
tir', 1.,
a Explain diffprenf modes of vi editor.
b Pj.:.:t:d'iXavigational
commands of vi editor
li' ""'':ri"" or
a i.lVhat are wild cards? Explain by giving examples.
b What is Basic Regular Expression (BREX explain with the help of examples'
Module - 4
a What are command line arguments? Write a shell program that uses command line
arguments and positional parameters.
b with syntax and example explain if statement in shell programming.
18C535
Module - 3
10 marks
l0 marks
l0 marks
l0 marks
l0 marks
10 marks
10 marks
10 marks
l0 marks
l0 marks
10 marks
10 marks
10 marks
l0 marks
PTO
4

9. Or
8 a With the help of examples explain hard link and soft link. l0 marks
b Discuss head and tailcommands by giving examples. -// l0 marks
Module - 5
9 a What is process? Explain the mechanism of process creationand also discuss ,-. 10 marks
ps command.
b Write short notes on the following l0 marks
i) nice ii) nohup iii) kill iv) cron v) at
Or
l0 a Explain the following'
::: -^-^/ :-. --,:1, , :, . ' l0 marks ca
i) splice operator ii) push0 iii) popQ iv) split0 '',,,,,,.."
b Explain associative arrays by giving example.
,i,..,.1,,...r,-.
''
l0 marks
,kr**** ",,.r,."..li
i l:.-j

10. qi
o
o
d
o.
d
cd
€
c)
c)
B9
Q;-
-y5
69
Eh
'-^ [
c@
.:I
.S e
cd+
b10
oC
€g
('tr
o>
8s
,=o
3S
oc)
do
o .r,
sg
-o
FE
lo'
Ed
-a" ts
'5s
d. 8.
6(!
oj
9E
3<)
aqt
6E
EO
5r
h.=
X. c.
hoo
coo
()=
=o
9>
o<
-.: e.i
6)
o
z
L
o

11. 17CS/IS33
&b,
7 a. Define the following with example: "@mf"
i) Binary tree ,*Sa,ls
ii) Complete binary tree -
.##
iii) Binary search tree W
iv) Threadedbinarytree. M; " (roMarks)
b. Write C routine for In order Pre order and Poqffil& traversal with example for each.
* . ffi ,," (10 Marks)
8 a. Explain how to dq#- "ffi
i) Insert a node into binary searc^h trdUi A,'
c.
, Insert a node into binary searc! tr&f =qy.'
ii) Searching a binary search tk%,, _i d (10 Marks)
b. For the tree given below write th€ hpider Pre order and Posffiider traversal. (06 Marks)
*W* -fu W
ffi {h.d
- .{" -k eu (05 Marks)
b. uxphifuhdfoilowing traversal qEtffias: dtu;*
i) Bibadth first search ro3 ; -
t) [Jr s4tltlr ru st 5(,alull !%.r.
ii) Depth first search. * r ,***,%' *_y" (10 Marks)
c. Explain Radix sort. *m ls6, dW (05 Marks)
,g$** ,^ s--o''
"l
,25 (04 Marks)
9 a. Define
ffi-exphin the matrix and 4djdcency list representation of a graph with example.
c. Bxplam Radx sort. - s& ]d&* " '{
d3%*" ;6r@ (05 Marks)
d# ,^ s.-o' "*hl
l0 Write a note on: 5v' u'&. -, d
a. File Attributes & d *&&
b. File Organizatiqffid Indexing 6q}y- 4ff
c. Hashing #*
- .*,ry-? &"'
d. Elementary graF"h operation. {4ie#
; ' (20 Marks)
r '' &" ...tqt&
te*h.*
,*m ,*q.'tfl d3atr
"#%* d tf %r
I &.{$ti.* ***** d
Y @'%# -
-r
d n3p- *W
+ffi e,P w rd& -w
,*w *& hh3& W
qT f*qh,*J
Y v.*.
"& . fr
&"f #q*
'ftb, P &3
kqeh
%3 **
**
;1
rt*
'%f
; {BBe
-&"-ru
i&
-'%,
,*l%E,
-:'.ite
'qr Y
,4,
.&
,&*., w
Pre order and
2 of2

12. USN
B.E. Degree Examination,
{*% ,, t
ion, July/August
Network Analysis
,,;,X,$ rr'f ;-"i; t* len-d rp',,,,r,1,
"l' -r-.A ;;' ,,
! ,j&.
Fig.Q3(b)
across the terminals a - b for the
17EC35
2021
(08 Marks)
(04 Marks)
(06 Marks)
(06 Marks)
circuit shown in
(08 Marks)
Time:3 hrs. *-t XJ ;{@x. Marks: 100
'*."* C:"
Note: Answer qgt FwE full questions. _ T{
Note: Answer
WFmn
nil questions.
*, * =
I a. Using source transformation tech4ifrEsffind 'v' for the circuit e*nig.Qt(a).
Third Semester
t 'i'
Fig.Q3(c).
0)
o
o
6
{)
E)
.lJ
ER
EO
5
oo ll
troP
.= c.l
ds
Hbo
Yo
otr
-c !l
o>
():
.=o
o=
bU
00c
-o
?6
lsE
!cB
-hts
5r
lc)
tro.
(].i
,;o
!j 'ii
t (.)
@t=
E'E
E0)
/_9
>' (H
b,)o
cuo
=d
:r -q)
6e
o-
c)
l.<
J c.i
o
o
E
tr
,.t:4.rii Fig.Ql(a) ,*tr (07 Marks)
b. Obtain equivalent resiffi*_dh"u for the. circuit in nrgQlb) and hence find 'i'.
%3 &---, -*ii,
*t* raov'
ffi- Irj$
,.i "r Fig.Ql(b) (07 Marks)
*i"{4,, ,i
c. Explainjfual?hd practical current sources. (06 Marks)
. s' &@
' '*" - -."_-*
..- -,{f1*, .6{e 'w
2 a" Deteffi?fu the current Io in the
"id4itf
fig.Q2(a) uri"g.ffit analysis.
k" 4tL "._
b. use nodal analyffifind vo in the n"_@;;?rig.qz&). .: ,
Fie.Q-IOL
with an illup&ation.
,in *re circuit shown in Fig.Q3(b).
". ^vi
t'
''i
i !X&
'*L.Y'7.
.,
c. E-xplaidthe concept of
*;*:'''
c. Find Thevenin's equiv%ffit circuit
:"'.rtt,
e q .,,.
- s,*
$
dtu*.
.,!*.
&o.t-
Fig.Q3(c)
1 of3
Fig:;Q2(a)

13. 4a. State and prove maximum power transfer theorem fiorgte case of AC source,
lv 12
that p*, = ef:
8R.,
b. Find the current through 16 f2 resistor using s theorem in Fig.Qa(b).
i7(o) 'fmA
17EC3s
hence show
(08 Marks)
(08 Marks)
(04 Marks)
(08 Marks)
(06 Marks)
t1-
lAtu
u., F1e,' t)
5 a. The switchl;itllir changed from positio$a position 2 x t: 0. Sready state condition
d!
'"
'*" -.,.' _: . di d2i
having''bih reached at position..!,.Find the values 9f.,,.i, : and + at t:0+.
t Fig.Qa@)
c. Find the current through (10 -jjffiir* niirir).i's theorem it Fig.e4(c).
jj
olL
lso
f-4, - ^HloF' 'h)
A&d
,,if'trJ,
li,,"i I *L.t:-ffi,, P- ,
J *: V,
'l
,1:,n
: I - --l
b. In the network{fibbn ur Fig.Q5(b)ey '': e' for t >
^gFJ
is zero for all t < 0. If the
'v^ d3v.
capacitor is initiilly uncharged. peterhrine the value gl"++ 416 r-] at t: 0*.
, el, ..,i,!!'l']ii,, rb.rL ,r^uX*4at'
dt'
ug
5(b)
l:r:i r rqr' <r' v/,
r.iExplain initial andFhal'conditions incase of a capacitor,
a. For the circuit sh,own in Fig.Q6(a), . '
(i) Find tli,A$ifferential equation foi il(t)
(ii) Find Laplace transform of ii(t)
(iii) Solve for is(t)
.{i1 ,ryli
11t.,,,.
Fig.Q6(a)
5u4J.
2 of3
(08 Marks)

14. b. For the circuit shown in
Laplace transform of i.(t),
Fig.Q6(b), (i) Find the
(iii) Solve for i1(t).
.'],&
.,.:.,:&*,,,r.
.-.:...
a';)'
differential equation
17EC35
for i1(t), (ii) Find
(08 Marks)
, Fig.Q6(b)
c. Obtain Laplace transform for a deciftipg exponential signal. -o-..-b (04 Marks)
f"i*-. ir ,.
*@
4uH V
FindZ and Y pardmeters forthe netqp-fk shown in Fig.e9(b).
{l'r"1* ,r:@
7 a. Prove that the resonant frequsffi the geometric mean offi two half power frequencies
i.e., Show that rrr,, = JrpL ., '"' (0E Marks)
.r;,,rriil,,
b. obtain an expression for.quglity factor of an capacitqf: ,, '' (07 Marks)
c' In a series circuit, + ='6t&, o0 = 4.1x106 rad/sec;"6andwidth: lOs radlsec. Compute L, C
halfpower frequeq{qf and Q. (05 Marks)
#u, ' ^".
8 a. Obtain an expreffioh for the resonant freqgffi in a parallel resonant circuit. (08 Marks)
b. Show that "Q*fe'branch parallel resonant c"ifcfuit is resonant at all frequencies when
-l-*'"8
d
R."=& - t-
',1 YL r .4
c. Find the value of Rp for which the'circuit is at resonanceqas shown in Fig.Q8(c). (05 Marks)
---f-r
;* FUP *Lo& *
#- ,$"t'#) .*;;*
9 a. Obtain an exprgssion for h-parameters. in terms of Z-parameters. (08 Marks)
V.,
aa-
(08 Marks)
(04 Marks)
(08 Marks)
(08 Marks)
10
,1.
n terms of ABCD parameters.
shown in Fig.Q10(b).
irr
-+
,o ,,
b. Find ABC
c" State reciprocity c.olaiiion for
(i) Z - paramel$?d{''
(ii) Y - paranibffi
(iii) h - pa"rar4etdrs
tiv'&ryParameters
,,'3,. ''
:t ,F ,1. ,F {.
3 of3
-9
IDVO
Fie.Ql0(b)
(04 Marks)

15. USN
s J%".
*..- i
Third Semester B.E. Degree Examinfridn, July/August 2021
."1
Discrete Mathematical Structures
.# !"c*.'%
J
"'
b. fortLe Fibonacci t"qr"fir-fu0, Ft, Fz . . #;ffiProve that
.,:'T* t l(t*"E)'mflJi)'l W
,'l: t l(t+"
-,r. ,ln =El[ ,
17C536
-"ll- '
* (oSMarks)
(06 Marks)
(08 Marks)
o
o
o
d
q
d
()
6)
ER
y5
dv
5
oo ll
trcP
.=N
ds
H hI)
Ho,
otr
-c 1)
!E
c'tr
o>
Ez
3E
bU
6JO
o'o
OIJ C
(nd
th
}E
tE5
E6
-?o
r<o
o!
go
tro;
oj
ti .9.
D:
6()
9tE
=
'15
EO
or
}'qi
boo
tr60
o=
qli
tr>
xo
E:
cl
o<
J c..i
o
o
z
L
o
#q*' ;s&
rime: 3 hrs. #;*-, dfftttr;*"
Marks: 100
Note: Answer qgy FIVZ Tull questions. ..
t
b" Prove that for urry proporition p, qr,r the compound propositiql',ir,'
tb "
q) + rl <+ [-r -+'-(p vq{Fllogically equivalent' ; (08 Marks)
c. Prove that for any proposition Pr g, r the compound proposition
tp*(q --+ r)) + t@*ddPtr)) is tautology. -tr& (06 Marks)
#% "' ,#E*
2 a. Prove the logical equiyhences using laws of logic
i) i(p"q)n1p*@)Jvqepvq -..
'':''
ii) (p + q)
" ffi" 1r v -dl <> -(9 v p) -
. (08 Marks)
b. Test the validiryr6'fthe following argumentiS
If I studyg I will not fail in the examinatior
.A: dar-
If I dp&t ffbtch TV in the eveningffill study .#' r,
*- a
*;***eir. ,,S&.. 'tP'
I faileffitheexamination !#t . r.-t
**tr ,',..,1..
(06 Marks)
c. Establish the validity ofitlie hllowing argumpqly'*$' ..
"ii
Vxllplxlvq(x)) u'.* Bm
Vx, { {--p(x) n qQ*}U? r(x)} i :- ,'+'**&'
---------w- li '-. '"'i";
.'. vx, {-r(x) +}ff)} i"i,#."* 3/
.''$r ''*h,3 . (06 Marks)
' 4 n)''
n "''i.t:t;i:,.
3 a. Prove tha*,,bathematical induqli6fr}that i: 1..*,
,':
. q( . ;"-^ I
%o'
f +3?:;1t52 +.............+Pn-jif : ln(2n- l)pn+ l) (06Marks)
t. sitge,l%,y J """"
..
L ,t''*1.4 - ..&.'.,*-
c. Find the coeftpi'a.nts of ;*,,J'
i) xe v3 iu ih. expansion of 12x .oi3y)r2
iij x''in ttie expansion of x3 fl - 2x)r0.
ii) xr2 in iffi"expansion of4' fl - 2x)''. (06 Marks)
;l1*!*.
a. In how many ways canffintical pencils be distributed among 5 children in the following
cases? '1

16. c.
.qi,.
-"&t3'
-&;:'
17cs36
L"%, '
ln how many ways one can distribute eight identica.l bEtrtsHnto four distinct containers so that
i) No container is left empty , i*6 i
ii) The fourth container gets an odd number of h.qlls. (06 Marks)
,*6-
Consider the tunction f and g defined b1f1ij'= i3 and g(x) : x2 + l, y* e R. Find gof, fog,
fz and, 92. ... (06 Marks)
5a.
b.
c.
6a.
b"
c.
9 a. Define :
v) Size of
b. Show that
f' and, g'. ,lq} .". (06 Marks)
Let A : {1, 2, 3, 4, 6, 12}. On A dffine the relation R by aRb if and only if a divides b.
Prove R is partial order on A. Draw the"t{asse diagram for this.relation. (07 Marks)
ffove K rs partlal order on A. ljraYrune nasse dlagram lor thls.re,trat1on. (07 Marks)
Let A * {l 2 3 4) and fand g beq$rltbtions from A to A givffiy f: {(1, 4 Q, l), (3, 2),
Define an equivalence with example.
ting the positive
(4, 3)),g: {(l ,2),(2,3), (3,.4{k#l)}.Prove that f and g uibffir*e of lach other.
Draw the Hasse di of36.
Fie Qe(b)
2 of3
(07 Marks)
(08 Marks)
(06 Marks)
iv) Order of graph
(07 Marks)
--
u'.
.16&-- "ri,
&i8o..
:l
tt) rmoY3"(u), r -(l), t -(J), t -(o)t
... ..:' i!. (06 Marks)
:= ,*
*1
a. out of 30 students in hostel,,:l5litudy History, s #,iri6"nomics and ffiay Geography. It
is known that 3 students stuBtnall these subjects."${gw that 7 or mordhffienis stuAy none of
these srrhiects. t-3"-' .* 9. @ l" /o7rr,r6-L6
these subjects. ,.T:"- uE.,.] *w (07 Marks)
b. Find fhe rook polynom-ial:for the 3x3 boar(;i$ffi expansion for-rnula. (07 Marks)
c. Solve the recurrengp,,rdlation a,, * an-1 - 6E-&O n > 2 give^g aoT$ -t ar : 8. (06 Marks)
ffi ##* qh:
a. An apple, a baffia, a mango and qf"ffilifge are to be distrib$ted among 4 boys 81, B2, 83,
B+. The boys 81 and Bz do not wish to have an apple. fhe boy 83 does not want banana or
mango, F&iefuses orange. In how.g,rany ways the *#.iffition can be made so that no boy is
displffi"" J3; (osMarks)
b. Howfrffiy permutations offi 3'"4 5 6 7 8 are notdeiangements? (05 Marks)
c. TJre,:number of virus affftiaflfiles in a sy.qte{ is 1000 (to start with) and this increases
- q€p%, every two ho,qrs. Udb recurrence ffiibn io determine the number of virus affected
(07 Marks)
.files in the system 4fter one day.
(06 Marks)

17. 17C536
_ _v_
Find the prefix codes for the letters B, E, I, f, Ll41P, S, if the coding scheme is as shown in
Fig Qe(c).
&. 1k
1&E
c.
l) Fi
z) string i) 0000111_000d1 ii) 1l I I I l1l10l1010111l0 (07 Marks)
"€
:i
rt.
-, 1
., t;_..
:*': *
t_ "'
{!b*-',.
t0 a. Obtam#i optimal prefix code forthe message LETTEzuftiTIVED. Indicate the code.
b. Apply the merge sort to fof$rifrg [st of elem"nta"#&* Jq]
{-1,0,2,-2,3,6,-3,5,ldqff'
q 'Bii" &r s (06Marks)
c. Let Tr : (VI^ED;;'{hfry2 E2) be twoepa&bs.sif lErl = r9,an$ frrl = 3lV1l determine
lV''|, lvzl& lE'|. *
*''
,*," I eh (06Marks)
,:t " 'i"*d*
:...
{'****
'a
'"&"" *-'''"&
$u,
-q- .. -.Y &ffi
&
.4P% r%, w ,, '
":t- & '5&
,rese&*J
. # n. tx
.,a.'? '&,erB
.'.;
Y-':u.:'
d*s"""" "#ts
,. Y.-
"-B*s f ,$..y6t
$-l&Yr&f
3 of3

18. ffiffi_#r
,r* #:
* 1scs33
&
isY
s
f%'"- c
Third Semester B.E. Degree Exan1ffin, July/August 2021
Data Structure andAirplication .i,
m'q. '. *ffi
Time: 3 hrs. m* ffiu*. Marks: 80
Note: Answer gt ffinfiuil questions. *
*
eryy 4"
I a. Classiff Data Structure, brieflV.ffi d# (05 Marks)
b. Explain how to use structue$ffi; a program to dispffiecord of at least 5 student
(R No., Name, US No, Mark$, 6pde) using structure. . . (08 Marks)
e Define nointer. Exnlain hr,rur- S ileclare and use oointen-" - (03 Marks)
0)
()
o
r
€
d
t(.)
o
ER
y-
!,,
bD ,,
tr09
.= (
dt
H bI)
tso
otr
-c !l
e:=
E'F
8z
.Eo
3E
bU
do
ot
urJ c
€d
E:
}E
ts5
!(g
-e" ts
xa
6=
IU
HB
5sg
(Jj
r'iO
B()
i, lE
q'E.
EO
3=
>' +r
o;o
troo
()=
LA S)
6s
o-
oi
J c.i
u
o
z
ad
L
a
tr
c. Define pointer. Explain kW,,6 declare and use pointg*_ry*6 (03 Marks)
k:r t
ffiq' "J ffi-
Z a. List and explain the fublbn supported by C for Offiic Memory allocation. (04 Marks)
b. What is polynomiaffiplain how to representpo$nomial. (04 Marks)
c. Write a progranffirdtl two polynomials. *% (08 Marks)
3 a. Define stae'l6 Eynlain the operations perforft€d by stack. (04 Marks)
b. Implemd ffisfi and POP function for $tack using affays with StackFull and StackEmpty
condili6irs3' *ffi ;fu, (osMarks)
c. fxplfiih+ind implement Tower
"qyfri. ;W (04 Marks)
"v *{ds' 4,
4 a. Discuss application of staclgi,
*
*.W* -3ffi
(04 Marks)
a. Discuss application of staclg'" " * *ffi ;q;ffi (04 Marks)
b. Define queue, circular g*:ffi Implement enqu@nd dequeue func$on for queues using
array.W#eIwe(08Marks)
c. Defihe recursion. Writp alrogram for : ;'-ff M
(i) Factorial of ffiumber - ff*s
is "@'
& * W (o4Marks)
w? *?"
&w
'%#
5 a. Define singlydil$d [st and doub] fiftda list with
(tii) dDelete a node &'
4s@ Display singly.li
ffihut are the advanthl
Iist ;$;* (08 Marks)
doubly linked lhfouer singly linked list? (04 Marks)
%l %.%,- €
a. Define singly+liktd list and doubf;r li=iikEd list with
"*ffi".
(04 Marks)
b. Create qqiagly linked list of i#gep. Write a tunctioiilb:
(i) ;ffi"i,alistwithdEffi;' &#
(ii) ffip6rt a node in the*liqUs
''" **. *n
(iii) op"t"r" a node froniTirpfist &Se
il( n:---r--- -:---r-. r:-r-^id:^. m"% /fla turor.rzsl
rst
ffiffiut are the advffigS of doubly linked ht'over singly linked list?
3l q,b.*qt* u d
ry W* ^q€
6 a. Define Sparsgga&ffi. Express tt
9*Sffi sparse matrix in triplets and find its transpose
g,%.ry[o o 4 o'3pl
,%i
l* s.o-o*ol
I rq; I (08 Marks)
lo ffiqr I 0l
I d':+* |
[o b'' o o 2)
b. Explain circular ligediist.
em
7 a. Define: (i) Treffiii) Binary tree (iii) Complete Binary Tree
(v) Skewed Tpee' (vi) Level of tree
b. Write th*utine to traversal given tree using :
(i)preffi#traversal (ii)post-ordertraversal.
&# lof2
v
s
'"
A!B
(08 Marks)
(iv) Strictly Binary Tree
(08 Marks)
(08 Marks)

19. 8a.
b.
9a.
!., 'e're,n
d-;"&
&P
6,Fq',
., "
&r".q
tu"% s
'c&, Y
&* 8* d
'&i.. ?(' "
#% r f&Qe(u)
b. Write algoritlmpwbreadth first search rq*ffith first search.
,e"
-; 'V
(08 Marks)
(08 Marks)
(06 Marks)
(10 Marks)
10 a. Explain ing in detail. t '$'
b. Wri
wur-nasnmg tn oerall.
^
affirithm (i) Radix sorr .ffiPlnsertion so*. *6fu
-W*&*
* *,t*d.,1.*
*t.-# &e-
-'E.8.
-a
"&i s
','
&*5
ide-'"&
{{
"t
2 of2

20. ffi$ffiffi,$
USN ,nL .
'
;, ,B.lf 15CS34
.,.r. - -i.1.
o
o
o
a
(!
(n
()
o
.!
tQo
6U
=n
ooll
tr@
.= (
dt
Hbo
EG)
()tr
-c()
8z
.=o
a=
bU
(io
tr
o€
o0s
.E in
'dk
?6
tsj
"r, (d
xl
6r
qa
li O-
(f ..,1
aio
vd
t()
@E
=!
b"9
O.=
X(H
ooo
trbo
Xo
uk
rJ<
*N
()
o
z
q
ti.dri, July/August 202 1
Gomputer Organization
...:a: 'tt
Time: 3 hrs. .'r.:i.tt''' '.s*l-t
Note: Answer r*iffi,rrlr questions. ;6pilax' Marks: 80
5 a. Explain organiiption of 2m x g d,Vnnmic memory chip. (08 Marks)
-t '' ---..-",,, ,....,r (08Marks)
i'
,,
vv.r-its/
6 a. Explaig'hmiciative mappingCIith a'necessary diagram. (05 Marks)
b. pgsc*ffittre organizati"; arurhal memory.
o ''':,
c. wriqs short notJs;h;;J jirt a.i".. (05 Marks)
_ _--_-:_ (06 Marks)
Z **P&w a4 bit carrS
@erform the multi
:ad adder aad e*fiain. (06 Marks)
of+l]. an{ -Qusing Booth,s algorithm. ioo ruarr<g
c. Describe Z Uif Uvfllit array multiplie{.
:., '
iL. r fl - -- -----r ---*-!ryrry+3; (04 Marks)
* 'rr
Explain mffistliraard format offlilting point number. /o6 Lrronr..
b. rxptain t . i&""pt ;r;;;;;;;ffi;ftf1ffi;fih, register configuration withfilf#,?
example.
c' Whaiare two limitationq,of Carry Save Addition (CSA)? ffffi13
9 a' Yie u fi*u',","*ll.1.r.l ,mi. bu.s organization of data path inside a processor. (0s Marks)
b' with a suitable dggram, explain inlut and outpui gating for the registers. (06 Marks)
c' List out the 4 ag-tffis u.. ,"Ld.d to execute aat 6r;, R1 instructioi. (02 Marks)
l0 a'
3:t::?^t.rhe 'basic organization of micro-programmed control unit with a neat sketch and
I a' with a neat sketch, describe trre, st41# takes place to executo-an instruction. (08 Marks)
b' Explain briefly pipelining and'- super scalar ,ip"*ri",
"r.,,ffi.;;r", with a suitable
examples.
c' whaiis performanc" -"ur*ffit? Explain overall spEC rating for computer. [[iffill3
, .o
a
2 a' what is instruction? n4f,ii'iibasic insiruction type${ilh suitable examples. (05 Marks)
b. Explain the followins g.-Ediessing modes *itt, .*io,ptei, r -
(i) Register.od.g,
" /ii) Absorute.lod.e
. . (iiii Immediate mode (06 Marks)
c. Write short note;, qn encoding machine i"rta$!n. (05 Marks)
3 a' what is in4gtpt? Explain the implementation of intemrpt priority using individual intemrpt
request a{{ a'&tiro wledge I ines.
? Yl"U;{"rmeanbfi;;;;;intemrpts?Explain. .. ". [31ffi:13
c' what is:bus arbitration? what"*.iits typesl Expla,i.f$ii simple arrangement for bus
arbitrationusingdaisychain
.,r
".j#a
-----;
(,7Marks)
4 a' Explain sequence..of eveffif,uring read operation-of synchronour-dr$uta transfer with
respect to timing diagram. --- -* a--
b. Describe *itt, u"n"ui-rl!.,i"r, printer to procg$sor bonnection. ,.,,,..
,,i (05 Marks)
c. write a short *t. q" tlaB;n,;;;"ffi
";.*rr#"''""'"' _
, o ffi ffi13
--1
examplq..r'g"
rerr s rl
(10 Marks)
b. writeqprt note on Digital camera. (06 Marks)
S **qs&

21. USN 15CS36
Third Semester B.E. Degree ExaminatiffilSuly/Augu st 2021
Discrete Mathematicalffiifiuctu res
Time: 3 hrs. ril_ - Max. Marks: g0
Note: Answer any FIVE fulluquestions.
b.
c.
0)
o
o
d
(n
d
E
o
d
o
k
EP
o;i
-B
?^
GlI
7la
!, tt
coo
.EA
d<f,
H00
tr0)
OE
-.c c)
€E
oB
8e
o=
o (,)
do
o.d
00c
.9 cd
}E
6r
'(,d
-bts
6lJ
q6-
()j
e.v
9E
te
i,t:
EE
t()
=a
^,=
>. (H
ooo
coo
o=
:f9
6s
().
L./<
- c.l
o
z
(d
L
o
a
I a. Prove that for any propositions p, q, r the compound proposition ..
[(p-q)"(q-+r)]-+(p-r) isaTautolsgy. (05Marks)
b. Consider the following open statemefrts with set of all real numbers as the universe.
p(x):x>0, q(x):x'>0, r(x):x''-By' -4=0 :
Determine the truth values of the^fqllowing statements. .
(i) 3x,p(x) n q(x) ,,*.
tu,."".
' ' ",.,t
(ii) Vx,p(x) * 9(*)
,,,.'!:tl:: (05 Marks)
(iii) 3x,p(x) n
;(xf
c. write down ttre negattffi#each of the following',[taiLents:
(i) For allintpgers n, if n is not divisibl e by 2, then n is odd.
(ii) If k,"nfhiire any integers wher?&m) and (m-n) are odd, then (k-n) is even.
, }sJ ".*e-l'" (06 Marks)
2 a- Prove the ftrlffiing logical equivalenceffiithout using truth tables:
(r) (-p"-q)+(p,^.qn r)]epn q.
. Ui'.
,L
[- (p v q)^ r]" - gJ <+ q
^, .r,,,, .,. (05 Marks)
b. Test the validity of the following argument.
If Gopi goes out with friends, he .ivill not study. :,fu.,. .
q .-=
If Gopi does not study, hixfrlher becomes anggry kY' 1},
Q Jd;:*i
(05 Marks)
c. Give (i) a direct..prodf (ii) an indirbct. proof and (iii) Proof by contradiction for the
following statemept. , %,
"lf n is an odd integer, then n+9 isffi$3n integer". ..
-'',
(06 Marks)
3 a. Using mathematical induction,,grou. that for each n'€ z*,
*-
1' +#P + .....+
"' =
*q!o
p 2n + r1. :4 (05 Marks)
b. A bit is either 0 or l. 4 byt" i, a sequence of 8 bits. Find :
(i) the number pf bytes,
(ii) the number of bytes that being with I I and end with I I
''i;.; (iii) the rrumber of bytes that begin with I I and do not end with 1l
(iv) number of bytes that begip with r 1 end with l r. (06 Marks)
c" Find the cp"ffiient of x2y2z3,q11,. expansion of (3x-2y-42)7 . (05 Marks)
4 a. Suppose U is a universal set and
A,B,B, ---Bn G U, prove that
en(n, trB, t-r.....uB;)=(enn,)..r(enBr).....v(ana"). (05Marks)
How many positive iptegers n can be formed using the digits 3,4,4,5,5,6,7 if we want n
to exceed 5,000,qqQ? (06 Marks)
A total amoun&ff,.fil.s.1500 is to be distributed to 3 students A, B, C of a class. In how many
ways the distffiion can be made in multiples of Rs.l00.
(D Ifeveryone of these must get atleast Rs.300?
(ii)
-l$$must
get atleast Rs.500, and B and C must get atleast Rs.400 each? (05 Marks)
,,,it,= | Of 2

22. 5a.
b.
c.
1scs36
&r
Show that if any n+l numbers from I to 2n are chosen, thdp'bf them will have their sum
^^--^l .^
^-^ ' 1 ,-? " j
equal to2n+1. (05 Marks)
d;?ftil.&" ur rvrarKs,,
If f :A-+B and g:B-+C are invertible functio#il$bn prove that gof :A-+c is an
invertible function and (gof)-r : f-ro g-r . "" $i3 (06 Marks)
(06 Marks)
"a divides b". Prove that R is a partial order and draw its Hasse diagram. (05 Marks)
On the set of all positive divisors of 36 - O!u'3 idlation R is defined by aRb if and only if
"a divides b". Prove that R is a partial order andtiaw its Hasse diasram (05 Mqrkc)
,e
6 a. Let A = {1,2,3,4,6} and Rbe a relatri&ffiiA defined by aRb if qndbnly if a is a multiple
of b. Represent the relation R as a matrifrhid draw its digraph. (05 Marks)
b. Let f :A -+ B , g:B + C be 2 fq;giiftls then prove that ,",.1
t'
(r) If f and g are one-to;eh.}.s0 is gof ". %
(ii) If gof is one-to-one then f is one-to-one. u- "
(iii) If f and g are ontO, So is gof. , (06 Marks)
c. On the set Z of atl inteffit€;6 iehtion R is defineO,bi*nU if and only if a2 : b2. Verifiz that
R is an equivalence rela$n Determine the partitffiduced by this relation. (05 Marks)
'":, ?
7 a. There are eight ffi to eight different p,egplc to be placed in eight different addressed
envelopes. Fin{Flg'frumber of ways of daihathis so that atleast one letter gets to the right
Person' i.:,.+' (05 Marks)
b. In how pan-y ways can the 26 letters of English alphabet be permuted so that none of the
patternslQ$,R, DOG, PUN or BYTp occurs? (06 Marks)
c. Solve*the recurrence relation an
;3an-, = 5x3n for n >;1., grven that do=2. (05Marks)
.l,,;
_ ,F;," d
8 a. Find the rumber of derangernents of a, b, c, d. * Y,:;:' _;..* (05 Marks)
b. Fow persons Pl, P2, P3,"ffi,'ivho arrive late forff$iirfier party find.t"hqf,only chair at each of
the five tables Tr, T2, T,i,,l'o and Ts is vacanl?ltiill not sit at Tr oi Tz, p2 will not sit atT2,
Pj rill not sit at T3 ol Ta and Pa will not..sii at Ta or T5. Find the number of ways they can
occupy the vacant chairs. ***
* (06 Marks)
c. Solve the recurrbnctj relation u3., -.*ffi + aa! = 0 for ,*ry given ?o = 4 and a, = 13 .
et{F J'*&i;"*r { (05 Marks)
- "t - 't *&t
'liii:{
*Y:"
9 ?. lrove lli$rn every graph, the nrihber of odd degrdd'l%rtices is even. (0s Marks)
b. Discuss the Konigsberg bridge problem. (06 Marks)
c. Consiiuit an optimal pfg.f,l,-p,iit. for the letters of the word "SWACH BHARAT,,: Indicate
'
tke
oode'
-
"'o'' ,'; (05 Marks)
;"n
10 .{,&verify whether thq,Htlowing graphs are id6morphic: (05 Marks)
--t."',,.
Fie. Ql0 (a)
b.
c.
Prove that a tree u4lthtr vertices has exactly n- I edges.
Define the follq,$.nb:
(D Regp,laigraRh (ii) Complete graph.
(iv) P11h,t'"' (v) Cycle.
*fe
*{<***
(05 Marks)
(iii) Bipartite graph.
(06 Marks)