1 / 18

Discrete Maths

Discrete Maths. 241-303 , Semester 1, 2014 - 2015. Objective to give some background on the course. Please ask questions. 0 . Preliminaries. Who I am: Andrew Davison WiG Lab ad@fivedots.coe.psu.ac.th. Overview. 1 . Outline of the Course 2 . Meeting Times / Locations 3 . Workload

baruch
Download Presentation

Discrete Maths

An Image/Link below is provided (as is) to download presentation 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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Discrete Maths 241-303,Semester 1,2014-2015 • Objective • to give some background on the course Please ask questions 0. Preliminaries Who I am: Andrew DavisonWiG Lab ad@fivedots.coe.psu.ac.th

  2. Overview 1. Outline of the Course 2. Meeting Times / Locations 3. Workload 4. Exercises 5. Course Materials 6. Books 7. Interesting Maths URLs

  3. 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

  4. 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

  5. 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.

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

  7. 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.

  8. 2. Meeting Times / Location • Friday 10:00 – 10:50 My office • You mustcome to see me to pick up and hand in exercises 1 and 2. • Attendance is optional for the other weeks. • Please come to see me if you have any questions; do not send me e-mail.

  9. 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

  10. 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

  11. 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

  12. Planned exercise times (which may change): • ex. 1pick up: Sept. 26th; hand-in: Oct. 3rd • weeks 7-8 • ex. 2pick up: Nov. 21st; hand-in: Nov. 28th • weeks 15-16 • Cheating will result in 0 marks. • YOU HAVE BEEN WARNED!!

  13. 5. Course Materials Print out and BRING TO CLASS • 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/

  14. 6. Books very good In the CoE Library • Discrete Mathematics and its ApplicationsKenneth H. RosenMcGraw Hill, 2012, 7th edition http://www.mhhe.com/math/advmath/rosen/ • Discrete Mathematics for Computer ScientistsJohn K. TrussAddison-Wesley, 1999, 2nd edition continued

  15. 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

  16. 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

  17. 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

  18. 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

More Related