Home

Schools

University of Houston

MATH

MATH 3336

MATH 3336 * We aren't endorsed by this school

MATH 3336 Discrete mathematics

School:

University of Houston (UH)
*
Professor:

{[ professorsList ]}

Staff, flagg, Alvarez, AartiJajoo, perepelitsa, Irina

Average Course Rating (from 2 Students)
4.5/5
Overall Rating Breakdown
- 2 Advice
- 5
  
  50%
- 4
  
  50%
- 3
  
  0%
- 2
  
  0%
- 1
  
  0%
Course Difficulty Rating
- Easy 50%
- Medium 0%
- Hard 50%
Top Course Tags

Great Intro to the Subject

Many Small Assignments

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 211

Sort by:

{[$select.selected.label]}

1 pages
- Exam 1 Review Summer 2014 on Discrete Mathematics
- University of Houston
- Discrete mathematics
- MATH 3336 - Summer 2014
- Math 3336 Discrete Mathematics Summer 2014 (Session 4) Exam 1 Review On the Math 3336 Exam 1, the student will be expected to: Sec. Topic 1.1 Determine whether or not a statement is a proposition, and if not, explain why. Construct Truth Tables Determine
- Register Now
Exam 1 Review Summer 2014 on Discrete Mathematics
5 pages
- Homework09 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- 1. A class has 30 students enrolled. In how many ways can: (a) four be put in a row for a picture? (b) all 30 be put in a row for a picture? (c) all 30 be put in two rows of 15 each (that is, a front row and a back row) for a picture? 2. Let S = cfw_1, 2,
- Register Now
Homework09 Solutions
1 pages
- Test 3 Content
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Content for Test 3 When topics are not mentioned for a section, then it implies everything from that section will be covered. The exam questions will be similar in nature to the homework problems given in the class. Section 5.1 Section 5.2 (The last top
- Register Now
Test 3 Content
6 pages
- Math Test 3 Review.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Topics that will be covered on Test 3 1. Mathematical Induction 5.1 2. Strong Mathematical Induction 5.2 3. Recurrence relations 8.1 4. Solving Linear recurrence relations 8.2 Problem Use the mathematical induction to prove that for any non-negative integ
- Register Now
Math Test 3 Review.pdf
4 pages
- Test2(Fall 2015)
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 2 Fall 2015 Write your name and UH ID on the cover of the blue book. You have 50 minutes to nish the exam. You cannot use any books or notes. Please provide detailed solution for full credit. Clearly mark the answer to each problem. 1. 2. 3
- Register Now
Test2(Fall 2015)
5 pages
- Test2Redo(Fall 2015)
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 2 RE-DO Fall 2015 Write your name and UH ID on the cover of the blue book. You have 50 minutes to nish the exam. You cannot use any books or notes. Please provide detailed solution for full credit. Clearly mark the answer to each problem. 1
- Register Now
Test2Redo(Fall 2015)
4 pages
- Test1(Fall 2015)
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- I Math 3336 Test 1 Fall 2015 Write your name and UH ID on the cover of the blue book. You have 50 minutes to nish the exam. You cannot use any books or notes. Please provide detailed solution for full credit. Clearly mark the answer to each problem. 1. (1
- Register Now
Test1(Fall 2015)
2 pages
- discrete math exam1cheatsheet
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Propositional Logic Conditional: P -> Q Converse: P -> Q Inverse: P -> -Q (same value as converse) Contrapositive: -P -> -Q (same value as conditional) Precedence: -, ^ , or, ->, <-> Tautology: True for every assignment Contradiction/unsatisfiable: false
- Register Now
discrete math exam1cheatsheet
4 pages
- Test2KEY
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 2 Fall 2015 Write your name and UH ID on the cover of the blue book. You have 50 minutes to nish the exam. You cannot use any books or notes. Please provide detailed solution for full credit. Clearly mark the answer to each problem. 1. 2. 3
- Register Now
Test2KEY
5 pages
- Test2RedoKEY
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 2 RE-DO Fall 2015 Write your name and UH ID on the cover of the blue book. You have 50 minutes to nish the exam. You cannot use any books or notes. Please provide detailed solution for full credit. Clearly mark the answer to each problem. 1
- Register Now
Test2RedoKEY
4 pages
- Test3KEY
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Te 3 1. (10 pts) Describe the following sequence assume that the sequences begin with al. an = the number of bit strings oflength n that begin with a 1. recursively. Include initial conditions and 1. (15 pts) How many positive integers not excee
- Register Now
Test3KEY
4 pages
- Test1KEY
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- I Math 3336 Test 1 Fall 2015 Write your name and UH ID on the cover of the blue book. You have 50 minutes to nish the exam. You cannot use any books or notes. Please provide detailed solution for full credit. Clearly mark the answer to each problem. 1. (1
- Register Now
Test1KEY
7 pages
- Math Test 2 Review.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 2 Review Chapter 2 1. Prove that = by giving an element table proof. 2. Prove that = by giving a proof using logical equivalence. 3. Prove that ( ) = ( ) ( ) by giving an element table proof. 4. Prove that ( ) = ( ) ( ) by giving a proo
- Register Now
Math Test 2 Review.pdf
4 pages
- Homework03 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 03 1.6 2 This is true using modus tollens. The rst statement if p q, where p is George does not have eight legs and p is George is not a spider. The second statement is q. THe third is p. We can therefore conclude that the conclusion of the argum
- Register Now
Homework03 Solutions
5 pages
- Homework01 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 01 1.1 2 ( 1 point each) 2 a. Not a proposition, it is a command. b. Not a proposition, it is a question. c. It is a proposition, which is false. d. Not a proposition, since its truth value depends on the value of x. e. It is a proposition,
- Register Now
Homework01 Solutions
3 pages
- Test 2 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Name: People Soft Test 2 Math 3336 You haw 50 minutw to finish itiii': {EXILH'L You (mum! use Any books or IJOH‘S. Any quwi min; “111”: ill pman .u'e‘ humus; qms’uuii (iv. tin) hst is out of .100 DUiHih. but tim iota] of the (-5! I» lit) pman] This tvbt i
- Register Now
Test 2 Solutions
1 pages
- Test 2 Content
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Content for Test 2 When topics are not mentioned for a section, then it implies everything from that section will be covered. The exam questions will be similar in nature to the homework problems given in the class. Section 2.1 Section 2.2 Section 2.3
- Register Now
Test 2 Content
2 pages
- Test 1 Content
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Content for Test 1 When topics are not mentioned for a section, then it implies everything from that section will be covered. The exam questions will be similar in nature to the homework problems given in the class. Section 1.1 Section 1.2 Translating E
- Register Now
Test 1 Content
47 pages
- Chapter10Part2Notes
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Section 10.3 Section Summary Adjacency Lists Adjacency Matrices Incidence Matrices Isomorphism of Graphs Representing Graphs: Adjacency Lists Definition: An adjacency list can be used to represent a graph with no multiple edges by specifying the verti
- Register Now
Chapter10Part2Notes
4 pages
- Homework08 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 08 5.1 2 ) 5.1 4 ) 5.1 6 ) 5.1 8 ) 1 5.1 10 2 5.2 4 ) 6.1 2 ) 6.1 4 ) 6.1 8 ) 6.1 12 ) 6.1 14 ) 3 6.1 22 ) 6.1 32 ) 6.1 44 ) 4
- Register Now
Homework08 Solutions
4 pages
- Homework06 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 07 4.1 20 ) 4.1 24 ) 4.1 26 ) 4.1 28 ) 4.1 32 1 4.2 2 ) 4.2 4 ) 4.2 8 ) 2 4.2 22 ) 4.3 4 ) 4.3 16 ) 4.3 20 ) 4.3 24 ) 4.3 32 ) 3 4.3 40 ) 4
- Register Now
Homework06 Solutions
3 pages
- Homework07 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 07 4.4 4 ) 4.4 6 ) 4.4 7 ) 4.4 8 ) 1 4.4 10 4.4 12 ) 4.4 20 ) 4.4 32 ) 4.4 34 ) 2 4.4 38 ) 4.6 Q2 ) 4.6 Q8 ) 4.6 Q10) 3
- Register Now
Homework07 Solutions
3 pages
- Homework05 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 05 2.3 2 ) 2.3 4 ) 2.3 8 ) 2.3 14 ) 2.3 26 a. Let f : R R be the given function. It is given that f is strictly increasing, by denition this means that f (x1 ) < f (x2 ), i x1 < x2 . (1) We have to show that f is one to one, this means we have to
- Register Now
Homework05 Solutions
3 pages
- Homework04 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 04 1.8 8 ) The number 1 has this property, since the only positive integer not exceeding 1 is 1 itself, and therefore the sum is 1. 1.8 10 (points 10) Notice that the two positive integers given are consecutive integers. Let us call n = 2.10500 .
- Register Now
Homework04 Solutions
4 pages
- Homework02 Solutions
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Homework 02 1.4 2 ( 1 point each) 2 a. True b. False c. False d. True 1.4 5 ( 1 point each) 2 a. Some student spends more than ve hours every weekday in class. b. All student spend more than ve hours every weekday in class. c. Some student does not
- Register Now
Homework02 Solutions
7 pages
- DIscrete Math Notes 17
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Solving Linear Recurrence Relations Sec. 8.2 Linear Nonhomogeneous Recurrence Relations with Constant Coefficients. Definition: A linear nonhomogeneous recurrence relation with constant coefficients is a recurrence relation of the form: a =c a n
- Register Now
DIscrete Math Notes 17
5 pages
- Discrete Math Notes 8
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Section 1.8 Proof Methods and Strategy Topics: Exhaustive Proof Proof by Cases Existence Proofs Constructive Nonconstructive Exhaustive Proof Some theorems can be proven by examining a relatively small number of examples. Such proofs are ca
- Register Now
Discrete Math Notes 8
5 pages
- Discrete Math Notes 13
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Section 4.2 Integer Representations and Algorithms Integer Representations Base b Expansions Binary Expansions Octal Expansions Hexadecimal Expansions Base Conversion Algorithm Algorithms for Integer Operations In everyday life we use decima
- Register Now
Discrete Math Notes 13
3 pages
- Test3Review
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 3 Review Questions How to study: Study the class notes, review homework problems, and try to do as many exercises as you can from the textbook. Note that answers are provided at the back of the book to all odd numbered problems. Here I prov
- Register Now
Test3Review
2 pages
- Test2Review
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- Math 3336 Test 2 Review Questions How to study: Study the class notes, review homework problems, and try to do as many exercises as you can from the textbook. Note that answers are provided at the back of the book to all odd numbered problems. Here I prov
- Register Now
Test2Review

Prev Next

Recent Documents

4 pages
- Math Hwk 1.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- NAME: HOMEWORK 1. MATH3336. Write your solutions to the problems in the space provided. Write your name, staple and return the homework to the instructor for grading. [1.](5pts) Which of these are propositions? What are the truth values of those that are
- Register Now
Math Hwk 1.pdf
3 pages
- Math Hwk 2.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- NAME: HOMEWORK 2. MATH3336. Write your solutions to the problems in the space provided. Write your name, staple and return the homwork to the instructor for grading. Read Sections 1.4 and 1.5 and an example of Sudoku puzzle on page 32. [1.](5pts) #61(b) p
- Register Now
Math Hwk 2.pdf
3 pages
- Math Hwk 3.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- NAME: HOMEWORK 3. MATH3336. Write your solutions to the problems in the space provided. Write your name, staple and return the homework to the instructor for grading. Show work; answers without solutions will not be graded. Read sections 1.7, 1.8 from the
- Register Now
Math Hwk 3.pdf
4 pages
- Math Hwk 5.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- NAME: HOMEWORK 5. MATH3336. Write your solutions to the problems in the space provided. Write your name, staple and return the homework to the instructor for grading. Show work; answers without solutions will not be graded. [1.](5pts) # 12(b), p. 285. [2.
- Register Now
Math Hwk 5.pdf
4 pages
- Math Hwk 4.pdf
- University of Houston
- Discrete mathematics
- MATH 3336 - Fall 2015
- NAME: HOMEWORK 4. MATH3336. Write your solutions to the problems in the space provided. Write your name, staple and return the homework to the instructor for grading. Show work; answers without solutions will not be graded. [1.](5pts) # 12, p. 136. [2.](5
- Register Now
Math Hwk 4.pdf

Discrete mathematics Questions & Answers

Showing 1 to 8 of 8

View all

Discrete mathematics Advice

Showing 1 to 2 of 2

View all

May 31, 2017
| Would recommend.
This class was tough.

Course Overview:

Required course for Computer Science major

Course highlights:

It forces you to get into the habit of studying

Hours per week:

3-5 hours

Advice for students:

Make sure you always have access to something to scan your work with in order to turn in homeworks. Also makes sure to pay attention during class and study for the tests, which are hard.
- Course Term: Spring 2017
- Professor: Irina
- Course Required? Yes
- Course Tags: Math-heavy
Feb 11, 2017
| Would highly recommend.
Pretty easy, overall.

Course Overview:

Her notes are very good. Her tests are closely based off of her test reviews as well.

Course highlights:

The class covers mathematical logic, so I learned combinatorial logic, graphs, etc..

Hours per week:

3-5 hours

Advice for students:

Follow the notes very closely. Study the test reviews closely.
- Course Term: Fall 2016
- Professor: perepelitsa
- Course Required? Yes
- Course Tags: Great Intro to the Subject Many Small Assignments

Back to Department

Related Courses

MATH 1432 - Calculus 2 (1671 Documents)
MATH 1431 - Ca (1036 Documents)
MATH 2311 - INTRODUCTION TO PROBABLITY AND STATISTICS (1003 Documents)
MATH 3321 - ENGINEERING MATHE (958 Documents)
MATH 2433 - Cal 3 (700 Documents)
MATH 3339 - Statistics for Science (668 Documents)
MATH 1310 - COLLEGE ALGEBRA (528 Documents)
MATH 1301 - algebra (409 Documents)
MATH 1313 - FINITE MATH WITH APPLICATIONS (405 Documents)
MATH 1330 - Precalculus (395 Documents)

Ask a homework question - tutors are online