template instructional mtk3013

8/11/2019 Template Instructional Mtk3013

1/14

MTK3013

DiscreteStructuresINSTRUCTIONAL PLAN

Department of Computing

Faculty of Art, Computing and Creative IndustrySultan Idris Education University


2/14

INSTRUCTIONALPLAN

Faculty : Faculty of Art, Computing and Creatie

Indu!try"epartment : ComputingSeme!ter : #Se!!ion : 2014/2015Cour!e name : "i!crete Structure!Cour!e code : $T%&'#&Credit (our : &Pre re)ui!ite : Nil

L*CTUR*R+S INFOR$ATION:

Name : "r Ramla -inti $ailo. */mail : mramla0f!.i.1up!i1edu1myTelepone num2er : '3/43'3'546378& 9(P: '#& 8'58843

Room num2er : $alim Sar;ana, Room &-/##

Name : "r -a2i2i Ramatulla*/mail : 2a2i2i0f!.i.1up!i1edu1my

Head of departmentsVerification:

Date:


3/14

RATIONAL OF T(* COURS*:'t is necessary to ensure that the student understand the concept o!

mathematics in computer science"

L*ARNIN> OUTCO$*S:

1. *+plain the theories, concepts and techni#ues in discrete structure"

%2, -2)

2. -er!orm prolem sol.ing logically, creati.ely and critically incon(unction o! manipulating, !ormulariing and practicing" %4, -2,

T3)

3. pply appropriate notations and techni#ues $ithin mathematical

unch o! eld" %-2, 1)

4. *+plain mathematical contriutions in real li!e en.ironment

applications" %2, 2, S2)

TRANSF*RA-L* S%ILLS:

-ro.ides &no$ledge, understanding and s&ill concerning discretestructures !or sol.ing prolem in programming"

R*F*R*NC*S:Main e!erenceKenneth " osen" %2013)" Discrete mathematics and its application %6thed")" Singapore Mc7ra$8ill *ducation %sia)"

dditi l !


4/14

STU"*NT+! P*RFOR$ANC* ASS*SS$*NT

Cour!e ?or. Percentage

Actiity %O$ -%$$ P-P$

%%-P %%U %%P *$

uiB -%$$&

$id SemTe!t

-%$$&

Pro;ect %O$#

-%$$

& P-P$#

%%-P#

Tutorial %O$1

-%$$&

A22reiation

S.ill!

%O$ Communication S.ill

-%$$ Critical Tin.ing and Pro2lem Soling S.ill!

P-P$ Continuou! Learning and Information$anagement

%%-P Team Dor. S.ill!

%%U *ntrepreneurial S.ill!

%%P Leader!ip S.ill

*$ Profe!!ional *tic! and $oral


5/14

0 E 100 4"00

8 65 E 6= 3"65

@F 60 E 64 3"50

@ G5 E G= 3"00

@8 G0 E G4 2"65

F 55 E 5= 2"50

50 E 54 2"00

8 45 E 4= 1"65

DF 40 E 44 1"50

D 35 E 3= 1"00

: 0 E 34 0

SOFT S%ILS >RA"IN> SCAL*:


6/14

D**% T*AC(IN> SC(*"UL*:

*Optional

Dee.

Capter6Topic Learning outcome!At the end of each eek! thestudents should "e a"le to#

Soft!.ill!

TELActiiti

e!

A!!e!!ment

1Explain instructional plan andattendance rules and requirements Introduction To RI

- Instructional plan briefing.- Discussion of course implementation.- Discussion of course evaluation

Propositional Logic

- alse! "rue! #tatements.- $ropositions. %ompound propositions.

&ogical connectives.

- 'it string

&isten attentivel(.

Identif( course content and evaluation

ta)en

*utline t+e basic terms in logic

proposition and compound propositionssuc+ as negation! con,unction!dis,unction! e-clusiveor! conditional andbiconditional.

Illustrate t+e differentiation of compound

propositions and its use ness

LectureE"i!cu!!

ion

A22reiation

Actiity

A22reiation

A!!e!!ment

L Lecture uiB

T Tutorial U $id Seme!ter Te!t

P Practical6 La2 T Tutorial

O Oter! P Pro;ect

" "i!cu!!ion

1


7/14

2

Propositional Equivalences

- "autologies. "autologies.

%ontradictions.

%ontingencies.

- &ogical /uivalences. %onditional.

%ontrapositive.

%onverse.

- se of logic to illustrate connectives- ormal forms con,unctive and

dis,unctive

*utline t+e basic propositional

euivalences. I llustrate t+e differentiation of

tautologies! contradictions andcontingencies and relate it 5it+ logical

euivalences.

LectureE"i!cu!!

ion

3 Predicates and Quantifiers

- $redicates.- 6uantifiers. /-istential uantifier

niversal uantifier.

- $ropositional function.- 7ultivariable predicates.- 7ultivariable propositional functions.- 7ultivariate uantification

Illustrate t+e differentiation of predicates

and uantifiers.LectureE

"i!cu!!ion

4 Rules Of Inference- $ropositional logic- sing rules of inference to built

arguments

- 6uantified statement

*utline t+e structure of formal proofs for

t+eorems using t+e tec+niues of proofs. #olve problems b( different met+ods of

proof.

-%$$ LectureE"i!cu!!

ion

#

5 Introduction to Proof- 7et+od of $roving "+eorem

Direct proof

$roof b( contraposition

$roof b( contradiction

Proof Methods and Strategies

*utline t+e structure of formal proofs for

t+eorems using t+e tec+niues of proofs. #olve problems b( different met+ods of

proof.

LectureE"i!cu!!ion

2


8/14

G Set Theory- #ets- Venn diagrams- #ubsets- "+e po5er set

- %artesian product- #et operations- #et Identities- 8enerali9ed nion and Intersection- %omputer epresentation of sets

LectureE"i!cu!!ion

6 Function- Definition- *ne to one and *nto functions- Inverse function and %omposition of

function- "+e grap+s of functions

loor function

%eiling function

*utline b( e-amples t+e basic

terminolog( of functions. Interpret t+e associated operations and

terminolog( in conte-t.

-%$$ LectureE"i!cu!!ion

-S', >-S'As -anel clinics or linic/7o.ernment ospital"4" sence due to other prolems must e (ustied using a sho$ cause letter"

C

template instructional mtk3013

Documents