1 / 7

# ASSIGNMENT 1 TMK 3110 - DISCRETE STRUCTURES- HAMIZAH BINTI ABDUL HALIM UK 12161 - PowerPoint PPT Presentation

ASSIGNMENT 1 TMK 3110 - DISCRETE STRUCTURES- HAMIZAH BINTI ABDUL HALIM UK 12161. DISCRETE MATHEMATICS. Is the kind of mathematics are need to know to communicate with a computer designer, programmer or users. Is mathematics that deals with discrete objects.

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'ASSIGNMENT 1 TMK 3110 - DISCRETE STRUCTURES- HAMIZAH BINTI ABDUL HALIM UK 12161' - masako

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### ASSIGNMENT 1TMK 3110- DISCRETE STRUCTURES-HAMIZAH BINTI ABDUL HALIMUK 12161

• Is the kind of mathematics are need to know to communicate with a computer designer, programmer or users.

• Is mathematics that deals with discrete objects.

• Provides the mathematical foundations for many computer science courses.

• Abstract mathematical structures used to represent discrete objects and relationships between those objects.

• It is the conceptual foundation and backbone for computer science since all digital information processing is the manipulations of discrete structures, discrete and a distinct separable element.

• Example: sets, permutations and relations

• We can use discrete mathematics and discrete structures to calculate somethings.

• Example:

We can use formula:

S = A(1 + R) + A(1 + R)2 + ... + A(1 + R)n

• I can get new opportunity to experience success and enjoyment in mathematics classes.

• Easy to solve any problem about mathematics.

• Easy to solve all problem about discrete structures likes sets and permutations.

• Easy for us to know how we can solve problems likes discrete objects and relationships between those objects.

• http://en.wikipedia.org/wiki/Discrete_mathematics

• http://www.comphist.org/computing_history/new_page_10.htm