## Discrete Structures 1

### Question 1

#### Question text

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

### Question 2

#### Question text

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

### Question 3

#### Question text

Refers to a vertex on which no edges are incident?

### Question 4

#### Question text

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

### Question 5

#### 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?

### Question 6

#### 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?

### Question 7

#### Question text

A tree is not a tree if it has?

### Question 8

#### Question text

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

### Question 9

#### Question text

Vertices with the same parent are called?

### Question 10

#### Question text

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

### Question 11

#### Question text

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

### Question 12

#### 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?

### Question 13

#### 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.

### Question 14

#### Question text

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

### Question 15

#### Question text

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

### Question 16

#### 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?

### Question 17

#### Question text

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

### Question 18

#### 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?

### Question 19

#### 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?

### Question 20

#### Question text

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

### Question 21

#### Question text

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

### Question 22

#### Question text

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

### Question 23

#### Question text

It is an edge with just one endpoint?

### Question 24

#### 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?

### Question 25

#### Question text

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

### Question 26

#### 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?

### Question 27

#### Question text

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

### Question 28

#### 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?

### Question 29

#### 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?

### Question 30

#### 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?

### Question 31

#### Question text

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

### Question 32

#### 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?

### Question 33

#### Question text

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

### Question 34

#### 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?

### Question 35

#### Question text

It is a vertex distinguishable from other vertex?

### Question 36

#### Question text

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

### Question 37

#### Question text

It is a connected graph that contains no cycles?

### Question 38

#### 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?

### Question 39

#### 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?

### Question 40

#### 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?

### Question 1

#### Question text

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

### Question 2

#### Question text

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

### Question 3

#### Question text

### Question 4

#### Question text

### Question 5

#### Question text

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

### Question 6

#### Question text

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

### Question 7

#### Question text

### Question 8

#### Question text

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

### Question 9

#### Question text

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

### Question 10

#### Question text

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

### Question 1

#### 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?

### Question 2

#### Question text

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

### Question 3

#### Question text

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

### Question 4

#### Question text

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

### Question 5

#### Question text

It is a collection of objects called elements?

### Question 6

#### Question text

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

### Question 7

#### Question text

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

### Question 8

#### Question text

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

### Question 9

#### Question text

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

### Question 10

#### 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?

### Question 1

#### Question text

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

### Question 2

#### Question text

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

### Question 3

#### Question text

### Question 4

#### Question text

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

### Question 5

#### Question text

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

### Question 6

#### 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?

### Question 7

#### Question text

It is the negation of Tautology?

### Question 8

#### Question text

### Question 9

#### Question text

It refers to statement being supported in the argument?

### Question 10

#### Question text

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

### Question 11

#### Question text

### Question 12

#### Question text

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

### Question 13

#### Question text

It refers to statements that supports the arguments?

### Question 14

#### Question text

It specifies the meaning of mathematical statements?

### Question 15

#### Question text

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

### Question 16

#### Question text

### Question 17

#### Question text

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

### Question 18

#### Question text

### Question 19

#### Question text

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

### Question 20

#### Question text

Objects that can be counted are called?

### Question 1

#### 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?

### Question 2

#### Question text

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

### Question 3

#### Question text

It is the negation of Tautology?

### Question 4

#### Question text

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

### Question 5

#### Question text

### Question 6

#### Question text

### Question 7

#### Question text

### Question 8

#### Question text

### Question 9

#### Question text

### Question 10

#### Question text

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

### Question 1

#### Question text

It refers to statement being supported in the argument?

### Question 2

#### Question text

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

### Question 3

#### Question text

It specifies the meaning of mathematical statements?

### Question 4

#### Question text

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

### Question 5

#### Question text

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

### Question 6

#### Question text

It refers to statements that supports the arguments?

### Question 7

#### Question text

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

### Question 8

#### Question text

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

### Question 9

#### Question text

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

### Question 10

#### Question text

Objects that can be counted are called?