16.

ffi
KANNURAVTUNIVERSITY
(Abstract)
Bachelor of Computer Application (UG) programme under Choice Based Credit and Semester
System (OBE)- updated Scheme and Syllabus- lmplemented w.e.f 2019 admission - approved-
orders issued

ACADEMIC C SECTION
Acadlc2lL237 Ll2O79 Dated: 11.06.2020

Read:-1. U.O No. Acad.C2lL237\l20lgli daled 2TlOGl2Otg

2. Letter dated 03.03.2020 from the Chairman, BoS in Computer Science (UG)
3. The Minutes of the meeting of Board of Studies in Computer Science (UG), held
on 13.03.2020
4. E-mail received from the Chairman, BoS in Computer Science,(UG), dated
27 tO5t2020

ORDER

1. As per paper read (1) above, the Scheme and Syllabus and Model Question papers of the
Bachelor of Computer Application (BCA) programme was implemented in afliliated colleges w.e.f
2019 admission.

2. Thereafter,the Chairman, Board of Studies in Computer Science(Uc) vide paper read (2)
requested to convene a meeting of the Board of Studies in Computer Science (UG) to incorporate
some modifications in the BCA Syllabus, based on the suggestions and recommendations
received from the experts in the field of lT and Academics.

3. Subsequently,the meeting of Board of Studies in Computer Science (UG) held on 13.03.2020,

recommended to update the existing syllabus of the Bachelor of Computer Application (BCA) 2019
admission, vide paper read (3) above and the Chairman submitted the updated Syllabus of the
BCA programme(2o1g admission onwards),vide the paper read(4) above,as recommended by the
Board of Studies.

4. The Following modifications were recommended by the Board of studies in Computer Science
(UG) in the BCA Syllabus.
(i) To include 'Generic Elective: Open' in the lntroduction
(ii) Updated the following syllabus

. 2B05BCA (Lab ll: Programming in C++)

. 3A12BGA (Data structure)
o 4A14BCA (Discrete Mathematical Structures)
. 4A15BCA (Lab lll: Data Structure and DBMS)
o 4B11BCA (Lab lV: Java Programming, shell programming & Linux Administration)
o 5D03BCA (Database Management System)
 (iii) The Core Course Vlll- 4808 BCA Operating System changed to
4B08BCA Software Engineering and update the syllabus
(iv) The Core Course Xl- 5B12BCA Software Engineering changed to
5B12BCA Operating System and also updated the syllabus.

5. The Vice Chancellor, after examining the mauer in detail and in exercise of the powers ot the
Academic Council as per section 11(1) Chapter lll of Kannur University Act 1996 has accorded
sanctaonto implement the aforesaid modifications as detailed in pan(4), in the Scheme and
Syllabus ot the BcA(Bachelor of Computer Application) prog,amme under CBCSS (OBE)
with eftect frcm 2079 admission, subiect to reporting before the Academic Council.

6. The U O read vide paper (1) above, stands modified to this extent

Orders are issued accordingly.

sd/-
BALACHANDRAN V K
DEPUTY REGISTRAR (ACAD)
For REGISTRAR

To: 1.The Principals of Colleges of offering Bachelor of Computer Application BCA)

programme.
2.The Examination Branch (through the PA to CE)

Copy To: 1. The Chairman BoS in Computer Science(UG)

2. PS to VC/ PA to PVC/ PA to Registrar
3.DR/AR I Academic/Es I Section
4. The Computer Programmer
(For uploading in the University Website)
5. SF/DF/FC

Forwarde / By Order

\)N, N OFFICER

't
!z
1\$
iNl', mcNn
\NNUN -t v
7C 0t

\
 -

KANNUR UNIVERSITY

BOARD OF STUDTES-COMPUTER SCTENCE (UG)

SYLL,ABUS FOR
BACHELOR OF COMPATER APPLICATIONS
CORE AND GENERIC ELECTIVE COURSES

CIIOICE BASED CREDIT SEMESTERSYSTEM

(OBE-Outcome Based Education System)

(2019 ADMTSSTON ONWARDS)

Generic Elective: Open

 KANNUR UNIVERSITY

BCAPROGRAMME

WORK AND CREDIT DISTRIBUTION STATEMENT

Hours
Total Total
Semester Course Title* Credits per
Credits Hours
week
Common Course - English I 4 5

Common Course - English II

Common Course - Additional Language I 4 5

General Awareness Course I - lAl IBCA

I 2 J l9 25
Informatics for Computer Applications
Core Course I -
IBOIBCA Programming In C 2 2
Core Course [V - 2B04BCA Lab I:
0 2
Proggamming ln C+
Complementary Elective (Mathematics I) 4 4

Common Course - English III 4 5

Common Course - English IV 3 4

Common Course - Additional Language ll 4 5

Core Course II - 2B02BCA Digital Systems J J

II Core Course III - 2803BCAObject Oriented 1 22 25

2
Progamming Using C++
Core Course IV - 2B04BCA Lab I:
I 0
Progamming ln C*
Core Course V - 2B05BCA Lab II:
I 2
Programming In C#*
Complementary Elective (Mathematics II) 4 4
General Awareness Course II - 3Al2BCA
4 4
Data Structures
General Awareness Course trI - 3AI3BCA
4 4
Database Management System
Core Course VI - 3B06BcAlntroduction to
, 4
Microprocessors
Core Course VII - 3B0TBCAJava
III f 4 l8 25
Programming
General Awareness Course V - 4AI5BCA Lab
0 3
III: Data Structure and DBMS++
Core Course Xl - 48 I IBCA Lab IV: Java
Programming, Shell Programming & Linux 0 2
Administration++
Complementary Elective (Mathematics III) 4 4
General Awareness Course lV - 4Al4BCA
4 4
Discrete Mathematical Structures
IV 2l 25
Core Course VIII - 4B08BCA Software
J 4
Engineering
 Core Course lX - 48O9BCAComputer
3 4
Organization
Core Course X - 48 I0BCA Linux J 4
Administration
General Awareness Course V - 4A I 5 BCA Lab
2 2
III: Data Structure ald DBMST*
Core Course XI - 4Bl 1BCA Lab IV: Java
Programming, Shell Programming & Linux 2 3
Administration ++

Complementary' Elective (Mathematics IV) 4 4

Core Course XII - 5B12BCA Operating
3 3
Systems
Core Course XIII - 58 l3BcAEnterprise Java
4 4
Progtramming
Core Course XIV - 5B14BCA- Srthon
2 2
Programming
Core Course XV - 5Bl5BCAWeb Technolory 2 2
Core Course XVI - 58l6BCA Discipline
3 4 t6 25
Specific Elective I
Core Course XXI- 682l BCA Lab V:
0 J
Enterprise Java Progammingt**
Core Course XXII- 6B22BCA Lab VI: fothon
0 J
Proga.mming* t +
Core Course XXIII- 6B23BCA Lab VII: Web
0 2
Technolory+rr
General Elective Course 2 2
Core Course XVII - 6B17BCA Design and 4 4
Analysis of Algorithm
Core Course XVII - 6BI8BCA Introduction
, 4
to Compiler
Core Course XIX - 6B19BCA Data
3 3
Communication & Networks
Core Course XX - 6B20BCA Discipline
3 t
VI Specific Elective II 24 25
Core Course XXI- 682l BCA Lab V:
2 2
Enterprise Java Programming+*+
Core Course XXII- 6B22BCA t^ab VI: $thon
t 2
Programmingr * +
Core Course XXIII- 6B23BCA Lab VII: Web
2 2
Technology,* * 'r
Core Course XXIV - 6B24BCA Project 4 5

Total 120 150

*Extemal exarnination will be conducted at the end of second semester

* *Extemal examination will be conducted at the end of fourth semester

** *Extemal examination will be conducted at the end of sixth semester

Complementary Elective: Mathematics

 PART A
BCA CORE COURSES
WORKAND CRE DIT DISTRIBUTION
(20I9 ADMISSION ONWARDS)

HOURS MARJ(s
COURSE EXAM L
(IltTErN
COURSE TITLE SEMESTER PER CREDIT
CODE HRS
WEEK EXTENN](L)

INFORMATICS FOR COM PUTER

IAI IBCA APPLICATIONS
I 3 2 3 l0+40

IBOlBCA PROGRAMMING IN C I 2 2
I33 l0+40
2B02BCA DIGITAI SYSTEMS 2 3
l,l: t0+40

2BO3BCA
OBJECT ORIENTED
PROGRAMMING USING C++
2 2

I SEM
l=_l 3 l0+40

2
2B04BCA LAB I: PROGRAMMING IN C 2
II SEM
I 3 5+20
0
2BO5BCA LAB II: PROGRAMMING IN C++ 2 2 I 3 5+20

3AI2BCA DATA STRUCTURES 3 4 4 3 l0+40

DATABASE MANAGEMENT t0+40
3AI3BCA 3 4 4 3
SYSTEM
INTRODUCTION TO l0+40
3BO68CA 3 4 3 3
MICROPROCESSORS
3BOTBCA JAVAPROGRAMMING 3 4 3 3 l0+40
DISCRETE MATHEMATICAL l0+40
44I4BCA 4 4 4 3
STRUCTURES
4BO8BCA SOFTWARE ENGTNEERING 4 4 3 l0+40

4BO98CA COMPUTER ORGANIZATION 4 4 3 3 l0+40

48 IOBCA LINUX ADMINISTRATION 4 4 3 3 l0+40

III SEM
LAB III: DATA STRUCTURES AND 3
4.A I5BCA 4 2 3 5+20
DBMS IV SEM
2
III SEM
LAB IV: JAVA PROGRAMMING,
2
48 I IBCA SHELL PROGRAMMING & LINUX 4 2 3 5+20
IV SEM
ADMINISTRATION
3

5BI2BCA OPERATING SYSTEMS 5 3 3 3 l0+40

5BI3BCA

5B14BCA
ENTERPRISE JAVA
PROGRAMMING
PYTHON PROGRAMMING
5

5
ffi l.
4 3
l0+40

Irc4d
58I5BCA WEB TECHNOLOGY 5 2 2 3 l0+40

5B I6BCA DISCPLINE SPECIFIC ELECTIVE I 5 4 3 3 l0+40

5D.-BCA GENERIC ELECTIVE COURSE 5 2 2 2 5+20

DESIGN AND ANALYSIS OF 10+40

68 ITBCA 6 4 4 3
ALGORITHM
68ISBCA INTRODUCTION TO COMPILER 6 4 3 3 t 0+40
 DATA COMMUNICATION & t0+40
68 I98CA 6 3 3 3
NETWORKS
6B2OBCA DISCIPLINE SPECIFIC ELECTIVE N 6 3 3 3 l0+40
V SEM
LAB V: ENTERPNSE JAVA 3
682IBCA 6
VI SEM
2 3 5+20
PROGRAMMING
2
V SEM
3
6B22BCA LAB VI: PYTHON PROGRAMMTNG 6 3 3 5+20
VI SEM
2
V SEM
2
6B23BCA LAB Vtl: WEB TECHNOLOGY 6 2 3 5+20
VI SEM
2
6B24BCA PROJI]CT 6 5 4 20+80
*AN INDUSTRTAL VISIT (STUDY TOUR) IS RECOMMENDED FOR TIIE PROJECT
WORK

LIST OF DISCIPLINE SPECIFIC ELECTIVE COURSES

HOURS
COIJRSE EXAM
COTJRSE TITLE SEMESTER PER CREDIT
CODE HRS
WEEK
5B I6BCA-EO I INFORMATION SECURITY 5 4 3

5BI6BCA-EO2 MOBILE COMMI,INICATIONS 5 4 3 3

5B I6BCA-EO3 C# AND .NET PROCRAMMING 5 4 3 3

5B I6BCA.EO4 BIO.INFORMATICS 5 4 3 3

DATA MINING AND DATA

6B2OBCA-EO I 6 3 J 3
WAREHOUSING
682OBCA-EO2 NETWORK PRO(iRAMMING 6 3 3 3

6B2OBCA-EO3 DIGITAL IMAGE PROCESSTNG 6 3 3 3

6B2OBCA-E04 CLOUD COMPUTING 6 3 3 3

EVALUATION

ASSESSMENT WEIGHTAGE
EXTERNAL 80%
INTERNAL 20%
 CORE COURSE V: 2B05BCA LAB II- PROGRAMMING IN C+
SEMESTER COURSE CODE HOURS CREDIT EXAM
PERWEEK HRS
II 2BOSBCA
.,
1 l3

Program List

Students have to practice all programs . All programs must be based on OOP concepts.

l. Program to add one day to a given date.

2. Program to find the trace and transpose of a matrix.
3. Create a class time comprises hr, min and sec.as member data and addQ and displayQ
as member functions. Use constructor to initialise the object. Write a main function to
add two time objects, store it in another time object and display the resultant time
(constructors)
4. Program to fmd biggest, smallest, sum and difference of two numbers using inline
function.
5. Program to find the area and volume of respective figures using firnction overloading.
6. Program to add the elements of an array to the corresponding elements of another
array
7. Program to negate the elements of an array. Use operator overloading function with
the operator -. (operator overloading - unary)
8. Program to compare two strings. Use operator overloading (:). Do not use any built
in firnctions. (operator overloading - binary)
/ /
9. Program for Addition Subtraction Multiplication of complex numbers using
classes. (operator overloading)
10. Define a class student with name, reg.no, date of birth and name of college as member
data and functions to get and display these details. Design another class Test with
subjects of study and grade for each subject as member data and corresponding input
and output flrnctions. Derive a class Result from both Student and Test classes and
Print the Result of each student with relevant information. (inheritance)
11. Start with an array of pointers to strings representing the days of the week. Provide
firnctions to sort the strings into alphabetical order. Use pointers (array ofpointers)
12. Desigp two classes A and B with member data a and b respectively. Set values for the
data member. Write a program to increment the interchange the values of both A and
B. Use friend function. (friend functions)
13. Design a class employee with relevant details. Read the details of n employees from
the keyboard and write it into a File named 'EmpDataFile'. Also read the details back
from the same file and display. Use separate functions to write and read into and out
ofthe file. (can use object pointers )
14. Define a class to represent a bank account. Include the following members :

' Data Members:

 1 . Name of the depositor.
2. Account number.
3. Type ofaccount.
4. Balance amount in the account.
' Member Functions
5. To assign initial values.
6. To deposit an amount.
7. To withdraw an amount after chggking the balance.
8. To display name and balance.
' Use appropriate main program. (application level calsspgrn)
15. Create a base class called shape. Use this class to store two double type values that
could be used to compute the area of figures. Derive two specific classes called
TRIANGLE and RECTANGLE from the base SHAPE. Add to the base lass, a
member firnction get_data0 to initialize base class data members and another member
firnction display_areaQ to compute and display the area of figures. Make
display_areaQ as a virtual function and redefine this function in the derived class to
suite the requirements (vfutual functions)

GENERAL AWARENESS COURSE tr : 3A12BCA DATA STRUCTURf,S

SEMESTER COURSE CODE HOURS CREDIT EXAM

PER WEEK HRS
III 3AI2BCA 4 4 3

COURSE OUTCOME

COl: Understand the concept ofdata structures and its relevance in computer science.
CO2: Familiarize with selected linear and nonlinear data structures.
CO3: Enhance skill in programming.

Unit l:
Data structures: Definition and Classification. Array: - Operations; Number of elements;
Array representation in memory. Polynomial representation *'ith arrays; Polynomial addition.
Sparse matrix: Addition of sparse matrices. The concept of recursion: types, example:
factorial and Tower of Hanoi problem . (12 IIrs)

Unit II:
Sorting algorithms: Insertion, bubble, selection, quick and merge sort; Comparison of Sort
algorithms. Searching techniques: Linear and Binary search. ( 12 Hrs)
Unit III:
Stack: Operations on stack; array representation. Application of stack- i. Postfix expression
evaluation. ii. Conversion of infix to postfix expression. Queues: Operation on queue.
Circular queue; Dequeue, and priority queue. Application of queue: Job scheduling. (15 Ilrs)

Unit IV:
Linked list - Comparison with anays; representation of linked list in memory. Singly linked
list- structure and implementation; Operations - traversing; Add new node; Delete node;
Reverse a list; Search and merge two singly linked lists. Stack with singly linked list. Circular
linked list - adviurtage. Queue as Circular linked list. Doubly linked list - structure;
Operations - Add/delete nodes; Advantages. ( 15 Hrs)

Unit V:
Tree and Binary tree: Basic terminologies and properties; Linked representation of Binary
tree; Complete and full binary trees; Binary tree representation with array. Tree travenal: in
order, pre order and post order traversals. Binary Search Tree. Application of binary tree:
Huffinan Code.
(10 Hrs)

Books for Study:

l. Classic Data structures, Samanta, Second Edition, PHI

Books for Reference:
1. Data Structures and Algorithms: Concepts, Techniques and Applications; GAV Pai,
Mc Graw Hill, 2008
2. Fundamentals of Data structures in C++ , 2'd Edn, Horowitz Sahni,
Andersorl Universities Press
 GENERAL AWARENESS COURSE IV:4A14BCA DISCRETE
MATHEMATICAL STRUCTURES

SEMESTER COURSE CODE HOURS CREDIT EXAM

PERWEEK HRS
IV 4AI4BCA 4 4 3

COURSE OUTCOME

COl: Fundamental mathematical concepts and terminology for Computer Science

CO2: Acquire knowledge in Mathematical Logic
CO3: Gain knowledge in Boolean Algebra
CO4: Awareness about the importance of Graph Theory in Computer
Science

Unit I :
Set Theory: Basic concepts- Venn diagram- Cartesian product. Functions: injective,
subjective, bijective. Mathematical Logic - Propositional Calculus - Statement, Connectives,
negation, conjuction, disjunction, conditional, biconditional, statement & equivalence
formula- Well Formed Formula (WFF)- Tautologies, Normal Forms, Rules of inference. (15
Hrs)

Unit II:
-
Functions and Relations: Functions Types of Functions, Composition of Functions and
lnverse Functions. Relations - Relations and Their Properties, Functions as relations, Closure
of Relations, Composition of relations, Equivalence Relations and Partitions. Partial
Ordering, Hasse Diagram.The Pigeonhole Principle. (15 Hrs).

Unit III:
Boolean algebra: Definition, laws, Boolean fimctions and expressions- representation of
Boolean expressions- applications ofBoolean algebra. (10 tlrs).

Unit IV:
Graph theory l:Basic concepts- path- circuit- subgraph- bipartite graph- complete bipartite
graph- Isomorphic graph-. Trees: Definition- spanning tree- minimal spanning tree (MST)-
DFS- BFS- incidence matrix - Traveling salesman's problem. (12 Hrs).

Unit V:
Graph theoryll: Planar graph- Shortest Paths in Weighted Graphs- Euler's Paths and Circuits,
Hamiltonian Paths and Circuits. Storage representation and manipulation of graphs. Coloring
chromatic number. ( l2 l:lrs).
Books for Study:

l. Discreate Mathematics and Its Applications with Combinatorics and Graph Theory,
Kamala Krithivasan, McGraw Hill Education, 2011 (Seventh Edition).

Books for Reference:

1. J. K. Sharm4 Disqete Mathematics, Macmillan Publishers India Limited, ISBN:
1403924759.
2. Alan Doerr and Kenneth Levassur, Applied Discrete Structure for Computer Science,

Galgotia Publications Pvt. Ltd, ISBN: 9780574217554.

3. Discreate Mathematics ,NChSN Iyengar, V M Chandrasekharan, KA
Venkatesh, PS
Arunachalam, Vikas Publishing , 2003.
4. C Liu and D. Mohapatr4 Elements of Discrete Mathematics - A Computer (hiented
Approach, TMH, ISBN: 1259006395.

GENERAL AWARENESS COURSE V: 4A15BCA LAB -III

DATA STRUCTURES &DBMS
SEMESTER COURSE CODE HOURS CREDIT EXAM
PERWEEK HRS
IV 4A1sBCA III SEM 3 Hrs, ) 3
IV SEM 2 Hrs

Progran List

Section A: DATA STRUCTURE

1. Add two polynomials.

2. Sequential and binary search : Print number of comparison in each case for given datasets.
3. Insertion sort: number of comparisons and exchanges for given dala sets.

4. Bubble sort: Print number of comparisons and exchanges for given data sets.

5. Selection sort: Print number of comparisons md s)(shanges for given data sets .

6. Quick sort.

7. Stack operation: addition and deletion of elements

8. Queue operation: addition and deletion of elements

9. Conversion of infix expression to postfx.

10. Menu driven program: to add / delete elements to a circular queue. Iaclude necessary
eror messages.

11. Singly linked list operations : add a new node at the beginning, at the end, after ith node,
delete from beginning, end, print the list.
12. Circular linked list : add a new node at the beginning, at the end, after ith node, delete
from beginning, end, print the list.
13. Doubly linked list : add a new node at the beginning, at the end, after ith node, delete
from beginning, end, print the list.
14. Implement tree traversal.

15. Merge two sorted linked list.

Section B: DBMS

Minimum 10 exercises covering SQL related topics. Sample exercises are given below:

sQL -l
Create table students with fields sno, $ulme, sex, mark with sno as primary keyand assign
suitable constraints for each attribute.Insert five records into the table.
l. Alter the table by adding one more field rank.
2. Display all boy students with their name.
3. Find the Average mark
4. Create a query to display the sno and sname for all students who got More than the
5. average mark. Sorts the results in descending order of mark.
6. Display all girl student names for those who have marks greater than 20 and less than
40.

SQL -2
Create a table department with fields ename, salary, dno, dname, place with dno asprimary
key.lnsert five records into tle table.
1. Rename the field 'place' with 'city'
2. Display the employees who got salary more than Rs.6000 and less thanl0000 /-
3. Display total salary ofthe organization
4. Display ename for those who are getting salary in between 5000 and 10000.
5. Create a view named 'Star' with field ename, salary & place
6. Display ename and salary with salary rounded with 10 digits'*'

sQL -3
Create a table department with fields dno, dname, dmanagel and place with dno asprimary
key.
Create a table emp with fields eno, ename, job, dno, salary, with eno as primary key.Set dno
as foreigrr key.
lnsert five records into each table.
l. Display the enarne and salary, salary with ascending order
2. Display ename and salary for eno=20,
3. Display the manager for the accounting Department
4. Display the name,salary and manager ofall employees who are getting salary > 5000
5, Write the queries using various group functiors.
6. Write the queries using various Number functions.
sQL -4
Create a table emp with fields eno,ename, job, manager and salary, with eno as primary
key. Insert values into the table.
l. Display ename, salary from emp who are getting salary more than average salary of
2. the organization.
3. ADD 20%DA as extra salary to all employees. Label the coloumn as 'New Salary'
4. Create a query to display the eno and ename for all employees who eam more tlantle
average salary. Sort the results in descending order of salary.
5. Create a view called emp_view based on the eno, ename from emp table change
theheading for the ename to 'EMPLOY'.
6. Write a query that will display t}le eno and ename for all employees whose
namecontains a 'T'.

sQL -s
Create a table department with fields dno, ename, salary, Designation, dname and place with
dno as primary key. Insert values into the table.
1. Write the queries using various Character functions in ename field.
2. Create a query to display the employee number and narne for all employees who
eammore than the average salary. Sort the results in descending order of salary.
3. Display all employees who got salary between 5000 &10000
4. Display ename, salary, Designation for those who got salary more than 5000 or
hisDesignation is'clerk'.
5. Display ename and designation those who are not a clerk or manager.
6. Display the names of all employees where the third letter of their name is an 'A'

SQL -6
Create a table Customer with fields cid, cnarne, date_of_birth and place
Create table loan with fields loanno, cid and brnme assigning suitable consraints.
Create table depositor with fields accno, cid, balance and bname assigning suitable
constraints.
Insert 5 Records into each table.
1. Add one more field amount to loan table. Update each record. Display cname
forcid=2.
2. Calculate Rs 150 extra for all customers having loan.The added loan amount will
3. display in a new coloumn.
4. Display loanno, cname and place of a customer who is residing in Kannur city.
5. Display all information from loan table for loanno 2,8,10.
6. Display all customers who have both loan and deposit.
 CORE COURSE XI: 4B11BCA LAB- IV: JAVA PROGRAMMING' SHELL
PROGRAMMING & LINUX ADMINISTRATION
SEMESTER COURSE CODE HOURS CREDIT EXAM
PERWEEK HRS
IV 4B11BCA III SEM 2 Hts, ) 3
IV SEM 3 Hrs

Program List

Java Programming Lab cycle - maintained as it is

Shell Programming Lab cycle - maintained as it is

LINUX ADMINISTRATION - (Lab cycle for Linux configuration part)

l. Linrx installation, up gradation, Installation and removal of packages and lnstallation of

a peripheral devices (Printer) - lnstallation steps and configuration
2. Starting and stopping services in run level. The service command
3. Managing process- viewing status, killing, restarting etc using ps.
4. Adding and deleting user accounts, changing passwords.
5. Changing the environment variables like PATH
6. Scheduling jobs using cron
7. Mounting and unmounting extemal file systems
8. Setting the value of umash changing the permissions, changing owner and groups
9. Archiving and Backup using tar. Restoring backup
10. Compressing and uncompressing files using any one tool

GENERIC ELECTIVE COURSE: 5DO3BCA DATABASE MANAGEMENT SYSTEM

SEMESTER COURSE CODE HOTJRS CREDIT EXAM

PERWEEK HRS
v 5DO3BCA ) ) )

COURSE OUTCOME

COl: To understand the firndamentals of database management system

CO2: To develop Skill in designing database

 C03: To understand the concept ofSQL commands
CO4: To develop Skill in writing queries

Unit I
lntroduction-Field, Record, Entity, Attribute, Relation, Domain, Tuple- advantages of
database systems- data models (Network model, Hierarchical Model, DBTG CODASYL
model, Relational Model(E-R) - system structure. (8 hrs)
Unit II:
Database administrator- data base users, Constraints (Primary, Foreigrr, Candidate, Unique)-

(6 hrs)

Unit III
Relational Algebra (Uniorl lntersection, Difference, Produc! Projec! Selection). (6 hrs)
UnitIV:
SQL: Inhoduction to SQL, database languages, DDl(create, alter, Drop), DMl(hsert ,

Selec! Update, Delete) and DCL commands. Data Types in SQL (8 hrs)
Unit V:
SQL Functions(Different Types of Functions), Operators (Arithmetic, Relational, lngical),
Sub Quires (in Detail), Clauses (Having, Group By) (8 hrs)

Books for Study:

I . Data Base Concept 3 edition Abraham Silberschatz, Henery f Korth McGraw Hill
2. A Guide to the SQL Standard, C. J. Date and Hugh Darwe4 1997, Addison-Wesley

Books for Reference:

l. An lntroduction to Database Systems, C. J. Date, 1994, Addison-Wesley

2. Understanding the New SQL, Jim Melton and Alan R. Simon, 1993, Morgan Kaufuann.
3. Principles of Database & Knowledge Jeffiey D. Ullmaru Computer Science Press, 1988

4B08BCA OPERATING SYSTEMS is moved to V Semester and 5B12BCA Softwore Engineering

lo lhe lourlh Semester (Courses inlerchanged mainlaining the credit and hourc as presc bed
earlier)

The software Engineering paper can be moved to IV semester and the Operating Systems paper can
be moved to V semester (please consider this as the SE concepts can be introduced before they start
the project work in the frfth semester)
 CORE COURSE VIII: 4B08BCA SOFTWARE ENGINEERING
SEMESTER COURSE CODE HOTJRS CREDIT EXAM
PER WEEK HRS
IV 4BOSBCA 4 3 3

COURSE OUTCOME

COl: Understand the basic processes in software Development lifecycle.

CO2: Familiarize with different models and theirsignificance.
CO3:Familiarize with requirement engineering and classical software
designtechniques.
CO4: Familiarize with various software testing techniques andtools.

Unit I :
Introduction to software engineering-Definition, program versus software, software process, software
characteristics, brief introduction about product and process, software process and product matrices;
Software life cycle models - Definition, rvaterfall model, increment process model, evolutionary
process model, selection ofthe life cycle model. (l4tlrs)

Unit II :

Software Requirement Analysis and Specification - Requirements engineering, types of

requirements, feasibility studies, requirement elicitation, various steps of requirement analysis,
requirement documentation, requirement validation. ( l4Hrs)

Unit III :
Software design - definition, various t)?es, objectives and importance of design phase, modularity,
strategy of design, function-oriented design, IEEE recommended practice for software
designdescriptions. (l4Hrs)

Unit IV :

Objected Oriented Design - Analysis, design concep! design notations and specifications, design
methodolory. (12Hrs)

Unit v :
Software Testing - What is testing, Why should we test, who should do testing? Test case and Test
suit, verification and validation, alpha beta and acceptance testing, functional testing, techniques to
design test cases , Boundary value analysis, equivalence class testing, decision table based testing;
structural testing , path tesring , Graph matrices , Data flow testing , levels of testing ,unit testing ,
integration testing, system testing, validationtesting (20 hrs)
 V Semeste r

CO XII: 5B12BCA OPERATING SYSTEM

SEM ESTER COURSE CODE HOURS CREDIT EXAM
PERWEEK HRS
v 5B12BCA 3 3 3

COURSE OUTCOME

COl: Understand the basic concepts, structure and fiurctions of operating systems.
CO2: Understand the principles behind the techniques in resource management
CO3: Knowledge about the basic design of the OS

OPERATING SYSTEMS OVf,RVIEW (10 hours)

Operating System Structure, Operating system operations, Functions : Process Management, Memory
Managemenq Storage Management, Protection and Security. Operating System Services, User
Operating System lnterface, System Calls, OS design and implementation , Operating System
Structure

IJMT II
PROCESS MANAGEMENT ( 14 hrs)
Processes:Process Concept, Process Scheduling" Operations on Processes, Interprocess
Communication. CPU Scheduling: Basic concepts, Scheduling criteri4 Scheduling algorithms.
Deadlocks: System Model ,Deadlock Characterization , Methods for Handling Deadlocks, Deadlock
Prcvention, Deadlock Avoidance,Deadlock Detection, Recovery from Deadlock

I,]NIT ru
MEMORY MANAGEMENT (12 hn)
Main Memory : Contiguous Memory Allocation, Segnentation, Paging, Structue of the Page Tables
Virtual Memory : Background, Demand Paging, Page Replacement. OS examples

TJI\IIT TV
STORAGE MANAGf,MENT (10 hrs)
Mass Storage Structure : Overview, Disk Scheduling , Disk Management. File System Storage: File
Concep6, Directory and Disk Structure, File Sharing Protection. File System Implementation: File
System Structure, Directory Structure, Allocation Methods, Free Space Management.

T]NIT V
UO SYSTEMS (6 hrs)
UO systems : Overview, l/O hardware, Application UO interface. Kemel VO subsystem,
Transforming I/O Requests to Hardrvare Operations.

TEXTBOOK:
Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, "Operating System Concepts", 9th
Edition, John Wiley and Sons Inc.,2012

REFERENCES:

. Andrew S. Tanenbaum, "Modern Operating Systems", Second Edition, Addison Wesley,

2001.
o D M Dhamdhere, "Operating Systems: A Concept-Based Approach", Second Edition, Tata
McGraw-Hill Education,

v
v V