l1_scs11113_course outline.pdf

COURSE PLAN (L1)

Faculty:Faculty of Computing Page: 1 of 5

Course: Discrete Structure (SCSI 1113)Lecture Hours: 56 hours

Semester: Semester 1Session: 2014/15

Prepared by: Dr. Noorfa Haszlinna bte MustaffaName:Signature:Date:

Certified by:Name:Signature:Date:

1. LECTURER’S INFORMATIONName: Dr Razana AlweeOffice Room: N28, 438-19Telephone: 07-5532077Email Address [email protected]

2. COURSE INFORMATION2a. Synopsis:

This course introduces students to the principles and applications of discrete structure in the field of computerscience. The topics that are covered in this course are set theory, fundamentals of logic, relations, functions, countingmethods, discrete probability theory, graph theory, Boolean algebra, finite automata and coding theory. At the end ofthe course, the students should be able to use set theory, logic, relations, functions, and Boolean algebra to solvecomputer science problems, analyze and solve problems using counting methods and discrete probability theory,apply graph theory in real world problems, use deterministic finite automata finite state machines to model electronicdevices, and apply coding theory to solve computer science problems.

2b. Learning Outcomes:At the end of the course, students should have the following knowledge, skills and attitude to:

Table 1: Mapping of Course Learning Outcomes (CO) to Program Outcomes (PO)

No. Course Learning Outcome Programme Learning Outcome(s)Addressed Assessment Methods

1Use set theory, logic, relations, functions andBoolean algebra to solve computer scienceproblems

PO1, (C3, P2, A1) ASG1,ASG2,Q1,Q4,T1,F

2 Apply and solve the problem of counting usingcounting methods and probability problemsusing discrete probability theory

PO1, PO5 (CTPS1-3), (C3,P2A1)

ASG3,Q2,T2

3Use deterministic finite automata and finite statemachines to model certain electronic devices.

PO1, (C3, P2, A1) ASG5,Q4,F

4 Apply graph theory in real world problemsapply coding theory to solve computer scienceproblems

PO1, PO5 (CTPS1-3), (C3,P2, A1)

ASG4,Q3,F

T1 – Test, T2-Test2,ASG -Assignment, ;Q – Quiz, F – FinalExam

2c. Generic Skills Addressed:In undergoing this learning, students will also acquire other value-added skills such as:1. Ability to work in teams through group assignments.2. Ability to think critically to solve the problem.

COURSE PLAN (L1)






2d. Weekly Schedule:

WEEK DATE SYLLABUS ACTIVITIES

17/9/14-11/9/14 1. Set Theory

1.1 Set and subset1.2 Operations on Sets

Lecture Tutorial Discussion Assignment 1.1

2

14/9/14-18/9/14 2. Fundamentals of Logic2.1 Propositions2.2 Basic connectives and truth tables2.3 Basic logical equivalences2.4 Quantifiers2.5 Proof Technique


321/9/14-25/9/14

3. Relations3.1 Digraph3.2 Matrices of Relations3.3 Reflexive, Symmetric, Antisymmetric, Transitive

Relations

Lecture Tutorial Discussion Assignment 2.1 Quiz 1

4 28/9/14-2/10/143.4 Equivalence Relations3.5 Partial Orders

4. Functions4.1 One-to-one, Onto, Bijection, Inverse functions4.2 Composition


5 5/10/14-9/10/144.3 Recursive Algorithm

5. Counting Methods5.1 Basic Principles


612/10/13-16/10/13 5.2 Permutation

5.3 Combination

Lecture Tutorial Discussion Test 1

19/10/14-23/10/14Mid-Semester Break

COURSE PLAN (L1)






726/10/14-30/11/14

6. Discrete Probability Theory6.1 Discrete Probability Theory6.2 Bayes’ Theorem


8 2/11/14-7/11/147. Graph Theory

7.1 Graph definition and notations7.2 Matrix representation of a graph7.3 Path and Cycles


9 9/11/14-14/11/147.4 Euler Cycles7.5 Hamiltonian Cycles

Lecture Tutorial Discussion Test 2

10 16/11/14-20/11/147.6 Dijkstra’s Shortest Path Algorithm

Lecture Tutorial Discussion Quiz 3

1123/11/14-27/11/14

8. Boolean Algebra8.1 Boolean functions8.2 Logic Gates8.3 Minimization of Circuits


12

30/11/14-4/12/14 9. Finite Automata9.1 Introduction9.2 Deterministic finite automata9.3 Finite state machines


13

7/12/14-11/12/1410. Coding Theory

10.1 Introduction to Coding Theory10.2 Binary Code10.3 Parity Check Code


1414/12/14-18/12/14

10.4 Hamming Code and Minimum Distance10.5 Group Code10.6 Generating Group Code10.7 Decoding a Group Code

Lectures Tutorial Discussion

COURSE PLAN (L1)






3. TEACHING METHODOLOGYThe knowledge and skills are delivered to students through lecture sessions, individual and group assignments, classexercises, labs and projects. Students are expected to participate actively in class.

Table 2: Distribution of Student Learning TimeTeaching and Learning Activities Student Learning Times (Hours)

1. Direct Learning- Lecture- Practical/Lab/Tutorial- Student Centered Learning

2. Independent Study- Independent Study- Revision- Preparation for Examination/Assignment/Project

3. Assessment- Quiz- Mid-Term Exam (2)- Final Exam (1)

56281414551520209243

Total 1204. COURSE ASSESSMENT

Assessment will be done through the scheme shown in Table 3. A student must obtain at least 65% MARKS TO PASSthis SUBJECT.

Table 3: Marks DistributionNo. Assessment Number % each % total Dates

1 Assignment 5 3% 15

As identified in the CoursePlan

2 Quiz 4 5% 203 Test 1 1 15% 154 Test 2 1 10% 105 Final Exam (F) 1 40% 40

Overall Total 100

5. REFERENCESi. Discrete Structure Teaching Module, Department of Computer Science,UTM, 2014.ii. Malik, D.S. & Sen, M.K. Discrete Mathematical: Theory and Applications. Cancage Learning, 2010.iii. Johnsonbaugh, R. Discrete Mathematics, 6th ed. Pearson Prentice Hall, 2005iv. Kenneth H. R., Discrete Mathematical And Its Application”, Mc Graw Hill, 2007.v. Kolman, B., Busby, R.C.& Ross, S.C. Discrete Mathematical Structure, 4th .Ed.Prentice Hall, New Jercy,

1996.vi. Kolmon,B.& Busby, R.C. Struktur Matematik Diskret bagi Sains Komputer (Terjemahan), Penerbit,

USM,1999.

6. ASSESSMENT DISTRIBUTION BASED ON CO-PO

COURSE PLAN (L1)






Gene

ric Sk

ill

PO1 PO5CO1 CO2 CO3 CO4 CO3 CO4

1 Quiz 1 (Q1) 5 52 Quiz2 (Q2) 2 3 53 Quiz3 (Q3) 3 2 54 Quiz4 (Q4) 2 3 56 Ass ignment 1 3 37 Ass ignment 2 3 38 Ass ignment 3 1 2 39 Ass ignment 4 1 2 3

10 Ass ignment 5 1 2 311 Test 1 15 1512 Test 2 4 6 1013 Final Exam (F) 5 10 14 11 40

34 7 20 17 5 17 0 0 0 0 0 100% Tota l

Table 4: Distribution of Marks Based CO-PO

Program Learning Outcome %Total

Course Learning Outcome

7. COURSE POLICY Attendance is compulsory and will be taken in every lecture session. Students with less than 80% total

attendance are not allowed to sit for final exam. Students are advised to do some reading prior to class discussions on the topic and should pay attention

and participate in discussion. It is compulsory for students to buy Discrete Structure’s module forreference and exercise.

Students are required to behave and follow the dressing regulation and etiquette which has been statedin University ruling while in class, in lab, and in exam hall.

Any form of plagiarisms is NOT ALLOWED. Students who are caught cheating during exams may FAIL thecourse (no mark for cheating during Quiz). Students who copied other student’s assignment/lab exercisewill get zero mark.

Make up test/quiz will not be given, except to students who are sick and submit medical certificate whichis confirmed by UTM panel doctors. Make up test can only be given within one week from the initial dateof exam.

Assignments must be submitted on the due dates. Some points will be deducted for the late submission.Assignments that are hand over after three days from the due dates will not be accepted.

l1_scs11113_course outline.pdf

Documents