CSC3171 Quiz 11

Fall 2011
Herbert J. Bernstein ( )

CSC3171 Quiz 11
Fall 2011

 		 

This web page is http://www.bernstein-plus-sons.com/.dowling/CSC3171F11/CSC3171_Quiz_11.html
Copyright © 2007, 2011 Herbert J. Bernstein and other parties. All rights reserved.

This is the eleventh weekly quiz to be taken on or before Thursday, 17 November 2011. You should do it after you read the Knuth's Combinatorial Algorithms through the end 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:

Name:


Email:

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

  1. Explain a simple solution to the problem of running through all 2n strings that consist of n binary digits.

  2. What is a Gray binary code and when is it important?

  3. Give a specific example of a non-binary Gray code.

  4. What are Lyndon words?

  5. Define alphametics and give a specific example.

  6. What is a Sims table?

  7. Define a combination of n things, taken t at a time, and give a formula for the number of such combinations.

  8. Explain how to generate all partitions of an integer.

  9. Give the recurrence formulae for Peirce's Triangle and give a specific problem for which it is useful.

  10. Explain the concept of a saddle point and give an explicit example.

  11. Define an oriented forest.

  12. Define prepostorder traversal and postpreorder traversal and say where they are useful.

  13. Give your final Google sites URLs for all three of your presentations.

  14. Give you final structural homology URL.

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

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

Revised 31 October 2011