100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
CS/MATH 1019 Discrete Math for Computer Science MATH 1019 Fall Exam 3 Questions with Verified Solutions $14.99   Add to cart

Exam (elaborations)

CS/MATH 1019 Discrete Math for Computer Science MATH 1019 Fall Exam 3 Questions with Verified Solutions

 6 views  0 purchase
  • Course
  • Institution

CS/MATH 1019 Discrete Math for Computer Science

Preview 2 out of 8  pages

  • October 13, 2024
  • 8
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • Unknown
avatar-seller
SC/MATH 1019B Solutions to Test 3 Nov. 29th 2024




Name:


YorkU email:


Student Number:




READ THE FOLLOWING INSTRUCTIONS.
• Do not open your exam until told to do so.
• No calculators, cell phones or any other electronic devices can be used on this exam.
• Clear your desk of everything excepts pens, pencils and erasers.
• If you need scratch paper, the last page is blank.

• Show all your work unless otherwise indicated. Write your answers clearly!
Include enough steps for the grader to be able to follow your work.
• You will be given exactly 60 minutes for this exam.


I have read and understand the above instructions:
SIGNATUR E




Page 1 of 8

, SC/MATH 1019B Solutions to Test 3 Nov. 29th 2024

Multiple Choice. Circle the best answer. No work needed. No partial credit available.


1. (5 points) Which of are the following relations on {1, 2, 3} is symmetric?
A. {(1, 2), (2, 3), (2, 1), (3, 2)}
B. {(1, 1), (2, 2), (3, 3), (1, 3)}
C. {(1, 2), (2, 3), (3, 1)}
2. (5 points) The graph G = (V, E) where

E = {{1, 2}, {2, 3}, {3, 4}, {1, 4}, {2, 4}}
and V = {1, 2, 3, 4} is:
A. a bipartite graph
B. NOT a bipartite graph

3. (5 points) If an is the number of bit strings which do not contain four consecutive 0’s, then an satisfies
which recurrence:
A. an = an−1 + 2an−2 + 3an−3
B. an = an−1 + an−2 + an−3 + an−4
C. an = 2an−1 + 2n−1
D. an = 3an−2 + an−4.


Extra Work Space.




Page 2 of 8

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 YourAssignmentHandlers. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

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

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

73918 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
$14.99
  • (0)
  Add to cart