0% found this document useful (0 votes)
112 views44 pages

BCA SYLLABUS

Uploaded by

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

BCA SYLLABUS

Uploaded by

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

1 of 15

BANGALORE UNIVERSITY

SCHEME AND SYLLABUS

For the course

BACHELOR OF COMPUTER APPLICATIONS


(BCA)

NEP2021 Scheme

Academic Year 2021-22 and onwards

Department of Computer Science and Applications


BANGALORE UNIVESITY, BANGALORE
2 of 15

MEMBERS OF THE BoS IN COMPUTER SCIENCE

1 Dr. Muralidhara B L CHAIRPERSON


Professor
Department of Computer Science
Bangalore University

2 Dr. Guru D.S Member


Professor
PG Department of Computer Science
Mysore Univeristy

3 Dr. Susesha Member


Professor,
PG Department of Computer Science
Mysore Univeristy

4 Dr. Prabhakar C.J Member


Professor
Kuvempu University, Shimogga

5 Dr. Chandrakanth Naikodi Member


Associate Professor
Department of Computer Science
Davanagere University

6 Dr. Prathibha V Kalburgi Member


Ramaiah College of Arts Science, and Commerce
Bangalore

7 Mrs. Amalorpavam Member


Sambram Academi of Management Studies
Bangalore

8 Dr. H.K. Gundurao Member


Associate Professor
Vijaya College, Bangalore

9 Dr. Bhagyawana S Mudigowda Member


Associate Professor
Maharani Cluster University, Bangalore

10 Smt. Nagarathnamma S.M Member


Associate Professor
Maharani Cluster Univeristy, Bangalore
3 of 15

BANGALORE UNIVERSITY
BCA SYLLABUS (NEP)
[Based on I-C. Model of Karnataka State Higher Education Council]

Semest Course Title of the Paper Credits Languages, Skill Credits Total
er Code Enhancement (SEC), and Credits
Ability Enhancement
Courses (AECC)

I CA-C1T Discrete Structure 3 OE1: Open Elective 3 26

CA-C2T Problem solving Techniques 3 Language L1 3

CA-C3T Data Structure 3 Language L2 3

CA-C4L Problem solving Lab 2 SEC I : O ce 2


Management Tools

CA-C5L Data Structure Lab 2 Physical Education 1

Health & Wellness 1

II CA-C6T Computer Architecture 3 OE2: Open Elective 3 26

CA-C7T Object Oriented Programming 3 Language L1 3


using Java

CA-C8T Database Management System 3 Language L2 3

CA-C9L Java Lab 2 Environmental studies 2

CA-C10L Database Management System 2 Physical Education 1


Lab

NCC/NSS/CL/R&R 1

III CA-C11T Operating Systems 3 OE3: Open Elective 3 26

CA-C12T Computer Networks 3 Language L1 3

CA-C13T Python Programming 3 Language L2 3

CA-C14L Computer Networks Lab 2 SEC II : Computer 2


Assembly and Repair

CA-C15L Python Programming Lab 2 Physical Education 1

NCC/NSS/CL/R&R 1

IV CA-C16T Software Engineering 3 OE4: Open Elective 3 26

CA-C17T Arti cial Intelligence 3 Language L1 3

CA-C18T Internet Technologies 3 Language L2 3

CA-C19L Arti cial Intelligence Lab 2 The Constitution of India 2

CA-C20L Internet Technologies Lab 2 Physical Education 1

NCC/NSS/CL/R&R 1

V CA-C21T Design and Analysis of Algorithm 3 CA-V1 Vocation Course I : 3 23


Quantitative Techniques

CA-C22T Data Analytics 3 CA-E1 Elective I : 3


a. Data Mining
b. Computer Graphics

CA-C23T Web Programming 3 SEC III : Cyber Crime, 2


Cyber Law, and
Intellectual Property Right

CA-C24L Data Analytics Lab 2 Physical Education 1

CA-C25L Web Programming Lab 2 NCC/NSS/CL/R&R 1


fi
fi
ffi
4 of 15

Semest Course Title of the Paper Credits Languages, Skill Credits Total
er Code Enhancement (SEC), and Credits
Ability Enhancement
Courses (AECC)

VI CA-C26T Theory of Computation 3 CA-V2 Vocation Course 3 23


II : Electronic Content
Design

CA-C27T Machine Learning 3 CA-E2 Elective II : 3


a. Operations
Research
b. Software Testing
CA-C28T Mobile Application Development 3 Professional 2
Communication

CA-C29L Machine Learning Lab 2 Physical Education 1

CA-C30L Mobile Application Development 2 NCC/NSS/CL/R&R 1


Lab

VII CA-C31T Cloud Computing 3 CA-V3 Vocation Course III 3 21


: Technical Writing

CA-C32T Internet of Things 3 CA-E3 Elective III : 3


a. Modeling and
Simulation
b. Compiler Design

CA-C33T Internship 2 Research Methodology 3

CA-C34L Cloud Computing Lab 2

CA-C35L Internet of Things Lab 2

VIII CA-C36T Block Chain Technologies 3 CA-V4 Vocation Course IV 3 20


: Project Management

CA-C37T Cryptography and System 3 CA-E4 Elective IV : 3


Security a. Human Computer
Interface
b. Parallel Algorithms

CA-C38T Block Chain Technologies Lab 2 Research Project 6


5 of 15

CA-C1T: DISCRETE STRUCTURES

Total Teaching Hours: 48 No. of Hours / Week: 03


UNIT – I [12 Hours]
Set Theory and Logic: Fundamentals of Set theory, Set Operations and the Laws of Set Theory, Counting and
Venn Diagrams, Cartesian Products and Relations, Functions–One-to-One, Onto Functions, Function
Composition and Inverse Functions. Mathematical Induction, The well ordering principle, Recursive
Definitions, Structural Induction, Recursive algorithms. Fundamentals of Logic, Propositional Logic, Logical
Connectives and Truth Tables, Logic Equivalence, Predicates and Quantifiers.

UNIT - II [12 Hours]


Counting and Relations: Basics of counting, Pigeonhole Principle, Permutation and Combinations, Binomial
coefficients. Recurrence relations, Modeling with recurrence relations with examples of Fibonacci numbers
and the tower of Hanoi problem. Divide and Conquer relations with examples (no theorems). Definition and
types of relations, Representing relations using matrices and digraphs

UNIT - III [12 Hours]


Matrices: Definition, order of a matrix, types of matrices, operations on matrices, determinant of a matrix,
inverse of a matrix, rank of a matrix, linear transformations, applications of matrices to solve system of
linear equations.

UNIT - IV [12 Hours]


Graph Theory: Graphs: Introduction, Representing Graphs, Graph Isomorphism, Operations on graphs.
Trees: Introduction, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees, Prim’s
and Kruskul’s Algorithms. Connectivity, Euler and Hamilton Paths, Planar Graphs. Directed graphs:
Fundamentals of Digraphs, Computer Recognition - Zero-One Matrices and Directed Graphs, Out-degree,
in-degree, connectivity, orientation, Eulerian and Hamilton directed graphs, tournaments.
Text Books:
1. Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, 5thEdition, Pearson Education, 2004.
2. C. L. Liu: Elements of Discrete Mathematics, Tata McGraw-Hill, 2000.
3. F. Harary: Graph Theory, Addition Wesley, 1969.
4. Richard Bronson, Schaum’s Outline of Matrix Operations, McGraw-Hill publications, 2nd Edition, 2011

Reference Books:
1. Kenneth H Rosen. Discrete Mathematics and its Applications, McGraw-Hill publications, 7th edition,
2007.
2. J. P. Tremblay and R.P. Manohar. Discrete Mathematical Structures with applications to Computer
Science, Mc Graw Hill Ed. Inc. 1975.
3. Charles G Cullen. Matrices and Linear Transformations, Dover Publications Inc., Second Edition, 1990

Web Resources:
1. https://www.my-mooc.com/en/categorie/mathematics
2. http://www.nptelvideos.in/2012/11/discrete-mathematical-structures.html
3. https://ocw.mit.edu/courses/mathematics/
6 of 15

CA-C2T: PROBLEM SOLVING TECHNIQUES

Total Teaching Hours: 48 No. of Hours / Week: 03


UNIT - I [12 Hours]
Introduction: The Role of Algorithms in Computing, Algorithms as a technology, Analyzing algorithms,
Designing algorithms, Growth of Functions, Asymptotic notation, Standard notations and common functions.
Fundamental Algorithms: Exchanging the values of two variables, Counting, Summation of a set of numbers,
Factorial Computation, Generating of the Fibonacci sequence, Reversing the digits of an integer, Character to
number conversion.

UNIT - II [12 Hours]


C Programming: Getting Started, Variables and Arithmetic expressions. Input and Output: Standard input and
output, formatted output- printf, variable length argument list, formatted input-scanf. Control Flow:
Statements and Blocks, If-else, else-if, switch, loops: while loop, for loop, do while, break and continue, goto
and labels. Pointers and Arrays: pointers and address, pointers and function arguments, multidimensional
array, initialization of pointer arrays, command line arguments.

UNIT - III [12 Hours]


Factoring Methods: Finding the square root of a number, the smallest Divisor of an integer, the greatest
common divisor of two integers, computing the prime factors of an integer, generation of pseudo random
numbers, raising a number to a large power. Array Techniques: Array order Reversal, Array counting or
Histogramming, Finding the maximum number in a set, removal of duplicates from an ordered array,
partitioning an array, Finding the kth smallest element, multiplication of two matrices.

UNIT - IV [12 Hours]


Merging: the two-way merge. Sorting: Sorting by selection, sorting by exchange, sorting by insertion, sorting
by diminishing increment, sorting by partitioning. Searching: binary search, hash search. Text processing and
Pattern searching: text line length adjustment, keyword searching in text, text line editing, linear pattern
search

Text Books:
1. R.G.Dromey, “How to Solve it by Computer”, Pearson Education India, 2008.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, 3rd Edition, The MIT Press Cambridge, Massachusetts London, England, 2008
3. Brain M. Kernighan, and Dennis M. Ritchie, “The C Programming Language”, 2nd edition, Princeton
Hall Software Series, 2012.

Reference Books:
1. Steven S. Skiena, “The Algorithm Design Module”, 2nd Edition, Springer-Verlag London Limited, 2008.
2. Donald E. Knuth, The Art of Computer Programming”, Volume 1: Fundamental Algorithms, 3rd Edition,
Addison Wesley Longman, 1997.
3. Donald E. Knuth, The Art of Computer Programming”, Volume 2: Seminumerical Algorithms, 3rd
Edition, Addison Wesley Longman, 1998.
4. Greg Perry and Dean Miller, “C programming Absolute Beginner’s Guide”, 3rd edition, Pearson
Education, Inc, 2014.

Web Resources:
1. http://algorithmsforinterviews.com “Algorithms for Interviews”
7 of 15

CA-C3T: DATA STRUCTURES

Total Teaching Hours: 48 No. of Hours / Week: 03

UNIT-I [12 Hours]


Introduction and Overview: Definition, Elementary data organization, Data Structures, data Structures
operations, Abstract data types, algorithms complexity, time-space trade off. Preliminaries: Mathematical
notations and functions, Algorithmic notations, control structures, Complexity of algorithms, asymptotic
notations for complexity of algorithms. Arrays: Definition, Linear arrays, arrays as ADT, Representation of
Linear Arrays in Memory,Traversing Linear arrays, Inserting and deleting, Multi-dimensional arrays,
Matrices and Sparse matrices.

UNIT-II [12 Hours]


Linked list: Definition, Representation of Singly Linked List in memory,Traversing a Singly linked list,
Searching in a Singly linked list, Memory allocation, Garbage collection, Insertion into a singly linked list,
Deletion from a singly linked list; Doubly linked list, Header linked list, Circular linked list. Stacks:
Definition, Array representation of stacks, Linked representation of stacks, Stack as ADT, Arithmetic
Expressions: Polish Notation, Conversion of infix expression to postfix expression, Evaluation of Post fix
expression, Application of Stacks, Recursion, Towers of Hanoi, Implementation of recursive procedures by
stack. Queues: Definition, Array representation of queue, Linked list representation of queues. Types of
queue: Simple queue, Circular queue, Double-ended queue, Priority queue, Operations on Queues,
Applications of queues.

UNIT-III [12 Hours]


Binary Trees: Definitions, Tree Search, Traversal of Binary Tree, Tree Sort, Building a Binary Search Tree,
Height Balance: AVL Trees, Contiguous Representation of Binary Trees: Heaps, Lexicographic Search Trees:
Tries, External Searching: B-Trees, Applications of Trees. Graphs: Mathematical Back ground, Computer
Representation, Graph Traversal, Topological Sorting

UNIT-IV [12 Hours]


Searching: Introduction and Notation, Sequential Search, Binary Search, Comparison of Methods. Sorting:
Introduction and Notation, Insertion Sort, Selection Sort, Shell Sort, Divide And Conquer, Merge sort for
Linked List, Quick sort for Contiguous List. Hashing: Sparse Tables, Choosing a Hash function, Collision
Resolution with Open Addressing, Collision Resolution by Chaining.

Text Books:
1. Seymour Lipschutz, “Data Structures with C”, Schaum’s outLines, Tata Mc Graw Hill, 2011.
2. Robert Kruse, C.L.Tondo, Bruce Leung,Shashi Mogalla,“Data Structures and Program Design using C”,
Pearson Education, 2009.

ReferenceBooks:
1. Mark Allen Weiss,“ Data Structures and Algorithm Analysis in C”, Second Edition, Pearson Education,
2013.
2. Forouzan,“A Structured Programming Approach using C”,2nd Edition, Cengage LearningIndia,2008.
8 of 15

CA-C4P: Problem Solving Lab using C

Write, and execute C program for the following:


1. to read radius of a circle and to find area and circumference
2. to read three numbers and find the biggest of three
3. to check whether the number is prime or not
4. to read a number, find the sum of the digits, reverse the number and
check it for palindrome
5. to read numbers from keyboard continuously till the user presses
999 and to find the sum of only positive numbers
6. to read percentage of marks and to display appropriate message
(Demonstration of else-if ladder
7. to find the roots of quadratic equation
8. to read marks scored by n students and find the average of marks
(Demonstration of single dimensional array)
9. to remove Duplicate Element in a single dimensional Array
10. to perform addition and subtraction of Matrices
11. to find factorial of a number
12. to generate fibonacci series
13. to remove Duplicate Element in a single dimensional Array
14. to find the length of a string without using built in function
15. to demonstrate string functions
16. to read, display and add two m x n matrices using functions
17. to read a string and to find the number of alphabets, digits, vowels, consonants, spaces and special
characters.
18. to Swap Two Numbers using Pointers
19. to demonstrate student structure to read & display records of n
students
20. to demonstrate the difference between structure & union.
9 of 15

CA-C5P: DATA STRUCTURES LAB

NOTE: For all the programs write the output, flowchart and number of basic operations performed.

1. Given {4,7,3,2,1,7,9,0} find the location of 7 using Linear and Binary search and also display its first
occurrence.

2. Given {5,3,1,6,0,2,4} order the numbers in ascending order using Bubble Sort Algorithm

3. Perform the Insertion and Selection Sort on the input {75,8,1,16,48,3,7,0} and display the output in
descending order.

4. Write a program to insert the elements {61,16,8,27} into singly linked list and delete 8,61,27 from the
list. Display your list after each insertion and deletion.

5. Write a program to insert the elements {61,16,8,27} into linear queue and delete three elements from the
list. Display your list after each insertion and deletion.

6. Write a program to insert the elements {61,16,8,27} into circular queue and delete 4 elements from the
list. Display your list after each insertion and deletion.

7. Write a program to insert the elements {61,16,8,27} into ordered singly linked list and delete 8,61,27
from the list. Display your list after each insertion and deletion.

8. Write a program to add 6x3+10x2+0x+5 and 4x2+2x+1 using linked list.

9. Write a program to push 5,9,34,17,32 into stack and pop 3 times from the stack, also display the popped
numbers.

10. Write a recursive program to find GCD of 4,6,8.

11. Write a program to inert the elements {5,7,0,6,3,9} into circular queue and delete 6,9&5 from it(using
linked list implementation)..

12. Write a program to convert an infix expression x^y/(5*z)+2 to its postfix expression

13. Write a program to evaluate a postfix expression 5 3+8 2 - *.

14. Write a program to create a binary tree with the elements {18,15,40,50,30,17,41} after creation insert 45
and 19 into tree and delete 15,17 and 41 from tree. Display the tree on each insertion and deletion
operation

15. Write a program to create binary search tree with the elements {2,5,1,3,9,0,6} and perform inorder,
preorder and post order traversal.

16. Write a program to Sort the following elements using heap sort {9.16,32,8,4,1,5,8,0}

17. Given S1={“Flowers”} ; S2={“are beautiful”} I. Find the length of S1 II. Concatenate S1 and S2 III.
Extract the substring “low” from S1 IV. Find “are” in S2 and replace it with “is”
10 of 15

CA-C6T: COMPUTER ARCHITECTURE

Total Teaching Hours: 48 No. of Hours / Week: 03

UNIT - I [12 Hours]


Number Systems: Binary, Octal, Hexa decimal numbers, base conversion, addition, subtraction of binary
numbers, one's and two's complements, positive and negative numbers, character codes ASCII, EBCDIC.
Computer Arithmetic: Addition and Subtraction, Multiplication and Division algorithms, Floating-point
Arithmetic Operations, Decimal arithmetic operations. Structure of Computers: Computer types,
Functional units, Basic operational concepts, Von-Neumann Architecture, Bus Structures, Software,
Performance, Multiprocessors and Multicomputer, Digital Logic Circuits: Logic gates, Boolean algebra,
M a p S i m p l i f i c a t i o n . C o m b i n a t i o n a l C i r c u i t s : H a l f A d d e r, F u l l A d d e r, f l i p
flops.Sequentialcircuits:Shiftregisters,Counters,IntegratedCircuits,Mux,Demux,Encoder,Decoder.Data
representation: Fixed and Floating point.

UNIT - II [12 Hours]


Basic Computer Organization and Design: Instruction codes, Computer Registers, Computer Instructions
and Instruction cycle. Timing and Control, Memory-Reference Instructions, Input-Output and interrupt.
Central processing unit: Stack organization, Instruction Formats, Addressing Modes, Data Transfer and
Manipulation, Complex Instruction Set Computer (CISC) Reduced Instruction Set Computer (RISC),
CISC vs RISC

UNIT - III [12 Hours]


Register Transfer and Micro-operations: Register Transfer Language, Register Transfer, Bus and Memory
Transfers, Arithmetic Micro-Operations, Logic Micro-Operations, Shift Micro-Operations, Arithmetic
logic shift unit. Micro-programmed Control: Control Memory, Address Sequencing, Micro-Program
example, Design of Control Unit. Input Output: I/O interface, Programmed IO, Memory Mapped IO,
Interrupt Driven IO, DMA. Instruction level parallelism: Instruction level parallelism (ILP)-over coming
data hazards, limitations of ILP

UNIT - IV [12 Hours]


Memory System: Memory Hierarchy, Semiconductor Memories, RAM(Random Access Memory), Read
Only Memory (ROM), Types of ROM, Cache Memory, Performance considerations, Virtual memory,
Paging, Secondary Storage, RAID. Multiprocessors And Thread level Parallelism: Characteristics of
multiprocessors, Multi-Threaded Architecture, Distributed Memory MIMD Architectures, Interconnection
structures,

TEXT BOOKS:
1. Mano M Morris, ”Computer System Architecture”, 3rd edition Pearson India(2019).
2. William Stallings, “Computer Organization and Architecture designing for performance”, 10th
edition, Pearson(2016)

REFERENCE BOOKS
1. Subrata Ghoshal, “Computer Architecture And Organization”, Pearson India(2011).
2. Andrew S. Tanenbaum “ Structured Computer Organization”, 5th edition, Pearson Education
Inc(2006).
3. Carl Hamacher, Zvonks Vranesic,SafeaZaky, “Computer Architecture And Organization”, 5th edition
McGraw Hill New Delhi,India(2002).
4. Kai Hwang, “Advanced Computer Architecture - Parallelism, Scalability, Programmability”, Tata
Mcgraw-Hill (2008).
11 of 15

CA67T: OBJECT ORIENTED PROGRAMMING USING JAVA

Total Teaching Hours: 48 No. of Hours / Week: 03

UNIT-I [12 Hours]


Introduction to Java: Basics of Java programming, Data types, Variables, Operators, Control structures
including selection, Looping, Java methods, Overloading, Math class, Arrays in java. Objects and Classes:
Basics of objects and classes in java, Constructors, Finalizer, Visibility modifiers, Methods and objects,
Inbuilt classes like String, Character, String Buffer, File, this reference

UNIT-II [12 Hours]


Inheritance and Polymorphism: Inheritance in java, Super and sub class, Overriding, Object class,
Polymorphism, Dynamic binding, Generic programming, Casting objects, Instance of operator, Abstract
class, Interface in java, Package in java, UTIL package.

UNIT-III [12 Hours]


Event and GUI programming: Event handling in java, Event types, Mouse and key events, GUI Basics,
Panels, Frames, Layout Managers: Flow Layout, Border Layout, Grid Layout, GUI components like Buttons,
Check Boxes, Radio Buttons, Labels, Text Fields, Text Areas, Combo Boxes, Lists, Scroll Bars, Sliders,
Windows, Menus, Dialog Box, Applet and its life cycle, Introduction to swing, Exceptional handling
mechanism. I/O programming: Text and Binary I/O, Binary I/O classes, Object I/O, Random Access Files.

UNIT-IV [12 Hours]


Multithreading in java: Thread life cycle and methods, Runnable interface, Thread synchronization,
Exception handling with try-catch-finally, Collections in java, Introduction to JavaBeans and Network
Programming.

Textbooks:
1. E. Balagurusamy, Programming with JAVA, McGraw Hill, New Delhi, 2007

Reference Books:
1. Raj Kumar Buyya, Object Oriented Programming with JAVA, McGraw Hill, 2009
2. Herbert Schildt, Java A Beginner’s Guide – Create, Compile, and Run Java Programs Today, Sixth
Edition, Oracle Press, 2014
3. Ken Arnold, James Gosling, “The Java Programming Language, Fourth Edition, Addison Wisely, 2005
4. Herbert Schildt, ‘The Complete Reference Java, 7th Edition, McGraw Hill, 2007

Web Resources
1. https://docs.oracle.com/javase/tutorial/
2. https://javabeginnerstutorial.com/core-java-tutorial/
12 of 15

CA-C8T: DATABASE MANAGEMENT SYSTEMS

Total Teaching Hours: 48 No. of Hours / Week: 03

UNIT - 1 [12 Hours]


Databases and Database Users: Introduction, An example, Characteristics of the Database Approach, Actors
on the Scene, Workers behind the Scene, Advantages of Using DBMS Approach, A Brief History of
Database Applications, When Not to Use a DBMS. Database System Concepts and Architecture: Data
Models, Schemas, and Instances, Three-schema Architecture and Data Independence, Database Languages
and Interfaces, The Database System Environment, Centralized and Client-Server Architectures,
Classification of Database Management Systems.

UNIT - 2 [12 Hours]


Data Modeling Using Entity-Relationship Model: Using High-Level Conceptual Data Models for Database
Design, An Example Database Application, Entity Types, Entity Sets, Attributes and Keys, Relationship
Types, Relationship Sets, Roles and Structural Constraints, Weak Entity Types, Refining the ER Design
Company Database Diagrams, Naming Conventions and Design. Issues, File organization and storage,
secondary storage devices, type of single level ordered index, multi-level indexes, indexes on multiple keys,
other types of indexes.

UNIT – 3 [12 Hours]


Relational Model and Relational Algebra: Relational Model Concepts, Relational Model Constraints and
Relational Database Schemas, Update Operations, Transactions and Dealing with Constraint Violations,
Unary Relational Operations: SELECT and PROJECT, Relational Algebra Operations from SET Theory,
Binary Relational Operations: JOIN and DIVISION, Additional Relational Operations, Examples of Queries
in Relational Algebra. Relational Database Design: Anomalies in a database, functional dependency, normal
forms, lossless join and dependency, BCNF, normalization through synthesis, higher order normal forms.
SQL- SQL Data Definition and Data Types, Specifying Constraints in SQL, Schema Change Statements in
SQL, Basic Queries in SQL, More Complex SQL Queries, Insert, Delete and Update Statements in SQL,
Specifying Constraints as Assertion and Trigger, Views(Virtual Tables) in SQL, Embedded SQL, Dynamic
SQL,

UNIT – 4 [12 Hours]


Introduction to transaction processing, transaction and system concepts, desirable properties of transactions,
transaction support in SQL. Concurrency control techniques: two-phase locking techniques, concurrency
control based on timestamp ordering. Recovery techniques: recovery concepts, recovery in multi-database
systems, database backup and recovery from catastrophic failures.

Text Books:
1. Elmasri and Navathe: Fundamentals of Database Systems, 7th Edition, Addison -Wesley, 2016.
2. Silberschatz, Korth and Sudharshan Data base System Concepts, 7th Edition, Tata McGraw Hill, 2019.

References:
1. C.J. Date, A. Kannan, S. Swamynatham: An Introduction to Database Systems, 8th Edition, Pearson
education, 2009
2. Database Management Systems :Raghu Ramakrishnan and Johannes Gehrke: , 3rd Edition, McGraw-
Hill, 2003
13 of 15

CA-C9P: JAVA PROGRAMMING LAB

1. Write a simple java application, to print the message, “Welcome to java”


2. Write a program to display the month of a year. Months of the year should be held in an array.
3. Write a program to demonstrate a division by zero exception
4. Write a program to create a user defined exception say Pay Out of Bounds. .
5. Write a java program to add two integers and two float numbers. When no arguments are supplied,
give a default value to calculate the sum. Use function overloading.
6. Write a program to perform mathematical operations. Create a class called AddSub with methods to
add and subtract. Create another class called MulDiv that extends from AddSub class to use the
member data of the super class. MulDiv should have methods to multiply and divide A main function
should access the methods and perform the mathematical operations.
7. Write a program with class variable that is available for all instances of a class. Use static variable
declaration. Observe the changes that occur in the object’s member variable values.
8. Write a java program to create a student class with following attributes: Enrollment_id: Name, Mark
of sub1, Mark of sub2, mark of sub3, Total Marks. Total of the three marks must be calculated only
when the student passes in all three subjects. The pass mark for each subject is 50. If a candidate fails
in any one of the subjects his total mark must be declaredas zero. Using this condition write a
constructor for this class. Write separate functions for accepting and displaying student details. In the
main method create an array of three student objects and display the details.
9. In a college first year class are having the following attributesName of the class (BCA, BCom, BSc),
Name of the staff No of the students in the class, Array of students in the class
10. Define a class called first year with above attributes and define a suitable constructor. Also write a
method called best Student () which process a first-year object and return the student with the highest
total mark. In the main method define a first-year object and find the best student of this class
11. Write a Java program to define a class called employee with the name and date of appointment. Create
ten employee objects as an array and sort them as per their date of appointment. ie, print them as per
their seniority.
12. Create a package‘ student.Fulltime.BCA‘ in your current working directory
a. Create a default class student in the above package with the following
attributes: Name, age, sex. b. Have methods for storing as well as displaying
13. Write a small program to catch Negative Array Size Exception. This exception is caused when the
array is initialized to negative values.
14. Write a program to handle Null Pointer Exception and use the “finally” method to display a message to
the user.
15. Write a program which create and displays a message on the window
16. Write a program to draw several shapes in the created window
17. Write a program to create an applet and draw grid lines
18. Write a program which creates a frame with two buttons father and
mother. When we click the father button the name of the father, his age and designation must appear.
When we click mother similar details of mother also appear.
19. Create a frame which displays your personal details with respect to a button click
20. Create a simple applet which reveals the personal information of yours.
21. Write a program to move different shapes according to the arrow key pressed.
22. Write a java Program to create a window when we press M or m the window displays Good Morning,
A or a the window displays Good After Noon E or e the window displays Good Evening, N or n the
window displays Good Night
23. Demonstrate the various mouse handling events using suitable example.
24. Write a program to create menu bar and pull-down menus.
14 of 15

CA- C10P: DATABASE MANAGEMENT SYSTEMS LAB

PART – A

1. Draw E-R diagram and convert entities and relationships to relation table for a given scenario.
Two assignments shall be carried out i.e. consider two different scenarios (eg. bank, college)

Consider the Company database with following Schema


EMPLOYEE (FNAME, MINIT, LNAME, SSN, BDATE,ADDRESS,SEX,SALARY, SUPERSSN,
DNO)
DEPARTMENT (DNAME, DNUMBER,MGRSSN,MSRSTARTDATE)
DEPT_LOCATIONS (DNUMBER, DLOCATION)
PROJECT (PNAME, PNUMBER, PLOCATION, DNUM)
WORKS_ON (ESSN, PNO<HOURS)
DEPENDENT (ESSN, DEPENDENT_NAME, SEX, BDATE, RELATIONSHIP)
2. Perform the following:
a. Viewing all databases, Creating a Database, Viewing all Tables in a Database,

Creating Tables (With and Without Constraints), Inserting/Updating/Deleting

Records in a Table, Saving (Commit) and Undoing (rollback)

3. Perform the following:

a. Altering a Table, Dropping/Truncating/Renaming Tables, Backing up / Restoring a

Database.

4. For a given set of relation schemes, create tables and perform the following Simple Queries, Simple
Queries with Aggregate functions, Queries with Aggregate functions (group by and having clause).

5. Execute the fallowing queries


a. How the resulting salaries if every employee working on the ‘Research’ Departments is given a 10%
raise.

b. Find the sum of the salaries of all employees of the ‘Accounts’ department, as well as the maximum
salary, the minimum salary, and the average salary in this department

6. Execute the fallowing queries


a. Retrieve the name of each employee Controlled by Department number 5 (use EXISTS operator).
b. Retrieve the name of each dept and number of employees working in each Department which has at
least 2 employees

7. Execute the fallowing queries


a. For each project, retrieve the project number, the project name, and the number of employee who
work on that project.(use GROUP BY)
b. Retrieve the name of employees who born in the year 1990’s

8. For each Department that has more than five employees, retrieve the department number and number of
employees who are making salary more than 40000.

9.For each project on which more than two employees work, retrieve the project number, project name and
the number of employees who work on that project.
15 of 15

10. For a given set of relation tables perform the following: Creating Views (with and without check option),
Dropping views, Selecting from a view

PART B
Create the following tables with properly specifying Primary keys, Foreign keys and solve the following
queries.

BRANCH (Branchid, Branchname, HOD)


STUDENT (USN, Name, Address, Branchid, sem)
BOOK (Bookid, Bookname, Authorid, Publisher, Branchid)
AUTHOR (Authorid, Authorname, Country, age)
BORROW (USN, Bookid, Borrowed_Date)

1. Perform the following:


a. Viewing all databases, Creating a Database, Viewing all Tables in a Database,
Creating Tables (With and Without Constraints), Inserting/Updating/Deleting
Records in a Table, Saving (Commit) and Undoing (rollback)
Execute the following Queries:

2. a. List the details of Students who are all studying in 2nd sem BCA.
b. List the students who are not borrowed any books.

3. a. Display the USN, Student name, Branch_name, Book_name, Author_name,


Books_Borrowed_ Date of 2nd sem BCA Students who borrowed books.
b. Display the number of books written by each Author.

4. a. Display the student details who borrowed more than two books.
b.Display the student details who borrowed books of more than one Author.

5. a. Display the Book names in descending order of their names.


b. List the details of students who borrowed the books which are all published by the same
publisher.

Consider the following schema:


STUDENT (USN, name, date_of_birth, branch, mark1, mark2, mark3, total, GPA)

6. Perform the following:


a. Creating Tables (With and Without Constraints), Inserting/Updating/Deleting
Records in a Table, Saving (Commit) and Undoing (rollback)

7. Execute the following queries:


a. Find the GPA score of all the students.
b. Find the students who born on a particular year of birth from the date_of_birth column.

8. a. List the students who are studying in a particular branch of study.


b. Find the maximum GPA score of the student branch-wise.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
FIFTH SEMESTER BCA

BCA501T: DATA COMMUNICATIONS AND NETWORKS


Total Teaching Hours : 60 No of Hours / Week : 04

Unit – I
Introduction: Communication Network and services, Approaches to Network Design,
Network Functions and Network Topology, Message ,packet and circuit Switching ,
Internet, Packet Switching ; Key factors in Communication Network Evolution ;
Layered Architecture and Applications – Examples of Layering , OSI Reference Model,
TCP/IP Model Telnet FTP and IP Utilities. Digital Transmission: Digital Representation
of Information: Properties of digital transmission: Characterization of Communication
Channels Frequency Domain and Time Domain : Fundamental limits in Digital
Communication – The Nyquist Signalling rate, The Shannon channel capacity : Line
coding , Modems & digital Modulations
[ 12 Hours ]
Unit - II
Transmission Systems: properties of media and digital transmission Systems – Twisted
Pair , Coaxial Cable, Optical Fibre, Radio Transmission Intrared Light Error detection
and correction – Error detection , Two – dimensional parity checks , Internet checksum ,
Polynomial code; standardized Polynomial codes , Error detecting capability of a
polynomial code, Multiplexing – frequency – Division , Time – Division , SONET;
Wavelength Division Multiplexing Circuit switches; Telephone network , signalling
Traffic and Overload control in Telephone networks – Concentration, Routing Control,
Overload controls Cellular Telephone Networks, Satellite Cellular networks.
[ 12 Hours ]
Unit – III
Peer –to-Peer Protocols:- Peer-to peer Protocols and service models ARQ Protocols stop
and wait , Go –back-N Selective Repeat , Transmission efficiency of ARQ Protocols,
Other adaptation functions , - Sliding window flow control Timing Recovery in
Synchronous Services Reliable Stream Service, Data Link Control, HDLC, PPP ;
Statistical Multiplexing.
[ 12 Hours ]
Unit - IV
Local Area Networks and Medium access Control Protocols:- Multiple access
communications; Local Area network – LAN Structure, MAC Sublayer, Logical link
control layer, Random Access protocols ALOHA , Slotted ALOHA, CSMA, CSMA/CD,
Scheduling approaches to medium access control – Reservation Systems, polling , Token
passing rings, comparison of Random access & Scheduling access control Comparison of
Radom access & SHEDULING MEDIUM access controls; Channelization – FDMA,
TDMA, CDMA;
[ 12 Hours ]
Unit - V
LAN Standard –Ethernet and IEF, 802.3 LAN Standard ; Token Ring and IEEE 8025
LAN standard , FDDI, Wireless LAN’s and IEEE 802.11 Standards; LAN Bridges –
Transparent Bridges , Source Routing Bridges , Mixed – media Bridges. Packet
Switching Networks :- Network services & Internal Network Operation; Packet Network
Topology; Datagrams & VIRTUAL circuits ; structure of switch/ Router, Connectionless
packet switching ; Virtual – Circuit packet switching ; Overview of Routing and
congestion in packet networks – Routing algorithms classification , Routing tables,
Page 26 of 38
shortest path routing algorithms, Flooding , Hierarchical routing , Distance vector routing
Link state routing , congestion control algorithms. [ 12 Hours ]

Text Books:
1. Stallings, “Data and Computer Communications”, 7th Edition,Pearson Education, 2012
Reference Books:
1. Andrew S Tanenbaim, “Computer Networks”, 4th Edition, Pearson Education.
2. Behrouz Ferouzan, Introduction to Data Communication & Networking TMH, 1999.
3. Larry &Peterson & Bruce S Davis; Computer networks Second Edition , Morgan
Kaufman, 2000.

BCA502T : SOFTWARE ENGINEERING


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Introduction: Software Products and Software process, Process models: Waterfall modal,
Evolutionary Development, Bohemia’s Spiral model, Overview of risk management,
Process Visibility, Professional responsibility. Computer based System Engineering:
Systems and their environment, System Procurement, System Engineering Process,
System architecture modelling. Human Factors, System reliability Engineering.
Requirements and Specification: The requirement Engineering Process, The Software
requirement document, Validation of Evolution of requirements, Viewpoint – oriented &
method based analysis , system contexts , Social 7 organizational factors . Data flow ,
Semantic, Objects, models , Requirement Specification, Non functional requirement.
[ 12 Hours ]
Unit - II
Software Prototyping: Prototyping in software process, Prototyping techniques, User
interface prototyping. Software Design: Design Process, Design Strategies, Design
Quality , System Structuring control models, Modular decomposition , Domain Specific
architecture.
[ 12 Hours ]
Unit - III
Object Oriented& function oriented design: Objects, object Classes and inheritance
Object identification, An object oriented design example, Concurrent Objects, Data flow
design Structural decomposition, Detailed Design, A Comparison of design Strategies.
User interface design: Design Principles, User System interaction, Information
Presentation, User Guidance, Interface Evaluation.
[ 12 Hours ]
Unit - IV
Software Reliability and reusability : Software reliability metrics , Software reliability
Specification , Statistical testing ,Reliability Growth modeling, Fault avoidance &
tolerance, Exception handling & defensive programming , Software development with
reuse, Software’ development for reuse , Generator based reuse, Application System
Portability.
[ 12 Hours ]
Unit - V
Software Verification and Validation : The testing Process , Test Planning & Strategies,
Black Box , Structural, interface testing , Program inspections , Mathematically based
verification, Static analysis tools, Clean room software development. Management
Issues: Project management, Quality management, Software cost estimation, Software
maintenance. [ 12 Hours ]
Page 27 of 38
Text book
1. Ian Sommerville – Software Engineering, 9th Edition, Pearson Education Ltd,
2010.
Reference Books
1. Roger S. Pressman – Software Engineering, A Practitioner’s approach, 7th
Edition, McGRAW-HILL Publication, 2010.
2. Pankaj Jalote, “An integrated approach to Software Engineering”, 3rd Edition,
Narosa Publishing House, 2013.

BCA503T: COMPUTER ARCHITECTURE


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
DIGITAL LOGIC CIRCUITS: Logic gates Boolean algebra, map simplification,
combinational circuits, flip-flop, sequential circuits. INTEGRATED CIRCUITS AND
DIGITAL FUNCTIONS: Digital integrated circuits, IC flip –flops and registers,
decoders and multiplexers, binary counters, shift registers, random –access memories
(RAM) read –only memories (ROM).
[ 12 Hours ]
Unit - II
DATA REPRESENTATION: Data types, fixed-point representation, floating – point
representation, other binary codes, error detection codes.
DATA TRANSFER OPERATIONS: Register Transfer, Memory Transfer and I/O
Transfer.
[ 12 Hours ]
Unit – III
BASIC COMPUTER ORGANISATION AND DESIGN: Instruction codes, computer
instruction, timing and control, execution and instruction, input-output and interrupt,
design of computer.
[ 12 Hours ]
Unit - IV
CENTRAL PROCESSOR ORGANIZATION : Processor bus organization, arithmetic
logic unit (ALU) instruction formats, addressing modes, data transfer and manipulation ,
program control, microprocessor organization.
[ 12 Hours ]
Unit – V
INPUT-OUTPUT ORGANISATION: Peripheral devices . asynchronous data transfer ,
direct memory access (DMA) ,priority interrupt, input –output processor (IOP).
MEMORY ORGANIZATION : Auxiliary memory, microcomputer memory hierarchy ,
associative memory , virtual memory, cache memory.
[ 12 Hours ]
Text Books
1. M.Moris Mano , Computer System, Architecture, 2nd Edition Prentice Hall of
India.
References
1. Heuring and Jordan, Computer systems design and Architecture , Peason Edition
2. William Stallings , Computer Organisation and Archotecture, Peason Education
3. Floyed , Digital Fundamentals,8th Edition , Peason Education.
4. Andrew S. Temenbauam, Structured Computer Organization , 3rd Edition ;
Prentice Hall of India.
5. David Patterson & Hennessy , Computer Organization & Design , Elsevier.
Page 28 of 38
BCA504T: OBJECT ORIENTED PROGRAMMING USING JAVA
Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Introduction to JAVA: JAVA Evolution: Java History, Java Features, How Java Differs
from C and C++, Java and Internet, Java and World Wide Web, Web Browsers,
Hardware and Software Requirements, Java Support Systems, Java Environment.
Overview of JAVA Language: Introduction, Simple Java program, More of Java
Statements, Implementing a Java Program, Java Virtual Machine, Command Line
Arguments, Programming Style. Constants, Variables, and Data Types: Introduction,
Constants, Variables, Data Types, Declaration of Variables, Giving Values to Variables,
Scope of Variables, Symbolic Constants, Type Casting, Getting Values of Variables,
Standard Default Values, Operators and Expressions: Introduction, Arithmetic Operators,
Relational Operators Logical Operators, Assignment Operators, Increment and
Decrement Operators, Conditional Operators, Bitwise Operators, Special Operators,
Arithmetic Expressions, Evaluation of Expressions, Precedence of Arithmetic Operators,
Type Conversion and Associativity, Mathematical Functions. Decision Making and
Branching: Introduction, 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. Decision Making and Looping: Introduction. The while
Statement, The do Statement, The for Statement, Jumps in Loops Labeled Loops.
[ 12 hours]
Unit -II
Classes, Arrays, Strings and Vectors: Classes, Objects and Methods: Introduction,
Defining a Class, Adding Variables, Adding Methods, Creating Objects, Accessing Class
Members, Constructors, Methods Overloading, Static Members, Nesting of Methods,
Inheritance: Extending a Class Overriding Methods, Final Variables and Methods,
Finalizer methods, Abstract Methods and Classes, Visibility Control. Arrays, Strings and
Vectors: Arrays, One-dimensional Arrays, Creating an Array, Two -Dimensional Arrays,
Creating an Array, Two – dimensional Arrays, Strings, Vectors, Wrapper Classes.
[ 12 Hours ]
Unit - III
Interfaces, Packages, and Multithreaded Programming: Interfaces: Multiple Inheritance:
Introduction, Defining Interfaces, Extending Interfaces, Implementing Interfaces,
Accessing Interface Variables. Packages: Putting Classes together: Introduction, Java
API Packages, Using System Packages, Naming Conventions, Creating Packages,
Accessing a Package, Using a Package, Adding a Class to a Package, Hiding Classes.
Multithreaded Programming: Introduction, Creating Threads, Extending the Thread
Class, Stopping and Blocking a thread, Life Cycle of a thread, Using Thread Methods,
Thread Exceptions, Thread Priority, Synchronization, Implementing the ‘Runnable’
Interface.
[ 12 Hours ]
Unit - IV
Managing Exceptions, Applet Programming: Managing Errors and Exception:
Introduction, Types of Exception Handling Code, Multiple Catch Statements, Using
Finally Statement, Throwing Our Own Exceptions, Using Exceptions for Debugging.
Applet Programming: Introduction, How Applets Differ from Applications, Preparing to
Write Applets, Building Applet Code, Applet Life Cycle, Creating an Executable applet,
Designing a Web Page, Applet Tag, Adding Applet to HTML File, running the Applet,
More About HTML Tags, Displaying Numerical Values, Getting Input from the User.
[ 12 Hours ]
Page 29 of 38
Unit - V
Graphics Programming, Input/Output: Graphics programming: Introduction, The
Graphics Class, Lines and rectangles, circles, and Ellipses, Drawing Arcs, Drawing
Polygons, Lines Graphs, Using Control Loops in Applets, Drawing Bar Charts.
Managing Input/Output Files in JAVA: Introduction, Concept of Streams, Stream
Classes, Byte Stream Classes, Character Stream Classes, Using Streams, Other Useful
I/O Classes, Using the File Class, Input / Output Exceptions, Creation of Files, Reading /
Writing Characters, Reading / Writing Bytes, Handling Primitive Data Types,
Concatenating and Buffering Files, Interactive Input and output, Other Stream Classes.
[ 12 Hours ]

Text Books:
1. A.Balaguruswamy, “Programming with JAVA”, A Primer, TMH, 1999.
Reference Books:
1. Thomas Boutel, “CGI programming in C and Perl”, Addison – Wesley, 1996.
2. Jefry Dwight et al, Using CGI, Second Edition, Prentice Hall, India, 1997.
3. Patrick Naughton & Herbert Schildt, JAVA 2: The Complete Reference, THM,
1999.
4. Schildt, “JAVA The Complete Reference”, 7th Edition.

BCA505T : MICROPROCESSOR AND ASSEMBLY LAGUAGE


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Architecture and Operation: Introduction to 8085, Microprocessor organization/
architecture & its operation Microprocessor based system, memory interfacing , basic
interfacing concepts ,interfacing I/O devices
[ 12 Hours ]
Unit - II
Programming the 8085: Programming model, instruction classification , Instruction
format, addressing modes, writing assembly level programs-overview of instruction set,
timing diagrams data transfer, Arithmetic, Logic branch operations.
[ 12 Hours ]
Unit - III
Programming techniques- Looping Counting and Indexing , 16 bit arithmetic operations ,
logic operations Compare and rotate operations . Counters and Time delays , Generation
of pulse waveforms. Stacks and subroutines- conditional CALL and RETURN
instructions. Advanced subroutine concepts. BCD to Binary and Binary to BCD
conversions, BCD to 7 segment conversion , Binary to ASCII and ASCII to Binary code
conversion, BCD addition and subtraction , multiplication and division.
[ 12 Hours ]
Unit – IV
Memory Interface: Memory and I/O mapping and interfacing concepts. Interrupts : 8085
vectored interrupts , Restart as Software instructions, additional I/O concepts and
processes.
[ 12 Hours ]
Unit – V
Interfacing of peripherals (I/Os) and applications: Interfacing Keyboard (linear and
matrix) and 7 segment display including multiplexes, 8279 programmable keyboard
/display interface, 8255 PPI , 8259 PIC , DMA and 8257 DMA controller , Serial
communication using 8251, D to A converters and interfacing, RS323 serial
Page 30 of 38
communication standards.
[ 12 Hours ]
Text books
1. R.S.Gaonkar – Microprocessor Architectutre , Programming and Application with
8085. Penram Int. 3rd Edn.
References
1. Douglas V.Hall- Microprocessors and digital systems, MH.
2. Kenneth L.Short - Microprocessor and Programmed Logic ‘’, PHI , 2nd Edn.
3. Aditya P. Mathur- Introduction to Microprocessors, 3RD Edn. TMH
4. Antonakos: Introduction to Intel family of Microprosessors Pearson Education
5. Hoffer: Modern Systems Analysis and Design Pearson Eduction Kendall, System
Analysis and Design

BCA504P : JAVA PROGRAMMING LAB


PART - A
1. Write a program to find factorial of list of number reading input as command line
argument.
2. Write a program to display all prime numbers between two limits.
3. Write a program to sort list of elements in ascending and descending order and
show the exception handling.
4. Write a program to implement all string operations.
5. Write a program to find area of geometrical figures using method.
6. Write a program to implement constructor overloading by passing different
number of parameter of different types.
7. Write a program to create student report using applet, read the input using text
boxes and display the o/p using buttons.
8. Write a program to calculate bonus for different departments using method
overriding.
9. Write a program to implement thread, applets and graphics by implementing
animation of ball moving.
10. Write a program to implement mouse events and keyboard events.
PART – B
During practical examination the External and Internal examiners may prepare exam
question paper related to theory syllabus apart from Part-A. (A minimum of 10
Programs has to be prepared).
Note :
a) The candidate has to write both the programs One from Part-A and other from
Part-B and execute one program as of External examiner choice.
b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in
the Practical Record.
c) Scheme of Evaluation is as follows:
Writing two programs - 10 Marks
Execution of one program - 10 Marks
Formatting the Output - 05 Marks
Viva - 05 Marks
Record - 05 Marks
Total - 35 Marks

Page 31 of 38
BCA505P: ASSEMBLY LANGUAGE PROGRAMMING LAB
PART - A
1. Exchange of two 16-bit numbers.
2. Addition & Subtraction of two 8 –bit HEX numbers.
3. Subtraction of two 16 –bit numbers.
4. Two n-byte Number addition.
5. Block Transfer.
6. ‘N’ Decimal Number addition.
7. 4-Digit BCD addition.
8. Subtraction of 16 –bit number.
9. Sorting of array in ascending order.
10. Multiplication of 2 digit BCD
PART – B
During practical examination the External and Internal examiners may prepare exam
question paper related to theory syllabus apart from Part-A. (A minimum of 10
Programs has to be prepared).
Note :
a) The candidate has to write both the programs One from Part-A and other from
Part-B and execute one program as of External examiner choice.
b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in
the Practical Record.
c) Scheme of Evaluation is as follows:
Writing two programs - 10 Marks
Execution of one program - 10 Marks
Formatting the Output - 05 Marks
Viva - 05 Marks
Record - 05 Marks
Total - 35 Marks

BCA506P : PROJECT
Students can develop a project in team (maximum three members). They should
implement their project in college in any RDBMS package or any language available in
the college. The students have to collect data outside practical hours. Project may be
taken outside but must be implemented in the college. Internal marks can be awarded by
the guide by evaluating the performance of the students during the course of project
work. In viva-voce the questions must be directed only on the project work to access the
involvement and understanding of the problem by the students.
The project carries 100 marks is distributed as follows:
Demonstration and Presentation 65 Marks
Viva-voce 25 Marks
Project Report 10 Marks

SIXTH SEMESTER BCA

BCA601T : THEORY OF COMPUTATION


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Introduction to Finite Automata: The central concepts of Automata theory; Deterministic
finite automata; Nondeterministic finite automata. An application of finite automata,
Page 32 of 38
Finite automata with Epsilon transitions.
[ 12 Hours ]
Unit - II
Regular Expressions: Finite Automata and Regular Expressions Applications of Regular
Expressions. Regular languages; Proving languages not to be regular languages; Closure
properties of regular languages; Decision properties of regular languages; Equivalence
and minimization of automata.
[ 12 Hours ]
Unit - III
Context–free grammars: Parse trees; Applications; Ambiguity in grammars and
Languages. Definition of the Pushdown automata; the languages of a PDA; Equivalence
of PDA’s and CFG’s.
[ 12 Hours ]
Unit - IV
Deterministic Pushdown Automata:Normal forms for CFGs; The pumping lemma for
CFGs; Closure properties of CFLs. Problems that Computers cannot solve.
[ 12 Hours ]
Unit – V
The Turing machine:Programming techniques for Turing Machines. Undecidability, A
Language that is not recursively enumerable; An Undecidable problem that is RE; Post’s
Correspondence problem.
[ 12 Hours ]

Text Book:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata
Theory, Languages and Computation, 3rd Edition, Pearson Education, 2011.
Reference Books:
1. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition,
Tata McGraw-Hill, 2007.
2. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley &
Sons, 2009.
3. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science,
Languages and Machines, 3rd Edition,Pearson Education, 2006

BCA602T: SYSTEM PROGRAMMING


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Background: Machine Structure, Evolution of the Components of a Programming
System, Assembler, Loaders, Macros, Compliers, Formal Systems. Machine Structure,
Machine Language and assembly language: General Machine Structure, Machine
Language, Assembly Language
[ 12 Hours ]
Unit - II
Assemblers: General Design Procedure, Design of assembler, Statement of Problem,
Data structure, Format of databases, algorithm, look for modularity, Table Processing:
Searching and Sorting. The Problem, Searching a table, linear Search, binary Search,
Sorting, interchange sort, Shell Sort, Bucket Sort, Radix Exchange Sort, address
calculation sort, comparison of sorts, hash or random entry searching.
[ 12 Hours ]

Page 33 of 38
Unit - III
MACRO LANGUAGE AND THE MACRO PROCESSOR: Macroinstruction, Features
of macro Facility, Macro instruction arguments, conditional macro Expansion, macro
calls within macros, macro Instructions defining macros, Implementation, Statement of
problem, implementation of a restricted facility, A two pass algorithm. A single pass
algorithm, implementation of macro calls within macros. Implementation within an
assembles.
[ 12 Hours ]
Unit - IV
LOADERS: Loader schemes, Compile & go, General loading Scheme, absolute loaders,
Subroutine Languages, Relocating loaders, Direct linking loaders, other loading Schemes
– Binders, linking loaders, Overlays, Dynamic binders. Design of absolute loader, Design
of a Direct linking loader Specification of problem, Specification of data structure,
format of data bases algorithm.
[ 12 Hours ]
Unit - V
COMPILERS: Statement of problem, Problem1: Recognizing basic Elements, Problem2:
Recognizing Syntactic cutis & interpreting meaning, Problem3: Storage Allocation,
Problem4: Code Generation. Optimization (machine independent) optimization (machine
dependent), Assembly Phase, General Model of complier. PHASES OF COMPILERS:
Simple Structure of Compiler, Brief introduction to 7 Phases of Compliers.
[ 12 Hours ]
Text Books:
1. John J. Donowon, System Programming, TATA McGraw-Hill.
Reference Books:
1. Dhamdhere: System programming and Operating System TMH
2. Beck: System Software, 3/e Pearson Education.

BCA603T : CRYPTOGRAPHY AND NETWORK SECURITY


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Introduction: Security Goals, Cryptographic Attacks, Services and Mechanism,
Techniques. Mathematics of Cryptography: Integer Arithmetic, Modular Arithmetic,
Matrices, Linear Congruence.
[ 12 Hours ]
Unit – II
Traditional Symmetric-Key Ciphers: Introduction, Substitution Ciphers, Transpositional
Ciphers, Stream and Block Ciphers. Data Encryption Standard (DES): Introduction, DES
Structure, DES Analysis, Security of DES, Multiple DES, Examples of Block Ciphers
influenced by DES. Advanced Encryption Standard: Introduction, Transformations, Key
Expansion, The AES Ciphers, Examples, Analysis of AES.
[ 12 Hours ]
Unit III
Encipherment using Modern Symmetric-Key Ciphers: Use of Modern Block Ciphers,
Use of Stream Ciphers, Other Issues. Mathematics of Asymmetric-Key Cryptography:
Primes, Primality Testing, Factorization, Chinese Remainder Theorem, Quadratic
Congruence, Exponentiation and Logarithm. Asymmetric Key Cryptography:
Introduction, RSA Cryptosystem, Rabin Cryptosystem, Elgamal Cryptosystem, Elliptic
Curve Cryptosystems.
[ 12 Hours ]
Page 34 of 38
Unit - IV
Cryptography Hash Functions: Introduction, Description of MD Hash Family, Whirlpool,
SHA-512. Digital Signature: Comparison, Process, Services, Attacks on Digital
Signature, Digital Signature Schemes, Variations and Applications. Key Management:
Symmetric-Key Distribution, Kerberos, Symmetric-Key Agreement, Public-Key
Distribution, Hijacking.
[ 12 Hours ]
Unit - V
Security at the Application Layer: PGP and S/MIME: Email, PGP, S/MIME. Security at
the Transport Layer: SSL and TLS: SSL Architecture, Four Protocols, SSL Message
Formats, Transport Layer Security. Security at the Network Layer: IPSec: Two modes,
Two security protocols, Security association, security policy, Internet Key exchange,
ISAKMP. [ 12 Hours ]
Text Book:
1. Behrouz A. Forouzan, Debdeep Mukhopadhyay: Cryptography and Network
Security, 2nd Edition, Special Indian Edition, Tata McGraw-Hill, 2011.
Reference Books:
1. Michael E. Whitman and Herbert J. Mattord: Principles of Information Security,
2nd Edition, Thomson, Cengage Delmar Learning India Pvt., 2012.
2. William Stallings: Network Security Essentials: Applications and Standards, 4th
Edition, Pearson Education, 2012.

BCA604T: WEB PROGRAMMING


Total Teaching Hours : 60 No of Hours / Week : 04
Unit - I
Fundamentals of Web: Internet, WWW, Web Browsers, and Web Servers, URLs,
MIME, HTTP, Security, The Web Programmers Toolbox. XHTML: Origins and
evolution of HTML and XHTML, Basic syntax, Standard XHTML document structure,
Basic text markup, Images, Hypertext Links, Lists, Tables.
[12 Hours]
Unit - II
HTML and XHTML: Forms, Frames in HTML and XHTML, Syntactic differences
between HTML and XHTML. CSS: Introduction, Levels of style sheets, Style
specification formats, Selector forms, Property value forms, Font properties, List
properties, Color, Alignment of text, The Box model, Background images, The <span>
and <div> tags, Conflict resolution.
[ 12 Hours]
Unit -III
Java Script: Overview of JavaScript; Object orientation and JavaScript; General syntactic
characteristics; Primitives, Operations, and expressions; Screen output and keyboard
input; Control statements; Object creation and Modification; Arrays; Functions;
Constructor; Pattern matching using expressions; Errors in scripts; Examples.
[ 12 Hours]
Unit - IV
Java Script and HTML Documents: The JavaScript execution environment; The
Document Object Model; Element access in JavaScript; Events and event handling;
Handling events from the Body elements, Button elements, Text box and Password
elements; The DOM 2 event model; The navigator object; DOM tree traversal and
modification.
[12 Hours]
Page 35 of 38
Unit - V
Dynamic Documents with JavaScript: Introduction to dynamic documents; Positioning
elements; Moving elements; Element visibility; Changing colors and fonts; Dynamic
content; Stacking elements; Locating the mouse cursor; Reacting to a mouse click; Slow
movement of elements; Dragging and dropping elements. XML: Introduction; Syntax;
Document structure; Document Type definitions; Namespaces; XML schemas;
Displaying raw XML documents; Displaying XML documents with CSS; XSLT style
sheets; XML Processors; Web services.
[ 12 Hours]
Text Books
1. Robert W Sebesta, “Programming the World Wide Web”, 4th Edition, Pearson
Education, 2008.
Reference Books
1. M.Deitel, P.J.Deitel, A.B.Goldberg, “Internet & World Wide Web How to
program”, 3rd Edition, Pearson Education / PHI, 2004.
2. Chris Bates, “Web Programming Building Internet Applications”, 3rd Edition,
Wiley India, 2006.
3. Xue Bai et al, “The Web Warrior Guide to Web Programming”, Thomson, 2003.
4. Sklar, “The Web Warrior Guide to Web Design Technologies”, 1st Edition,
Cengage Learning India.

BCA604P : WEB PROGRAMMING LAB


PART -A
1. Write a program to find factorial of list of number reading input as command line
argument.
2. Write a program to sort list of element in ascending and descending order and show
the exception handling.
3. Write a program to implement all string operations.
4. Write a program to find area of geometrical figures using method overloading.
5. Write a program to implement constructor overloading by passing different number of
parameter of different types.
6. Write a program to create student report using applet, read the input using text boxes
and display the o/p using buttons.
7. Write a program to implement an apply by passing parameter to HTML.
8. Write a program to implement thread, applets and graphics by implementing
animation of ball moving.
9. Write a program to implement mouse events.
10. Write a program to implement keyboard events.
PART – B
During practical examination the External and Internal examiners may prepare exam
question paper related to theory syllabus apart from Part-A. (A minimum of 10
Programs has to be prepared).
Note :
a) The candidate has to write both the programs One from Part-A and other from
Part-B and execute one program as of External examiner choice.
b) A minimum of 10 Programs has to be done in Part-B and has to be maintained
in the Practical Record.
c) Scheme of Evaluation is as follows:
Writing two programs - 10 Marks
Execution of one program - 10 Marks
Page 36 of 38
Formatting the Output - 05 Marks
Viva - 05 Marks
Record - 05 Marks
Total - 35 Marks

BCA604P : WEB PROGRAMMING LAB


PART - A
1. Create a form having number of elements (Textboxes, Radio buttons, Checkboxes,
and so on). Write JavaScript code to count the number of elements in a form
2. Create a HTML form that has number of Textboxes. When the form runs in the
Browser fill the textboxes with data. Write JavaScript code that verifies that all
textboxes has been filled. If a textboxes has been left empty, popup an alert
indicating which textbox has been left empty.
3. Develop a HTML Form, which accepts any Mathematical expression. Write
JavaScript code to Evaluates the expression and Displays the result.
4. Create a page with dynamic effects. Write the code to include layers and basic
animation.
5. Write a JavaScript code to find the sum of N natural Numbers. (Use user-defined
function)
6. Write a JavaScript code block using arrays and generate the current date in words,
this should include the day, month and year.
7. Create a form for Student information. Write JavaScript code to find Total,
Average, Result and Grade.
8. Create a form for Employee information. Write JavaScript code to find DA, HRA,
PF, TAX, Gross pay, Deduction and Net pay.
9. Create a form consists of a two Multiple choice lists and one single choice list
(a) The first multiple choice list, displays the Major dishes available
(b) The second multiple choice list, displays the Starters available.
(c)The single choice list, displays the Soft drinks available.
10. Create a web page using two image files, which switch between one another as the
mouse pointer moves over the image. Use the on Mouse Over and on Mouse Out
event handlers.
PART – B
During practical examination the External and Internal examiners may prepare exam
question paper related to theory syllabus apart from Part-A. (A minimum of 10
Programs has to be prepared).
Note :
a) The candidate has to write both the programs One from Part-A and other from
Part-B and execute one program as of External examiner choice.
b) A minimum of 10 Programs has to be done in Part-B and has to be maintained in
the Practical Record.
c) Scheme of Evaluation is as follows:
Writing two programs - 10 Marks
Execution of one program - 10 Marks
Formatting the Output - 05 Marks
Viva - 05 Marks
Record - 05 Marks
Total - 35 Marks

Page 37 of 38
BCA605P : PROJECT WORK

Students should individually develop a project. They should implement their project in
college in any RDBMS package or any language available in the college. The project
should web based. The students have to collect data outside practical hours. Project may
be taken outside but must be implemented in the college. Internal marks can be awarded
by the guide by evaluating the performance of the students during the course of project
work. In viva-voce the questions must be directed only on the project work to access the
involvement and understanding of the problem by the students.
The project carries 200 marks is distributed as follows:
Demonstration and Presentation 130 Marks
Viva-voce 50 Marks
Project Report 20 Marks

*********

Page 38 of 38

You might also like