CSCE 235
Homework 1
Name(s)
Fall 2012
CSE Login
Instructions Follow instructions carefully, failure to do so may result in points being deducted. Clearly
label each problem and submit the answers in order. Staple this cover page to the front of your assig
CSCE 235
Assignment 7
Fall 2015
Name
CSE Login
Instructions Follow instructions carefully, failure to do so may result in points being deducted.
Use A4 size papers to prepare your solutions. Pages teared out from notebooks are not acceptable.
Clearly la
CSCE 235/235H
Assignment 1
Name(s)
Fall 2014
CSE Login
Instructions Follow instructions carefully, failure to do so may result in points being deducted. Clearly
label each problem and submit the answers in order. Staple this cover page to the front of you
Recitation 6
Monday, October 6, 2014
Functions
What is a general Function?
Points from each member of A to a member of B
Cant have one A pointing to more than one B
One to many is NOT allowed
More than one A can point to the same B
Many to one is al
Recitation8
Sunday, November 02, 2014
Name:_
Linear Search
Binary Search
The list to be searched: L = 1 3 4 6 8 9 11. The value to be found: X = 4.
1 3 4 6 8 9 11
Compare X to 6. X is smaller. Repeat with L = 1 3 4.
1 3 4
Compare X to 3. X is bigger. Repe
Recitation9
Monday, November 10, 2014
Name:_
Chapter 3.1
7. Describe an algorithm that takes as input a list of n integers and nds the location of the last even
integer in the list or returns 0 if there are no even integers in the list.
19. Describe an al
Sets
Sec'ons 2.1 and 2.2 of Rosen
Spring 2013
CSCE 235 Introduc5on to Discrete Structures
Course web-
page: cse.unl.edu/~cse235
Ques5ons: Piazza
Outline
Deni5ons: set, element
Terminology and nota5on
Proving equiv
Sequences & Summa,ons
Sec,on 2.4 of Rosen
Spring 2013
CSCE 235 Introduc5on to Discrete Structures
Course web-
page: cse.unl.edu/~cse235
Ques,ons: Piazza
Outline
Although you are (more or less) familiar with
seque
Rela&ons
Sec&on 9.1, 9.39.5 of Rosen
Spring 2013
CSCE 235 Introduc5on to Discrete Structures
Course web-
page: cse.unl.edu/~cse235
Ques5ons: Piazza
Outline
Rela5on:
Deni5on, representa5on, rela5on on a set
Pro
Recursion
Sec,ons 8.1 and 8.2 of Rosen
Spring 2013
CSCE 235 Introduc5on to Discrete Structures
Course web-
page: cse.unl.edu/~cse235
Ques,ons: Piazza
Outline
Introduc5on, Mo5va5ng Example
Recurrence Rela5ons
Den
Proofs
Sec*ons 1.6, 1.7 and 1.8 of Rosen
Spring 2013
CSCE 235 Introduc5on to Discrete Structures
Course web-
page: cse.unl.edu/~cse235
Ques5ons: Piazza
Outline
Mo5va5on
Terminology
Rules of inference:
Modus
Recitation 2
Friday, September 12, 2014
Name: _
Review
How would you write out the following using
(
(
) (
) (
)
)
What does the following equal?
(
)
This is 0 or false
(
)
This is 1 or true
(
)
and
P
(
)
and
1
and
(
)
0
(
)
p
(
Is this true or fal
Recitation 2
Friday, September 12, 2014
Name: _
1. Question 1 Give the truth table for
(
)
(
)
(
0
0
1
1
0
1
0
1
1
1
0
1
)
1
0
1
1
2. Question 2 Prove the following without a truth table
(
)
(
)
(
)
We can prove that the right hand side is the same as the
Recitation7
Friday, October 24, 2014
Name:_
0 1 2 3
0 X
1
X
2
X
3
X
Reflexive yes, all entries along diagonal marked
0 1 2 3
0 X
X
1
2 X
X X
3
X X
Reflexive no, not all along diagonal are marked
Symmetric yes, mirrored along diagonal
Transitive - yes
Symm
CSCE 235
Introduction to
Discrete Structures
Lecture 7
Mohammad Rashedul Hasan
September 9 - 11, 2015
Announcement
Homework 2 Posted
Due: September 23 (Wednesday)
In Search of
Absolute Knowledge
&
Peace
What is Peace?
No peace without absolute
knowledge
CSCE 235
Introduction to
Discrete Structures
Lecture 3
Mohammad Rashedul Hasan
August 28 - 31, 2015
Burnett 107
Class Room Has Been Changed!
New Class Room: Avery 115
From Next Monday (August 31), lectures will be held
in Avery 115.
Previous Lecture: Buil
CSCE 235
Introduction to
Discrete Structures
Lecture 5
Mohammad Rashedul Hasan
September 2, 2015
Announcement
Home Work 1 Due: September 9 (Wednesday) at
the beginning of the lecture
Goal of This Course
Building
a Device
Building Toolbox
Building Toolbox
CSCE 235
Introduction to
Discrete Structures
Lecture 4
Mohammad Rashedul Hasan
August 31 September 2, 2015
Announcement
HW 1 has been posted
HW 1 Due Date: September 9 (Wednesday) in the
beginning of the lecture
Before you write your answers, please re
CSCE 235
Introduction to
Discrete Structures
Lecture 8
Mohammad Rashedul Hasan
September 14 - 16, 2015
Introduction: Terminology
A theorem is a statement that can be shown to be true
(via a proof)
A proof is a sequence of statements that form an
argumen
CSCE 235
Introduction to
Discrete Structures
Lecture 6
Mohammad Rashedul Hasan
September 4 2015
Mixing Quantifiers
Existential and universal quantifiers can be used
together to quantify a predicate statement
For example, xyP(x, y) is perfectly valid
Ho
CSCE 235/235H
Assignment 1
Name
Fall 2015
NUID
Instructions Follow instructions carefully, failure to do so may result in points being deducted.
Use A4 size papers to prepare your solutions. Pages teared out from notebooks are not allowed.
Clearly label
CSCE 235/235H
Assignment 6
Fall 2015
Name
CSE Login
Instructions Follow instructions carefully, failure to do so may result in points being deducted.
Use A4 size papers to prepare your solutions. Pages teared out from notebooks are not acceptable.
Clear
CSCE 235/235H
Assignment 5
Fall 2015
Name
CSE Login
Instructions Follow instructions carefully, failure to do so may result in points being deducted.
Use A4 size papers to prepare your solutions. Pages teared out from notebooks are not acceptable.
Clear
Recitation 4
Definitions
x is an element of A
x is not an element of A
A is a subset of B iff every element of A is in B
the empty set is always an element
the set is a subset of itself
A is a proper subset of B if there is an element of B that is not in
Introduc*on to Logic
Sec*ons 1.1, 1.2, 1.3 of Rosen
Spring 2013
CSCE 235 Introduc5on to Discrete Structures
URL: cse.unl.edu/~cse235
All ques5ons: Piazza
Introduc5on: Logic?
We will study
Proposi5onal Logic (
CSCE 235
Homework 2
Name(s)
Fall 2012
CSE Login
Instructions Follow instructions carefully, failure to do so may result in points being deducted. Clearly
label each problem and submit the answers in order. Staple this cover page to the front of your assig