lOMoARcPSD|46692070
York University
CS/MATH 1019 Discrete Math for Computer
Science
CS/MATH 1019 Exam
Course Title and Number: CS/MATH 1019 Discrete Math
for CS
Exam Date: Midterm and Final Exam 2024- 2025
Instructor: [Insert Instructor’s Name]
Student Name: [Insert Student’s Name]
Student ID: [Insert Student ID]
Examination
180 minutes
Instructions:
1. Read each question carefully.
2. Answer all questions.
3. Use the provided answer sheet to mark your responses.
4. Ensure all answers are final before submitting the exam.
5. Please answer each question below and click Submit when you have
completed the Exam.
6. This test has a time limit, The test will save and submit automatically
when the time expires
7. This is Exam which will assess your knowledge on the course
Learning Resources.
Good Luck!
Downloaded by Jack mah
()
, lOMoARcPSD|46692070
SC / MATH 1019 Discrete Math for Computer Science
SC / MATH 1019 Discrete Math Exam Questions with
Verified Solutions | 100% Pass | Graded A+ |
How do you check satisfiability? - Answer>> Take the negation of the propositions,
and if the result is a tautology, then it is satisfiable.
Let G = (V, E) be an undirected graph. Let n ∈ N and b,c ∈
E. A path in G from b to c is ... - Answer>> a sequence of n
edges for which there is a sequence of n+1 vertices such
that z0 = b, zn = c, and zi−1 and zi are the endpoints of ei
for each i = 1, . . . , n
A path is simple if ... - Answer>> no edge occurs more than
once.
A circuit/cycle is ... - Answer>> a path of non-zero length
from a vertex to itself.
Let G be an undirected graph. If there is a path from
vertices b to c in G, then ... - Answer>> there is a simple path
from b to c.
Let G be an undirected graph. G is connected if ... -
Answer>> there are paths from every vertex to every other
vertex.
In a connected undirected graph, there are ... - Answer>>
simple paths from every vertex to every other vertex.
The connected components of a graph are ... - Answer>> the
subgraphs induced by equivalence classes of the relation
"there is a path from u to v".
Cut vertices/articulation points and cut edges/bridges
are ... - Answer>> points or edges where, when removed,
produce a subgraph with more connected components (a
subgraph that is not connected).
Downloaded by Jack mah
()
York University
CS/MATH 1019 Discrete Math for Computer
Science
CS/MATH 1019 Exam
Course Title and Number: CS/MATH 1019 Discrete Math
for CS
Exam Date: Midterm and Final Exam 2024- 2025
Instructor: [Insert Instructor’s Name]
Student Name: [Insert Student’s Name]
Student ID: [Insert Student ID]
Examination
180 minutes
Instructions:
1. Read each question carefully.
2. Answer all questions.
3. Use the provided answer sheet to mark your responses.
4. Ensure all answers are final before submitting the exam.
5. Please answer each question below and click Submit when you have
completed the Exam.
6. This test has a time limit, The test will save and submit automatically
when the time expires
7. This is Exam which will assess your knowledge on the course
Learning Resources.
Good Luck!
Downloaded by Jack mah
()
, lOMoARcPSD|46692070
SC / MATH 1019 Discrete Math for Computer Science
SC / MATH 1019 Discrete Math Exam Questions with
Verified Solutions | 100% Pass | Graded A+ |
How do you check satisfiability? - Answer>> Take the negation of the propositions,
and if the result is a tautology, then it is satisfiable.
Let G = (V, E) be an undirected graph. Let n ∈ N and b,c ∈
E. A path in G from b to c is ... - Answer>> a sequence of n
edges for which there is a sequence of n+1 vertices such
that z0 = b, zn = c, and zi−1 and zi are the endpoints of ei
for each i = 1, . . . , n
A path is simple if ... - Answer>> no edge occurs more than
once.
A circuit/cycle is ... - Answer>> a path of non-zero length
from a vertex to itself.
Let G be an undirected graph. If there is a path from
vertices b to c in G, then ... - Answer>> there is a simple path
from b to c.
Let G be an undirected graph. G is connected if ... -
Answer>> there are paths from every vertex to every other
vertex.
In a connected undirected graph, there are ... - Answer>>
simple paths from every vertex to every other vertex.
The connected components of a graph are ... - Answer>> the
subgraphs induced by equivalence classes of the relation
"there is a path from u to v".
Cut vertices/articulation points and cut edges/bridges
are ... - Answer>> points or edges where, when removed,
produce a subgraph with more connected components (a
subgraph that is not connected).
Downloaded by Jack mah
()
