 Define set?

 Define Venn diagram?

 Define cardinality of set?
 Define Venn diagram?
 Define Relation?
 Describe Cartesian Product?
 Define POSET?
 Describe LATTICE?
 Describe Function?
 Enlist types of Functions?
 Enlist types of SET?
 State Pigenhole principle?
 Define graph?
 Define Incident, Adjacent and Degree of vertices?
 Define Subset?
 Define Euler paths?
 Define Euler Circuits?
 Define Hamiltonian paths?
 Describe Hamiltonian Circuit?
 Describe Isomorphic graphs?
 Define Bipartite Graph?
 Describe Chain and Anti-chains?
 Define Transitive Closure?
 State principle of Inclusion and Exclusion for 2 sets?
 State principle of Inclusion and Exclusion for 3 sets?
 Define Tree?
 Define Root of the tree?
 Define Degree of node?
 Define Path of a tree?
 Define Parent node?
 Describe Child Node?

Page 1 of 11
 Describe Tree Traversals?
 Define a spanning tree?
 Define Algebraic System?
 Describe Semi group?
 Define Monoid?
 Describe Group?
 Define Abelian Group?
 Describe Siblings?
 Define Leaf node?
 Define Level of Tree?
 State commutative Property of Algebraic System
 State Associative Property of Algebraic System
 State Idempotent Property of Algebraic System
 State Identity element of Algebraic System
 Define Binary Search Tree?
 State Max flow min cut theorem

 Explain representation of sets?

 Explain set operations with proper example?
 Prove the following using Venn diagram?
A ∩ (B⊕C)= (A ∩ B) ⊕ (A ∩ C)
 Prove the following using Venn diagram?
A- (B - C)= (A-B) ∪ (A∩ B∩ C)
 Prove the following using Venn diagram?
A⊕ (B⊕C)= (A ⊕ B) ⊕ C
 Prove the following using Venn diagram?
(A∩ B∩ C) = A-[(A-B)U(A-C)]
 Explain types of sets with examples?
 Explain Principle of Inclusion and Exclusion with example?
 Prove by the mathematical induction S(n)= 1+3+6+…………..+ (n(n+1))/2 =
(n(n+1)(n+2))/6
 Prove by the mathematical induction S(n)= 1+2+3+…………..+ n= (n(n+1))/2

Page 2 of 11
 Prove by the mathematical induction S(n)= 1.2+2.3+…………..+ n(n+1)=
(n(n+1)(n+2))/3
 Out of the integers 1 to 1000 how many of them are not divisible by 3 nor by 5, nor
by 7?
 Explain Laws of set?
 Consider a set of integers 1 to 500 Find how many of these numbers are divisible by
3 or 5 or by 11
 Explain Contradiction with example?
 Explain Contingency with example?
 Show that 13 +23 + 33 + ….. +n3 = (n (n+1)/2)2 by using Mathematical Induction.
 Design and Discuss Venn diagram using Example.
 Consider a set of Integers from 1 to 250. find how many of these numbers are
divisible by 3, 5 and 7. Also indicate how many are divisible by 3, 5 but not by 7.
Among 100 students , 32 study Maths , 20 study physics , 45 study biology , 15 study
maths and biology ,7 study maths and physics, 10 study physics and biolohy , 30 do
not study any of the three subjects, Find the number of students studying all the three
subjects. Find the number of students studying exactly one of the three subjects.
 Explain Properties of Relations?
 Explain Representation of Relation?
 Let R be the relation on the set A={a,b,c,d,e,f} and
R={(a,c),(b,d),(c,a),(c,e),(d,b),(d,f),(e,c),(f,d)} find the transitive closure of R using
Warshall’s alogorithm?
 Find the transitive closure by using warshall’s algorithm A={1,2,3,4,5,6} and
R={(x,y)||x-y|=2}?
 Let R be the relation on the set A={1,2,3,4,5} and
R={(1,4),(2,1),(2,5),(2,4),(4,3),(5,3),(3,2)} find the transitive closure of R using
Warshall’s alogorithm?
 Let R be the relation on the set A={a,b,c,d} and R={(a,b),(b,a),(b,c),(c,d),(d,a)} find
the transitive closure of R using Warshall’s alogorithm?
 Explain Partitions with example?
 Explain steps of Warshall’s Alogorithm with suitable example
 Draw the Hasse diagram representing the positive divisors of 36
 Explain the Injective, Surjective and Bijective Function with suitable example
 Define term Lattice with the help of Example.
 Let R={(a,a),(a,b),(b,c),(c,c)} on A={a,b,c} Find: i) Reflexive Closure ii) Symmetric
Closure iii) Transitive Closure of R.

Page 3 of 11
 Explain chain and anti-chain with Example
 Explain Pigenhole Principle with example
 Let f(x) = x+2, g(x) =x-2, h(x) =3x find gof, fog, fof, hog, gog, foh, hof.
 Explain Inverse Function?
 Explain Image, Pre-image, Domain, co- domain and range of Function
 Let R be the relation on the set A={a,b,c,d} and R={(a,b),(b,a),(b,c),(c,d),(d,a)} find
the transitive closure of R using Warshall’s alogorithm?
 Let R be the relation on the set A={1,2,3,4} and
R={(1,2),(1,3),(1,4),(2,1),(2,3),(3,4),(3,2),(4,2),(4,3)} find the transitive closure of R
using Warshall’s alogorithm?
 Explain Partitions with example?
 Explain Euler path and circuits with example?
 Explain Basic concepts of Graph?
 Explain types of graph?
 Explain complement of a subgraph
 Describe weighted graph?
 Describe colored graph?
 Use Dijkstra algorithm to find shortest path between a and z?

 Use Dijkstra algorithm to find shortest path between a and z?

 Explain the differences between directed and undirected graphs with example?
 Explain the Breadth-First Search (BFS) algorithm?
 Explain the Depth-First Search (DFS) algorithm?
 Differentiate between an Eulerian path and a Hamiltonian path?
 Illustrate isomorphisms between two graphs? How can you check if two graphs are

Page 4 of 11
 isomorphic?
 Explain Dijkstra’s algorithm be used to find the shortest path in a graph?
 Describe a strongly connected component in a directed graph?
 Define following terms with example.
o Complete graph
o Regular graph
o Bipartite graph
o Complete bipartitie graph
v) Paths and circuits
 Construct the truth table for the following statements. : (i) ¬ p ∧ ¬q (ii) ¬( p ∧ ¬q)
(iii)
 ( p ∨ q ) ¬q (iv) (¬ p → r) ∧ ( p ↔ q)
 Explain a tree in graph theory?
 State properties of trees in graph theory.
 Explain a leaf node in a tree?
 Differentiate between a tree and a graph
 Explain binary search trees (BST)? Explain how insertion works in a BST.
 Describe the different types of tree traversal algorithms (preorder, inorder, postorder)
with an example.
 Explain how Huffman coding uses binary trees to compress data.
 Construct a binary search tree from the following sequence of values: 8, 3, 10, 1, 6,
14, 4, 7, 13.
 Given a binary tree, perform inorder, preorder, and postorder traversals.
 Compare and contrast Kruskal’s and Prim’s algorithms for finding the minimum
spanning tree. In what situations is one preferred over the other?
 Explain Prim’s algorithm for finding the minimum spanning tree of a graph. Illustrate
the algorithm with a suitable example.
 Describe Kruskal’s algorithm for finding the minimum spanning tree and discuss
how it differs from Prim’s algorithm.
 Explain the use of trees in hierarchical data structures
 How are spanning trees used in computer networks? Provide a real-world example
 How can Dijkstra's algorithm be applied to find the shortest path in a tree-like
structure
 Explain an algebraic system?
 Describe a group in algebraic systems?
 Describe a semi - group in algebraic systems?

Page 5 of 11
 Describe Monoid in algebraic systems?
 Describe Abelian Group in algebraic systems?
 Describe a sub group in algebraic systems?
 Explain Abelian group? Show that (Z6,+) is an Abelian Group
 Explain Isomorphism of groups
 Describe the four properties of a group: closure, associativity, identity element, and
inverse element.
 Describe the properties of a ring and how it differs from a group.
 Explain the concept of a ring with unity and give an example.
 Define isomorphism and give an example of two groups that are isomorphic.
 Explain the application of algebraic systems in designing finite automata and formal
languages.
 Show that (G, x7) is an abelian group
 Prove that G={0,1,2,3,4,5} = Z6 is an abelian group of order 6 with respect to
addition modulo 6
 Explain ring Homomorphism
 Describe a homomorphism between algebraic structures?
 Give an example of a non-Abelian group and explain why it is not commutative.
 Define a subgroup? Give an example and explain how it satisfies the properties of a
group.
 Define binary operations and provide examples like addition and multiplication.
 Explain the concept of an identity element in a group or monoid.
 Define an inverse element and illustrate with an example.
 Discuss the properties of closure, associativity, identity element, and inverse element.
 Define both ring and field, and explain how they differ with examples.
 Define a cyclic group and show an example with explanation.
 Define homomorphism and discuss how it preserves structure between two algebraic
systems.
 Define a ring with unity and explain its properties.
 Prove that the set of integers under addition is a group.
 Show that non-zero real numbers under multiplication satisfy group properties.
 Provide a proof showing that any group with two elements is commutative.
 Identify all subgroups of the cyclic group Z6 explain how they satisfy subgroup
properties.
 Discuss the use of fields and rings in designing error-detecting and error-correcting

Page 6 of 11
 codes.
 Explain network flow?
 Explain Max Flow Min cut?
 State application of Minimum Spanning Tree?
 State application of Graph?
 State application of algebraic system?
 State application of set theory?
 State application of Function?
 Explain application of algebraic system in cryptography

 Explain the concept of Set Theory with examples. Discuss its importance in
mathematics and provide definitions for the following terms:
 Union of sets
 Intersection of sets
 Difference of sets
 Complement of a set

 With the help of mathematical induction prove that 8n -3n is multiple of 5 for n>=1.
 Prove by Mathematical Induction that for 1.1!+2.2!+3.3!+………….+n.n!=(n+1)!-
1
 Prove that for any positive integer n the number n5-n is divisible by 5
 Explain Algebra of set operations
 It is known that the university 60% of the professor plays tennis, 50% of them plays
football. 70% cricket, 20% plays tennis and football, 30% plays tennis and cricket
and 40% plays football and cricket. If someone claimed that 20% of the professor
plays tennis, football and cricket would you believe that claim? Why?
 Explain mathematical induction in details?
 Explain Dijkstra algorithm to find shortest path with example
 Explain minimum spanning tree with suitable example
 Explain Fundamental circuit and cutsets with suitable example
 Find the maximum flow and minimum cut in the following transport network

Page 7 of 11
 Find the maximum flow and minimum cut in the following transport network

 Find the maximum flow and minimum cut in the following transport network

 Use Dijkstra algorithm to find shortest path between a and z?

 Use Dijkstra algorithm to find shortest path between a and z?

 Explain properties of Lattice with example?

 Prove that among 5000 peoples there are four who born at exactly the same minute.
 Find Minimum Spanning Tree for the graph given below using Prim’s ALORITHM

Page 8 of 11
 Find Minimum Spanning Tree for the graph given below using Prim’s ALORITHM

 Find Minimum Spanning Tree for the graph given below using Prim’s ALORITHM

 Find Minimum Spanning Tree for the graph given below using Kruskal’s
ALORITHM

 Find Minimum Spanning Tree for the graph given below using Kruskal’s
ALORITHM

Page 9 of 11
 Find Minimum Spanning Tree for the graph given below using Kruskal’s
ALORITHM

 Find Minimum Spanning Tree for the graph given below using Kruskal’s
ALORITHM

 Find Minimum Spanning Tree for the graph given below using Kruskal’s
ALORITHM

 Describe the difference between a tree and a binary tree?

 Describe complete binary tree?
 Explain the minimum number of edges in a tree with n vertices?
 Describe the preorder, inorder, and postorder traversal of a tree
Page 10 of 11
 Explain an AVL tree
 Describe relationship between trees and graph theory
 Explain a B-tree?
 Explain Integral Domain
 Explain Rings, Integral Domain and Fields
 Explain Hamming Distance
 Explain network flow with examples?
 Describe a group and its properties?
 Explain an automorphism?
 Differentiate between a group and an abelian group?

Page 11 of 11