双语离散数学期末考试春季试卷A

4816952332248169523322电科大学2011年2期末考A卷课程名称：离数学

考试形式：闭考日期：2012月

日考试长分课程成绩构成：平时10%，期中20，实验0%，期末70%本试卷试题由_____部分构成共____页.题号

一

二

三

四

五

六

七

八

九

十

合计得分

(%（）（）（）（）（）

(∧q)→(p∨logicallya)T∨qd)p∧IfP(A)ispowersetA,A=whatisa)b)2c)2Whichofthesestatementsaa)TomorrowwillFriday.b)2+3=4.c)ThereisGoandwithme.Kdenotesthecompletegraphonnvertices.KsimplennoneedgeeachpairofHowcompriseK?20a)40c)95d)380andThenumberoffunctionsa)(9c)5

（）

LetbeaonthepositiveintegerswherexRyifxyWhichofthefollowinglistsofpropertiesbestdescribesrelationRa)reflexive,transitiveb)antisymmetric,transitivec)reflexive,symmetric,antisymmetricd)symmetric,（）

Whichoffollowingareof

U{1,2,3,4,5,6,7,8}

?a)c)

{1},{1,2,3},{3,4,5,6,7,8}

{1},{2,3},{3,4,5,6,7,8}{1,2},{2,3},{4,5,6,7,8}（）

Thefunctionf(x)=3xlog(x

+21)offollowinga)x

x

c)xlogxxlogx（）

Inthegraphfollows,forwhythereispathathatedgea)ofdegree,namely{B,D}./

1010（）

areverticesofevennamely{A,C}.c)Thereareverticesofevendegree,namely{B,D}.areverticesofodddegree,namely{A,C}.10.WhichoftheisZ?a)

f(n)

`

f)x

c)

x)

x

f()

n

1II.

or

10%)（）

If32,then7（）（）（）

p∧(q∨r)≡(p∧q)∨rIf,BandCaresets,then(AC)-(BC)=A-B.Suppose（）

(x)x

isdefinedawithRcodomainR.（）（）（）

SupposegBandf,fandf1-1.mustbe1-1?Ifq(compositeIftheonsetZmeansabthenisan（）（）

circuitforWlengthnn10.Thereagraphwithvertices,whose0,1,4,5,III.

Fill

()

pbethepropositions“Iamacriminal”“Ibanks”.Expressinsimplethe“ifpthenq:.P(means“2,areintegers.truthxis

.

Thenegationofthestatement“Notestsare”is.

If

11xR}iii

i

A

i

is

.

Suppose

()

is

.

Suppose

A

wheref

Thesumof232

is

.

Theexpressionof12)asacombinationof12and45is

.Therearesevenletters,C,EAimmediatelytheleftof.10.Ifisplanarconnectedwithvertices,eachofthenhas__IV.

the

(32)whetherfollowingargumentvalid:/

33rrupposeyouwishtoproveatheoremofform“ifp”.Ifgiveaproof,whatyouassumewhatyouIfgiveanindirectproof,doandyou(c)Ifyouproofcontradiction,doandyouProvethat

BAB

bygivingausinglogicalSupposefRf(x)Iff().IfT().theofbig-ohtothat

n52

is(n

).Solvelinear5x(modthePrincipleofMathematicalInductiontothat

27

n

forall.graphfordefinedbymatrix

10101

6

)

usingthetruthtable,thatfollowing→qb)[p→q)]→q/

VI.(6%analgorithmwhichwillfindofnworstcasetimecomplexityofalgorithm?VII.

(%)

Giveofatransitive

ortworelationsistransitive.VIII.(6

%)ofsgivenasfollowing:ProcedurePrim:undirectedgraphwithvertices)T:=minimum-weightfori:=1ton2e:=edgeofminimumaTan