Scribd
Upload
3 views9 pages

DS - Sessional 3

The document contains a list of important multiple-choice questions related to discrete structures, including topics such as graphs, propositions, and lattices. It covers definitions, properties, and logical connectives, providing a comprehensive review for third sessional examinations. Each question is followed by multiple answer options, focusing on key concepts in discrete mathematics.

Uploaded by

arjunsharma92592
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views9 pages

DS - Sessional 3

The document contains a list of important multiple-choice questions related to discrete structures, including topics such as graphs, propositions, and lattices. It covers definitions, properties, and logical connectives, providing a comprehensive review for third sessional examinations. Each question is followed by multiple answer options, focusing on key concepts in discrete mathematics.

Uploaded by

arjunsharma92592
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Important questions for third Sessionals:-

Discrete Structure:-
MCQS:-

1.What is a graph in discrete mathematics?


A) A tree structure
B) A collection of nodes and edges
C) A stack
D) A queue

2. A graph with no loops and parallel edges is called:


A) Multigraph
B) Pseudograph
C) Simple graph
D) Directed graph

3. A graph with directed edges is known as:


A) Undirected graph
B) Tree
C) Directed graph (digraph)
D) Forest

4. Which of the following is not a type of graph?


A) Complete
B) Bipartite
C) Directed.
D) Partial

5. A path that visits every vertex exactly once is a:


A) Euler path
B) Hamiltonian path
C) Circuit
D) Spanning tree

6. A cycle that visits every edge exactly once is a:


A) Hamiltonian cycle
B) Eulerian cycle
C) Tree
D) Subgraph

7. The degree of a vertex in an undirected graph is:


A) The number of vertices
B) The number of loops
C) The number of edges incident to it
D) The number of paths

8. A graph is bipartite if:


A) It has cycles
B) Vertices can be divided into two sets with no edges within the same set
C) It is complete
D) All vertices have even degree

9. A graph is Eulerian if:


A) All vertices have even degree
B) All vertices have odd degree
C) The graph is connected
D) It is bipartite

10. The adjacency matrix of a graph is:


A) Always symmetric for undirected graphs
B) Always zero
C) Always skew-symmetric
D) Same as incidence matrix

11. A graph with edges but no vertices is:


A) Not possible
B) A null graph
C) A complete graph
D) A multigraph

12. Which one of the following graphs has the highest number of edges?
A) Null graph.
B) Regular graph.
C) Complete graph
D) Tree
13. An undirected graph has how many directions for each edge?
A) 1
B) 2
C) 0
D) Infinite

14. A simple cycle in a graph is a:


A) Closed path
B) Open path
C) Subtree
D) Edge

15. In a graph, an edge connects:


A) Two graphs
B) Two edges
C) Two vertices
D) A vertex and an edge

16. Which matrix is used to represent adjacency between vertices?


A) Adjacency matrix
B) Incidence matrix
C) Path matrix
D) Distance matrix

17. What is a proposition?


A) A question
B) A declarative statement that is either true or false

C) A command

D) An opinion Answer: b

18.Which of the following is a proposition?


A) What is your name?
B) 2 + 2 = 4

C) Please close the door.


D) Wow!
19. What is the negation of the proposition "It is raining"?

A) It is not raining
B) It is sunny

C) It might rain
D) It is cold

20. What is the logical connective for "AND"?

A) ∧

B) ∨

C) →

D) ¬

21. What is the logical connective for "OR"?

a. ∧

b. ∨
c. →
d. ¬ Answer:

22. What is the logical connective for "NOT"?

a. ∧

b. ∨
c. →

d. ¬

23. What is the logical connective for "IMPLIES"?

a. ∧

b. ∨
c. →
d.

24. What is the truth value of "True ∧ False"?

a. True

b. False
c. Undefined

d. Neither

25. What is the truth value of "True ∨ False"?

a. True

b. False

c. Undefined
d. Neither

26. What is the truth value of "¬True"?

a. True

b. False

c. Undefined

d. Neither

27. What is the truth value of "False → True"?

a. True
b. False

c. Undefined

d. Neither

28. What is the contrapositive of "If P, then Q"?

a. If ¬Q, then ¬P

b. If Q, then P

c. If ¬P, then ¬Q

d. IfP, then ¬Q

29. What is the inverse of "If P, then Q"?

a. If ¬Q, then ¬P

b. If Q, then P

c. If ¬P, then ¬Q

d. If P, then ¬Q

30. What is the converse of "If P, then Q"?


a. If ¬Q, then ¬P

b. If Q, then P
c. If ¬P, then ¬Q

d. IfP, then ¬Q

31. What is a tautology?

a. A proposition that is always false

b. A proposition that is always true

c. A proposition that is sometimes true

d. A proposition that is neither true nor false Answer: b

32. What is a contradiction?

A) A proposition that is always false


b) A proposition that is always true

c)A proposition that is sometimes true

d) A proposition that is neither true nor false.

Lattice

33. For the poset ({1,2,3,6},∣), what is the least upper bound (lub) of {2,3}?
i. 1
ii. 2
iii. 3
iv. 6
34. A lattice is a poset (L,⪯) in which every pair of elements {a,b}⊆L has:
i. Only a lub
ii. Only a glb
iii. Both a lub and a glb
iv. Neither a lub nor a glb
35. Consider the power set of {a,b}, denoted by P({a,b})={∅,{a},{b},{a,b}}, with
the subset relation ⊆. Is (P({a,b}),⊆) a lattice?
i. Yes
ii. No
iii. Cannot be determined
iv. Only if a=b
36. In a lattice (L,⪯), the join (supremum) of two elements a and b is denoted by:
i. a∧b
ii. a∨b
iii. a⋅b
iv. a+b

37. In a lattice (L,⪯), the meet (infimum) of two elements a and b is denoted by:
i. a∨b
ii. a∧b
iii. a/b
iv. a−b

38. In a lattice, which of the following is always true?


i. a∨a=a (Idempotent Law for join)
ii. a∧a=a (Idempotent Law for meet)
iii. a∨b=b∨a (Commutative Law for join)
iv. All of the above

39. In a lattice, which of the following is always true?


i. (a∨b)∨c=a∨(b∨c) (Associative Law for join)
ii. (a∧b)∧c=a∧(b∧c) (Associative Law for meet)
iii. a∨(a∧b)=a (Absorption Law)
iv. All of the above

40. In the poset ({2,3,4,6,12},∣), what is the greatest element, if it exists?


i. 2
ii. 3
iii. 12
iv. Does not exist

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy