WGU C959 - Discrete Math, Full exam

Study Guides Aug 18, 2025
Loading...

Loading document viewer...

Page 0 of 0

Document Text

WGU C959 - Discrete Math, Full exam Review Questions with 100% Correct Answers | Latest Update | Verified Question : No repeated edges in a graph is considered a: Circuit Cycle Open-Walk

Correct answer: Circuit

Question : If no edge occurs more than once in a walk, then

the walk open and is considered a:

Circuit Cycle Trail

Correct answer: Trail

Question : When a trail has no repeated vertex then the trail is

considered a:

Cycle

Path Tail Circuit

Correct answer: Path

Question : An open walk + no repeated edges is a: Cycle Trail Path Circuit

Correct answer: Trail

Question : An open walk + no repeated edges + no repeated

vertex is a:

Cycle Trail Path Circuit

Correct answer: Path

Question : A closed walk + no repeated edges is a: Cycle Trail Path Circuit

Correct answer: Circuit

Question : A closed walk + no repeated edges + no repeated

vertex (expected first and last) is a:

Trail and Path Circuit Cycle Circuit and Cycle Tail

Correct answer: Circuit and Cycle

Question : T/F: Order matters in ordered pairs?

Correct answer: True

Question : A two-input XOR gate (for "exclusive OR")

outputs 1 if the input values differ. True or False

Correct answer: True

Question : A two-input XNOR gate (for "exclusive NOR")

outputs 1 if the input values are the same. True or False

Correct answer: True

Question : T/F:

-3 ∈ Z+

Correct answer: False

Question : T/F:

0 ∈ Z+

Correct answer: False

Question : T/F:

Download Document

Buy This Document

$30.00 One-time purchase
Buy Now
  • Full access to this document
  • Download anytime
  • No expiration

Document Information

Category: Study Guides
Added: Aug 18, 2025
Description:

WGU C959 - Discrete Math, Full exam Review Questions with 100% Correct Answers | Latest Update | Verified Question : No repeated edges in a graph is considered a: Circuit Cycle Open-Walk Correct an...

Get this document $30.00