Scribd
Upload
408 views

Math 1004

This document provides information about the MATH1004 Discrete Mathematics course offered in Semester 2 of 2013 at the University of Sydney. It outlines the lecture times, location, lecturer, consultation times, tutorials, assessments, textbook, and week-by-week topics that will be covered in the course. The assessments will consist of an exam (65%), two quizzes (15% each), and an assignment (5%). The objectives of the course are to introduce concepts in combinatorics, Boolean functions, generating functions, and solving linear recurrence relations.

Uploaded by

MrBuu2012
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
408 views

Math 1004

This document provides information about the MATH1004 Discrete Mathematics course offered in Semester 2 of 2013 at the University of Sydney. It outlines the lecture times, location, lecturer, consultation times, tutorials, assessments, textbook, and week-by-week topics that will be covered in the course. The assessments will consist of an exam (65%), two quizzes (15% each), and an assignment (5%). The objectives of the course are to introduce concepts in combinatorics, Boolean functions, generating functions, and solving linear recurrence relations.

Uploaded by

MrBuu2012
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

THE UNIVERSITY OF SYDNEY Semester 2, 2013

Information Sheet for MATH1004 Discrete Mathematics Web Sites It is important that you regularly check both the Junior Mathematics web site http://www.maths.usyd.edu.au/u/UG/JM/ and the MATH1004 web site http://www.maths.usyd.edu.au/u/UG/JM/MATH1004 Lectures Times 1 pm Wed & Thurs Location Lecturer

New Law 101

Dr Oded Yacobi, Carslaw 637

Lectures run for 13 weeks. The rst lecture will be on Wednesday 31 July. The last lecture will be on Thursday 31 October. Consultation times Dr Yacobi will be available for consultations on Thursdays from 2 pm to 4 pm in Carslaw 637, or by appointment, from Week 2. Duty tutors will also be available from Week 2, from 1 pm to 2 pm on Tuesdays and Thursdays, in Carslaw 830 (level 8 of the Carslaw Building). Tutorials Tutorials (one per week) start in Week 2. You should attend the tutorial given on your personal timetable. Attendance at tutorials will be recorded. Your attendance will not be recorded unless you attend the tutorial in which you are enrolled. Tutorial sheets The tutorial sheets will be available on the MATH1004 webpage. You should take the current weeks sheet to your tutorial. The sheet is available for printing using a link from the webpage. Solutions to tutorial exercises for week n will usually be posted on the web by the end of week n. Text book KG Choo and DE Taylor. Introduction to Discrete Mathematics. Addison Wesley Longman Australia, Melbourne, Vic, Australia, 1998. Available from the Co-op Bookshop.

Assessment Your nal raw mark for this unit will be calculated as follows: 65%: 15%: 15%: 5%: Exam at end of semester 1. Quiz 1 mark (using the bettermark principle). Quiz 2 mark (using the bettermark principle). Assignment mark.

The bettermark principle means that for each quiz, the quiz counts if and only if it is better than or equal to your exam mark. If your quiz mark is less than your exam mark the exam mark will be used for that portion of your assessment instead. So for example if your quiz 1 mark is better than your exam mark while your quiz 2 mark is worse than your exam mark then the exam will count for 80%, quiz 1 will count for 15% and the assignment will count for 5% of your overall mark. The assignment mark counts for 5% regardless of whether it is better than your exam mark or not. Final grades are returned within one of the following bands: High Distinction (HD), 85100: representing complete or close to complete mastery of the material; Distinction (D), 7584: representing excellence, but substantially less than complete mastery; Credit (CR), 6574: representing a creditable performance that goes beyond routine knowledge and understanding, but less than excellence; Pass (P), 5064: representing at least routine knowledge and understanding over a spectrum of topics and important ideas and concepts in the course. A student with a passing or higher grade should be well prepared to undertake further studies in mathematics on which this unit of study depends. Examination There is one examination of 1.5 hours duration during the examination period at the end of semester 2. Further information about the exam will be made available at a later date. Quizzes There are two quizzes, each worth 15% of your nal raw mark. Quizzes are held during tutorials, in Week 5 (beginning 26 August) and Week 9 (beginning 23 September). You should put those dates in your diary now! You should sit for the quiz during the tutorial in which you are enrolled. Your quiz mark may not be recorded if you sit for the quiz in a tutorial in which you are not enrolled (unless you have made an arrangement beforehand with the Student Oce). If you miss a quiz, then you must go to the Student Oce as soon as possible afterwards. Assignments One assignment will be marked, and will be worth 5% of your nal raw mark. The assignment will be due on Thursday 17 October. Please see page 26 of the Junior Mathematics Handbook for details relating to the submission of assignments. Any questions? Before you contact us with any enquiry, please check the FAQ page: http://www.maths.usyd.edu.au/u/UG/JM/FAQ.html Where to go for help For administrative matters, go to the Mathematics Student Oce, Carslaw 520. For help with mathematics, see your lecturer, your tutor or a duty tutor. If you are having diculties with mathematics due to insucient background, you should go to the Mathematics Learning Centre (Carslaw 441). 2

Objectives
The objectives of this course are: to introduce basic concepts of combinatorics - permutations, selections and arrangements;

to introduce basic operations on Boolean functions and to illustrate how they apply in switching circuit theory and mathematical logic; to introduce the concept of generating functions; to illustrate how to nd solutions of linear recurrence relations.

Outcomes
Students who successfully complete this course should be able to: identify combinatorial objects involved in counting problems; understand how to nd minimal digital or switching circuits representing Boolean functions; solve linear recurrence relations by using generating functions or characteristic equations.

Week-by-week outline The unit follows the textbook fairly closely. The chapter references in the following table refer to the textbook by Choo and Taylor. Week 1 Topics Introduction to the unit. Chapter 1. The Catalan numbers. Chapter 2. Sets. Chapter 3. Functions. Chapter 4. Counting principles. Chapter 5. Ordered selections. Chapter 6. Unordered selections. Chapter 8. Multinomial coecients. Chapter 7. The inclusion-exclusion principle. Chapter 9. Boolean expressions. Chapter 10. Karnaugh maps. Chapter 12. Digital logic. Chapter 11. Logic. Chapter 13. Mathematical induction. Chapter 14. Generating functions. Chapter 15. Linear recurrence relations. Chapter 19. Catalan numbers (again). Revision.

2 3 4

6 7 8

9 10 11 12 13

You might also like