Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

detailed physic notes, Exams of Engineering

Physic 2 notes. For midterm its s important

Typology: Exams

2022/2023

Uploaded on 11/15/2023

esra-guzel
esra-guzel ๐Ÿ‡น๐Ÿ‡ท

3 documents

1 / 22

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
BLM2031/COM2031+Discrete+Structures+
Sample+Questions+for+Final+
+
1.!How!many!ways!are!there!to!distribute!40!balls!to!4!people!Hasan,!Mehmet,!Ayla,!and!BรผลŸra!if!
!!!!Ayla!and!BรผลŸra!together!get!no!more!than!30!balls!and!Mehmet!gets!at!least!9?!
!
2.!Given!a!box!containing!five!balls!numbered!1,!2,!3,!4,!5.!Let!๐‘‹!be!the!bigger!number!when!two!!
!!!!balls!are!randomly!drawn!from!the!box.!Determine!๐ธ๐‘‹.!
!
3.!Use!mathematical!induction!to!prove!that!43!divides!6!!!+7!!!!!for!every!positive!integer!n.!
+
4.!Use! mathematical! induction! to! prove! ! ๐‘–!.2!=๐‘›!.2!!!โˆ’๐‘›.2!!!+3.
!
!!!2!!!โˆ’6!for! every!
positive!integer!n.!!
!
5.!Suppose!that!we!roll!a!fair!die!until!a!6!comes!up.!
!!!!!a)!What!is!the!probability!that!we!roll!the!die!n!times?!
!!!!!b)!What!is!the!expected!number!of!times!we!roll!the!die?!
!
6.+!Let!R!be!the!relation!defined!on!๐ด=๐‘ร—๐‘!in!the!following!way!:!!
!
!!!!!!!!!!!!!!!!!!!!!! ๐‘ฅ!,๐‘ฆ!,๐‘ฅ!,๐‘ฆ!โˆˆ๐‘…โŸบ๐‘ฅ!.๐‘ฆ!=๐‘ฅ!.๐‘ฆ!!
!
Determine!whether!the!relation!R!is!an!equivalence!relation!on!A!or!not.!
!
7.!Let!A!be!a!set!and!let!R!and!S!be!symmetric!relations!defined!on!A.!Determine!whether!Rโˆ˜S!(the!
composition!of!R!and!S)!is!symmetric!or!not.!
!
8.!What!is!the!maximum!possible!number!of!vertices!for!a!connected!undirected!graph!with!19!edges!
such!that!each!vertex!has!degree!at!least!4!?!Draw!a!graph!to!demonstrate!one!possible!case.!!
!
9.!Consider!the!poset! 1,2,4,1,2,1,4,2,4,3,4,1,3,4,2,3,4,โІ.!!
!
!!!!a)!Find!the!maximal!elements!of!the!poset.!
!!!!b)!Find!the!minimal!elements!of!the!poset.!
!!!!c)!Find!the!all!upper!bounds!of!! 2,4.!
!!!!d)!Find!the!all!lower!bounds!of!! 1,3,4,2,3,4.!!
!
10.!Let!๐‘›โˆˆโ„ค!!and!๐‘›โ‰ค500.!How!many!such!!๐‘›!are!there!which!are!not!divisible!by!3,!5,!or!8?!
!
11.++
!
Determine!whether!two!given!graphs!are!isomorphic!or!not.!!
!
12.!Let!S!be!a!subset!of!๐‘!!and! ๐‘†โ‰ฅ3.!Show!that!there!exist!distinct!๐‘ฅ,๐‘ฆโˆˆ๐‘†!such!that!๐‘ฅ+๐‘ฆ!is!
even.!
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16

Partial preview of the text

Download detailed physic notes and more Exams Engineering in PDF only on Docsity!

BLM2031/COM2031 Discrete Structures Sample Questions for Final

1. How many ways are there to distribute 40 balls to 4 people Hasan, Mehmet, Ayla, and BรผลŸra if Ayla and BรผลŸra together get no more than 30 balls and Mehmet gets at least 9? 2. Given a box containing five balls numbered 1, 2, 3, 4, 5. Let ๐‘‹ be the bigger number when two balls are randomly drawn from the box. Determine ๐ธ ๐‘‹. 3. Use mathematical induction to prove that 43 divides 6 !!!^ + 7 !!!!^ for every positive integer n. 4. Use mathematical induction to prove! !!! ๐‘–!. 2!^ = ๐‘›!. 2 !!!^ โˆ’ ๐‘›. 2 !!!^ + 3. 2 !!!^ โˆ’ 6 for every positive integer n. 5. Suppose that we roll a fair die until a 6 comes up. a) What is the probability that we roll the die n times? b) What is the expected number of times we roll the die? 6. Let R be the relation defined on ๐ด = ๐‘ร—๐‘ in the following way : ๐‘ฅ!, ๐‘ฆ! , ๐‘ฅ!, ๐‘ฆ! โˆˆ ๐‘… โŸบ ๐‘ฅ!. ๐‘ฆ! = ๐‘ฅ!. ๐‘ฆ! Determine whether the relation R is an equivalence relation on A or not. 7. Let A be a set and let R and S be symmetric relations defined on A. Determine whether R โˆ˜ S (the composition of R and S) is symmetric or not. 8. What is the maximum possible number of vertices for a connected undirected graph with 19 edges such that each vertex has degree at least 4? Draw a graph to demonstrate one possible case. 9. Consider the poset 1 , 2 , 4 , 1 , 2 , 1 , 4 , 2 , 4 , 3 , 4 , 1 , 3 , 4 , 2 , 3 , 4 , โІ. a) Find the maximal elements of the poset. b) Find the minimal elements of the poset. c) Find the all upper bounds of 2 , 4. d) Find the all lower bounds of 1 , 3 , 4 , 2 , 3 , 4. 10. Let ๐‘› โˆˆ โ„ค!^ and ๐‘› โ‰ค 500. How many such ๐‘› are there which are not divisible by 3, 5, or 8? 11. Determine whether two given graphs are isomorphic or not. 12. Let S be a subset of ๐‘!^ and ๐‘† โ‰ฅ 3. Show that there exist distinct ๐‘ฅ, ๐‘ฆ โˆˆ ๐‘† such that ๐‘ฅ + ๐‘ฆ is even.

13. Let ๐ด be a nonempty set and ๐ต be a fixed subset of ๐ด. Define a relation ๐‘… on ๐‘ƒ(๐ด) such that for any ๐‘‹, ๐‘Œ โˆˆ ๐‘ƒ(๐ด), ๐‘‹, ๐‘Œ โˆˆ ๐‘… if ๐ต โˆฉ ๐‘‹ = ๐ต โˆฉ ๐‘Œ. Show that R is an equivalence relation. 14. Find the number of permutations of the letters a b c d e โ€ฆ x y z (26 letters) in which none of the patterns โ€˜spinโ€™ or โ€˜netโ€™ occurs. 15. L et R be the relation defined on ๐‘ in the following way : ๐‘ฅ, ๐‘ฆ โˆˆ ๐‘… โŸบ ๐‘ฅ โˆ’ ๐‘ฆ ๐‘–๐‘  ๐‘Ž ๐‘š๐‘ข๐‘™๐‘ก๐‘–๐‘๐‘™๐‘’ ๐‘œ๐‘“ 3 Determine which properties (reflexive, symmetric, antisymmetric, transitive) the relation satisfies. Justify your answer. 16. Consider an ordinary deck of 52 playing cards such that there are 4 suits: diamond, heart, spade, and club, and there are 13 kinds for each suit: A, 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K. The cards are to be drawn successively at random and without replacement. What is the probability that the second diamond (not second of diamonds) appears on the sixth draw? 17. Suppose that a Bayesian spam filter is trained on a set of 10,000 spam messages and 5000 messages that are not spam. The word โ€œenhancementโ€ appears in 1500 spam messages and 20 messages that are not spam, while the word โ€œherbalโ€ appears in 800 spam messages and 200 messages that are not spam. Estimate the probability that a received message containing both the words โ€œenhancementโ€ and โ€œherbalโ€ is spam.Will the message be rejected as spam if the threshold for rejecting spam is 0_._ 9? 18. a) Give the adjacency matrix of the graph G b) Does the graph have an Euler path? If so, give such a path. If not, determine the minimum number edges that must be deleted to form a graph which has an Euler path. c) What is the Chromatic number ฯ‡(G) of G? To get full credit, you need to write the color you assign to each node (as shown in the graph for the node 8). d) What is ฮบ(G), the minimum number of vertices in a vertex cut of G? To get full credit, you need to write the corresponding vertex cut set. e) What is ฮป(G), the minimum number of edges in an edge cut of G? To get full credit, you need to write the corresponding edge cut set.