Scribd
Upload
44 views2 pages

B.tech Computer COT-207 2015

This document contains a technical examination with multiple choice and long answer questions covering topics in computer engineering, mathematics, and discrete structures. The exam has 4 questions with several parts each. Question 1 covers relations, probability, logic, and algebra. Question 2 covers group theory and number theory. Question 3 covers graph theory. Question 4 covers number theory and recurrence relations. The exam is designed to test fundamental knowledge across these technical domains.

Uploaded by

mard gharib
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
44 views2 pages

B.tech Computer COT-207 2015

This document contains a technical examination with multiple choice and long answer questions covering topics in computer engineering, mathematics, and discrete structures. The exam has 4 questions with several parts each. Question 1 covers relations, probability, logic, and algebra. Question 2 covers group theory and number theory. Question 3 covers graph theory. Question 4 covers number theory and recurrence relations. The exam is designed to test fundamental knowledge across these technical domains.

Uploaded by

mard gharib
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/ 2

NATIO\AI, I\S1'ITI]'f I' OF 1'IiCII NOI-O(;\'

r(LltttrKSIIu'f tiA

ernr 'lihcorl l.rauination: Dat")0I 5


-l
llnd M -t,
N'l :
Subjcct: I)ls.r-r,l e Stt ut tr.tTt,s f)uration:-l Holi s
Srrbjcct (iodc: CO7 )A7 Branclr: CoarTrrrlr,r l,n gi n ee r i n ;1

\o l tl; l. l hLrr urL tr. printcLl putt: in thi; qttt;tion 1ta1tr


jt .. ........./
-i .l/l 17;r|'rr;r' ttr,, LIntptri"orl
/ .1.::ttntL tuittihit Juru i1 ntit:iny

Ql. Allenpt a1l parrs o1 lhe lbllouing llx5l


(i) Considcr lhe lbllou,ing lclation R on set A: 1a. b. cl :

R | (a. a)- (b. b). (c. c). (a. c). (c, b), (b. a) l
r..r I lr''t\\ 't. J't<.te,t 1 rr1r tcl,tc !t|LJI u
(b) ls R equii alencc rclationl)
(c) Is R parrial ordcring relation'l

(ii) Irind thc nrinirnurr nurrbcl ol'studenLs necdcd 10 guar-antee thal lj\,e ol'theln
bclong Lo Lhe sarrc class ( Flcshrran, Sophomorc..lunior', Senior).

(iii) \\hal ale thc contrapositive. tllc converse, and the inverse of thc conditionai
"
sLi]lL-lllcnt: ihe hontc Lcant r,",i|ts whenevcr it is Iaining'1"

(ir )\\ r itc Dc N'lorgan's Lnu,s for Quantiiicls. WhaL ar.e llle negations ol the
sial!'nrcnrs vr/rr --.r; and 3-r/rr - 2/? (Simplitl,),olrr ans\\ef)

(\ ) \nloilS 7j childr-cn $.ho went to an alrusetrent parh, rr hc-rc thL') colrld ride on
:r,crlr-go-round. rollet coastcr and l'erris whcel. It is knoun th:it. l0 rt1-thern had
:ilk|'n rll tllrce rides and 55 hacl Lalien at least t\\o ol the i rides. Each ride costs Rs.
Lr5ll and total rc'ceipt of park is Ils.70. I)etcrrrinc the nunrbel ol childrenutodid
:rLrl 11\ tr\ ofthc Iitles?

1lP:g?
Q2. r\ucnpr all parts o1'rhc lbllonin!. lr,5l
(i) Pro\ c Lhat thc lbudh rools ol unitl I I. I . i, -i I lbrnr an abelian nrultiplicatir c'
cro uP.
(ii) gloup uith i-5 clcments. Lct L bc a subgroup ofG. ll js kno\\l rhar
Le1 C; be a
L 1(i and that thc sjze o1'L is at least;1. Then Uld the sizc o l- l_.
Flint: fhc nurnbcr ol eleincnts in a gr.oLrp is called thc ordcr isize) o1.thc gr.oup.
(iii) Consider thc mapping l': Il-- lt' !cllne.l br ll\) : \. rrherc Il' is the
nrultipiicative group o1 lronzero rcal nuntbers, ancl thc rrappiug is horrornorphist.l.
I hen find the kcrnel ofthis hornomorphisn.
(ir') Shou. that thc grolrp ((r, r,, ) is a cyclic group Bhcre G: 10. 1.2.3.4, _:1. find
ils all gcilerators.
(r') Dcline the tbllou ing tcrms with suitable cxanrple (a) Ring (b) Ficl<J

Q3. Attenpt all pafts of the lollolring lr'5l


(i) ls thcre a siliplc grapli u,ith drgrec scquence (1. 1. l. j. l. .1. 6. 7l'l Gir e
reasors fbl Jrour ans\l'cr'.
(ii),\ connected pianel graph has lU \,eltlccs cach ol degrce j. inlo hori Inartr
regions, does a reprcsertatiol'r ollhis planer graph splir the plane?
(iii) Suppose that a trcc hasN| r'crticcs ol'degree 1. I \,crrices of degrec l- I
\enices ofdegrce J and I vcr'1ices o1'deglee 4. Find N1.
(i!) What is thc lalgest possible nurrbcr ol-veftices in a graph riith i_i edses and
all verticcs o1'deglee at Ieasl J'l
(v) Deline the lollowing terns i,',ith suitablc cxample
(a) Fiuler Gr.aph (b) Minimum Spanning Tree

Q4. Attempt all pafts of the fblloiving l5xll


(i) IJow man,v- nurnbers are thcre between 100 and I 000 rvhicir have exactly ute ol
their digits as 7?
(ii) Find the gencral solution of the ibllorving recurrencc relations:
ia) a,,, - 4a,., I 4a,, : l"
(b) a,, - 6a, I l Ean.:: n.,1" g,here a.: E and ar :22.

BI-ST OIT LUCK


2JPage

You might also like