241-303 Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course 241-303, Semester 1, 2015-2016 Who I am: Andrew

241-303 Discrete Maths: Prelim/0 1

Discrete Maths (OLD)

• Objective– to give some background on the course

241-303, Semester 1, 2015-2016

Who I am:Andrew DavisonWiG [email protected]

0. Preliminaries Please askquestions


Overview

1. Outline of the Course

2. Meeting Times / Locations

3. Workload

4. Exercises

5. Course Materials

6. Books

7. Interesting Maths URLs


1. Outline of the Course

• To teach discrete maths useful for a deeper understanding of computer engineering:

– for understanding algorithms e.g. recursion

– proving that programs work

continued


– for choosing data structures• e.g. for use by a Web search agent

– for understanding advanced computing tools/techniques• e.g. regular expressions, grammars

continued


• Mathematical ideas are the building blocks of all of computer engineering/science.

• Understanding the maths behind computing allows you to answer “why”.– e.g. Why does recursion work?

• All the maths in this course is of direct use in different areas of computing.


Prerequisites

• You must have passed “Computer Programming Techniques” (or similar)– knowledge of C is assumed


Three-part Course Structure

• 1. Mathematical induction, loop invariants, recursion, running time of programs.

• 2. Graph algorithms and theory, trees.

• 3. Automata, regular expressions, context free grammars.


2. Meeting Times / Location

• Monday 14:00 – 14:50 R201• Thursday 10:00 – 11:50 R201

• Please come to see me if you have any questions; do not send me e-mail.


3. Workload

• Mid-term exam: 35% (2 hours)

• Final exam: 45% (3 hours)

• Two exercises: 20% (2*10)• weeks 7-8 and weeks 15-16


Non-Attendence Penalty

• I may take registration at the start of a class.

• If someone is not there, they lose 1% (unless they have a good excuse).

• A maximum of 10% can be lost– deducted from your final mark


4. Exercises

• The two exercises are worth a total of 20% (each worth 10%).

• They will be maths problems, perhaps with some simple algorithms to design/write.

continued


• Planned exercise times (which may change):– ex. 1 handout: weeks 7-8– ex. 2 handout: weeks 15-16

• Cheating will result in 0 marks.– YOU HAVE BEEN WARNED!!


5. Course Materials

• I will hand out only the exercises.

• All the handouts (and other materials) will be placed on-line at

http://fivedots.coe.psu.ac.th/

Software.coe/DiscreteMaths/oldSyllabus/

Print out and BRING TO CLASS


6. Books

• Discrete Mathematics and its ApplicationsKenneth H. RosenMcGraw Hill, 2012, 7th editionhttp://www.mhhe.com/math/advmath/rosen/

• Discrete Mathematics for Computer ScientistsJohn K. TrussAddison-Wesley, 1999, 2nd edition

In the CoE Library very good

continued


• Discrete Mathematics (DM)Richard JohnsonbaughMacmillian Pub. Co., 1997, 4th ed.

– less mathematical, more examples– there is a copy in the main PSU library– I have a copy


7. Interesting Maths URLs

• Maths Archives: Discrete Maths:– http://archives.math.utk.edu/topics/

discreteMath.html

– links to maths courses, lecture notes

• MA: Images and Mathematics– http://archives.math.utk.edu/

images.html

continued


• Maths Puzzles (some not yet solved):– http://archives.math.utk.edu/software/

msdos/discrete.math/.html

– http://thinks.com/(The brain games, puzzles and pastime Web site)

– http://rec-puzzles.org/ (the rec.puzzles newsgroup archive)

continued


• Math Comics/Cartoons:– http://www.csun.edu/~hcmth014/

Comics.html

• Maths Software:– http://www.shodor.org/interactivate/

activities/ (Java)

– http://archives.math.utk.edu/software/.msdos.directory.html

Documents

241-303 Discrete Maths: Prelim/0 1 Discrete Maths (OLD) Objective – –to give some background on the course 241-303, Semester 1, 2015-2016 Who I am: Andrew