B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No.

28 G
Page 1 of 36 SCAA Dt. 21.05.2009

BHARATHIAR UNIVERSITY::COIMBATORE-641 046

B.Sc. COMPUTER SCIENCE AND APPLICATIONS with
DIPLOMA in MULTIMEDIA AND ANIMATION
(For the students admitted from the academic year 2009-2010 and onwards)

SCHEME OF EXAMINATION – CBCS PATTERN

Examinations

Credit
Ins. hrs/
Part

Dur.Hr
Study

Marks

Marks
Total
week
Course title

CIA
Components

s
SEMESTER I
I Language – I 6 3 25 75 100 3
II English – I 6 3 25 75 100 3
III Core 1: COBOL Programming 4 3 25 75 100 4
Core 2: Digital Fundamentals and Architecture 4 3 25 75 100 5
Core Lab 1: Programming Lab - COBOL 3 3 40 60 100 3
Allied 1: Discrete Mathematics 5 3 25 75 100 5
IV Environmental Studies # 2 3 - 50 50 2

SEMESTER II
I Language – II 6 3 25 75 100 3
II English – II 6 3 25 75 100 3
III Core 3: Data Structures and C Programming 6 3 25 75 100 4
Core Lab 2: Programming Lab – C (Data
4 3 40 60 100 3
Structures)
Allied 2: Computer–Based Optimization
6 3 25 75 100 5
Techniques
IV Value Education – Human Rights # 2 3 - 50 50 2

SEMESTER III
Core 4: Operating Systems 6 3 25 75 100 5
III Core 5: C++ Programming 6 3 25 75 100 4
III Core Lab 3: Programming Lab - C++ 5 3 40 60 100 3
III Allied 3: Management Information Systems 6 3 25 75 100 5
IV Tamil @ / Advanced Tamil# (OR)
Non-major elective - I (Yoga for Human 2 3 75 75 2
Excellence)# / Women’s Rights#
IV Skill based Subject I – Diploma Paper -
5 3 25 75 100 3
Multimedia
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 2 of 36 SCAA Dt. 21.05.2009

SEMESTER IV
III Core-6: Computer Graphics 6 3 25 75 100 4
Core-7: Multimedia and its Applications 6 3 25 75 100 5
Core Lab-4: Programming Lab – Graphics using C 6 3 40 60 100 3
Allied-4: Business Accounting 6 3 25 75 100 5
IV Tamil @ /Advanced Tamil # (OR)
2 3 75 75 2
Non-major elective -II (General Awareness #)
IV Skill based Subject 2 – Diploma paper - Multimedia
4 3 40 60 100 3
Lab - Photoshop

SEMESTER V
III Core-8: RDBMS & ORACLE 6 3 25 75 100 5
III Core-9: Visual Programming-Visual Basic 6 3 25 75 100 4
III Core-10: Artificial Intelligence & Expert Systems 6 3 25 75 100 5
Core Lab-5: Programming Lab-VB & Oracle 4 3 40 60 100 3
Elective - I 5 3 25 75 100 5
IV Skill based Subject 3 - Diploma Paper - Animation
3 3 25 75 100 3
Techniques

SEMESTER VI
Core-11: Computer Networks 5 3 25 75 100 4
Core-12: Java Programming 6 3 25 75 100 5
Core Lab-6: Programming Lab - Java 6 3 40 60 100 3
Elective - II 5 3 25 75 100 5
Elective - III 5 3 25 75 100 5
IV Skill Based Subject 4 Diploma Paper - Animation
3 3 40 60 100 3
Lab - Flash
V Extension Activities @ - - 50 - 50 1
Total 3600 140

@ No University Examinations. Only Continuous Internal Assessment (CIA)

# No Continuous Internal Assessment (CIA). Only University Examinations.

List of Elective papers (Colleges can choose any one of the paper as electives)
Elective – I A Client / Server Computing
B E-Commerce
C Software Engineering
Elective – II A Network Security & Cryptography
B Distributed Computing
C Data Mining
Elective - III A Mobile Computing
B Web Technology
C Software Testing
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 3 of 36 SCAA Dt. 21.05.2009

CORE 1 : COBOL PROGRAMMING

Subject Description:
This subject deals with the programming concepts on business applications using
COBOL language.
Goal: To learn about COBOL programming language for business problems
Objective:
On successful completion of this subject the students should have :
- Writing programs for business applications
- Concepts of file handling in programming languages

Unit I
Introduction to COBOL: COBOL words - Literals - Structure of COBOL Program -
COBOL Coding Sheet-IDENTIFICATION DIVISION- ENVIRONMENT DIVISION – DATA
DIVISION – Editing and Non-editing Picture Clauses – Level Numbers – VALUE and FILLER
Clause.

Unit II
PROCEDURE DIVISION – Data Movement Verb – Arithmetic Verbs : Add, Subtract,
Multiply, Divide, Compute – Input/Output Statement: Accept, Display Control Verbs: GOTO –
GOTO Depending on – Stop Run – CORRESPONDING Option - ROUNDED option - ON
SIZE ERROR option - Simple Programs Using Above Verbs.

Unit III
Conditional Statements: If Statement – Nested if statement – Sign Condition – Class
Condition- Condition Name – Compound Condition- PERFORM Statements, More about
DATA Division: RENAMES-REDEFINES – Simple Programs Using the above Verbs.

Unit IV
Files in COBOL: Sequential – Relative – Indexed Sequential - Random files – File
description and Record description entries - Input/Output Verbs: Open, read, write, rewrite,
Close, Delete – Sort Verb – Simple Programs using above Verbs.

Unit V
Table Handling: Occurs Clause – Two and Multi-Dimensional Tables – Occurs. Indexed
By Clause – SET Verb – START and SEARCH Verb – Random Files-Keys & Their Importance
– INVALID KEY Clause – SCREEN SECTION - Simple Programs using above Verbs.

Text Books:
1. COBOL PROGRAMMING, M.K. ROY & D.GHOSH DASTIDAR,TATA
Mc.GRAW HILL, SECOND EDITION - 1998.
Reference Books:
1. COBOL programming – V. Rajaraman, PHI Pub.
2. Introduction To Cobol Programming – Author Dr. R. Krishnamoorthy, JJ
Publications.
3. Structured COBOL – Welburn, Tata McGrawhill, 4th Edition.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 4 of 36 SCAA Dt. 21.05.2009

CORE 2 : DIGITAL FUNDAMENTALS AND ARCHITECTURE

Subject Description:
This subject deals with fundamentals of digital computers, Microprocessors and system
architecture.
Goal: To learn about computer fundamentals and its organization.
Objective:
On successful completion of this subject the students should have :
- Knowledge on digital circuits
- Microprocessor architecture
- Interfacing of various components
Unit I
Number System and Binary Codes: Decimal, Binary, Octal, Hexadecimal – Binary
addition, Multiplication, Division – Floating point representation, Complements, BCD, Excess3,
Gray Code.
Arithmetic Circuits: Half adder, Full adder, Parallel binary adder, BCD adder, Half
subtractor, Full subtractor, Parallel binary subtractor - Digital Logic: the Basic Gates – NOR,
NAND, XOR Gates.
Unit II
Combinational Logic Circuits: Boolean algebra –Karnaugh map – Canonical form 1 –
Construction and properties – Implicants – Don’t care combinations - Product of sum, Sum of
products, simplifications.
Sequential circuits: Flip-Flops : RS, D, JK, T - Multiplexers – Demultiplexers – Decoder
– Encoder - Counters.
Unit III
MICROPROCESSOR: Architecture – Bus Organization – Functional diagram and pin
out diagram of 8085 - Addressing modes of 8085 – Instruction set of 8085 – I/O Schemes –
Peripherals and Interfaces.
Unit IV
Input – Output Organization: Input – output interface – I/O Bus and Interface – I/O Bus
Versus Memory Bus – Isolated Versus Memory – Mapped I/O – Example of I/O Interface.
Asynchronous data transfer: Strobe Control and Handshaking – Priority Interrupt: Daisy-
Chaining Priority, Parallel Priority Interrupt. Direct Memory Access: DMA Controller, DMA
Transfer. Input – Output Processor: CPU-IOP Communication.
Unit V
Memory Organization: Memory Hierarchy – Main Memory- Associative memory:
Hardware Organization, Match Logic, Read Operation, Write Operation. Cache Memory:
Associative, Direct, Set-associative Mapping – Writing Into Cache Initialization. Virtual
Memory: Address Space and Memory Space, Address Mapping Using Pages, Associative
Memory Page Table, Page Replacement.
Text Books:
1. Digital Electronics Circuits and Systems, V.K. PURI, TATA McGRAW-HILL Pub. Company
2. Computer System Architecture, M. MORRIS MANO, Pearson Education Pub, III Edition.
Reference Books:
1. Digital principles and applications, Albert paul malvino, Donald P Leach, McGrawHill, 1996.
2. Computer Architecture, Carter, Schaums outline series, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 5 of 36 SCAA Dt. 21.05.2009

CORE LAB -1 : PROGRAMMING LAB - COBOL

1. Write a COBOL program to find the sum of individual digits of a 10-digit number until a
single digit is produced.
2. Write a COBOL program to accept the inputs student Name, Marks for five subjects and
declare the result as PASS, if the student gets minimum 40 in each subject otherwise
declare the result as FAIL.
3. Write a COBOL program to accept the given date (DDMMYY) and display the result in
the following specified format:
For eg : 030498
3rd APR 1998 [Use REDEFINES Clause].
4. Write a COBOL program to display the given three digit number into words using
OCCURS clause
For eg : 342
THREE HUNDRED AND FORTY TWO
5. Write a COBOL program to create a student data file using the following fields:
ROLL-NO, NAME, AGE, SEX, YEAR-IN-COLLEGE, MARKS for five subjects
6. Write a COBOL program to create the following two files using the student data file
(created by program 5):
FILE 1: List of male student who are studying third year of the College.
FILE 2: List of female students who are studying first year of the College.
[Use MOVE…….CORRESPONDING Option]

7. Write a COBOL program to sort the student data file (crated by program 5) in the
ascending order of the fields SEX, Year-in-college and ROLL-NO.
[Use SORT Verb].
8. Write a COBOL program to create an indexed sequential file for the employees of an
organization using the following fields :
EMP-NO, NAME, DOB, SEX, BASIC-PAY, DESIGNATION.
9. Write a COBOL program to update the new BASIC-PAY of each employee in the
Employee data file (crated in program 8) by incrementing 25% of BASIC-PAY.
10. Write a COBOL program to find the number of male employees whose
BASIC-PAY > 4000 and the number of female employees whose
BASIC-PAY < 3000 using the employee data file (created by program 8)
11. Write a COBOL program to crate an inventory data file by using the
following fields :
ITEM-CODE, DESCRIPTION, OPEN-STOCK, PURCHASES,
SALES, SAFETY-LEVEL, CLOSE-STOCK.

12. Write a COBOL program to prepare RE-ORDER LEVEL STATEMENT by using the
inventory data file (crated by program 11) if the
CLOSE-STOCK is less than SAFETY-LEVEL :
A.B.C.& COMPANY, CHENNAI-600006
RE-ORDER LEVEL STATEMENT
-----------------------------------------------------------------------------------------------
ITEM-CODE DESCR IPTION SAFETY-LEVEL CLOSE-STOCK
-----------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 6 of 36 SCAA Dt. 21.05.2009

ALLIED 1: DISCRETE MATHEMATICS

Subject Description:
This subject deals with discrete structures like set theory, mathematical logic, relations,
languages, graphs and trees.

Goal:
To learn about the discrete structures for computer based applications.

Objective:
On successful completion of this subject the students should have :
- Understanding the concepts of discrete mathematics
- Learning applications of discrete structures in Computer Science.
Unit I
Set theory-Introduction-Set & its Elements-Set Description-Types of sets-Venn-Euler
Diagrams- Set operations & Laws of set theory-Fundamental products-partitions of sets-minsets-
Algebra of sets and Duality-Inclusion and Exclusion principle

Unit II
Mathematical logic – Introduction- prepositional calculus –Basic logical operations-
Tautologies-Contradiction-Argument-Method of proof- Predicate calculus.

Unit III
Relations – Binary Relations – Set operation on relations-Types of Relations – Partial
order relation – Equivalence relation – Composition of relations – Functions – Types of
functions – Invertible functions – Composition of functions.

Unit IV
Languages – Operations on languages – Regular Expressions and regular languages –
Grammar – Types of grammars – Finite state machine – Finite – State automata

Unit V
Graph Theory – Basic terminology – paths, cycle & Connectivity – Sub graphs - Types
of graphs – Representation of graphs in compute memory - Trees – Properties of trees – Binary
trees – traversing Binary trees – Computer Representation of general trees.

Text Books:
1. Discrete Mathematics – J.K. Sharma Second Edition – 2005 , Macmillan India Ltd.
(UNIT I TO V)
Reference Books:
1. Discrete Mathematics Structures with Applications to computer science - J. P
Tremblay R Manohar – Mc Graw Hill International Edition
2. Discrete Mathematics – Dr M. K. Venketaramen, Dr N.Sridharan, N.
Chandarasekaran – The National publishing Company Chennai
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 7 of 36 SCAA Dt. 21.05.2009

CORE 3 : DATA STRUCTURES AND C PROGRAMMING

Subject Description:
This subject deals with the methods of data structures using C programming language.
Goal: To learn about C programming language using data structural concepts.
Objective:
On successful completion of this subject the students should have writing programming
ability on data structures dealing with Stacks, Queues, List, Searching and Sorting algorithms
etc.,
UNIT – I:
Programming development methodologies – Programming style – Problem solving
techniques: Algorithm, Flowchart, Pseudocode - Structure of a C program – C character set –
Delimiters – Keywords – Identifiers – Constants – Variables – Rules for defining variables –
Data types – Declaring and initializing variables – Type conversion.
Operators and Expressions – Formatted and Unformatted I/O functions – Decision
statements – Loop control statements.

UNIT – II:
Arrays – String and its standard functions.
Pointers – Functions – Preprocessor directives: #define, #include, #ifndef, Predefined macros.
UNIT – III:
Structure and Union: Features of structure, Declaration and initialization of structure,
Structure within structure, Array of structure, Pointer to structure, Bit fields, Enumerated data
types, Union.
Files: Streams and file types, Steps for file operation, File I/O, Structures read and write,
other file functions, Command line arguments, I/O redirection.
UNIT – IV:
Linear data structures: Introduction to data structures – List: Implementations, Traversal,
Searching and retrieving an element, Predecessor and Successor, Insertion, Deletion, Sorting,
Merging lists – Stack: Representation, Terms, Operations on stack, Implementation.
Single linked list, Linked list with and without header, Insertion, Deletion, Double linked
list – Queues: Various positions of queue, Representation

UNIT V:
Searching and Sorting – Searching: Linear, Binary. Sorting – Insertion, Selection,
Bubble, Quick, Tree, Heap.

TEXT BOOK:
1. Ashok N Kamthane, “PROGRAMMING AND DATA STRUCTURES” – Pearson
Education, First Indian Print 2004, ISBN 81-297-0327-0.
REFERENCE BOOK:
1. E Balagurusamy: Programming in ANSI C, Tata McGraw-Hill, 1998.
2. Ellis Horowitz and Sartaj Sahni: Fundamentals of Data Structure, Galgotia Book Source,
1999.
3. Data structure using C – Aaron M Tanenbaum, Yedidyeh langsam, Moshe J Augenstein,
PHI Pub
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 8 of 36 SCAA Dt. 21.05.2009

CORE LAB-2: PROGRAMMING LAB – C (DATA STRUCTURES)

1. Write a C program to create two array list of integers. Sort and store the elements of both
of them in the third list.

2. Write a C program to experiment the operation of STACK using array implementation.

3. Write a C program to create menu driven program to implement QUEUE to perform the
following:
(i) Insertion
(ii) Deletion
(iii) Modification
(iv) Listing of elements using points

4. Write a C program to create LINKED LIST representation of employee records and do

the following operations using pointers:
a. To add a new record
b. To delete an existing record
c. To print the information about an employee
d. To find the number of employees in the structure.

5. Write a C program to count the total nodes of the linked list.

6. Write a C program to insert an element at the end of the linked list.

7. Write a C program to insert an element at the beginning of the Double linked list.

8. Write a C program to display the hash table, which is to be prepared by using the Mid-
square method.

9. Write a C program to demonstrate Binary search.

10. Write a C program to insert nodes into a Binary tree and to traverse in pre-order.

11. Write a C program to arrange a set of numbers in ascending order using QUICK-SORT.

12. Write a C program to arrange a set of numbers in descending order using EXCHANGE-
SORT.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 9 of 36 SCAA Dt. 21.05.2009

ALLIED-2 COMPUTER BASED OPTIMIZATION TECHNIQUES

Subject Description: This subject deals various optimization techniques for linear
programming, Transportation, Assignment Problems, Game theory, PERT and CPM.

Goal: To learn about the managerial concepts like decision making, optimization, etc.

Objective: On successful completion of this subject the students should have:

- Understanding various mathematical applications in industries.
- Decision making for real time environment.
-----

UNIT-I: Linear Programming - Mathematical Model assumption of linear Programming –

Graphical method - Principles of Simplex method, Big-M Method ,Duality, Dual simplex
method.

UNIT-II: Transportation and assignment problem - Integer Programming Branch and Round
Techniques - Assignment and Traveling Salesman Problem.

UNIT-III: Game Theory - Concept of Pure and Mixed Strategies – Solving 2 x 2 matrix with
and without saddle point - n x 2 - 2 x m games. Replacement models - Elementary replacement
models - present value - rate of return - depreciation - Individual replacement – Group
replacement.

UNIT-IV: (Derivations not included) Queuing Theory - definition of waiting line model -Queue
discipline - traffic intensity - poison arrival – Birth death process - Problem from single server:
finite and infinite population model – Problems from multi server: finite and infinite population
model.

UNIT-V: PERT & CPM - Network representation - backward pass - Forward pass - computation
- Pert Network - Probability factor – updating and Crashing.

TEXT BOOKS
1. OPERATIONS RESEARCH - Manmohan, P.K. Gupta, Kanthiswarup, S. CHAND &
SONS - 1997.

REFERENCE BOOKS
1. OPERATIONS RESEARCH - Hamdy A Taha, Pearson Education, 7th edition, 2002
2. PROBLEMS IN OPERATIONS RESEARCH – P.K. Gupta, D.S. Hira, S. Chand Pub
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 10 of 36 SCAA Dt. 21.05.2009

CORE-4 OPERATING SYSTEMS

Subject Description: This subject deals Operating Systems concepts and Information, Process
and Memory Managements. Also it deals with advanced topics like Distributed processing,
Remote Procedure call and Clusters.

Goal: Knowledge on Operating system and how it controls the information and hardware.

Objective: To inculcate knowledge on OS concepts and functioning of modern OS.

-----

UNIT-I: Operating System Overview: Operating System Objectives and Functions – The
Evolution of Operating Systems – Major Achievements – Developments Leading to Modern
Operating Systems – Microsoft Windows Overview – Traditional UNIX Systems – Modern
UNIX Systems – Linux 95.

UNIT-II: OS-Functions and Structure: Different Services of Operating System – Operating

System Structure – Booting. Information Management: The File System - Device Driver.

UNIT-III: Process Management: What Is A Process? – Evolution of Multiprogramming –

Context Switching – Process States – Process State Transitions – Operations on a Process.

UNIT-IV: Memory Management: Introduction – Single Contiguous Memory Management –

Fixed Partition Memory Management – Variable Partitions – Non-contiguous Allocation –
Paging – Segmentation – Combined Systems – Virtual Memory Management Systems.

UNIT-V: Distributed Processing, Client/Server and Clusters: Client/Server Computing –

Distributed Message Passing- Remote Procedure Calls – Clusters –Windows Cluster – Sun
Cluster – Beowulf And Linux Clusters.

TEXTBOOKS:
1. OPERATING SYSTEMS Internals and Design Principles – William Stallings, 5th
edition,PHI.
(UNIT-I: 2.1-2.8 UNIT-V: 14.1-14.7)
2. OPERATING SYSTEMS – Achyut Godbole , 2nd edition, TMH.
(UNIT II: 3.2, 3.7, 3.9, 4.2, 4.3 UNIT-III: 5.2-5.6, 5.9 UNIT-IV: 8.1-8.9)

REFERENCE BOOKS:
1. OPERATING SYSTEMS Concepts and Design – Milan Milankovic, 2nd
edition, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 11 of 36 SCAA Dt. 21.05.2009

CORE 5 : C++ PROGRAMMING

Subject Description: This subject deals with Object–oriented programming concepts like
Abstraction, Encapsulation, Inheritance and Polymorphism.

Goal: Knowledge on Object–oriented concept and programming with C++.

Objective: To inculcate knowledge on Object-oriented programming concepts using C++.

UNIT-I: Introduction to C++ - key concepts of Object-Oriented Programming –Advantages –

Object Oriented Languages – I/O in C++ - C++ Declarations. Control Structures : - Decision
Making and Statements : If .. else ,jump, goto, break, continue, Switch case statements - Loops
in C++ : For,While, Do - Functions in C++ - Inline functions – Function Overloading.

UNIT-II : Classes and Objects : Declaring Objects – Defining Member Functions – Static
Member variables and functions – array of objects –friend functions – Overloading member
functions – Bit fields and classes – Constructor and destructor with static members.

UNIT-III
Operator Overloading: Overloading unary, binary operators – Overloading Friend functions –
type conversion – Inheritance: Types of Inheritance – Single, Multilevel, Multiple, Hierarchal,
Hybrid, Multi path inheritance – Virtual base Classes – Abstract Classes.

UNIT-IV:
Pointers – Declaration – Pointer to Class , Object – this pointer – Pointers to derived classes and
Base classes – Arrays – Characteristics – array of classes – Memory models – new and delete
operators – dynamic object – Binding , Polymorphism and Virtual Functions.

UNIT-V:
Files – File stream classes – file modes – Sequential Read / Write operations – Binary and
ASCII Files – Random Access Operation – Templates – Exception Handling - String –
Declaring and Initializing string objects – String Attributes – Miscellaneous functions .

TEXT BOOKS :
1. Ashok N Kamthane , OBJECT-ORIENTED PROGRAMMING WITH ANSI AND
TURBOC C++, Pearson Education publication. 2003.

REFERENCE BOOKS:
1.E. Balagurusamy, OBJECT-ORIENTED PROGRAMMING WITH C++, Tata Mc-Grawhill
Pupblication, 1998.
2. Maria Litvin & Gray Litvin , C++ for you, Vikas publication, 2002.
3. John R Hubbard, Programming with C, 2nd Edition, TMH publication, 2002.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 12 of 36 SCAA Dt. 21.05.2009

CORE LAB - 3 : PROGRAMMING LAB C++

1. Write a C++ Program to create a class to implement the Data Structure STACK. Write a
constructor to initialize the TOP of the STACK. Write a member function PUSH() to
insert an element and member function POP() to delete an element check for overflow
and underflow conditions..

2. Write a C++ Program to create a class ARITHMETIC which consists of a FLOAT and an
INTEGER variable. Write a Member function ADD (),SUB(),MUL(),DIV() to perform
addition, subtraction, multiplication, division respectively. Write a member function to
get and display values.

3. Write a C++ Program to read an integer number and find the sum of all the digits until it
reduces to a single digit using constructors, destructors and inline member functions.

4. Write a C++ Program to create a class FLOAT that contains one float data member.
Overload all the four Arithmetic operators so that they operate on the object FLOAT.

5. Write a C++ Program to create a class STRING. Write a Member Function to initialize
,get and display stings. Overload the Operator “+” to Concatenate two Strings, “= =” to
Compare two strings
6. Write a C++ Program to create class, which consists of EMPLOYEE Detail like
E_Number, E_Name, Department, Basic, Salary, Grade. Write a member function to get
and display them. Derive a class PAY from the above class and write a member function
to calculate DA, HRA and PF depending on the grade.
7. Write a C++ Program to create a class SHAPE which consists of two VIRTUAL
FUNCTIONS Calculate_Area() and Calculate_Perimeter() to calculate area and
perimeter of various figures. Derive three classes SQUARE, RECTANGLE, TRIANGE
from class Shape and Calculate Area and Perimeter of each class separately and display
the result.
8. Write a C++ Program to create two classes each class consists of two private variables, a
integer and a float variable. Write member functions to get and display them. Write a
FRIEND Function common to both classes, which takes the object of above two classes
as arguments and the integer and float values of both objects separately and display the
result.
9. Write a C++ Program using Function Overloading to read two Matrices of different Data
Types such as integers and floating point numbers. Find out the sum of the above two
matrices separately and display the sum of these arrays individually.
10. Write a C++ Program to check whether the given string is a palindrome or not using
Pointers.
11. Write a C++ Program to create a File and to display the contents of that file with line
numbers.
12. Write a C++ Program to merge two files into a single file.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 13 of 36 SCAA Dt. 21.05.2009

ALLIED-3 MANAGEMENT INFOROMATION SYSTEMS

Subject Description: This subject deals with various management approaches of Information
Systems.
Goal: Knowledge on how to manage Information like an experienced manager.
Objective: To inculcate knowledge on managing different information systems.
UNIT-I: Introduction to MIS: MIS concept – Definition – Role of MIS – Impact of MIS – MIS
and the User – Management as a Control system – MIS: a support to Management -
Management Effectiveness and MIS – Organization as a system – MIS: organization
effectiveness. E-business enterprise: Introduction – Organization of Business in an E-enterprise
– E-business – E-commerce – E-communication – E-collaboration.

UNIT-II: Strategic Management of Business: The concept of corporate planning – Essentiality

of Strategic Planning – Development of Business Strategies – Types of Strategies – Short-range
Planning – Tools of Planning – Strategic Analysis of Business. Information Security
Challenges in E-Business: Introduction – Security Threats and Vulnerability – Controlling
Security Threat and Vulnerability – Management Security Threats and Vulnerability – Disaster
Management – MIS and Security Challenges.

UNIT-III: Decision Making: Decision-making concepts – Decision-making process – Decision

Analysis by Analytical Modeling – Behavioural Concepts in Decision-making – Organizational
Decision-making – MIS and Decision-making. Information and Knowledge: Information
Concepts – Information: a quality product – Classification of Information – Methods of data and
Information Collection – Value of Information – General Model of a Human as an Information
Processor.

UNIT-IV: Applications in Manufacturing Sector: Personnel, Financial, Production, Raw

Material and Marketing Managements. Applications in Service Sector: Service management
System – MIS Application in Service Industry – MIS: Service Industry.

UNIT-V: Enterprise Management Systems: Enterprise Management Systems – ERP system –

ERP Model and Modules – Benefits of ERP – ERP Product Evaluation – ERP Implementation.
Technology of Information Systems: Introduction – Data Processing – Transaction Processing –
Application Processing – Information System processing.

TEXTBOOKS:
1. MANAGEMNET INFORMATION SYSTEMS Text and Cases – Waman S Jawadekar,
3rd ed, PHI. (UNIT-I: 1.1-1.10, 2.1-2.6 UNIT-II: 3.1-3.7,4.1-4.6 UNIT III: 6.1-6.6,7.7-7.6
UNIT-IV: 12.2-12.6,13.6-13.8 UNIT-V: 15.1-15.6,16.1-16.6)
REFERENCE BOOKS:
1. MANAGEMNET INFORMATION SYSTEMS managing the Digital Firm – Kenneth C.
Laudon & Jane P. Laudon, 9th edition, PHI.
2. MANAGEMNET INFORMATION SYSTEMS for the Information Age – Haag,
Cummings, McCubbrey, 4th edition, TMH.
3. MANAGEMNET INFORMATION SYSTEMS a Concise Study – S.A. Kelkar, 2005,
PHI.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 14 of 36 SCAA Dt. 21.05.2009

DIPLOMA PAPER -1 MULTIMEDIA

Subject Description: This Subject deals Multimedia Applications.

Goal: To learn about Multiple media and their technologies.

Objective: To inculcate knowledge on Media, Text, Image, Audio, Video, Animation etc.

UNIT-I: Introduction: Multimedia Presentation and Production – Characteristics of Multimedia

Presentation – Multiple Media- Utilities of Multi-sensory Perception – Hardware and Software
Requirements. Digital Representation: Analog Representation – Waves – Digital
Representation – Need for Digital Representation – Analog to Digital Conversion – Digital to
Analog Conversion. Text: Types of Text – Unicode Standard – Font – Insertion of Text – Text
compression – File formats.

UNIT-II: Image: Image Types – Seeing Color – Color Models – Basic Steps for Image
Processing – Scanner – Digital Camera – Interface Standards – Specification of Digital Images –
CMS – Device Independent Color Models – Image Processing software – File Formats – Image
Output on Monitor and Printer.

UNIT-III: Audio: Introduction – Acoustics – Nature of Sound Waves – Fundamental

Characteristics of Sound – Microphone – Amplifier – Loudspeaker – Audio Mixer – Digital
Audio – Synthesizers – MIDI – Basics of Staff Notation – Sound Card – Audio Transmission –
Audio File formats and CODECs – Audio Recording Systems – Audio and Multimedia – Voice
Recognition and Response - Audio Processing Software.

UNIT-IV: Video: Analog Video Camera – Transmission of Video Signals – Video Signal
Formats – Television Broadcasting Standards – Digital Video – Digital Video Standards - PC
Video – Video Recording Formats and Systems - Video File Formats and CODECs – Video
Editing – Video Editing Software.

UNIT-V: Animation: Types of Animation – Computer Assisted Animation – Creating

Movement – Principles of Animation – Some Techniques of Animation – Animation on the Web
– Special Effects – Rendering Algorithms. Compression: MPEG-1 Audio – MPEG-1 Video -
MPEG-2Audio – MPEG-2 Video.

TEXTBOOKS:
1. PRINCIPLES OF MULTIMEDIA – Ranjan Parekh, 2007, TMH.
(UNIT I: 1.1-1.6, 2.1-2.7, 4.1-4.7 UNIT-II: 5.1-5.16 UNIT-III: 7.1-7.4, 7.8-7.14, 7.18-7.20, 7.22,
7.24, 7.26-28 UNIT-IV: 8.1-8.12 UNIT-V: 9.5-9.10, 9.13, 9.15, 10.10-10.13)

REFERENCE BOOKS:
1. MULTIMEDIA: Making it Work – Tay Vaughan, 7th edition, TMH.
2. Comdex MULTIMEDIA AND WEB DESIGN – Vikas Gupta, DreamTech press.2007.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 15 of 36 SCAA Dt. 21.05.2009

Core 6 : COMPUTER GRAPHICS

Subject Description: This subject deals with Graphics Concepts and methodologies.
Goal: Mathematical Knowledge on Graphics and Technical background.
Objective: To inculcate knowledge on Graphics with various concepts.

UNIT-I: Output Primitives: Points and Lines – Line-Drawing algorithms – Loading frame
Buffer – Line function – Circle-Generating algorithms – Ellipse-generating algorithms.
Attributes of Output Primitives: Line Attributes – Curve attributes – Color and Grayscale
Levels – Area-fill attributes – Character Attributes.

UNIT-II: 2D Geometric Transformations: Basic Transformations – Matrix Representations –

Composite Transformations – Other Transformations. 2D Viewing: The Viewing Pipeline –
Viewing Co-ordinate Reference Frame – Window-to-Viewport Co-ordinate Transformation - 2D
Viewing Functions – Clipping Operations – Point, Line, Polygon, Curve, Text and Exterior
clippings.

UNIT-III: 3D Concepts: 3D Display Methods – 3D Graphics Packages. 3D Object

Representations: Polygon Surfaces – Curved lines and Surfaces – Quadric Surfaces – Super
quadrics – Blobby Objects – Spline representations. 3D Geometric Modeling and
Transformations: Translation – Rotation – Scaling – Other Transformations – Composite
Transformations – 3D Transformation functions..

UNIT-IV: Visible-Surface Detection Methods: Classification of Visible-Surface algorithms –

Back-Face Detection – Depth-Buffer Method – A-Buffer method- Scan-Line Method – Depth-
Sorting Method – BSP-Tree Method – Area-Subdivision Method – Octree Methods – Ray-
casting Methods – Curved surfaces – Wire frame Methods – Visibility-Detection functions.

UNIT-V: Illumination Models: Properties of Light – Standard Primaries ad the Chromaticity

Diagram – Intuitive color Concepts – RGB Color Model – YIQ Color Model – CMY Color
Model – HSV Color Model – Conversion between HSV and RGB models – Color selection ad
Applications.

TEXTBOOKS:
1. COMPUTER GRAPHICS – Donald Hearn, M. Pauline Baker, 2nd edition, PHI.
(UNIT-I: 3.1-3.6, 4.1-4.5 & UNIT-II: 5.1-5.4, 6.1-6.11 UNIT-III: 9.1-9.2, 10.1-10.6, 11.1-11.6
UNIT-IV: 13.1-13.13 UNIT-V: 14.1-14.5, 15.1-15.10)

REFERENCE BOOKS:
1. PRINCIPLES OF INTERACTIVE COMPUTER GRAPHICS – Willium M. Newman &
Robert F. Sproull, 2007, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 16 of 36 SCAA Dt. 21.05.2009

Core 7 : MULTIMEDIA & ITS APPLICATIONS

Subject Description : This Subject deals with the Multimedia & its Application
Goal : : To learn about Multimedia
Objective : On Successful Completion of this subject the students should have:
- Media , Sound & Audio , Images , Animation , Video etc.,
UNIT I :
Introduction – Branch Overlapping Aspects of Multimedia Content – Global Structure –
Multimedia Literature . Multimedia – Media and Data Streams – Medium .
UNIT II:
Sound/Audio : Basic Sound Concepts – Music –Speech , Images and Graphics : Basic
Concepts – Computer Image Processing – Video and Animation : Basic Concepts – Television –
Computer Based Animation .
UNIT III:
Data Compression : Storage Space – Coding Requirements – JPEG – MPEG – DVI ,
Optical Storage Media , Computer Technology – Multimedia Operating System.
UNIT IV:
Networking System : Layers , Protocols and Services , Networks , Metropolitan Area
Networks , WAN , Multimedia Communication System.
UNIT V:
User Interfaces, Synchronization , Abstraction for Programming : Abstraction Levels –
Libraries – System Software – Toolkit – Higher Programming Languages . Multimedia
Application : Introduction – Media Population – Media Compos ion – Media Communication –
Trends.

TEXT BOOK :
Ralf Steinmetz & Klara Nahrstedt – “ Multimedia Computing , Communication & Applications “
Pearson Education.

REFERENCE BOOK:
1.Fred T,Hofstetter – “ Multimedia Literacy “ – 3rd edition TMH. 2005
2. Rajan Parekh , “ Principles of Multimedia “ TMH 2007
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 17 of 36 SCAA Dt. 21.05.2009

CORE LAB-4: PROGRAMMING LAB – GRAPHICS USIGN C

1. Program to drawing line using (DDA)

2. Program to draw circle using BRESENHAM’S method
3. Program for TRANSLATION of an object
4. Program for SCALING of an object
5. Program for drawing BAR CHART
6. Program for draying pie chart
7. Program for mirror image of an object
8. Program for rotate an object
9. Program for animation
10. Program for Shear an object
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 18 of 36 SCAA Dt. 21.05.2009

ALLIED PAPER IV

COMMERECE ALLIED PAPER – BUSINESS ACCOUNTING

Credit Hours: 4
Goal: To enable the students to learn principles and concepts of Accountancy.
Objective: On successful completion of this course, the student should have understood
 Concepts and conventions of Accounting.
 Basic Accounting framework

UNIT –I
Fundamentals of Book Keeping – Accounting Concepts and Conventions – Journal –
Ledger – Subsidiary books – Trial balance.

UNIT – II
Final accounts of a sole trader with adjustments – Errors and rectification

UNIT – III
Bill of exchange- Accommodation bills – Average due date – Account current.

UNIT – IV
Accounting for consignments and Joint ventures

UNIT – V
Bank Reconciliation statement – Receipts and Payments and income and expenditure
account and Balance sheet – Accounts of professionals.

Note : Distribution of Marks between problems and theory shall be 80% and 20%.

BOOKS FOR REFERENCE

1. N.Vinayakam, P.L.Mani, K.L.Nagarajan – Principles of Accountancy – S.Chand &
Company Ltd.,
2. T.S.Grewal – Introduction to Accountancy- S.Chand & Company Ltd.,
3. R.L.Gupta, V.K.Gupta, M.C.Shukla – Financial Accounting – Sultanchand & sons
4. T.S.Grewal, S.C.Gupta, S.P.Jain – Advanced Accountancy- Sultanchand & sons
5. K.L.Narang, S.N.Maheswari - Advanced Accountancy-Kalyani publishers
6. S.K.Maheswari, T.S.Reddy - Advanced Accountancy-Vikas publishers
7. A.Murthy -Financial Accounting – Margham Publishers
8. P.C.Tulsian - Advanced Accountancy – Tata McGraw Hill Companies.
9. A.Mukherjee, M.Hanif – Modern Accountancy. Vol.1- Tata McGraw Hill Companies
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 19 of 36 SCAA Dt. 21.05.2009

DIPLOMA PAPER -2 MULTIMEDIA LAB – PHOTOSHOP

PRACRICAL LIST

1. Create Sun Flower using Photoshop.

2. Create Water Drops using Photoshop.
3. Animate Plane Flying the Clouds using Photoshop.
4. Create Plastic Surgery for Nose using Photoshop.
5. Create Mouse using Photoshop.
6. Create See thru text using Photoshop.
7. Create Military Clothe using Photoshop.
8. Create Stone Texture using Photoshop.
9. Create Rollover Buttons using Photoshop.
10. Create Realistic Stone Structure using Photoshop.
11. Create Web Page using Photoshop.
12. Convert Black and White to Color Photo using Photoshop.

REFERENCE BOOKS:
1. PHOTOSHOP CS2 BIBLE – Deke McClelland & Laurie Ulrich Fuller, Wiley India.
2. Comdex MULTIMEDIA AND WEB DESIGN – Vikas Gupta, DreamTech press, 2007.

CORE-8: RDBMS & ORACLE

Subject Description: This subject deals with RDBMS concepts using Oracle SQL and PL/SQL.
Goal: Knowledge on Oracle Programming techniques.
Objective: To inculcate knowledge on RDBMS concepts and Programming with Oracle.
-----
UNIT-I: Database Concepts: A Relational approach: Database – Relationships – DBMS –
Relational Data Model – Integrity Rules – Theoretical Relational Languages. Database Design:
Data Modeling and Normalization: Data Modeling – Dependency – Database Design – Normal
forms – Dependency Diagrams – De -normalization – Another Example of Normalization.

UNIT-II: Oracle9i: Overview: Personal Databases – Client/Server Databases – Oracle9i an

introduction – SQL *Plus Environment – SQL – Logging into SQL *Plus - SQL *Plus
Commands – Errors & Help – Alternate Text Editors - SQL *Plus Worksheet - iSQL *Plus.
Oracle Tables: DDL: Naming Rules and conventions – Data Types – Constraints – Creating
Oracle Table – Displaying Table Information – Altering an Existing Table – Dropping,
Renaming, Truncating Table – Table Types – Spooling – Error codes.

UNIT-III: Working with Table: Data Management and Retrieval: DML – adding a new
Row/Record – Customized Prompts – Updating and Deleting an Existing Rows/Records –
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 20 of 36 SCAA Dt. 21.05.2009

retrieving Data from Table – Arithmetic Operations – restricting Data with WHERE clause –
Sorting – Revisiting Substitution Variables – DEFINE command – CASE structure. Functions
and Grouping: Built-in functions –Grouping Data. Multiple Tables: Joins and Set operations:
Join – Set operations.

UNIT-IV: PL/SQL: A Programming Language: History – Fundamentals – Block Structure –

Comments – Data Types – Other Data Types – Declaration – Assignment operation – Bind
variables – Substitution Variables – Printing – Arithmetic Operators. Control Structures and
Embedded SQL: Control Structures – Nested Blocks – SQ L in PL/SQL – Data Manipulation –
Transaction Control statements. PL/SQL Cursors and Exceptions: Cursors – Implicit & Explicit
Cursors and Attributes – Cursor FOR loops – SELECT…FOR UPDATE – WHERE CURRENT
OF clause – Cursor with Parameters – Cursor Variables – Exceptions – Types of Exceptions.

UNIT-V: PL/SQL Composite Data Types: Records – Tables – arrays. Named Blocks:
Procedures – Functions – Packages –Triggers –Data Dictionary Views.

TEXTBOOKS:
1. DATABASE SYSTEMS USING ORCLE – Nilesh Shah, 2nd edition, PHI.
(UNIT-I: Chapters 1 & 2 UNIT-II: Chapters 3 & 4 UNIT III: Chapters 5 & 6
UNIT-IV: Chapters 10 & 11 UNIT-V: Chapters 12,13 & 14)

REFERENCE BOOKS:
1. DATABASE MANAGEMNET SYSTEMS – Arun Majumdar & Pritimoy Bhattacharya,
2007, TMH.
2. DATABASE MANAGEMETN SYSTEMS – Gerald V. Post, 3rd edition, TMH.

CORE-9 : VISUAL PROGRAMMING -VISUAL BASIC

Subject Description: This subject deals Visual Basic Programming concepts.

Goal: Knowledge on Visual Programming and how to develop a Project.
Objective: To inculcate knowledge on Programming and Project Development using Visual
Basic.

UNIT-I: Introducing Visual Basic: What is VB? – Event and Event Procedures – Object-related
concepts –VB program Development Process – Required Computer Skills – Logical Program
Organization -VB Program Components – VB environment – Opening, Saving, Running a VB
Project – Getting Help – Sample VB project. Visual Basic Fundamentals: Numeric, String
constants – Variables – Data Types and Declarations – Operators and Expressions –Hierarchy of
Operations – Inserting Parentheses – Special Rules concerning Numeric Expressions – String
Expressions - Assigning Values to Variables – Displaying out – Library Functions - Program
Comments. Branching and Looping: Relational operators and Logical Expressions – Branching
with If-Then, If-Then-Else blocks – Selection Select Case – Looping with For-Next, Do-Loop,
While-Wend – Stop statement.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 21 of 36 SCAA Dt. 21.05.2009

UNIT-II: Visual Basic control Fundamentals: Control tools – Control tool Categories – Working
with Controls – Naming Forms and Controls – Assigning Property values to Forms and Controls
– Executing commands – Displaying Output – Entering Input Data – Selecting Multiple
Features, Exclusive Alternatives, Form from a List - Assigning Properties collectively –
Generating Error Messages – Creating timed Events – Scroll Bars.

UNIT-III: Menus and Dialog Boxes: Building Drop-Down Menus – Accessing Menu from
Keyboard – Menu Enhancements – Submenus – Pop-Up Menus – Dialog Boxes – more about
MsgBox Function – The Input Box function. Executing and Debugging a New Project: Syntax
errors – Logical errors – Setting Breakpoints – Defining Watch Values – Stepping Through a
Program – User-induced Errors – Error-handlers – Generating a Stand alone Executable
Program.

UNIT-IV: Procedures: Modules and Procedures – Sub Procedures – Event Procedures – Function
Procedures – Scope – Optional Arguments. Arays: Characteristics – Declarations – Processing –
Passing Arrays to Procedures – Dynamic Arrays – Array-related Functions – Control Arrays –
Looping with for Each-Next.

UNIT-V: Data Files: Characteristics – Accessing and Saving a File in VB: The Common Dialog
Control – Processing a Data file – Sequential Data Files – Random-Access Data files – Binary
files.

TEXTBOOK:
1. VISUAL BASIC – Byron S. Gottfried, Schaum’s Outline series, TMH.
(UNIT-I: Chapters 1, 2 & 3 UNIT II: Chapter 4 UNIT-III: Chapter 5 & 6 UNIT-IV:
Chapters 7 & 8 UNIT V: Chapter 9)
REFERENCE BOOK:
1. The Complete reference VISUAL BASIC – Noel Jerke, TMH.

CORE-10: ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS

Subject Description: This subject deals with various AI Concepts and Methodologies.

Goal: To Acquire Knowledge on various AI Techniques and Expert Systems.

Objective: To have enriched knowledge regarding heuristic search, Knowledge representation

and Expert systems
-----

UNIT I: Introduction: AI Problems – AI techniques – Criteria for success. Problems, Problem

Spaces, Search: State space search – Production Systems – Problem Characteristics – Issues in
design of Search.

UNIT II: Heuristic Search techniques: Generate and Test – Hill Climbing – Best-Fist, Problem
Reduction, Constraint Satisfaction, Means-end analysis.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 22 of 36 SCAA Dt. 21.05.2009

UNIT III: Knowledge representation issues: Representations and mappings – Approaches to

Knowledge representations – Issues in Knowledge representations – Frame Problem.

UNIT IV: Using Predicate Logic: Representing simple facts in logic – Representing Instance
and Isa relationships – Computable functions and predicates – Resolution – Natural deduction.

UNIT V: Representing knowledge using rules: Procedural Vs Declarative knowledge – Logic

programming – Forward Vs Backward reasoning – Matching – Control knowledge
Brief explanation of Expert Systems-Definition- Characteristics-architecture-
Knowledge Engineering- Expert System Life Cycle-Knowledge Acquisition Strategies- Expert
System Tools.

Text Book:
1. Elaine rich and Kelvin Knight, “Artificial Intelligence “, Tata McGrawhill Publication, 2nd
Edition, 1991.(chapters 1- 6 ).

Reference Book :
1. “Artificial Intelligence a modern Approach “– Stuart Russell & Peter Norvig, 2nd Edition
Perason Education.
2. “Artificial Intelligence “, George F Luger , 4th Edition , Pearsons Education Publ, 2002.
3. “Foundations of Artificial Intelligent and Expert Systems”, V S JANAKI RAMAN, K
SARUKESI, P GOPALAKRISHNAN, MacMillan India limited.

CORE LAB-5: PROGRAMMING LAB - VB & ORACLE

PRACTICAL LIST

VISUAL BASIC
1. Write a simple VB program to accept a number as input and convert them into
a. Binary
b. Octal
c. Hexa-decimal

2. Write a simple VB program to add the items to list box with user input and move the
selected item to combo box one by one.

3. Write a simple VB program to develop a calculator with basic operation.

4. Design an form using common dialog control to display the font, save and open dialog
box without using the action control property.

5. Write a simple program to prepare a Questionnaire.

6. Write a VB Program to develop a menu driven program

B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 23 of 36 SCAA Dt. 21.05.2009

Add a MDI window in the form and arrange them in the cascading/horizontal style using
menus (Create a menu to add form, arrange) (Menu Item 1).
Also change the form color using the menu in another menu item (Menu Item 2).

ORACLE
Data Definition Basics
7. Create the following table (PK - Primary Key, FK – Foreign Key) cat_head, route_head,
place_head, route_detail, ticket_detail, ticket_head with the mapping given below:
cat_head route_head
(cat_code PK) (cat_code FK)
route_head route_detail
(route_id PK) (route_id FK)
ticket_head ticket_detail
(tick_no PK) (tick_no FK)
place_head route_detail
(place_id PK) (place_id FK)

(i) Alter the table ticket_header to add a check constraint on ticket_no to accept values
between 1 and 500
(ii) Alter table route_header to add a column with data type as long.

Data Manipulation Basics

8. (a) Insert values to above tables
(b) Display only those routes that originate in madras and terminate at cochin
(c) Display only distinct category code from the table route_header in descending
manner.
(d) Update the table route_header to set the distance between madras and coimbatore as
500

Queries
9. a. Select rows from ticket_details such that ticket number greater than any ticket_number in
Ticket_header.
B. Select rows from route_header such that the route_id are greater than all route_id in
route_detail
Where place id is “100”.
C. Create view tick from ticket_header with Ticket_no, Origin, Destination, route_id

Report
10. Generate a report from the table ticket_detail for the particular ticket_no

PL/SQL
11.
a. Write a PL/SQL block to update the bus_station to be “ERODE” where place_id is
’01’ or ‘05’ [place_header]
b. Write a PL/SQL block to satisfy the following condition by accepting the route_id as
user input. If the distance is less than 500 than update the fare to be 200
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 24 of 36 SCAA Dt. 21.05.2009

c. Write a Database trigter before insert for each row on the table route_detail not
allowing transaction on Saturday / Sunday
d. Write a Database trigger before delete for each row not allowing deletion and give
the appropriate message on the table route_details

PROJECT
12. Develop a Simple Project for Student Database Management System using VB as front
end and ORACLE as back end.

DIPLOMA PAPER -3: ANIMATION TECHNIQUES

Subject Description: This Subject deals with the Animation Techniques.

Goal: To learn about Animation.
Objective: On Successful Completion of this subject the students should have:
- 2D & 3D Animation, Script Animation, Motion Caption, Audio & Video Format
etc.

UNIT-I: What is mean by Animation – Why we need Animation – Types of Animation 2D &
3D – Theory of 2D Animation – Theory of 3D Animation – Difference between Graphics &
Animation – Application of 2D & 3D Animation – History of Animation – Software’s.

UNIT-II: Traditional 2D Animation Concept – Types of 2D Animation – Techniques of 2D

Animation – Color – Text – Formation – Size – Script Animation – Time Line Effects –
Application of 2D Animation – Characterization 2D – Principle of 2D Animation – Concept
Development.

UNIT-III: 3D Animation & its Concepts – Types of 3D Animation – Cycle & Non-Cycle
Animation – Theory of Character 3D Animation – 3D Transition Animation – Skeleton &
Kinetic 3D Animation – Texturing & Lighting of 3D Animation – 3D Camera Tracking –
Applications & Software of 3D Animation.

UNIT-IV: Motion Caption – Formats – Methods – Usages – Motion Capture Software – Merge
with Software – Expression – Formats – Methods – Usages – Expression Capture Softwares –
Script Animation Usage – Different Language of Script Animation Among the Software.

UNIT-V: Concept Development – Scripting – Story Developing – Output Formats – Audio

Formats & Video Formats – Colors – Color Cycle – Color Formats – 3D Production Budgets –
3D Animated Movies – Fields in 3D Animation.

TEXT BOOK:
1. MAYA 6.0 BIBLE - Joestadaro, Donkim.
2. 3DS MAX BIBLE - Kelly Ldot, Murtock.
REFERENCE BOOK:
1. MAYA 8.0 THE COMPLETE REFERENCE - Tom Meade, Shinsaku Arima, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 25 of 36 SCAA Dt. 21.05.2009

CORE-11 COMPUER NETWORKS

Subject Description: This subject deals different Network concepts like Layers, Wireless
Concepts, Transmission and Security.

Goal: Knowledge on Computer Networks and technologies like broadband and Bluetooth.

Objective: To inculcate knowledge on Networking concepts and technologies like wireless,

broadband and Bluetooth.

UNIT-I: Network Hardware: LAN – WAN – MAN – Wireless – Home Networks. Network
Software: Protocol Hierarchies – Design Issues for the Layers – Connection-oriented and
connectionless services – Service Primitives – The Relationship of services to Protocols.
Reference Models: OSI Reference Model – TCP/IP reference Model – Comparison of OSI and
TCP/IP -Critique of OSI and protocols – Critique of the TCP/IP Reference model.

UNIT-II: PHYSICAL LAYER - Guided Transmission Media: Magnetic Media – Twisted Pair –
Coaxial Cable – Fiber Optics. Wireless Transmission: Electromagnetic Spectrum – Radio
Transmission – Microwave Transmission – Infrared and Millimeter Waves – Light Waves.
Communication Satellites: Geostationary, Medium-Earth Orbit, Low Earth-orbit Satellites –
Satellites versus Fiber.

UNIT-III: DATA-LINK LAYER: Error Detection and correction – Elementary Data-link

Protocols – Sliding Window Protocols. MEDIUM-ACCESS CONTROL SUB LAYER: Multiple
Access Protocols – Ethernet – Wireless LANs - Broadband Wireless – Bluetooth.

UNIT-IV: NETWORK LAYER: Routing algorithms – Congestion Control Algorithms.

TRANSPORT LAYER: Elements of Transport Protocols – Internet Transport Protocols: TCP.

UNIT-V: APPLICATION LAYER: DNS – E-mail. NETWORK SECURITY: Cryptography –

Symmetric Key Algorithms – Public Key Algorithms – Digital Signatures.

TEXTBOOKS:
1. COMPUTER NETWORKS – Andrew S. Tanenbaum, 4th edition, PHI.
(UNIT-I:1.2-1.4 UNIT-II:2.2-2.4 UNIT-III:4.2-4.6 UNIT-IV:5.2,5.3,6.2,6.5 UNIT-V:7.1,7.2,8.1-
8.4)

REFERENCE BOOKS:
1. DATA COMMUNICATION AND NETWORKS – Achyut Godbole, 2007, TMH.
2. COMPUTER NETWORKS Protocols, Standards, and Interfaces – Uyless Black, 2nd ed, PHI
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 26 of 36 SCAA Dt. 21.05.2009

CORE-12 : JAVA PROGRAMMING

Subject Description: This subject deals with Java Programming concepts.

Goal: Enable to create wide range of Applications and Applets using Java.

Objective: To inculcate knowledge on Java Programming concepts.

-----

UNIT-I: Fundamentals of Object-Oriented Programming: Object-Oriented Paradigm – Basic

Concepts of Object-Oriented Programming – Benefits of Object-Oriented Programming –
Application of Object-Oriented Programming. Java Evolution: History – Features – How Java
differs from C and C++ – Java and Internet – Java and www –Web Browsers. Overview of Java:
simple Java program – Structure – Java Tokens – Statements – Java Virtual Machine.

UNIT-II: Constants, Variables, Data Types - Operators and Expressions – Decision Making and
Branching: if, if ..else, nested if, switch, ? : Operator - Decision Making and Looping: while, do,
for – Jumps in Loops - Labeled Loops – Classes, Objects and Methods.

UNIT-III: Arrays, Strings and Vectors – Interfaces: Multiple Inheritance – Packages: Putting
Classes together – Multithreaded Programming.

UNIT-IV: Managing Errors and Exceptions – Applet Programming – Graphics Programming.

UNIT-V: Managing Input / Output Files in Java : Concepts of Streams- Stream Classes – Byte
Stream classes – Character stream classes – Using streams – I/O Classes – File Class – I/O
exceptions – Creation of files – Reading / Writing characters, Byte-Handling Primitive data
Types – Random Access Files.

TEXTBOOKS:
1. PROGRAMMING WITH JAVA – A PRIMER - E. Balagurusamy, 3 rd Edition, TMH.

REFERENCE BOOKS:
1. THE COMPLETE REFERENCE JAVA 2 - Patrick Naughton & Hebert Schildt, 3rd ed,TMH
2. PROGRAMMING WITH JAVA – John R. Hubbard, 2nd Edition, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 27 of 36 SCAA Dt. 21.05.2009

CORE LAB-6 : PROGRAMMING LAB - JAVA

1. Write a Java Applications to extract a portion of a character string and print the extracted
string.
2. Write a Java Program to implement the concept of multiple inheritance using Interfaces.
3. Write a Java Program to create an Exception called payout-of-bounds and throw the
exception.
4. Write a Java Program to implement the concept of multithreading with the use of any
three multiplication tables and assign three different priorities to them.
5. Write a Java Program to draw several shapes in the created windows.
6. Write a Java Program to create a frame with four text fields name, street, city and pin
code with suitable tables. Also add a button called “my details”, When the button is
clicked its corresponding values are to be appeared in the text fields.
7. Write a Java Program to demonstrate the Multiple Selection List-box.
8. Write a Java Program to create a frame with three text fields for name, age and
qualification and a text field for multiple line for address
9. Write a Java Program to create Menu Bars and pull down menus.
10. Write a Java Program to create frames which respond to the mouse clicks. For each
events with mouse such as mouse up, mouse down, etc., the corresponding message to be
displayed.
11. Write a Java Program to draw circle, square, ellipse and rectangle at the mouse click
positions.
12. Write a Java Program which open an existing file and append text to that file.

DIPLOMA PAPER – 4 : ANIMATION LAB - FLASH

PRACTICAL LIST
1. Create Shapes and Drawings in Flash.
2. Change a Shape to Another Shape. (Shape Animation)
3. Create a Man to walk with the help of Key Frame Animation.
4. Draw a Bird with Flash tools and make it fly with key Frame Animation.
5. Change the Colors of an object with the help of Animation.
6. Animate a Ball with the help of Guide line Animation.(Path Animation)
7. Create a Shining Stores with the help of Movie Clip.
8. Create Buttons & Link with other Frames.
9. Create an Album with the help of Buttons.
10. Create a 3D Rotation of a Box with the Help of Shape Animation.
11. Create Morphing between two images in Flash.
12. Create a Simple game with the help of Action Script.

REFERENCE BOOKS:
1. Flash 8 in Simple Steps – Shalini Guptha & Adity Gupta, 2007, dreamtech.
2. Flash 8 – Ethan Waterall & Norbert Herber, dreamtech.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 28 of 36 SCAA Dt. 21.05.2009

Elective I – A : CLIENT/SERVER COMPUTING

Subject Description: This subject deals with concepts of Client / Server computing. Also it
deals with various components of Client / Server Applications.

Goal: Knowledge on Client / Server Concepts and various components of client / server
Applications.

Objective: To inculcate knowledge on Client / Server concepts.

-----

UNIT-I: Client / Server Computing – Advantages of Client / Server Computing – Technology

Revolution – Connectivity – Ways to improve Performance – How to reduce network Traffic.

UNIT-II: Components of Client / Server Applications – The Client: Role of a Client – Client
Services – Request for Service. Components of Client / Server Applications – The Server: The
Role of a Server – Server Functionality in Detail – The Network Operating System – What are
the Available Platforms – The Server Operating system.

UNIT-III: Components of Client / Server Applications – Connectivity: Open System

Interconnect – Communications Interface Technology – Inter-process communication – WAN
Technologies.

UNIT-IV: Components of Client / Server Applications – Software. Components of Client /

Server Applications – Hardware.

UNIT-V: Components of Client / Server applications – Service and Support: System

Administration. The Future of Client / Server Computing: Enabling Technologies –
Transformational Systems.

TEXTBOOKS:
1. CLIENT / SERVER COMPUTING – Patrick Smith, Steve guenferich , 2nd edition, PHI.
(Chapters 1-8 & 10)

Reference Book :
1.”Robert Orfali, Dan Harkey, Jeri edwards: the essential client/server survival guide”, II edition
galgotia publication private limited.
2.”Dewire and Dawana Travis “Client/ Server Computing “, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 29 of 36 SCAA Dt. 21.05.2009

Elective I – B : E-COMMERCE

Subject Description: This subject deals with E-commerce concepts like E-Commerce, M-
Commerce, E-Security and E-payment.

Goal: Knowledge on E-commerce and Real World and Cyberspace problem awareness.

Objective: To inculcate knowledge on E-Commerce concepts in the present IT world.

-----

UNIT-I: What is e-commerce? – E-Commerce is not E-Business – the drivers – Myths You
should know – Advantages and Issues in E-Commerce – Benefits and Limitations of the Internet
– Role of E-Strategy – Integrating E-commerce – E-Commerce Business Models – Management
Implications.

UNIT-II: Mobile-Commerce-The Business of Time: What is M-Commerce? – Why wireless?

– How wireless Technology is employed? – Wireless LAN – Wireless application Protocol -
Implications for Management.

UNIT-III: Business-to-Business E-Commerce: What is B2B E-Commerce? – Supply chain

Management and B2B – B2B Models – B2B Tools-EDI.

UNIT-IV: E-Security: Security in Cyberspace – Designing for Security – How much risk you
afford? – The VIRUS – Security Protection and Recovery – Role of Biometrics - How to secure
your system? – Security and Terrorism.

UNIT-V: Getting the money: Real World Cash – Electronic Money – Requirements for
Internet-Based Payments – How would you like to pay? – B2B and E-Payment – M-Commerce
and M-Payment – General Guide to E-Payment.

TEXTBOOK:
1. ELECTRONIC COMMERCE from Vision to Fulfillment – Elias M. Awad, 3rd edition,
PHI.
(Chapters: 1, 6, 11, 13 &15)

REFERENCE BOOKS:
1. E-COMMERCE Strategy, Technologies and Applications – David Whiteley, 2001, TMH.
1. 2. INTRODUCTION TO E-COMMERCE – Jeffrey F. Rayport, Bernard J.
Jaworski, TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 30 of 36 SCAA Dt. 21.05.2009

ELECTIVE I – C : SOFTWARE ENGINEERING

Subject Description: This subject deals with Software Engineering concepts like Analysis,
Design, Implementation, Testing and Maintenance.

Goal: Knowledge on how to do a software project with in-depth analysis.

Objective: To inculcate knowledge on Software engineering concepts in turn gives a roadmap to

design a new software project.
-----

UNIT-I: Introduction to Software Engineering: Definitions – Size Factors – Quality and

Productivity Factors. Planning a Software Project: Planning the Development Process –
Planning an Organizational Structure.

UNIT-II: Software Cost Estimation: Software cost Factors – Software Cost Estimation
Techniques – Staffing-Level Estimation – Estimating Software Estimation Costs.

UNIT-III: Software Requirements Definition: The Software Requirements specification –

Formal Specification Techniques. Software Design: Fundamental Design Concepts – Modules
and Modularization Criteria.

UNIT-IV: Design Notations – Design Techniques. Implementation Issues: Structured Coding

Techniques – Coding Style – Standards and Guidelines – Documentation Guidelines.

UNIT-V: Verification and Validation Techniques: Quality Assurance – Walkthroughs and

Inspections – Unit Testing and Debugging – System Testing. Software Maintenance:
Enhancing Maintainability during Development – Managerial Aspects of Software Maintenance
– Configuration Management.

TEXTBOOK:
1. SOFTWARE ENGINEERING CONCEPTS – Richard Fairley, 1997, TMH.
(UNIT-I: 1.1-1.3, 2.3-2.4 UNIT-II: 3.1-3.4 UNIT III: 4.1-4.2, 5.1-5.2
UNIT-IV: 5.3-5.4, 6.1-6.4 UNIT-V: 8.1-8.2, 8.5-8.6, 9.1-9.3)

REFERENCE BOOKS:
1. SOFTWARE ENGINEERING FOR INTERNET APPLICATIONS – Eve Anderson,
Philip Greenspun, Andrew Grumet, 2006, PHI.
2. SOFTWARE ENGINEERING PROJECT MANAGEMENT – 2nd Edition, Wiley India.
3. SOFTWARE QUALITY ENGINEERING – Jeff Tian, Student edition, 2006, Wiley India.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 31 of 36 SCAA Dt. 21.05.2009

Elective II – A : NETWORK SECURITY & CRYPTOGRAPHY

Subject Description: deals with principles of encryption algorithms, and conventional

and public key cryptography.
Goal: enable to know the levels of network security and security tools.
Objective: to impart knowledge regarding cryptography and network security.

UNIT-I:
Service mechanism and attacks – The OSI security architecture – A model for network
security – symmetric Cipher model – Substitution techniques – transposition techniques –
simplified des – block chipper principles – the strength of des – block chipper design
principles and modes of operation.

UNIT-II:
Triple des-blow fish – RCS Advanced Symmetric Block Ciphers –RC4 stream Cipher
confidentially using symmetric encryption – introduction to number theory – public – key
cryptography and RSA.

UNIT-III:
Key management – Diffle Hellman key exchange – message authentication and hash
function – hash algorithm – digital signature and authentication protocols – digital
signature standard.

UNIT-IV:
Authentication application – pretty good privacy – S/MIME – ip security – web security
considerations –secure socket layer transport layer security –secure electronic transaction.

UNIT-V
Intruders –intrusion detection – password management –viruses and related threats –
virus countermeasures – fire wall design principles – trusted systems

TEXTBOOK:
William Stallings, “Cryptography and Network Security Principles and Practices”.
Fourth edition, phi Education Asia.

REFERENCE BOOKS:
1) Atul kahate “Cryptography and Network Security” second edition. TMH.
2) Behrouz A.forouzan” Cryptography and Network Security “ TMH.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 32 of 36 SCAA Dt. 21.05.2009

ELECTIVE II - B - DISTRIBUTED COMPUTING

Subject Description
This Course presents the Data Distribution through the Network.

Goals
To enable the students to learn about decentralization of data to acquire reliability and
availability of data.

Objective
On successful completion of the course the students should have:
• Understood what is the need of data distribution and how it can be done.

Contents

Unit I
Distributed Systems : Fully Distributed processing Systems, Networks and
Interconnection Structures, Designing a Distributed System.

Unit II
Distributed Systems : Pros and Cons of Distributed processing, Distributed Databases,
the challenge of Distributed Data, Loading Factors, Managing The Distributed Resources,
Division of responsibilities.

Unit III
Design Considerations : Communications Line Loading, Line Loading Calculations,
Partitioning and Allocation, Data Flow Systems, Dimension Analysis, Network Database Design
Considerations, Ratio Analysis, Database Design Decision Trees, Synchronization of Network
Databases.

Unit IV
Client-Server Network Model : Concept – File Server – Printer Server – An e-mail
server.
Unit V
Distributed Databases : An Overview - Distributed Databases – Principles of distributed
databases – levels of transparency – Distributed Database Design – The R* Project Technique
Problems of Heterogeneous Distributed Databases.

RERERENCE BOOKS:
1. John A. Sharp,”An Introduction to Distributed & Parallel Processing”,Blackwell
Scientific Publications,1987.(Unit I)
2. Uyless D.Black,”Data Communications & Distributed Networks”.(Unit II & III)
3. Joel M.Crichlow,””An Introduction to Distributed & Parallel Computing”.(Unit IV)
1. Stefans Ceri,Ginseppe Pelagatti,”Distributed Databases Principles and Systems”,McGraw
Hill Book Co.,New York,1985.(Unit V)
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 33 of 36 SCAA Dt. 21.05.2009

Elective II – C : DATA MINING

Subject Description: This subject deals with various Data Mining Techniques.
Goal: Enables to have sound knowledge on data mining Techniques..
Objective: To inculcate knowledge on Data mining Concepts.

UNIT-I: Introduction: Nature of Data Sets – Models and Patterns – Data mining Tasks –
Components of Data mining Algorithms – The interacting roles of Statistics and Data mining –
Dredging, Snooping and Fishing. Measurement of Data: Types of measurement - Distance
Measures – Transforming Data – The form of Data – Data Quality for individual measurements
– Data Quality for Collections of data.

UNIT-II: Visualizing and Exploring Data: Summarizing Data –Tools for Displaying single
variables – Tools for displaying relationships between two variables - Tools for displaying
relationships more than two variables – Principal Components analysis – Multi-dimensional
scaling. Data Analysis and Uncertainty: Dealing with Uncertainty – Random Variables and their
relationships – Samples and statistical inference – Estimation – Hypothesis Testing – sampling
Methods.

UNIT-III: A Symmetric Overview of Data Mining Algorithms: CART algorithm for Building
Tree Classifiers – The Reductionist Viewpoint on Data mining algorithms. Score Functions for
Data Mining Algorithms: Scoring Patterns – Predictive versus Descriptive Scoring Functions –
Scoring models with Different Complexities – Evaluation of Models and Patterns – Robust
Methods.

UNIT-IV: Search and Optimization Methods: Searching for models and Patterns – Parameter
Optimization Methods – Optimization with missing data: EM algorithm – Online and Single
Scan algorithms – Stochastic Search and optimizing Techniques. Data Organization and
Databases: Memory hierarchy – Index Structures – Multi-dimensional Indexing – Relational
Databases – Manipulating Tables – SQL – Query Execution and Optimization – Data
warehousing and On-Line Analytical Processing (OLAP) – Data structures for OLAP – String
Databases – Massive Data Sets, Data Management, and Data mining.

UNIT-V: Rule Representations – Frequent Itemsets and Association Rules – Generalizations –

Finding Episodes from Sequences – Selective Discovery of Patterns and Rules – From Local
Patterns to Global Models – Predictive Rule Induction. Retrieval by Content: Introduction –
Evaluation of Retrieval Systems - Text Retrieval – Modeling Individual Preferences. Image
Retrieval – Time Series and Sequential Retrieval.

TEXTBOOK:
1. Principles of DATA MINING – David Hand, Heikki Mannila & Padhraic Smyth – PHI.

REFERENCE BOOK:
1. DATA WAREHOUSING Concepts, Techniques, Products and Applications – C.S.R.Prabhu,
PHI.
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 34 of 36 SCAA Dt. 21.05.2009

Elective III – A : MOBILE COMPUTING

UNIT I :
Introduction: Mobility of Bits and Bytes –Wireless The Beginning – Mobile Computing –
Dialogue Control – Networks – Middleware and Gateways – Application and services-
Developing Mobile computer Applications – security in mobile computing – Standards _ Why is
it necessary – Standard bodies. MOBILE COMPUTTING ARCHITECTURE: History of
computers and Internet – Architecture for mobile computing – Three-tier architecture – Design
considerations for mobile computing – Mobile computing through Internet – Making exiting
applications mobile enabled.

UNIT II :
MOBILE COMPUTING THROUGH TELEPHONY: Evaluation of telephony – Multiple
access procedures – Mobile computing through telephone – IVR Application – Voice XML –
TAPI.

UNIT III :
EMERGING TECHNOLOGIES: Blue Tooth – RFID – WiMAX – Mobile IP – IPv6 –
Java Card. GSM : Global System for mobile communications – GSM Architecture – GSM
Entities – Call routing in GSM – PLMN Interfaces – GSM Addresses and Identifiers – Network
Aspects in GSM – GSM Frequency allocations – Authentications and Security - SMS.

UNIT IV :
GPRS – GPRS and packet data network – GPRS network architecture – GPRS network
operations – Data services in GPRS – Application for GPRS- Limitations – Billing and
Charging. WAP : MMS – GPRS Applications.

UNIT V :
CDMA and 3G: Spread spectrum technology – Is 95 – CDMA vs GSM – Wireless Data –
Third generation networks – Applications on 3G WIRELESS LAN: Wireless LAN advantages –
IEEE 802.11 standards – Architecture – Mobile in Wireless LAN – Deploying wireless LAN –
Mobile adhoc networks and sensor networks – Wireless LAN Security – WiFi vs 3G .

Text Book:

1. MOBILE COMPUTING, Asoke K Talukder , Roopa R Yavagal, TMH, 2005

B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 35 of 36 SCAA Dt. 21.05.2009

ELECTIVE III – B : WEB TECHNOLOGY

Subject Description : This Subject deals with the Web Technology.

Goal : To learn about web technologies
Objective: On Successful Completion of this subject the students should have :
- TCP/IP to Internet application architectures , EDI etc.,

UNIT I :
Internetworking Concepts , Devices , Basics , History and Architecture – TCP/IP – The
Concept of IP Address – Address Resolution Protocol (ARP) – Reverse Address Resolution
Protocol ( RARP) – Internet Control Message Protocol (ICMP).

UNIT II :
Domain Name System (DNS) – Electronic Mail (EMAIL) – File Transfer Protocol (FTP)
– Trivial File Transfer Protocol (TFTP) – A Brief History of WWW – Hypertext Markup
Language (HTML) – TELNET Remote Login – Web Browser – An Introduction to Electronic
Commerce.

UNIT III:
Introduction to Web Technology – Dynamic Web Pages – Active Web Pages – User
Sessions in E-Commerce Applications.

UNIT IV:
Electronic Commerce Transaction Management – Electronic Commerce Security Issues –
Online Security and Payment Processing Mechanisms .

UNIT V:
Electronic Data Interchange (EDI) – Extensible Markup Language (XML) – Wireless
Application Protocol – Appendix : Online Shipping With ASP – Appendix: An Overview of
Emerging Technologies.

TEXT BOOK :
Achyut S Godbole , Atul Kahate – “ Web Technologies TCP/IP to Internet Application
Architecture .” – Tata McGrawhill .
B.Sc.Comp Sci & Appln (Colleges) 2009-10 Annexure No. 28 G
Page 36 of 36 SCAA Dt. 21.05.2009

ELECTIVE III-C : SOFTWARE TESTING

Subject Description: This subject deals software testing concepts like unit-wise testing,
integration testing and acceptance testing.

Goal: Knowledge on software testing and how to test the software at various levels.

Objective: To inculcate knowledge on Software testing concepts.

-----

UNIT-I: Software Development Life Cycle models: Phases of Software project – Quality,
Quality Assurance, Quality control – Testing, Verification and Validation – Process Model to
represent Different Phases - Life Cycle models. White-Box Testing: Static Testing – Structural
Testing –Challenges in White-Box Testing.

UNIT-II: Black-Box Testing: What is Black-Box Testing? - Why Black-Box Testing? – When
to do Black-Box Testing? – How to do Black-Box Testing? – Challenges in White Box Testing -
Integration Testing: Integration Testing as Type of Testing – Integration Testing as a Phase f
Testing – Scenario Testing – Defect Bash.

UNIT-III: System and Acceptance Testing: system Testing Overview – Why System testing is
done? – Functional versus Non-functional Testing - Functional testing - Non-functional Testing
– Acceptance Testing – Summary of Testing Phases.

UNIT-IV: Performance Testing: Factors governing Performance Testing – Methodology of

Performance Testing – tools for Performance Testing – Process for Performance Testing –
Challenges. Regression Testing: What is Regression Testing? – Types of Regression Testing –
When to do Regression Testing – How to do Regression Testing – Best Practices in Regression
Testing.

UNIT-V: Test Planning, Management, Execution and Reporting: Test Planning – Test
Management – Test Process – Test Reporting –Best Practices. Test Metrics and
Measurements: Project Metrics – Progress Metrics – Productivity Metrics – Release Metrics.

TEXTBOOKS:
1. SOFTWARE TESTING Principles and Practices – Srinivasan Desikan & Gopalswamy
Ramesh, 2006, Pearson Education.
(UNIT-I: 2.1-2.5, 3.1-3.4 UNIT-II: 4.1-4.4, 5.1-5.5 UNIT III: 6 .1-6.7
(UNIT IV: 7.1-7.6, 8.1-8.5 UNIT-V: 15.1-15.6, 17.4-17.7)

REFERENCE BOOKS:
1. EFFECTIVE METHODS OF SOFTWARE TESTING–William E.Perry, 3rd ed, Wiley
India.
2. SOFTWARE TESTING – Renu Rajani, Pradeep Oak, 2007, TMH.