EECS 203 * We aren't endorsed by this school

EECS 203 DISCRETE MATHEMATICS

  • School:
    University of Michigan (Michigan)
    *
  • Professor:
    {[ professorsList ]}
    YaoyunShi, idk, Wakefield, GREGORYWAKEFIELD, STAFF, SINGH, jay, Pettie, kuipers, MarthaPollack, Baveja, Mudge, KarlMiller, MARKBREHOB, EdmundH.Durfee, Abernethy, Lafortune

  • Average Course Rating (from 1 Student)

    4.0/5
    Overall Rating Breakdown
    • 1 Advice
    • 5
      0%
    • 4
      100%
    • 3
      0%
    • 2
      0%
    • 1
      0%

  • Course Difficulty Rating

    • Easy 0%

    • Medium 0%

    • Hard 100%

  • Top Course Tags

    Always Do the Reading

    Go to Office Hours

    Math-heavy

* We aren't endorsed by this school

DISCRETE MATHEMATICS Questions & Answers

DISCRETE MATHEMATICS Flashcards

DISCRETE MATHEMATICS Advice

DISCRETE MATHEMATICS Documents

Showing 1 to 30 of 627

Sort by:
{[$select.selected.label]}
  • 24 pages L3 -- Winter 2013
    • L3 -- Winter 2013
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2013
    • Predicate Logic & Quantication, Inferences & Proofs EECS 203: Discrete Mathematics Lecture 3 Winter 2013 From Last Lecture A truth table for quantiers x P(x) True P(x) is true for every x when: in the domain of discourse x P(x) P(x) is true for at lea
    • Register Now

    L3 -- Winter 2013

  • 2 pages HW10-solutions
    • HW10-solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2007
    • EECS 203: DISCRETE MATHEMATICS Homework 10 Solutions 1. (4 points) Section 3.5, Problem 8. Consider the n integers starting with (n +1)!+2, (n +1)!+3, . . . , (n +1)!+(n +1) where n Z+ . Notice that k |(n + 1)! for 1 k n + 1. Thus, 2 | [(n + 1)! + 2], 3 |
    • Register Now

    HW10-solutions

  • 2 pages HW8-Solutions
    • HW8-Solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2007
    • EECS 203: DISCRETE MATHEMATICS Homework 8 Solutions 1. (4 points) A family has thirteen children: 5 identical quintuplets, two sets of 3 identical triplets, and 2 identical twins. How many distinguishable ways are there to seat the thirteen kids at a roun
    • Register Now

    HW8-Solutions

  • 7 pages EECS_203_exam2_practiceA_solns
    • EECS_203_exam2_practiceA_solns
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • EECS 203 Fall 2014 Exam 2 PRACTICE EXAM A Problem 1. Zero or more of the following statements are true. Which ones are they? (a) The number of positive integers less than 1,000,000 that have the sum of their digits equal to 9 is 10 . 6 Answer: False. This
    • Register Now

    EECS_203_exam2_practiceA_solns

  • 2 pages ve203_11_ex8
    • ve203_11_ex8
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Summer 2011
    • Discrete Mathematics Assignment 8 Date Due: 8:00 PM, Thursday, the 14th of July 2011 Oce hours: Tuesdays, 1:00-3:00 PM, and Wednesdays, 12:00-1:00 PM Exercise 1. Let (an ) be a sequence of real numbers. We dene the sequences of backward dierences (k an )
    • Register Now

    ve203_11_ex8

  • 4 pages Homework 8 Solutions W11
    • Homework 8 Solutions W11
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Spring 2011
    • EECS 203: Homework 8 Solutions Section 5.4 1. (E) 8 By binomial theorem, the coefficient of the term x8 y 9 in the expansion of (x + y)17 is 17 = 24310. 8 When considering the term x8 y 9 in the expansion of (3x + 2y)17 , let x = 3x and y = 2y, meaning th
    • Register Now

    Homework 8 Solutions W11

  • 3 pages Homework 1 Solutions W11
    • Homework 1 Solutions W11
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Spring 2011
    • EECS 203: Homework 1 Solutions Section 1.1 1. (E) 8bef b) You do not miss the final exam if and only if you pass the course. e) If you have the flu then you do not pass the course, or if you miss the final examination then you do not pass the course. f) Y
    • Register Now

    Homework 1 Solutions W11

  • 12 pages 203W10ex03-sam
    • 203W10ex03-sam
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2010
    • EECS 203, Discrete Mathematics Your last name (print): Winter 2010, University of Michigan, Ann Arbor Your rst name (print): Circle your lecture section: 1 (TTH9) 2 (TTH12) Circle your discussion section: 011 (Mandava M1:30) 012 (Wu F3:30) 013 (Wu W10:30)
    • Register Now

    203W10ex03-sam

  • 1 pages 203w07hw5
    • 203w07hw5
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2007
    • EECS 203, Discrete Mathematics Winter 2007, University of Michigan, Ann Arbor Problem Set 5 Problems from the Textbook 9.1: 24[E] 9.2: 58[M] 9.3: 32[M], 68[M] 9.4: 16[E] 2.4: 26[C], 38[E] * Additional Problems Required for All Students Problem A5.
    • Register Now

    203w07hw5

  • 3 pages sample_exam_1_winter_2015
    • sample_exam_1_winter_2015
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Spring 2015
    • Sample Exam 1 EECS 203 Winter 2015 Instructions. You have 1.5 hours to complete this exam. You may use any information you have written on a 8.511 sheet of paper. You may not use any other sources of information, including electronic devices, textbooks, o
    • Register Now

    sample_exam_1_winter_2015

  • 4 pages HW9-Solutions
    • HW9-Solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2007
    • EECS 203: DISCRETE MATHEMATICS Homework 9 Solutions 1. (9 points) If R V V is a binary relation over V then R1 (the inverse) is dened as: (x, y ) R if and only if (y, x) R1 . Prove or disprove the following: (a) If R is transitive & reexive then R R1 is a
    • Register Now

    HW9-Solutions

  • 12 pages Sample_Exam_3_Solutions
    • Sample_Exam_3_Solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Spring 2015
    • Practice Final Solutions EECS 203 Winter 2015 This is a sample exam comprised primarily of exam questions from previous years. This sample exam has not been gauged by 203 instructors for length, so it may be slightly longer or shorter than the actual nal.
    • Register Now

    Sample_Exam_3_Solutions

  • 2 pages HW2-Solutions
    • HW2-Solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2007
    • EECS 203: DISCRETE MATHEMATICS Homework 2 Solutions 1. (10 points) Chapter 1.4, Problem 10 Solution : (a) xF (x, F red) (b) yF (Evelyn, y ) (c) xyF (x, y ) (d) (xyF (x, y ) xy F (x, y ) (e) xyF (y, x) (f) x(F (x, F red) F (x, Jerry ) (g) xy (F (N ancy, x)
    • Register Now

    HW2-Solutions

  • 3 pages HW7-Solutions
    • HW7-Solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2007
    • EECS 203: DISCRETE MATHEMATICS Homework 7 Solutions 1. (4 points) There are 15 gold coins, all of which are identical except for one counterfeit coin, which is either slightly heavier or slightly lighter than all the rest. You have at your disposal a bala
    • Register Now

    HW7-Solutions

  • 4 pages samex3d
    • samex3d
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2007
    • Sample Exam 3 EECS 203 Winter 2007 You have two hours to complete this exam. You may use any information you have written on three 8.5" 11" sheets of paper, but no other information. Leave at least one seat between yourself and other students. Prob
    • Register Now

    samex3d

  • 2 pages HW1
    • HW1
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2007
    • EECS 203 HW 1 10. Let p, q, and r be the propositions p: You get an A on the final exam. q: You do every exercise in this book. r: You get an A in this class. Write these propositions using p, q, and r and logical connectives. a) You get an A in this
    • Register Now

    HW1

  • 7 pages Discussion notes
    • Discussion notes
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Spring 2014
    • EECS 203: Discrete Mathematics Spring 2014 Discussion 1 Notes May 15, 2014 1. Exercise 1.1.14 Let p, q, and r be the propositions p: You get an A on the nal exam. q: You do every exercise in this book. r: You get an A in this class. Write the following pr
    • Register Now

    Discussion notes

  • 11 pages exam_1_parta_withsolutions
    • exam_1_parta_withsolutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2015
    • Exam 1 Sample Solutions (Part A Multiple Choice Questions) EECS 203 Fall 2015 Name (Print): uniqname (Print): General Instructions You have 90 minutes to complete the two parts of this exam. The exam is worth 100 points, so you should work at a pace of mo
    • Register Now

    exam_1_parta_withsolutions

  • 4 pages Discussion Notes 1_Solutions
    • Discussion Notes 1_Solutions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2015
    • EECS 203: Discrete Mathematics Fall 2015 Discussion 1 Notes 1. Exercise 1.1.16 Determine whether these biconditionals are true or false. a) 2 + 2 = 4 if and only if 1 + 1 = 2 b) 1 + 1 = 2 if and only if 2 + 3 = 4 Solution: a) 2 + 2 = 4 if and only if 1 +
    • Register Now

    Discussion Notes 1_Solutions

  • 1 pages 5.5_problems
    • 5.5_problems
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Spring 2010
    • EECS 203 Supplemental Study Material for Section 5.5 5.5.12. How many different combinations of pennies, nickels, dimes, quarters, and half dollars can a piggy bank contain if it has 20 coins in it? Solution: There are 5 things to choose from, repetitions
    • Register Now

    5.5_problems

  • 5 pages hw2
    • hw2
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2007
    • EECS 203 HOMEWORK 2 Section1.2 Problem 10 (E): Show that each of these conditional statements is a tautology by using truth tables a) [~p(pq)]q b) [(pq) (qr)] (pr) c) [(p(pq)]q d) [(pq)(p r)(qr)] r Section 1.2 Problem 16 (E): Show that pq and (pq)
    • Register Now

    hw2

  • 2 pages Discussion+7+questions
    • Discussion+7+questions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • EECS 203: Discrete Mathematics Fall 2014 Discussion 7 Notes September 16-20, 2014 1. Section 6.4, Problem 11 Give a formula for the coecient of xk in the expansion of 1 (x2 x )100 , where k is an integer. 2. Section 6.4, Problem 19 Prove Pascals identity,
    • Register Now

    Discussion+7+questions

  • 41 pages L15 More Discrete Probability and Bayes Theorem-F14
    • L15 More Discrete Probability and Bayes Theorem-F14
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • More Discrete Probability and Bayes Theorem EECS 203 Condi<onal Probability (from last lecture) Let E and F be events with p(F) > 0. The conditional probability of E given F, defined by p(E | F), is defined as: E F Independence (fro
    • Register Now

    L15 More Discrete Probability and Bayes Theorem-F14

  • 37 pages L14 Discrete Probability F14
    • L14 Discrete Probability F14
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • Counting + Probability EECS 203 EECS 203: Discrete Mathematics 3/13/2014 Lecture 16 W14 Professor Abernethy More Exam Statistics! # homeworks submitted versus average exam score More Exam Statistics! Review Question 1 How many permutations of the letters
    • Register Now

    L14 Discrete Probability F14

  • 2 pages Discussion+8+Questions
    • Discussion+8+Questions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • EECS 203: Discrete Mathematics Fall 2014 Discussion 8 Notes EECS203 Sta October 23-29, 2014 1. Section 7.1 Exercise 22 What is the probability that a positive integer not exceeding 100 selected at random is divisible by 3? 2. Section 7.1 Exercise 24 Find
    • Register Now

    Discussion+8+Questions

  • 2 pages discussion_notes_2_nosols

    discussion_notes_2_nosols

  • 2 pages Discussion+3+questions
    • Discussion+3+questions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • EECS 203: Discrete Mathematics Fall 2014 Discussion 3 Notes September 18-22, 2014 1. Section 1.8 Example 14 Given two positive real numbers x and y, their arithmetic mean is (x + y)/2 and their geometric mean is xy. When we compare the arithmetic and geom
    • Register Now

    Discussion+3+questions

  • 54 pages L1 introduction - F14
    • L1 introduction - F14
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • EECS 203: Discrete Mathematics L1: Introduction Instructors for Fall 2014: Jacob Abernethy, Satinder Singh Baveja [email protected], [email protected] The Atomists Democritus: (460 B.C.E. give or take) All substance is composed of indivisible
    • Register Now

    L1 introduction - F14

  • 53 pages L22 Euler+Hamiltonian-F14
    • L22 Euler+Hamiltonian-F14
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • Euler and Hamiltonian paths EECS 203 Proving results about graphs Theorem: Let G be a simple graph on n vertices. If G is connected, then G must have at least (n-1) edges. How can we prove this? Proving results about graphs Lemma: Let e be an edge of G
    • Register Now

    L22 Euler+Hamiltonian-F14

  • 2 pages discussion+4+questions
    • discussion+4+questions
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Fall 2014
    • EECS 203: Discrete Mathematics Fall 2014 Discussion 4 Notes EECS203 Sta September 25-29, 2014 1. Section 2.2 Exercise 4 Let A = cfw_a, b, c, d, e and B = cfw_a, b, c, d, e, f, g, h. Find a) A B b) A B c) A B d) B A 2. Section 2.2 Exercise 18 Let A, B, C b
    • Register Now

    discussion+4+questions

Recent Documents

  • 17 pages eecs 203 study guide.pdf
    • eecs 203 study guide.pdf
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2013
    • EECS 203 final exam study guide winter 2012, University of Michigan by Evan Hahn + Scott Godbold + Brad Hekman + Alex Ihlenburg + Ryan Yezman + Matt Schulte + Lulu Tang + Andy Modell + Kevin Byung + David Brownman + Otto Sipe + Yaoyun Shi + Thomas Lovett
    • Register Now

    eecs 203 study guide.pdf

  • 7 pages HMW6
    • HMW6
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2013
    • 6-316: (A) Qua-5111219 my; _ 13,6,QIt),ElZ,15;l(OF131q 2111,41: 29! Q3 (9L4 95 UJLJMUL/ I 3-.1. 5 . . I 5 L W ml! 5 mg L @Jvj' U:''='-J;.Hf H 10 .j=.v'1:ii'- 'r'.cfw_"'- n 2 3 IA rkjcpmmm greener Wm. of @6in 1c. [8 cams by 53b? Case": 9033:"?10 m. 1
    • Register Now

    HMW6

  • 6 pages HMWK2

    HMWK2

  • 1 pages StudySheet
    • StudySheet
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2013
    • Describe the time complexity of the linear search algorithm (specified as Algortihm 2 in Section 3.1). Solution: The number of comparisons used by Algorithm 2 in Section 3.1 will be taken as the measure of the time complexity. At each step of the loop in
    • Register Now

    StudySheet

  • 11 pages exam_F15_ptA
    • exam_F15_ptA
    • University of Michigan
    • DISCRETE MATHEMATICS
    • EECS 203 - Winter 2013
    • Exam 1 (Part A Multiple Choice Questions) EECS 203 Fall 2015 Name (Print): uniqname (Print): General Instructions You have 90 minutes to complete the two parts of this exam. The exam is worth 100 points, so you should work at a pace of more than a point p
    • Register Now

    exam_F15_ptA

DISCRETE MATHEMATICS Questions & Answers

Showing 1 to 8 of 8

View all

DISCRETE MATHEMATICS Advice

Showing 1 to 1 of 1

View all
    • Profile picture
    Feb 27, 2017
    | Would recommend.

    This class was tough.

    Course Overview:

    This course is very hard course, and there is homework every week. Midterms may look easy, but it is actually hard.

    Course highlights:

    It teaches you with basic discrete mathematics and helpful for computer science majors.

    Hours per week:

    3-5 hours

    Advice for students:

    Please, please read the textbook and study advance for midterms. Don't forget to do homework. Also, participation scores really help.

    • Winter 2017
    • Lafortune
    • Yes
    • Math-heavy Go to Office Hours Always Do the Reading
Back to Department

Related Courses

Ask a homework question - tutors are online