I am interested in Computer line and decided to join Barkatullah University for doing MCA. Will you tell eligibility for doing MCA from Barkatullah University also tell about admission process?

Barkatullah University is a university in Bhopal, India. Originally known as the University of Bhopal and more informally as Bhopal University, it was renamed in 1988 after the great freedom fighter Prof. Barkatullah

About MCA:

MCA programme focuses on the areas of Development, Database Administration, Data Mining & Warehousing, Mobile Technologies, and Logics.

This is a three year course. The degree will be provided by Barkatullah University.

Admission Process

The admission will be done on the basis of qualifying exam.

The shortlisted candidates have to appear for counselling and get their documents verified by the authority.

Eligibility Criteria

The candidates who have passed BCA/ B.Sc./B.Com/ B.A. with Mathematics at 10+2 level or at the graduate level with a minimum of 55% marks for general and 45% marks for SC/ST/OBC category are eligible.

Please find the below attached file for the BU MCA 1st semester syllabus:
BU MCA 1st semester syllabus

DISCRETE MATHEMATICS – MCA-11

Theory - 100 Marks
Sessional - 50 Marks


Sets Theory, Functions & Relations: Basic properties & operations of Sets, Finite & infinite Sets Multi-Sets, Principles of mutual inductions and Mathematical induction, relations: Relations and relational Matrices, properties of relations, equivalence & partially ordered relation, chains & anti-chains & Lattices. Boolean Algebra. Job scheduling, Pigeon hole principle.

Propositional logic and prepositional functions, Truth-values and Truth Table, the algebra of prepositional functions - the algebra of truth values. Predicate Calculus.

Introduction of finite state machine as language recognizer. Equivalence of machines, Finite state language.

Trees & Graphs: Basic terminology of graphs, incidence and degree, planar graphs, multigraphs and weighted graphs, shortest path algorithms. Walks paths and circuits, Eulerian and Hamiltonian graphs.

Trees : Properties of trees, Minimum weight spanning trees and cut-trees, prefix codes.

Numeric Functions & Recurrence Relations:
Discrete Numeric Functions & generating functions and their manipulations.
Linear Recurrence Relation with constant coefficient, Homogeneous Solution, Particular & Total Solutions.

Groups: Group, subgroups, generator and evaluation of powers. Co-sets, isomorphism, homomorphism and automorphism Normal Subgroups.

Transmission errors, Single bit and multiple bit Error detection correction codes, Parity bit, VRC and CRC methods of error detection and correction.

References:
1. Discrete Mathematical Structures 5th ed by Kolman,
2. Discrete Mathematics by C.L. Liu
3. Discrete mathematics by Rosen. TMH
4. Discrete mathematics by G.P. Shrivastava and M. Kumar. Ravi Prasad



Contact:

Barkatullah Vishwavidyalaya, Bhopal
Hoshangabad Road, BHOPAL-462026,
Madhya Pradesh (INDIA)

Email: Registrar@bubhopal.nic.in

Attached Files

BU MCA 1st semester syllabus.doc (37.5 KB, 46 views)