CSC3171 Quiz 10

Fall 2011
Herbert J. Bernstein ( )

CSC3171 Quiz 10
Fall 2011


This web page is
Copyright © 2007, 2011 Herbert J. Bernstein and other parties. All rights reserved.

This is the tenth weekly quiz to be taken on or before Thursday, 10 November 2011. You should do it after you read the Knuth's Combinatorial Algorithms through section 7.1.4 (Binary Decision Diagrams) You should expect to spend 30 minutes to 2 hours on this quiz. You may use your text and any other resources to do this quiz, but if you do not know the answers well or are unable to discuss them in class, you will lose credit for the quiz.

  <==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>  

Please fill in the following information:



Please answer the following questions on this form (or on a paper copy of this form).

  1. What is combinatorics?

  2. What is a Graeco-Latin square?

  3. What is a Hamiltonian path and what is a Hamiltonian cycle?

  4. What is a hypergraph and what is the dual of a hypergraph? Give non-trivial examples of each.

  5. List and explain each of the 16 logical operations o 2 variables.

  6. What is a Horn clause and what is a Krom clause? Give examples.

  7. What is a symmetric Boolean function? Give a non-trivial example in detail.

  8. What is a Boolean chain? Give a non-trivial example and explain how a topological sort may be used when we represent a Boolean chain as a binary tree.

  9. What does this chapter have to do with seven segment displays and tic-tac-toe?

  10. Explain the difference between big-endian and little-endian with examples.

  11. Explain in detail how to do a bit-reversal.

  12. Explain how to draw an ellipse.

  13. Define a BDD.

  14. Explain melding.

  <==== Do this AFTER you've answered all the questions

You probably DON'T want to do this ===>  

Revised 31 October 2011