GOVT SCIENCE COLLEGE HASSAN (AUTONOMUS)

Dept. of Computer Science And Applications ,GSC(Autonomous),Hassan-573201

GOVT SCIENCE COLLEGE HASSAN

(AUTONOMUS)

REGULATIONS, SCHEME , SYLLABUS& CREDITS

Under Choice Based Credits System

For the course

I to VI Semesters

BACHELOR OF COMPUTER APPLICATIONS (BCA)

Revised w.e.f.

Academic Year 2016-2019 and onwards

Regulations, Scheme of study and Examination for BCA Degree Course,Under Choice Based Credits

System


Title of the course: Bachelor of Computer Applications

1. Eligibility for Admission (for BCA only): Those candidates who have successfully completed +2 or

PU or equivalent with Mathematics/Computer Science/Business Mathematics/Accountancy OR 3 years

Diploma after SSLC/10th Class with Computer Science Engineering/Information Science Engineering or

equivalent.

2. Duration of the Course: This is a 3 years program split into 6 semesters each of duration 4 months.

However, the maximum duration permitted is 6 years from the date of admission as per the double the

duration norm of the University).

3. Scheme of study:

i. There shall be six theory papers and three practical from first semester to fourth semester.

ii. There will be five theory, two practical and one mini project in fifth semester.

iii. There will be four theory and one major project in sixth semester

iv. The project work shall be carried out either independently or jointly (maximum of two

students)

v. Medium of Instruction: The medium of instruction shall be English.

4. Scheme of Examination:

At the end of each semester there be Examination of three hours duration in each of the theory

paper/practical.

i. Each semester shall be of 4 months duration

ii. Attendance: As per regulations .

iii. A Candidate is allowed to carry over all the previous uncleared (failed) theory papers/Practical to

subsequent semesters as per University regulations in force for science degree courses.

vi. The maximum period for completion of the course shall be six years form the date of

admission.

5. Hours of instructions/week: Shown in the Tables.

6. Titles of papers/practical etc: Shown in the Tables.

7. Scheme of Examination/Assessment: Shown in the Tables.

8. Minima for a pass in each paper and aggregate and condition for promotion to next higher class:

A candidate has to get a minimum of 40% in every paper (Including IA The complete carryover system

is permitted except when the candidate is detained for the attendance requirement. However before the

candidate enters the 6th semester, the candidate should have completed all papers up to the end of 4th

semester successfully and before submitting the final project report, the candidate should have completed

all semesters up to the end of 5th semester.

9. Classification of the successful candidates: Based on the sum total of the marks secured in all

successfully completed papers from all six semesters, class will be awarded.

If the sum total mark is equal to or more than 70% of the aggregate then the candidate is placed

in Distinction class.

If the sum total mark is equal to or more than 60% and less than 70% then the candidate is

placed in First class.

If the sum total mark is equal to or more than 50% and less than 60 % then the candidate is

placed in Second class.

Remaining successful candidates are placed in Pass class


BCA Syllabus

Semester-I

Subjects

Code

Title

Teaching

Instruct

ion

Hrs/Wk

Duration

of

Exam(hrs)

Marks

Credits

Exam IA Total

Kannada Kannada 4 03 70 30 100 4

English English 4 03 70 30 100 4

BCA101(Ex)

BCA102(IA)

Mathematical

Techniques in

Computer

Science(Th)

Math/Cs 4 03 70 30 100 4

BCA111

BCA112

Office Automation

(Th)

CS 3 03 70 30 100 3

BCA121

BCA122

C Programming (Th) CS 3 03 70 30 100 3

BCA131

BCA132

C Programming Lab

(Pr)

CS 6 03 70 30 100 3

BCA141

BCA142

Office Automation

Lab & HTML

Lab(Pr)

CS 6 03 70 30 100 3

COF101

COF102

Computer

fundamental

(Foundation)

CS 4 03 70 30 100 4

34 800

Total credits per Semester 28

Semester-II

Subjects

Code

Title

Teaching

Instruction

Hrs/Wk

Duration

of

Exam(hrs)

Marks

Credits

Exam IA Total



BCA201

BCA202

Numerical Analysis

and statistics

Math/CS 4 03 70 30 100 4

BCA211

BCA212

Data Structures (Th) CS 3 03 70 30 100 3

BCA221

BCA222

Digital Electronics

(Th)

CS 3 03 70 30 100 3

BCA231

BCA232

Data Structures Lab

(Pr)

CS 6 03 70 30 100 3

BCA241

BCA242

Digital & Numerical

Analysis Lab (pr)

CS 6 03 70 30 100 3

Foundation/ SD

course(IC)

1 Th. 4 03 70 30 100 4

34 800

Total credits 28


Semester-III

Subjects

Code

Title

Teaching

Instruction

Hrs/Wk

Duration

of

Exam(hrs)

Marks

Credits

Exam IA Total



BCA301

BCA302

OOPS using

C++ (Th)

CS 3 03 70 30 100 3

BCA311

BCA312

Operating System CS 3 03 70 30 100 3

BCA321

BCA322

Computer

Architecture & Microprocessor

CS 3 03 70 30 100 3

BCA331

BCA332

C++

Programming (Pr)

CS 6 03 70 30 100 3

BCA341

BCA342

OS

&Microprocessor

Lab(Pr)

CS 6 03 70 30 100 3

Foundation/ SD

course(EVS)

1 Th. 4 03 70 30 100 4

33 - 800

Total credits 27

Semester-IV

Subjects

Code

Title

Teaching

Instruction

Hrs/Wk

Duration

of Exam

(hrs)

Marks

Credits

Exam IA Total


Communication

Skills

English 4 03 70 30 100 4

BCA401

BCA402

Java (Th) CS 3 03 70 30 100 3

BCA411

BCA412

Software

Engineering

CS 3 03 70 30 100 3

BCA421

BCA422

Database

Management System

CS 3 03 70 30 100 3

BCA431

BCA432

Java Lab (Pr) CS 6 03 70 30 100 3

BCA441

BCA442

DBMS & PHP

Lab(Pr)

CS 6 03 70 30 100 3

Open Elective 1 Th. 4 03 70 30 100 4

33 800

Total credits 27


Semester-V

Subjects

Code

Title

Teaching

Instruction

Hrs/Wk

Durati

on of

Exam

(hrs)

Marks Credits

Exam IA Total

BCA501

BCA502

Data Communication

and Computer

Networks (Th)

CS 4 03 70 30 100 4

BCA511

BCA512

C# with

.NETProgramming

CS 3 03 70 30 100 3

BCA521

BCA522

Web Programming CS 3 03 70 30 100 3

BCA531

BCA532

Elective-I CS 4 03 70 30 100 4

BCA551

BCA552

Elective-II CS 4 03 70 30 100 4

BCA561

BCA562

.NET Lab CS 6 03 70 30 100 3

BCA571

BCA572

Mini project(pr)

using web

programming

CS 6 03 160 40 100 3

30 700

Total credits 24

Elective-I Elective-II

Title Title

Introduction to Python Programming Software Testing

Computer Graphics and animation Digital Image Processing

Internet of Things(IOT) Network Security and Cryptography


Semester-VI

Subjects

Code

Title

Teachi

ng

Instruction

Hrs/Wk

Duration

of Exam

(hrs)

Marks

Credits

IA Exa

m

Tota

l

BCA601

BCA602

Data Mining &

Data Warehousing

(Th)

CS 4 03 30 70 100 4

BCA611

BCA612

Cloud computing

And Big data

Analytics(Th)

CS 4 03 30 70 100 4

BCA621

BCA622

Main Project

CS 24 Report

Evaluation

100 300 400 12

*Industrial Visit -- -- -- -- -- 100 2

32 700

Total credits per Semester 22

* Industrial Visit =Attendance (60)+Report(40)

Project Guide Lines

Maximum 2 students shall be allowed to take up a project.

Each student shall submit his/her project synopsis to the concerned guide within 15 days in consultation

with internal guide from the commencement of the respective semester.

Each student has to carry out 2 project seminars compulsorily in project duration.

Seminar will be considered for their internal assessment.

Scheme of valuation(Main Project) - 400 Marks

- IA – 100 Marks

o Synopsis - 20 Marks

o Seminar 1 - 40 Marks


- Dissertation – 300 Marks

o Documentation - 100 Marks

o Presentation / Demonstration - 160 Marks

- Viva- 40 Marks

Particulars Max. Marks

Internal Exam Marks : 100

Final Exam Marks

Project Dissertation : 260

Project Viva/voce : 40

Total : 400

Note: During the practical examination maximum 5 projects have to be evaluated in a batch with an

external examiner.


Scheme of valuation(Mini Project)- 100 Marks

- IA – 30 Marks

o Synopsis - 15 Marks


- Dissertation – 70 Marks

o Documentation - 30 Marks

o Presentation / Demonstration - 20 Marks

- Viva- 20 Marks

Particulars Max. Marks

Internal Exam Marks : 30

Final Exam Marks

Project Dissertation : 50

Project Viva/voce : 20

Total : 100

Scheme of marks Distribution(BCA)

Theory Question Paper Pattern & Marks Distribution

1. SEMESTERS I, II, III, IV, V & VI

There will be four Parts A, B, C and D.

Part A is from Unit 1, Part B is from Unit 2 and Part C is from Unit 3.


Part D is Conceptual question.

Part A, B, C each is 22 Marks and Conceptual is for 04 Marks.

Total 22 (Unit 1) + 22 (Unit 2) + 22 (Unit 3) + 04 = 70 Marks.

PART A, B and C

Each Part (UNIT) Marks Distribution

1. 2 mark questions – Total 4 To be answered 3 2 × 3 = 6 marks

2. 6 mark questions – Total 3 To be answered 2 6 × 2 = 12 marks

3. 4 mark problems – Total 3 To be answered 1 4 × 1 = 4 marks

4. 2 mark questions (Conceptual) – Total 3, To be answered 2, 2 × 2 = 4 marks

A conceptual question to be asked from each unit is 1 question. Answer any two out of 3 questions.

Grand Total [A + B + C + D (Conceptual)] = 70 marks

Scheme of IA marks Distribution

IA Marks - Theory

A. Semesters I, II, III , IV,V &VI

(i) COMPONENT 1 = 15 Marks

(ii) COMPONENT 2 = 15 Marks

COMPONENT 1 Average of TWO tests

COMPONENT 2 SEMINARS/PROJECTS/ASSIGNMENTS

IA = COMPONENT 1 + COMPONENT 2 = 30 Marks

SCHEME OF EVALUATION FOR PRACTICAL EXAMINATION

Max.Marks:30 Duration:03 hours.

There will be two questions from two different parts. A candidate has to prepare procedures for both the

questions covering both the parts. Student will be asked to execute one of them of examiner’s choice.

1 Procedure Development=20*2 40 marks


2 Implementation + Result=10*2 20 marks

3 Viva voce 10 marks

Total 70 marks

IA Marks - Practicals

For All Semesters with 20 marks

Practical internal test 15marks

Evaluation of Practical Records-

Observations(5)+Record(10) 15 marks

Total 30 marks

FIRST SEMESTER

1BCA3

BCA101

MATHEMATICAL TECHNIQUES IN COMPUTER SCIENCE

UNIT-1 15 Hours

Set Theory-Definition and types of sets, Equal sets, subsets, universal sets, Venn diagram, Set operations,

Properties of set union and intersections. (with Venn diagrammatic proofs only)

Relations and Functions - Cartesian product , Relation , Function, domain, range , Types of function:

into, onto, One-one, many one ·


UNIT-1I 15 Hours

Mathematical Logic - Propositions · Logical connectives and compound statements · Truth values and

truth table Statement pattern and logical equivalence · Tautology, contradiction, contingency · Validity of

arguments · Predicates

UNIT-III 15 Hours

Matrices and Determinants – Definition, types of matrices , Equality of Matrices , transpose of matrices ,

Algebra of matrices : addition, subtraction , scalar Multiplication and multiplication of matrices · Definition

of Determinant , Adjoint of a matrix and Inverse of a matrix and problems.

UNIT-IV 15 Hours

Graph Theory - Definition and types of graphs , Incidences and degree of vertices, Isomorphism of graphs ,

Connected and disconnected graphs, Walks, paths and circuits, Directed graph, connected graphs and Trees

(Without proof)

Reference Books:

1) Elements of Discreet Mathematics by C.L. Liu

2) Mathematical Structures for Computer Science by AlonDoerr and k. Levasieur

4) A first step in graph theory by raghunathan, Nimkar &Solapurkar

5) Basic Mathematics by Mittal and Agarwal

BCA111

Office Automation

UNIT I 15 Hrs

Basics of Windows Operating System

Definition of Operating System ,Objectivesand functions of Operating Systems ,Working with Windows

Operating System: Introduction, The Desktop, Structure of Windows, Windows Explorer, File and Folder

Operations, The Search, The Recycle Bin,

MS-Word: Introduction, Starting MS-Word, Dialog Boxes, Wizards and Templates, Formatting,

Searching and Proofreading Tools, Working with Tables and Columns, Mail merge.


UNIT II 15 Hrs

MS-Excel: Introduction, Starting MS-Excel, Basics of Spreadsheet, MS-Excel ,Working with Formulas

and Functions, Formatting, Creating and Formatting Charts ,exploring charts.

MS-PowerPoint: Introduction, MS-PowerPoint Screen and Its Components, Elementary creating

presentations with animation.

MS-Access-Introduction to database, creating tables, inserting, updating and accessing the data from the

table

UNIT III 15 Hrs

Introduction to Web Designing & HTML : Web page, Website, Web browser, WWW,Overview of

HTML ,Structure of HTML documents, HTML Markup tags, Tags-Definition, Classification of Tags,

Basic Tags-HTML, HEAD, TITLE, BODY ,Paragraph Tags, Linking in HTML, Tables in HTML, Frames

in HTML, Forms in HTML ·

References

1. FUNDAMENTALS OF COMPUTERS -by V. RAJARAMAN.

2. TEACH YOURSELF OFFICE 97/2000 FOR WINDOWS -by COREY

3. MICROSOFT OFFICE 2000 -by COMPLETE (BPB)

4. Introduction to Information Technology, Pearson Education, 2012.

BCA121

C Programming

UNIT-I 15 Hrs.

Problemsolving aspects – Introduction, Problem definition, Problem analysis, Design of problem solution,

Algorithm, Flowchart, Coding, Debugging, Program Documentation and Program maintenance,

Overview of C Language: History of C, Character set, C tokens, Identifiers, Keywords, Data types, Variables,

Constants, Symbolic Constants , Operators in C, Hierarchy of Operators, Expressions, Type Conversions and

Library Functions.

Managing Input and Output Operation: Formatted and Unformatted I/O Functions.


UNIT-II 15 Hrs.

Decision making, branching and looping: Decision Making Statements - if Statement, if–else statement,

nesting of if-else statements, else–if ladder, switch statement,?: operator, Looping - while, do-while, for loop,

Nested loop, break, continue, and go to statements

Arrays: Declaring and Initializing, One Dimensional Arrays, Two Dimensional Arrays with example programs,

Multi Dimensional Arrays.

Strings: Declaring and Initializing strings, Operations on strings, Arrays of strings, Different string handling

functions with example programs.

UNIT-III 15 Hrs.

Functions: Function Definition, prototyping, types of functions, passing arguments to functions, Recursive

functions.Array and functions.

Pointers – Declarations, Pointers and functions, Call by value, Call by reference, Pointers and Arrays, Memory

allocations -Meaning of static and dynamic memory allocation, Memory allocation functions.

Structures-Declaring and Initializing, Nested structure, Array of Structure.

Unions: Introduction to unions.

Files –Introduction defining & opening a file, closing a file, input/output operations on files, error handling

during input/output operations, random access to files with examples.

TEXT BOOKS

1. E. Balaguruswamy, “Programming In ANSI C”, TMH Publications, 2013

2. Ashok N. Kamthane, “Programming with ANSI and Turbo C”, Pearson Education, 2006

REFERENCES BOOKS

1. Ashok N. Kamthaneet. al., “Computer Programming and IT”, Pearson Education, 2011

2. Mahapatra, “ Thinking In C ”, PHI Publications, 1998.

3. YashwantKanetkar, “Let Us C”, 13th Edition, PHP, 2013.

BCA131

C Programming Lab

Part A:

1. C program for given two numbers to perform arithmetic operations using switch statement.

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

3. C program to find a Year number is leap Year or not using nested if statement.

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


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

6. C Program to Print the multiplication table using for loop.

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

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

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

10 C program to generate Fibonacci series up to n numbers

11 .Program to find sum even and odd numbers separately in the given list.

12.C program find the sum of all positive numbers in an array.

13.C program for sorting given set of numbers using bubble sort technique.

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

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

Part B:

1.C Program to concatenate two strings without string handling function.

2. C Program to accept a sentence and convert all lowercase characters to uppercaseand vice versa.

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

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

5.C program to accept two square matrix and find sum & difference of two matrices.

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

7.C program to display transpose of given m*n matrix.

8. Program to find trace and norm of a square matrix and print its principle diagonal elements.

9. C program to sort a list of words using two dimensional character array.

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

11.C program to find LCM and GCD of two number

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

13. C Program to sort an integer array in ascending order using pointer.

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

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

BCA141

Office Automation and HTML Lab

List of Experiments/Programs

Part A:

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

table handling

i. Creating a table (At least 4 Columns and 6 Rows).

ii. Entering appropriate data into the table.


iii. Sort the table.

iv. Apply the formulas on table numeric values.

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

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

“Employee” and calculate the following using formulas

i. Enter Employee Code, Name and Basic Salary.

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

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

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

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

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

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

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

steps

ITEM MONTHLY SALES

(in Thousands)

Cotton 2,750

Wool 3,100

Yarn 2,975

Jute 2,100

Fiber 3,010

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

Roll

No

Stud

Name

Marks1 Marks2 Mark3 Total Percentage

Result

i. Create appropriate records

ii. Calculate total and marks using formula.

iii. Update result column using IF function.

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

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

i. Create STUDENT database table.

ii. Create appropriate records.

iii. Add two more records to the table.

iv. Delete 2nd record to the table.

v. View the records.


i. Create STUDENT database table find form and report design.


iii. Add two more records to the table.

iv. Delete 2nd record to the table.


v. View the records.


i. Create EMPLOYEE database table.


iii. Sort the records in ascending order of name.

iv. Sort the records in descending order of salary.

v. View the records

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

i. Create presentation slides with Titles, Sub Titles and Charts choosing different slide layouts.

ii. Use Design templates for background.

iii. Format the slide design.

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

i. Create presentation table slides using an organization chart.

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

Part-B

1. Create a Web Page using HTML text formatting tags

2. Create a Web Page to illustrate different types of lists

3. Create a student resume using HTML tags (with image tag).

4. Create a webpage with an image in the background, the page should contain marquee moving in all 4

directions with different behavior.

5. Design a timetable using rowspan and colspan attributes

6. Create 2 web pages, first page consisting of student details and second page consisting of educational

information. Link both the pages.

7. Create a webpage to demonstrate Frames.

8. Design a webpage as shown below with pages in all the frames. The content of all the frames should

be interrelated.

1 3

4

2 5

9. Design a webpage using frame of the following fields- Name, Age, Sex, Designation and Salary

With Save and Clear Button.

10. Create a web site consisting of multiple pages(College information, Course details, Marks details etc)

Computer Fundamentals

(Foundation course)

BCA/B.Sc

UNIT-I 15Hrs.

Introduction to Computers: Introduction, Characteristics computers, Evolution computers Generation of

computers, Classification of computers, the computer system, Application of computers

Input devices: Introduction, Types of input devices, Optical character recognition, Optical Mark

Recognition, Magnetic ink character recognition, Bar code reader.


Output devices: Introduction, Types of output, Classification of output devices, Terminals.

UNIT-II 15 Hrs.

Computer memory: Introduction, memory representation, memory hierarchy.

Primary memory: Random access memory, Types of RAM, Read-only memory, Types of ROM.

Secondary Storage: Introduction, magnetic tape , hard disk, floppy disk,CD-ROM ,Memory stick.

.

UNIT-III 15 Hrs.

Computer languages: Introduction, Evolution of programming languages, classification of programming

Languages. Computer Languages,

Computer software: Introduction, software defin ition, Types of Software, relationship between software

and hardware, software categories.

Computer Security: Need of computer security, basic security concept,threats to hard ware and software,

threats to data. Taking protective measures, keeping data secure.

UNIT-1V 15 Hrs.

Internet basics: Introduction, Evolution, Basic internet terms, getting connected to internet, internet

Applications, browsers. Internet Security, Privacy ,Ethical Issues .

Processing Data: Transforming data into information - How a Computer processes data - factors affecting

processing speed.

Information System: Introduction, types of Information System, System Development Life Cycle.

Text Book:

1. Fundamentals of computers-By V. Rajaraman

2. Introduction To Computers By Subramanian

3. Peter Norton's Introduction To Computers By Norton, Peter

4. Pc Software Made Simple By Taxali, Ravi Kant

SECOND SEMESTER

BCA201

NUMERICAL ANALYSIS AND STATISTICS

UNIT-1 15 Hours

Computer Arithmetic: Floating point representation of numbers, arithmetic operations

with normalization, consequences of normalized floating point representation of numbers , Errors in

numbers.


Finding the roots of an equation: Numerical solutions of Algebraic and transcendental equations-

Bisection method, Newton Raphson method, Regula Falsi method, Secant Method,Iteration method.

UNIT-1I 15 Hours

Solving simultaneous linear equations: Introduction, Gauss Elimination method, Gauss Jordon

method, LU Decomposition method .

Interpolation: Introduction, Lagrange interpolation, Difference Tables- Newton-Gregory Forward and

Backward interpolation, Truncation error in interpolation

UNIT-III 15 Hours

Ordinary differential equations: Euler’s method, Taylor series method, Range Kutta II order methods.

Numerical Integration: Simpson’s 1/3 and 3/8 rule, Trapezoidal rule,Weddle’s rule..

UNIT-1V 15 Hours

Statistical methods: Introduction, definitions, frequency distribution, mean-arithmetic mean for

grouped and ungrouped data, continuous frequency distribution(step deviation method), Geometric

mean for grouped and ungrouped data.

Standard deviation - standard deviation for actual mean method, assumed mean method and step

deviation method using discrete series and continuous series.

Median – meaning, calculations of median for ungrouped, Discrete series, continuous series .Mode-

meaning calculations of mode for discrete series and continuous series

Correlation – meaning, types, rank correlations and problems.

Note: Algorithmic approach for all statistical methods

Reference Books:

1. Computer Oriented Numerical Methods by Rajaraman. V.

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

BCA211

Data Structures

UNIT-1 (15 Hours)

Linear Data Structure and their sequential storage representation Dynamic memory allocation – MALLOC, CALLOC, REALLOC, FREE with examples

Storage classes- Storage Classes - Automatic, External, Static and Register Variables

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

Structures and arrays of structures.

Stacks: Definitions and Concepts, Operations on stacks, Applications of stacks, Recursion, Infix to postfix,

Evaluating postfix expressions.


UNIT-2 (15 Hours)

Linear Data Structure and their Linked storage representation

Queues: Definitions and Concepts, Linear queue, Circular queue and Priority Queues.

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

storage structures, circularly linked linear lists, doubly linked linear lists

UNIT -3 (15 Hours)

Nonlinear Data Structures

Sorting and Searching:Sorting, selection sort, Bubble sort, Quick sort, searching sequential searching, binary

searching.

Trees - Definition and concepts, Terminologies in Tree, Operations on Binary Trees, and Linked Storage

Representations of Binary Trees, Tree creation and Traversal, Binary search Tree

Graphs–Introduction, Definition, Terminology, Representation & Traversal.

Text Books 1. An Introduction to Data 'Structures with Applications 2nd edition – J.P. Trembly and Sorenson, McGraw

Hill 2001.

Reference Books 1. Data structures using C & C++ by YedidyahLangsun, Moshe J. Augenstein, Teneinbaum published by

Prentice Hall of India ltd.

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

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

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

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

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

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

BCA221

Digital Electronics

Unit-I (15 Hours)

Number Systems – Introduction- Decimal, Binary, Octal and Hexadecimal. Inter- Conversions, Addition,

Subtraction, Multiplication and Division in Binary Number System.

1’s and 2’s Complement method in Binary Number System. Subtraction using 1’s and 2’s Compliment,

Weighted Number System - Binary Coded Decimal (BCD), Addition of BCD Numbers.


Non-Weighted Number System – Applications, Excess-3, Gray code- Conversions - Gray and Binary Codes

Fixed point and Floating point representation of numbers - Introduction

Unit-II (15 Hrs)

Boolean Algebra: Basic laws, DeMorgan’s theorem, Duality theorem, Sum Of Product method and

Products Of Sum method. Karnaugh map (Upto 4 Variables, Don’t Care Condition).

Fundamentals of Gates: Basic gates, Derived gates and Universal gates (Design).

Unit-III (15 Hours)

Combinational and Sequential logic circuits - Half adder, Full adder, Half -subtractor and Full-subtractor.

Flip-Flops - SR, D, JK, JK Master Slave, T Flip-flops, Decoders - 3 to 8 lines, Encoders-Octal to Binary

Multiplexer- 4 to 1 line, Counters-3 bit Binary Ripple counter,3 bit synchronous binary counter.

Shift registers- Serial-In-Parallel-Out, Parallel-In-Serial-Out, Serial-In-Serial-Out, Parallel-In-parallel-Out.

Text Books:

1) Malvino Leach, digital principles and application (4th edition

Reference Books:

1. Digital fundamentals-Thomas.D.Floyd.

2. Morris Mano, Computer System Architecture (3rd edition) PHI.

3. Digital Logic- Thomas C Bartee.

BCA231: Data Structures Lab

PART – A

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

technique.

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

3. Write a program to arrange numbers in ascending order using bubble sort

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


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

6. Write an interactive program to insert an element at the given position and delete an element atthe specified

position in the given array.

7. write a program to store a character in a block of memory and to modify the same to store a larger string

using malloc and realloc function

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

9. Program to implement Tower of Hanoi problem.

10. Write program to evaluate a postfix expression.

PART – B 1. Write a program to convert an expression from infix to postfix.

2. Write an interactive program to perform insertion and deletion operations in Linear Queue.

3. Write an interactive program to perform insertion and deletion operations in Circular Queue.

4. Write an interactive program to perform insertion and deletion operation in priority Queue.

5. Write an interactive program to perform insertion operation in linked list- at the beginning, at the end and

in-between.

6. Write an interactive program to implement stack operations using singly linked list

7. Write a program to insert an item at beginning and delete an item from rear in singly linked list.

8. Write an interactive program to perform insertion operation in doubly linked list- at the beginning and atthe

end.

9. Program to create a binary tree and also print the preorder values, inorder values, postordervalues.

10. Program to illustrate the Binary Search Tree

BCA241: Digital and Numerical Analysis Lab

Part- A

1. Verification of basic Gates

2. Verification of Other Gates using only NAND Gates


3. Verification of other neither Gates using only NOR Gates.

4. Verification of D-Morgan’s theorems.

5. Implementation of 4 bits Gray to Binary Converter and vice versa.

6. Construction of Half Adder, Full Adders,

7. Construction of Half Subtractor and Full Subtractor.

8. Simplification of Boolean Expressions using Karnaugh Map method.

9. Implementation of SR, Clocked SR Flip Flops.

10. Implementation of JK, Toggle, Delay Flip Flops.

Part – B

1. Program to compute mean, median, mode and standard deviation of n elements using linear array for

ungrouped data.

2. Program to solve the given equation x*x-14=0 by using Bisection method.

3. Program to solve the given equation x*x+5*x-6=0 by using Regula Falsi method.

4. . Program to solve the given equation x*x*x*-12=0 by using Newton Raphson method.

5. Program to solve the given equation x*x-25=0 by using Secant method.

6. Program to solve the given equation dy/dx=1+y*y where y(0)=1,h=0.1,find y(0.4) using Eulers

method.

7. Program to solve the given equation dy/dx=x*y where y(1)=2,h=0.3,find y(1.4)by using Rungekutta’s

II order method.

8. Program to solve the given equation ∫ dx/(1+x) where, a=0,b=1,n=10 by using Trapezoidal method.

9. Program to solve the given equation ∫ sin x dx where a=0,b=π /2,n=6 by using Simpson’s 1/3 rule.

10. Program to solve the given equation ∫ sin x dx where a=0,b=π /2,n=6 by using Simpson’s 3/8 rule.

THIRD SEMESTER

BCA301: OOPS Using C++

Unit- 1 ( 15 Hours)

1. Introduction to C++ Object Oriented Technology, Disadvantages of Conventional

Programming,Programming Paradigms, Comparison of C++ with C, Advantages and key concepts of OOP,

Console Input /Output in C++: Variables in C++, Reference Variables in C++, Function Prototyping, Function

Overloading, Default Values for Formal Arguments of Functions. Inline functions.

2. Classes and Objects: Introduction to classes and objects, Structures in C, Structures in C++.Classes inC++,

Declaring Objects, The public keyword, The private keyword, The protected keyword, MemberFunctions,


Outside member Function inline, Rules for Inline Functions, Static Member variables and Functions, Static

Object, Array of objects.

3.Objects as Function Arguments Friend Functions, The const Member Function, Recursive

memberfunctions, Member Functions and Non-Member Functions. Operator Overloading and typeConversion:

Introduction, The Keyword Operator, Overloading Unary Operator, Operator Return Type,Constraint On

Increment and Decrement Operator, Overloading Binary Operator, Type Conversion.

Unit- 2 ( 15 Hours)

4. Constructors and Destructors :Characteristics of Constructors and Destructors, Applications with

Constructors, Constructors with Arguments, Overloading Constructors, Constructors with DefaultArguments,

Copy Constructors, Destructors.

5. Inheritance: Introduction, Access Specifiers and Simple Inheritance, Protected Data with PrivateInheritance,

Types of Inheritance: Single Inheritance, Multilevel Inheritance, Multiple Inheritance,Hierarchical Inheritance,

Hybrid Inheritance, Multipath Inheritance, Virtual Base Classes, Constructors

Destructors and Inheritance.

6.Console I/O Operations:C++ streams, C++ stream classes, Unformatted I/O operations, Formatted I/O

operations, managingoutput with manipulators.

Unit- 3 (15 Hours)

7. Files: Classes for file stream operations, opening and closing a file, detecting end of file, more aboutopen():

file modes, file pointers and their manipulations, sequential input and output operations.

8. Exception Handling: Introduction, Principles of Exception Handling, The keywords- try, throw and

catch, Exception Handling Mechanism, Multiple Catch Statements, Catching Multiple Exceptions,Rethrowing

exceptions, Exceptions in Constructors and Destructors, Guidelines for Exception Handling.

9. Templates :Generic Programming with Templates: Introduction, Need of Template, Definition of Class

Template, Normal Function Template.

Reference Books:

1Text Book:

E Balagurusamy, Object Oriented Programming with C++, 5th Edition, Tata McGraw hill Publication.

Reference Books:

1. D Ravichandran, Programming with C++, Third Edition, McGraw hill 2011

2. Robert Lafore, Oriented Programming in C++, Galgotia Publications Pvt. Ltd, 2006.

BCA311 : Operating System

UNIT-1 15 Hours

1.Introduction-Definition, Computer system components , User view , system view and system goals , Batch

Systems,Multi programmed Systems, Time-Sharing Systems, Real-Time Systems, System Components,

Operatingsystem services, System calls and system programs.

2.Process-Process Concept, process state diagram process Control block , Process Scheduling- Scheduling

queues,scheduler, Cooperating process, Interprocess Communication, Threads- meaning , user threads ,

KernelThreads, Multithreading Models, Threading Issues.

3.CPU Scheduling-Basic concepts, Preemptive and Non-preemeptive Scheduling, Scheduling Criteria,

Scheduling algorithms-FCFS, Shortest job first Priority scheduling, Round Robin Scheduling.


UNIT-II 15 Hours

4.Process Synchronization-The Critical section problem, Solution Approach critical section problem, Bakery

Algorithm, Semaphores-Meaning, Types of Semaphores, Synchronization problems- Bounded Buffer Problem,

Readers-Writersproblem and Dining Philosophers problem.

5.Deadlocks-Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock

Avoidance,Deadlock Detection, Recovery from Deadlock

6.Memory Management-Introduction, Logical versus physical address space, Dynamic Loading, Dynamic

Linking, Swapping,Contiguous Allocation, Partitioned Memory Allocation, Paging, Segmentation,

Segmentation with Paging.

UNIT-III 15 Hours

7.File System-File concepts, File Attributes, File Operations, File Types, File Structure, Access Methods,

DirectoryStructure, File-System Structure, Allocation Methods- Contiguous Allocation, Linked Allocation

andIndexed Allocation, Free-Space Management.

8.Introduction to Unix System-The Unix Operating System, The UNIX architecture.

Shell Programming- Vi editor, shell types, shell command line processing, shell script features, executing a

shell script, system and user-defined variables, expr command, shell screen interface, read and echo statement,

command substitution, escape sequence characters, shell script arguments, positional parameters, test command,

file test, string test, numeric test.

9. Conditional Control Structures-if statement, case statement Looping Control Structure-while, until, for,

statements. Jumping Control Structures – break, continue, exit. Shell Programs covering the above concepts

Reference Books:

1. Operating System Concepts – 5th edition by Abraham Silberschartz and Peter Galvin, McGraw Hill,2000

2. Modern Operating Systems – Andrew S Tanenbaum, Prentice Hall

3. Operating Systems : Internals and Design Principles, William Stallings, Prentice Hall

4. Sumitabha Das: UNIX – Concepts and Applications, 4th Edition, Tata McGraw Hill, 2006.

BCA321-Computer Architecture and Microprocessor

Unit 1: 15 Hrs.

Storage Representation: Storage representation of characters; Memory locations and addresses – Byte

addressability; Memory operation.

Addressing modes: Direct, Indirect, Immediate, Relative, Indexed.

Instruction formats: Zero address, one address, One-and-half address, Two address, Three address.

I/O Transfers – Program controlled, Interrupt controlled, DMA (Direct Memory Access)

Instruction types: Data transfer, Arithmetic, Branching, Logical, Rotate, Stack operations, Input/Output and

Machine control instructions.


Unit 2: 15 Hrs.

Input/output Organization: Accessing Input/output devices; Interrupts; Direct Memory Access (DMA)-Block

diagram of DMA Controller, cycle stealing, Burst mode.

Buses – Synchronous bus, Asynchronous bus; Interface circuits – Parallel port, Serial port.

Introduction to Microprocessor, History of Microprocessor, 8085 Microprocessor Architecture, Pin diagram,

Introduction to 8085 instructions set,.

Unit 3: 15 Hrs.

Assembly Language Programming ,Programming Technology of 8085 with additional instructions, counters

and time delays. Stacks and Subroutines, Interfacing Peripherals (I/Os) and applications. Interrupts, Interfacing

data converts, Keyboard interfacing.

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

.

Reference Books:

1. Computer organization by Carl Hamacher, Z.Varnesic and S.Zaky 5 th Edition ,Mc Graw Hill,2002.

2. Microprocesor Architecture Programming and Application with 8085 by Ramesh. S. Gaonkar –Penram

International Publishing (India) .

3. M.Morris Mano –Digital Logic and Computer design,PHI Pvt.Ltd., New Delhi

4. Baary B Brey- The Intel Microprocessor Systems:The 8086/8088 family architecture, programming and

designing-PHI Publication.

BCA331 : C++ Programming LAB

PART-A

1. Write a c++ program to perform arithmetic operations using classes and objects.

2.Write a c++ program to calculate area and circumference of circle using inline function

3. Write a c++ program to illustrate the use of default argument using function.

4. Write a c++ program to illustrate the use of static member function.

5. Write a c++ program to find the mean value using friend function..


6. Write a c++ program to show the use of copy constructor.

7. Write a c++ program to implement multiple inheritances.

8.. Write a c++ program to illustrate pointers to objects.

9. Write a c++ program to read a string with get line function.

10. Write a c++ program to display string with write() function.

.

PART-B

11. Write a c++ program to show the use of over loaded constructor.

12. Write a c++ program to construct variables at run time using dynamic initialization.

13. Write a c++ program to find the largest value among the set of parameters using overloaded function.

14. Write a c++ program to add two complex number using operator overloading.

15. Write a program to perform multiplication of two matrices using operator overloading.

16.Write a Program to find the area and volume of respective figures using function overloading.

17. Write a c++ program to demonstrate single inheritance.

18. Write a c++ program to implement multilevel inheritance.

19. Write a c++ program to illustrate the implementation of virtual base class.

20. Write a c++ program to implement reading and writing class objects using files.

.

BCA341 – OS and Microprocessor Lab

PART – A

1. Write a shell script to exchange the contents of two variables.

2. Write a shell script, which accepts three subject marks scored by a student and declare the result.

3. Write a shell script to print integer numbers from 1 to 20.

4. Write a shell script to perform arithmetic operation on two number depending on +, -, * and /.

5. Write an interactive shell script to display a menu and perform the following task:

i. Renaming a file ii. Deleting a file

iii. Copying a file iv. Exit

6. Write a shell script to accept three command line arguments and display each one of them.

7. Write a c program to


a. Display the PID of parent and PID of child.

b. Copy the contents of one file into the other using command line arguments.

8. Write a shell script to count the number of lines, number of byte count, number of character in a file and

also to count the maximum number of character in a largest line.

9. Assume a file with following information

FirstName MiddleName Age

------------- --------------- -----

Write a shell script

i. To Sort the first name in alphabetical order.

ii. Sort the age in terms of ascending order.

iii. Sort the age in terms of descending order.

iv. Sort the middle name in alphabetical order.

10. Write a Shell script to display

i. The version of the shell.

ii. The user information.

iii. Login date and time.

iv. List of processes running on the system.

v. User home directory

PART B

1. Addition & Subtraction of two 8-bit numbers.

2. Swapping of two 8-bit data using Indirect mode

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

4. Multiplication of two 8 bit numbers.

5. Division of two 8 bit numbers.

6. Addition of two 16-bit numbers.

7. Program to find the square of given 8-bit number using look up table.

8. Program to find the Sum of N natural numbers

9. Program to generate Fibonacci series up to N.

10. Program to convert Hexadecimal number into BCD numbers.


IV SEMESTER

BCA401 : JAVA PROGRMMING

UNIT 1 : 15 HOURS

1.An Overview of Java - Java Basics History of Java ,Object-Oriented Programming, Data Types, Variables

and Arrays - The simple types, Floating point types, A closer look at literals, Variables ,Typeconversion and

casting, Automatic type promotion in expressions, Arrays

2.Operators - Arithmetic operators, The bitwise operators, Relational operators, Boolean, logical perators,

The assignment operators, The? operator, Operator precedence, Using parentheses

3.Control Statements - Java’s selection statements, Iteration statement, Jump statements

UNIT 2 15 HOURS

4.Introducing Classes - Class fundamentals, Declaring Objects, Assigning object reference variables,

Introducing methods Constructors, The this keyword, Garbage collection, The finalize() methodOverloading

methods, recursion, string handling.

5.Inheritance - Inheritance Basics, Using super Creating a multilevel Hierarchy Method overriding, Dynamic

method dispatch, Using abstract classes, Using final with Inheritance The object class

6.Packages and Interfaces - Packages, Access protection, Importing packages, Interfaces

UNIT 3 15 HOURS

7. ExceptionHandling -fundamentals ,Exception types, Uncaught exceptions Using try and catch, Multiple

catch clauses, Nested try statements, Throw, Java’s built – in exceptions, Creating your own exception

subclasses, Using exceptions

8.Introduction to Fundamental concepts Multithreaded Programming - Synchronization, The thread class

and the runnable interface Thread priorities Interthread communication Suspending, Resuming, and stopping

threads

9.I/O &Applets - I/O basics, Reading console Input, Writing console output Applet fundamentals . Basic

concepts of string handling and Java. lang - String length, Special string operations,

TEXT BOOKS

1. Java Programming : Balaguruswamy

2. The Java Handbook by Patrick Naughton

REFERENCE BOOK

1. Ivor Horton’s Beginning Java 2 JDK 5 Edition

2. The Complete Reference Java 2 – Third Edition

3. Programming with Java – Schaum’s Outline


BCA411 - SOFTWARE ENGINEERING

UNIT - 1 15 Hours

1. Introduction to Software engineering , Software Products and characteristics, software engineering

applications, Software engineering ethics.

Software Process - Software engineering models: Waterfall Model, Prototyping, Spiral Model, RAD

Model.

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

requirements, the software requirements document; Feasibility studies, Requirements elicitation and

analysis, Requirements validation, Requirements management.

UNIT – 2 15 Hours

3. System Analysis Models: Context models, Data models, Flow oriented Modeling – DFDs, Behavioral

models – Use cases.

4. Software Design:Design process, Design characteristics, Design concepts,

Design Models - Architectural design - Software Approach, Data Design, Architectural Styles and Patterns,

Architectural design.

Object Oriented Design - Object and Object Classes, design process, Design evaluation.

User Interface design - Interface Analysis, Interface Design Steps, and Design evaluation.

UNIT-3 15 Hours

5. Verification and Validation: Testing Strategies, Strategic issues, Test Strategies for conventional

software - Black-box and White-box testing, Validation testing-System testing, Art of Debugging.

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

Scheduling- Concepts and Principles,

Risk management – Software Risk, Risk identification, Risk projection, Risk refinement.

Software cost estimation– Estimation techniques - Decomposition Technique - software sizing,

Empirical estimation model -COCOMO Model, Project duration and staffing.

Quality management – Software quality Assurance and standards, ISO 9000 quality standards,

Software measurements, Metrics for Software quality.

Reference Books:

1. Software Engineering, Ian Sommerville, 6th Edition,9th Edition, Pearson Education Ltd.,

2. Software Engineering – A practitioners approach, Roger. S. Pressman, Tata-McGraw Hill 6th Edition.

BCA421: DATA BASE MANAGEMENT SYSTEM


UNIT 1: 15 HOURS

1.INTRODUCTION TO DBMS: - Definition of Data, Information, DBMS, Data base system application, Purpose

of database systems, File processing system v/s DBMS, Data models, Levels of Abstraction in a DBMS, Three

Schema architecture.

2.Characteristics of DB – Self describing nature, Insulation between programs, data and data Abstraction (data

Independence), support of multiple views of the data, sharing of data and multiples transaction processing,

Storage management.

3.Data Models: Schemas and Instances, DBMS Architecture and Data Independence,Database Languages

and Interfaces, the Database System Environment.

Unit 2: 15Hours

4.RELATIONAL DATABASE – Tables, Database design, ER diagram – Entity types, entity set, attribute keys,

relationships, relationship types, ER diagram notations. Reduction to relational schemas.

5.RELATIONAL MODEL – concepts, relational concepts, and relation constrains, relational database schemas.

Relational algebraic operations. Normalization – Features of good relational atomic domains and first normal

form, Decomposition using functional dependencies, functional dependency theory, Decomposition using

functional dependencies. Database administrator, users.

6.Normalization- Functional Dependencies, Transitive and Multi-valued dependency, FirstNormal form,

Second Normal Form, Third Normal Form and Boyce Codd Normal Form

UNIT 3: 15 HOURS

7.INTRODUCTION TO SQL: Overview of SQL, Sub languages of SQL, Data-types, Operators, Retrieving Data

from Database Tables, Using the SELECT Statement, Using the WHERE Clause, Using the ORDER BY

Clause, Using the GROUP BY and HAVING Clauses, SET Operators.

JOINS- Equi and Non-Equi Joins, Cartesian join, Outer Join, Self Join, Cross Join, Natural Join, Sub queries-

Using correlated Sub queries,

8.DDL STATEMENTS - Understanding DDL, Creating Tables, Deriving a Table from Existing Table, Altering

Tables, Dropping Tables

CONSTRAINT - Understanding Integrity Constraints, NULL Constraint, UNIQUE KEY Constraint, PRIMARY

KEY Constraint, FOREIGN KEY Constraint, CHECK Constraint, DEFAULT Constraint, Specifying Names

for the Constraints, Adding and Dropping Constraints

9.DML- Using INSERT Statement, Using UPDATE Statement, Using DELETE Statement.

DCL AND TCL STATEMENTS - Understanding Data Control Statements, Using the GRANT Statement, Using

the WITH GRANT OPTION, Using the REVOKE Statement, Database Privileges Object Privileges, Using

COMMIT and ROLLBACK Statements, Creating Save-points

TEXT BOOK

1. An Introduction to Database Systems 5th edition C.J. Date, A. Kannan, S.Swamynathan

2. Database System Concepts – Abraham Silberschatz, Henry R Korth, S. Sudarshan 5th edition

REFERENCE

1. Understanding oracle – Ivan Bayross

2. Database Management & oracle Programming S. S. Khandare

3. Database Modeling & design – Toby J. Theorey

BCA431 – Java Programming Lab


PART-A

1. Write a Java program to demonstrate method overloading.

2. Write a Java program to sort a list of numbers.

3. Write a Java program to display all prime numbers between two limits.

4. Write a Java program to demonstrate manipulation of strings.

5. Write a Java program to find factorial of list of number reading input as command line argument.

6. Write a Java program to demonstrate single inheritance.

7. write a Java program to sort the names using vectors.

8. Write a Java program to demonstrate Arrayindexoutofbounds and arithmeticExceptions.

9. Write an applet to display the sum of two digits.

10. Write a Java program to demonstrate free hand writing.

PART-B

1.Write a Java program that prints all real solutions to the quadratic equation ax2 + bx +c = 0. Read in a, b, c

and use the quadratic formula. If the discriminate b2 -4ac is negative, display a message stating that there are

no real solutions.

2. Write a program that accepts a shopping list of five items from the command line and stores them in a

vector and accomplish the following:

i. To delete an item in the list.

ii. To add an item at a specified location in the list.

iii. To add an item at the end of the list.

iv. To print the contents of the vector.

3.Write a program to implement constructor overloading by passing different number of parameter of

different types.

4. Write a Java program to draw line, rectangle, circle ,oval and polygon with the help of java graphic

class.

5. Write a Java applet to demonstrate Animation using threads.

6. Write a Java program to demonstrate Access Control using packages.

7. Write a Java program to display the result of a student using multiple inheritance.

8. Write a Java program to demonstrate simple calculator with the help of text fields, buttons.

9. Write a Java program using I-O streams to count the number of words in a file.

10. Write a Java program to copy characters from one file into another.

BCA415 : DBMS LAB


PART-A

Activity 1:

Database : Student (DDL, DML statements)

Table: Student

Name Regno Class Course

Sam 101 1 PCM

Balaji 102 2 PMCS

Harish 103 1 BCA

Monika 104 2 PCM

i) Create the above table.

ii) Remove the existing Class attributes from the table.

iii) Change the date type of regno from integer to Char.

iv) Add a new attribute phoneno to the existing table.

v) Enter Six tuples into the table.

vi) Display all the tuples in student table

vii) Drop the table Student

Activity 2: (Select clause, Arithmetic Operators)

Database: employee

Create Following tables and insert tuples with suitable constraints

EMPLOYEE

EMPID FIRSTANAME LASTNAME Hire_Date ADDRESS CITY

1001 George Smith 11-May-16 83 first street Paris

1002 Mary Jones 25-Feb-17 84 Vine street London

1012 Sam Tones 12-Sep-15 33 Elm St. Paris

1015 Peter Thompson 19-Dec-16 11 Red Road Paris

1016 Sarath Sharma 22-Aug-15 44 MG Road New Delhi

1020 Monika Gupta 07-Jun-16 9 Bandra Mumbai

EMPSALARY

EMPID SALARY BENEFITS DESIGNATION

1001 10000 3000 Manager

1002 8000 1200 Salesman

1012 20000 5000 Director

1015 6500 1300 Clerk

1016 6000 1000 Clerk

1020 8000 1200 Salesman

Write queries for the following


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

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

3. Select FIRSTNAME and SALARY of salesman

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

EMPLOYEE and EMPSALARY. Where TOTAL SALARY is calculated as SALARY+BENEFITS

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

6. Count number of distinct DESINGATION from EMPSALARY

7. List the employees whose names have exactly 6 characters

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

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

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

Order the result in descending order of the gross.

Activity 3: (Logical, Relational Operators)

Database: Library

Create Following tables and insert tuples with suitable constraints

Table: Books

Book_Id Book_name Author_Name Publishers Price Type Quantity

C0001 The Klone and I Lata Kappor EPP 355 Novel 5

F0001 The Tears William Hopkins First Publ 650 Fiction 20

T0001 My First C++ Brain & Brooke ERP 350 Text 10

T0002 C++

Brainworks A.W.Rossaine TDH

350 Text

15

F0002 Thunderbolts Ana Roberts First Publ. 750 Fiction 50

Table : Issued

Book_Id Quantity_Issued

T0001 4

C0001 5

F0001 2

T0002 5

F0002 8

Write queries for the following


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

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

500

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

price between 300 to 700

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

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

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

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

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

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

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

order of price

Activity 4: (Date Functions)

Database : Lab

Create Following table and insert tuples with suitable constraints

Table : Equipment_Details

No ItemName Costperitem Quantity Dateofpurchase Warranty Operational

1 Computer 30000 9 21/5/16 2 7

2 Printer 5000 3 21/5/15 4 2

3 Scanner 8000 1 29/8/15 3 1

4 Camera 7000 2 13/6/15 1 2

5 UPS 15000 5 21/6/16 1 4

6 Hub 8000 1 31/10/16 2 1

7 Plotter 25000 2 11/1/15 2 2

(Use date functions and aggregate functions)

1. To select the ItemName purchase after 21/05/16

2. Extend the warrenty of each item by 6 months

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

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

5. To count the number, average of costperitem of items purchased before 21/06/16

6. To display the minimum warranty , maximum warrenty period

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

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

9. To display the next Sunday from the date ’05-JUN-17’

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


Activity 5: ( Numeric, character functions)

Use Functions for the following

1. Find the mod of 165,16

2. Find Square Root of 5000

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

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

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

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

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

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

filled with ‘*’

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

filled with ‘#’

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

11. Display substring ‘BASE’ from ‘DATABASE’

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

13. Replace string Database with Datatype

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

15. Display the Character equivalent of 42

Activity : 6 (set operators)

Database : subject


Table - Physics

Regno Name Year Combination

AJ00325 Ashwin First PCM

AJ00225 Swaroop Second PMCs

AJ00385 Sarika Third PME

AJ00388 Hamsa First PMCs

Table – Computer Science

Regno Name Year Combination

AJ00225 Swaroop Second PMCs

AJ00296 Tajas Second BCA

AJ00112 Geetha First BCA

AJ00388 Hamsa First PMCs

1. Select all students from physics and Computer Science

2. Select student common in physics and Computer Science

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

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

5. Display the students studying only physics


6. Display the students studying only Computer Science

7. select all student having PMCs combination

8. select all student having BCA combination

9. select all student studying in Third year

10. Rename table Computer Science to CS

ctivity 7 (group by, having clause)

Database: Bank system


Table: Account Table: Branch

Account_no Cust_Name Brach_ID

AE0012856 Reena SB002

AE1185698 Akhil SB001

AE1203996 Daniel SB004

AE1225889 Roy SB002

AE8532166 Sowparnika SB003

AE8552266 Anil SB003

AE1003996 Saathwik SB004

AE1100996 Swarna SB002

Table: Depositor Table: Loan

Account_no Branch_Id Balance

AE0012856 SB002 12000

AE1203996 SB004 58900

AE8532166 SB003 40000

AE1225889 SB002 150000

1. Display Total Number of accounts present in each branch

2. Display Total Loan amount in each branch

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

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

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

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

7. Display Total Number of accounts present in each city

8. Display all customer details in ascending order of brachid

9. Update Balance to 26000 where accno=AE1003996

10. Display Customer Names with their branch Name

Activity 8: (views)

Branch_ID Branch_Name Branch_City

SB001 Malleshwaram Bangalore

SB002 MG Road Bangalroe

SB003 MG Road Mysore

SB004 Jainagar Mysore

Account_no Branch_Id Balance

AE1185698 SB001 102000

AE8552266 SB003 40000

AE1003996 SB004 15000

AE1100996 SB002 100000


Database: Railway Reservation System


Table: Train Details

Train_no Train_name Start_place Destination

RJD16 Rajdhani Express Bangalore Mumbai

UDE04 Udhyan Express Chennai Hyderabad

KKE55 Karnataka Express Bangalore Chennai

CSE3 Shivaji Express Coimbatore Bangalore

JNS8 Janashatabdi Bangalore Salem

Table : Availability

Train_no Class Start_Place Destination No_of_seats

RJD16 Sleeper Class Banglore Mumbai 15

UDE04 First Class Chennai Hyderabad 22

KKE55 First Class AC Bangalore Chennai 15

CSE3 Second Class Coimbatore Bangalore 8

JNS8 Sleeper Class Bangalore Salem 18

1. Create view for train details as vwtd

2. Create view for availability as vwavl

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

4. Insert new record to the view vwtd

5. Update destination=’Manglore’ where train no=’RJD16’ for the view vwtd

6. Delete a record from the view vwtd , inserted now

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

8. Create view totalseats to display train number, start place, No_of_seats

9. Use count function to No_of _seats , group by start place on the view totalseats

10. Update start place=’Hubli’ where train no=’JNS8’

11. Rename view sleeper to class

Activity 9:

Database: Mobile Shoppe (Using Joins)


Table: Mobile Handsets

Custno Cname Model Handsetno Amount

1010 Sita Nokia RM560 9500

1020 Ritesh Samsung SR12365 3200

1030 Reena Nokia RM236 1200

1040 Karan Sony Ericsson SE12334 8200

1050 Anu LG LT1255 2000

Table: Connection Details


Custno Cname Connection ActivationDate Validity Amount Phoneno

1010 Seetha Airtel 11-May-09 365 650 9985632551

1020 Ritesh Vodafone 10-Sep-08 180 400 9923033652

1030 Reena Tata Docomo 12-Aug-09 100 150 9036225636

1040 Karan Airtel 12-Jan-09 90 200 9896325415

1060 Anoop Reliance 12-Sep-09 365 220 9342653326

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

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

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

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

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

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

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

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

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

Airtel

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

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

PART-B

PHP Programming

1. Write a PHP to Generate 10 Random Numbers Using Loop

2. Write a PHP to Generate Multiplication Table Using Loop

3.Write a PHP script to delay the program execution for the given number of seconds.

4.Write a PHP function to test whether a number is greater than 30, 20 or 10 using ternary operator.

5.Create a simple HTML form and accept the user name and display the name through PHP echo statement.

6.Write a PHP script, which changes the color of the first character of a word.

7.Write a simple PHP program to check that emails are valid.

Hints : Use FILTER_VALIDATE_EMAIL filter that validates value as an e-mail address.

Note : The PHP documentation does not say that FILTER_VALIDATE_EMAIL should pass the RFC5321.

8.Write a PHP script to display string, values within a table.

Note : Use HTML table elements into echo.

9.Write a PHP script, which will return the following components of the url

'http://www.w3resource.com/php-exercises/php-basic-exercises.php'.

List of components : Scheme, Host, Path

10.Write a PHP script to get last modified information of a file.

Sample filename : php-basic-exercises.php

V Semester BCA

Data Communication and Computer Networks

Unit I: 14Hrs


Data Communication, Component and Basic Concepts –Introduction, Characteristics – Delivery, Accuracy,

Timeliness and Jitter Components – Message, Sender, Receiver, Transmission medium and protocol, Guided

& Unguided Media. Overview of Data & Signal Bits. Baud & Bit Rate. Modulation (AM, PM, FM).

Topology – Mesh, Star, Tree, Bus, Ring and Hybrid Topologies. Transmission modes – Simplex, Half

Duplex, Full Duplex. Categories of networks – LAN, MAN, WAN

Unit II: 14Hrs

Digital To Analog – ASK, PSK, FSK, QPSK. Transmission methods – Synchronous & Asynchronous, Flow

Control, Error Control, Error Detection methods. Goals of Layered protocols- Introduction to OSI, TCP/IP

.HDLC- frame format, station, states, configuration, access control.

Unit III: 14Hrs

LAN Topology – Ethernet (IEEE 802.3), Token Bus (IEEE 802.4), Token Ring (IEEE 802.5) Switching

Technologies – Circuit, Message, and Packet. X.25, X.21, RS-232 C – frame format, channel, packet frames,

facilities.

Unit IV: 14Hrs

Bridging and Routing. Congestion Control – Leaky Bucket & Token Bucket Algorithms. Introduction to data

security (private key, public key) ,

Transport Layer- UDP(User Datagram Protocol and File Transmission control Protocol(TCP).

Application Layer-Domail name system(DNS), Telnet,File Transfer Protocol,

Text books:

1. Fourauzan B., “Data Communications and Networking”, 3rd edition, TataMcGrawHillPublications, 2004,

ISBN 0 – 07 – 058408 – 7

2. Tanenbaum A., “Computer Networks”, 4th Edition, PHI, ISBN 81 – 203 –2175 – 8

Reference Books:

1. Keshav S., “An Engineering Approach to Computer Networking”, PearsonEducation, ISBN 981–235- 986

2. Comer D., “Computer Networks and Internet”, 2ND Edition, PearsonEducation, ISBN 81– 7808 – 086 – 9

3. S.K.Basandra& S. Jaiswal, “Local Area Networks”, Galgotia Publications 4. William Stallings, “Data and

Computer Communication”

C# and .NET Programming

UNIT-I 14Hrs


Introduction: Overview of OOP, Introduction to C # - Characteristics, application, Difference between c and

c#, The .NET strategy, the origins of the .NET technology, the .NET framework, benefits of the .NET approach,

C# and .NET, c# program structure, command line argument, math function, Literals, variables and data ,

constant variables, scope of variables, boxing and unboxing, Operators in C#, expression, Decision making and

looping statements in c# Methods in C# : declaring methods, nesting of methods, methods parameters, the

output parameters, variable arguments list, method overloading, Arrays - variable size arrays, the system, array

class, array list class, String handling

UNIT-II 14Hrs

Inheritance and polymorphism: classical inheritance, containment inheritance, defining a subclass, visibility

control, defining subclass constructors, multilevel inheritance, hierarchical inheritance, overriding methods,

hiding methods, abstract classes, abstract methods, sealed classes, Preventing inheritance, sealed methods,

polymorphism. Interfaces: Multiple Inheritance: defining an interface, extending an interface, implementing

interface, interface & inheritance, explicit interface implementation, abstract class and interface. Operator

overloading: over loadable operators, need for operator overloading, defining Operator overloading,

overloading unary operators, overloading binary operators, overloading Comparison operators.

UNIT-III 14Hrs

Managing Errors and Exceptions : Types of errors, exceptions, syntax of exception handling code, multiple

catch statement, the exception hierarchy, general catch handler, using final statement, nested try blocks,

throwing our own exceptions, checked and unchecked operators, using exceptions for debugging.

Data access with ADO.NET: The need for ADO.NET, two faces of ADO.NET, role of ADO.NET data

providers, Building a simple test database, selecting a data provider, working with connected layer of ADO.NET

&OleDb Data reader, inserting, updating and deleting records using OleDb command.

Text Books :

1. Profession c# - By Karli Watson, Simon Robinson, Christian Nagel, Wiley India Pvt Ltd.

2. C# Unleashed – By Joseph Mayo, Techmedia, First Edition

3. Programming C# - By Jesse Liberty, Shroff Publishers, 4TH Edition

4. Programming In C# - By Barbara Doyle, Cengage \ Delmar Learning India Pvt.

.NET List of Experiments Part a

1. C# program to check whether given number is even or odd

2. C# program to find sum of first 10 numbers.

3. C# program to print array values using for each statement.

4. C# program to demonstrate method overloading.

5. C# program to sort and reverse an array using system array class.

6. C# program to demonstrate string builder method.

7. C# program to insert a character to a existing string using system. String class.

8. C# program to illustrate simple inheritance

Part b

1. Write a program to display three images in a line. when any one of the image is clicked, it must be

displayed below. on clicking the displayed image must be cleared. The screen must look as in the

in the figure

2. Write a program that display a button in green color and it should change to yellow color when

mouse moves over it.

3. Create a radio button list that displays the name of some flowers in column. bind a radio button list

so that when a user selects a option from the list and clicks on the button the label displays the

flower selected by the user.

4. Create a user control the contains the list of colors add a button to the web for which when clicked

changes the color of the form chosen from the list.


5. Write a program that bind the properties id,name,price,qty of the following

Name:

Qty:

Price:

6. Create the user control that receives username and password from user and validate them. If the

username is “university” and the password is “bca” then user is authorized otherwise not.

7. Create a component that receives two number from user through web form, based on user

selection it add and subtract two numbers and returns result to the web form. The result should be

displayed in the web form.

8. Create a component that contains the array of 100 integer and corresponding indexer. from a web

page assign a values to some of its elements. the the web form should display the first 10 elements

of the indexer.

Elective I

INTRODUCTION TO PYTHON PROGRAMMING

Unit 1 14Hrs

Introduction To Python Installation and Working with Python Understanding Python variables Python basic

Operators Understanding python blocks Python Data Types- Declaring and using Numeric data types: int, float,

complex Using string data type and string operations Defining list and list slicing Use of Tuple data type .

Python Program Flow Control Conditional blocks using if, else and elif Simple for loops in python For loop

using ranges, string, list and dictionaries Use of while loops in python Loop manipulation using pass, continue,

break and else Programming using Python conditional and loops block

Unit 1I 14Hrs

Python Functions, Modules And Packages Organizing python codes using functions Organizing python

projects into modules Importing own module as well as external modules Understanding Packages Powerful

Lamda function in python Programming using functions, modules and external packages

Python String, List And Dictionary Manipulations Building blocks of python programs Understanding string

in build methods List manipulation using in build methods Dictionary manipulation Programming using

string, list and dictionary in build functions ,

Unit III 14Hrs

Python File Operation Reading config files in python Writing log files in python Understanding read

functions, read(), readline() and readlines() Understanding write functions, write() and writelines()

Manipulating file pointer using seek Programming using file operations

Python Exception Handling Avoiding code break using exception handling Safe guarding file operation using

exception handling Handling and helping developer with error code Programming using Exception handling

Unit IV 14Hrs

Python Object Oriented Programming – Oops Concept of class, object and instances Constructor, class

attributes and destructors Real time use of class in live projects Inheritance , overlapping and overloading

operators Adding and retrieving dynamic attributes of classes Programming using Oops support

Python Regular Expression Powerful pattern matching and searching Power of pattern searching using regex

in python Real time parsing of networking or system data using regex Password, email, url validation using

regular expression Pattern finding programs using regular expression

Text Books:

1. Charles R. Severance, “Python for Everybody: Exploring Data Using Python 3”, 1st Edition, CreateSpace Independent Publishing Platform, 2016. (http://do1.drchuck.com/pythonlearn/EN_us/pythonlearn.pdf )

2. Reemathareja , Oxford University Press ,2017 Publication.

Reference Books:


1. Charles Dierbach, "Introduction to Computer Science Using Python", 1st Edition, Wiley India Pvt Ltd.

ISBN-13: 978-8126556014

2. Mark Lutz, “Programming Python”, 4th Edition, O’Reilly Media, 2011.ISBN-13: 978-9350232873

3. Wesley J Chun, “Core Python Applications Programming”, 3rd Edition,Pearson Education India, 2015.

ISBN-13: 978-9332555365

4. Roberto Tamassia, Michael H Goldwasser, Michael T Goodrich, “Data Structures and Algorithms in

Python”,1stEdition, Wiley India Pvt Ltd, 2016. ISBN-13: 978- 8126562176

Computer Graphics and animation UNIT-1 14Hrs

Introduction – applications of computer graphics, operations of computer graphics, graphics software packages.

Graphical input – output devices- graphical input devices, graphical output devices, raster scan video principles-

raster scan monitors, color raster scan systems, plasma panel display, LCD panels, hard copy raster devices.

Random scan devices- monitor tube displays, plotters. Scan conversion – scan conversion methods, polynomial

method for line, polynomial method for circle, DDA algorithm for line, circle and ellipse, Bresenham‘s

algorithm for drawing line and circle. Midpoint methods for drawing line and circle,

problems of scan conversion.

UNIT-2 14Hrs

Scan conversion for solids- solid areas or polygons, inside-outside test – odd even method, winding number

method. Solid area filling algorithms- boundary fill algorithm, scan line fill algorithm, scan line seed fill

algorithm, ordered edge list algorithm. 2D geometrical transformations – basic transformations- translation,

rotation, scaling, homogeneous coordinate system – transformations in homogeneous notation, inverse of basic

transformations, scaling about a reference point, rotation about an arbitrary point. Other transformations

reflection about any arbitrary line, shearing, combined transformation- computational efficiency, visual reality,

inverse of combined transformations. 3D geometrical transformations- basic 3D transformation- 3D translation,

3D scaling. 3D rotation.

UNIT-3 14Hrs

Projection – introduction, parallel projection- orthographic projection, axonometric projection, oblique

projection, perspective projection – standard perspective projection, vanishing points. Image formation inside

a camera. 2D viewing and clipping- windows and viewports, viewing transformation, clipping of lines in 2D-

Cohen - Sutherland clipping algorithm, midpoint subdivision method, polygon clipping – Sutherland – Hogman

polygon clipping.

.

UNIT – 4 14Hrs

Multimedia : Definition, CD-ROM and the multimedia highway, Uses of Multimedia, Introduction to making

multimedia – The stages of Project, the hardware & software requirements to make good multimedia,

Multimedia skills . Multimedia building blocks: SOUND: MIDI, Digital audio, audio file formats. Images: still

images, color and file formats. ANIMATION: principles of animation, making animation. VIDEO: using video,

how video works, and video standards.

Text Books:

1. Computer Graphics, Multimedia and Animation by Malay K Pakhira

2. Computer Graphics, Donald Hearn, M. Pauline Baker, Prentice-Hall

3. Computer Graphics, Roy A. Plastock, Gordon Kalley, Schaum‘s Outlines, McGraw Hill


4. .Tay Vaughan “Multimedia – making it work”, TMH publication

Web Programming Unit -I 15Hrs

Revisiting HTML and XHTML concepts, 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.

Unit – II 15Hrs

Java Script and HTML Documents, Dynamic Documents with JavaScript, 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. 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.

Unit - III 15Hrs

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. 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.

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.

Elective II

SOFTWARE TESTING

UNIT – I 14Hrs

Basics of Software Testing and Examples: Basic definitions, Test cases, Insights from a Venn diagram,

Identifying test cases, Error and fault taxonomies, Levels of testing. Examples: Generalized pseudo code, The

triangle problem, The Next Date function, The commission problem, The SATM (Simple Automatic Teller

Machine) problem. Decision Table-Based Testing: Decision tables, Test cases for the triangle problem, Test


cases for the Next Date function, Test cases for the commission problem, Guidelines and observations. Data

Flow Testing: Definition-Use testing, Slice-based testing, Guidelines and observations.

UNIT – II 14Hrs

Levels of Testing: Traditional view of testing levels, Alternative life-cycle models, The SATM system,

Separating integration and system testing. Integration Testing: A closer look at the SATM system,

Decomposition-based, call graph- based, Path-based integrations, Case study. System Testing: Threads, Basic

concepts for requirements specification, Finding threads, Structural strategies and functional strategies for

thread testing, SATM test threads, System testing guidelines, ASF (Atomic System Functions) testing example.

UNIT – III 14Hrs

Interaction Testing: Context of interaction, A taxonomy of interactions, Interaction, composition, and

determinism, Client/Server Testing. Issues in Object-Oriented Testing: Units for object-oriented testing,

Implications of composition and encapsulation, inheritance, and polymorphism, Levels of object-oriented

testing, GUI testing, Dataflow testing for object-oriented software, Examples. Class Testing: Methods as units,

Classes as units.

UNIT – IV 14Hrs

Object-Oriented Integration Testing: UML support for integration testing, MM-paths for object-oriented

software, A framework for object-oriented dataflow integration testing. GUI Testing: The currency conversion

program, Unit testing, Integration Testing and System testing for the currency conversion program. Object-

Oriented System Testing: Currency converter UML description, UML-based system testing, State chart-based

system testing.

Text Books:

1. Paul C. Jorgensen: Software Testing, A Craftsman’s Approach, 3rd Edition, Auerbach

Publications, 2012.

2. Aditya P Mathur: Foundations of Software Testing, Pearson, 2008.

3. Mauro Pezze, Michal Young: Software Testing and Analysis – Process, Principles and

Techniques, 1st edition, John Wiley & Sons, 2011.

4. Srinivasan Desikan, Gopalaswamy Ramesh: Software testing Principles and Practices,

1st Edition, Pearson, 2012.

5. 5. Brian Marrick: The Craft of Software Testing, 1st edition, Pearson, 2012.

Digital Image Processing Unit I 14Hrs Digital image fundamentals:

Light and Electromagnetic spectrum, Components of Image processing system, Image formation and

digitization concepts, Neighbours of pixel adjacency connectivity, regions and boundaries, Distance measures,

Applications.

Unit II 14Hrs

Image Enhancements:

Image Enhancements: In spatial domain: Basic gray level transformations, Histogram processing, Using

arithmetic/Logic operations, smoothing spatial filters, Sharpening spatial filters.In Frequency domain:

Introduction to the Fourier transform and frequency domain concepts, smoothing frequency-domain filters,

Sharpening frequency domain filters.

Unit III 14Hrs

Image Restoration and Colour Image processing:

Various noise models, image restoration using spatial domain filtering, image restoration using frequency

domain filtering, Estimating the degradation function, Inverse filtering. Colour fundamentals, Colour models,

Colour transformation, Smoothing and Sharpening, Colour segmentation

Unit IV 14Hrs

Image compression and Image segmentation:

Introduction, Image compression model, Error-free compression, Lossy compression. Detection of

discontinuities, Edge linking and boundary detection, thresholding.

Text Books:

1. Principles of digital image processing, by Burger, Wilhelm, Burge, Mark J.

2. Fundamentals of Digital Image Processing, by Anil K Jain.


3. Fundamentals of Digital Image Processing, by Annadurai, R. Shanmugalakshmi.

NETWORK SECURITY AND CRYPTOGRAPHY

Unit - I 14Hrs

Introduction: Security Goals, Cryptographic Attacks, Services and Mechanism, Techniques. 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. Advanced Encryption Standard: Introduction, Transformations, Key Expansion, The AES

Ciphers, Examples.

Unit II 14Hrs

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. Asymmetric Key Cryptography: Introduction, RSA Cryptosystem, Rabin

Cryptosystem, Elgamal Cryptosystem, Introduction to Elliptic Curve Cryptosystems.

Unit - III 14Hrs

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.

Unit – IV 14Hrs

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, Secure

Electronic Transactions

] Text Book: 1. Behrouz A. Forouzan, DebdeepMukhopadhyay: 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.


VI semester

Data Miningand Data Warehousing

UNIT-I 14 Hours

Introduction: What is Data Warehouse? Data Warehouse Modeling: Data Cube and OLAP, Data Warehouse

Implementation, Data Mining, What kinds of Data can be Mined, What kinds of patterns can be Mined, Data

cleaning, Data integration: ( Entity, Identification Problem, Redundancy & Correlation Analysis),

UNIT-II 14 Hours

Data Reduction: (Wavelet Transforms, Attribute Subset Selection, Histogram, Clustering, Sampling, Data Cube

Aggregation),Data Transformation: Strategies Overview, Data Transformation by Normalization.

Mining Frequent Patterns, Associations & Correlations: Basic Concept, Frequent Itemset mining methods,

pattern evaluation methods.

UNIT-III 14 Hours

Classification, Decision tree Induction, Attribute Selection Measures, Tree Pruning, Bayes Classification

Methods.

Cluster Analysis: What is a cluster analysis? Requirement for Cluster Analysis, Partitioning methods,

Hierarchical methods.

UNIT-IV 14 Hours

Data Mining Applications & Trends: Mining Sequence Data; Time Series, Symbolic, Biological; Statistical

Data Mining, Visual & Audio Data Mining, Data Mining Applications, Data Mining Trends.

Reference Books:

1. JiaweiMichelineKamber, ‘Data Mining Concepts and Techniques’, Morgan Kauf Mann Publishers.

2. George M. Marakas, ‘Modern Data Warehousing, Mining and Visualization’, Pearson Education, 2003.

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

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

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

Cloud Computing and Big Data Analytics


UNIT – I 14Hrs

Introduction: Essentials, Benefits and need for Cloud Computing - Business and IT Perspective - Cloud and

Virtualization - Cloud Services Requirements - Cloud and Dynamic Infrastructure - Cloud Computing

Characteristics Cloud Adoption. Cloud Models: Cloud Characteristics - Measured Service - Cloud Models -

Security in a Public Cloud Public versus Private Clouds. Cloud Infrastructure Self Service. Cloud as a Service:

Gamut of Cloud Solutions - Principal Technologies - Cloud Strategy Cloud Design and Implementation using

SOA - Conceptual Cloud Model - Cloud Service Defined.

UNIT – II 14Hrs

Cloud Solutions: Cloud Ecosystem - Cloud Business Process Management - Cloud Service Management -

Cloud Stack - Computing on Demand (CoD) – Cloud sourcing. Cloud Offerings: Information Storage,

Retrieval, Archive and Protection - Cloud Analytics Testing under Cloud - Information Security - Virtual

Desktop Infrastructure - Storage Cloud. Cloud Management: Resiliency – Provisioning - Asset Management -

Cloud Governance - High Availability and Disaster Recovery - Charging Models, Usage Reporting, Billing and

Metering.

UNIT III 14Hrs

Introduction to big data acquisition, collection and transmission: Big data framework fundamental concepts of

Big Data management and analytics - Current challenges and trends in Big Data Acquisition. Big data

collection- Strategies- Types of Data Sources- Structured Vs Unstructured data- ELT vs ETL - storage

infrastructure requirements -Collection methods-Log files- Sensors- Methods for acquiring network data

(Libcap-based and zerocopy packet capture technology) -Specialized network monitoring softwares

(Wireshark, Smartsniff and Winnetcap) - Mobile equipment’s, Transmission methods- Issues.

UNIT IV 14Hrs

Data Pre-processing and analytics : Data pre-processing overview-Sampling- Missing Values -Outlier

Detection and Treatment - Standardizing Data- Categorization - Weights of Evidence Coding -Variable

Selection and Segmentation. DATA ANALYTICS: Predictive Analytics (Regression, Decision Tree, Neural

Networks) - Descriptive Analytics (Association Rules, Sequence Rules), Social Network Analytics (Social

Network Learning Relational Neighbour Classification).

Text Books:

1.Cloud Computing – Insight into New Era Infrastructure, Dr. Kumar Saurabh, Wiley India.

2. Cloud Computing: Implementation, Management, and Security, John W. Rittinghouse and James F.Ransome,

CRC Press, 2010.

3. Cloud Computing:Principles and Paradigms, RajkumarBuyya, James Broberg, Wiley 2011.

4. Cloud Computing for Dummies, Judith Hurwiz, Wiley Publishing, 2009.