2020-2021 StudyChaCha
 User Name Remember Me? Password

#1
January 4th, 2017, 10:49 AM
 Unregistered Guest
BCA in Kuvempu University

Can you provide me the syllabus of BCA (Bachelor of Computer Application) offered by Department of Computer Science of Kuvempu University?
 Other Discussions related to this topic Thread

#2
January 4th, 2017, 11:44 AM
 Super Moderator Join Date: May 2011
Re: BCA in Kuvempu University

The syllabus of BCA (Bachelor of Computer Application) offered by Department of Computer Science of Kuvempu University is as follows:

FIRST SEMESTER BCA

BCA-13 : MATHEMATICS –I FOR COMPUTER APPLICATIONS

Unit-1 SETS, RELATIONS AND FUNCTIONS 10hrs
Definition of a set, sub-set with examples, Venn diagrams, types of sets-equal sets, null set, disjoint sets, finite set, infinite set, power set, cardinality of set. Operations on sets-union and intersection of two sets, complement of a set, difference of two sets, symmetric difference of sets. Algebraic properties of set operations, addition principle for two finite sets and for three disjoint sets. Computer representation of sets and subsets, strings and regular expressions.
Definition of a relation with examples, types of relations empty, universal, trivial, equivalence, reflexive, symmetric, transitive relation(definition and examples only, no problems).Definition of a function with examples, types of function, one-to-one(injective),Binay operation commutative, associative, identity, invertible(definition and examples only, no problems).Functions for computer science-characterstic function, floor function, ceiling function.

Unit-2 LOGIC AND REASONING

Definition of proposition or statement, proposition variables, negation of statements, truth table, conjunction, disjunction, implications quantifiers- predicate, universal quantifier, universal quantification, existential quantification. Conditional statement/implication, contrapositive and converse, equivalence or biconditional, tautology, contradiction, logical equivalence, properties of proposition operation commutative, associative, distributive, idempotent
negation. Simple problems on tautology and equivalence. Rules for validting statements

Unit-3 MATHEMATICAL INDUCTION AND COUNTING
Principle of mathematical induction, simple problems on principle of mathematical
induction. Fundmental principle of counting(statement with examples only),permutations definition and simple problems. combinations- definition and simple problems. Pigen hole principle- statement and proof, extended pigen hole principle- statement and proof.
 BCA Syllabus in Kuvempu University.pdf (272.9 KB, 31 views)
__________________
Answered By StudyChaCha Member

Reply to this Question / Ask Another Question