QUESTION PAPERS:-
SYLLABUS:-
UNIT I
SETS:Sets, Subsets, Equal Sets Universal Sets, Finite and Infinite Sets, Operation on Sets, Union, Intersection and Complements of Sets, Cartesian Product, Cardinality of Set, Simple Applications. RELATIONS AND FUNCTIONS
roperties of Relations, Equivalence Relation, Partial Order Relation Function: Domain and Range, Onto, Into and One to One Functions, Composite and Inverse Functions, Hashing functions, Recursive function.
UNIT–II
PARTIAL ORDER RELATIONS AND LATTICES: Partial Order Sets, Representation of POSETS using Hasse diagram, Chains, Maximal and Minimal Point, Glb, lub, Lattices & Algebric Systems, Principle of Duality, Basic Properties, Sublattices, Distributed & Complemented Lattices.
UNIT-III
Graphs:types and operations(bipartite graph. Subgraph, distance of a graph, cut-edges & cut vertices, isomorphic and homomorphic graphs), degree of graphs, adjacent and incidence matrices, path circuit(Floyd’s and Warshall algorithms), hamiltonian graph, graph colouring.
UNIT–IV
Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Universal and existential quantifiers.
SYLLABUS:-
UNIT I
SETS:Sets, Subsets, Equal Sets Universal Sets, Finite and Infinite Sets, Operation on Sets, Union, Intersection and Complements of Sets, Cartesian Product, Cardinality of Set, Simple Applications. RELATIONS AND FUNCTIONS
roperties of Relations, Equivalence Relation, Partial Order Relation Function: Domain and Range, Onto, Into and One to One Functions, Composite and Inverse Functions, Hashing functions, Recursive function.UNIT–II
PARTIAL ORDER RELATIONS AND LATTICES: Partial Order Sets, Representation of POSETS using Hasse diagram, Chains, Maximal and Minimal Point, Glb, lub, Lattices & Algebric Systems, Principle of Duality, Basic Properties, Sublattices, Distributed & Complemented Lattices.
UNIT-III
Graphs:types and operations(bipartite graph. Subgraph, distance of a graph, cut-edges & cut vertices, isomorphic and homomorphic graphs), degree of graphs, adjacent and incidence matrices, path circuit(Floyd’s and Warshall algorithms), hamiltonian graph, graph colouring.
UNIT–IV
Propositional Logic: Proposition, First order logic, Basic logical operation, truth tables, tautologies, contradictions, Algebra of Proposition, logical implications, logical equivalence, predicates, Universal and existential quantifiers.
Part Time Work For Students
Win Free Netflix Account