Discrete Structures 1

Discrete Structures 1

Question 1

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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

Select one:


Question 2

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 3

Complete
Mark 1.00 out of 1.00
Flag question

Question text

Refers to a vertex on which no edges are incident?

Select one:

Question 4

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 5

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 6

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 7

Complete
Mark 0.00 out of 1.00
Flag question

Question text

A tree is not a tree if it has?

Select one:

Question 8

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 9

Complete
Mark 1.00 out of 1.00
Flag question

Question text

Vertices with the same parent are called?

Select one:

Question 10

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 11

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 12

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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:

Question 13

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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:

Question 14

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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

Select one:

Question 15

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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

Select one:

Question 16

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 17

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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

Select one:

Question 18

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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:

Question 19

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 20

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 21

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 22

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 23

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is an edge with just one endpoint?

Select one:

Question 24

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 25

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 26

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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:

Question 27

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 28

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 29

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 30

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 31

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 32

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 33

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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

Select one:

Question 34

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 35

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It is a vertex distinguishable from other vertex?

Select one:

Question 36

Complete
Mark 2.00 out of 2.00
Flag question

Question text

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

Select one:

Question 37

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is a connected graph that contains no cycles?

Select one:

Question 38

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 39

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 40

Complete
Mark 1.00 out of 1.00
Flag question

Question text

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:

Question 1

Complete
Mark 1 out of 1
Flag question

Question text

 If f : A —> B , then A is called?

Select one:

Question 2

Complete
Mark 1 out of 1
Flag question

Question text

A function f:A→B is a one-to-one correspondence, or a bijection

Select one:

Question 3

Complete
Mark 1 out of 1
Flag question

Question text

Functions are also used represent how long it takes a computer to solve problems of a given size.
Select one:

Question 4

Complete
Mark 1 out of 1
Flag question

Question text

In many instances, we assign to each element of a set a particular element of a second set.
Select one:

Question 5

Complete
Mark 1 out of 1
Flag question

Question text

It is a type of function where two distinct elements of A do not map to the same element of B?

Select one:

Question 6

Complete
Mark 1 out of 1
Flag question

Question text

A function f:A→B is called onto, or injunction

Select one:

Question 7

Complete
Mark 1 out of 1
Flag question

Question text

One-to-one is not a type of function
Select one:

Question 8

Complete
Mark 1 out of 1
Flag question

Question text

Let A = {1, 2, 3, 4} and B = {x, y, z}, if f:A—>B, then the domain of f is?

Select one:

Question 9

Complete
Mark 1 out of 1
Flag question

Question text

If f:A->A, and f(A)=3x, then f(4)?

Select one:

Question 10

Complete
Mark 1 out of 1
Flag question

Question text

It is a type of function that is both one-to-one and onto?

Select one:

Question 1

Complete
Mark 1 out of 1
Flag question

Question text

It is a set representation where all the elements in the set are all listed separated by commas and enclosed within braces or curly brackets?

Select one:

Question 2

Complete
Mark 1 out of 1
Flag question

Question text

The ordering of elements in a set is insignificant and may contain duplicates.

Select one:

Question 3

Complete
Mark 1 out of 1
Flag question

Question text

A = {a, e, i, o, u} is a set of?

Select one:

Question 4

Complete
Mark 1 out of 1
Flag question

Question text

It refers to an equation that is universally true for all elements in some set?

Select one:

Question 5

Complete
Mark 1 out of 1
Flag question

Question text

It is a collection of objects called elements?

Select one:

Question 6

Complete
Mark 1 out of 1
Flag question

Question text

The elements of a set must be distinct, ordered and well-defined?

Select one:

Question 7

Complete
Mark 1 out of 1
Flag question

Question text

Represent C={2, 4, 6, 8, 10, …, 100} using Set Builder Form.

Select one:

Question 8

Complete
Mark 1 out of 1
Flag question

Question text

The Set of Natural Numbers is represented using the boldface letter?

Select one:

Question 9

Complete
Mark 1 out of 1
Flag question

Question text

 If the elements of the set cannot be counted or enumerated, then the set is said to be?

Select one:

Question 10

Complete
Mark 1 out of 1
Flag question

Question text

 B = {b, c, d, f, g, h, j, k, l, m, n, p, q, r, s, t, v, w, x, y, z} is a set of?

Select one:

Question 1

Complete
Mark 2.00 out of 2.00
Flag question

Question text

Using Identity Law, the proposition p V False is equivalent to?

Select one:

Question 2

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is that part of logic which deals with statements that are either true or false but not both?

Select one:

Question 3

Complete
Mark 2.00 out of 2.00
Flag question

Question text

Contradiction is a statement that is always true
Select one:

Question 4

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is the study of the methods and principles used to distinguish good (correct) from bad(incorrect) reasoning?

Select one:

Question 5

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is the Law of Aristotelian Logic which states that “No Statement is both true and false”?

Select one:

Question 6

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It exists if and only if the two propositions have identical truth values for each possible substitution of propositions for their proposition variable?

Select one:

Question 7

Complete
Mark 1.00 out of 1.00
Flag question

Question text

 It is the negation of Tautology?

Select one:

Question 8

Complete
Mark 1.00 out of 1.00
Flag question

Question text

Tautology is a statement that is always false
Select one:

Question 9

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It refers to statement being supported in the argument?

Select one:

Question 10

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is the part of mathematics devoted to the study of discrete objects?

Select one:

Question 11

Complete
Mark 1.00 out of 1.00
Flag question

Question text

De Morgan's laws state that: The negation of a proposition is logically equivalent to the proposition in which each component is negated
Select one:

Question 12

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It refers to the ability to understand and create mathematical arguments?

Select one:

Question 13

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It refers to statements that supports the arguments?

Select one:

Question 14

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It specifies the meaning of mathematical statements?

Select one:

Question 15

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It is a group of propositions/statements which is divided into one or more premises and one and only one conclusion?

Select one:

Question 16

Complete
Mark 2.00 out of 2.00
Flag question

Question text

A proposition whose form is a tautology is called a tautological proposition
Select one:

Question 17

Complete
Mark 2.00 out of 2.00
Flag question

Question text

It is the Law of Logic which states that the proposition form p Λ True ≡ p?

Select one:

Question 18

Complete
Mark 2.00 out of 2.00
Flag question

Question text

A proposition whose form is a contradiction is called a tautological proposition
Select one:

Question 19

Complete
Mark 1.00 out of 1.00
Flag question

Question text

It is a statement that is always true regardless of the truth values of the individual logical variables?

Select one:

Question 20

Complete
Mark 1.00 out of 1.00
Flag question

Question text

Objects that can be counted are called?

Select one:

Question 1

Complete
Mark 1 out of 1
Flag question

Question text

It exists if and only if the two propositions have identical truth values for each possible substitution of propositions for their proposition variable?

Select one:

Question 2

Complete
Mark 1 out of 1
Flag question

Question text

It is a statement that is always true regardless of the truth values of the individual logical variables?

Select one:

Question 3

Complete
Mark 1 out of 1
Flag question

Question text

 It is the negation of Tautology?

Select one:

Question 4

Complete
Mark 1 out of 1
Flag question

Question text

It is the Law of Logic which states that the proposition form p Λ True ≡ p?

Select one:

Question 5

Complete
Mark 1 out of 1
Flag question

Question text

Tautology is a statement that is always false
Select one:

Question 6

Complete
Mark 1 out of 1
Flag question

Question text

Contradiction is a statement that is always true
Select one:

Question 7

Complete
Mark 1 out of 1
Flag question

Question text

De Morgan's laws state that: The negation of a proposition is logically equivalent to the proposition in which each component is negated
Select one:

Question 8

Complete
Mark 1 out of 1
Flag question

Question text

A proposition whose form is a contradiction is called a tautological proposition
Select one:

Question 9

Complete
Mark 1 out of 1
Flag question

Question text

A proposition whose form is a tautology is called a tautological proposition
Select one:

Question 10

Complete
Mark 1 out of 1
Flag question

Question text

Using Identity Law, the proposition p V False is equivalent to?

Select one:

Question 1

Complete
Mark 1 out of 1
Flag question

Question text

It refers to statement being supported in the argument?

Select one:

Question 2

Complete
Mark 1 out of 1
Flag question

Question text

It is the study of the methods and principles used to distinguish good (correct) from bad(incorrect) reasoning?

Select one:

Question 3

Complete
Mark 1 out of 1
Flag question

Question text

It specifies the meaning of mathematical statements?

Select one:

Question 4

Complete
Mark 1 out of 1
Flag question

Question text

It refers to the ability to understand and create mathematical arguments?

Select one:

Question 5

Complete
Mark 1 out of 1
Flag question

Question text

It is that part of logic which deals with statements that are either true or false but not both?

Select one:

Question 6

Complete
Mark 1 out of 1
Flag question

Question text

It refers to statements that supports the arguments?

Select one:

Question 7

Complete
Mark 1 out of 1
Flag question

Question text

It is the part of mathematics devoted to the study of discrete objects?

Select one:

Question 8

Complete
Mark 1 out of 1
Flag question

Question text

It is a group of propositions/statements which is divided into one or more premises and one and only one conclusion?

Select one:

Question 9

Complete
Mark 1 out of 1
Flag question

Question text

It is the Law of Aristotelian Logic which states that “No Statement is both true and false”?

Select one:

Question 10

Complete
Mark 1 out of 1
Flag question

Question text

Objects that can be counted are called?

Select one: