Chapter 2 Extra Exercise

Quiz 1 Result for DIP1S1 n DIP1S2

Keputusan Kuiz 1
Markah Penuh adalah 10.

COURSE OUTLINE (Please download the file below for your reference!!!!)

INSTRUCTION DURATION : 15 WEEKS
CREDITS : 3
PRE REQUISITE :DBM1023 MATHEMATICS FOR COMPUTING
SEMESTER : 2
TOTAL CONTACT HOUR : 60

SYNOPSIS

Discrete Mathematics course introduces students to logical and mathematical thinking.  This course focuses on providing basic logic, sets, relations and functions, as well as graphs and trees which integrate symbolic tools, graphical concepts and numerical calculations.  This course also addresses the Counting Principle as well as Induction and Recursion which are related to the information Technology Programme.

TOPICS

1.0  BASIC LOGIC AND PROOFS

       1.1 Understand Proposition Logic

       1.2 Understand Predicate Logic

       1.3 Understand Proofs

2.0  SETS, RELATION AND FUNCTIONS

       2.1 Understand sets and set operations.

       2.2 Understand relations

       2.3 Explain functions

3.0  GRAPHS

       3.1 Understand concept of graphs

4.0  TREES

      4.1 Understand concept of trees.

5.0  INDUCTION AND RECURSION

      5.1 Understand mathematical induction

      5.2 Understand Recursion

6.0  COUNTING PRINCIPLE

      6.1 Understand counting principles

      6.2 Understand permutations and combination

      

COURSE LEARNING OUTCOME (CLO)

Upon completion of this course, students should be able to:

1.  Apply mathematical knowledge in basic logic, proofs and counting principles.(C3, LD1)
2.  Construct table and diagram to show proposition logic, graphs and trees. (C3, LD1)
3.  Solve related problems critically using appropriate formulae and conepts. (C3, LD1)

ASSESSMENT
The course assessment is carried out in two sessions:
i.  Coursework (CA)  : 60%
ii  Final Examination (FE)  : 40%
    TOTAL :100%

Assessment method for coursework (CA)

a.  Theory Test (minimum 1) : 30%
b.  Quiz (minimum 2) : 15%
c.  Tutorial Exercise (minimum 4)  : 40%
d.  Assignment (minimum 1)  : 15%
     TOTAL : 100%

ASSESSMENT SPECIFICATION TABLE (AST)

STUDENT LEARNING TIME

DEPENDENT LEARNING

     Delivery method 
     Lecture  = 30 hours
     Tutorial = 30 hours

Coursework Assessment (CA)
     Lecture-hour-assessment
     -  Test (1) = 1 hour
     -  Quiz (2) = 1 hour
     Tutorial-hour-assessment
    - Tutorial Exercises (4)
   

INDEPENDENT LEARNING

Coursework Assessment (CA)
- Assignment (1) = 2 hours

Preparation and Review
Lecture = 30 hours
     - Preparation before theory class eg:download lesson notes.
     - Review after theory class eg: additional references, discussion group, discussion

Tutorial
    - Preparation for tutorial = 15 hours

Assessment
    - Preparation for quiz (2) = 2 hours
    - Preparation for test (1) = 2 hours
    - Preparation for Final Examination (1) = 5 hours

FINAL EXAMINATION = 2 HOURS

TOTAL = 120 HOURS
CREDIT = SLT(120) / 40 = 3 

Please download this document for your reference.

Tutorial 1 Disember 2014

Chapter 1: Introduction to logic

Chapter 1: Predicate Logic (Extra Notes)

Chapter 1:Basic Logic and Proof

Final Exam Question JUN 2014

Exercise Chapter 1

Chapter 2:Tutorial 2 June 2014

Chapter 1: Tutorial 1 June 2014

Chapter 1: Proposition

Fundamentals of Mathematical Logic

Logic is commonly known as the science of reasoning.  The emphasis here will be on logic as a working tool.  Some of the reasons to study logic are the following:

• At the hardware level the design of 'logic' circuits to implement instructions is greatly simplifies by the use of symbolic logic.
• At the software level a knowledge of symbolic logic is helpful in the design of programs.

Proposition

A proposition is any meaningful statement that is either true or false, but not both.  We will use lowercase letters such as p, q, r,... to represent propositions.  The truth value of a proposition is true denoted by T, if it is true statement and false, denoted by F, if it is a false statement.  Statements that are not propositions include questions and commands.

Example 1.1:

Which of the following are propositions?  Give the truth value of the propositions.

• 2 + 3 = 7
• Tun Mahathir was Prime Minister of Malaysia.
• What time is it?
• Keep quiet!

Solution

• A proposition with Truth Value (F).
• A proposition with Truth Value (T)
• Not a proposition since no truth value can be assigned to this statement.
• Not a proposition since this is a command.

Example 1.2:

Which of the following are proposition?  Give the truth value of the propositions.

• The difference of two primes.
• 2 + 2 = 4
• Kuching is the capital of Malaysia
• How old are you?

 Solution

• Not a proposition
• A proposition with Truth Value (T)
• A proposition with Truth Value (F)
• Not a proposition