Social Icons

twitterfacebookgoogle pluslinkedinrss feedemail
Showing posts with label BA202. Show all posts
Showing posts with label BA202. Show all posts

Monday, April 15, 2013

BA202: DRAFT PKK FOR DIP2-S3 DEC 2012

Dear DIP2-S3,

Here is your PPK marks, it may change without prior notice. TQ


click to enlarge
click to enlarge

BA202 : DRAFT PKK FOR DIP2-S2 DEC 2012

Dear DIP2-S2 students,

Here is your PKK marks, it may change without prior notice. TQ


click to enlarge
click to enlarge




Tuesday, March 12, 2013

BA202: TUTORIAL EXERCISE 6 (COUNTING PRINCIPLES)

Dear DIP2-S2/S3 students,

Here is the 6th TE and the last one for this course. Please download it by clicking the link below:


Thank you.

Wednesday, March 6, 2013

BA202: TUTORIAL EXERCISE 5 (INDUCTION & RECURSION)

Dear DIP2-S2/S3,

Here is the Tutorial Exercise for chapter 5, induction and recursion. Please download it. TQ...

Tuesday, February 26, 2013

BA202: MATHEMATICAL INDUCTION


The wikipedia says about mathematical induction:

Mathematical induction is a method of mathematical proof typically used to establish that a given statement is true for all natural numbers (positive integers). It is done by proving that the first statement in the infinite sequence of statements is true, and then proving that if any one statement in the infinite sequence of statements is true, then so is the next one.
The method can be extended to prove statements about more general well-founded structures, such as trees; this generalization, known as structural induction, is used in mathematical logic and computer science. Mathematical induction in this extended sense is closely related to recursion.

Example

Mathematical induction can be used to prove that the following statement, which we will call P(n), holds for all natural numbers n.
0 + 1 + 2 + \cdots + n = \frac{n(n + 1)}{2}\,.
P(n) gives a formula for the sum of the natural numbers less than or equal to number n. The proof that P(n) is true for each natural number n proceeds as follows.
Basis: Show that the statement holds for n = 0.
P(0) amounts to the statement:
0 = \frac{0\cdot(0 + 1)}{2}\,.
In the left-hand side of the equation, the only term is 0, and so the left-hand side is simply equal to 0.
In the right-hand side of the equation, 0·(0 + 1)/2 = 0.
The two sides are equal, so the statement is true for n = 0. Thus it has been shown that P(0) holds.
Inductive step: Show that if P(k) holds, then also P(k + 1) holds. This can be done as follows.
Assume P(k) holds (for some unspecified value of k). It must then be shown that P(k + 1) holds, that is:
(0 + 1 + 2 + \cdots + k )+ (k+1) = \frac{(k+1)((k+1) + 1)}{2}.
Using the induction hypothesis that P(k) holds, the left-hand side can be rewritten to:
\frac{k(k + 1)}{2} + (k+1)\,.
Algebraically:

\begin{align}
\frac{k(k + 1)}{2} + (k+1) & = \frac {k(k+1)+2(k+1)} 2 \\
& = \frac{k^2+k+2k+2}{2} \\
& = \frac{(k+1)(k+2)}{2} \\
& = \frac{(k+1)((k+1) + 1)}{2}
\end{align}
thereby showing that indeed P(k + 1) holds.
Since both the basis and the inductive step have been proved, it has now been proved by mathematical induction that P(n) holds for all natural n

here is another example by me:



BA202: TUTORIAL EXERCISE 4 (TREE)

Dear Student,

Here is the latest Tutorial Exercise for chapter 4: Tree. Please download it below:


Wednesday, February 6, 2013

BA202 : TUTORIAL EXERCISE 3 (GRAPH)

Dear my students,



We have finish chapter 3 already, so here is the TUTORIAL 3. Download it and try to solve it. we will discuss the answer after the Chinese New Year semester break. Thanks.

Sunday, February 3, 2013

BA202: TUTORIAL EXERCISE 2: SET, RELATION AND FUNCTION

Dear student,



Here is your tutorial exercise for chapter 2. Please download it here TUTORIAL 3
Thank you.

Wednesday, January 30, 2013

BA202 : BINARY SEARCH TREE

There are three standard ways of traversing a binary tree T with Root R. These three algorithms, called Pre-order , Inorder and post order. Below is the example of those algorithm:




Tuesday, January 29, 2013

BA202: Spanning Tree...its a game!!

find the spanning tree
Most student didn't aware that they actually know the concept of spanning tree before. Its called the Maze game...finding a path in a puzzle maze. Yes, it is exactly the same thing with what we call spanning tree..here just try to find the path...should you able to seek it??

Tuesday, January 15, 2013

BA202 : DOES INFINITY COUNTABLE?

Dear student,




Our last class we do a lot of discussion on a set of Numbers. All numbers are infinity...such as the Positive Integer I = {1,2,3,4....} and so with the Natural number N= {0,1,2,3....}. But both Integer and Natural Number can be listed so we call it the countable infinity.

In other hand, decimal number cannot be listed......even you try to list a decimal number from 0 to 1, therefore, we call that decimal numbers are uncountable infinity. So did you get the idea? try to find another set of number which can be classify as uncountable infinity....

Monday, January 14, 2013

BA202: TUTORIAL EXERCISE 1: BASIC LOGICS

To all DIP student,




Here is your tutorial exercise 1 , you can form a group of  2 student to solve the problems. Please submit the answer to me by next week. Thank you.

Sunday, December 16, 2012

BA202: COURSE OUTLINE FOR DECEMBER 2012


I have updated the BA202 page with the latest Course Outline, please download it to plan your study. The outline will describe all the important things about this course including the assessment.

here is the page >> BA202 Page<<

Thank you.

Monday, November 12, 2012

BA202: PKK FOR DIP2-S2 #UPDATED#

Your coursework mark will be update as soon as possible, please be patient and stop texting my phone as I'm very busy this week. Thanks.
Click to enlarge


At last, here is the end of your nail biting moment. Red highlighted mean your coursework fail to be hand over to me. This marks are not final and may change without any notice. All the best for your final exam. Thanks.

Sunday, November 4, 2012

BA202 : TOPICS FOR TEST 2 AND QUIZ.

Dear student,

I'm sorry because i'm not updating my blog recently due to I 'm so busy with many thing such the Inovation Seminar latetly. Therefore, I will held the overdue assessments within this week. Here is the detail for the incoming assessment for your revision:

MONDAY (5/11/12)
QUIZ 2 : "SET" AND "FUNCTION" ONLY
QUIZ 3 : SUM RULES, PRODUCT RULES, PERMUTATION AND COMBINATION

WEDNESDAY (7/11/12)
TEST 2: CHAPTER 5 INDUCTION AND RECURSION
              CHAPTER 6 COUNTING PRINCIPLE

All the best...

Wednesday, October 17, 2012

BA202 : TUTORIAL EXERCISE FOR GRAPH AND TREE

Dear students,

Here is the TE for the chapter Graph and chapter Tree, please download and solve it.
here is the link:

TE Tree

TE Graph1
TE Graph2

All the best..

Monday, September 24, 2012

BA202 : THEORY TEST FOR DIP2-S2

For all respect, a theory test for BA202 Discrete Mathematics will be held on this 26/09/2012. Please be prepare.

Another things that I already have fixs the wrong link for chapter Induction and Recursion, now everyone can download the correct notes. Thank you.

Wednesday, August 29, 2012

BA202: UPDATE FOR DISCRETE MATHEMATICS NOTES

Dear BA202 student,
As I mention earlier in class, we got a few adjustment on our course, therefore some of the old chapter is phased out or discontinued while some is revised to smaller chapter. Chapter 2 also has been updated especially on the topic of Graph of Function. All the update can be see here. Thanks.

Sunday, July 15, 2012

BA202 : DISCRETE MATHEMATICS COURSE OUTLINE FOR JUNE 2012

Dear Student,

This is the latest course outline for Discrete Mathematics. You can download the file at BA202 page. Thanks.

Sunday, June 17, 2012

TEST YOUR MIND WITH SUDOKU

Sudoku is a puzzle/game create by the Japanese, its using numbers but you do not need to calculate.

Sudoku requires a newer version of Adobe Flash Player.

You must have the current version of the adobe flash player to play this online Sudoku puzzle game.