MTK3013

Discrete
Structures
INSTRUCTIONAL PLAN
Department of Computing
Faculty of Art, Computing and Creative Industry
Sultan Idris Education University
0
SEMESTER 1 SESI 2014/2015
INSTRUCTIONAL
PLAN
Faculty : Faculty of Art, Computing and Creatie
Indu!try
"epartment : Computing
Seme!ter : #
Se!!ion : 2014/2015
Cour!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 : mramla,0f!.i.1up!i1edu1my
Telep,one num2er : '3/43'3'546378& 9(P: '#& 8'58843:
Room num2er : $alim Sar;ana, Room &-/##
Name : "r -a,2i2i Ra,matulla,
*/mail : 2a,2i2i0f!.i.1up!i1edu1my
Telep,one num2er : '3/43'
Room num2er : $alim Sar;ana, Room &-/#<

COURS* S=NOPSIS :
The course discusses the set theory and operation, logic, mathematical
order, permutation, comination, proaility, relation and digraph,
!unction, tree and machine" These learning contents are essential to
e#uip students $ith the logical reasoning re#uired in the learning o!
computer programming"
%Kursus ini memincang&an teori set dan operasi, logi&, arahan
matemati&, pilihatur, gaungan, &earang&alian, huungan dan digra!,
!ungsi, pepohon dan mesin" 'si pela(aran ini amat diperlu&an dalam
memenuhi logi& pengetahuan semasa pemela(aran aturcara &omputer)"
1
Head of departments
Verification:
Date:
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 in
con(unction o! manipulating, !ormulari/ing and practicing" %,4, -2,
,T3)
3. 0pply appropriate notations and techni#ues $ithin mathematical
unch o! 1eld" %-2, 221)
4. *+plain mathematical contriutions in real li!e en.ironment
applications" %,2, 02, ,S2)
TRANSF*RA-L* S%ILLS:
-ro.ides &no$ledge, understanding and s&ill concerning discrete
structures !or sol.ing prolem in programming"
R*F*R*NC*S:
Main 3e!erence4
Kenneth 5" 3osen" %2013)" Discrete mathematics and its application %6th
ed")" Singapore4 Mc7ra$85ill *ducation %0sia)"
0dditional 3e!erences4
9ames :ran&lin ; 0lert Daoud" %2011)" -roo! in mathematics4 0n
introduction" Sydney, 0ustralia4 <ua&ers 5ill -ress
9ohnsonaugh, 3"%200=)" Discrete mathematics" >pper Saddle 3i.er, ?94
-earson"
Stein, ,l" 2", Drydale, 3", @ogart, K" %2013)" Discrete mathematics !or
computer scientist" *mery.ille, ,04 Key ,ollege -ulishing"
Susanna *ppAs" %2010)" Discrete mathematics $ith applications%4th ed")"
:lorence, KB4 @roo&s/,ole"
$*T(O"S OF SOFT S%ILLS *$-*""*":
2
STU"*NT+! P*RFOR$ANC* ASS*SS$*NT
Cour!e ?or. Percent
age
"etail! LO @
8'
AuiB 2C1 15
$id Sem Te!t 2C1 ; 2C2 20
Pro;ect 2C3 ; 2C4 15
Tutorial 2C2 ; 2C4 10
Final eCam 2C1, 2C2 ; 2C3 40 4'
Total #''@
>RA"IN> SCAL*:
>rade Point! interal >PA6C>PA
Actiity %O$ -%$$ P-P
$
%%-P %%U %%P *$
AuiB -%$$
&
$id Sem
Te!t
-%$$
&
Pro;ect %O$
#
-%$$
& P-P
$#
%%-P
#
Tutorial %O$
1
-%$$
&
A22reiati
on
S.ill!
%O$ Communication S.ill
-%$$ Critical T,in.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 *t,ic! and $oral
3
0 D0 E 100 4"00
08 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*:

Ru2ric! a! in Buku
Kemahiran Insaniah/Soft
skills
Scale
4 *+cellent
3 7ood
2 Moderate
1 Hea&
4
D**% T*AC(IN> SC(*"UL*:
*Optional
Dee
.
C,apter6Topic Learning outcome!
At the end of each eek! the
students should "e a"le to#
Soft
!.ill!
TEL
Actiiti
e!
A!!e!!m
ent
1
Explain instructional plan and
attendance 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 propositions
suc+ as negation! con,unction!
dis,unction! e-clusive.or! conditional and
bi.conditional.
Illustrate t+e differentiation of compound
propositions and its use ness
Lecture
E
"i!cu!!
ion
FA22reiat
ion
Actiity A22reiati
on
A!!e!!ment
L Lecture A AuiB
T Tutorial U $id Seme!ter Te!t
P Practical6 La2 T Tutorial
O Ot,er! P Pro;ect
" "i!cu!!ion
1
2
Propositional Equivalences
- "autologies.
"autologies.
%ontradictions.
%ontingencies.
- &ogical /0uivalences.
%onditional.
%ontrapositive.
%onverse.
- 1se of logic to illustrate connectives
- 2ormal forms 3con,unctive and
dis,unctive4
*utline t+e basic propositional
e0uivalences.
Illustrate t+e differentiation of
tautologies! contradictions and
contingencies and relate it 5it+ logical
e0uivalences.
Lecture
E
"i!cu!!
ion
3
Predicates and Quantifiers
- $redicates.
- 6uantifiers.
/-istential 0uantifier
1niversal 0uantifier.
- $ropositional function.
- 7ultivariable predicates.
- 7ultivariable propositional functions.
- 7ultivariate 0uantification
Illustrate t+e differentiation of predicates
and 0uantifiers.
Lecture
E
"i!cu!!
ion
4
Rules Of Inference
- $ropositional logic
- 1sing rules of inference to built
arguments
- 6uantified statement
*utline t+e structure of formal proofs for
t+eorems using t+e tec+ni0ues of proofs.
#olve problems b( different met+ods of
proof.
-%$$ Lecture
E
"i!cu!!
ion
A#
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+ni0ues of proofs.
#olve problems b( different met+ods of
proof.
Lecture
E
"i!cu!!
ion
2
G Set Theory
- #ets
- Venn diagrams
- #ubsets
- "+e po5er set
- %artesian product
- #et operations
- #et Identities
- 8enerali9ed 1nion and Intersection
- %omputer :epresentation of sets

Lecture
E
"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.
-%$$ Lecture
E
"i!cu!!
ion
A<
D
Sequences and Suations
- #e0uences
- #ummations
Matrices
- 7atri- ;rit+metic
- <ero.*ne 7atrices
*utline b( e-amples t+e basic
terminolog( of se0uences and
summations and 7atrices.
Interpret t+e associated operations and
terminolog( in conte-t.
Lecture
E
"i!cu!!
ion
=
!asic "u#er Theory
- 'asic number t+eor(.
Divisors.
$rimalit(.
undamental t+eorem of
arit+metic.
Division algorit+m.
8reatest common divisors
38%D4 = least common
multiples 3&%74.
:elative primalit(.
7odular arit+metic
*utline b( e-amples t+e basic
terminolog( of basic number t+eor(.
Interpret t+e associated operations and
terminolog( in conte-t.
-%$$ Lecture
E
"i!cu!!
ion
U
3
- /uclidean algorit+m for 8%D.
10
Matheatical Induction$ *utline basic proofs for t+eorems using
t+e tec+ni0ues of proofs.
#olve problems b( using mat+ematical
induction
Lecture
E
"i!cu!!
ion
11
%ounting Methods
- $robabilit(.
- $ermutations and combinations.
- %ounting arguments rule of products!
rule of sums.
- "+e pigeon+ole principle
*utline b( e-amples t+e basic
terminolog( of counting.
Interpret t+e associated operations and
terminolog( in conte-t.
:elate practical e-amples to t+e
appropriate relation model.
Lecture
E
"i!cu!!
ion
12
&dvanced %ounting Techniques
- Recurrence Relations
:ecursive mat+ematical
definitions.
Developing recursive
e0uations.
#olving recursive e0uations.
#olve a variet( of basic recursive
e0uations.
;nal(9e a problem to create relevant
recurrence e0uations or to identif(
important counting 0uestions.
:elate t+e ideas of mat+ematical
induction to recursion and recursivel(
defined structures.
Illustrate b( e-ample t+e basic
terminolog( of grap+ t+eor(! and some of
t+e properties and special cases of eac+.
-%$$ Lecture
E
"i!cu!!
ion
A&
13
Relations
- :elation and properties
:efle-itivit(.
#(mmetr(.
"ransitivit(.
- /0uivalence relations.
- 7atrices of relations.
*utline b( e-amples t+e basic
terminolog( of relations.
Interpret t+e associated operations and
terminolg( in conte-t.
:elate practical e-amples to t+e
appropriate relation model.

Lecture
E
"i!cu!!
ion
4
14
Pro'ect Presentation %O$
%%-P#
-%$$
&
P-P$
Pre!ent
ation
P
TUTORIAL6LA-6DOR%S(OP PLAN
No To$ic Learnin% Outcome Soft
skill
Learnin
% &
teachin
%
acti'it(
Assessmen
t
# "utorial 1
- alse! "rue! #tatements.
- $ropositions.
%ompound propositions.
&ogical connectives.
- 'it string.
$age 12 > 1?
6uestions : @! A 10! 1@! 1A! 20! 2@ B 2C
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident.
%O$
%-P$
Discussion
in a form of
group
T#
< Tutorial (
- "autologies.
"autologies
%ontradictions.
%ontingencies.
- &ogical /0uivalences.
%onditional.
%ontrapositive.
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
<
?
%onverse.
- 1se of logic to illustrate connectives.
- 2ormal forms 3con,unctive and
dis,unctive4.
$age 33 > 34
6uestions : ?! @! A! C! 10! 11! 12! 14
& Tutorial )
- $redicates.
- 6uantifiers.
/-istential 0uantifier.
1niversal 0uantifier.
- $ropositional function.
- 7ultivariable predicates.
- 7ultivariable propositional functions.
- 7ultivariate 0uantification.
$age ?0.?2
6uestions : 4! @! A! 12! 14! 1@! 1C! 24
$age @0 > @2
6uestions : 4! @! 10! 1@ B 20
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T&
4 Tutorial *
- ;ddition.
- #implication.
- %ombination = %on,unction.
- H(pot+etical s(llogism.
- 7odes ponens.
- 7odes tollens.
- :esolution.
$age D4.D@
6uestions :2! 4! @! A! 1@
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T4
3 Tutorial +
- Direct proof.
- Indirect proof 3b( contradiction4.
- $roof b( cases.
- $roving e0uivalences.
- $roof.
- $roof b( Induction 7at+ematical
Induction
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T3
@
$age C3.C4
6uestions: 1! 2! 3! 4! @! C B 10
8 Tutorial ,
- /lement.
- #ubset.
- /mpt( set.
- %ardinalit(.
- $o5er set.
- *rdered n.tuples.
- %artesian product.
- 1niverse of discourse.
- #et builder notation.
$age 12D.12A
6uestions: 2! 4! A! 10! 14! 1A B 22
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T8
5 Tutorial -
- #et t+eoretic operation.
1nion.
Intersection.
Difference.
%omplement.
#(mmetric difference
#et identities.
- Venn diagrams.
$age 13A > 13C
6uestions : 2! 4! A! 10! 1@
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T5
G Tutorial .
- unctions.
Domain! co.domain!
range.
Image! pre.image.
*ne.to.one! onto!
bi,ective! inverse.
unctional
composition
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
TG
D
and e-ponentiation.
%eiling and floor.
$age 1?3 .1??
6uestions : ?! A! 1?! 1A! 44
Tutorial /
- #e0uences
$age : 1@D . 1@A
6uestions : @! A! 10! 12! 1A! 20
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T7
7 Tutorial 01
- 7atrices of relations..
Page 2 0.,30.-
Questions 2 (4 *4 +4 ,4 (14(,4 (.
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
-%$$
&
Discussion
in a form of
group
T#'
#' Tutorial 00
- 'asic number t+eor(.
Divisors.
$rimalit(.
undamental t+eorem of
arit+metic.
Division algorit+m.
8reatest common divisors
38%D4 = least common
multiples 3&%74.
:elative primalit(.
7odular arit+metic.
- /uclidean algorit+m for 8%D
Page 2 (** 3 (*+
Questions 2 /4 0(4 0.
Page 2 (-03(-(
Questions 2 (4 0)4 (14 ((4 (*
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T##
## Tutorial 0(
o Matheatical Induction
- :elations as subsets.
- $roperties of binar( relations
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
%O$
%-P$
Discussion
in a form of
group
T#<
A
- Digrap+ representation.
- :efle-itivit(.
- #(mmetr(.
- "ransitivit(.
- /0uivalence relations.
$resent ideas clearl( 5it+ confident
#< Tutorial 0)
8 Matheatical Induction
8 %ounting
8 Pigeon hole Principle
Page 2 )(+
Questions2 )4 *4 + 5 -
Page2 ).,
Questions 2(4 *4 ,40)4 0*
Page 2 )/*
Questions 2 (4 )4 *4 -
Page *1(
Question 2 (4 *4 ,4 .4 014 0(4 0+$
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T#&
#& Tutorial 0*
8 &dvanced %ounting Techniques
Page */*
Question 2 (4 )4 +4 ,
$ortra( verbal and non.verbal
communications
Do independent learning.
7anage information 5ell.
$resent ideas clearl( 5it+ confident
%O$
%-P$
Discussion
in a form of
group
T#4
Reminder: 9optional:
1" StudentsA attendance to all lectures, tutorials and la $or&s is compulsory
2" Students $ith total o! attendance o! less than D0I can e arred !rom ta&ing 1nal e+amination
3" 0ny asence due to health prolem must e corroorated $ith a medical certi1cation !rom -usat Kesihatan
-ela(ar >-S', >-S'As -anel clinics or ,linic/7o.ernment 5ospital"
4" 0sence due to other prolems must e (usti1ed using a sho$ cause letter"
C