This preview shows pages 1–3. Sign up to view the full content.
Su’09: MATH 3012 Applied Combinatorics
Carl Yerger
Tuesday 6/16/2009
Test 1
105 minutes
Name:
Student ID:
Instructions.
1. Attempt all questions.
2. The questions on this test sum to 210 points, but the test will be scored out of 200 points.
3. Show all the steps of your work clearly. Use complete sentences. Points may be deducted for lack of
clarity or poor mathematical exposition. Neatness counts!
4. Calculators are not permitted on this exam nor the use of any other electronic devices.
5. No collaboration of any kind is permitted on this exam.
6. As a reminder, the Georgia Tech Honor Code applies to all matters of conduct in this course.
Question
Points
Your Score
Q1
28
Q2
10
Q3
15
Q4
20
Q5
20
Q6
15
Q7
15
Q8
20
Q9
15
Q10
10
Q11
20
Q12
22
TOTAL
200
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document 1. [28 points total, 4 points each part]
Consider strings whose symbols are drawn from the set of
capital letters.
a.
How many strings of length 10 can be formed if repetition of symbols is
not
permitted?
b.
This is the end of the preview. Sign up
to
access the rest of the document.
This note was uploaded on 03/13/2010 for the course MATH 3012 taught by Professor Costello during the Summer '08 term at Georgia Institute of Technology.
 Summer '08
 COSTELLO
 Combinatorics

Click to edit the document details