Discrete Mathematics
42 Questions
| Attempts: 363
Multilple Choice
Questions and Answers
- 1.
Consists of 2 finite sets: vertices and edges with a set of 1 or 2 endpoints
- A.
Graph
- B.
G
Correct Answer
A. Graph -
- 2.
Ordered pair of vertices
- A.
Endpoints
- B.
E
Correct Answer
A. Endpoints -
- 3.
Two distinct edges with the same set of end points
- A.
Parallel edges
- B.
P
Correct Answer
A. Parallel edges -
- 4.
Edge with one endpoint
- A.
Loop
- B.
ED
Correct Answer
A. Loop -
- 5.
Digraph consists of two finite sets: sets of vertices and directed edges
- A.
Directed graphs
- B.
DG
Correct Answer
A. Directed graphs -
- 6.
No parallel arcs/edges and no loops
- A.
Simple graph
- B.
SG
Correct Answer
A. Simple graph -
- 7.
Simple graph with n vertices v1, v2, ..., vn whose set of edges contains exactly one edge for each pair of distinct vertices
- A.
Complete graph
- B.
CG
Correct Answer
A. Complete graph -
- 8.
A simple graph whose vertex set can be partitioned into two mutally disgoint nonempty subsets v1 and v2 such that vertices in v1 may be connected to vertices in v2, but no vertices in v1 are connected to other vertices in v1 and no vertices in v2 are connected to other vertices in v2.
- A.
Bipartite graph
- B.
BIG
Correct Answer
A. Bipartite graph -
- 9.
Every vertex in H is also a vertex in G, every edge in H is also an edge in G, and every edge in H has the same endpoints as in G.
- A.
Subgraph
- B.
SUB
Correct Answer
A. Subgraph -
- 10.
The number of arc ends
- A.
Degree of node
- B.
DON
Correct Answer
A. Degree of node -
- 11.
The sum of the degrees of all vertices
- A.
Total degree of a graph
- B.
TDOG
Correct Answer
A. Total degree of a graph -
- 12.
Repeated edges and repeated vertex
- A.
Walk
- B.
W
Correct Answer
A. Walk -
- 13.
A walk without repeated edges
- A.
Path
- B.
P
Correct Answer
A. Path -
- 14.
A circuit that does not have any other repeated vertex except the first and last
- A.
Simple path
- B.
SP
Correct Answer
A. Simple path -
- 15.
A walk that starts and ends at the same vertex
- A.
Closed walk
- B.
CW
Correct Answer
A. Closed walk -
- 16.
A circuit does not have any other repeated vertex except first and last
- A.
Simple circuit
- B.
SCI
Correct Answer
A. Simple circuit -
- 17.
Free graph or no nontrivial circuits
- A.
Circuit free/acyclic
- B.
CF/A
Correct Answer
A. Circuit free/acyclic -
- 18.
"in one piece" or given two nodes we have a path joining them
- A.
Connected
- B.
CO
Correct Answer
A. Connected -
- 19.
A graph without cycles: connected and acyclic/cycle free
- A.
Tree
- B.
TR
Correct Answer
A. Tree -
- 20.
A graph that is circuit free
- A.
Forest
- B.
FOR
Correct Answer
A. Forest -
- 21.
Forest that is circuit free
- A.
Graph2
- B.
G2
Correct Answer
A. Graph2 -
- 22.
Has at least 3 vertices
- A.
Leaf
- B.
LE
Correct Answer
A. Leaf -
- 23.
A degree greater than 1
- A.
Internal vertex/node
- B.
IV/N
Correct Answer
A. Internal vertex/node -
- 24.
A tree and a node designated as root
- A.
Rooted tree
- B.
RT
Correct Answer
A. Rooted tree -
- 25.
Level zero, distinguised from the others
- A.
Root
- B.
R
Correct Answer
A. Root -
- 26.
The number of edges along the unique path between it and the root
- A.
Level
- B.
LE
Correct Answer
A. Level -
- 27.
Maximum level to any vertex of the tree
- A.
Height
- B.
HE
Correct Answer
A. Height -
- 28.
A vertex on which no edges are incident
- A.
Isolated
- B.
IS
Correct Answer
A. Isolated -
- 29.
Connected
- A.
Incident
- B.
CONN
Correct Answer
A. Incident -
- 30.
A binary tree in which each parent has exactly 2 children
- A.
Full binary tree
- B.
FBT
Correct Answer
A. Full binary tree -
- 31.
All the vertices that are adjacent to v and are one level farther away from the root
- A.
Children
- B.
CHI
Correct Answer
A. Children -
- 32.
If w is a child of v
- A.
Parent
- B.
PAR
Correct Answer
A. Parent -
- 33.
Two vertices that are both children of the same parent
- A.
Siblings
- B.
SIB
Correct Answer
A. Siblings -
- 34.
Given vertices v and w, v line on the unique path between w and the root
- A.
Ancestor
- B.
ANC
Correct Answer
A. Ancestor -
- 35.
Every parent has at most 2 children
- A.
Binary tree
- B.
BTR
Correct Answer
A. Binary tree -
- 36.
A listing of things
- A.
Sequence
- B.
SEQ
Correct Answer
A. Sequence -
- 37.
Values of ao, a1,a2, ..., ai-1, if i is a fixed figure
- A.
Initial condition
- B.
INCON
Correct Answer
A. Initial condition -
- 38.
Vertex or dot
- A.
Node
- B.
NO
Correct Answer
A. Node -
- 39.
Circuit that doesn't do anyhing or a walk consisting of a single vertex and no edge
- A.
Trivial circuit
- B.
TRCI
Correct Answer
A. Trivial circuit -
- 40.
A circuit with a least one edge
- A.
Nontrivial
- B.
NONTR
Correct Answer
A. Nontrivial -
- 41.
If T has at least 3 vertices, then a vertex of degree 1 in T
- A.
Leaf
- B.
LEA
Correct Answer
A. Leaf -
- 42.
A graph that consists of a single vertex
- A.
Trivial tree
- B.
TT
Correct Answer
A. Trivial tree -
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.
-
Current Version
-
Jul 30, 2011Quiz Edited by
ProProfs Editorial Team -
May 12, 2009Quiz Created by
Mccool
STEM Entrance Exam Quiz: Can you pass this Stem Exam?
STEM Entrance Exam Quiz: Can you pass this Stem Exam?
JoJo's Bizarre Adventure: Which Jojo Stand Do You Have
JoJo's Bizarre Adventure: Which Jojo Stand Do You Have
- Calculus Quizzes
- Data Handling Quizzes
- Decimal Quizzes
- Equation Quizzes
- Fraction Quizzes
- Function Quizzes
- Graph Quizzes
- Measurement Quizzes
- Multiplication Quizzes
- Number Quizzes
- Percentage Quizzes
- Place Value Quizzes
- Probability Quizzes
- Problem Solving Quizzes
- Ratio Quizzes
- Shape Quizzes
- Statistics Quizzes
- Trigonometry Quizzes
Back to top