Ministry of Higher Education
Kingdom of Saudi Arabia
CSTS
SEU, KSA
Discrete Mathematics (Math-150)
Level III, Assignment-2
(2016-2017)
Section I
State whether the following statements are true or false: (6 marks)
1) A set A has m elements and B has n elem
Ministry of Higher Education
Kingdom of Saudi Arabia
CSTS
SEU, KSA
Discrete Mathematics (Math 150)
Level III, Assignment 1
(2015)
1. State whether the following statements are true or false:
[9]
(a) y (x y) is a tautology.
(a)
(b) The compound proposition
Ministry of Higher Education
Kingdom of Saudi Arabia
CSTS
SEU, KSA
Discrete Mathematics (Math 150)
Level III, Assignment 2
(2015)
1. State whether the following statements are true or false:
[9]
(a) Two sets are equal if and only if they have the same num
Course Name \ MATH-150
Student Name \ HANI ALAHMARI
Academic NO. \ 120002413
CRN NO. \
12177
F2F time \
6-7 PM
Week 5 Practice Exercises
:3.1
Devise an algorithm that finds the sum of all the .3
integers
.in a list
(procedure AddUp(a1, . . . , an: integer
Course Name \ MATH-150
Student Name \ HANI ALAHMARI
Academic NO. \ 120002413
CRN NO. \
12177
F2F time \
6-7 PM
Week 5 Home Work
:3.1
Describe an algorithm that takes as input a list of n integers .6
and finds the number of negative integers in the
.list
F
Course Name \ MATH-150
Student Name \ HANI ALAHMARI
Academic NO. \ 120002413
CRN NO. \
12177
F2F time \
6-7 PM
Week 5 Home work
3.1
Devise an algorithm that finds the sum of all the .3
integers
.in a list
(procedure AddUp(a1, . . . , an: integers .3
sum :
H.W 3
Translate these system specifications into English where .38
the predicate S(x,y)is xis in state y and where the
domain for xand yconsists of all systems and all possible
.states, respectively
(a) xS(x,open
(b) x(S(x,malfunctioning) S(x,diagnostic
(
Week 1 Practice Exercises :1-3
:Section 1-1
Which of these sentences are propositions? What are the truth values of those that are .1
?propositions
(a) Boston is the capital of Massachusetts. . (proposition)(T
(b) Miami is the capital of Florida.
(proposi
CS 441 Discrete Mathematics for CS
Lecture 24
Relations IV
Milos Hauskrecht
[email protected]
5329 Sennott Square
CS 441 Discrete mathematics for CS
M. Hauskrecht
Equivalence relation
Definition: A relation R on a set A is called an equivalence
relation i
Week 6 Study Notes
6.1 Algorithms (Text Section 3.1)
An algorithm is a definite procedure for solving a problem in a finite number of steps.
An algorithm is much like a recipe. The types of input needed (the ingredients) are described.
Then steps are list
Week 13 Study Notes
13.1 Graphs and Graph Models (Text Section 10.1)
Graphs are discrete structures consisting of vertices and edges that connect these vertices. In
this section, the basic terminology and notation associated with graphs is introduced. As
Week 14 Study Notes
14.1 Introduction to Trees (Text Section 11.1)
Trees form a special subset of graphs. In this section, basic definitions and concepts associated
with trees are introduced.
Basic definitions:
As defined on page 746, a tree is a connecte
Week2 For Students
Q 1: Determine wheather of the statement true or false:
1- x 2 + y 2 = z 2 is not proposition. F
2-the conditional statement is false when both and are false. F
3-~(~ ) and are logically equivalent. T
4-~ is a contradiction. F
5- the bi
Week 5 Study Notes
5.1 Sets (Text Section 2.1)
Set theory provides an underlying structure and a language to use in talking about various
discrete structures. Listed below is a summary of the key ideas presented in this section.
A set is a collection of o
CS 441 Discrete Mathematics for CS
Lecture 23
Relations III.
Milos Hauskrecht
[email protected]
5329 Sennott Square
M. Hauskrecht
CS 441 Discrete mathematics for CS
Composite of relations
Definition: Let R be a relation from a set A to a set B and S a
rel
Week 9 Study Notes
9.1 Mathematical Induction (Text Section 5.1)
Mathematical induction is a proof technique that can be applied in many situations involving
discrete objects. This technique is particularly useful when we want to prove something is true
f
Week 3 Study Notes
3.1 Boolean Functions (Text Section 12.1)
Many real-world applications can be modeled by functions whose domains are ordered n-tuples
from the two-element set B = cfw_0,1 and whose range is B = cfw_0,1. For example:
Political votes have
Week 2 Study Notes
2.1 Propositional Logic (Text Section 1.1)
An important objective of this course is to teach students how to understand and how to construct
correct mathematical arguments. In this section, several of the basic building blocks of logic
Week 4 Study Notes
4.1 Predicates and Quantifiers (Text Section 1.4)
P(x) is said to be the value of the propositional function P at x. The truth value of P(x) depends
upon the value of x.
Quantification:
The universal quantification of P(x) is the propos
Saudi Electronic University
College of Computing and Informatics
Assignment of week 13/ Math 150
Answer Keys
Section 1: (True or False Questions)
Section 1
1
A connected graph without any simple circuit is called a tree. (T)
2 A tree with n vertices has n
Week 11 Study Notes
11.1 Applications of Recurrence Relations (Text Section 8.1)
Recurrence relations were introduced in Section 2.4 of the textbook in the context of sequences.
They were treated in more depth in Chapter 5 along with their relationship to
Week 10 Study Notes
10.1 The Basics of Counting (Text Section 6.1)
In this section, several basic counting "rules" are introduced.
The Sum Rule: If a first task can be done in n1 ways and a second task in n2 ways, and if these
tasks cannot be done at the
Saudi Electronic
University College of
Computing and
Informatics Discrete
Mathematics (Math 150)
Assignment week 13
1. Determine whether each of these statements is
true or false.
a
An undirected graph has an even number of vertices of odd degree. (T)
A c
Q 1:Determine whether each of these statements is
true or false:
1-the number of function from a set with 3 elements to a set with 6
elements is 18. F
2- the number of different bit strings of length 5 is 32. T
3- P ( n ,0 )=0 . F
C ( n , r )=
4-
n
n!
( n
Saudi Electronic University
College of Computing and Informatics
Assignment of week 7/ Math 150
Section 1: (True or False Questions)
Section 1
1/ 7/3 is a integer.
2
Let a,b,c be integers where a 0 then . if a/b and a/c , then a/(a+b) .
3
In the binary no
1. State whether the following statements are true or false:
(a) x P(x) x P(x)
(a) false
(b) x Q(x) x Q(x)
(b) true
(c) x y Q(x,y) states that for every x there does not exist any y such that Q(x,y).
(c) False
(d) If n is odd integer, then n2 is odd.
(d)
Ministry of Higher Education
Kingdom of Saudi Arabia
CCI, SEU
KSA
Discrete Mathematics (Math 150)
Level III, Assignment 4
(2015)
1. State whether the following statements are true or false:
(a) If a relation is transitive then it is an equivalent relation
Ministry of Higher Education
Kingdom of Saudi Arabia
CCI
SEU, KSA
Discrete Mathematics (Math 150)
Level III, Assignment 2
(2015)
1. State whether the following statements are true or false:
(a) If any two sets are disjoint then their union is the empty se
Ministry of Higher Education
Kingdom of Saudi Arabia
CCI
SEU, KSA
Discrete Mathematics (Math 150)
Level III, Assignment 1
(2015)
1. State whether the following statements are true or false:
(a) x + 4 = 7 is a proposition.
(a)
False
(b)
True
(c)
True
(d)
F