0% found this document useful (0 votes)
499 views32 pages

BCA Syllabus BRABU

The document outlines the syllabus for the Bachelor of Computer Applications (B.C.A.) program at B.R.A. Bihar University, Muzaffarpur, detailing the course structure across six semesters. Each semester includes various subjects with specified internal and external marks, covering topics from mathematical foundations to programming and database management. Additionally, it includes information on examination patterns, lab work, and recommended textbooks for each subject.

Uploaded by

rahulsinghrajput
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
499 views32 pages

BCA Syllabus BRABU

The document outlines the syllabus for the Bachelor of Computer Applications (B.C.A.) program at B.R.A. Bihar University, Muzaffarpur, detailing the course structure across six semesters. Each semester includes various subjects with specified internal and external marks, covering topics from mathematical foundations to programming and database management. Additionally, it includes information on examination patterns, lab work, and recommended textbooks for each subject.

Uploaded by

rahulsinghrajput
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 32

BIHA

J ARUNIVE
BIH TVERS
VERS
A.
BABASAHEB EHMRAO AKBEDKAR/

RSTS
*
AR
UNNE
MUZAFFARPR
SYLLABUS
OF
B.C.A.
(Bachelor of Computer Applications)
(Semester System)
D..A. BIhar Unlverslty, Muznffarpur

Course Structuro of B.C.A. (Bnchelor of Computer Applcatlons)-5emester System

SEMESTER

Paper Internal ExternalTotal


Paper Title
Code MarksMarks
BCA-101 Mathematiecal Foundatlon 20 80 100
BCA-102Computer Fundamentals 20 80 100
BCA-103 Dusiness Communicatlon & Informatlon System 20 80 100
BCA-104CPrOgrammlng 20 100
BCA-105 Lab on DOs & Windows 20 80 100
Lab on C
BCA-106 20 80 100
ITOTAL MARKS 120 480 600

2ND SEMESTER

Paper Internal External


Paper Titlec Total
Code Marks Marks
BCA-201 Olscrete Mathematics B0 100
| BCA-202 Computer Architecture B0 100

7 BCA-204
a Structure through C,
System Anatlysis and Deslen
20
20
80
30
100
i00
BCA-205 Lab on M5-Ofice 20 80 100

BCA-206Lab on Data Structure through C 20 80 100


TOTAL MARKS 120 480 600
3MD SEMESTER

Paper Internal ExternaTotal


Paper TItle Marks
Code Marks
BCA-301 Fundamentals of Management B Business Accounting 20 80 100

BCA-302 Dalabase Management System 20 30 100


DCA-303 Object Orlented Proyeamning uslng Ct+ 0 100
BCA-204 tlunerlcal Methodology 20 100
BCA-205 Lab on DEMS (SoL/MS-ACCESS) 20 30 100
BCA-306 Lab on C4 20 30 100
TOTAL MARKS 120 480 600
B.RA, Bihar Untverslty, Mutaffarpur

4TH SEMESTER

Paper
Paper Title
Internal Externalatal
Code Marks Marks
eCA-401 Java Programming 0 100
BCA402Computer Graphic, & tAultimedia 20 20 100
eCA402operan 20 0 100
Deiarioles
PCA-404Software Engineering Principles 20 20 100
BCh-40Sub on Jaa Prozramming 20 80 100
BCA 406 Lab on Cornputer Graphics 2 Linux 20 80 100
TOTAL AARYS 120 480 600

5TH SEMESTER

Paper Internal External


Paper Title Total
Code Marks Marks
BC-501 Relational Database t4anagement System
20 e0 100
2CA502 krtificial Inteligence through Python Programming 20 20 100

C-502 VWeb Techncloz/ (HTAL, Java Script, CSS)


20 20 100
BCA-504 Computer letwork, Security and Cyber Law 80
100
BCA-S05 Lab on Orade t 20.K20. 100

CA-505 Lab on Pahon Programming & vieb Technology 20 80 100


TOTAL MARYS
120 480 600

64SEIAESTER
BCL ED1-Prcject Pegort 100 marks

BCA 602 Seminar Presentation 50 marks

BCA 603 ra-Voce 50 marks

TOTAL MARYS = 2200

Pattern of Question Paper

There vAll be ten long answer type questions out of which students will have to answer
5 quections. Each question vil carry equal marks.

Duration of Exam: 2 Hours for each Theory and Practical Paper

Asuigk

Page-2
B.R.A. Blhar Unlverslty, Muzaffarpur

1st Semester

BCA-101: Mathematical Foundation

Total Lectures = 50

Unit-l: Dlfferential Calculus: Successive Differetiation, Leibnitz Theorem, Expansion of function


of one variable in Taylor's and Meclaurin's infinite series, Maxima and minima of functions of
one variable, Partial Derivatives, Euler's theorem, change of variables, Total differentiation,
Taylor's series in two variables, Maxima and Minima of two variables.

Unit I: Integral Calculus: Definite integral and its application for area, length and volume,
multiple integrals, change of order of integration

Unit-M: Differential Equatlon: First degree and first order diferential equation: Higher order
differential equation with constant coefficients, Linear partial differential equation of first order
P.D.E. of higher orders with constant coefficients.

Unit IV: Matrix Algebra: Elementary transformation, inverse of a matrix by row operation,
rank, solution of a system of linear simultaneous equation by matrik method, Eigen values and
Eigen Vectors, Cayley Hamilton theorem, Quadratic forms.

Note: Stress should be given on the development of ideas. Proofs of theorems and derivation of
are not required.
rmulae
Text Books
1. Engineering Mathermatics, Dr. B.S. Grewal
2. Matri by A.R. Vashishtha
3. Advanced Engg. Maths, by Chandrika Prasad
4. Elements of Modern Algebra, J.N.Sharma, Krishna Prakashan, Meerut
5. Topics in Algebra, 1.N.Herstein, Vikas Publications.

BCA-102: COMPUTER FUNDAMENTALS


Total Lectures = 50

Unit I: Introduction to Computers:


Brlef History of Development of Computers, Computer System Concepts &Characteristics,
Capabilities and Limitations of Computers; Type of Computers- Analog, Digital, Hybrid, General,
Special Purpose, Macro, Minl, Mainframe, Super; Generations of Computers, Type of PCs:
Desktop, Laptop, Notebook, Palmtop, Workstations etc and their characteristics
Unit-I1
Computer organizatlon and Working: Basic Components of a Computer System: CPU,
Memory-RAM, ROM, EPROM, PROM, and other types of Memory.

Page-3
B.R.A. Blhar Unlverslty, Muzaffarpur

Unlt-il
Input Devlces: Keyboard, Mouse etc.; Output Devices: Monitors: Characterlstlcs
and type of
monltors, Printers: Dalsy Wheel, Dot Matrix, Ink Jet, Laser, Lne Printer. Plotter, Sound Card
and
Speakers, Projectors
Storage Devices: Storage Fundamentals:- imary versus Secondary Data Storage and retrieval
method- Sequential, Direct, Index Sequentlal.
Varlous storage Device:- Magnetlc Tape, Magnetic Discs, Cartrldge Tape, Hard Disk Drives,
Optical Disks, CD, DVD, Zip Drive
Unit-IV
Computer Software: Need, Types of software: System Software and application Software
System Software: Operating System, Utility Program, Programming Languages, Assemblers,
Compilers and Interpreters
Operating System:- Functions type Batch, Single, Multiprogramming, Multiprocessing,
Programming Language: Machine Level, Assembly, High Level, 4GL, their merits and demerits,
Application Software: Word processing, Spreadsheet, Presentation Graphics, Database
Management Software, Characteristics, Usages and Examples and areas of Application of each
of them.
Unit-
Algorithms, Flowcharts: Symbols, Rules for maklng Flowcharts, types of flowcharts, advantages
and disadvantages; Pseudo Codes, Decision Tree, Decision Table, System Flowchart.
Unlt-v
Programming:Techniques:Top:Down,Bottom-Up
demerits, Comparative Study.
Modular StrueturedFeatures; Mërltstand
S 3

Programming Logic- SImple, Branching, Looping, Recurslon.


Introductory concepts of Computer Security and Virus
Text Books
1. V. Rajaraman, Fundamentals of Computers, PHI.
2. Introduction to Information Technology, ITL Education Solutions Ltd., Pearson
3. Fundamentals of Information Technology- P.K. Sinha
4. Computer Fundamentals- Reema Thareja, Oxford Press

BCA-103: BUsINESS COMMUNICATION & INFORMATION SYSTEM


Total Lectures = 50

Unit-l: Meaning and Process of Communication, Barrlers to communication, Verbal


Communication and non-verbal communication.
Business Communication and Its Importance in business organlsatlon. Listening. Reading,
Writing skills.
Unit I: Principles of Letter Writing, Business Letters: Quotatlons, Orders, Tenders, Sales
Letters, Complaints, Claim and Adjustment Letters, and Col Lect.lon Letters, Social
Correspondence: Letters of congratulation, Invitatlons, Introductlan, Recommendation
Condolence, Conveying Acceptance and regrets, etc., Summarisatlon, Punctuation.
Meeting, Interview and Group Communication, Drafting of Notlce, Agenda, and minutes of
company meeting, Report wrlting and Proposal
Page

9
B.R.A. Blhar University, Muzaffarpur
(22
Unit :office procedure: Receipt and Dispatch of mail, Filing and Indexing Systems,
Classification of mail. E-mail, On-line meeting, On-line interviews.
Forms of Oral Communication Group Discussion, Debate, Extempore, Presentation, Seminar
and Conference
Unlt-V: Data and information, Characteristics, sources and types of information. Importance of
information for Managers,Value of Informatio, Information economies, Role of Computers.
Unit-V: Concept, role and impartance of Management Information System (MIS), Concept of
system, characteristics and types of system, Information needs and management levels
OAS,TPS, MIS,DSs. Role of OAS in organisations.
Unit Vi: MIS and Decision making concepts, Herbert-Simon model of Decislon Making
Concept and philosophy of DSS, MIS Project Planning

Text Books: 1. Essentials of Business Communication -Reddy, Apparnaiah, Rao


2. Essentials of Business Communication-R. Pal and I.5. Korlahalli
3. Business Communication U.S.Rai and S.M.Rai
4. Management Information & Control System, Dr. Sushila Madan, Taxmann Publ.
5. Management Information System-Text and Cases, W.SJawadekar, McGraw Hill Publ.
6. Management Information System, Dr Nirmalya Bagchi, Vikas Publ. 2010.
7. Information System for Modern Management, R.G.Murdick, Joel E. Ross, & J.R.Clagget, PHI

BCA-104:C-Programming
ES Total le ctures = 50 ENREDS nE
Unit-
1.1 Structures of 'C Programming Language,
1.2 Elements of C Programming
1.3 Algorithms and flowcharts (Real Life Examples), Exercises
2.1 C Tokens, Keywords, Identifiers, Variables, Constant
2.2 Data Types
2.3 Operators
2.4 Types of operators
Unit-lE
3.1 Decision Making: it, if-else, GOTO, Nesting, Switch Statements.
3.2 Looping: for, Nesting of for-loop, While loop, do-while loop
4.1 Array: One Dimensional
4.2 Two Dimensional
5.1 Concept of header files: Pre-processor directives: Hinclude, #define
Unit-Ill
6.1 Functions: User Defined Functions
6.2 Nesting, Recursion
6.3 Function with Array
6.4 Parameter Passing
6.5 Call by value
Asuig
6.6 Call by reference
AR Page-5

S
B.R.A. Blhar Unlverslty, Muzaffarpur

Unit-V;
7.1 String Handling: Strlng Manipulatlon
7.2 String Handling Functions.

Unit-V
8.1 Structure
8.2 Structure Array
9 Pointers: Pointer of Array, Structure Pointer
Unit-Vl
10.1 File Handling
10.2 Reading and Writinga File

Text Books:
1. Let us C-Yashwant Kanetkar.
2. Programming In C- E. Balaguruswamy

3.
The Cprogramming Language Dennis Ritchie, Pearson
4. Structured Programming approach using C- Furouzan &Ceilberg Thomson Learning publ.
5. Pointers in C-Yashwant Kanetkar
6. How to solve it by Computer-R. G. Dromy
7. Introduction to algorithms Cormen, Leiserson, Rivest, Stein
8. Programming in C-R. Subburaj, Vikas Publishing House
UT9:Computer Programming in CV Rajaraman; PHI:ENEATIEte1ATET.TED NETTET E1
10. Programming in Cusing ANSI C-Ashok N. Kamthane, Pearson Education

BCA- 105 ab on MS- Windows and DOS

Total Lab Classes 60

Features of MS Windows, Desktop, creation of folders and shortcuts, icons, features of Windows
explorer, Internet Explorer, Windows Accessories{Paint, Notepad etc., Windows Media Player,
Internet Browsers), control Panel, Taskbar.
Familiarisation with MS packages-Word, Excel, PowerPoint
Disk Operating System (Dos)

DOS commands
Internal: DIR, MD, CD, RD, COPY, DEL, VOL, DATE, TIME, CLS, PATH, TYPE, PROMPT etc.
External: CHKDSK, XCOPY, PRINT, DISKCOPY, DISKcCOMP, DOSKEY, TREE, MOVE, LABEL, APPEND,
FORMAT, SORT, FDISK, BACKUP, RESTORE, EDIT, MODE, ATTRIB, HELP, SYS etc.
Executable vs. non-executable files in DOS.

Page-6
B.R.A, Bihar Universlty, Muzaffarpur

BCA-106: Lab on C

Total Lab Classes 60

Sample Exerclse1: Basles


Write programs to: print sample strings like "hello world", "Welcome to C Programming" with
different formats using escape sequences, print different data types in C and their ranges,
Initialize, assignment & printing variables of different data types.

Exercise2: Operators
i) Write a Program to demonstrate arithmetic operators. (+,, 1, 6)
i) Demonstrate logical operators.(logical AND, logical OR)ii) read radius value from the
keyboard and calculate the area of circle and print the result in both floating and exponential
notatlon.
lii)Calculate simple interest. iv) Convert temperature (Fahrenheit-Centigrade and vice-versa
Exercise3: Operators
) Write a Program to demonstrate relational operators.(=>===,=) i) Check equivalence of *
two numbers using conditional operator. li) Demonstrate pre increment and post
increment.(+*a, a** where a is a value to be initialized) iv) Demonstrate pre decrement and
post decrement.(-3, a- where a is a value to be initialized)
v) Comiput the volume of sphere, cone and cylinder assume that dimensions are integer's
use type casting where ever necessary
Exercise4: Decision Statements
i) Write a Program to read marks of a student in six subjects and print whether pass or fall
S (using if-else).
i) Calculate roots of quadratic equation (using if-elsel. ii) Calculate electricity bil. Read starting
and ending meter reading. The charges are as follows. No. of Units Consumed Rate in[Rs)1-100
1.50 per unit 101-300 2.00 per unit for excess of 100 units 301-500 2.50 per unit for excess of
300 units 501-above 3.25 per unit for excess of S00 units
Exercise S: Switch operations
i) Write a Program to perform arithmetic operations using switch case. i) Display colors using
switch case (VIBGYOR). ii) Display vowels and consonants using switch case.
iv) Display names of days in a Week using switch case.
Exercise 6: Basic Loop operations
Do the Following Programs Using for, while, do-while loops.
Write a program to calculate sum of individual digits of a given number. i) Check whether
given number is palindrome or not. li) Print prime numbers in the given range. iv) Display
multiplication tables fram 1 to 10 except 3 and 5.
Exercise 7: Advanced loops
i) Write a program to print the Fibonacci series for given 'N' value.
i) Check whether a given number is a Fibonacci number or not. i) Read 2 numbers x and n
then compute the surm of the Geometric Progression. 1+xt x2 +x3+.. +xn iv) Print the
following formats. 1 12**123**1234***
Exerclse 8: 1-D arrays
) Write a program to store 10 elements in the 1-D array and print sum of the array. i) Print
minimum and maximum elements in the 1-D array. ii) Count no. of positive numbers, negative
numbers and zeros in the array. iv) Search the given element by using linear search. v) Sort the
given elements using bubble sort technigu

STI Page-7
ensuig
I.RA, lhnr Unlvarslty, Muznffnrpur

Cxerclsn 9: 2-D nrrays


Perlorin inalrik additlon annd matrik subtrnctlon. I) Perlorm matrik multlplicatlon by checking
the cormpatilbllty. i) Print the transpose of a malrlx.
Exrclso 10: 5trings
Write a progr am to perlorm varlous strng manlpulatlons using bult-n lunctlons. ) Print the
Rlven strlnH: Im ascendling order. Hl) Verily the glven slrlng Is pallndrome or not (wlthout built
In fuctlons, wlh using bulh-In lunctlons) v} Concatenate two strings using arrays
Exorcisa 11: Math Functlons and 1/0 Fucntlons
) Wrlle a prograrn to read values from keyboard and find the values using abs(), sqrt(),floor{
Collt) and pow{).
) read and display a value uslng getch() and putch(). I) Read and display a value using
gelchar(), putchart).gets() and puts().
Exerclse 12: Functlonss
1)
Wrlte a proprarn to lInd sun of two numbers using functlons. ) Find product of two numbers
uslng funttions wlthout arguments, without return type. Ili) Find difference of two numbers
uslng funtllons witlhout argunents, wlth relurn type, iv) Flnd sum of lwo numbers using
function vwlth argunents Bwithout relurn lype. v) Find product..of two numbers using
functions vwith argurnents, with return lype.
Exerclso 13: Functlons and Recursion
I)Writr a spropram to swap 1wo numbers uslng a) Call By Value B) Call By Reference.
) Calcaulate lactorlal, gcd using recurslon and non-recursion functions. Il) Perform arithmetic
operatlons usinp peolnter. iv) Matrix idltlon using polnters.
Exerclse 14: Structures
1)
Write a prograrn to create structure for an nccount holder in a bank with following Fields;
ReSTEaname, account nunber, addres, balance and disphay the details of five acount halders.
) Find tolal narks of Indlvidual student and average marks for 10 students uslng structures.
Ep
Ii) Create structure called traveler and members of structure are train no, coach no, seat no,
sourte, destinatlon, gender, age, name and departure datc. i) llustrate passing an entire
structure to a functlon.
Exercise 15: Fle operatlons using command line arguments
1)
Write a prograrn vwhich copies the contents of one file to another (le using command line
atgurnent.
) teverser the first n churacters In a fle usc command line arguments.
A Minl Project

Puge-
(221)
D.R.A. Dlhar Unlverslty, Muzaffarpur

2nd Semester:
BCA-201: Discrete Mathematics
Total Lectures = 50

Unit-1: Set, Relation and Functlon: Notatlon, Incluston and Equalty of Sets, Power Set,
Operations on set, Venn Diagram, Relatlon, Domaln and range, Properties of binary relatlon In a
set, relation matrix, digraph, Equivalence Relatlon, Partitlon and covering of a set. Definltlon
and types of Functions, Compositlon of functlon, Inverse functlon, 122 Lect.

Unit-11: Algebraic Structures: Definitlons and llustrative examples of seml-groups, monolds,


Groups, Subgroups, Rin8.

Unit-11: POSET and Lattice- Partial Ordering, partlally ordered set, chaln, Maximal, Minimal,
Lub and Gb, Hasse Diagram
Unit IV: Lattice: Definition of lattlce and Its properties, Sublattice, distributlve and

complemented lattice (14 Lect.]


Unit-V: Graph Theory Definition of graph and types, Directed and undirected graph, path,
walk and circuit, Regular graph, Tree.

Text Books:

da Discrete Mathematies, S.K.Sarkar, S. Chand & Co.


E -Elements of Combinatorial Math-CLLi
3. Discrete Mathematics, J.K.Sharma, Trinity Publ.
4. Discrete Mathematics-Tremble

BCA-202: Computer Architecture

Total Lectures = 50

Unit-
Data representation, Data Types and Number Systems, Dinary Number System, Octal &
Hexa-Decimal Number System, Fixed Point Representatlon, 1's & 2's Complement,
Binary Fixed- Point Representatlon, Arithmetle Operatlon on Dlnary Numbers, Overflow
&Underflow
Unit-il
Boolean algebra and digltal logle clrçults Loglc Gales, AND, OR, NOT Gates and thelr
Truth Tables, NOR, NAND & XOR Gales, Doolean Algebra, Dasic Definion and
Properties, Basic Boolean Law's, Demorgan's Theorem
Unlt-l1
Sequential loglc- Fllp-Flops RS, D, JK &T Fllp-Flop, Reglsters, Counters and the memory
unit, Shift reglsters, Nipple counters and Synclronous counters, Timngs sequence dlgital
loglc familles

Page-9

.519
Y
B.R.A. Blhar Unlverslty, Muzaffarpur

Unlt-lV
Input-output organlzatlons- /o Interface, Properties of simple /0 Devices and thelr
controller, Isolated Vs Memory-mapped /0, Modes of data transfer, Synchronous&
Asynchronous data transfer
Unit-V
Memory organlzatlon- Auxllary Memory, Magnetic Drum, Disk & Tape, Semi-conductor
memorles, memory, Hierarchy, Assoclatlve memory, VIrtual memory, Address space &
memory space, Cache memory, Hit ratio, Writing Into cache.

Text Books:

1. Computer System Architecture - Morris Mano, PHI Publications.


2. Modern Digital Electronics - R. P. Jain, TMH.
3. Computer Fundamentals V. Rajaraman, PHI.
4. Digital Loglc and Computer Design - Morris Mano, PHI Publications
S. Computer Architecture and Organisation, John P. Hayes, McGraw Hill Publ.

BCA-203: Data Structure through C

Total Lectures = 50

Unit- Introduction:
I:
Array, Function, Pointer and Structure.
Unit I: Recursion:
FFCHER
vs
ARecursion Looplng. Recursive FunctlonsINNUNCAsipI NSt2092NEU IONETT
Unlt- Il: Sorting & Searching:
Sorting:Selection, Bubble, Insertion, Heap and Qulck sorting.
Searching: Linear and Binary searching.
Unit-IV: Linked List:
Self referential structure, Dynamic memory allocation.
Single Linked List:
Addition, Deletion, Insertion, Searching of nodes.
Double Linked List:
Addition, Deletion, Insertion, Searching of nodes.
Circular Linked List:
Addition, Delet Insertion, Searching of nodes.
Unit- V: Stack & Queue:
Stack: Implementation using array and linked list. Push and Pop operations.
Queue: Implementotion using array and linked list. Add and Delete operations.
Unit-Vi: Trees & Graph:
Trees: Binary Trees, Dinary Tree Representations, Binary Search Tree
Prelix, Infix and Postlix traversal of tree.
Graph: Concept and representatlon using matrlx.

Text Books
1. R.S.Salara, Data Structures & Algorlthms using C, Khanna Publishing
2.5.K. Srivastava, Depth in Data Structure through C- BPB Publication
3. Seymour Lipschultz, "Data Structures with C", Schaum's outlines, Tata McGraw-Hill.
4, Matk Allen Welss, "Data Structurng apd Algorithm Analysls In C", Pearson Education.

AK Poge-10

(S13
HM.A. Mhar nlyerollys Auwiterpur
5, uhayt Cus1, Glfanin, irnuru fumg, shntlhl Hrpalla, "Data Arutures and Propyarn Deeen

h Farman "AApprant
Srmtuul Mogamunhg Apnath wslny ", Cunyar laatning tndia.
Irttral
,ADala S1rHun uslng ,
tn aln iuelurms and Alenithuns-aney Pahija, ftew Aye Putl,
Hrhii PhunAna, Vikat Put»llratlion

BCA-20015YSTEM ANAY515 DESIG

Tolal lecluraa 50

Unlt-mpntante nl syeten Analyels and espn, Concept td ytunn, characteristics and


1ypes nl syetun, ytem heyelopnent 1e yla waterfall model, Prdtype deeopmet
tralgy, 5ftwate and kttributes f iyten tanalyt.
Caisle, Audin Trall, oaltn
Unit
IStws d Prnjetl rnuest, Prnjert eletti, Prelirninary Investigation, Feaibility
Audy, tyrs uf faasihility sturty, ar1 aud tenelit analysl,
yeteme Anntyele, Mrquiaurnem dtanination, arutured Anaysis, sy:ten. PAquirements
pectficatlon (), Analyeis Ts, Data ietionary, HIPG, Deciion Tree, Decision Table,
WHrulet-rr Dlagrarn, FD, Data flm De:sign (DFD)
Unlt sten esten, esipn peess, unstralnls, Input and erntrol De:ien, validetion
chetks, tumnt and 1ypes ol Fon, Form Desin, Output Design, File Desizn: Types of File
Mhtr File, Transacttun file, Table / Referene File, Peport file,
Unlt : altware mality and Testing: Dwality wanurpt, Tr-:ting and Testing ohjectives, Btack
Bo. and /hitr an
testing,Unit 1ellne, integration testing. vyten testing g
Unit V: ilardware and tare kuivisition and selection critsria, system conversion and
umversion plan, itn preparalian, training, IAaintsnans and 1yps of maintenance.
Unit-ViE Annavenent tnlmation toytem: Delinitian, ohjetives and rote in organication and
for managers, Infornatinon vyten at different 1eels of organisation/management
OA5,TPSJAIS,DGS, Conponents of lAIS, Failure and suces of AIS,

Ttxt Books:
1, haalyse Desten Intormationytea, Janesh. Senn, IAcGraw Hil Publ. Delhi
2,"ytesn knaly:i; 2 Drsiyn", C.J.kwad, Galpptia Publ., N. Delhi
3."yten htvalytt 2 Dislyp", V. Eajararnan, PHI Publ.
4, 1hanayenent infornation Cntrol yaen", Dr. Su:hila IAadan, Tavmann Publ.
s,"Mnkerrnation ystem tor Aodern lAanapenent", R.G.JAurdick, Joel E. Poss, &I.R.Cagget, PHI
6. ten Analsi, Desipyt, D. Pichard, Iruin Ine., 1979
7. "Mntroductien tn em
nalysi, & tesien", 6.5.ee, Vols. IAanthester, U.X.
t. "Mhanaernent tormatin rAens. 1Aanaping the Digital Firm", Kenneth C. Laudon 2 lane
PLaudon, Peatvn, 15 Ed., 2014.
9, tems knalle and tDrign saethods", Jellery L Y/hitten, Lonnie D. Bentley, Kevin C
Dienan, TlAH
10, Modern ytens Analyeis and DesienJetfrey h. Holfer,toey F. George,and Valaciech, Pearson

Page-31

S 19
(
B.R.A. Bihar Unlverslty, Muzaffarpur

BCA-205 Lab on MS-Office


Total Lab Classes = 60

Microsoft Word: Introducing Word, Entering and Editing Text, Formatting Text, Formatting
Pages, Creating Tables; Special Word Techniques, Word and the Web.
Microsoft Excel: Introducing Excel, Entering Data and Formulas, Structuring the Sheet, Formatting
the Sheet, Using Excel Charts, Excel Database Techniques, Special Excel Techniques, Excel.
Microsoft PowerPont: Introducing PowerPoint, Buitding a Presentation, Outlining the
Presentation, Creating Text Slides, Creating Chart Slides, Formatting Charts, Creating Org Chart and
Tables, Customizing a Presentation, Drawing on Stides, Creating Side Shaws, Animation effects.
Text Books:
1. SteveSagman, Microsoft Office XPfor Windows, Pearson Education.
2.ITTools and Applications-S.K. Jain, BPB Publications
3.A First Course In Computer Based On Windows XP And Ofce XP, Sanjay Saxena. Vikash Publ.

BCA 206: Lab on Data Structure through C:


Total Lab Classes= 60

Programs in C related to following topics:


array-one and two dimensions. i) function-passing variable and array to a function.
li) pointer and function - call by address/reference. v) structure such as structure to represert
a date, point, time etc. v) Recursive functions.
selection sorting, bubble sorting, insertion sorting, heap sorting. and quick sorting of elemets
an array.
arof
menu based operations on single linked list, menu based operations on double linked list, menu
based operations on circular linked list
stack and its operations, queue and its operations.
insertion of node in binary search tree.
traversal of binary search tree nodes in prefix, infix and postfix order.

A Mini Project

AR
Page-12 ,
B.R.A. Bihar University, Muzaffarpur

3rd Semester:

BCA-301: Fundamentals of Management & Business Accounting

Total Lectures = 50

Unit- I: Concept: Nature, Functions of Managers, Management: Arts Vs Science, Evolution of


Management Thoughts, Functions of Management.
Unit 13- Types of Control, Steps involved in Control Process, Meaning and importance of the
study of Organisational Behaviour. Improving inter-personal effectiveness, inter-personal
communication I6 Lect.]
Unit l1: Introduction of Accounting Basics of Accounting Meaning of Accounting and
ACcounting Cycle, Users of Accounting Information and Their Needs, Objectives, Types of
Accounting Information, Advantages, Limitations, and Branches of Accounting, 8asic Accounting
TerminoloEY
Unit-V: Double Entry System of Book Keeping, Accounting and Economic Concept of lncome,
Computation of Accounting Income and economic Income.
Unit-V: Journalising. Posting and Balancing8
Financial Statements- Meaning, Usefulness, Elements of Financial Statements, Manufacturing
Accounting. Trading Account, Profit & Loss Account, 8alance Sheet (Position Statement),
Distinction Between Manufacturing Account and Trading Account, Trial Balance.
Unit-Vi Use of Computers in Accounting - Meaning, Capability and Role of Camputers in
Accounting, Computer Terms
Books:
Text 1
8YG Principles and Practices of Management by LM.Prasad
2. Essentials of Management by Harold Koontz &Oddonell
3. Organisation and Management by R.D.Agrawal
4. Organisation Behaviour by Fred Luthens
5. Management of Organisation Behaviour- Harshey & Blanchard
6. Financial Accounting, P.C.Tulasyan, 24 Ed. Pearson
7. Modern Accountancy-A. Mukherjee & M. Hanif
8. Advance Accountancy-J.R.Batliboi.
9. Comprehensive Accountancy S.A.Siddiqui, Laxmi Publ.

BCA-302: DATABASE MANAGEMENT SYSTEMM


Total Lectures = 50

Unlt-I Introduction: Database and Database Users, Characteristics of the Database Approach.
Structure, Function and Components of D8MS, Different people behind DBMS, Advantages of using
DBMS. Database System Concepts and architecture: Data Models, Schemas, and nstances. DBANS
3-Level ANSI/SPARC Architecture and Data Independence. Types of DEMS.
Unit- 1 Data Models: Entity-Relationship Model: Entity types, Entity sets, attributes, and Keys,
ER Model Concepts, Natation for ER
Dlagrams, Reducing E-R Diagrams to tables. Abstraction
Generalisation, Specialisation, and Aggregation. Cardinality and Modality. Exercises

AR
Page-13
B.R.A. Bihar Universlty, Muzafarpur
Unit I: Relational Data Model: Structure and propertles of relatlonal model, Relation,
Attribute, Tuple, Keys: Super, Primary, Candldate, Alternate, and Foreign keys, Relationa
Algebra: Union, Intersection, Dilference, Carteslan Praduct, Dlvislon, Joln.
Introduction to Network and Hierarchlcal Data models
Unit IV Functional Dependencles and Normallzation for Relatlonal Database: Functional
Dependencies and its types, Axloms for FDs, Decomposition Rules, Dilferent Normal Forms:
1NF, 2NF, 3NF, BCNE, Multi-valued dependencies 4NF and 5NF, DKNF
Unit -V Relational Database Language: Data definition in SQL, DDL Commands, DML Cornmands,
Queries in SQL- Simple Queries, Nested Queries, Aggregate Functions, Insert, Delete and Update,
Views in SQL, Specifying General Constraints as Assertlons, specifying indexes.
Unit-VI: Transaction Processing Concepts: Introduction, Transaction and System Concepts, Desirable
(ACID) properties of transaction, Recovery Techniques: Log-based, Check-points and Shadow pagíing
Serializability of schedules, Problems with concurrency, Concurrency Contral, Locking Techniques,
Lock types, Granularity of Locking, Concurrency Control based on time stamp ordering.

Text book: 1. Remez Elmaseri and Shamkant B. Navathe, "Fundamentals of Database Systems
Sth Ed., Pearson Education, 2007.
2. Shio Kumar Singh, "Database Systems-Concepts, Designs and Application", 2011. Pearson.
3. A. Silberschatz, Henry. F. Korth, S. Sudarshan, "Database System Concepts 6th Ed, McGrav
Hill, 2012.
4. Bipin C. Desa, "An Introduction to database systems", Galgotia Publications
5.CJ.Date, A. Kannan, S. Swamynathan, "Introduction to database systems", Pearson, 2013.
6. Alexis Leon& Mathews Leon, "Database Management Systems", Vikas Publ.
7:Atul Kahate, "Introduction to Database Management Systems*Pearson Education A |
8. Prateek Bhatia, Gurvinder Singh, "Simplified Approach to DDBMS", Kalyani Publ.
9. Rini Chakrabarti, s. Dasgupta, S. K. Shinde, Advanced Database Management Systems",
Dremtech Press, 2014.
10. Arun K Majumdar, Primoty Bhattacharya, "Database Management Systems", McGraw Hill

BCA 303: Object Oriented Programming using Ct+


Total Lectures = 50

Unit I:
0bject oriented programming concepts Why do we need object oriented.
Ct+Programming basics: Output using cout. Directives. Input with cin.
Type bool, The setw manipulator, Type conversions.
Unit-I1
Functions: Returning values from functlons, Reference arguments, Overloaded function, Inline
function, friend function, Static function, Default arguments, Returning by reference.
Unit
Object and Classes: Making sense of core object concepts (Encapsulation, Abstraction,
Polymorphism, Classes, Messages Association, Interfaces) Implementation of class in C*, C+*
Objects as physical object, C++ object as data types, constructor, Object as functlon arguments,
The default copy constructor, returning object from function, Structures and classes, Classes
objects and memory static class data, Const and classes.

Page-14
Asig
8.R.A. Blhar Unlverslty, Muzaffarpur

Unit IV:

Arrays and string arrays fundamentals, Arrays as class Member Data: Arrays of
object, string
The standard C++ String class, Operator overloading: Overloading unary operatlons,
Overloading binary operators, data conversion, pltfalls of operators overloading and converslon
keywords. Explicit and Mutable.
Unit-V
Inheritance: Concept of inheritance, Derived class and based class, Derived class constructors
member function, inheritance in the English distance class, class hierarchies, inheritance and
graphics shapes, public and private inheritance, aeeregation: Classes within clases, Inheritance
and program development, Virtual Functlon: Virtual Functlon
Unit- Vi
Pointer: Addresses and pointers. The address of operator and ponter and arrays. Pointer and
Factlon pointer and C-types string. Memory management: New and Delete, pointers to objects,
debugging polnters. Assignment and copy intialization, this pointer, dynamic type
-information, Streams and Files: Streams classes, Stream Errors, Disk File /0 with streams, file.
pointers, error handling in file 1/o with member function, overloading the extraction and
insertion operators, memory as a stream object, command line arguments and printer output.
Templates and Exceptions: Function templates, Class templates Exceptions
Text Books:
1. Programming in C++, Robert Laffore, TMH
2. Programming in C++, Ashok M. Kamthane, Pearson
n :3,Object Oriented Programming. with CtE. BalaguruswamyTMH
4, C4+Programming, Maria Litvin & Gary Litvin, Vikas Publ.
EIonENWL AS
5. Programming with C++, D. Ravichandran, TMH
6. Object Oriented Programming with C++, Rohit Khurana, ITESl, Vikas Publ.

BCA 304: Numerlcal MethodoloEY


Total Lectures = 50

Unit I: Solution of a nonlinear algebraic ad transcendental equations:Bisection method, False


position, Newton Raphson method, Iterative Method, Lin Bairstow's method.
Unit-Il: Solution of Simultaneous linear equation: Gauss elimination, Gauss Jordan, U
decomposition, Crout's method, Jacobi, Gauss Seidel, Relaxation method, Inverse of a matrix using
iterative method.
Unit lt: Finite differences: Introduction and different types of operators and relation
between them. Factorial notation and Polynomial In factorial notation.
Unit 1V: Interpolation: Introduction Newton forward and backward Interpolation Newton
Divided differences, Lagrange's Interpolatlon, Central difference interpolation
formula, Gauss
forward and backward interpolation formula. Numerical differentlation.
Unit-V: Numerical integration: Trapezoidal and Simpson's rules, weddle's rule and
their order
of error.
Unit Vi: Solution of ordinary differentlal equation:Euler's
method, Euler's modified method,
Runga Kutta method, Taylor's Series method, Picard's method,
Adams-Bashforth method.

Page-15 k
B.R.A. Blhar Unlverslty, Muzalfarpur

Note: Students may use sclentific colculator


for numerical calculotlons of varlous functlons
(Log, Exponentlal, Trigonometricol,
etc.)
Text Books:
1. Jain, M.K.: Numerical method for scientific and Engg. Computations-Wiley
Eastern, N.D.
2. Sastry, S.S.: Introduction to Numerical Analysis- PHI
3. V.Rajaraman: Computer Oriented Numerical Methods-PHI
4. Gonte de Boore-Elementary Numerical Analysls, Tata McGraw Hill

BCA-305: LAB ON DBMs (MS-ACCESS/SQL)


Total Lab Classes 60

sQL Commands: DDL: CREATE, ALTER, DROP, INDEX


DML: insert, delete, update, and commands related to querles on tables- simple and nested.
queries- Basic data retrieval condition specification; order by; Uses af logical operators- and,
Or, not Range searching: Pattern matching; arithmetic and aggregate functions; Jolning
multiple tables (Equl joins); set manipulations Any, All, In, Exists, Union, Intersect, Minus,
grouping command. creating vieWs.
DCL: GRANT and REVOKE
TCL: COMMIT, ROLLBACK and SAVEPOINT

oks
redEEIsal'&Pl/sat For Oracle 11g 8iack Book, Dr. P.s.Deshpande, DreamtechPress34
2. Commercial Application Development using Oracle Developer 2000, Ivan Bayros, BPB Publ.
3 y 4s
3. SQL, PL/sQL The Programming Language Of Oracle, Ivan Bayross, BPB Pub.
4. Learning Oracle SQL and PL/SQL- A Simplified Approach, Rajeeb C. Chatterjee,PHI
5. Oracle The Complete Reference, Oracle Press, TMH Edition.
6. sal-A Complete Reference, Alexis Leon & Mathews Leon, TMH

BCA-306: Lab on Ct+


Total Lectures = 60

Program in Ct+ related to following topics:


Input/ Output using cin/ cout. Decision making using if else, switch case, conditional operator
Looping using while, do while and for. Array single and multi dimension. Function simple,
recursive, call by value and reference, overloading, default argument value. Class -Constructor,
Member Functions. Operator overloading. Friend functlon. Inheritance Single, Multilevel,
Multiple.
Virtual Function. Stream handling.
1. Simple C++ Programs to Implement Various Control Structures
Ex 1A: if .. else statement
An electricity board charges the following rates to domestic users ti discourage large
consumption of energy: FOR the first 100 units -50P per unit, For next 200 units- 80P per unit
Beyond 300 units-90P per unit. All ysers are charged a minimum of Rs.So.00. if the total

Poges6
B.R.A. BIhar University, Muzaffarpur

amount is more than Rs.300.00 then an additional surchare of 15% is added.Write a C++
program to read the names of users and number of units consumed and print out the charges
with names
Ex 1B: svwitch.. case statements and do. while loop
An clection is contested by five candidates. The candidates are numbered 1 to 5 and a voting
is done by marking the candidate number in a ballot paper. Write a C++ program to read the
ballot and count the votes cast for each candidate using an array variable count. In case, a
number read is outside the range 1 to 5 the ballot should be considered as a 'spoilt ballot',
and the program should also count the number of spoilt ballots
Ex 1C: for loop - Write a C++ program to print the different Pyramid structures
Ex 1D: while loop Write a C++ program to print the Fibonacci series 0 11 2 358 13. By
getting number óf number to be displayed is given as input Eg. 5 is input value means it should
print first 5
numbers 0 112 3:
2. Programs to Understand Structure & Unions.
Ex 2A: Structure Create a Structure called ermployee with the following details as.variables
within it.
1. Name of the employee, 2. Age, 3. Designation, 4. Salary
Write a C++ program to create array of objects for the structure to access these and print the
name, age, designation and salary
Ex2B: Union Create a Union called student with the following details as variables within it.
1. Name of the student, 2. Age, 3. Year of study, 4. Semester, 5. 5 different subject marks in
rsz array;Write a C+program to create object for the union to access theseand print the:Nameo ET
age, year, semester and grade according to their percentage of marks scored. 90 % and above
S grade, 80% to 89%- A grade, 7o% to 79%- B grade, 50% to 69% -- Cgrade S0% to 59%- D
grade, <50%-
3. Programs
F grade
to Understand Pointer Arithmetie.
Ex 3: Write a C++ program to find the number of vowels present in the given character array
using pointer arithmetic.
Ex 4A: write a C++ program to print the given number in reverse order. Use functions with
return type and without return type for reversing the number.
Ex: given number is 2345, output should be 5432
Ex 4B: Write a C++ program to find the sum of factorial of a given number using recursive
function
Ex 5: VWrite a C++ prOgram to perform different arithmetic operation such as addition,
subtraction, division, maodulus and multiplication using inline function
6. Programs to Understand Different Function Call Mechanism.
a. Call by reference and Call by value
EX 6: Write a C++ program to swap two number by both call by value and call by reference
echanism, using two functions swap value() and swap_reference respectively. by getting the
choice from the user and executing the user's choice by switch-case.
7. Programs to Understand Storage Specifiers.
EX 7
write a C++ program to demonstrate the static and non static variable usage defining
them within a function.
8. Constructors & Destructors.

ge-1 T
Poge-17
A o
B.R.A. Bihar Universlty, Muzaffarpur

Ex 8: Create a class for counting the number of objects created and destroyed within various
block using constructor and destructors.
9. Use of "this" Pointer Using class
Ex 9: Write a C* program to create three objects for a class named pntr obj with data
members such as roll no & name . Create a member function set_data() for setting the dota
values and print(}member function to print which object has invoked it using 'this" pointer.
10. Programs to Implement Inheritance and Function Overriding
Ex 10A: Write a C++ program with different class related through multiple inheritance and
demonstrate the use of different access specifiers by means of member variables and member
functions.
Ex 108: Write a C++ program to explain virtual function (polymorphism) by creatinga base class
c_traingle derived
Cpolygon which has virtual function areal). Two classes_rectangle and
of rectangle and triangle
from cpolygon and they have area() to calculate and return the area
respectively.
& Non
11. Programs to Overload Unary & Binary Operators as Member Function
Member Function.
Ex 11 A: Write a C++ program to count the number of persons inside
a bank, by increasing
function,
count whenever a person enters a bank, using an increment(++) operator overloading
and decrease the count whenever a person leaves the bank using decrement(-)
a operator
overloading function inside a class
Ex 11 B: Write a C++ program to create two objects of a class called company and add their
data members using an operator overloaded function fort operator andoperator
12. Programs to Understand Friend Function Friend Class.
&

a. Friend function

b: Friendclass
Ex 12 B: Write a program to accept the student detail such as name and 3 different marks by
get_datal) method and display the name and average of marks using display() method. Define a
friend class for calculating the average of marks using the method mamk3vgl.
13. Programs on Class Templates

A Mini Project

AR Page-18
B.R.A. Blhar University, Muzaffarpur

4th Semester:

BCA-401: Java Programming


Total Lectures = 50

Unlt-I: Overvlew of Java Language


CH Vs JAVA, JAVA and intcrnet and www.JAVA support systems, IAVA environment
JAVA program structure, tokens, statements, JAVA virtual machine, constants & variable, data

types, detlaratlon of varlable, symbolic constants, type casting


Conditiona
Operators: Arlthmetic, relational, logical assignments, increment and decrement,
bitwlse, special, expresslons & its evaluation
Deelslon Making and Dranching
statement, I...clse statement, Nesting of if...else statements, elseif ladder, svitch, ?
operators, loops while, do, for, Jumps in loop, labelled loops.
Unlt-I1: Classes, Objects and Methods
Definlng a class, ndding variables and methods, creating objects, accessing data
members
Constructors, methods overloading. static members, nesting of methods.
final dases,
nherllance: Extending a clas, overriding methods, final variables and methods,
fInallzer methods, abstract methods and classes, visibility control.
Unlt: Arrays, String and Vectors
wrapper classes, defining
Arrays: One dimenslonal & two dimensional, Strings, vectors,
accessing interfaces, irariables,
Intéjfaces, extending Interfaces, implementing interfaces,
HP System packages, usling system packages, naming conventions, creating
accessing a
packages,
packoge, using package, adding a class to a package, hiding classes.
Unlt IV: Multlllreaded programmlng
a thread, life cycde cf a
Crenting threads, extending the threads class, stopping and blocking
synchronizaticn,
Uread, using 1hread methods, thread exceptions, thread priority,
iplementlng the runnable interface.
Unlt-V: Applet Programming
applets, applets life cycde, creating ard
Lotnl nd remote applets, applets Vs applications, writing
adding applet to HTML file, running the
Cxecutable applet, deslgning a web page, applet tag
DTML tags & applet, getting inpu:
npple, passhng paramelers to applets, aligning the display,
Irun tlre user.
Jbbc-oDuc (lava Database Connectivity)
Texl looks:
Core Jova, Nageshwar Rao, Dreamtech Press
2. Cote Java For Ueglnners, Rashml Kanta Das, Vikash Publishing House
3, Java The Complete Relerence, Herbert Schildt, TAIH
4. Progranunng Wih Java: A Ptlmer, Balagurasamy, TAIR
Sav-One Step Ahead, Anlta seth & D.LJuneja, Oxford University Press.

Page19
SREN7
(46)
&RA Bhar Urhersity, Atraffarpur

BCA 402: Computer Graphics and Mutimedia


Total Lectures 50

Unit-:
1.1 Introduction, Computer Graphis System, trteracthe Grephis
1.2 Passive Graphies, ApgRaticn ei Cormputer Grasks
Unit-I:
2.1 Intreducticn, Display Devices Cathede Ray Teb
2.2 Bit-MapFRed Graphics, Grashies Attribetes, Refresh Cathode Ray Tubes
2.3 Randem Scan Displays Raster-Sean Dispsys, Color CRTAantors
7hin Ra ecrominescent
2.4 Direct-View Storagse Tubes (DVST), Fasma Panel Disslays
displays
Copy Outpt Devies
2.5 Light Emitting Dicde (LED), Liçuid Cstal Dissays (LDs), Hard
Unit- ll
3.1 Intreducticn. Scan Cocaversion, Distal Differential Arshaer.
3.2 Bresenham's Agcrithn, Iateger Ereserhams Ageithm
3.3 General resentam's Algorithm, Circde Gereratiea Algaviths,
Sresenham's crc
seneraticn algorithn, tdpcint Cirde Azerithn
Gereration agorithms, F
3.4 Ellipse Generatica alserithms Adpoiat Epse A'gxithn, Ar
Algorithms
Unit-v
iS4.1 Fundamentals of Antialiasir thering20 GrapNs-Transfomations Gaonetric and t E
Coordinate Transformations
4.2 Transfermaticn Compasiticn, 2-0 Viaw ad ipsnE Eterir zad interr Cippinz
Viewpert Transformaticn, Fchygcn Cigpns. Teat psr3
Unit-V
5.1 Introduction,3-D Graphics Transiermzticns
S.2 Coordinate Transfcrmaticns.s-D Prejectiors, Ferspecthe Frojaoon
on a Plane with
3-D Vewng and
Clo,0,0). Perspective Prejectica caa Flane wih (a,b.c).Farnal Frojaions,
Clipping. Hidden lines and Surfaces Sean line Ertias (a) [>) (c) i$)
5.3 Importance of Wireframe Madels, Demerits cf wireirana ades Representins a
Polygcnal Net Model, 6ezier Cunves and Surfaces, 5-Spnesk
Unit-V
6.1 Introdueticn
5.2 Multimedia Hardware
6.3 Atutimedia Software Tocls
6.4 Application Areas for Atutimedia
6.5 tultimedia Compcnents Hypermedia, Mutimedia Tehesesy

Hsis
Page
RA Dihar Universly, Murnllarpur

pCA-403: Opernting System & Linux

Total Lectures « 50

Unlt- I: Overvlew:
Oblectlves anel functlons, Evalutlon, Achlevement.
Unlt-I: Process Management:
Process, Stale, Descrlptlon, Control.
Unlt-1: Pracess Synchronlzatlon:
Mutual Cxtlkuslon, Semajplhores, Monltors, Message Passlog, Readers/Wrlters Problem.
Unlt-IV: Dradlork:
Deallock Avolklance & Detectlon, Dhnlng Phllosophers Problem.
Unll-V: Memory Management:
Requlrements, Pautltlonlvg, Paglng Segmentatlon.
Unlt-Vi: Schecduling:
Unlprocessor Schedullng Algorlthms, Multlpracessor Scheduling, Real-Time Scheduling.
Unit-Vll: File Management:
Fle Orgalatlon, Directorles, Sharhg, Record Dlocking, Secondary Stornge Management.
Unlt-Vill: LINUX & SICLL PROGRAMMING
LInux: Flle/folder Structure, User Management, Process Management, Commonly used
commands.
Shell Programmlng: Dellnlng varable, Cxpresslon, If else l1, case csac, whllc, until, for loop.

Text Dooks
RG t Abraham:Sbersehatz
EGucatlon,
and PeterBaer Galvin, "operatingsystemConceptsPearson
2. H.M.Dcltel, "Operatng Systems", Pearson Learnt Solutlons.
3. Willam Stallings, "Operating Systems", Pearsan Cducatlon,
4, Sumltablha Das, "Unlk Concepts and Applicatlons", TMII.

DCA 404:SOFTWARE ENGINEERING PRINCIPLES


Total Lectures = 50

Unlt-i: Introductlon to Soltware Cngneering, ts emergence; Software characteristies, classificatlon


of software; software engneerlng principles, phases In soltware engineering.
Software Process, Capabliy Maturlty Moudel, Proccss Modlels: Waterlall, Prototype, Rapid Appliecation
Development (RAD), Incremntal, Splrnl, Component-baset Assembly Model, V.Model.
Unlt -: Systems Analysls: Requiromenis and Specilicatlon: Analysls Mocdel, The Requlrement
Cnglncerlng Process, The Software recjulrement tocument, Functlonal & Non functlona
requirements, Fact rlnding Technlques Meetlng (fAST), Intervlew, Drect nspection,
Documents, Questlonnalre, System Requrements Snecltlcatlon (5RS), Data Flow Dlagram (DFD),
CRD, Cardinally and Modallty,

Unit- I1E System Dosign: Deslgn Procuss, Ginod Deslgn, Doslgn Peinclples, Deslgn constralnts
Deslpn Quality, System Siructuring contreol mntlels, Maduhr decompostian, Coupting and
Colheslon, Domaln Speclic arclhltecture, User Inteetace Deslgn. Object Orlented & functlon
orlenled desipn: Objects, object Classes nnd nlerltance, Objoct ldentilicatlon.
B.R.A. Bihar University, Muzaffarpur

Unit- IV:Software Coding: Coding guidelines, code document,


structured programming, code
inspection. Metrics Definition, objectives and types of metrics, Slze-orlented (LOC-based)
and Function oriented (FP-based) metrics. Reliability and Software Quality: concepts, Factors
-

of good quality software, McCal's Quality Factors, Software Quality Assurance (SOA), FTR,
Inspection and Walkthroughs.
Unlt-V:Software Testing: Testing basics, Guidelines of testing, characteristics of software test,
Test Plan and Test case, software testing strategies, Levels of software testing: Unit testing.
integration testing, system testing, acceptance testing. Testing techniques: White box, Black
box and Gray box testing. Basis path testing, Flow graph notation, cyclomatic complexity,
Equivalence Partitioning, verification & Validation (V & V), Debugeing
(CASE)
Unit-Vi: Maintenance and its types. Overview of Computer aided software engineering
Publ., 2010
Text Book:1. Software Engineering: Principles and Practices, Rohit Khorana, Vikas
2. Software Engineering: Principles and Practices, W.s. Jawadekar, TMH
3. Software Engineering-A Precise Approach, Pankaj Jalote, Wiley India, 2012
4. Software Engineering-A Practitioner's Approach, Roger Pressman, 7E., McGraw
S. Hnl

5, Software Engineering, lan Sommerville, 8Ed, Pearson Education


6. Object Oriented Analysis and Design, John Deacon, Pearson Education
2 Ed, Pearson.
7. Fundamentals of Software Engineering, Carlo Ghezzi, Jezayeri, Dino Mandrioli,
8. Software Engineering-Principles and Practices, Deepak Jain, Oxford
University Press.
9. Software Engineering, Jibitesh Mishra and Ashok Mohanty, Pearson
Publ.

10. Fundamentals of Software Engineering, Rajib Mal, PHI

BCA-405: Lab on Java Programming


Total Lab Class = 60
Exercise 1 (Basics)
a). Write a JAVA program to display default value of all primitive data type of JAVA
b). Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate
c) Write a case study on public static void main(250 words)

Exercise-2 (Operations, Expressions, Control-flow, Strings)


(d) Write a JAVA program using String Buffer to delete, remove character.
Exercise 3 (Class, Objects
e). Write a IAVA program to implement class mechanism.-Create a class, methods and Invoke
them inside main method.
). Write a JAVA program to Implement constructor.
Exercise- 4 ({Methods)
a). Write a JAVA program to implement constructor overloading
b). Write a JAVA program implement method overloading.
Exercise-5 (lnheritance)
a). Write a JAVA program to implement Single Inheritance
b). Write a JAVA program to implement multi level Inheritance
e). Write a jova program for abstract class implementation
Exercise 6 (Inheritance Continued)
a). Write a JAVA program give example for "super keyword.
D.R.A, DIhar Unlversity, Muzaffarpur

b).Wrlle a JAVA program to Implement Interface, What kind of


Inheritance can be achiered?
Exerclse 7 (Exceptlon)
a).Wrlte a JAVA propram that describes exception handling mechanism
b),Wrlte a JAVA program llustrating Multlple catch clauses
Exerclse- 8 (Runtlme Polymorphlsm)
a), Wrie a JAVA program that Implements Runtime polymorphism
b). Wille a Cose study on run time polymarphiem, Inheritance that implements in above prcble
Cxerclse-9 (User defincd Exception)
a). Wrlte a JAVA program for creatlon of lustrating throw
Exerclse-1o(Threads)
a). Wete a JAVA propram that creates threads by extending Thread class..
b). Write a program llustrating isAlive and Joln ()
Exercise 11 (Packages)
a).Create package and call It In another class.
b). Wrlte a JAVA program that import and use the delined package in new package.
Cxerclse 12 (Applet)
a).Write a JAVA program to paint like palnt brush In applet.
b) Wrlte a JAVA program to display analog clock using Applet.
c) Write a Java program that takcs input

Lab on Computer Graphics & Linux


BCA 406:
Total Lab Closses 60
A) Computer Graphlcs 8&Multimedla
Unlt :
)Wrlte a Programme to draw a colourful Pixcl
) Wrlte a Programme to draw a line.
Unlt I:
Write Programmes to draw a different shapes
)Rectangles i.) Clrles H) Square iv,) Arrow v.) Zooming of Circles vi.) Zocming cf
Rectangles
Unlt ll
) Write a Programme to draw a Indlan Flag
I) Write a Programme to draw Indlan Flag

) Write a Programme to draw Chess Board


Unlt IV
) Draw a Line Using Bresenham's Algorthm
) Draw a LIne Uslng DDA Algorlthm
Unlt
Write rogram to fll a polygon using Scan line fill algorithm.
) Welte programs to apply varlous 20 transformations on 20 object (use hamagenecus
.

coordinates)
I) Welte programs to apply varlous 30rangformations on a 30 object (use hamegenecus
coordinates]

Page-2.
7
is19 ei
B.1.A, Dlhar Unlverslty, tAurnlfarpur

0) UNIX/LINUX
Use of follewlng UHIX/UX cornnandt
Cat, cal, Is, tnkdlir, rndllr, cu, rm, mv, cp, vl, chmad,
thwn, mcho, be, /pr
Shell prograns relalnd to lollovlng:
Use of shell varlalbles
Usn of lt else fi statemen
Use of case esat statenent
Use of whille do dono slatement
Use of until do done statement
Use ol lor loop
A Minl Project

Hui
tS
Page-24

S9
B.R.A. Bihar Unlversity, Mutafarpur
5th Semester:

BCA-501: Relational Database Management syste

Total Lectures = 50

Unit- CODD commandiments


of RDBMS,
ntroduction & features: Concept of RDBMS, Properties
SQL pluS
Data manipulations in RDBMS
Oracle data type
Table
of data contents
Creation, insertion, updation, deletion
Modification of structure
Removing, deleting, dropping of tables
Select command
Unit
reference,
Data constraints
Null, unique key,
default, foreign key
level constructions, table, Defining integrity
Column level & table
Defining different constraints on the
CHECK integrity constraints,
command.
constraints in the alter table
Unit l1
used to Select Data Grouping data iA
Computations in Expression Lists searching, Oracle functions,
searching Pattern
ASKIR Logical operators, Range data in SQL
table in SQL, Manipulations
frame
Jolns joins)sub queries
(equi-joins ), Joining table to itself (self
Joining multiple tables
Union, intersect & minus clause.
Unit IV

Indexes Views column of view, Granting


selections of data, Renaming the
Creation, updation, destroying, GRANT statement, Object
objects created by the user,
permissions, Permission on the
privileges, Referencing the tables to the
another user, Revoking the permissions given
Unit V
PL/SQL
set, syntax, block structure
Performance, portability, data types, character
Oracle transactions
Locks
Unit VI
Cursors
Error handling
.Procedure and functions
Concept, creation, execution, advantages, syntax, deletion
Triggers
Concept, use, how to apply database triggers, type of triggers syntax, deleting s
B.R.A. Bhar Unlverslty,
Muzaffarpur

Text Books:
1. SQL& PL/SQL For Oracle 11g Black Book, Dr. P.S.Deshpande,
Dreamtech Press
2. SQL, PL/SQL The Programming Language Of Oracle, Ivan Bayross,
3. Commercial Application Development using Oracle Developer 2000, lvan Bayross, BPB Publ.
4, Learning Oracle SQL and PL/sal- A SImplified Approach, Rajeeb C. Chatterjee,PHI
5. Oracle- The Complete Reference, Oracle Press, TMH Edtlon.
6. sQL-A Complete Reference, Alexis Leon & Mathews Leon, TMH

BCA 502:Artificial Intelligence through Python

Total Lectures 50
=

Unit-: Introduction to Python


1.1 Installatlon and
Working with Python

1.2 Understanding Python variables


1.3 Python basic Operators
1.4 Understanding python blocks
1.5 Declaring and using Numeric data
types: int, float, complex
1.6 Using string data type and string operations
1.7 Defining list and list slicing
1.8 Use of Tuple data type
1.9 Conditional blocks using if, else and elif
1.10 Simple for loops in python

orogp using ranges, stringlist and dictionaries


TKA
#**112 Use ofwhileloops pythonin
1.13 Loop manipulation using pass, continue, break and else
1.14 Programming using Python conditional and loops block
Unit-I1 Python Functlons, Modules And Packages
2.1 Organizing Python codes using functions
2.2 Understanding Packages
2.3 Powerful Lambda function in python
2.4 Programming using functions, modules and external packages
2.5 Understanding string in build methods
2.6 List manipulation using in build methods
2.7 Dictionary manipulation
Unlt-1: Python File Operatlon
3.1 Reading config files in python
3.2 Writing log files in python
3.3 Understanding read functions, read{), readlinel) and readlines()
3.4 Understanding write functions, writel) and writelines()
3.5 Powerful pattern matching and searching
3.6 Password, email, url validation using regular
expresslon
Unit IV: Python Exception Handling and Data Base
4.1 Avaiding code break using exceptlon handling
4.2 Safe guarding file operation using exceptlon handling

CRege26
f
B.R.A. Bihar Uhiversity, Muzaffarpur

4.3 SQL Database connection using python


4.4 Creating and searching tables
4.8 Programming using database connections

Artificial Intellgence:
Unlt-V: Search
5.1 Uninformed
5.2 Informed
5.3 Mini-Max for Game Playing
Unit-Vi:
6.1 Task Planning
6.2 Robot Motion Planning
6.3 Supervised Learning8
6.4 Unsupervised Learning
6.5 Reinforcement Learning
Text Books: 2010
1. Dan.W. Patterson, Introduction to
A.l and Expert Systems-PHI,
Approach, LPE, Pearson Prentice Hall, 2005.
2. Russell & Norvig, Artificial
intelligence- A Modern
3. Mark Pilgrim, A press, "Dive Into Python
Learn and Practice Python
4. Swapnil Saurav, Ekapress (2018),
Artificial Intelligence, PHI
S. Rajendra Akerkar, Introduction to
6. Stuart Russel, Peter Norvig,
Artificial Intelligence-A Modern Approach, Pearson
Intelligent Systems, Oxford Univ. Press
7. N.P.Padhy, Artificial Intelligence and

CSS)
BCA-503: Web Technology (HTML, Java Script,
Total Lectures = 50

Unit-I: Fundamentals:
www, Internet, Web Browsers, Web Servers, URLS, MIME, HTTP.
Unit-Il: HTME Hyperlinks,
Origins of HTML, Basic syntax, Standard HTML page structure, Text markup, Images,
Lists, Tables and Form.
Unit Il: CSS:
Introduction, Selectors, Font attributes, List attributes, Color, Alignment of text, The Box model,
Background images, The <span> and <div> tags.
Unit IV:Java Script:
Overview, Object notation, Operations, expressions, browser output, keyboard input, Control
statements, Object creation, Arrays, Functions, Pattern matching using expressions, error
handling, The Document Object Model, Element access, Events and event handling.
Text BooksS:
1. Robert W Sebesta, "Programming the World Wide Web" Pearson Education.
2. M.Deitel, PJ.Deitel, A.B.Goldberg, "Internet & World Wide Web How to program", Pearson.
3. Chris Bates, "Web Programming Building lnternet Applications, Wiley India.
4. Jibitesh Mishra, Joel Sklar, Don Gosselin, "The Web Warrior Guide to Web Design
Technologies", Cengage Learning India.
5. Uttam K. Roy, "Web Technologies", Oxford Press

Poe-27 Asg
SDAM
B.RA. Bihar University,
Muzaffarpur
BCA-504: Computer Network,
Security and Cyber Law
Total Lectures 50

Unit-: Computer Network:


ntroduction: Definition, its use, goals
and structure, network architecture, ISO reference
model, Network Model, Connecting
Devices, TCP/1P, UDP
Nerwork Topology: Topology
Design process, connectivity analysis, Delay analysis, Bachhone
design, Logical Access Design.
Unit-I: Physical Link Layer: Theoretical basis for data communication, Data and signal, Digital
and Analog transmission,
transmision media, Switching, multiplexing.
Unit 1: Data Link protocols, Data Link controls, Sliding vindow protocols, virtual circuits,
Routing algorithms, Congestion, Examples of network layers, selected examples, Error
detection and correction, Multiple Access, Congestion control, Framing, MAC Sublayer. IPy4,
IPv6 Address, ICMP, 1GMP
Unit-1V: Network Security:
Introduction: Security Overview, Gyber security fundamentals, Security 5ystem desien
architecture, The OSt Security Architecture tools and techniques, Current Vulnerabilities-
Different Security attacks, Countermeasures, Security Services, tModel far tetwork Security.
Symmetric Gipher: Classical Encryption techniques, Symmetrie Cipher Model, lock Cipher
Design principles Feistel Structure, DES, Triple DES, Advanced Encryption Standard (AES),
Stream Cipher and RC4.
EESUnit-v F5nYED
Public Key Encryption: Message Authentication, RSA Algorithm, Digital Signature.
Network Security Algorithms: Kerberos, X.509, Authentication Services.
System Security: Intrusion Detection, Password management, Virus countermeasure, Firevrall.
Unit-Vi: Introductory Concept of Cyber laws: IT Laws, palicies and Government Regulations
Global, IT Act-India.
Text Books:
1 Computer Networks, A.S.Taenenbaum, Pearson
2. Data Communications and Netorking, Behrouz Forouzan, TMH
Computer Networks, William Stallings, Pearson
4. Computer Networks and Internets, Douglas E. Comer, Pearson
5. Data Communications and Computer ietworks, Prakash C. Gupta, PHI
6. Network Security Essentials Applications and standards, illiam Stallings, Pearson.
7. Cryptography and Network Security- Principles and Practices, W. Stallings, Pearson, 2018
8. CryptoEraphy and Network Security, Behrouz Forouzon, TMH
9. Introduction to Cryptography, Johannes A. Buchmann, Springer
10. Security in Computing. Charles P. Pileeger and S.LPlleeger, Pearson, 4e, 2011.
11. Cyber Law- The Indian Perspective, Pawan Duggal, Saakshar Lavw Publications
12. CYBER SECURITY LAW Kindle Edition, by PAVAN DUGGAL
13. Cyber Law Simplified, by Vivek Sood, TMH

Page-28
B.RA. Bihar University, Muzaffarpur
BCA-505: Lab on Oracle
Total Lab Class= 60

SQLcommands
Create, alter, drop, truncate, rename
Constraints- Primary key, unique, null, foreign key, default, check
Select, insert, update, delete, connect, revoke, grant, rollback, commit
Oracle functions, index, views (creation, deletion, updating, inserting)
Locking, Making Procedure, Making functions, Cursor programs, Triggers programs
Text Books:
1. SQL& PL/SQL For Oracle 11g Black Book, Dr. P.S.Deshpande, Dreamtech Press
2. SaL, PL/saL The Programming Language Of Oracle, lvan 5ayross,

BCA 506: Lab on Python & Web Technology:

Total Lab Class 60

Python Programming
Programming in Python Lab Practical:
Program 1 Using for loop, print a table of Celsius/Fahrenheit equivalences. Let be the
c

cig--sCelsius temperatures ranging,from 0.to 100,. for each value0ei z

E
EEC hrenheit temperätüre.
Program 2. Using while loop, produce a table of sins, cosines and tangents. Make a variable
x in

range from 0 to 10 in steps of 0.2. For each value of x, print the value of sin(x), costx) and tan(x).
ProRram 3. Write a program that reads an integer value and prints-leap year| or-not a leap year.
Program 4. Write a program that takes a positive integer n and then produces n lines of output
shown as follows. For example enter a size: 5***** ***
*****

Program 5. write a function that takes an Integern' as input and calculates the value of 1+
1/1!+1/21+1/3! +.+1/n
Program 6. Write a function that takes an Integer Input and calculates the factorial of that number.
Propram7. Write a function that takes a string input and checks if it's a palindrome or not.
Program 8. Write a list function to convert a string into a list, as in list (abc) gives la, b, c]
Program 9. Write a program to generate Fibonacci series.
PrOgram 10. Write a program to check whether the input number is even or odd.
Program11. Write a program to compare three numbers and print the largest one.
Program 12. Write a program to print factors of a given number.
ProRram 13. Write a method to calculate GCD of two numbers.
ProRam 14. Write a program to create Stack Class and implement all its methods. (Use Lists).
ProRram 15. Write a program to create Queue Class and imptement all ts methods. (Use Lists)
Prorram 16. Write a program to implement linear and binary search on lists.
Program 17. Write a program to sort a list using insertion sort and bubble sort and selection sort.

Page-29
I,A lhar Unlvordlty, Munllarpur

Wab Taclhnology:
ITMI cumle for slan upp, slgn ln, forHot passworl pnges,
N Coule to centrot thn nppenrancn of form etenonts of thn ITML paga.
JavaScrlpt iogram tn:
check wlutlhwr a nunnber Is oven or odad
clhvck wlwtler a year s loap or Nol
ind lactorlal of n numler
display table of a munber
validate inpul eloments of a slpmup pnge
simlar proRrams bisetl on nrray, (unctlon,
even basel cocllng.

A Minl Prolject

Asui
Page-30
st19
tS9
B.R.A. Bihar Unliversity, Muzaffarpur

6th Semester

BCA-601: Project Report: A project work will be done by all the


a
students separately or in a group containing 4 or 5 students on topic
assigned by the Guidefany of the faculty of the College). The student
will complete their project under the supervision of the Guide and
Submit the report in hard and soft copy at the time of evaluation.

BCA-602:- Seminar:- A Departmental Seminar will be organised and


students will have to present a paper in the seminar.
by the
BCA-603- Viva:- A viva-voce of 50 Marks will be conducted
University/Examination Board)
external examinersfappointed by the
Sth Semesters.
covering the papers studied by students in 1st to
**********

sEtesseen

11

Page-31

You might also like