6/16/22, 6:08 PM Final Exam: Attempt review

Home / My courses /
UGRD-CS6100-2122S /
Week 14: Final Exam /
Final Exam

Started on Monday, 13 June 2022, 10:56 AM

State Finished
Completed on Monday, 13 June 2022, 11:04 AM
Time taken 7 mins 34 secs
Marks 50.00/50.00
Grade 100.00 out of 100.00

Question 1
Correct

Mark 1.00 out of 1.00

It is an edge with just one endpoint?

Select one:
a. Parallel

b. Loop 

c. Edge-Endpoint

d. None of the choices

Your answer is correct.

Question 2
Correct

Mark 1.00 out of 1.00

In a graph, let V = {v1, v2, v3, v4}, and E = {e1, e2, e3, e4}, assuming the endpoints of e1are v1 and v2, the endpoints of e2 are v1 and v3, the
endpoints of e3 are v2 and v3, theendpoint of e4 is v4. What is the loop in the graph?

Select one:
a. e2

b. e3

c. e4 

d. None of the choices

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 1/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 3

Correct

Mark 1.00 out of 1.00

The Gilas Pilipinas Basketball Team has 10 players. How many ways can the coach select 5 players to start the game?

Select one:
a. 210

b. 50

c. 252 

d. 30240

Your answer is correct.

Question 4
Correct

Mark 1.00 out of 1.00

How many bit strings of length 4 contain either 3 consecutive 0s or 3 consecutive 1s?

Select one:
a. 7

b. 4

c. 5

d. 6 

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 2/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 5

Correct

Mark 1.00 out of 1.00

It is a connected graph that contains no cycles?

Select one:
a. None of the choices

b. Subgraph

c. Complete Graph

d. Tree 

Your answer is correct.

Question 6
Correct

Mark 2.00 out of 2.00

It is the maximum level of any vertex of the tree?

Select one:
a. None of the choices

b. Height 

c. Level

d. Root

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 3/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 7

Correct

Mark 1.00 out of 1.00

It is defined to be the product of all the integers from 1 to n and is denoted n!?

Select one:
a. Permutation

b. Combination

c. Counting

d. Factorial 

Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

A standard deck of playing cards consist of 52 cards, 4 suits for each 13 cards. How many ways can you choose 2 kings from 4 available kings
suits?

Select one:
a. 6 

b. 8

c. 1

d. 13

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 4/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 9

Correct

Mark 1.00 out of 1.00

It is a complete Graph where each vertex in one of the subsets is connected by exactly one edge to each vertex in the other subset, but not to
any vertices in its own subset?

Select one:
a. Bipartite 

b. None of the choices

c. Subgraph

d. Indegree

Your answer is correct.

Question 10
Correct

Mark 1.00 out of 1.00

If there are 20 girls and 10 boys in the class and you want to speak to one student of theclass. How many choices do you have?

Select one:
a. 10

b. 30 

c. 20

d. 200

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 5/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 11

Correct

Mark 1.00 out of 1.00

A tree traversal where the left subtree is visited first, followed by the root, then the right subtree?

Select one:
a. Preorder

b. Inorder 

c. Postorder

d. None of the choices

Your answer is correct.

Question 12
Correct

Mark 1.00 out of 1.00

Refers to a graph that does not have any loops or parallel edges?

Select one:
a. Digraph

b. Graph

c. Simple graph 

d. None of the choices

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 6/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 13

Correct

Mark 1.00 out of 1.00

Refers to the sum of the indegree and outdegree of the graph?

Select one:
a. Indegree

b. Degree 

c. None of the choices

d. Outdegree

Your answer is correct.

Question 14
Correct

Mark 1.00 out of 1.00

How many edges can fully connect a graph with 4 vertices?

Select one:
a. 6 

b. None of the choices

c. 5

d. 4

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 7/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 15

Correct

Mark 1.00 out of 1.00

Refers to a vertex unconnected by an edge to any other vertex in the graph?

Select one:
a. Isolated 

b. Parallel

c. Loop

d. None of the choices

Your answer is correct.

Question 16
Correct

Mark 1.00 out of 1.00

A circuit can store a bit, a binary digit, 1 or 0. So, for 1 bit, there are 2 possible states.How many possible states if the binary has 4 bits?

Select one:
a. 32

b. 8

c. 16 

d. 2

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 8/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 17

Correct

Mark 2.00 out of 2.00

If 75 students are to be assigned in a room, filling all available rooms, how many rooms would require two students to share a room? 

Select one:
a. 39

b. 38

c. 37 

d. 36

Your answer is correct.

Question 18
Correct

Mark 1.00 out of 1.00

Given a graph with V = {a, b, c, d}, and E = {(a, b), (a, c), (b, c) (c, d), (b, d)}, how manyedges should be deleted to create a spanning tree?

Select one:
a. 1

b. 3

c. 2 

d. None of the choices

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 9/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 19

Correct

Mark 1.00 out of 1.00

In how many ways can 5 different books be arranged on a shelf?

Select one:
a. 120 

b. 100

c. 125

d. 25

Your answer is correct.

Question 20
Correct

Mark 1.00 out of 1.00

Refers to a vertex on which no edges are incident?

Select one:
a. Edge-Endpoint

b. Isolated 

c. Loop

d. None of the choices

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 10/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 21

Correct

Mark 2.00 out of 2.00

A local telephone number in an office is given by a sequence of three digits. How manydifferent telephone numbers are there if the first digit
cannot be 0?

Select one:
a. 27

b. 900 

c. 1000

d. 30

Your answer is correct.

Question 22
Correct

Mark 1.00 out of 1.00

In how many ways can you choose 5 out of 10 friends to invite to a dinner party?

Select one:
a. 120

b. 50

c. 252 

d. 500

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 11/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 23

Correct

Mark 2.00 out of 2.00

It is a vertex distinguishable from other vertex?

Select one:
a. Root 

b. None of the choices

c. Right Child

d. Left Child

Your answer is correct.

Question 24
Correct

Mark 2.00 out of 2.00

A computer password consists of a letter of the alphabet followed by three digits. Find the total number of passwords that can be created.

Select one:
a. 26000 

b. 36

c. 260

d. 2600

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 12/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 25

Correct

Mark 1.00 out of 1.00

If A=6!, then A is equal to?

Select one:
a. 36

b. 360

c. 720 

d. 30

Your answer is correct.

Question 26
Correct

Mark 2.00 out of 2.00

It is a tree in which there is one vertex that is distinguished from the others?

Select one:
a. Rooted Tree 

b. Binary Tree

c. Spanning Tree

d. None of the choices

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 13/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 27

Correct

Mark 1.00 out of 1.00

Vertices with the same parent are called?

Select one:
a. Descendants

b. Siblings 

c. None of the choices

d. Child

Your answer is correct.

Question 28
Correct

Mark 1.00 out of 1.00

A tree is not a tree if it has?

Select one:
a. |E| < |V|

b. |E| ≥ |V| 

c. None of the choices

d. |E|> |V|

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 14/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 29

Correct

Mark 2.00 out of 2.00

Two dice are thrown. How many possible outcomes are there?

Select one:
a. 24

b. 12

c. 6

d. 36 

Your answer is correct.

Question 30
Correct

Mark 2.00 out of 2.00

It is the number of edges along the unique path between it and the root?

Select one:
a. Height

b. Node

c. Level 

d. None of the choices

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 15/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 31

Correct

Mark 1.00 out of 1.00

It consists of two finite sets, a nonempty set V(G) of vertices and a set E(G) of edges?

Select one:
a. Tree

b. Loop

c. None of the choices

d. Graph 

Your answer is correct.

Question 32
Correct

Mark 1.00 out of 1.00

It refers to the number of ways in which a subset of objects can be selected from a given set of objects, where order is not important?

Select one:
a. Permutation

b. Counting

c. Combination 

d. Factorial

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 16/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 33

Correct

Mark 1.00 out of 1.00

In a graph, let V = {v1, v2, v3}, and E = {e1, e2, e3}, assuming the endpoints of e1 are v1and v2, the endpoints of e2 are v1 and v3, the
endpoints of e3 are v2 and v3. Then e1 and e2 are incident on what vertex in the graph?

Select one:
a. v2

b. v1 

c. v3

d. None of the choices

Your answer is correct.

Question 34
Correct

Mark 1.00 out of 1.00

There are 20 CS majors and 25 IT majors. How many ways are there to pick one CS major or one IT major?

Select one:
a. 100

b. 25

c. 20

d. 45 

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 17/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 35

Correct

Mark 2.00 out of 2.00

Given the set of four letters, {A, B, C, D}, how many possibilities are there for selecting any two letters where order is important?

Select one:
a. 24

b. 12 

c. 9

d. 8

Your answer is correct.

Question 36
Correct

Mark 1.00 out of 1.00

35 voters were surveyed about their opinions regarding two presidentiables. 16supported presidentiable 1 and 29 supported presidentiable
2. How many voters supported both, assuming that every voter supported either presidentiable 1 or presidentiable 2 or both?

Select one:
a. 45

b. 19

c. 6

d. 10 

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 18/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 37

Correct

Mark 1.00 out of 1.00

It refers to the number of ways in which a subset of objects can be selected from a given set of objects, where order is important?

Select one:
a. Counting

b. Factorial

c. Permutation 

d. Combination

Your answer is correct.

Question 38
Correct

Mark 1.00 out of 1.00

Among 366 people, at least how many people could have the same birthday?

Select one:
a. 1

b. 0

c. 2 

d. 3

Your answer is correct.

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 19/20
6/16/22, 6:08 PM Final Exam: Attempt review

Question 39

Correct

Mark 1.00 out of 1.00

In how many different ways can the letters of the word 'DISCRETE' be arranged in such away that the vowels always come together?

Select one:
a. 720

b. 2160 

c. 24

d. 120

Your answer is correct.

Question 40
Correct

Mark 2.00 out of 2.00

A graph having 6 vertices and 9 edges, if a tree is to make from a graph, how many edges should be deleted?

Select one:
a. 4 

b. None of the choices

c. 5

d. 6

Your answer is correct.

◄ Final Quiz 2

Jump to...

semestral.amaes.com/2122/mod/quiz/review.php?attempt=346329&cmid=46927 20/20