ST. Philomena’s College (Autonomous) Mysore...2. Computer Fundamentals - P K Sinha,BPB 3. Principles of Electronics-V.K.Mehtha. Reference Books 1. Introduction to Computers - N Subramanian,TMH

St.Philiomena’s College( Autonomous), Mysore. BCA Syllabus CBCS Scheme Page 1

ST. Philomena’s College (Autonomous) Mysore

COURSE - BCA

Three-year six semesters Choice Based Credit System (CBCS) and

Continuous Assessment Grading Pattern (CAGP) Under Graduate

Programme under Autonomous Structure.

GENERAL REQUIREMENTS

Scheme of Instructions:

A. The Bachelor of Computer Application (BCA) Degree Course is of 6 semesters- three

years duration. A candidate can avail a maximum of 12 semesters – 6 years (in one

stretch) to complete the degree (including blank semesters, if any). Whenever a

candidate opts for blank semesters, he/she has to study

the prevailing courses offered by the department when he/she continues his/her studies.

B. A candidate has to earn a minimum of 140 credits & maximum 180 credits for successful

completion of the BCA Degree Course. The 140 credits shall be earned by the candidate by

studying Common papers and Core papers (Hardcore, Soft core and Open Elective),

excluding the credits earned in common papers for the successful completion of the Degree

course

C. Credits (Minimum) Matrix: A candidate has to study a minimum of 63 credits in Hard

core,20 credits in Soft core and 09 credits in Open Elective (sum total of 6 semesters) .

D. Minimum for Pass: No candidate shall be declared to have passed the Semester

Examination unless he/she obtains not less than 40% marks including internal assessment

in each subject with a minimum of 30% marks in the end semester written examinations.

E. All other rules and regulations hold good which are governed by the College.

F. Eligibility for Admission

A candidate who has passed two years Pre-University Examination conducted by the

Pre-University Education Board of Karnataka with Science subjects or any other

examination considered as equivalent thereto by the University of Mysore, is eligible for

admission to this programme. However they should have studied Mathematics as one

of the subjects in the qualifying examination. The combinations to be selected as per

Para 5 & 9


GENERAL SCHEME WITH RESPECT TO ASSESSMENT OF CREDITS

Semester H C SC OE Common Papers (CP)

Tota

l

Tota

l

Mark

s

Th

eory

Pra

ctic

al

Pro

ject

W

ork

Th

eory

Pra

ctic

al

Lan

g-I

Lan

g -

II

Fou

nd

ati

on

Cou

rse

I 9 6 - 3 - 4 4 4 30 900 II 9

3 - - 3 3 4 4 4 30 900 III 6

6 - 3 - 3 - 4 4 26 800 IV 9 6 - - 3 3 - 4 - 25 800 V 6 6 - 9 3 24 800 VI - - 12 - - 12 200

Total 39 27 12 15 9 9 8 16 12 147 4400


BCA - SCHEME OF STUDY AND EXAMINATION -2014

I Semester

Subject

code Title

Ty

pe

Teaching Hrs./Week

Cre

dit

s

Examination Scheme

Du

rati

on

in

Ho

urs

Th

eory

Ma

x.

Ma

rks

I A

Ma

x

Ma

rks

To

tal

Ma

rks

Th

eory

Pra

ctic

al

14BCA210 Language-I CP 04 - 4 03 80 20 100

14BCA Language-II CP 04 - 4 03 80 20 100

Foundation Course CP 04 - 4 03 80 20 100

14BCA320 Gen.Mathematics HC 03 - 3 03 80 20 100

14BCA330

Fundamentals of

Information

Technology OR Computer

Fundamentals &

Problem Solving

SC 03 - 3 03 80 20 100

14BCA340 Problem Solving &

Programming in C HC 03 - 3 03 80 20 100

14BCA370 Accountancy HC 03 - 3 03 80 20 100

14BCA350

Information

Technology & Digital

Electronics Lab HC - 06 3

03 80 20 100

14BCA360 C Programming Lab HC - 06 3 03 80 20 100

Total Credits 30 Total Marks 900

II Semester

Subject

code Title

Typ

e

Teaching Hrs./Week

Cre

dit

s

Examination Scheme

Du

rati

on

in

Hou

rs

Th

eory

Max.

Mark

s

I A

Max

Mark

s

Tota

l M

ark

s

Th

eory

Pra

ctic

al

14BCB210 Language-I CP 04 - 4 03 80 20 100

14BCB Language-II CP 04 - 4 03 80 20 100

14 Foundation Course

CP 04 - 4 03 80 20 100

14BCB320 Mathematics HC 03 - 3 03 80 20 100

14BCB310 Data Structures and

Algorithms

HC 03 - 3 03 80 20 100

14BCB340 Accounting and

Financial Management

HC 03 - 3 03 80 20 100

14BCB Data Structures Lab HC - 06 3 03 80 20 100

14BCB

Accountancy Lab

OR

SAP

SC - 06 3 03 80 20 100

14BCB Open Elective HC 03 - 3 03 80 20 100



III Semester

Subject

code Title

Ty

pe

Teaching Hrs./Week

Cre

dit

s

Examination Scheme

Du

rati

on

in

Ho

urs

Th

eory

Max

.

Mar

ks

I A

Max

Mar

ks

To

tal

Mar

ks

Th

eory

Pra

ctic

al

1410206 Language-II

CP 04 - 4 03 80 20 100

1410160 Foundation Course

CP 04 - 4 03 80 20 100

14BCC310 Operating System OR

Computer Organization SC 03 - 3 03 80 20 100

14BCC330 Microprocessors HC 03 - 3 03 80 20 100

14BCC340 Object Oriented

Programming with C++ HC 03 - 3 03 80 20 100

14BCC350 Microprocessor Lab HC - 06 3 03 80 20 100

14BCC360 Object Oriented

Programming Lab HC - 06 3 03 80 20 100

3BCA3 Open Elective OE 03 - 3 03 80 20 100


IV Semester

Subject code Title

Typ

e

Teaching Hrs./Week

Cre

dit

s

Examination Scheme

Du

rati

on

in

Hou

rs

Th

eory

Max.

Mark

s

I A

Max

Mark

s

Tota

l M

ark

s

Th

eory

Pra

ctic

al

4BCA1 Language-II CP 04 - 4 04 80 20 100

15BCD310 Numerical Analysis &

Statistics

HC 03 - 3 03 80 20 100

14BCD320 Database Management

Systems

HC 03 - 3 03 80 20 100

14BCD340 Visual Basic

Programming .NET

HC 03 - 3 03 80 20 100

14BCD350 Numerical Analysis and

Statistics Lab

HC - 06 3 03 80 20 100

14BCD360 Database Lab HC - 06 3 03 80 20 100

14BCD380 VB.NET Lab SC - 06 3 03 80 20 100

Open Elective OE 03 - 3 03 80 20 100



V Semester

Subject

code Title

Ty

pe

Teaching Hrs./Week

Cre

dit

s

Examination Scheme

Du

rati

on

in

Ho

urs

Th

eory

Ma

x.

Ma

rks

I A

Ma

x

Ma

rks

To

tal

Ma

rks

Th

eory

Pra

ctic

al

BCE020

BCE080

Computer Networks

Or

Network security and Cyber

Laws

SC 03 - 3 03 80 20 100

BCE030 Software Engineering HC 03 - 3 03 80 20 100

BCE070 Java &Adv Java HC 03 - 3 03 80 20 100

BCE110 System Software SC 03 - 3 03 80 20 100

BCE220 Software Testing and Quality

Assurance

SC 03 - 3 03 80 20 100

BCE090 Web Designing HC 03 - 3 03 80 20 100

BCE360 Web Designing Lab HC - 06 3 03 80 20 100

BCE320 Elective Lab SC - 06 3 03 80 20 100

BCE370 Java Lab HC - 06 3 03 80 20 100


Elective – I Elective – II

5BCA51: System Software 5BCA61: Multimedia Computing.

5BCA52: Data Mining & Warehousing 5BCA62: Software Testing & Quality Assurance.

5BCA53: Enterprise Resource Planning (ERP). 5BCA63: Mobile Communication.

5BCA54: Operation Research. 5BCA64: Compiler Design

5BCA55:Analysis& Design of Algorithms

5BCA65: Graph Theory


SYLLABUS BCA SEMESTER-I

TITLE: Fundamentals of Information Technology

Soft Core

Class Duration : 16 Weeks with 3 Hours a week = 48 Hrs

MARKS THEORY 80 + INTERNAL ASSESSMENT 20 = 100

UNIT I 20Hrs

Introduction to Electronics:

Atomic structure, Energy of an electron, Valence Electrons, Voltage source.(1 hr)

Semiconductor Materials:

Definition of a semiconductor. Types of semiconductors-Intrinsic and Extrinsic . P-type, N-

type, P-N junction.Transistor characteristics (configurations)-common base, common

collector, common emitter. NPN transistor as a voltage amplifier.

Integrated Circuits: Integrated Circuits classification, Types of Integrated Circuits.(7 hrs)

Fundamentals of Gates: Basic gates and Universal gates, combinational logic circuits, Half

adder, Full adder, Half subtractor and Full subtractor.

Flip-Flops: SR, D, JK AND T Flip-Flops.Decoders: 3 to 8 lines.Encoders:Octal to

Binary.Multiplexers:4 to 1 line..(8 hrs)

Boolean algebra: Basic laws, Demorgan’s theorem,sum of product method and products of

sum method. Karnaugh map.(4)

UNIT II 18 Hrs

Introduction to computers:

Generations of computers, Characteristics of computers- Speed, word length, storage,

accuracy, versatility .(2 hr)

Classification of digital computers:Microcomputers, Workstations, Portable computers-

Laptop/ Notebooks, PDA’s,Minicomputers, mainframe computers,Supercomputers.(1 hr)

Anatomy of Computers:Functions & Components of a Computer.(1 hr)

Memory Units:RAM-static,dynamic, ROM- PROM, EPROM, EEPROM,Difference between

RAM and ROM.Cache memory , flash memory.(2 hrs)

Auxiliary storage devices :Magnetic tape, Hard disk, Floppy disk, Optical disk, CD-ROM,

Magneto Optical disk drives.(2 hrs)

Input devices:Keyboard, Mouse, Trackball, Joystick, Digitizing tablet, scanners, digital

camera, Magnetic Ink character recognition(MICR), Optical Mark recognition(OCR), Bar

code reader, speech input devices, Touch screen, Touch pad, light pen.(2 hrs)

Output devices :Monitor, classification of Monitors,Type of Printers- Daisy wheel printer,

Dot matrix printer, Ink-Jet printer, Laser printer, LCD & LED printers, Line printer, Thermal

printer, Plotter, Sound cards and speakers .(2 hrs)

Number systems: Decimal number systems, Binary number systems, Compliments, Gray

code, Excess-3 code, ASCII Code, EBCDIC Code, Bits, bytes and words, Octal number

system,hexadecimal number system.(4 hrs)

Programming languages :Low Level language-machine language and assembly

language.High-level language- procedural oriented languages and application Generators.

Compilers, assemblers and Interpreters(1 hr)


UNIT III 10 Hrs

Operating System Fundamentals:

Definition for an operating system,Types of operating system, Functions of an operating

system-memory management,I/O management,File management,Process management

,Information management and security.

Network Fundamentals: Networking basics, Need for networking,types of networks, Basic

components of a network,Network topologies.

Database Management Systems:Basics of database,DBMS,field,Record,File,Database

languages-DML,DDL .

E-Commerce Basics : EDI the original method, Types of e-Commerce, benefits and

limitation of e-commerce, cyber banking, electronic payments, e-governance, m-commerce,

security in electronic payments,

Text Books

1. Peter Norton's 'Introduction to Computers', Second edition, TMH.

2. Computer Fundamentals - P K Sinha,BPB

3. Principles of Electronics-V.K.Mehtha.

Reference Books

1. Introduction to Computers - N Subramanian,TMH

2. Understanding Computers - R Rajagopalan. TMH

3. Computers Today - Donald Sanders, MGH

4. Computers Today - Suresh K Basandra, Galgotia

5. Digital fundamentals-Thomas.D.Floyd.

6. Basic Electronics – G.K.Mithal


BCA SEMESTER-I

TITLE: Information Technology and Digital Electronics Lab



1BCA7: Exercises should be based on IBCA3 & IBCA5.

List of Experiments/Programs

Part A:

1. Using Ms-Word with suitable examples, write the steps and execute the following with respect

to table handling 1. Creating a table (At least 4 Columns and 6 Rows).

2. Entering appropriate data into the table.

3. Sort the table.

4. Apply the formulas on table numeric values.

2. Using Ms-Word write the steps and execute for creating “Mail Merge” document for “FORM

LETTERS”.

3. Using Ms-Excel spread sheet, with suitable example, write steps and create worksheet called

“Employee” and calculate the following using formulas 1. Enter Employee Code, Name and Basic Salary.

2. Calculate DA (20% of Basic Salary).

3. Calculate HRA (10% of Basic Salary).

4. Calculate CCA (8.5% of Basic Salary).

5. Calculate Total Salary (Basic Salary + DA + HRA + CCA)

6. Calculate Deductions (10% of Total Salary).

7. Calculate Net Salary (Total Salary – Deductions).

4.Using Ms-Excel draw X-Y Line Chart and Bar Charts based on the following worksheet data

and write the steps

ITEM MONTHLY SALES

(in Thousands)

Cotton 2,750

Wool 3,100

Yarn 2,975

Jute 2,100

Fiber 3,010

5.Using Ms-Excel spreadsheet write the steps and execute the following:

RollNo StudName Marks1 Marks2 Mark3 Total Percentage Result

1. Create appropriate records

2. Calculate total and marks using formula.

3. Update result column using IF function.

(Result: Distinction, First Class, Second Class, Pass, Fail).

6. Using Ms-Access with suitable examples write steps and execute the following. 1. Create STUDENT database table.

2. Create appropriate records.

3. Add two more records to the table.

4. Delete 2nd record to the table.

5. View the records.


7. Using Ms-Access with suitable examples write steps and execute the following.

1. Create EMPLOYEE database table.

2. Create appropriate records.

3. Sort the records in ascending order of name.

4. Sort the records in descending order of salary.

5. View the records

8. Using Ms-PowerPoint with suitable examples write steps and execute the following: 1. Create presentation slides with Titles, Sub Titles and Charts choosing different

slide layouts.

2. Use Design templates for background.

3. Format the slide design.

9. Using Ms-PowerPoint with suitable examples write steps and execute the following:

1. Create presentation table slides using an organization chart.

2. Use different views such as slide view, slide sorter view and slide show view.

Part B:

1. Verification of Basic Gates (OR, AND, NOT) and EX-OR, EX-NOR.

2. Verification of Other Gates using only NAND Gates (Universal Gate).

3. Verification of other Gates using only NOR Gates (Universal Gate).

4. Realization of Boolean expression using NAND gates only.

5. Construction of Half Adder and Full Adders.

6. Construction of Half Subtractor and Full Subtractors.

7. Simplification of Boolean Expressions using Karnaugh Map method.

8. Implementation of SR, Clocked SR Flip Flops.

9. Implementation of JK, Toggle and Delay Flip Flops.

10. Shift Left and Shift Right Registers.

11. 4 bits Gray to Binary and Binary to Gray Converter.

12. Decimal to BCD encoder and BCD to decimal decoder.



TITLE: Computer Fundamentals & Problem Solving

Soft Core



UNIT-I 16 Hours

Introduction to Computers

History, Generations of Computers

Computer as multipurpose tool - Overview of the Computer system, Applications of computer,

looking inside the machine, parts of the computer, information processing cycle, computer shapes

and types of computer.

Interacting with Computer

The Keyboard - the mouse - other input devices - The monitor - Printers - Sound systems -

Connecting I/O devices to the Computer.

Storing information in a Computer

Types of storage devices - Magnetic storage devices, Optical Storage devices, measuring device

performance.

UNIT-II

Processing Data 16 Hours

Transforming data into information - How a Computer processes data - factors affecting

processing speed

Computer Software

Computer Languages, Types of Software, Operating System-Introduction, Types of Operating

System.Translators

Problem solving aspects – Introduction, Problem definition, Problem analysis, Design of

problem solution,Algorithm, Flowchart, Coding, Debugging, Program Documentation and

Program maintenance, Basic programming constructs - sequence, selection and iteration.

UNIT-III 16 Hours

Information System

What is an information System - types of information Systems — System development life cycle.

Database Management systems

Data and Information - the database - DBMS relationship-working with a database - creating

tables – Editing records -querying database - generating report.

Computers in Business

Why businesses need information — Types of business Software - Evolution of business

computing

Security

The Need for Computer Security, Basic Security Concepts, Threats to Users, Threats to

Hardware, Threats to Data, Taking protective measures – Protecting Yourself, Protecting your

privacy, Keeping your Data Secure.

Reference Books:

1. Peter Norton's 'Introduction to Computers', Second edition, TMH.

2. Dromey – How to solve it by computer –PHI

3. Computer Concepts and C Programming – P.B.KOTUR

4. Computer Fundamentals - P K Sinha, BPB



TITLE: Problem solving and programming in ‘C’

Hard Core



UNIT-I

Overview of C (4 Hours)

Importance of C, Sample C programs, Basic structure of C Programs, Programming style,

executing a C Program.

Constants, Variables, and Data Types (4 Hours)

Character set, C tokens, Keywords and identifiers, Constants, Variables, Data types,

Declaration of variables, Assigning values to variables ,Defining symbolic constants

Operators and Expression (6 Hours)

Arithmetic of Operators, Relational operators, Logical operators Assignment operators,

Increment and decrement operators, Conditional operator, Bit wise operators, Special

operators, Arithmetic expressions, Evaluation of expressions, Precedence of arithmetic

operators, Type conversions in expressions, Operator precedence and associatively,

Mathematical functions.

Managing Input and Output Operations (4 Hours)

Reading a character, writing a character, formatted input, formatted output

UNIT-II

Decision Making and Branching (4 Hours)

Decision making with IF statement, Simple IF statement, The IF ELSE statement, Nesting of

IF ... ELSE statements, The ELSE IF ladder, the switch statement, the ?: Operator, The

GOTO statement.

Decision Making and Looping (3 Hours)

The WHILE statement, The DO statement, The FOR statement, Jumps in loops

Arrays (3 Hours)

One-dimensional arrays, Two-dimensional arrays, Initializing two-dimensional arrays.

Handling of character strings (4 Hours)

Declaring and initializing string variables, Reading strings from terminal, Writing strings to

screen, Arithmetic operations on characters, Putting strings together Comparison of two

strings, String-handling functions, Table of strings


User-Defined Functions (5 Hours)

Need for user-defined functions, multi-function program, The form of C functions Return

values and their types, Calling a function Category of functions, Handling of non-integer

functions, Nesting of functions, Recursion, Functions with arrays, The scope and lifetime of

variables in functions.

UNIT-III

Structures and Unions (5 Hours)

Structure definition, giving values to members, Structure initialization Comparison of

structure variables, Unions, Size of structures

Pointers and File Handling (6 Hours)

Understanding pointers. Accessing the address of a variable, Declaring and initializing

pointers, Accessing a variable through its pointer, Introduction to File Processing, I/O

operations.

Text Books

1. Programming in ANSI C 2nd

Edition by E Balagurusawmi Published by Tata McGraw Hill.

Reference Books

1. Computer Programming in C by V Rajaraman, PHI, NewDelhi, 1995.

2. Programming in C by Hutchison.R, McGraw Hill, New York, 1990.

3. Application program in C by Johnsonburgh, R and Kalin,M.


BCA SEMESTER-I

TITLE: C Programming Lab Hard Core



1BCA9: ( Exercises should be based on IBCA6.)


Part A: 1. C program for given two numbers to perform arithmetic operations using switch

statement.

2. C program to find biggest of three number using nested if statement.

3. C program to find sum of the S=12 +22+32+................+n2 indirect method using looping

statement

4. C program to find sum of the S=1-2+3-4+5……….+n series by indirect method using

looping

1. statement

5. C program to find sum of the S=1+1/x+1/x2..............series upto 4 decimal places of

accuracy.

6. C program to check whether the given number is prime or not.

7. C program to print and count prime numbers from 2 to n.

8. C program to generate Fibonacci series up to n numbers

9. C program to check whether the given number is factorial of a number or not

10. C program to convert binary number to decimal number.

11. C program to convert decimal number to binary number.

12. C program to find the roots of the quadratic equation using else if statement.

2. C program to find the reverse of the given number. Also sum & count the number of

digits and check whether the given number is palindrome or not palindrome

13. C program to find largest and smallest of n numbers

14. C program to find second largest and second smallest of n numbers

Part B: 1. C program for sorting given set of numbers using bubble sort technique.

2. C program to search given number using linear search technique

3. C program to accept two square matrix and find sum of two matrices.

4. C program to print difference of two matrices.

5. C program to accept two matrices of order m*n and p*q to find product of two matrices

using function.

6. C program to check whether given number is Fibonacci or not.

7. C program to accept m*n matrix. To find trace and norm of square matrix and to print

principle

8. diagonal elements.

9. C program to accept m*n matrix to find sum of upper diagonal and lower diagonal

elements.

10. C program to find factorial of a number using recursive function

11. C program to find NCR and NPR using function.

12. C program to find LCM and GCD of two numbers.

13. C program to display transpose of given m*n matrix using function.


14. C program to swap two numbers using function and pointers.

15. C program to accept employee information and display the same using structure.

16. C program to create simple marks card assuming appropriate condition

17. C program to read and write information of an employee using a file.


BCA SEMESTER-I

TITLE: Accounting & Financial Management

Hard Core



UNIT1:

Accounting: Introduction: Principles, concepts and conventions, double entry system of

accounting, ledger keeping. (8 Hours)

UNIT II :

Subsidary books with special reference to simple cash book and three column cash book.

(10 Hours)

UNIT II:

Trial balance and final accounts of sole trader: Preparation of Trial balance, adjusting entries,

including revenue for bad debts, revenue for discount on debtstors and creditors, preparation

of final accounts. (15 Hours)

UNIT IV:

Meaning & scope of financial management, meaning & concepts of funds, preparation of

fund flow statement. (15 Hours)

Text Books:

1. Accountancy Vol 1 by B.S. Raman.

2. Accountancy Vol 2 by B.S. Raman.

3. Management Accounting by R.K. Sharma and Gupta.

4. Financial Management by i.M Pandey.

Reference Books:

1. Management Accounting by Reddy and Appanaiah.

2. Management Accounting by Maheshwari.

3. Cost Accounting by Jain and Narang.

4. Cost Accounting by M.N Arora.


BCA SEMESTER-II

TITLE: Data Structures and Algorithms

Hard Core



UNIT-1

Linear Data Structure and their sequential storage representation

(20 Hours)

Algorithmic notation, Concept and terminology for non-primitive Data structures, Storage

structures for arrays, Structures and arrays of structures, Stacks, Definitions and Concepts,

Operations on stacks, Applications of stacks, Recursion, Infix to postfix, Evaluating postfix

expressions, Queues, Priority Queues

Linear Data Structure and their Linked storage representation

Pointers and Linked Allocation, Linked linear lists, Operations on Linear lists using singly

linked storage structures, Circularly linked linear lists, Doubly linked linear lists

UNIT-II

Nonlinear Data Structures (14 Hours)

Trees - Definition and concepts, Operations on Binary Trees, Linked Storage Representations

of Binary Trees, Tree creation and Traversal

UNIT-III

Sorting and searching (14 Hours)

Sorting, Selection sort, Bubble sort, Merge sort, Quick sort, Radix sort, Searching, Sequential

searching, Binary searching, Search Tree

Text Books

1. An Introduction to Data Structures with Applications 2nd

edition - J.P.Trembly and

Sorenson, McGraw Hill 2001.

Reference Books

1. Data structures using C & C++ by Yedidyah Langsun, Moshe J Augenstein, Teneinbaum

published by Prentice Hall of India Ltd.

2. Algorithms + Data Structures = Programs by Niklaus Wirth Prentice Hall 1976.

3. Data structures and algorithms by Aho, A.V.,Hopcroft and Ullman,J.E., Addison Wesley,

1980.

4. Fundamentals of data structures by Horowitze,E and Sahni,S., Galgotia bookstore.

5. Data structures and program design by Robert,L.Krunse, PHI.

6. Data and File structures by Mary Lunis, PHI.

7. Theory and problems of Data structures by Seymour Lipshutz, McGraw Hill.


BCA SEMESTER-II

TITLE: Accounting & Financial Management (2BCA7)

Hard Core



UNIT1:

Difference between financial accounting and management accounting, Difference between

financial accounting and cost accounting, preparation of cost sheet. (15 Hours)

UNITII:

Marginal costing: concepts,Marginal cost equations,P/V ratio, B.E.P, Margin of safety, sales

to earn a desired profit, problems on the above. (7 Hours)

UNIT III:

Budgetary control: Meaning and definition, preparation of flexible budget and cash budget.

(14 Hours)

UNIT IV:

Standard costing: meaning of standard cost and standard costing, analysis of variances -

Material and labour variances. (12 Hours)

Text Books:

1. Accountancy Vol 1 by B.S.Raman.

2. Accountancy Vol.2 by B.S.Raman.

3. Management Accounting by R.K. Sharma and Gupta.

4. Financial Management by I.M.Pandey.

5.

Reference Books:

1. Management Accounting by Reddy and Appannaiah.

2. Management Accounting by Maheshwari.

3. Cost Accounting by Jain and Narang.

4. Cost Accounting by M.N. Arora.


BCA SEMESTER-II

TITLE: 2BCA8: Data Structure Lab

Hard Core



Exercises should be based on 2BCA3.


PART – A

1. Write an interactive program to search an element in the given linear array using

linear and binary searching technique and estimate the time and space.

2. Write a program to arrange numbers in ascending order using selection sort

3. Write an interactive program to insert an element at the given position and delete

an element at the specified position in the given array.

4. Write an interactive program to implement the following operations on stack

5. Program to implement Tower of Hanoi problem.

6. Write a program to arrange numbers in ascending order using merge sort.

7. Write a program to arrange numbers in ascending order using insertion sort.

8. Write a program to arrange numbers in ascending order using quick sort

9. Write program to evaluate a postfix expression.

10. Write a program to convert an expression from infix to postfix.

11. Write an interactive program to perform insertion and deletion operations in

Linear Queue.

PART - B

12. Write an interactive program to perform insertion and deletion operations in

Circular Queue.

13. Write a program to create a linked list .

14. Write a program which finds the location of an item in the unsorted linked list.

15. Write a program to insert a node in a linked list at the front end.(beginning)

16. Write a program to insert a node in a linked list anywhere in between

17. Write a program to delete an item from the linked list.


18. Write a an interactive program to implement stack operations using singly linked

list.

19. Write a an interactive program to implement queues operations using singly

linked list.

20. Program to create a binary tree and also print the preorder values.

21. Program to create a binary tree and also print the inorder values.

22. Program to create a binary tree and also print the postorder values.

23. Program to add two polynomials of one variable and ‘n’ degree and represent

them as linked list (DEMONSTRATION ONLY)


BCA SEMESTER-II

TITLE: Accountancy Lab (2BCA7)

Soft Core

Class Duration : 16 Weeks with 3Hours a week = 48 Hrs


2BCA9: Exercises should be based on 2BCA6.

1.Enter the following transaction in the books of WAMTECH the details are given below.

DATE PARTICULARS

1-4-07 Commenced business with cash Rs-25000

2-4-07 Opened account in vyshya bank Rs -4000

2-4-07 Purchased goods from Vijay on credit Rs-5000

1-5-07 Sold goods to shaker for cash Rs-900 and allowed discount of Rs-30

2-5-07 Sold goods to Raghu for cash Rs-700

1-6-07 Sold goods to Ramaniya on credit Rs-1000

2-6-07 Cheque received from Ramaniya Rs-800

2-6-07 Cash paid to Vijay Rs-3000

1-7-07 Purchased goods from jayavardhana on credit Rs-1000

2-7-07 Sold goods to Ravi on credit Rs-1000

2-8-07 Cash sales Rs-600

1-9-07 Drew cash from bank for office use cheque no 1248 for Rs-1200

2-9-07 Gave loan to Somnath Rs-375

1-10-07 Purchased goods from Shyam on credit Rs-450

2-10-07 Sold goods to Devakar for cash Rs-620

21-10-07 Purchased goods from saniya on credit Rs-1700

1-12-07 Paid salary to office boy Rs-250

2-1-08 Purchased stationary for cash Rs-35

1-2-08 Paid for general expenses Rs-72

2-2-08 Drew from bank for personal use Rs-900

2.Enter the following transaction in the books of CARLO SOFT DRINKS

DATE PARTICULARS


2-4-05 Opened account in vyshya bank Rs-3000

1-5-05 Purchased goods from Nagarjun on credit Rs-4000

2-5-05 Sold goods to Pattabi for cash Rs-800 and allowed discount of Rs-50

1-6-05 Cash paid to Nagarjun Rs-3000

2-6-05 Sold goods to Sirdesai on credit Rs-4000

1-7-05 Cheque received from Sirdesai no-54843 for Rs-4000

2-8-05 Cash purchased Rs-25000

1-9-05 Gave loan to Gurprakash Rs-1000

1-10-05 Paid office rent Rs-800







]

3.Enter the following transaction in the books of ONGC Company

DATE PARTICULARS

1-1-08 Commenced business with cash Rs-5,00,000

2-1-08 Opened account in HDFC bank Rs-1000

3-1-08 Paid interest Rs-1000

4-1-08 Loan taken for Aasha Rs-5000

5-1-08 Solar ltd has taken a loan from ICICI bank for Rs-6000

6-1-08 Paid electricity bill through cheque Rs-800

7-1-08 Interest paid to ICICI bank Rs-1000

8-1-08 Interest received from HDFC bank Rs-1000

9-1-08 Paid commission Rs-500

10-1-08 Paid premium Rs-300

11-1-08 Purchased furniture Rs-10000 by any bank a/c

12-1-08 Paid rent Rs-3000

13-1-08 Purchased goods from radhe company Rs-4000

14-1-08 Sold goods to alpha ltd Rs-6000

4.Enter the following transaction in the books of AKSHAY AND SON’S

DATE PARTICULARS


2-4-06 Deposited into bank Rs-4000

3-4-06 Furniture purchased for cash Rs-1500

4-4-06 Purchased goods for cash Rs-3000

8-4-06 Old furniture sold to Mr. Z Rs-6000

15-4-06 Paid taxes in cash Rs-3000

28-4-06 Received cash from Mr. Z Rs-30000

30-4-06 Bank interest credited Rs-4000


30-4-06 Paid salary Rs-7000

30-4-06 Paid for carriage Rs-150

30-4-06 Salary paid to watchman Rs-1000

30-4-06 Deposited in canara bank Rs-1000

5.Enter the following transaction in the books of TECH COM

DATE PARTICULARS


2-4-07 Opened account in Canara bank Rs-5000

2-4-07 Purchased goods from Ravi on credit Rs-3000

1-5-07 Sold goods for cash Rs-1200 and allowed discount of Rs-200

1-6-07 Cash paid to Ravi Rs-2000

2-6-07 Sold goods to Subramaniyam on credit Rs-5000

1-7-07 Cheque received from Subramaniyam no-879654 for Rs-5000

1-8-07 Cash purchased Rs-2000

2-8-07 Gave loan to Vijay kumar Rs-1000








6.Enter the following transaction in the books of PHILO SYSTEM

DATE PARTICULAR


2-1-12 Opened a/c in SBM Rs-1000

3-1-12 Purchased goods from Clinton Rs-500 and allowed a discount of Rs-20


5-1-12 Cash purchases Rs-500

6-1-12 Paid salary to watchman Rs-1000

7-1-12 Paid for postal charges Rs-100

8-1-12 Drew from bank for personal use cheque no-12345 for Rs-1000

9-1-12 Paid for internet charges Rs-1000


7.Enter the following transaction in the books of VIJAYA-E-AGENCIES

DATE PARTICULAR

1-4-09 Commenced business with cash Rs-75000 and deposited Rs-5000 in

canara bank

1-5-09 Purchased furniture for Rs-1500 and paid for advertisement Rs-1000

15-5-09 Purchased 4 TV’s from Samsung Rs-8000

1-6-09 Deposited in canara bank Rs-10000

2-6-09 Paid for luggage charges Rs-500

15-6-09 Sold Videocon washing machine to Jaffar siddique for Rs-6000

1-7-09 Paid internet charges Rs-2000


10-7-09 Paid electricity charges Rs-500

15-7-09 Telephone charges Rs-400

15-7-09 Rent Rs-750

25-7-09 Received from l & t 34000

3-8-09 Paid to jennica 10000

5-8-09 Drew for office use Rs-2500

10-8-09 Paid for jessy from canara bank Rs-4000

22-8-09 Sold good to Mr. Jonson Rs-4000



6-9-09 Received from joseph Rs-45000

3-10-09 Drew from bank for office use Rs-400

9-10-09 Sold goods to Santakumar Rs-4000

1-11-09 Purchased stationary from stationary world Rs-4000

2-11-09 Paid to Mahalakshmi sweets Rs-5000

11-11-09 Purchased goods from New style shop Rs-8000

15-11-09 Received cheque from soloman Rs-40000

25-11-09 Paid to Mr. David Rs-3000

1-12-09 Paid salay to office boy Rs-4000

22-1-10 Drew from canara bank for office use Rs-4000

26-3-10 Sold goods to New style shop on credit Rs-4000

30-3-10 Drew from bank for office use Rs-4000

25-1-10 Received cheque from Paul Rs-4000


8.Enter the following transaction in the books of BLUE MONT TRADERS And post them

into ledgers

LIABILITIES AMT ASSESTS AMT

Capital 6,50,000 cash 1,84,000

Sundry creditor Building & advances 80,000

Alana and sons 4,00,000 Kst deposite 9,000

Annapurna traders 78,000 Tele deposite 4,000

Geri traders 16,000

Krishna Geri 27,000 Fixed assets

Building 1,52,000

Gowdown 1,70,000

Sundry debtors

Anil agencies 22,000

Mahesh agencies 30,000

Balaji agencies 25,000

Arjun cement 1,82,000

Closing stock 3,13,000

Total 11,71,000

Vouchers

->1-4-07 invoice no 206 for Rs 14000 cement purchased from allana and sons.

->1-6-07 cash received from anil agencies Rs 22,000

->1-7-07 credit bill on 001 steel sold to balaji ent Rs-58,000

->2-7-07 cash deposited in ICICI bank Rs-12,000

->1-9-07 Rs-6000 transferred as interest cheque no 577445

->1-2-07 paid telephone charges Rs-4255

->31-3-07 depreciation on building by 20%

->1-8-07 canara bank cheque no 9213 received from balaji enterprises of Rs-25,000

9.Enter the following transaction in the books of SUMAN BISCUITS AGENCIES

For the year 1-4-07

LIABILITIES AMT ASSESTS AMT

Capital 7,81,723.42 Cash 2,23,000

Sundry debtor Deposits

Quality biscets 3,60,000 Quality biscets 90,000

Nutrine confectionery 58,865 Kst deposite 2,000

Madhu Kumar 14,400 Nutrine confectionery 1,28,204

Building advances 24,000 Telephone deposits 2,000

SBI-BONUS-OCC 1,20,521 Fixed assests

Building 1,24,000

Gowdown 1,20,520

Sundry debtor

Janardhan 18,000

Kiran agencies 15,000

Krishna murthy 12,000

Praveen kumar 19,000

Pretham 15,000

Sk traders 1,72,829

Closing stock 36,57,434.66


Vouchers:

1-4-07 invoice no 511 for Rs-12,800 biscuits purchased from quality biscets.

1-6-07 cash recived from kiran agencies Rs-15,000

1-7-07 freight charges Rs-325

2-7-07 cash deposited in ICICI bank Rs-1,20,000

1-8-07 canara bank cheque no 9213 recived from balaji enterprisers Rs-25,000

1-9-07 Rs-6,000 transferred from current a/c as interest cheque no 56445

1-2-07 paid telephone charges Rs-4255

31-3-07 depreciation on building by 20%


BCA SEMESTER-III

TITLE: OPERATING SYSTEMS(2BCA4)

Soft Core



UNIT-I

Introduction (16 Hours)

Operating System, Simple Batch Systems, Multi programmed Batched Systems, Time-

Sharing Systems, Real-Time Systems, System Components, Operating system services

File System

File concept, Access Methods, Directory Structure, File-System Structure, Allocation

Methods, Free-Space Management, and Protection of file system.

Process

Process Concept, Process Scheduling, Cooperating process, Threads CPU Scheduling

Basic concepts, Scheduling criteria, Scheduling algorithms

UNIT-II

Process Synchronization (16 Hours)

The Critical section problem, Synchronization Hardware, Semaphores, Classical Problems of

Synchronization

Deadlocks

Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,

Deadlock Avoidance, Deadlock Detection , Recovery from Deadlock

UNIT-III

Memory Management (16 Hours)

Logical versus physical address space, Swapping, Contiguous Allocation, Paging,

SegmentationVirtual Memory

Demand Paging, Page Replacement, Page-Replacement Algorithms, Allocation of Frames

Text Books

1.Operating System Concepts – 5th

edition by Abraham Silberschartz and Peter Galvin,

McGraw Hill, 2000

Reference Books

1. Operating System Design and Implementation by Andrew S Tanenbaum - Prentice Hall

India, 1990.

2. Operating system principles by Brinch Hansen. P., PHI.

3.Operating systems by Milan Milenkovic., McGraw Hill.

4.Logical design of operating systems by Show.A., PHI


BCA SEMESTER-III

TITLE: COMPUTER ORGANIZATION(2BCA4)

Soft Core



UNIT-1

1. Basic Structures of Computers: Computer types, Functional Units-Input unit,

Memory unit, Arithmetic and logic unit, Output unit, Control unit, Basic operational

concepts, Bus structures, Microprocessor and Multicomputers. (07)

2. Storage Representation: Storage representation of characters, Memory locations

and addresses-Byte addressability, Memory operation.

(07)

UNIT-II

1. Addressing modes: Direct, Indirect, Immediate, Relative, Indexed. (06)

2. Instruction Formats: Zero address,One address, One-and-half address, Two address,

Three address. (06)

3. Instruction types: Data transfer, Arithmetic, Branching, Logical, Rotate, Stack

operations, Input/output and Machine control instructions. (08)

UNIT-III

4. Input/output Organization: Accessing Input/output devices, Interrupts, Direct

Memory Access (DMA), Buses-Synchronous bus, Asynchronous bus, Interface

circuits-Parallel port, Serial port.

5. Memory System:Basic concept, Random Access Memories – Static RAM,

Asynchronous DRAMs, Synchronous DRAMs, Read Only Memories – PROM,

EPROM, EEPROM, Flash Memory, Cache Memory, Virtual memories, Secondary

storage – Magnetic hard disks, Optical disks. (09)

6. Arithmetic: Addition and Subtraction of Signed numbers. (05)

Text Books:

1. Carl Hamacher, Z. Varnesic& S. Zaky, Computer Organization, 5th

Edition,

McGraw Hill, 2002.

Reference Books:

1. Logic and Computer Design Fundamentals, 2nd

Edition, M.Moris Mann &

Charles R. Kime, 2001, Pearson Education Asia.


BCA SEMESTER-III

TITLE: Microprocessors (2BCA5)

Hard Core



43BCA5: Microprocessors

UNIT-1

1. Introduction: Simple model of microprocessor – Counter, Decoder A, Register Array, Common

Bus, Register I, Decoder B, Control unit, Switch control circuit, ALU, Operation.

Different Phases in the execution process – Fetch, Decode, Execute. (07)

2. The 8085 Microprocessor: Features and Architecture of 8085 – Registers, Arithmetic Logic Unit, Instruction

Decoder, Address Buffer, Data Buffer, Increment/decrement address latch, Interrupt

control, Serial I/O control, Timing and Control circuitry.

Pin Definitions of 8085 – Power supply and frequency signals, Data bus and address

bus, Control and status signals, Interrupt signals, Serial I/O signals, DMA Signal,

Reset signals. (10)

UNIT-II

3. 8085 Instruction Set and Programming: Instruction formats, Opcode formats, Addressing modes.

8085 Instruction Set – Data transfer group, Arithmetic group, Branch group, Logic

group, Stack operations, Input/output and machine control group.

Passing parameters, Subroutine. (10)

4. Instruction Timing Diagrams: Instruction cycle, Machine cycle and T-state

(Introduction Only). (04)

UNIT-III

5. 8085 Interfacing: I/O Interfacing – I/O mapped I/O, I/O mapped selection, Memory

mapped I/O. (05)

I/O transfer techniques (Introduction only).

6. 8085 Interrupts: Maskable and non-maskable interrupts. Hardware and Software

interrupts. (06)

7. Introduction to 8086, advantages over 8085, additional features of 8086, modified

addressing schemes. (06)

Text Books:

1. Ramesh S. Gaonkar – Microprocessor Architecture, Programming and

Application with 8085 – Penram International Publishing (India).

Reference Books:

1. Barry B Brey – The Intel Mircroprocessor Systems: The 8086 / 8088 family

architecture, programming and designing – PHI Publication.

2. Mircroprocessor 8085 and Peripherals by A.P. Godse, Technical Publication.

3. John Uffenbeck, Micro Computers and Microprocessor, PHI.

4. M. Morris Mono – Digital logic and Computer design, PHI Pvt. Ltd., New Delhi.


BCA SEMESTER-III

TITLE: Object Oriented Programming with C++ (2BCA6)

Hard Core



3BCA6: Object Oriented Programming with C++

UNIT-1

1. Introduction: Procedure-oriented programming, Concepts of Object-oriented

programming, Structure of C++ program. (04)

2. Fundamentals: Tokens, Keywords, Identifiers and constants, Basic Data Types,

User-defined data types, Derived data Types, Symbolic constants, Type compatibility,

Declaration of variables, Dynamic initialization of variables, Reference variables,

Operators in C++, Scope resolution operator, Member dereferencing operators,

Memory management operators, Manipulators, Type cast operator, Expressions and

their types, Special assignment expressions, Implicit conversions, Operator

overloading, Operator precedence, Control structures. (07)

3. Functions: The main function, Function prototyping, Call by Reference, Return by

Reference, Inline functions, Default arguments, const arguments, Function

overloading, Friend and Virtual functions. (05)

UNIT-II

4. Classes and Objects: Specifying a Class, Defining member functions, Making an

Outside function Inline, Nesting of member functions, Private member functions,

Arrays within a Class, Static data members, Static member functions, Arrays of

Objects, Objects as function arguments, friendly functions, Returning Objects, const

member functions, Pointers to members. (07)

5. Constructors and Destructors: Constructors, Parameterized constructors, Multiple

constructors in a class, Constructors with default arguments, Dynamic initialization of

objects, Copy constructor, Dynamic constructor, Constructing Two-dimensional

arrays, const Objects, Destructors. (06)

6. Operator Overloading and Type Conversions: Defining operator overloading,

Overloading unary operators, Overloading Binary operators, Rules for overloading

operators, Type conversions. (04)

UNIT-III

7. Inheritance and Polymorphism: Programming concepts and types. (04)

8. Console I/O Operations: C++ streams, C++ stream classes, Unformatted I/O

operations, Formatted I/O operations, managing output with manipulators. (05)

9. Files: Classes for file stream operations, opening, reading, writing, closing, detecting

end of file. (06)

Text Books:

1. Object Oriented Programming with C++ - E. Balagurusamy.

Reference Books:

1. OOPS and C++ by Robert Lafore.

2. C++ by Stephen Prata.

3. Teach yourself c++ by Al Stevens.

4. C++ Primer by Stanley B Lippman.


BCA SEMESTER-III

TITLE: Microprocessors lab(2BCA5)

Hard Core



Exercises should be based on 3BCA5.

Part A

1. Program to copy the content of two register into different memory location.

2. Subtraction of 2 8-bit numbers

3. Swapping of 2 8-bit data using direct and indirect mode.

4. Addition of 2 8-bit numbers with carry

5. Multiplication of 2 8- bit numbers

6. Division of 2 8-bit numbers.

7. Program to find the largest of two 8-bit numbers.

8. Program to check whether given number is even or odd,if it is even display FF else

display 00

9. Program to find the 1’s and 2’s complement of given 8-bit number.

10. Program to exchange the content of two register pairs, using XCHG and store these

numbers

11. into different memory location.

12. Program to find the sum of N natural numbers.

13. Progarm to generate the series of all numbers up to N.

Part B

1. Progaram to transfer the set of data from one set of memory location to another set of

memory location.

2. Program to generate Fibonacci series up to N

3. Addition of two 16-bit numbers

4. Subtraction of two 16- bit numbers.

5. Program to convert hexa decimal to BCD.

6. Program to find the largest of N numbers.

7. To sort the numbers in ascending order.

8. To search an element in a list

9. To sort numbers in descending order

10. To find the square of given number.

11. To find the number of 1’s and 0’s in a given 8-bit date

12. To find the sum of N numbers.

13. To count numbers from 0 to 99 with delay


BCA SEMESTER-III

TITLE: Object Oriented Programming lab with C++ (2BCA6)

Hard Core



1. C++ Program to calculate average of three numbers

2. C++ Program to find the biggest of three numbers

3. C++ Program to find minimum and maximum of two numbers

4. C++ Program to check whether the number is palindrome or not

5. C++ program to sum of all even and odd numbers

6. C++ Program to perform arithmetic operations using classes and objects

7. C++ Program to define a student class with username, total, average for n students

8. C++ Program to illustrate the use of static member function

9. //To develop a class called employee with ssn and name as the class member and a

static data member to automatically generate employee sequence ,the class should

have the static member function to display the total strength.

10. C++ program to find mean value of n numbers

11. C++ program to show the use of copy constructor

12. C++ program to illustrate multiple inheritance

13. C++ program to illustrate pointers to objects.

14. C++ program to read a string with getline function.

15. C++ program to display string with write() function.

16. C++ program to specify field size with using width function.

17. C++ program to accept two times (hh.mm.ss) to find subtraction of two times.

18. C++ program to implement banking scheme

19. C++ program to show the use of overloaded constructor

20. C++ program to construct variables at run time using dynamic initialization of

constructors

21. C++ program to find the largest value among the set of parameters using overloaded

fuction.

22. C++ program to add two complex number using operator overloading.

23. C++ program to demonstrate single inheritance with public

24. C++ program to implement multilevel inheritence

25. C++ program to illustrate the implementation of virtual base class.

26. C++ program to illustrate the use of array of pointer to objects

27. C++ program to implement reading and writing class objects using files.


BCA SEMESTER-IV

TITLE: Numerical Analysis and Statistics(4BCA3)

Hard Core



UNIT-I

1. Computer Arithmetic: Floating point representation of numbers, arithmetic operations

with normalization. Approximation and Errors – Significant figures, Accuracy and

precision, Round off errors, Truncation errors. (08)

2. Finding the roots of an equation: Iterative method: Bisection method, Newton

Raphson method, Regula Falsi method, Secant Method. (06)

3. Solving simultaneous linear equations: Gauss Elimination method. Gauss Jordon

method, and Gauss-Seidel iterative method. (06)

UNIT-II

4. Ordinary differential equations: Taylor series, Euler method, Range Kutta II and IV

order methods. (05)

5. Numerical Integration: Simpson’s 1/3 and 3/8 rule, Trapezoidal rule. (05)

6. Interpolation: Difference Table, Newton’s Forward and Backward interpolation.

(04)

UNIT-III

7. Descriptive Statistics: Need for quantifying data. Quantitative and qualitative data.

Frequency distributions – discrete and continuous, Histogram, frequency curve,

cumulative frequency curve. (06)

8. Measures of central tendency: Mean, median and mode. Measures of dispersion –

quartile deviation, standard deviation, coefficient of variation (Partition values –

quartiles, deciles and percentiles). (06)

9. Correlation and Regression: Definition, explanation of concepts, problems.

(04)

Text Books:

1. Numerical Methods by Jain M.K., S.R.K. Iyengar and R.K. Jain.

2. Computer Oriented Numerical Methods by Rajaraman. V.

3. Fundamentals of Mathematical Statistics by Gupta and Kapoor (Sultan Chand).

Reference Books:

1. Numerical Methods by S.S. Sastry.

2. Probability and Statistics for engineers and scientists by Ronald E. Walpole and

Raymond H Mayers.

3. Mathematical Statistics by John Freund (Prentice Hall India Pvt. Ltd.)


BCA SEMESTER-IV

TITLE: Database Management Systems (4BCA4)

Hard Core



UNIT-1

Introduction to Database System Concepts and Architecture (16 Hours)

Databases and Database Users, Characteristics of the Database Approach, Advantages of

Using a DBMS, Implications of the Database Approach

Data Models, Schemas, and Instances, DBMS Architecture and Data Independence,

Database Languages and Interfaces, The Database System Environment, Classification of

Database Management Systems

Data Modeling Using the Entity-Relationship Model

High-Level Conceptual Data Models for Database Design, Entity Types, Entity Sets,

Attributes, and Keys, Relationships, Relationship Types, Roles, and Structural Constraints,

Weak Entity Types, ER Diagrams, Naming Conventions, and Design Issues

UNIT-II Record Storage and Primary File Organizations (16 Hours) Secondary Storage Devices, Parallelizing Disk Access Using RAID Technology, Buffering of

Blocks, Placing File Records on Disk, Operations on Files, Files of Unordered Records (Heap

Files), Files of Ordered Records (Sorted Files), Hashing Techniques, Other Primary File

Organizations

Relational Data Model, Relational Constraints, and Relational Algebra

Relational Model Concepts, Relational Constraints and Relational Database Schemas, Update

Operations and Dealing with Constraint Violations, Basic Relational Algebra Operations,

Additional Relational Operations, Examples of Queries in Relational Algebra.

UNIT-III

SQL-The Relational Database Standard (16 Hours)

Data Definition, Constraints, and Schema Changes in SQL2, Basic Queries in SQL, More

Complex SQL Queries, Insert, Delete, and Update Statements in SQL, Views (Virtual

Tables) in SQL, Specifying General Constraints as Assertion, Additional Features of SQL

Text Books

1.Fundamentals of Database Systems by Navate and Elamsri – Addison Wesley 2000.

Reference Books

1.Database Systems Concepts, 3rd

edition by Abraham Silberschatz, Henry Korth and S.

Sudarshan McGraw Hill International Editions.

2.Introduction to Database systems by CJ Date, Published by Addison-Wesley.

3.Principles of database systems by Ullman,.computer science press, 1984.

4.Introduction to database systems by Bipin C.Desai, Galgotia.

5.Visual basic for windows by Garry Cornell, McGraw Hill, 1992.


BCA SEMESTER-IV

TITLE: Database Management Systems lab(4BCA4)

Hard Core

Activity 1:

Database : Student (DDL, DML statements)

Table: Student

Table: Course

Table: Section

Table: Grade_report

Create Tables using create statement

Insert rows to individual tables using insert statement

Alter table section add new field section and update the records

Delete brown’s grade report

Drop the table section

Activity 2: (Select clause, Arithmetic Operators)

Database: employee

Create Following tables and insert tuples with suitable constraints

EMPLOYEE


EMPSALARY

Write queries for the following

1. To display FIRSTNAME, LASTNAME, ADDRESS AND CITY of all employees living in

PARIS.

2. To display the content of employee table in descending order of FIRSTNAME

3. Select FIRSTNAME and SALARY of salesman

4. To display the FIRSTNAME,LASTNAME, AND TOTAL SALARY of all employees from

the table

EMPLOYEE and EMPSALARY. Where TOTAL SALARY is calculated as

SALARY+BENEFITS

5. List the Names of employees, who are more than 1 year old in the organization

6. Count number of distinct DESINGATION from EMPSALARY

7. List the employees whose names have exactly 6 characters

8. Add new column PHONE_NO to EMPLOYEE and update the records

9. List employee names, who have joined before 15-Jun-08 and after 16-Jun-07

10. Generate Salary slip with Name, Salary, Benefits, HRA-50%, DA-30%, PF-12%, Calculate

gross.

Order the result in descending order of the gross.

Activity 3: (Logical, Relational Operators)

Database: Library

Create Following tables and insert tuples with suitable constraints

Table: Books


Table : Issued

Write queries for the following

1. To show Book name, Author name and price of books of First Publ. publisher

2. Display Book id, Book name and publisher of books having quantity more than 8 and price

less than

500

3. Select Book id, book name, author name of books which is published by other than ERP

publishers

and price between 300 to 700

4. Generate a Bill with Book_id, Book_name, Publisher, Price, Quantity, 4% of VAT “Total”

5. Display book details with book id’s C0001, F0001, T0002, F0002 (Hint: use IN operator)

6. Display Book list other than, type Novel and Fiction

7. Display book details with author name starts with letter ‘A’

8. Display book details with author name starts with letter ‘T’ and ends with ‘S’

9. Select BookId, BookName, Author Name , Quantity Issued where Books.BooksId =

Issued.BookId

10. List the book_name, Author_name, Price. In ascending order of Book_name and then on

descending

order of price

Activity 4: (Date Functions)

Database : Lab

Create Following table and insert tuples with suitable constraints

(Use date functions and aggregate functions)

1. To select the ItemName purchase after 31/10/07

2. Extend the warrenty of each item by 6 months

3. Display Itemname , Dateof purchase and number of months between purchase date and present

date

4. To list the ItemName in ascending order of the date of purchase where quantity is more than 3.

5. To count the number, average of costperitem of items purchased before 1/1/08

6. To display the minimum warranty , maximum warrenty period

7. To Display the day of the date , month , year of purchase in characters

8. To round of the warranty period to month and year format.

9. To display the next Sunday from the date ’07-JUN-96’

10. To list the ItemNaName, which are within the warranty period till present date

Activity 5: ( Numeric, character functions)


Use Functions for the following

1. Find the mod of 165,16

2. Find Square Root of 5000

3. Truncate the value 128.3285 to 2 and -1 decimal places

4. Round the value 92.7683 to 2 and -1 decimal places

5. Convert the string ‘Department’ to uppercase and lowercase

6. Display your address convert the first character of each word to uppercase and rest are in

lowercase

7. Combine your first name and last name under the title Full name

8. A) Take a string length maximum of 15 display your name to the left. The remaining space

should be

filled with ‘*’

9. Take a string length maximum of 20 display your name to the right. The remaining space

should be

filled with ‘#’

10. Find the length of the string ‘JSS College, Mysore’

11. Display substring ‘BASE’ from ‘DATABASE’

12. Display the position of the first occurrence of character ‘o’ in Position and Length

13. Replace string Database with Datatype

14. Display the ASCII value of ‘ ‘ (Space)

15. Display the Character equivalent of 42

Activity : 6 (set operators)

Database : subject


Table – Physics

Table – Computer Science

1. Select all students from physics and Computer Science

2. Select student common in physics and Computer Science

3. Display all student details those are studying in second year

4. Display student those who are studying both physics and computer science in second year

5. Display the students studying only physics

6. Display the students studying only Computer Science

7. select all student having PMCs combination

8. select all student having BCA combination

9. select all student studying in Third year

10. Rename table Computer Science to CS


Activity 7: (views)

Database: Railway Reservation System


Table: Train Details

Table : Availability

1. Create view sleeper to display train no, start place, destination which have sleeper class and

perform the following

a. insert new record

b. update destination=’Manglore’ where train no=’RJD16’

c. delete a record which have train no=’KKE55’

2. Create view details to display train no, train name, class

3. Create view total_seats to display train number, start place, use count function to no of seats ,

group by start place and perform the following

a. insert new record

b. update start place=’Hubli’ where train no=’JNS8’

c. delete last row of the view

4. Rename view sleeper to class

5. Delete view details

Activity 8 (group by, having clause)

Database: Bank system


Table: Account


Table: Branch

Table: Depositor

Table: Loan

1. Display Total Number of accounts present in each branch

2. Display Total Loan amount in each branch

3. Display Total deposited amount in each branch by descending order

4. Display max , min loan amount present in each city.

5. Display average amount deposited in each branch , each city

6. Display maximum of loan amount in each branch where balance is more than 25000

7. Display Total Number of accounts present in each city

8. Display all customer details in ascending order of brachid

9. Update Balance to 26000 where accno=AE1003996

10. Display Customer Names with there branch Name

Activity 9: (Nested Query)

Database : Book Dealer Table : Author


Table : Publisher

Table : Category

Table : Catalog

Table : Order Details

1. List the other publications located where PEARSON publication is located

2. List the book with maximum price

3. Display book details having quantity=25

Author_id A_Name City Country

EE10258 Sudaker Samuel Bangalore India

PE96358 Natarasu Kolkata India

LT45879 Tenenbaum Toranto Canada

PW56325 Sumitabha Das Kolkata India

KA56983 Galvin Loss Angles USA 53

4. Display the author details those who are publishing with PHI publisher

5. Display the Books details published for ‘CSE’ category

6. Display the author details those who publish in Indian publications

7. Display book details those who have orders less than 20

8. Display all the books published under ‘CSE’ & ‘ISE’ category

9. Delete book details of order_no=56

10. Alter table order details add new column order_date & update the columns


Activity 10:

Database: Mobile Shoppe (Using Joins)


Table: Mobile Handsets

Table: Connection Details

1. Display Customer Name, Handset Model, connection, Validity of the connection

2. Display All Mobile Handsets along with Connection and Activation date

3. Display all Connection Details along with handset model and Handset purchase date

4. Display The Handset Details which is having highest amount than Samsung handset

5. Display Customer Name, Handset Model, connection, Validity which is having validity of

one year

6. Display Customer number, customer name, connection and activation date of connections

activated

between 01-Jan-08 to 30-Dec-09

7. Display Customer number, Model, Connection which is having ‘Airtel’ Connection

8. Display Customer number, Model, Connection which is having model is Nokia and

connection is Airtel

9. Select Customer number, customer name and model which is having price more than

model Samsung

10. Perform Cartesian join on Mobile Handsets and Connection details table


BCA SEMESTER-IV

TITLE: Numerical Analysis and Statistics(4BCA3)

Hard Core



1. Program to find the Mean of Individual series

2. Program to find the Mean of discrete series

3. Program to find the Mean of group data

4. Program to find the Median of Individual

5. Program to find the Median of discrete

6. Program to find the Median of group data

7. Program to find the Mode of discrete series using mean and median

8. Program to find the range and co-efficient range for the given values

9. Program to find the Inter quartile range for group data

10. Program to calculate the Standard Deviation in individual series

11. Program to calculate the Standard Deviation in discrete series

12. Program to calculate the Standard Deviation in group data

13. Co-relation

14. Regression

15. Program to find the roots of equation using Bisection method

16. Program to Evaluation of a Polynomial

17. Program to find the roots of equation using Newton-Raphson method

18. Program to find the roots of equation using Secant Method

19. Program to find the roots of equation using Regular Falsi Method

20. Program to solve the simultaneous equation using Gauss elimination Method

21. Program to solve the simultaneous equation using Gauss seidel Method

22. Program to find the solution using Euler’s Method

23. Program to find the solution of Differential equation using Rangue Kutta IV/II order

Method

24. Program to find the solution of the differential equations using Simpson’s 1/3 order

Method

25. Program to find the solution of the differential equation using Trapezoidal Method.


BCA SEMESTER-IV

TITLE: PROGRAMMING WITH VISUAL BASIC.NET(4BCA5)

Hard Core



4BCA5–PROGRAMMING WITH VISUAL BASIC.NET

(THE SYLLABUS IS BASED ON THE VISUAL STUDIO 2003)

(6 hrs)

UNIT–I

Introduction to .NET, .NET Framework features & architecture, CLR. Introduction to visual

studio, Project basics, types of project in .Net, IDE of VB.NET- Menu bar, Toolbar,

Solution Explorer, Toolbox, Properties Window, Form Designer, Output Window, Object

Browser. Event drive Programming -Methods and events.

UNIT–II (12 hrs)

The VB.NET Language- Variables -Declaring variables, Data Type of variables, Forcing

variables declarations, Scope & lifetime of a variable, Constants, Arrays, types of array,

control array, Collections, Subroutines, Functions, Passing variable Number of Argument

Optional Argument, Returning value from function. Control flow statements: conditional

statement, loop statement. Msgbox & Inputbox.

UNIT– III (12 hrs)

Working with Forms : Loading, showing and hiding forms, controlling One form within

another. GUI Programming with Windows Form: Textbox, Label, Button, Listbox,

Combobox, Checkbox, PictureBox, RadioButton, Panel, scroll bar, Timer, ListView,

TreeView, toolbar, StatusBar.There Properties, Methods and events. OpenFileDilog,

SaveFileDialog, FontDialog, ColorDialog, PrintDialog. Link Label. Designing menues :

ContextMenu, access & shorcut keys.

UNIT–IV (6 hrs)

Object oriented Programming: Classes & objects, fields Properties, Methods & Events,

constructor, inheritance. Access Specifiers: Public Private, Protected. Overloading, My Base

& MyClass keywords.Exception Handling.

UNIT–V (12 hrs)

Database programming with ADO.NET –Accessing Data using Server Explorer. Creating

Connection, Command, Data Adapter and Data Set with SQLDB. Display Data on data

bound controls, display data on data grid. Generate Reports Using CrystalReportViwer.

TEXT & REFERENCE BOOKS :

VB.NET Programming Black Book by steven holzner –dreamtech publications

Mastering VB.NET by Evangelos petroutsos- BPB publications

Introduction to .NET framework-Worx publication

4BCA6:Numerical Analysis and Statistics Lab

4BCA7:Database lab

4BCA8 VB.NET lab


BCA SEMESTER-IV

TITLE: PROGRAMMING WITH VISUAL BASIC.NET lab(4BCA5)

Hard Core



1. Create an console Application to demonstrate arithmetic operations using proedures.

2. Create an Console Application to demonstrate select case statement with given options

3. Create an Console Application to perform search on array and display its frequency and

positions in the array.

4. Create an Console Application to sort given array

5. Create an Console Application to display transpose of the given matrix

6. Create an Console Application to demonstrate String Functions

7. Create an Console Application to calculate monthly wages of the employee

8. Create an Console Application to implement stack operation

9. Create an Console Application to demonstrate single inheritance

10. Create an Console Application to demonstrate hierarchical inheritance

11. Create an Console Application to demonstrate interface.

12. Create an Console Application to demonstrate Namespace

13. Create an Console Application to demonstrate Event

14. Create an Console Application to demonstrate Property

15. Create a Windows Application to demonstrate Text Formatting

16. Create a Windows Application to demonstrate Arithmetic Operation

17. Create a Windows Application to demonstrate following validation. 1. Roll No. should autogenerate.

2. In Name Textbox only text must be entered.

3. In Subject Textbox only text must be entered

4. Total, grade and average must not be editable.

18. Create a Windows Application to demonstrate Simple Calculator.

19. Create a Windows Application to demonstrate Combobox Control.

20. Create a Windows Application to demonstrate Listbox Control.

21. Create a Windows Application demonstrating Connected Database with SQL

22. Create a Windows Application demonstrating Disconnected Database using DataAdapter

23. Create a Windows Application to generate Crystal Report.

24. Create a Windows Application to demonstrate quiz and using Menu (two options available:

Quiz,Exit).

25. Create a Windows Application demonstrating Login Form(Along with Create Account).


BCA SEMESTER-V

TITLE: Computer Network (5BCA1)

Soft Core



5BCA1: Computer Network

UNIT I: 15 Hrs.

Data Communication, Component and Basic Concepts –

Introduction, (3).

Characteristics – Delivery, Accuracy, Timeliness and Jitter (4).

Components – Message, Sender, Receiver, Transmission medium and protocol (4-5).

Types of Connection/Line Configuration – Point-to-point and Multipoint (8).

Topology – Mesh, Star, Tree, Bus, Ring and Hybrid Topologies (8-13).

Transmission modes – Simplex, Half Duplex, Full Duplex (6-7).

Categories of networks – LAN, MAN, WAN and Intranet (13-16).

Layered Task:

OSI Model:

Layers in OSI Model

Peer-to-Peer Protocol

TCP/IP Protocol Suite:- FTP,Telnet.

IP Utilities:ipconfig,netstat,ping

Addressing: Physical,Logical,Port,Specific

UNIT-II 15hrs

Data & Signals:

Bandwidth,bit rate

Digital Representation of Information

Maximum data rate

For Noisy Channel- Shannon

For Noiseless Channel- Nyquist

Digital Transmission Mode

Parallel Transmission

Serial Transmission

Multiplexing – An Introduction (161).

Types of Multiplexing – Frequency-division multiplexing,Time-division multiplexing

Wavelength division multiplexing

Transmission Media – An Introduction (191)

Guided Media – Twisted pair cable – Unshielded and shielded twisted pair cable, Co-

axial cable, Optical fiber cable – Structure and propagation.

Random access:- Pure ALOHA,Slotted ALOHA

Error Detection – (Data Communication & Networking-Forouzan 3rd

Edition )

Types of Error

Detection

Vertical Redundancy Check

Longitudinal Redundancy Check

Cyclic Redundancy Check

Checksum

Error Correction.


UNIT– III 10 Hrs.

Local Area Network-LAN Structure

LAN Bridges- Transparent Bridges,Source-Routing Bridges,Mixed Media Bridges

Packet Switching Networks-

Network Services & Internal network Operations

Packet Network Topology

Datagram & Virtual Circuits

Connectionless Packet Switching

Virtual-Circuit Packet Switching

Structure of a Packet Switch

Routing in Packet Networks

Routing Algorithm Classification

Routing Tables

Shortest Path Routing

Flooding

Congestion Control Algorithm

UNIT– IV 8hrs

Wireless LAN

IEEE 802.11- Architecture

Blue tooth – Architecture

Wireless WAN

Cellular Network

Frequency reuse principle, Transmitting, Receiving, Roaming, First

Generation

Satellite Network

Orbit, Foot print, categories of sattelite – GEO, MEO, LEO

Network Layer:Internet Protocol

IPV4-Datagram,Fragementation

IPV6-Format

Transport Layer

Transport Layer Services

TCP - TCP Services-Well Known Ports for TCP , Segment Format

UDP -Well Known Ports for UDP,User Datagram,Use of UDP

Application Layer-DNS

Text Book

1. Data Communication & Networking-Behrouz A Forouzan(UNIT-1,2,4)

2. Fundamental Concepts & key architecture-Albert Leon-Garcia & Indra Widjaja(Unit-

3)

3. Comuter Networks- Andrew Tanenbaum(UNIT3)


BCA SEMESTER-V

TITLE Network Security

Soft Core



Cryptography and Network Security

Objectives

· To introduce the principles and practices of cryptography and network security.

· To discuss algorithms and schemes to handle the security issues.

· To introduce web security.

UNIT I (16 hours)

Introduction: Security basics , Aspects of network security , Attacks. Cryptography: Basic

Encryption & Decryption, Transposition & substitution ciphers , Symmetric key algorithms

– Fiestel Networks , DES Algorithm ,AES algorithm, Comparison & important features of

modern symmetric key algorithms.

UNIT II (16 hours)

Public key cryptosystems ,The RSA Algorithm – Primality testing, Diffie Hellman key

exchange ,comparison of RSA & DES ,

UNIT III (16 hours)

Hash Functions , Authentication protocols, Digital Signature, Secure e-mail, SSL, IP

Security-architectures-features ,Web security, System security –Intruders, Malicious

Software , Firewalls.

Text Books

1. William Stallings, Network Security Essentials Applications & Standards, Pearson

Education Asia.

Reference Books

1. Schneier B., Applied Cryptography: Protocols, Algorithms, and Source Code in C,

John Wiley

2. Pfleeger C.P., Pfleeger S.L., Security in Computing, Pearson Education (Singapore)

Pvt. Ltd., Principles of Information Security, Thomson, Vikas Publishing House.


BCA SEMESTER-V

TITLE: Software Engineering (5BCA2)

Hard Core



UNIT-I

1. Overview: System modeling, The system engineering process, System Procurement;

Software process models, Software specification, Software design and

implementation, Software validation, Software evolution. (07)

2. Requirement Engineering: Functional and Non-functional requirements, User

requirements, System requirements, the software requirements document; Feasibility

studies, Requirements elicitation and analysis, Requirements validation, Requirements

management. (08)

UNIT-II

3. System Models: Context models, Behavioral models, Data models, Object models;

Prototyping in software process, User interface prototyping. (06)

4. Software Design: Architectural design - System structuring, Control models, Modular

decomposition; Object Oriented design – Objects and object classes, An object

oriented design process; User interface design – Principles, User interaction,

Information presentation, User support. (10)

UNIT-III

5. Verification and Validation: Planning, Software inspections, Automated static

analysis, Clean room software development; Software testing – Defect testing,

Integration testing, Object oriented testing. (10)

6. Software Management: Project management – Activities, Planning, Scheduling, Risk

management; Software cost estimation – Productivity, Estimation techniques, Project

duration and staffing; Quality management – Assurance and standards, Planning,

Quality control, Software measurements and metrics. (07)

Text Books:

1. Software Engineering, Ian Sommerville, 6th

Edition, Pearson Education Ltd., 2001.

Reference Books:

1. Software Engineering – A practitioners approach, Roger. S. Pressman, Tata-McGraw

Hill 4th

Edition.

2. An Integrated Approach to Software Engineering, Pankaj Jalote, Narosa Publications.


BCA SEMESTER-V

TITLE: Java & Adv Java (5BCA4)

Hard Core



UNIT-I (16 hrs)

Introduction to Java: Origin and features of Java. Java Program Structure, Java Tokens, Java

statements, Java Virtual machine, Command Line Parameters, Java Variables and Arrays,

Operators, Decision Making, Branching and looping statements.

Classes Objects and Methods used in Java: Class fundamentals, Methods, Constructors,

Overloading, Inheritance, Interfaces, One and two dimensional arrays, Strings, Java

Packages: API packages, system packages, naming conventions, creating and accessing a

package, adding a class to a package, hiding classes.

UNIT-II (16 hrs)

Multi-threads Programming : Java thread Model, Main Thread, creating a Thread, Creating

Multiple Threads, Extending the thread class, Stopping and blocking a thread, Life cycle of a

thread, Managing Errors and Exceptions.

Introduction to Applets: Fundamentals, types and their usage.

UNIT-III (16 hrs)

Multi Threaded Programming, Multi Threaded Programming: What are threads? How to

make the classes threadable;Extending threads; Implementing runnable; Synchronization;

Changing state of the thread; Bounded buffer problems, read-write problem, producer

consumer problems.

Event Handling: Two event handling mechanisms; The delegation event

model; Event classes; Sources of events; Event listener interfaces; Using the

delegation event model; The Concept of JDBC; JDBC Driver Types; JDBC Packages;

A Brief Overview of the JDBC process; Database Connection; Associating the

JDBC/ODBC Data base connectivity – 2 tier, 3 tier architecture

Introduction to Servlets and RMI

Text Books:

1. Balaguruswamy, Programming with Java – A PRIMER, Tata McGraw-Hill 2nd

Edition

2. Deitel, Internet and World Wide Web How to Program, Pearson Education, Asia.

Reference book : 1. The Complete Reference - Java-2 by Herbert Schildt Published by Tata

McGraw-Hill India.


BCA SEMESTER-V

TITLE: 5BCA7: Java Lab Hard Core

Class Duration : 16 Weeks with 6Hours a week = 96Hrs


1. Write a Java program to demonstrate Printing in Java

2. Write a Java Program to perform basic arithmetic operations . 3. Write a Java program to demonstrate Classes and objects

4. Write a Java program to demonstrate constructor -default 5. Write a Java program to demonstrate Function overloading. 6. Write a Java program to demonstrate constructor overloading. 7. Write a Java program to illustrate One dimentional array 8. Write a Java program to demonstrate two dimensional array

9. Write a Java program to get current date and time using calendar 10. Write a java program to generate random number using math class 11. Write a Java program to find quadric equation by accepting input from keyboard 12. Write a Java program to demonstrate Single Inheritance. 13. Write a Java program to demonstrate Multiple Inheritance. 14. Write a Java program to demonstrate Multilevel Inheritance.

15. Write a Java program to demonstrate Hybrid Inheritance. 16. Write a applet program for free hand drawing 17. Write a Applet program to Read line of characters from console using InputStream 18. Write a Applet program to develop a simple calculator. 19. Write a Java program to find ip address of your system.

20. Write a java applet to print hello word in different colors 21. Write a Java program to Illustrate threads. 22. Write a Java program to Exception Handling. 23. Write a java program to illustrate packages 24. Write a Java program to demonstrate JDBC


BCA SEMESTER-V

TITLE: Web Designing Lab](5BCA7)

Hard Core



5BCA7: Web Designing Lab

(Exercises should be based on 5BCA4)

PART-A

1. Define the following

1.1 Web site

1.2 Web Page

1.3 Types of Web Pages

1.4 Browsers & their types

1.5 Client-Server Model

1.6 Web-Server

1.7 Working of different types of Web Pages

1.8 General Structure of Web Page

1.9 Scripting Languages

1.10 URL

1.11 Popular Search Engines

1.12 www

2. Illustrate HTML Tags & their attributes

2.1 Introduction to HTML

2.2 HTML Main tags-Head,Title,Body,Comments,Div

2.3 Heading Tags

2.4 Text Formatting tags-

Hr,Br,Span,,,<pre>,,<marquee>,,,,<big>,,,,<s>,

2.5 All tags pertaining to lists

2.6 Link tag- <a>: text as links and images as links

2.7 Table- all table related tags

2.8 Frames- all frame related tags

2.9 Forms- all form elements

2.10 CSS

2.11 Adding images using <img> tags

2.11.1 setting an image as background

2.12 Embedding a multimedia on to a web page(video,audio,zip)

2.13 Special characters in HTML

3. Mini Project (Maximum 2 student in a batch)

Design a static website having a minimum of 6 web pages using all HTML features studied.

4. Client Side Scripting Using Java Script

4.1 Introduction to Java Script

4.2 Datatypes

4.3 Operators

4.4 Control Structures

4.5 Object Based Programming

4.5.1 Arrays

4.5.2 Strings & Procedures


PART-B

1. Write a menu-driven script to perform all arithmetic operations.

2. Write a script to check whether the given number is prime or not.

3. Write a script to search for an element in an array of n elements.

4. Write a script to illustrate subroutine.

5. Write a script to compute the GCD of 2 numbers using function.

6. Write a script to find the second largest number in an array.

7. Write a script to check whether the given number in Palindrome or not.


BCA SEMESTER-V

TITLE: System Software(5BCA51)

Elective I



5BCA51: System Software [Elective-I]

UNIT-I

1. Introduction: What is system software? Components of system software, Evolution

of system software. (02)

2. Machine Structure, Machine Language and Assembly Language: General

machine structure – memory, registers, Data instructions, Machine Languages,

Assembly Languages. (06)

3. Assembler: General design procedure, design of assembler, statement of problem,

data structures, format of database, Algorithm (2-pass assembler) in brief.

(06)

4. Macro Language and the Macro Processor: Macro instructions, features of macro

facility – Macro instruction argument, Conditional macro expressions, Macro call

with macros, Macro instruction defining macros single pass algorithm. (07)

UNIT-II

5. Loader: i. Loader Schemes – (a).Compile and Go loader, (b).General loader scheme,

(c).Absolute loader, (d).Sub routine linkers, (e).Relocating loader, (f).Direct

linking loader, (g).Binder, linking loader, overlays, dynamic binder.

ii. Design of an absolute loader.

iii. Design of direct linking loader – (a).Specification of problem,

(b).Specification of data structure, (c).Format of database, (d).Algorithm.

(14)

UNIT-III

6. Compilers: Different phases, Lexical phase – recognizing tokens, database used and

algorithm. Syntax and Interpretation phase – recognizing syntactic units and

interpreting their meaning, creating intermediate form – arithmetic, non-arithmetic

and executable statement, database used and algorithm. Code generation phase –

databases used and algorithm. Optimization phase – Machine independent and

machine dependant optimizations with examples. Assembly phase – databases used

and algorithms. General Model of compile – passes of compile with flow chart.

(13)

Text Books:

1. Introduction to System Software by D.M. Dhamdhere.

Reference Books:

1. System Programming by John Donovan.


BCA SEMESTER-V

TITLE: Data Mining And Warehouse(5BCA52) [Elective – I]



UNIT-I

1. Introduction: What is Data Warehouse? A Multidimensional Data Model, Data

Warehouse Architecture, Data Warehouse Implementation, Data cube technology,

Data Mining, Data mining functionalities, Data cleaning, Data integration and

transformation, Data Reduction. (08)

2. Data Mining Primitives, Languages, and System Architectures: Data Mining

primitives, Presentation and Visualization of discovered patterns, Data Mining query

language. (07)

UNIT-II

3. Mining Association Rules: Single-dimensional Boolean association rules from

transactional databases. (06)

4. Classification and Prediction: Issues regarding classification and prediction,

Classification by Decision tree induction, Bayesian Classification, Classification by

Back propagation, Prediction. (09)

UNIT-III

5. Cluster Analysis: What is a cluster analysis? Types of data in cluster analysis: A

categorization of Major Clustering methods, Partitioning methods, Hierarchical

methods; Model-Based Clustering Methods: Statistical approach. (08)

6. Applications and Trends in Data Mining: Data Mining applications, Data Mining

system products and research prototypes, Additional themes on Data Mining, Data

Mining and Intelligent query answering. Trends in Data Mining.

(10)

Text Books:

1. Jiawei Micheline Kamber, ‘Data Mining Concepts and Techniques’, Morgan Kauf

Mann Publishers.

Reference Books:

1. George M. Marakas, ‘Modern Data Warehousing, Mining and Visualization’, Pearson

Education, 2003.

2. W.H. Inmon, ‘Building the Data Warehouse’, Wiley dreamtech, 3rd

Edition.

3. Mastering Data Mining – Michael J.A. Berry & Gordon S. Linoff (Wiley Pub.).

4. Data Warehousing (Pearson Ed.) – Sam Anahory & Dennis Murray.


BCA SEMESTER-V

TITLE: Enterprise Resource Planning (5BCA53) [Elective – I]


MARKS THEORY 80 + INTERNAL ASSESSMENT 20 = 1005BCA53: Enterprise

Resource Planning [Elective-I]

UNIT-I

1. ERP – Curtain Raiser: An overview, Accommodating variety, Integrated

Management Information, Seamless Integration, Supply Chain Management,

Resource Management, Integrated data model, Scope, Technology, Benefits of ERP,

Evolution, ERP revised, ERP & Modern Enterprise, problems. (06)

2. Business Engineering & ERP: An overview, What is Business Engineering (BE)?

Significance of BE, Principles of BE, BRP, ERP & IT, ERP and Management

concerns, problems. (05)

3. Business Modeling for ERP: An overview, Building the Business Model, problems.

(03)

UNIT-II

4. ERP Implementation: An overview, Role of consultants, vendors and users;

Customization, Precautions, ERP: Post-implementation options, ERP implementation

methodology, Guidelines for ERP implementation, problems.

(06)

5. ERP and the Competitive Advantage: An overview, ERP & Competitive strategy,

problems. (04)

6. The ERP Domain: An overview, MFG/PRO, OFS/Avalon – Industrial & Financial

Systems, Baan IV, SAP, SAP R/3 Applications, Examples of as Indian ERP

packages, The arrival of ERP III, problems. (06)

UNIT-III

7. Making of ERP: An overview, Market Dynamics & Competitive Strategy, problems.

(04)

8. Case Studies: An overview, Mercedes-Benz, Kee Hin Industries, Bull Electronics

Angers Plant Manufacturers, Ameritech, Essar Steel, Jindal Iron & Steel Company

Ltd., Indian Renewable Energy Development Agency (IREDA), ERP Handles

Pressure, Sara ERP case study – Hawkins Cookers Ltd, A wholesome enterprise

application, Sara IEMS (ERP III) case study – Pan Century, Oleo chemicals,

Malaysia. (14)

Text Books:

1. Enterprise Resource Planning – Concepts & Practice (2nd

Edition) by V.K. Garg &

N.K. Venkita krishna.

2. Enterprise Resource Planning by Alexis Leon.

Reference Books:

1. ERP WARE – ERP Implementation Framework by V.K. Garg & N.K. Venkita

krishna.

2. Enterprise Resource Planning ERP Text & Case Studies by Murthy CSV.

3. Enterprise Resource Planning – HB by Pankaj Sharma.

4. Enterprise Resource Planning by Mahadeo Jaiswal.

5. Enterprise Resource Planning by Sunil Sharma.


BCA SEMESTER-V

TITLE: Operation Research [Elective – I] (5BCA54)



UNIT I: (16 hours)

Definition of the term Operation Research – Different Phases of O.R. Advantages and

Limitations of O.R. Standard Linear Programming – Formulation of a Linear Programming

Solving L.P.P. by Graphical Method Problem. Simplex Method.

UNIT II: (16 hours)

Transportation Model Problems – Assignment Problem.

Method of finding initial basic feasible solution to Transportation problem-North West

Corner, matrix Minima and Vogel’s Method.

Method of finding initial basic feasible solution to Assignment Problem using Hungarian

Method.

UNIT III: (16 hours)

Dual Simplex Method, Big M method revised simplex method, duality theorems

Sequencing Problems – Processing ‘n’ jobs through two machines – Travelling Salesman

Problems as an application of Sequencing.

Text Books:

1. “Operation Research”, by Kanthiswarup, Gupta, Manmohan – Sultan chand and sons,

Educational Publishers, New Delhi, 1996.

Reference Books :

1. “Operation Research”, by S.Daranivenkatakrishnan Keerthi Publishing House 1997.

2. “Operation Research”, by H.A.Taha Prentice Hall of India Ltd 1998.

3. “Operation Research”, by S.D.Sharma Kedar nath Ramnath and co (Publishers) 1997


BCA SEMESTER-V

TITLE: Analysis and Design of Algorithms

[Elective – I] (5BCA55)



UNIT I (17 hours)

Introduction: Definition of Algorithm, Areas of algorithm study.

Performance analysis- space complexity, time complexity

Asymptotic notations-- big Oh - big omega - little Oh – little omega and theta notations.

Recurrence equations - Substitution Method, Changing variables, Master’s Theorem.

Divide and Conquer method: use, Examples: Binary search,Merge sort, quick Sort.

Performance measurement of Binary Search ,quick sort, Selection sort,Insertion sort,Merge

sort,Heap sort.

UNIT II (17 hours)

Dynamic programming –General method, multistage graphs, multistage graphs, all-pairs

shortest path, Single source shortest path, optimal binary search trees - Floyd-Warshall

algorithm .

Greedy method : General method, Knapsack problem, Minimum cost spanning trees -Prims

algorithm, Kruskals algorithm.

UNIT III (14 hours)

Backtracking - General method,Graph coloring.

Complexity Theory - Introduction. P and NP. NP-Complete problems.

Text book

1. Anuradha A Puntambekr “Analysis of Algorithm and Design”

2. T. H. Cormen, C. E. Lieserson, R. L. Rivest, Introduction to Algorithms, Prentice Hall

India,2004.

3. Horowitz Ellis, Sahani Sartaz, R. Sanguthevar " Fundamentals of Computer

Algorithms".

4. Dromey -“ How To Solve It By Computer”


BCA SEMESTER-V

TITLE: Multimedia Computing [Elective – II](5BCA61)

Hard Core



5BCA61: Multimedia Computing [Elective – II]

UNIT-I (16 hrs)

Media and data streams: Properties of multimedia systems, Data stream Characteristics:

Digital representation of audio, numeric instruments digital interface Bark concepts,

Devices, Messages, timing standards speech generation, analysis, and transmission.

Digital Image: Analysis, recognition, transmission.

Video: Representation, digitalization, transmission.

Animation: Basic concepts, animation languages, animation control transmission.

UNIT-II (16 hrs)

Data compression standards: JPEG, H-216, MPEG DVI.

Optical storage devices and standards: WORHS, CDDA, CDROM, CDWO, CDM.

Real time multimedia, Multimedia file system.

Multimedia Platforms – Limitations of the personnel computer, evaluation of the

Multimedia PC, Multimedia hardware and Multimedia software.

MultiMedia Communication System: Collaborative computing session management,

transport subsystems, QOS, resource management.

UNIT-III (16 hrs)

Multimedia Databases: Characteristics, data structures, Operation integration in a

database model.

Synchronization: Issues, presentation requirements, reference to multimedia

synchronization, MHEG.

Multimedia Application: Media Preparation, Composition, integration communication,

consumption, and entertainment.

Suggested Reading:

1. RALPH Stein, Metz Clara, Nahrstedit, “Multimedia: Computing, Communication and

Applications”, 1st edition 1995.

1. John.F.Koegel Buford, “Multimedia Systems”, Addison Wesley 1994.

2. Mc Carty, T.P. “Multimedia Communications”, John Wiely, 1990.

3. Judith Jeffcoate, ‘Multimedia in Practice (Theory and Applications)”, PHI 1998.


BCA SEMESTER-V

TITLE: Software Testing And Quality Assurance [Elective – II] (5BCA62)

Hard Core



UNIT-I

1. Software Measurement: Measurement in software engineering, Classifying software

measures, applying the framework, software measurement validation.

(05)

2. Software Metrics Data Collection: Definition, Storing, Extraction and collection of

data, Analyzing software measurement data, analyzing results of experiments, simple

analysis techniques, more advanced methods, Overview of statistical test.

(07)

3. Software Engineering Measurement: Size: software size, length, reuse,

functionality, complexity; Structure: Types of structure measure, control flow

structure, Modularity and information flow attributes, Object oriented metrics, Data

structures. (08)

UNIT-II

4. External Product Attributes: Modeling software quality, Measuring aspect of

quality. (04)

5. Software Reliability: Basics of reliability theory, Software reliability problem,

Parametric reliability growth models, Predictive accuracy, Importance of operational

environment, wider aspects of software reliability. (07)

UNIT-III

6. Making Process Predictions: Goal estimates, Cost estimation: problems and

approaches, Models of effort and cost, Problem with existing modeling methods,

Dealing with problems of current estimation methods, Implications for process

predictions. (08)

7. Empirical Research in Software Engineering: Investigating products, Investigating

resources, Investigating processes, Measurement today and tomorrow.

(09)

Text Books:

1. Software Metrics – A rigorous and practical approach – Norman Fenton, Shari

Lawrence (Thomson – Brooks).

2. Software Testing – Renu Rajani, Pradeep Oak.

3. Software Requirement & Estimation – Swapna Kishore, Rajesh Naik.

Reference Books:

1. Ed Kit: Software Testing in the real world, Addison – Wesley, 1995.

2. William Perry: Effective methods for software testing – Jhon wiely, 1999.

3. Bezier B: Software testing techniques II edition, Van Nostrand Reinluold, 1990.

4. Myers G J: The Art of Software Testing, John Wiley, 1979.

5. Loise Tamres: Introducing software testing, Pearson Education, 2003.


BCA SEMESTER-V

TITLE: Mobile Communication [Elective – II](5BCA63)

Hard Core



5BCA63: Mobile Communication [Elective – II]

UNIT-I: (16 hrs)

Introduction to Cellular mobile systems: Basic cellular mobile systems, performance

criteria, operation of cellular systems, planning a cellular system, analog and digital

cellular systems.

Elements of cellular Radio system design: Concept of frequency reuse channels, co-

channel interference reduction factor, hand-off mechanism, cell splitting, consideration of

the components of the cellular systems.

Co-channel interference Reduction: Co-channel Interference, exploring co-channel

Interference areas in a system, Real-time co-channel interference, measurement at

mobile radio receivers, Power control, designing a system to serve a predefined area

that experiences co-channel Interference.

UNIT-II: (16 hrs)

Frequency Management and Channel Assignment: Frequency management,

Frequency spectrum utilization, set-up channels, Definition of co-channel assignment,

fixed channel assignment, non-fixed channel assignment algorithms, perception of call

blocking from subscribers.

Hand-offs and Dropped Calls: Initiation of hand off, delaying a hand off, forced hand

off, queuing hand off, power difference hand off, Mobile Assisted hand off (MAHO) and

soft hand off. Cell site hand off, Intersystem hand off. Introduction to dropped call rate.

Introduction Digital Systems: ARQ techniques, Digital speech, digital mobile

telephony, Practical multiple access schemes.

Digital Cellular systems: Global System for Mobile (GSM), North American TDMA,

CDMA, Miscellaneous such as PDC, CT –2, DECT, CDPD, PCN and PCS.

UNIT-III (16 hrs)

Intelligent concept and applications: Intelligent cell concept, applications of intelligent

µ cell systems, in-building communication, CDMA cellular radio network.

Intelligent network for wireless communications: Advanced Intelligent Network

(AIN), SS7 network for ISDN, and AIN, AIN for mobile communications, an intelligent

system Future public Land Mobile Telecommunication System (FPLMTS), Wireless ATM

networks, wireless information superhighway.

References:

1. Rappaport, “Wireless Communication”, Pearson Education, 2/e, 2002.

2. William C.Y.Lee, “Mobile Cellular Telecommunications: Analog and Digital

Systems”, 2/e, McGraw-Hill Electronic Engineering Series, 1995.

3. William C.Y.Lee, “Mobile Communication Engineering”, Mc-Graw Hill, 1997.

4. Mike Gallegher, Randy Snyder, “Mobile Telecommunications Networking with IS-

41”, McGraw Hill, 1997. 5. Kernllo, Feher, “Wireless Digital Communications”, PHI, 2001.


BCA SEMESTER-V

TITLE: 5BCA64:Compiler Design[Elective –II [Elective – II]

Hard Core



Objectives

· To introduce the various techniques involved in the translation of source programs into

object programs by a compiler.

· To understand the inner working of a compiler using the various data structures used in the

translation process.

UNIT I (16hours)

Compiler:Introduction - analysis of the source program - phases of a compiler - compiler

construction tools – lexical analysis - role of the lexical analyzer - specification of tokens -

recognition of tokens - lexical analyzer generators. Syntax analysis: role of the parser -

context-free grammars - top-down parsing -bottom-up parsing – operator precedence parsing

- LR parsers (SLR, canonical LR, LALR) - parser generators.

UNIT II (16hours)

Syntax-directed translation - syntax-directed definitions - S-attributed definitions - L-

attributed definitions -bottom-up and top-down translation - type checking - type systems -

specification of a type checker – runtime environments - source language issues - storage

organization - storage allocation strategies - access to non-local names - parameter passing -

symbol tables.

UNIT III (16 hours)

Intermediate code generation - intermediate languages - declarations -assignment statements

– Boolean expressions - procedure calls - introduction to code optimization - sources of

optimization - introduction to data-flow analysis - introduction to code generation - issues in

the design of a code generator – the target machine - a simple code generator

Text Books

1. Aho A.V., Sethi R., Ullman J.D., Compilers: Principles, Techniques and Tools, Addison

Wesley.

Reference Books

1. Aho A. V., Ullman J.D. Principles of Compiler Design, Narosa

2. Kenneth C Lauden, Compiler Construction - Principles and practice, Thomson

Brooks/Cole -Vikas Publishing House.


BCA SEMESTER-V

TITLE: GRAPH THEORY[Elective –II]( 5BCA65)



UNIT I 16hrs

Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits – Connectedness

– Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees – Properties of trees

– Distance and Centers in Tree – Rooted and Binary Trees.

UNIT II 16 hrs

Spanning trees – Fundamental Circuits –Spanning Trees in a Weighted Graph –

Dijkstra’s Shortest Path Algorithm, Minimal Spanning Trees – The algorithms of Kruskal

and Prim, Transport Networks – Max-flow, Min-cut Theorem

Cut Sets – Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets –

Connectivity and Separability – Network flows – 1-Isomorphism – 2-Isomorphism –

Combinational and Geometric Graphs – Planer Graphs – Different Representation of a Planer

Graph.

UNIT III 16hrs

Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix –

Chromatic Number – Chromatic partitioning – Chromatic polynomial - Matching - Covering

– Four Color Problem – Directed Graphs – Types of Directed Graphs – Digraphs and Binary

Relations – Directed Paths and Connectedness – Euler Graphs – Adjacency Matrix of a

Digraph.

Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning Trees of

a Graph –Set of Fundamental Circuits – Cut Vertices and Separability – Directed Circuits.

TEXTBOOK

1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer

Science”,PHI,2003.

REFERENCE

1. Graph Theory and Combinatorics, Dr. D.S. Chandrasekharaiah, Prism, 2005.

2. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education,

2003.


SEMSTER-V

TITLE: 5BCA8: Elective Lab.

Soft Core



Lab Exercise Should be based on Elective I and Elective II


SEMSTER-VI

TITLE: 6BCA1:PROJECT WORK

Hard Core


VI Semester

Subject

code Title Type

Teaching

Hrs./Week

Credits

Examination Scheme

IA

Max.

Dissertation

Viva Min. for

Pass Total Theory Project

work.

Max. Min

.

6BCA1 Dissertation HC - 24 12 40 120 36 40 80 200

Project Guide Lines

Maximum 2 students shall be allowed to take up a project.

Each student will have to work for 24 hours per week whether in the college premises

or outside. If a student opts for industrial outside project, a college teacher has to be

an internal guide. In this case the student has to report/present his/her progress twice

in a week.

Guiding one project shall be considered as 4 hours of practical per week as the work

load for the concerned internal guide.

Each student shall submit his/her project synopsis to the concerned guide within 15

days in consultation with internal guide from the commencement of the respective

semester.

Each student has to carry out 2 project seminars compulsorily in project duration.

Each seminar will be considered for their internal assessment.

Scheme of valuation - 200 Marks

A. IA – 40 Marks

Synopsis - 20 Marks & Seminar - 20 Marks

B. Dissertation – 120 Marks

Documentation - 60 Marks & Presentation / Demonstration - 60 Marks

C. Viva- 40 Marks


BLUE PRINT OF QUESTION PAPER FOR BCA COURSE– 2014 -15 Onwards

SEMESTERS I TO V

Time: 3 hours. Max Marks: 80

PART-A

Answer any TEN questions: 10 x 2= 20 Marks

1

Note: Among 12 Questions, 4 Questions from each Unit

2

2 2

3 2

4 2

5 2

6 2

7 2

8 2

9 2

10 2

11 2

12 2

PART-B

Answer any SIX questions: 6 x 10 = 60 Marks

13

Note: Among 9 Questions, 3 Questions from each Unit, Question

may have sub questions

10

14 10

15 10

16 10

17 10

18 10

19 10

20 10

21 10

BLUE PRINT OF QUESTION PAPER FOR BCA PRACTICAL EXAMINATION

SEMESTERS I TO V

Time: 3 hours. Max Marks: 80

Instruction : Any One Experiment/Program From Each Part

PART-A

Procedure development + Implementation + Result (15+05+05) = 25

PART-B Procedure development + Implementation + Result (20+10+05) = 35

Viva = 20

Total = 80

ST. Philomena’s College (Autonomous) Mysore...2. Computer Fundamentals - P K Sinha,BPB 3. Principles of Electronics-V.K.Mehtha. Reference Books 1. Introduction to Computers - N Subramanian,TMH

Documents