<A NAME="title"></A>QUEEN'S UNIVERSITY <BR>

QUEEN'S UNIVERSITY

SCHOOL OF COMPUTING
Discrete Mathematics for Computing Science
CISC-203*
Fall Term 2006
http://www.cs.queensu.ca/home/akl/cisc203/2006/info06.html

This page provides information on the course. It tells you about the instructor, teaching assistants, course schedule, and method of grading. It also contains a course description, textbook title, and some important dates, particularly test dates. Practice problems can also be found here, as well as recommended reading, sample tests and solutions to test questions.

Instructors, Teaching Assistants, and Schedule

The instructor and teaching assistants of this course are:

Instructor Office E-mail Phone
Selim Akl 625 Goodwin Hall akl@cs.queensu.ca 36062

Teaching Assistant Office E-mail
Fangpeng Dong 542 Goodwin Hall dong@cs.queensu.ca
Arezou Mohammadi 542 Goodwin Hall arezou@cs.queensu.ca
Naya Nagy 542 Goodwin Hall nagy@cs.queensu.ca
Hua (Michael) Xiao 304 Walter Light Hall huaxiao@cs.queensu.ca

Three lectures per week are scheduled for this course. Fifty-minute lectures will be given on Mondays, Wednesdays, and Thursdays, according to the following table:

Slot Day Time
2 Monday 9:30-10:20
Wednesday 8:30- 9:20
Thursday 10:30-11:20

Course lectures will be given at the following location: Walter Light Hall, room 210.

Office Hours

Selim Akl: Monday 12:30 - 1:30; Wednesday 1:30 - 2:30; Thursday 11:30 - 12:30 (625 Goodwin Hall).
In addition, I will be glad to meet with you any time you need to see me in my office. Please talk to me in class to arrange an appointment.

Fangpeng Dong: Tuesday 1:00 - 3:00 (542 Goodwin Hall).

Arezou Mohammadi: Tuesday 2:00 - 4:00 (542 Goodwin Hall).

Naya Nagy: Tuesday 10:00 - 12:00 (542 Goodwin Hall).

Hua (Michael) Xiao: Tuesday 9:00 - 11:00 (542 Goodwin Hall).

Back to top

Grading

Your grade is the total of marks obtained on five tests, as follows.

Test Percentage
1 20
2 20
3 20
4 20
5 20
Final Grade 100

There are no assignments to be handed in. Also, there are no `midterm' or `final' examinations as such. You are expected to write all tests.

Course Description

This course provides an introduction to mathematical discourse and proof methods. Topics to be covered include: Sets, functions, sequences, and relations; Natural numbers, integers, and rational numbers; Induction; Combinatorics and graph theory.

Textbook

K. H. Rosen, Discrete Mathematics and its Applications, Fifth Edition, McGraw-Hill, Boston, Massachusetts, 2003.

The textbook is available at the Queen's Bookstore and has been placed on reserve in the Engineering and Science Library. A Student Solutions Guide has also been placed on reserve in the library.

Back to top

Relevant sections are indicated in the course outline below.

Calendar

Week Date Topics Sections To Read
1 Sept 11, 13, 14 Sets, Functions, Algorithms 1.6 - 1.8, 2.1 - 2.3
2 Sept 18, 20, 21 Integers 2.4 - 2.6
3 Sept 25, 27, 28 Matrices, Methods of Proof, Review 1 2.7, 1.5 (pp. 63 - 73), 3.1
4 Oct 2, 4, 5 Mathematical Induction, Test 1, Recursive Definitions 3.2 - 3.5
5 Oct 9*, 11, 12 Counting, Review 2 4.1, 4.2
6 Oct 16, 18, 19 Binomial Coefficients, Test 2, Generalized Permutations and Combinations 4.3 - 4.5
7 Oct 23, 25, 26 Recurrence Relations, Review 3 6.1, 6.3
8 Oct 30, Nov 1, 2 Relations, Test 3, Representing Relations 7.1, 7.2, 7.3
9 Nov 6, 8, 9 Relations: Closure and Equivalence, Review 4 7.4, 7.5
10 Nov 13, 15, 16 Partial Orderings, Test 4, Graphs 7.6, 8.1, 8.2
11 Nov 20, 22, 23 Graph isomorphism, Trees 8.3, 9.1, 9.2
12 Nov 27, 29, 30 Review 5, Test 5, Conclusion

* There will be no class on October 9 (Thanksgiving Holiday).

Back to top

Practice problems

Below is a list of practice problems.

Section Pages Problems
1.6 85 5, 13, 19, 23
1.7 95 7, 19, 29, 37
1.8 108 - 110 5, 17, 57
2.1 130 23, 27, 33
2.2 142 - 143 1, 7, 21
2.3 151 - 152 7, 15, 21
2.4 168 43, 45, 49
2.5 180 21, 23, 25, 27, 29
2.6 194 - 195 11, 15, 27, 29
2.7 205 - 206 17, 29, 33, 35, 37
1.5 75 - 77 21, 33, 39, 41, 43, 51, 73
3.1 223 3, 25, 45
3.2 236 - 237 5, 13, 31
3.3 253 - 254 7, 15, 43
3.4 271 - 272 7, 25, 35
3.5 283 5, 9, 27
4.1 311 - 312 33, 47, 51
4.2 319 - 320 13, 25, 33
4.3 325 - 326 23, 33, 41
4.4 333 - 334 15, 23, 33
4.5 342 - 344 9, 15, 31, 45, 51
6.1 411 35, 37, 41
6.3 434 11, 13, 15
7.1 480 - 481 7, 19, 29
7.2 488 3, 17, 19
7.3 495 - 496 13, 23, 31
7.4 506 - 507 5, 17, 25
7.5 513 - 515 3, 15, 41
7.6 528 - 529 3, 13, 21, 23, 37
8.1 544 11, 13, 17
8.2 554 - 556 5, 25, 41
8.3 563 - 567 1, 3, 15, 21, 31, 43, 51, 61, 65
9.1 643 - 644 21, 23, 39, 45
9.2 656 - 658 1, 3, 7, 19, 21, 23

Back to top

Tests

Five tests will be held according to the following table:

Test Date Sections covered
1 Wednesday October 4 1.6 - 1.8, 2.1 - 2.7
2 Wednesday October 18 1.5 (pp. 63 - 73), 3.1 - 3.5
3 Wednesday November 1 4.1 - 4.5
4 Wednesday November 15 6.1, 6.3, 7.1 - 7.4
5 Wednesday November 29 7.5, 7.6, 8.1 - 8.3, 9.1, 9.2

Tests will take place in class (Walter Light Hall, room 210) during the regular lecture period.

Each will be a written, `closed-book', exam. No computers or calculators will be allowed. Please be sure to bring your photo I.D.

Picking-up your marked tests

Marked tests will be returned by the teaching assistants (the time and place will be announced in class). Tests that are not picked up will be available in the main office of the School of Computing (557 Goodwin Hall) on weekdays (8:30 - 12:00, 1:00 - 4:30). Unclaimed tests will be discarded after one week.

If you have any question about your mark, please fill out this form. Include the form and your marked test in an envelope and hand them in to a any one of the TAs no later than one week after the marked test is returned. Your entire test will then be re-marked and, as a result, your mark may go up or down, or remain unchanged. Please note that no request for a re-mark will be considered if your answers were written in pencil or erasable ink.

Back to top

Sample Tests

  1. Test 1 in postscript and in pdf and its solutions in postscript and in pdf

  2. Test 2 in postscript and in pdf and its solutions in postscript and in pdf

  3. Test 3 in postscript and in pdf and its solutions in postscript and in pdf

  4. Test 4 in postscript and in pdf and its solutions in postscript and in pdf

  5. Test 5 in postscript and in pdf and its solutions in postscript and in pdf

Solutions

Solutions to test questions will be posted here following each test period.

  1. Solutions to test 1 are now available in postscript and in pdf formats.

  2. Solutions to test 2 are now available in postscript and in pdf formats.

  3. Solutions to test 3 are now available in postscript and in pdf formats.

  4. Solutions to test 4 are now available in postscript and in pdf formats.

  5. Solutions to test 5 are now available in postscript and in pdf formats.

Recommended reading

  1. Partitions: Available in postscript and in pdf formats.

  2. Mergesort: Available in postscript and in pdf formats.

  3. Multiplication: Available in postscript and in pdf formats.

COMPSA Tutors

If you need additional help, please check the COMPSA web page.

Faculty of Arts and Science

Student Academic Resources site

Conference

International Conference on Unconventional Computation 2007

Back to top