0% found this document useful (0 votes)
52 views10 pages

CIT 5920 Exam Part1

The document is an exam paper for CIT592 from 2019, containing instructions for students regarding exam conduct, including anonymity, use of scratch paper, and answering format. It includes various mathematical problems related to set theory, probability, and combinatorics, with specific points assigned to each question. The exam emphasizes reasoning in answers and prohibits the use of calculators.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
52 views10 pages

CIT 5920 Exam Part1

The document is an exam paper for CIT592 from 2019, containing instructions for students regarding exam conduct, including anonymity, use of scratch paper, and answering format. It includes various mathematical problems related to set theory, probability, and combinatorics, with specific points assigned to each question. The exam emphasizes reasoning in answers and prohibits the use of calculators.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

CIT592 2019 Exam 1

• DO NOT START UNTIL INSTRUCTED TO DO SO.

• Please do not write your name anywhere. We want to grade these anony-
mously (aside from the final grade entry of course).

• Turn your cellphones to do not disturb. Calculators are not allowed.

• You can leave you answer in unsimplified form. Even 2 + 2 is not


something we are grading you for. This is not a test of mental arithmetic.

• Answer the questions in the space provided. We are NOT scanning the
back of any page.

• There is one blank sheet of scratch paper at the end. You can also use
the back of any sheet for extra scratch paper.

• Each question may or may not be tricky. Please do not spend excessive
time on any single question.

• Unless the questions says ”No explanation needed”, you have to provide
some reasoning.

• The last sheet is for scratch paper. You can tear if off but please throw
it into recycling when you leave the room.

PennID (the 8 digits in big font on your penncard):


Some formulae
n

• The number of ways to choose k items out of n is k
.

• The number of ways to pick and arrange k items out of n is P (n, k).

• |P (A)| = 2|A| .

• Number of ways to arrange n items out of which k1 are identical of one kind and k2
are identical of another kind is.

n!
k1 !k2 !


P (X|F )P (F )
P (F |X) =
P (X|F )P (F ) + P (X|F c )P (F c )

Page 2
1. (3 points) For this question, please answer with a True or False right next to the ques-
tion. No explanation is required.
On the set {1, 2, 3, 4, 5}
Is the relation
{(1, 1), (2, 2)} symmetric?
{(1, 1), (1, 2), (2, 1), (2, 2)} transitive?
{(1, 1), (2, 2), (3, 3)} anti-symmetric?
{(3, 4), (4, 1), (1, 5), (3, 1), (1, 1)} reflexive?
{(5, 1), (3, 4), (2, 3)} anti-symmetric?
{(2, 4), (4, 2), (2, 2), (1, 1), (5, 1)} transitive?

2. (2 points) In a standard deck of 52 cards, you draw a single card. What is the probability
of drawing a king or a heart?
(2 pts)

Page 3
3. (2 points) Winnie has 4 different duck ornaments and 6 different geese ornaments that
she wants to place on her mantle. All of the duck ornaments should be consecutive and
the geese ornaments should also be consecutive. How many ways can they be arranged?

Page 4
4. (3 points) Philadelphia sports fans are likely to do crazy things when the Eagles play a
knockout match.
When the Eagles lose they do crazy things with the probability of 0.75.
When the Eagles win they do crazy things with the probability of 0.9.
The Eagles have a 20 percent chance of winning a knockout match.
On Feb 2, 2018 Philadelphia sports fans did crazy things.
What is the probability that they won the knockout match that took place that day?
In a knockout match you do not have ties.

Page 5
5. (3 points) Is (A ∩ B) − C = (A − C) ∩ (B − C)?
If so, prove it using set identities.
Please list the name of the identity being used in every step. You have all the identities
listed in the second page.

6. (2 points) How many distinct bijections (something that is both one-one and onto)
functions can be made from the set of {orange, apple, pineapple, lemon} to the set
{Catwoman, Batman, Wonder Woman, Superman}?

Page 6
7. (4 points) How many non-negative integer solutions exist for the following system of
inequations (remember that a system means that all of these need to be satisfied simul-
taneously)

x1 + x2 + x3 + x4 ≤ 21
x2 ≥ 2
x3 ≥ 3
x4 ≤ 19

Page 7
8. (4 points) The great Ringo Starr of the Beatles is obsessed about wearing rings on his
fingers. He goes shopping and buys 3 identical diamond rings, 2 identical sapphire rings,
and 2 identical emerald rings.
In how many ways can he wear these rings on his fingers?
Assumptions and facts for this question

• The thumb is not a finger.


• Ringo has all four fingers.
• All the rings will be used.
• A finger is allowed to be ringless (0 rings).

Page 8
9. (4 points) In order to get 15 students to interact with each other a teacher decides to
take them to Amma’s restaurant on Chestnut Street.
There the teacher orders 8 bowls of Butter Chicken and tells the students that they have
to pair up and each pair is going to share a bowl. Since there are 15 students, one of
them will be left unpaired and will get to eat an entire bowl by themselves.
In how many ways can this be done. You can assume that the bowls are identical (it is
a restaurant and you would expect that!).

Page 9

You might also like