Discrete Structures II, MATH/CSCI 2113
Assignments
Current
- Assignment 9 (below) will be due on Thursday, April 25 (bring it
to my office). This assignment is now optional.
- Read Section 6.1 of the text book.
- Do problems 6, 10, 12, 16, 18, 22, 24 of Section 6.1, page 290 of the
text book.
- The third test will be held on Wednesday, April 24, in class (Dunn
101). The test is optional for those that have handed in the
assignments and participated in class over the last three weeks
The test will cover all material from the course, with an accent (at
least half of the questions) from the material of the last weeks,
namely relations and error-correcting codes.
For practice
questions, see the assignments below.
Past
- Assignment 10 (html or pdf).
- Assignment 8 (html or pdf).
- Assignment 7 (html or pdf).
- Assignment 6 (html or pdf).
- Bonus question: implement a
program using Huffman coding for text compression.
My favourite solution:
- Assignment 5 (html or pdf).
- Bonus question: implement a
program to see if two graphs are isomorphic.
My favourite solution:
- Michael
Lawrence. Java code which you can download, with good commenting and a nice explanatory note.
- Assignment 4 (html or pdf)
- Assignment 3 (html or pdf)
- Bonus question: implement a
program to generate permutations according to the minimal difference
method.
My favourite solutions:
- Assignment 2 (html or pdf)
- Solutions
- A Java program that generates subsets of a set in lexicographical
order, coded by Michael Lawrence, can be downloaded HERE.
- Assignment 1 (html or pdf)
Back
The assignments are available in html form, and in the pdf format. To read pdf files, you will need acrobat reader, which can be downloaded for free from
this website.
Last updated April 19, 2002 by Jeannette Janssen (janssen@mathstat.dal.ca)