Home / My courses / UGRD-CS6105-2313T / MIDTERM EXAMINATION / MIDTERM EXAMINATION

Started on Wednesday, 15 November 2023, 10:09 AM

State Finished
Completed on Wednesday, 15 November 2023, 11:06 AM
Time taken 56 mins 56 secs
Marks 47.00/50.00
Grade 94.00 out of 100.00

Question 1
Correct

Mark 1.00 out of 1.00

A simple graph contains 35 edges, four vertices of degree 5, five vertices of degree 4 and four vertices of degree 3. Find the
number of vertices with degree 2.

Answer: 9 

Question 2

Correct

Mark 1.00 out of 1.00

A contradiction is a statement that is always false regardless of the truth values of the individual logical variables.

a. FALSE

b. TRUE

Your answer is correct.

Question 3

Correct

Mark 1.00 out of 1.00

Is the statement p∧q≡¬(p→¬q) logically equivalent?

a. TRUE

b. FALSE

Your answer is correct.


Question 4

Correct

Mark 1.00 out of 1.00

A graph has 24 edges and degree of each vertex is k, then which of the following is possible number of vertices?

a. 10

b. 8

c. 15

d. 20

Your answer is correct.

Question 5
Incorrect

Mark 0.00 out of 1.00

How many vertices and edges must a graph have if its degree sequence is { 3, 3, 3, 2, 2, 1 }?

Answer: 5 

Question 6
Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described pVT ≡T

a. Domination Law

b. Identity Law

c. Idempotent Law

d. Commutative Law

Your answer is correct.


Question 7

Correct

Mark 1.00 out of 1.00

Is the statement p↔q≡(p∧q)∨(¬p∧¬q)logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

A graph contains 21 edges, 3 vertices of degree 4 and all other vertices of degree 2. Find total number of vertices.

Answer: 18 

Question 9
Incorrect

Mark 0.00 out of 1.00

How many vertices does P7 have?

Answer: 7 

Question 10
Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described pVq≡qVp

a. Identity Law

b. Associative Law

c. Commutative Law

d. Double Negation Law

Your answer is correct.


Question 11

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described ¬(¬p)≡p

a. Double Negation Law

b. Distributive Law

c. Domination Law

d. Identity Law

Your answer is correct.

Question 12
Correct

Mark 1.00 out of 1.00

It is the number of edges incident to the vertex and is denoted deg⁡(v).

Answer: degree 

Question 13
Correct

Mark 1.00 out of 1.00

How many edges does K7 have?

Answer: 21 

Question 14
Correct

Mark 1.00 out of 1.00

Tautology is a statement that is always true regardless of the truth values of the individual logical variables.

a. FALSE

b. TRUE

Your answer is correct.


Question 15

Correct

Mark 1.00 out of 1.00

Is the statement (p→q)∨(q→r) not a tautology?

a. TRUE

b. FALSE

Your answer is correct.

Question 16
Correct

Mark 1.00 out of 1.00

How many vertices does K3,5 have?

Answer: 8 

Question 17

Correct

Mark 1.00 out of 1.00

Two proposition forms are called logically equivalent if and only if they have identical truth values for each possible
substitution of propositions for their proposition variable.

a. FALSE

b. TRUE

Your answer is correct.

Question 18

Correct

Mark 1.00 out of 1.00

Is the statement (p→q)∧(p→r)≡p→(q∧r) logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.


Question 19

Correct

Mark 1.00 out of 1.00

Is the statement (p→r)∧(q→r)≡(p∨q)→r logically equivalent?

a. TRUE

b. FALSE

Your answer is correct.

Question 20
Correct

Mark 1.00 out of 1.00

Is the statement ¬(p↔q)≡p↔¬q logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.

Question 21
Correct

Mark 1.00 out of 1.00

If a graph has 5 vertices, can each vertex have degree 3?

a. YES

b. NO

Your answer is correct.


Question 22

Correct

Mark 1.00 out of 1.00

Is the statement p→q≡¬p→¬q logically equivalent?

a. TRUE

b. FALSE

Your answer is correct.

Question 23
Correct

Mark 1.00 out of 1.00

Logical equivalence is a compound propositions that have the same truth values in all possible cases.

a. FALSE

b. TRUE

Your answer is correct.

Question 24
Correct

Mark 1.00 out of 1.00

A graph with 21 edges has 7 vertices of degree 1, three of degree2, seven of degree 3, and the rest of degree 4. How many
vertices does it have?

Answer: 19 


Question 25

Correct

Mark 1.00 out of 1.00

Is the statement p↔q≡¬p↔¬qlogically equivalent?

a. TRUE

b. FALSE

Your answer is correct.

Question 26
Correct

Mark 1.00 out of 1.00

A statement (proposition) is any declarative sentence which is either true or false but not both.

a. FALSE

b. TRUE

Your answer is correct.

Question 27
Correct

Mark 1.00 out of 1.00

Is the statement ¬(¬p∧q)∧(p∨q)≡p logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.

Question 28
Correct

Mark 1.00 out of 1.00

How many edges are there in a graph with 10 vertices each of degree six?

Answer: 30 


Question 29

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described pVp≡p

a. Domination Law

b. Idempotent Law

c. Identity Law

d. Commutative Law

Your answer is correct.

Question 30
Correct

Mark 1.00 out of 1.00

Is the statement ¬(p→q)≡p∧¬q logically equivalent?

a. TRUE

b. FALSE

Your answer is correct.

Question 31
Correct

Mark 1.00 out of 1.00

How many edges are there in a graph with 10 vertices each of degree six?

Answer: 30 


Question 32

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described p V (p∧q) ≡p

a. Identity Law

b. Associative Law

c. Idempotent Law

d. Absorption Law

Your answer is correct.

Question 33
Correct

Mark 1.00 out of 1.00

How many edges does K7 have?

Answer: 21 

Question 34
Correct

Mark 1.00 out of 1.00

It is the number of edges incident to the vertex and is denoted deg⁡(v).

Answer: degree 


Question 35

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described (p V q) V r ≡p V (q V r)

a. Absorption Law

b. Associative Law

c. Commutative Law

d. Distributive Law

Your answer is correct.

Question 36
Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described pVT ≡p

a. Idempotent Law

b. Domination Law

c. Identity Law

d. Distributive Law

Your answer is correct.

Question 37

Correct

Mark 1.00 out of 1.00

How many edges does a graph have if its degree sequence is 5, 2, 2, 2, 2, 1?

Answer: 7 


Question 38

Correct

Mark 1.00 out of 1.00

A simple graph G has 24 edges and degree of each vertex is 4. Find the number of vertices.

Answer: 12 

Question 39
Correct

Mark 1.00 out of 1.00

How many edges does C6 have?

Answer: 6 

Question 40

Correct

Mark 1.00 out of 1.00

Is the statement p↔q≡(p→q)∧(q→p)logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.

Question 41
Correct

Mark 1.00 out of 1.00

Is the statement p∨q≡¬p→q logically equivalent?

a. TRUE

b. FALSE

Your answer is correct.


Question 42

Incorrect

Mark 0.00 out of 1.00

How many vertices does P7 have?

Answer: 7 

Question 43
Correct

Mark 1.00 out of 1.00

Is the statement (p→q)∨(p→r)≡p→(q∨r) logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.

Question 44

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described p∨(q∧r)≡(pVq)∧(pVr)

a. Absorption Law

b. Associative Law

c. Distributive Law

d. Commutative Law

Your answer is correct.

Question 45
Correct

Mark 1.00 out of 1.00

How many edges does C6 have?

Answer: 6 


Question 46

Correct

Mark 1.00 out of 1.00

Is the statement (p→q)∧(p→r)≡p→(q∧r) logically equivalent?

a. FALSE

b. TRUE

Your answer is correct.

Question 47
Correct

Mark 1.00 out of 1.00

How many edges does a graph have if its degree sequence is 5, 2, 2, 2, 2, 1?

Answer: 7 

Question 48

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described p∨¬p ≡T

a. Negation Law

b. Associative Law

c. Domination Law

d. De Morgan’s Law

Your answer is correct.

Question 49
Correct

Mark 1.00 out of 1.00

How many vertices does K3,5 have?

Answer: 8 


Question 50

Correct

Mark 1.00 out of 1.00

What particular Logical Equivalence Law is being described ¬(p ∧ q)≡¬p∨¬q

a. Distributive Law

b. Domination Law

c. De Morgan’s Law

d. Double Negation Law

Your answer is correct.

◄ PRELIM EXAMINATION

Jump to...