Scribd
Upload
37 views

Multiple Choice A. Relation and Function 1. Which Relation Is Not A Function?

This document contains multiple choice questions about relations, functions, and graph theory. It tests understanding of concepts like domains, ranges, and whether relations are functions. It also contains graph theory questions about vertices, edges, degrees, and properties of graphs like being complete or bipartite.

Uploaded by

Alezandra Mae Jamilan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views

Multiple Choice A. Relation and Function 1. Which Relation Is Not A Function?

This document contains multiple choice questions about relations, functions, and graph theory. It tests understanding of concepts like domains, ranges, and whether relations are functions. It also contains graph theory questions about vertices, edges, degrees, and properties of graphs like being complete or bipartite.

Uploaded by

Alezandra Mae Jamilan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Multiple Choice

A. Relation and Function


1. Which relation is not a function?
a. {(1,-5), (3,1), (-5,4), (4,-2)}
c. {(1,-5), (-1,6), (1,5), (6,-3)}
b. {(2,7), (3,7), (4,7), (5,8)}
d. {(3,-2), (5,-6), (7,7), (8,8)}
2. All of the x values or inputs are called what?
a. Domain
c. Range
b. Relation
d. Function
3. All of the y values or output are called what?
a. Domain c. Range b. Relation d. Function
4. What is the range of the relation shown on the mapping
diagram?

a. R:{3,5,8}
c. R:{-7,11}
b. R:{3,5,8,12}
d. R:{all real numbers}
5. In the given relation, what domain value corresponds to the
value -2?
a. -2
c. 0
b. 2
d. 4
6. Which of the following is not a function?
a. {(0,1), (1,2), (2,3), (3,4)}
c. {(0,2), (1,3), (4,3), (1,2)}
b. {(1,3), (4,2), (2,0), (3,4)}
d. {(1,2), (2,2), (3,2), (4,2)}
7. Is the relation a function? Why?

a. Yes, because the x-value 11 has two y-values pair with it.
b. No, because the x-value 11 has two y-values pair with it.
c. Yes, because each x-value has only one y-value paired with it.
d. No, because each x-value has only one y- value paired with it.
Determine if the following relation describes a function

8. (1,-7), (1,-5), (2,-4), (3,-1), (4,1)


a. Function b. Not a Function
9. (-3,1), (0,-0), (3,1), (6,4), (9,9)
a. Function b. Not a Function

10.
a. Function b. Not a Function

11.
a. Function b. Not a Function

B. Graph
1. A typical graph notation is G = (V, E). The letter G means graph.
The letter V stands for the vertices of the graph. What is mean
by the letter E?
a. Edge c. Equation
b. Exponential d. Example
2. Which of the following graphs are allowed to have loops and
multiple edges in the drawings?
a. Simple Graphs c. Both of These
b. Multigraphs d. Neither of these
3. Graph theory is unique because that its study is derived from
other fields, yet at the same time, its formulas and theorems can
be used back and applied in those fields to solve the problems in
a simpler and more convenient way. Graph theory is used in
which of the following field(s)?
a. Computer Science c. Molecular Biology
b. Network Analysis d. All of these
4. In the given graph, which of the following statements is true?

a. A is adjacent to E b. C is adjacent to D
c. A is not adjacent to D d. C is not adjacent to E
5. A bipartite graph has two distinct groups where ...
a. All vertices in Group 1 are connected to all vertices of Group 2
b. Contains no isolated vertices c. No vertices in either group
connecting members of their own group d. Must have members
of Group 1 above the members of Group 2
6. Circuit start and stop at
a. Same Vertex b. Different vertices
7. What is a Vertex?
a. A line connecting two vertices b. An edge
c. A point d. An edge that starts and ends at the same vertex
8. What are adjacent vertices?
a. Are connected to every other vertex in the graph b. Are in a
loop together
c. Are connected by at least one edge d. Make a multigraph
9. A loop is when
a. There is a path going from a vertex back to itself b. If it were
removed, the graph would be disconnected
c. An edge that starts and ends at the same vertex d. Connects
two vertices to each other
10. A graph is complete if
a. Every vertex is adjacent to every other vertex b. It has an Euler
path
c. It contains at least one loop d. It has an Euler circuit
11. The degree of a vertex is
a. Also called the order or valence b. Is the number of edges that
connects to that vertex
c. The number of loops d. How many times can be part of a path
12. How many vertices are in this graph?
a. 2 b. 3 c. 4 d. 5 e. 6

13. How many vertices are in this graph?

a. 1 b. 2 c. 3 d. 4 e. 5

14. In the given identify the cut vertices.


a. B and E b. C and D c. A and E d. A and B
15. For the given graph(G), which of the following statement is
true?

a. G is complete graph b. G is not a connected graph c. The vertex


connectivity of the graph is 2 d. The edge connectivity of the
graph is 1

16. Which of the following properties does a simple graph not


hold?
a. Must be Connected b. Must be unweighted
c. Must have no loops or multiple edges
d. Must have no multiple edges
17. Which of the following is true?
a. A graph may contain no edges and vertices b. A graph may
contain many edges and no vertices
c. A graph may contain no edge and no vertices d. A graph may
contain no vertices and many edges
18. A graph with all vertices having degree is known as a
__________
a. Multi Graph b. Regular Graph
c. Simple Graph d. Complete Graph
19. When a vertex J is connected by an edge to a vertex A,
what is the term for the relationship between J and A.
a. J and A are “incident” b. J and A are “insecure”
c. J and A are “isolated” d. J and A are “adjacent”

20. In graph theory, a graph X is a “complement” of a graph F if


which of the following is true? (Make sure your answer is true in
All cases.)
a. If X has the same vertex set as F, and as its edges ONLY all
possible edges NOT contained in F, then X is a complement of
F.
b. b. If X is NOT equal to F, then X is a complement of F.
c. If X is equal to F, then X is a complement of F.
d. If X has half of the vertices of F (or if F has half of the vertices of
X) then X is a complement of F.

You might also like