Chapter wise Questions asked in 2016,17,18,19 in CCSU

Chapter 1 Mathematical Logic

Q.1 Define the Tautology with one example : [MAIN 2019]
Q.2 Show that {→, ~} is functionally complete. [MAIN 2016]
Q.3 Using truth table prove ~(𝑝 → 𝑞 ) = 𝑝⋀~𝑞 [MAIN 2018]
Q.4 Using truth table prove ~(𝑝 ↔ 𝑞 ) = 𝑝 ↔ ~𝑞 [MAIN 2019]
Q.5 Write contrapositive of 𝑝 → 𝑞 [MAIN 2017]
𝑝𝑝 →𝑞
Q.6 Prove that the argument : is valid by constructing truth
𝑞
table. [MAIN 2016]
𝑃
Q.7 Prove that the argument : 𝑝 → 𝑞 is valid by constructing truth
𝑞→𝑟
̅̅̅̅̅̅̅
𝑟
table. [MAIN 2017]
Q.8 Prove that : ~(𝑝 ⋀ 𝑞) ⟶ (~𝑝 ⋁ (~𝑝 ⋁ 𝑞)) = ~ 𝑝 ∨ 𝑞 without
using truth table. [MAIN 2019]
Chapter 2 Sets Relations and Functions
Q.1 Draw Hasse diagram of (𝑃(𝑋), ⊆), 𝑋 = (𝑎, 𝑏, 𝑐). [MAIN 2018]
Q.2 Draw Hasse diagram of (𝑃(𝑋), ≤) , 𝑋 = (1,2,3,4,6,12) and ≤ be
the relation divides i.e. 𝑥 ≤ 𝑦 ⟺ 𝑥 | 𝑦. [MAIN 2019]
Chapter 3 Lattices
Q.1 Define Lattice with an example [MAIN 2016]
Q.2 Define atom in a lattice. [MAIN 2017]
Q.3 Define Distributive Lattice [MAIN 2017]
Q.4 Prove that the dual of a complemented lattice is complemented.
[MAIN 2016]
Q.5 Consider the lattice 𝐿 in figure given below :

Write Join – irreducible elements, meet irreducible elements and

atoms form the figure just above. [MAIN 2016]
Q.6 Let (𝐿, ≤) be a lattice and 𝑎, 𝑏, 𝑐 ∈ 𝐿 then prove the following :
𝑎 ≤ 𝑏 and 𝑎 ≤ 𝑐 ⟹ 𝑎 ≤ 𝑏 𝑣 𝑐 [MAIN 2017]
Q.7 Let 𝐿 = {0,1} be a chain. Draw the diagram of the product lattice
𝐿2 . [MAIN 2017]
Q.8 Let (𝐿 ≤) be a lattice and 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝐿 then prove 𝑎 ≤ 𝑏 and 𝑐 ≤
𝑑 ⇒ 𝑎 ⋁ 𝑐 ≤ 𝑏 ⋁ 𝑑 . [MAIN 2018]
Q.9 Prove that the dual of a complemented lattice is complemented.
[MAIN 2019,18,17]
Q.10 Prove that a lattice 𝐿 is distributive iff
(𝑎 ⋁ 𝑏) ⋀ (𝑏 ⋁ 𝑐) ⋀ (𝑐 ⋁ 𝑎) = (𝑎 ∧ 𝑏) ∨ (𝑏 ∧ 𝑐 ) ∨ (𝑐 ∧ 𝑎),
∀ 𝑎, 𝑏, 𝑐 ∈ 𝐿 [MAIN 2019,18]
Q.11 Let (𝐿, ≤) be a lattice and 𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝐿, then prove 𝑎 ≤ 𝑏 and
𝑐 ≤ 𝑑 ⇒ 𝑎 ⋀ 𝑐 ≤ 𝑏 ∧ 𝑑 [MAIN 2019]
Chapter 5 Boolean Algebra
Q.1 Define sub-algebra of a Boolean algebra. Give an example.
[MAIN 2016]
Q.2 In a Boolean algebra, show that 𝑓 (𝛼, 𝛽) = 𝛼 𝑓(1, 𝛽) + 𝛼 ′ 𝑓(0,
𝛽) [MAIN 2017,16]
Q.3 Write the functions 𝑓 = (𝑎𝑏 ′ + 𝑎𝑏)′ + 𝑎′ in CN form. [MAIN
2017,16]
Q.4 Find a minimal form of the Boolean function (Using the Kamaugh
map method) 𝑓 (𝑥, 𝑦, 𝑧) = 𝑥𝑦𝑧 + 𝑥 ′ 𝑦 ′ 𝑧 + 𝑥𝑦𝑧 ′ + 𝑥 ′ 𝑦𝑧 ′ [MAIN
2016]
Q.5 Let {𝐵 = {1,2,5,7,10,14,35,70}, +, ∗, ′ } be a Boolean algebra
where 𝑎 + 𝑏 = 𝑙. 𝑐. 𝑚. (𝑎, 𝑏)
70
𝑎 ∗ 𝑏 = gcd(𝑎, 𝑏) and 𝑎′ = , ∀ 𝑎, 𝑏 ∈ 𝐵
𝑎

Calculate complement of each 𝑎 ∈ 𝐵, by constructing composition

table. [MAIN 2017]
Q.6 Find the complement of the following functions : 𝑓 = 𝑎′ 𝑏 + 𝑎𝑏′
[MAIN 2017]
Q.7 In a Boolean algebra 𝐵, prove (a) 𝑎 + 1 = 1 (b) 𝑎 ∗ 0 = 0,
∀ 𝑎 ∈ 𝐵 [MAIN 2018]
Q.8 Write the function (𝑥𝑦 ′ + 𝑥𝑧)′ + 𝑥′ in CN form. [MAIN 2019,18]
Q.9 Using Kamaugh map, find the minimal form of the following
Boolean function.
𝑓 (𝑥, 𝑦, 𝑧) = (𝑥𝑦𝑧 + 𝑥𝑦 ′ 𝑧 + 𝑥 ′ 𝑦 ′ 𝑧 + 𝑥 ′ 𝑦𝑧 + 𝑥𝑦𝑧′) [MAIN 2018]
Q.10 In a Boolean Algebra 𝐵, prove
(a) 𝑎 + (𝑎 ∗ 𝑏) = 𝑎, ∀ 𝑎, 𝑏 ∈ 𝐵 [MAIN 2019]
(b) 𝑎 ∗ (𝑎 + 𝑏) = 𝑎, ∀ 𝑎, 𝑏 ∈ 𝐵 [MAIN 2019]
Chapter 6 Switching Circuits and Logic Circuits
Q.1 Define OR gate and AND gate [MAIN 2017,16]
Chapter 7 Basic Concepts in Graph Theory
Q.1 Define the Pendant vertex of a graph [MAIN 2019,18,17,16]
Q.2 Define Platonic graph [MAIN 2016]
Q.3 Define the Complete graph with one example. [MAIN 2017]
Q.4 Define the Complete bipartite graph with one example.
[MAIN 2017]
Q.5 Define the Euler graph [MAIN 2019,18,17,16]
Q.6 Define Hamiltonian graph [MAIN 2017]
Q.7 Define Isolated vertex of a graph [MAIN 2017]
Q.8 Define and draw Petersen graph. [MAIN 2018]
Q.9 Write the total number of edges in a wheel 𝑊𝑛 [MAIN 2019]
Q.10 Draw tetrahedron graph and write its number of edges. [MAIN
2019]
Q.11 Prove that if 𝐺 is self complementary then 𝐺 has 4𝑘 or (4𝑘 + 1)
vertices, where 𝑘 is an integer, 𝐺 is any graph. [MAIN 2017]
Q.12 Prove that the number of odd vertices in a graph is always even.
[MAIN 2018]
Q.13 Show that the maximum number of edges in a complete
𝑛2
bipartite graph of a 𝑛 vertices is . [MAIN 2019]
4
Chapter 8 Trees and Cut-Sets
Q.1 Define the Binary tree with one example: [MAIN 2019,18]
Q.2 Define Tree with an example [MAIN 2016]
Q.3 Define Spanning tree [MAIN 2017,16]
Q.4 Define Rank and Nullity of a graph with one example [MAIN
2018,16]
Q.5 Define Radius and diameter of a graph with one example : [MAIN
2019]
Q.6 Evaluate the radius and diameter of the following graph :

[MAIN 2016]
Q.7 A graph 𝐺 is a tree if and only if there is unique path between any
two vertices of 𝐺. [MAIN 2019]
Q.8 Define the Eccentricity of a vertex in a graph [MAIN 2018,17]
Chapter 9 Planar Graphs and Colourings
Q.1 Define the Four color theorem [MAIN 2019,18,17,16]
Q.2 Define the Chromatic number of a graph [MAIN 2019,18,17,16]
Q.3 Write the thickness of a planer graph. [MAIN 2017]
Q.4 Write the crossing number of 𝐾3, 3. [MAIN 2017]
Q.5 Find the chromatic polynomial of the complete bipartite graph
𝐾2, 5 . [MAIN 2017]
Q.6 Find the chromatic polynomial of the complete bipartite graph
𝑘2,7 . [MAIN 2019]
Q.7 Find the chromatic polynomial of the complete bipartite graph
𝑘2,6 . [MAIN 2018]
Q.8 Write the number of vertices and number of edges of complete
bipartite graph 𝑘𝑚,𝑛 . [MAIN 2018]
Q.9 Prove that a connected planar graph with 𝑛 vertices and 𝑒 - edges
has (𝑒 − 𝑛 + 2) regions. [MAIN 2019]
Q.10 Prove that the chromatic polynomial of 𝑘2 , 𝑛 is : 𝑃𝑛 (𝜆) =
𝑘(𝑘 − 1)𝑛 + 𝑘(𝑘 − 1)(𝑘 − 2)𝑛 [MAIN 2016]
Chapter 10 Matrices Associated with Graphs
Q.1 Define the Adjacency matrix of a graph [MAIN 2017,16]
Q.2 Define :
(a) order of incidence matrix of a graph having 𝑛 vertices and 𝑒 edges.
[MAIN 2018]
(b) order of adjacency matrix of graph having 𝑛 vertices and 𝑒 edges.
[MAIN 2018]
Q.3 Define of the Order of circuit matrix of a graph having 𝑚- circuits
and 𝑒 - edges. [MAIN 2019]
Q.4 Write the incidence matrix of the graph : [MAIN 2016]

Q.5 Draw the graph of following incidence matrix.

𝑎 𝑏 𝑐 𝑑 𝑒 𝑓
𝑣1 1 0 0 0 0 0
𝑣2 1 1 1 0 0 0
𝑣3 0 1 0 1 1 1 [MAIN 2017]
𝑣4 0 0 0 0 1 1
𝑣5 [0 0 1 1 0 0]
Q.6 Write the incidence matrix of the following graph [MAIN 2018]
Q.7 Write the adjacency matrix of the following graph: [MAIN 2019]

Q.8 Define Order of path matrix of a graph having 𝑝 - paths and 𝑒 -

edges. [MAIN 2019]
Chapter 13 Formal Languages, Grammars and Finite State Machines
Q.1 Define the Finite state machine [MAIN 2016,17,18,19]