Scheme of Examination and Syllabus for BCA 3rd Semester

(w.e.f. 2022-2023)
SEMESTER-III
Paper Code Paper Name Type of Credits Contact Marks
Course (Theory/ Hours (External
Practical) (Theory/ +
Practical) Internal)
22BCA301 Data Structures Core 4 4 80+20=100
22BCA302 Database Management System Core 4 4 80+20=100
22BCA303 Data Communication and Networking Core 4 4 80+20=100
22BCA304 Practical Lab based on 22BCA301
Core 4 8 80+20=100
and 22BCA302

22BCA301
Data Structures

Course Objectives: This course will familiarize students with the basic concepts of data structures and algorithms,
searching and sorting techniques, concepts about stacks, queues, lists, trees and graphs. This will enable them to write
algorithms for solving problems with the help of fundamental data structures.

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short answer
type questions covering the entire syllabus. Two questions will be asked from each unit. Students will have to
attempt one question from each unit. Each question shall carry equal marks.

UNIT-I
Data Structures: Definition and its types, Abstract Data Types, Review of strings: String representation and
manipulation, Static and dynamic memory storage, Arrays, matrices, sparse matrices, multi-dimensional arrays,
operations on arrays.
Linked Lists: List Types (singly, doubly, singly circular, header, doubly circular), Operations on Lists – create, insert,
delete, search, Applications of linked list

UNIT-II
Stacks: Definition, Array implementation of stacks, Linked implementation of stacks, Applications of Stacks: Infix,
Postfix and prefix expression, conversions and evaluation of expressions.
Queues: Definition, Array implementation of queues, Linked implementation of queues, Circular queues, Priority
queues, Double-ended queues

UNIT-III
Trees: Binary Trees and their properties, Linked and static Representation of binary trees, Complete Binary Tree,
Threaded Binary tree, Different tree traversal algorithms, Binary Search Tree (create, delete, search, insert, display)
and its complexity analysis, AVL Trees, Balanced multi-way search trees.

17 | P a g e
 UNIT-IV
Graphs: Definition, Array and linked representation of graphs, Graph Traversal (BFS and DFS), Adjacency matrix
and adjacency lists, path matrix, Finding Shortest Path - Warshall's Algorithm.

Searching and Sorting: Linear search, Binary search, Insertion sort, selection sort, Bubble sort, Merge sort, Quick
Sort, Heap Sort; Hashing, Hash table, Hash functions.

Course Outcomes: After completion of course, students would be able analyze the algorithms to determine the time
and computation complexity and justify the correctness. They will be able to write an algorithm Selection Sort, Bubble
Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort and compare their performance in term of Space and Time
complexity and implement Graph search and traversal algorithms and determine the time and computation complexity.

Suggested Reading:
1. Horowitz, E., Sahni, S., 1982. Fundamentals of Data Structures: Illustrated Edition, Computer Science Press.
2. Lipschutz, S., 2017. Schaum’s outline series: Data Structure, TMH.
3. Tenenbaum, Langsam, Augenstein, 2015. Data Structures using C, Pearson Education.
4. BalaGuruswamy, E. 2017. Data Structures Using C, TMH.

18 | P a g e
22BCA302
Database Management System

Course Objectives: This course will familiarize students with essential DBMS concepts such as: database security,
integrity, concurrency, distributed database, and intelligent database, Client/Server (Database Server), Data
Warehousing. This will help them to design and build a simple database system and demonstrate competence with the
fundamental tasks involved with modelling, designing, and implementing a DBMS.

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short answer
type questions covering the entire syllabus. Two questions will be asked from each unit. Students will have to
attempt one question from each unit. Each question shall carry equal marks.
UNIT-I
Basic Concepts – Data, Information, Records and files. Traditional file –based Systems-File Based Approach-
Limitations of File Based Approach, Database Approach-Characteristics of Database Approach, advantages and
disadvantages of database system, components of database system, Database Management System (DBMS),
Components of DBMS Environment, DBMS Functions and Components, DBMS users, Advantages and
Disadvantages of DBMS, DBMS languages. Roles in the Database Environment - Data and Database Administrator,
Database Designers, Applications Developers and Users.
UNIT-II
Database System Architecture – Three Levels of Architecture, External, Conceptual and Internal Levels, Schemas,
Mappings and Instances. Data Independence – Logical and Physical Data Independence. Classification of Database
Management System, Centralized and Client Server architecture to DBMS. Data Models: Records- based Data
Models, Object-based Data Models, Physical Data Models and Conceptual Modeling.
UNIT-III
Entity-Relationship Model – Entity Types, Entity Sets, Attributes Relationship Types, Relationship Instances and ER
Diagrams, abstraction and integration. Basic Concepts of Hierarchical and Network Data Model, Relational Data
Model: -Brief History, Relational Model Terminology-Relational Data Structure, Database Relations, Properties of
Relations, Keys, Domains, Integrity Constraints over Relations.
UNIT-IV
Relational algebra, Relational calculus, Relational database design: Functional dependencies, Modification anomalies,
Ist to 3rd NFs, BCNF, 4th and 5th NFs, computing closures of set FDs, SQL: Data types, Basic Queries in SQL, Insert,
Delete and Update Statements, Views, Query processing: General strategies of query processing, query optimization,
query processor, concept of security, concurrency and recovery.
Course Outcomes: After completion of course, students would be able to understand that how to write relational
algebra expressions for a given query and optimize the developed expressions. They will also understand requirement
design the databases using E‐R method and normalization.
Suggested Readings:
1. Elmasri, R., Navathe, S.B. 2007. Fundamentals of Database Systems, 5th edition, Pearson Education.
2. Connolly, T., Begg, C., 2019. Database Systems, 3rd Edition, Pearson Education
3. Date, C.J., 2003. An Introduction to Database Systems, 8th edition, Addison Wesley N. Delhi.

19 | P a g e
22BCA303
Data Communication and Networking

Course Objectives: This course will familiarize students about basic concepts related to Data Communication with
the issues and challenges of designing of protocols while delving into TCP/IP protocol suite. The students will also
study various types of modes and channels for communications.

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short answer
type questions covering the entire syllabus. Two questions will be asked from each unit. Students will have to
attempt one question from each unit. Each question shall carry equal marks.
UNIT-I
Introduction to Computer Communications and Networking Technologies; Uses of Computer Networks; Network
Devices, Nodes, and Hosts; Types of Computer Networks and their Topologies; Network Software: Network Design
issues and Protocols; Connection-Oriented and Connectionless Services; Network Applications and Application
Protocols; Computer Communications, OSI Reference Model, TCP/IP reference model.
UNIT-II
Analog and Digital Communications Concepts: Concept of data, signal, channel, bid-rate. maximum data-rate of
channel, Representing Data as Analog Signals, Representing Data as Digital Signals, Data Rate and Bandwidth,
Capacity, Baud Rate; Asynchronous and synchronous transmission, data encoding techniques, Modulation techniques,
Digital Carrier Systems; Guided and Wireless Transmission Media; Communication Satellites; Switching and
Multiplexing.
UNIT-III
Data Link Layer: Framing, Flow Control, Error Control; Error Detection and Correction; Sliding Window Protocols;
Media Access Control: Random Access Protocols, Token Passing Protocols; Token Ring, FDDI, Wireless LANs;
Bluetooth; Network Hardware Components: Connectors, Transceivers, Repeaters, Hubs, Network Interface Cards and
PC Cards, Bridges, Switches, Routers, Gateways.
UNIT-IV
Network Layer and Routing Concepts: Virtual Circuits and Datagrams; Routing Algorithms: Flooding, Shortest Path
Routing, Distance Vector Routing; Link State Routing, Hierarchical Routing; Congestion Control Algorithms;
Internetworking; Network Security Issues: Security threats; Encryption Methods; Authentication; Symmetric-Key
Algorithms; Public-Key Algorithms.
Course Outcomes: At the end of the course, student will be familiar with the basic Networking Protocols, some
Communication Techniques, detailed understanding of various Layers in OSI and TCP/IP reference models.
Suggested Readings:
1. Gallo, M.A., 2007. Computer Communications and Networking Technologies, Cengage Learning.
2. Tanenbaum, A.S., 2010. Computer Networks, Pearson Education.
3. Forouzan, B.A., 2017. Data Communications and Networking, McGraw Hill.

20 | P a g e
22BCA304
Practical Lab based on Data Structures (22BCA301) and Database Management System
(22BCA302)

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: - Every student will maintain practical record of programs done during practical lab in a file. Examination will
be conducted through a question paper set jointly by the external and internal examiners. The question paper will
consist of questions based on the list of practicals. An examinee will be asked to write the programs and run on
computer. Evaluation will be made on the basis of the examinee’s performance in written solutions and presentation
with viva-voce and practical record.

Practical Examination will be conducted externally as per the following distribution of marks:
Writing solutions of problems and
executing on the Computer: 50 marks.
Presentation &Viva voce: 20 marks.
Practical record: 10 marks.
Internal Assessment: 20 marks (Attendance=10 marks, Assignment=10 marks)

21 | P a g e
 Scheme of Examination and Syllabus for BCA 4th Semester
(w.e.f. 2022-2023)
SEMESTER-IV
Paper Code Paper Name Type of Credits Contact Marks
Course (Theory/ Hours (External
Practical) (Theory/ +
Practical) Internal)
22BCA401 Introduction to Web Designing Core 4 4 80+20=100
22BCA402 Software Engineering Core 4 4 80+20=100
22BCA403 Artificial Intelligence Core 4 4 80+20=100
22BCA404 Practical Lab based on 22BCA401 Core 4 8 80+20=100

22BCA401
Introduction to Web Designing

Course Objectives: The objectives of the course is to impart the basic concepts of Web designing and web
programming and understand concepts about client side and server side programming.
Maximum Marks: 100
External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short answer
type questions covering the entire syllabus. Two questions will be asked from each unit. Students will have to
attempt one question from each unit. Each question shall carry equal marks.

UNIT-I
Introduction to Web programming – Introduction to SGML features – HTML, XHTML, DHTML, XML – HTML
Vs XML – Creating XML documents – Parsing an XML document – Writing well-formed documents – Organizing
elements with namespaces – Defining elements in a DTD – Declaring elements and attributes in a DTD. Overview of
HTML - basic formatting tags - heading, paragraph, underline break, bold, italic, underline, superscript, subscript,
font and image. Attributes - align, color, bgcolor, font face, border, size. Navigation Links using anchor tag - internal,
external, mail and image links. Lists - ordered, unordered and definition, Table tag, HTML Form controls.

UNIT-II
Cascading Style Sheets: Introduction, Inline, Internal, External CSS, Linking CSS to Web Page. Client–Side
Programming: Introduction to JavaScript, Basic Syntax, Variables and Data types, Statements, Operators, Literals,
Functions, Objects, Arrays. XML: Relation between XML and HTML, Goals of XML, Structure and Syntax of XML,
Well Formed XML, DTD and its Structure, tree structures in data organization, Searching with XPath.

UNIT-III
Web Application and Information Gathering: HTTP Request, Response, Header Fields and HTTPS,
Understanding Same Origin, Sessions, Web Application Proxies. Web server – role - Apache Web Server –
Introduction – Architecture – Features - Apache's Role in the Internet – LAMP – WAMP - Installation and
Configuration - Build and Install Apache Web Server - Verify Initial Configuration Start, Stop, and Status the Apache
Server Process.

22 | P a g e
 UNIT-IV
Server side programming – server side scripts – PHP – Designing dynamic web pages using PHP - Defining PHP
variables – variable types – operators – control flow constructs in PHP – passing form data between pages -
Establishing connection with MySQL database – managing database

Course Outcomes: After completion of course, students would be able to understand about the client side and server
side scripts used in programming, the basic concept of designing websites, Database connectivity with the web pages.

Suggested Readings:
1. Oliver, D., 1999. Tech Yourself HTML 4 in 24 Hours, Techmedia.
2. Godbole, A., 2017. Web Technologies, Tata McGraw Hill, India.
3. Jain, V.K., "O" – Level Information Technology, BPB Publications.
4. Singh, G.N., Essentials of Computer and Network Technology, Khanna Books Publishing Co., New Delhi.

23 | P a g e
22BCA402

Software Engineering

Course Objectives: The objectives of this course is to assist the student in understanding the basic theory of software
engineering, and to apply these basic theoretical principles to a group software development project. Students will be
able to study fundamental concepts in software testing, including software testing objectives, process, criteria,
strategies, and methods. Topics like software testing, object-oriented software testing methods, and component-based
software testing issues will be covered.

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short answer
type questions covering the entire syllabus. Two questions will be asked from each unit. Students will have to
attempt one question from each unit. Each question shall carry equal marks.

UNIT-I

Software Engineering: Introduction - Software characteristics - Classification of Software - Phases in Software

Engineering - Key challenges in Software Engineering. SDLC-Software Process, Project and Product - Components
of Software Process- Process Framework - Process Assessment. Software Re-engineering, Software Reverse
Engineering.
Software Life Cycle Models: Waterfall, Prototype, Time boxing and Spiral Models, RAD Model and Automation
through 0software environments

UNIT-II

Requirements Engineering: Feasibility study - Types of Feasibility - Requirement Elicitation - Elicitation

techniques. Requirement analysis - Structured Analysis – DFD - Object Oriented Modeling. Activity Diagram - Data
Diagram- ER diagram - Use case Diagram, Software Requirements Specification: Purpose of SRS, Structure of SRS,
IEEE template of SRS.
Software Design: Principles of Software Design- Software Design Concepts.
Software Coding: Features of Software Code - Coding Guidelines- Coding Methodology. Code verification
techniques.
UNIT-III

Software Testing: Basics of software testing, testing objectives, Principles of testing, Testing and debugging, Test
metrics and measurements, STLC, Verification, Validation, Software Quality and Reliability.
Types of testing: System testing, recovery testing, security testing, stress testing, performance testing, usability
testing, White box testing, static testing, Structural testing, Black Box testing, Requirements based testing, Boundary
value analysis, Equivalence partitioning, state/graph based testing, Scenario Testing, Alpha, Beta and Acceptance
Testing: Acceptance criteria; test cases selection and execution.

UNIT-IV

Software Maintenance Activities: Need for Maintenance, Categories of Maintenance: Preventive, Corrective and
Perfective Maintenance, Cost of Maintenance, Software Re Engineering, Reverse Engineering. Software
Configuration Management Activities, Change Control Process, Software Version Control, Software Reuse, Software
Evolution, Software Quality Attributes, Software Quality Assurance – plans & activities.

24 | P a g e
Course Outcomes: After completion of course, students would be able to understand about the software engineering
practice over the entire system lifecycle. They should be able to understand about the requirement engineering,
analysis, prototyping, design, implementation, testing, maintenance activities and management of risks involved in
software and embedded systems.
Suggested Readings:
1. Ian, S., 2017. Software Engineering, Addison Wesley.
2. Hoffer, A.J, George, J. Valacich, J., 2010. Modern System Analysis and Design, Pearson Education.
3. Pressman S. R., 2019. Software Engineering, Tata McGraw‐Hill.

25 | P a g e
22BCA403

Artificial Intelligence

Course Objectives: The objectives of this course is to provide the basic ideas and techniques underlying the design
of intelligent system and advanced representation formalism and search techniques. This course is designed so that
students can understand and explore the mechanism of mind that enable intelligent thought and action.

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short answer
type questions covering the entire syllabus. Two questions will be asked from each unit. Students will have to
attempt one question from each unit. Each question shall carry equal marks.

UNIT-I
Overview of Artificial Intelligence: Introduction to AI, Importance of AI, Al and its related field, AI techniques,
Criteria for success.
Problems, problem space and search: Defining the problem as a state space search Production system and its
characteristics, Issues in the design of the search problem.
Heuristic search techniques: Generate and test, hill climbing, best first search technique, problem reduction,
constraint satisfaction.
UNIT-II
Knowledge Representation: Definition and importance of knowledge. Knowledge representation. Various
approaches used in knowledge representation. Issues in knowledge representation.
Using Predicate Logic: Represent ting Simple Facts in logic, Representing Instances and Is_a relationship,
Computable function and predicate.
UNIT-III
Natural language processing: Introduction to syntactic processing, Semantic processing, Discourse and pragmatic
processing.
Learning: Introduction to learning, Rote learning, learning by taking advice, learning in problem solving, learning
from example: Induction, Explanation based learning.
UNIT-IV
Expert system development life cycle: Problem selection, Prototype construction, Formalization, Implementation,
Evaluation, Knowledge acquisition: Knowledge engineer, Cognitive behaviour, representing using domain specific
knowledge.

Course Outcomes: After the end of the course, students will be able to develop a basic understanding of AI building
blocks presented in intelligent agents. They will be able to choose an appropriate problem solving method and
knowledge representation technique.

26 | P a g e
Suggested Readings:
1. Elaine R., Kevin, K. Artificial Intelligence, Tata McGraw Hill .
2. Tani Moto: Introduction to AI using LISP.
3. Sangal R.: LISP Programming, Tata McGraw Hill.
4. Balagurusamy, E., 2019. Artificial Intelligence & Technology.

27 | P a g e
22BCA404
Practical Lab based on 22BCA401

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: - Every student will maintain practical record of programs done during practical lab in a file. Examination will
be conducted through a question paper set jointly by the external and internal examiners. The question paper will
consist of questions based on the list of practicals. An examinee will be asked to write the programs and run on
computer. Evaluation will be made on the basis of the examinee’s performance in written solutions and presentation
with viva-voce and practical record.

Practical Examination will be conducted externally as per the following distribution of marks:
Writing solutions of problems and
executing on the Computer: 50 marks.
Presentation &Viva voce: 20 marks.
Practical record: 10 marks.
Internal Assessment: 20 marks (Attendance=10 marks, Assignment=10 marks)

28 | P a g e
 Scheme of Examination and Syllabus for Skill Enhancement Course
BCA 3rd Semester
(w.e.f. 2022-2023)
SEMESTER-III
Paper Code Paper Name Type of Course Credits Contact Marks
(Theory/ Hours (External
Practical) (Theory/ +
Practical) Internal)
22USECBCA301 Mathematical Foundation of Skill 3 3 80+20=100
Computing & Analysis Enhancement
Course

22USECBCA301
Mathematical Foundation of Computing & Analysis

Course Objectives: To develop and understand the mathematical and logical basis to many modern
techniques in computing like machine learning, programming language design, and concurrency.

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short
answer type questions covering the entire syllabus. Two questions will be asked from each unit. Students
will have to attempt one question from each unit. Each question shall carry equal marks.

UNIT I
Sets: Sets, Subsets, Equal Sets Universal Sets, Finite and Infinite Sets, Operation on Sets, Union,
Intersection and Complements of Sets, Cartesian Product, Cardinality of Set, Simple Applications. Relations
and Functions: Properties of Relations, Equivalence Relation, Partial Order Relation, Function: Domain
and Range, Onto, Into and One to One Functions, Composite and Inverse Functions.

UNIT – II
Propositional Logic: Proposition logic, basic logic, Logical Connectives, truth tables, tautologies,
contradiction, Logical implication, Logical equivalence, Normal forms, Theory of Inference and deduction.
Predicate Calculus: Predicates and quantifiers. Mathematical Induction.
Matrices: Definition, Types of Matrices, Addition, Subtraction, Scalar Multiplication and Multiplication of
Matrices, Adjoint and Inverse of a matrix. Determinants: Definition, Minors, Cofactors, Properties of
Determinants, Applications of determinants in finding area of triangle, solving a system of linear equations.

UNIT – III
Graph: Definition, walks, paths, trails, connected graph, regular and bipartite graph, cycles and circuits.
Tree and rooted tree. Spanning tree. Eccentricity of a vertex radius and diameter of a graph. Central graphs.
Centre(s) of a tree. Hamiltonian and Eulerian graph, planar graphs

29 | P a g e
 UNIT – IV
Probability and Distribution: Probability spaces, conditional probability, independence; Discrete random
variables, Independent random variables, the multinomial distribution, Poisson approximation to the
binomial distribution, infinite sequences of Bernoulli trials, sums of independent random variables;
Expectation of Discrete Random Variables, Moments, Variance of a sum, Correlation coefficient,
Chebyshev's Inequality.

Course Outcome: After completion of course, students would be able to understand the basic notions of
discrete and continuous probability. The students will be able to study methods of statistical inference and
the role that sampling distributions play in those methods.

Suggested Readings:
1. Liu, C.L., Elements of Discrete Mathematics, McGraw Hill.
2. Lipschutz, S., Discrete Mathematics, Schaum’s Series.
3. Vince, J., Foundation Mathematics for Computer Science, Springer.
4. Trembley, J.P., Manohar, R., Discrete Mathematical Structure with Application to Computer
Science, TMH.
5. Ram, B., Discrete Mathematics, Vinayek Publishers, New Delhi

30 | P a g e
 Scheme of Examination and Syllabus for Skill Enhancement Course
BCA 4th Semester
(w.e.f. 2022-2023)
SEMESTER-IV
Paper Code Paper Name Type of Course Credits Contact Marks
(Theory/ Hours (External
Practical) (Theory/ +
Practical) Internal)
22USECBCA401 Data Mining Skill
Enhancement 3 3 80+20=100
Course

22USECBCA401
Data Mining

Course Objectives: This course will help students to study concepts of Mining the relevant information, processing
of data, different types of techniques for Data Mining and analysing data, choose relevant models and algorithms for
respective applications

Maximum Marks: 100

External Examination: 80
Internal Assessment: 20
Max. Time: 3 Hrs

Note: There shall be nine questions in all. Question no. 1 shall be compulsory, consisting of eight short
answer type questions covering the entire syllabus. Two questions will be asked from each unit. Students
will have to attempt one question from each unit. Each question shall carry equal marks.

UNIT-I
Introduction to Data Mining: Scope of Data Mining, Working of Data Mining, Predictive Modelling on Data
Mining, and Architecture for Data Mining, Profitable Applications of Data Mining, Data Mining Tools
Business Intelligence: Introduction, Business Intelligence, Business Intelligence Applications, BI versus Data
Warehouse, BI versus Data Mining, Future of BI.
UNIT-II
Data Pre-processing: Data Pre-processing Overview, Data Cleaning, Data Integration and Transformation, Data
Reduction, Discretization and Concept Hierarchy Generation.
Data Mining Techniques- An Overview: Introduction of Data Mining Techniques, Data Mining Versus Database
Management System, Data Mining Techniques- Association rules, Classification, Regression, Clustering, Neural
networks.
UNIT-III
Clustering: Introduction of Clustering, Cluster Analysis, Clustering Methods- K means, Hierarchical clustering,
Agglomerative clustering, Divisive clustering, clustering and segmentation software, evaluating clusters.
Web Mining: Terminologies, Categories of Web Mining – Web Content Mining, Web Structure Mining, Web Usage
Mining, Applications of Web Mining.

31 | P a g e
 UNIT-IV
Applications of Data mining: Business Applications Using Data Mining- Risk management and targeted marketing,
Customer profiles and feature construction, Medical applications (diabetic screening), Scientific Applications using
Data Mining, Other Applications.
Course Outcomes: After the end of the course, students will be able to implement different data mining techniques
on the pre-processed data set for extracting hidden patterns from data. They will be able to identify appropriate data
mining algorithms to solve real world problems

Suggested Readings:

1. Han, J. and Kamber., M., Data Mining - Concepts & Techniques, Harcourt India PVT Ltd. (Morgan
Kaufmann Publishers).
2. Whiffen, I.H., Data Mining, Practical Machine Cearing tools & techniques with Java (Morgan Kanffmen)
3. Pujari, A.K., Data Mining Techniques, University Press.

32 | P a g e