Syllabus BCA 21
Syllabus BCA 21
COMPUTER APPLICATION
PROGRAMME – Bachelor of Computer Application (BCA) (Hons.)(Semester
Mode)
COURSE STRUCTURE:
FIRST SEMESTER
(All courses are compulsory)
No. of
Counselling
Credit
Size of Sessions Study
Value
Course No. of Practical SLMs Theory input
Course Name of the
code Assignments Sessions Range (10% (in terms
course
of total of hours)
study
hours
Computer
BCA-101 2 --- 14 units 12 120 4
Fundamentals
BCA-102 Mathematics – I 2 --- 9 units 9 90 3
Business
BCA-103 Communication and 2 --- 14 units 12 120 4
Grooming
BCA-104 Programming in C 2 --- 14units 12 120 4
BCA-105 Digital Design 2 --- 14 units 12 120 4
BCA-106 Laboratory 2 9 -- 6 60 3
SECOND SEMESTER
(All courses are compulsory)
No. of
Counselling Credit
Sessions Study Val
Size of
Course No. of Practical Theory input ue
Course Name SLMs
code Assignments Sessions (10% (in terms of the
Range
of total of hours) course
study
hours
BCA-201 Mathematics – II 2 --- 6 units 6 60 2
BCA-202 Discrete Mathematics 2 --- 9 units 9 90 3
Data Structure Using
BCA-203 2 --- 14 units 12 120 4
C & C ++
Accounting &
BCA-204 Financial 2 --- 9 units 9 90 3
Management
Computer
BCA-205 Architecture & 2 --- 14 units 12 120 4
Organization
BCA-206 Laboratory 2 6 ---- 6 60 2
THIRD SEMESTER
(All courses are compulsory)
No. of
Counselling
Credit
Sessions Study
No. of Size of Value
Course Practical Theory input
Course Name Assignment SLMs of the
code Sessions (10% (in terms
s Range course
of total of hours)
study
hours
BCA-301 Mathematics - III 2 --- 9 units 9 90 3
BCA-302 Theory of Computing 2 --- 14 units 12 120 4
Internet and Web
BCA-303 Programming 2 --- 14 units 12 120 4
Technology
BCA-304 Computer Graphics 2 --- 14 units 12 120 4
Design and Analysis of
BCA-305 2 --- 14 units 12 120 4
Algorithms
Uses of Internet and its
BCA-306 2 6 --- --- 60 2
Application (Practical)
FOURTH SEMESTER
(All courses are compulsory)
No. of
Counselling
Credit
Sessions Study
No. of Size of Value
Course Practical Theory input
Course Name Assignment SLMs of the
code Sessions (10% (in terms
s Range course
of total of hours)
study
hours
Numerical Analysis &
BCA-401 2 --- 14 units 9 90 3
Scientific Computing
Database Management
BCA-402 2 --- 14 units 12 120 4
System
BCA-403 Operating System 2 --- 9 units 12 120 4
Object Oriented
BCA-404 Programming using 2 --- 9 units 9 90 3
JAVA
*BCA-405 Environmental Studies
RDBM Using Oracle
BCA-406 2 6 --- --- 60 3
(Practical)
*Compulsory paper in any degree course. Only Grade is given.
FIFTH SEMESTER
(All courses are compulsory)
No. of
Counselling
Credit
Sessions Study
No. of Size of Value
Course Practical Theory input
Course Name Assignment SLMs of the
code Sessions (10% (in terms
s Range course
of total of hours)
study
hours
Data Communication &
BCA-501 2 --- 14 units 12 120 4
Computer Network
BCA-502 Operation Research 2 --- 10 units 9 90 3
BCA-503 Software Engineering 2 --- 14 units 9 90 3
BCA-504 Project Work (Minor) --- -- 2
SIXTH SEMESTER
(All courses are compulsory)
No. of
Counselling
Credit
Sessions Study
No. of Size of Value
Course Practical Theory input
Course Name Assignment SLMs of the
code Sessions (10% (in terms
s Range course
of total of hours)
study
hours
Introduction to
BCA-601 2 --- 9 units 12 120 3
Artificial Intelligence
BCA-602 System Software 2 --- 9 units 12 120 3
BCA-603 Project Work (Major) --- --- 4
An Under-Graduate programme under Distance Education shall be conducted in six parts – (Semester I,
Semester II, Semester III, Semester IV, Semester V and Semester VI). The schedule for the Distance
Education System shall be as shown below:
The syllabus for each course (paper) shall be divided into blocks and units keeping in view the Credit
value of the course. The norms for delivery of courses through distance mode are as under:
Credit Study input Size of SLMs No. of Counselling Sessions Theory * Practical Session
Value of the (hours) (unit) (10% of total Study hours) (hours)
course
2 credits 60 6–8 6 60
3 credits 90 10-12 9 90
4 credits 120 14 – 16 12 120
6 credits 180 20 – 24 18 180
*Practicals are held at designated Institutions/ Study Centres for which schedule is provided by the Study Centre.
Attendance in practical is compulsory.
2.0 Assignment:
2.5Marks secured on the assignments by the candidates, who appeared in the examinations but
failed, shall be carried over to the next permissible chances.
2.6 Marks secured on the assignments by the candidates who filled in the examination forms but did
not appear in the examination, shall also be carried over the next permissible chances.
2.5 A candidate who fails to submit the assignments as per clauses shall be awarded zero in the
In-Semester Examination in the course where assignment(s) is (are) not submitted.
5 General:
For any matter not covered under these Regulations for the Directorate of Open and Distance
Learning, the existing Dibrugarh University Rules, Ordinances and the Dibrugarh University
Act, 1965 (as amended ), The Dibrugarh University Examination Ordinance, 1972 (as amended
up to date) and the Dibrugarh University Distance Education Ordinance, 2006 (amended up to
date) shall be applicable.
Detailed syllabus:
Block II Marks-40
Mathematical Statistics & Matrix Algebra
Collection of data, frequency distribution, measures of central tendency and dispersion, probability -
concepts, Bayes’ theorem, concepts on Discrete & continuous random variables & distributions -
binomial, Poisson and normal distributions.
Programming in C
Character set, Variables and Identifiers, Built-in Data Types, Variable Definition. Arithmetic
operators and Expressions, Constants and Literals , Simple assignment statement, Basic input/output
statement, Simple ‘C’ programs
Decision making within a program, conditions, Relational Operators, Logical Connectives ,if
statement, if-else statement ,Loops: while loop, do while, for loop, Nested loops, Infinite loops,
Switch statement, structures Programming.
One dimensional arrays: Array manipulation; Two dimensional arrays, Top-down approach of
problem solving, Modular programming and functions, Return Type, Function call, Block structure,
Passing arguments to a Function: call by reference; call by value, Recursive Functions, arrays as
function arguments.
Structures
Structure variables, initialization, structure assignment, nested structure, structures and functions,
structures and arrays: arrays of structures, structures containing arrays.
Address operators, pointer type declaration, pointer assignment, pointer initialization, pointer
arithmetic, functions and pointers, Arrays and Pointers, pointer arrays.Concept of Files, File opening
in various modes and closing of a file, Reading from a file, Writing onto a file
2. Ayres F. , Mendelson E. “Schaum's Outline of Calculus”, 6th Edition, McGraw Hill Education,2013.
Block IV: Marginal &Standard Costing and Introduction to Computerized Accounting System
Marks-20
Marginal Costing- Nature, Scope and importance, break-even analysis, its uses and limitation,
construction of breakeven chart, practical application of marginal costing; Standard Costing- Nature
and scope, computation and analysis of variances with reference to material cost, labour, labour cost
and overhead cost, interpretation of the variances; Introduction to computerized Accounting System-
Coding logic and codes required, master files, transaction files, introduction to document used for
data collection, processing of different files and outputs obtained.
1.B.B.Dam; R.A.Sarda; R.Barman; B.Kalita: “Theory and Practice of Accountancy (V-I)”, Capital Publishing
Company, Guwahati.
2. C.M.Juneja; R.C.Chowla; K.K.Saxena; “Book-Keeping and Accountancy (V-I)”, Kalyani Publishers,
Ludhiana..
3.M.Y. Khan; P.K.Jain: “Principles of Financial Management”. Tata McGraw Hills, New Delhi
Laboratory Marks-70
2. Introduction to the Design and Analysis of Algorithms by Anany Levitin , Pearson Education.
Practical Marks-70
1. Robin N, ”Learning PHP, MySQL & JavaScript with jQuery, CSS & HTML5”,O’Reilly,2014,4th
Edition.
2. Phillip H,”JSP 2.0: The Complete Reference”, Mcgraw Hill.2nd Edition,2003.
Database Design- Functional Dependencies and Normalization for Relational Database; Transaction
Processing Concept- Introduction, transaction and system concept, Properties, schedules and
recoverability, serial ability of schedules, concurrency Control, Error recovery and security.
1. Herbert, S,”The Complete Reference to Java”, 9th edition, Tata McGraw Hill, 2014
2. Malhotra, S. and Choudhary, S, ‘Programming in Java’, Second Edition, Oxford University Press,
2015.
Practical Marks-70
2. Silberschats, Korth and Sudershan, “Principles of Database Systems”, McGraw Hill Publication, 2011.
Course: BCA-501 (Fifth Semester)
Data Communication and Computer Networks
Credits: 4
Block I Marks-20
Model Formulation
Introduction, Structure and assumption of a Linear Programming Problem (LP), General
mathematical model of linear programming problem.
Graphical Solution Method
Introduction, Definitions, graphical solution method of an LP problem, multiple optimal solution,
unbounded solution, infeasible solution.
Block II Marks-25
Simplex Method
Introduction, standard from of LP problem, simplex algorithm (maximization case), Simple
Algorithm (Minimization case), multiple optimal solution, Unbounded Solution.
Duality
Introduction, Formulation of dual linear problem, standard results on duality, advantage of duality.
1. Sharma K. J., “Operation Research – Theory and Application”, 3rd Edition, MacMillan India
Ltd.2014.
2. Havinal V. “Introduction to Operations Research”, 1st Edition, New Age International
Publishers.2012
Students are encouraged to spend some time of the fifth semester working on a project preferably in a
software industry or any research organization. Topics selected should be not be much complex. The
courses studied by the students during the BCA Programme provide them the comprehensive
background knowledge on diverse subject areas in computer science such as computer programming,
data structure, DBMS, Computer Organization, SAD, Software Engineering, Computer Networks
etc., which will be helping students in doing project work.