100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
DISCRETE MATHS TEST QUESTIONS WITH REVISED AND UPDATED ANSWERS $12.39   Add to cart

Exam (elaborations)

DISCRETE MATHS TEST QUESTIONS WITH REVISED AND UPDATED ANSWERS

 1 view  0 purchase
  • Course
  • DISCRETE MATHS
  • Institution
  • DISCRETE MATHS

DISCRETE MATHS TEST QUESTIONS WITH REVISED AND UPDATED ANSWERS Mutually exclusive vs independent - Answer-Two events are mutually exclusive if A∩B = ∅ (they cannot occur simultaneously) Independent is when the occurrence of one does not influence the occurrence of the other Probability o...

[Show more]

Preview 1 out of 4  pages

  • October 22, 2024
  • 4
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • discrete maths
  • DISCRETE MATHS
  • DISCRETE MATHS
avatar-seller
victoryguide
DISCRETE MATHS TEST QUESTIONS
WITH REVISED AND UPDATED
ANSWERS

Mutually exclusive vs independent - Answer-Two events are mutually exclusive if A∩B =
∅ (they cannot occur simultaneously)
Independent is when the occurrence of one does not influence the occurrence of the
other

Probability of event A - Answer-P(A) = the sum of the probabilities of the elements in A

What is P(AUB) if A and B are mutually exclusive? - Answer-P(A)+P(B)

P(A|B) - Answer-P(A∩B)/P(B)

How to check if A and B are independent - Answer-If P(A∩B) = P(A)*P(B)

When does a connected graph with =>1 edge have a Euler cycle? - Answer-If and only
if it has no vertices of odd degree

What is a Euler cycle? - Answer-A cycle in a graph G that includes all of the edges and
all of the vertices of G

Konigsberg Bridge Problem - Answer-Two islands in a river were connected to each
other and the land by 7 bridges. Is it possible for a parade to cross each of the 7 bridges
once and only once during the walk to town

Four Color Problem - Answer-Is it possible to color every map with 4 colors so that no
two adjacent countries are colored the same?

Marriage Theorem - Answer-If every girl in a village knows k boys and every boy knows
k girls, then each girl can marry a boy she knows and each boy can amrry a girl he
knows

e = {u, v}, edge notation? - Answer-uv or vu

Multigraphs (undirected graphs) - Answer-Allow loops (edges joining a vertex to itself)
and parallel edges (several edges joining the same two vertices)

Digraphs (directed graphs) - Answer-Ordered pair of vertices

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller victoryguide. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $12.39. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

84146 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$12.39
  • (0)
  Add to cart