Foundation of Computer Science Tuition For B.Tech In Delhi NCR
Foundation of Computer Science Tuition For B.Tech In Delhi NCR. The Objective is To give basic knowledge of combinatorial problems, algebraic structures and graph theory. Formal Logic: Preposition, Symbolic Representation and logical entailment theory of Inferences and tautologies, Predicates, Quantifiers, Theory of inferences for predicate calculus, resolution. Techniques for theorem proving: Direct Proof, Proof by Contraposition, proof by contradiction. Overview of Sets and set operations, permutation and combination, principle of inclusion, exclusion (with proof) and pigeonhole principle (with proof), Relation, operation and representation of a relation, equivalence relation, POSET, Hasse Diagrams, extremal Elements, Lattices, composition of function, inverse, binary and n-ary operations. Principle of mathematical induction, principle of complete induction, solution methods for linear and non-linear first-order recurrence relations with constant coefficients, Graph Theory: Terminology, isomorphic graphs, Euler‟s formula (proof) ,chromatic number of a graph, five color theorem(with proof), Euler &Hamiltonian paths. Groups, Symmetry, subgroups, normal subgroups, cyclic group, permutation group and cayles‟s theorem(without proof), cosets lagrange‟s theorem(with proof) homomorphism, isomorphism, automorphism, rings, Boolean function, Boolean expression, representation & minimization of Boolean function.
For More Information Call 9891500587
C-F-A Academy Of Career Development
(A Unit of Pushti Infotech Pvt. Ltd.)
C-28, Sec-52, NOIDA
Ph: 9891500587, 9650308924
Email: enquiry.cfa@gmail.com
Website: www.cfaacd.com
www.cfaacd.blogspot.com
Comments