INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES,

DEVI AHILYA UNIVERSITY, INDORE

MCA 5 Years VIII SEMESTER

IC- 812A Soft Computing

Course Type: Elective

Course Credits: 4

Course Objectives: The main objective of the course is to learn concepts and working of various soft
computing techniques such as genetic algorithms, fuzzy logic and neural networks and apply them for
various real-time engineering problems such as classification, optimizations, clustering and controls.

CO-1 Understanding of different soft computing techniques like Genetic Algorithms, Fuzzy Logic,
Neural Networks and their hybridizations.

CO-2 Ability to identify, analyze and apply suitable soft computing techniques to solve engineering or
real life problems.

CO3 Comprehend the fuzzy logic and the concept of fuzziness involved in various systems and fuzzy
set theory.

CO2 Understand Neural Networks, architecture, functions and various algorithms involved.

CO4 Apply neural networks for pattern recognition and prediction tasks

CO5 Understand the genetic algorithm concepts and their applications.

Course Contents –
Unit Title Contents Hr
No
1 Introduction to Concept of Computing, Characteristics of Hard Computing, Soft 4
Soft Computing, Characteristics of Soft Computing, Hard Computing
Computing Vs Soft Computing, Limitations of Hard and Soft Computing,
Types of Soft Computing Techniques, Applications of Soft
Computing, Hybrid Computing.
LO1: Develop an understanding of hard and soft computing.
2 Introduction to Background, Uncertainty and imprecision, Uncertainty in 8
Fuzzy logic information, Concept of Fuzzy Logic System, Characteristics of
Fuzzy Logic System, Advantages and disadvantages of Fuzzy
Logic System.
Concept of Fuzzy Set, Fuzzy Set Vs Crisp Set, Basic
terminologies, Fuzzy sets, Operations on Fuzzy Sets, Fuzzy
Membership Functions.
LO1: Understand the concept of fuzzy logic fuzzy sets and fuzzy
membership.
LO2: Able to distinguish between fuzzy and crisp logic.
3 Defuzzification Defuzzification Techniques: Concept of defuzzication, Lambda- 7
cut methods, Max-Membership Principle, Centroid Methods and
Weighjted Average Method. Applications of Fuzzy Logic.

LO1: Learn the concept and methods for defuzzification.

LO2: Apply defuzzification in fuzzy logic systems.

4 Fuzzy Crisp relations- Cardinality of Crisp Relation, Operations on 7

Relations, crisp relations, Properties of crisp relations, Composition of crisp
Rules and relations, Fuzzy relations-cardinality of fuzzy relations,
Inferences Operations on fuzzy relations, Properties of fuzzy relations,
Fuzzy Composition.

Fuzzy Propositions: Two valued logic Vs Multi valued logic,

Fuzzy Propositions Vs Crisp propositions. Fuzzy Rules- Fuzzy
Implications and Interpretation. Fuzzy Inferences Systems (FIS)-
Construction and Working Principles of FIS, Methods of FIS-
Mamdani FIS and Takagi-Sugeno Fuzzy Model( TS-Method).

LO1: Perform operations on fuzzy sets.

LO2: Use fuzzy propositions and inferences to develop fuzzy

logic systems.

5 Neural Introduction to machine learning with Neural Networks, Types 4

Networks of learning, Neural network architectures, Single layer networks,
Multilayer networks with backpropagation learning, Radial basis
function Networks, Unsupervised learning with Neural
Networks, Advances in Neural Networks, Applications of neural
networks, Overview of Reinforcement Learning

LO1: Understand the concept of neural networks.

6 Genetic Biological Background, Traditional optimization and search 4

Algorithms techniques, genetic algorithm and search space, genetic
algorithm vs. traditional algorithms, basic terminologies, simple
genetic algorithm, general genetic algorithm, operators in genetic
algorithm, stopping condition for genetic algorithm flow,
constraints in genetic algorithm, problem solving using genetic
algorithm, advantages, limitations and applications of genetic
algorithm.
LO1: Understand the concept of genetic algorithms.
LO2: Apply genetic algorithms in problem solving.
7 Hybrid systems Types of Hybridizations, Neuro-fuzzy systems, Neuro-genetic 5
Systems, Fuzzygenetic systems, Applications of hybrid systems.
LO1: Understand the concept of hybrid systems.

* 1- Remember, 2- Understand, 3- Apply, 4- Analyze

Books and Reading

BOOKS:

1. S.N. Sivanandam & S.N. Deepa, ”Principles of Soft Computing”, Wiley Publications,
2nd Edition, 2011.
2. D.K.Pratihar, Soft Computing: Fundamentals and Applications, Narosa Publishing
House Pvt. Ltd. - New Delhi, 2015
3. George J. Klir, Bo Yua, Fuzzy Sets and Fuzzy Logic: Theory and Applications,
Prentice Hall, 1995
4. Timothy J. Ross, Fuzzy Logic with Engineering Applications, Wiley; Third edition,
2011

Reference Books:

1. Jyh Shing Roger Jang, Chuen Tsai Sun, Eiji Mizutani, Neuro-Fuzzy and Soft
Computing, Prentice Hall of India, 2003
2. Nikola K. Kasabov, Foundations of Neural Networks, Fuzzy Systems, and Knowldge
Engineering, MIT Press
3. S.Rajasekaran, G.A.Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic
Algorithms: Synthesis and Applications. PHI

Online Reference:

1 https://nptel.ac.in/courses/106/105/106105173/

CO-PO Mapping

PROGRAM SPECIFIC CO1 CO2 CO3 CO4 CO5

OUTCOMES
PSO1 Algorithm development     
Computer Based Solution     
Application Development    
Disciplinary Knowledge    
PSO2 Programming Skill  
Problem Solving/ Critical     
thinking
Mathematical Analysis     
PSO3 Financial Aspects
Modern Tools     
Complex Problems solving 
Time Frame Analysis  
PSO4 Computer Architecture
Cooperation/Teamwork
Resource Management
PSO5 Modern Problem solving     
Technique
Business Skills
PSO6 Communication skills
Decision making skills     
Managerial Skill
Environmental constraints
Research Skills     

PTO….
MCA 5 Years
Semester – VIII
Data Mining & Warehousing(IC-811B)

Course Type: - Core Compulsory

Course Credits: - 4 Theory 0 Practical

Course Objective: - To understand data warehouses and data Mining with recent trends and
development and trends in the field.

Course Outcomes – After completion of this course, learners will be able to

CO1 – Understand basic concepts of data warehousing and data mining.

CO2 – Learn preprocessing of data.
CO3 – Understand On Line Analytical Processing (OLAP)
CO4 – Learn data mining techniques and understand various algorithms and their applications.
CO5– Use of data mining as analytical tool in business data analysis.

Corse Content:

Unit Name Contents Hours

No.

I Introduction Data Warehousing, Evolution of data warehousing systems, 8 Hrs

to Data Data Warehouse (DW) - definition, Applications of DW,
OLTP V/s Data Warehouse. Data Warehouse Architecture.
Warehousing Data Warehouse Server, Data Marts, Data Warehouse
Implementation, Metadata. Advantages of Data Warehouse,
Data Warehouse Pitfalls, Future of Data Warehousing.
Data Warehouse Backend Process: Data Extraction, Data
Cleaning, Data Transformation, Data Reduction, Data loading
and refreshing.

II Online Multidimensional Data Model: Structuring/Modelling Issues, 8Hrs

Analytical Derived Data, Schema Design, Dimension Tables, Fact Table,
Processing Star Schema, Snowflake schema, Fact Constellation, De-
normalization.
(OLAP)
Introduction to OLAP, Strengths of OLAP, OLAP queries:
Slicing and Dicing, Roll-up and Drill Down, OLAP Servers,
Successful Warehouse, Presentation on ETL tool.

Case Studies on Data warehousing

III Data Mining Fundamentals of data mining, Data Mining definitions, 4 Hrs
DBMS V/s Data Mining . Knowledge Discovery in Databases
(KDD), Data Mining Functionalities, Issues and challenges in
Data Mining. Data Mining Primitives, Data Mining Query
Languages, Applications of Data mining, Data mining Case
studies.
IV Association Basic concept and terminology. Methods to discover 8 Hrs
rule Mining: association rules. A Priori algorithm. Partitioning, Pincer
Search Algorithm, Dynamic Itemset Counting Algorithm,
Applications of association rule mining.
V Clustering Basic concept, measures of similarity, types of clustering 4 Hrs
methods. K-means algotithm. K-medoid algorithm, DBSCAN
algorithm, applications of clustering.
VI Classification: Decision tress, basic concept, algorithm to build decision 4 Hrs
tress. Splitting methods in decision tress- GINI index and
Information gain.

VII Web Mining Web Mining; Web content mining, Web Structure mining, 4 Hrs
and Spatial Web Usage mining, Text Mining, Temporal Mining and
Mining Spatial Data Mining.

Books and Reading

1. Arun K Pujari, Data Mining Techniques, University Press
2. Jiwaei Han & Micheline Kamber. Data Mining – Concepts and Techniques, Harcourt India
3. W. H. Inmon, Building the Data Warehouse. Wiley Dreamtech India Pvt. Ltd
4. Ralph Mikball. The Data Warehouse Life cycle Tool kit. Wiley Student Edition.
5. G. K. Gupta. Data Mining With Case Studies. Pearson education, India

Electronic Materials, Web Sites etc

1. http://akademik.maltepe.edu.tr/~kadirerdem/772s_Data.Mining.Concepts.and.Techniques.2nd
.Ed.pdf
2. http://infolab.stanford.edu/~ullman/mining/mining.html
CO-PO Mapping
PROGRAM SPECIFIC OUTCOMES CO1 CO2 CO3 CO4 CO5
PSO1 Algorithm development ✔
Computer Based Solution ✔ ✔ ✔
Application Development ✔ ✔ ✔
Disciplinary Knowledge ✔
PSO2 Programming Skill ✔ ✔ ✔
Problem Solving/ Critical thinking ✔ ✔ ✔ ✔ ✔
Mathematical Analysis ✔ ✔ ✔
PSO3 Financial Aspects
Modern Tools ✔ ✔
Complex Problems solving ✔ ✔ ✔ ✔
Time Frame Analysis
PSO4 Computer Architecture
Cooperation/Teamwork ✔
Resource Management
PSO5 Modern Problem solving Technique ✔ ✔ ✔
Business Skills ✔
PSO6 Communication skills ✔
Decision making skills ✔ ✔ ✔
Managerial Skill ✔ ✔ ✔ ✔
Environmental constraints
Research Skills ✔ ✔ ✔ ✔ ✔
INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DEVI AHILYA
UNIVERSITY, INDORE

MCA 5 Years VIII SEMESTER

IC-812 Theory of Computation

Course Type: - Core Compulsory

Course Credits: - 4 Theory 0 Practical

Course Objective: - To make students know about the basic concepts of Computation and learn to
work with mathematical abstractions of computers called a model of computation.

Course Outcomes: - After completion of the course, student will

CO1 – get acquainted with concepts of formal languages, grammars, and automata.
CO2 – be able to construct context-free grammars for specifying programming language
syntax.
CO3 – be able to construct the regular expressions for various pattern matching applications.
CO4 – be able to identify computability and complexity of given problem and construct
theoretical computational models for complex problems.

Corse Content:

Unit Title Contents Hr Targeted Levels of

No Blooms T. (Q1)

1 Formal Introduction to Computation & Languages, 4 1 and 2*

Languages Natural Languages, Computer Programming Hrs
and Grammar Languages and Formal Languages. Three
basic concepts: Languages, grammar and
automata. Language Concepts: alphabet,
strings, properties of Strings, kleene closure.
Properties of Formal Languages.

Grammar: Chomsky Hierarchy of grammar,

languages represented by type 0,1,2,3
grammars. Construction of grammars for
languages.

LO1: Student will have an understanding of

formal languages and grammar.

2 Context Free Parsing, ambiguity, parse trees, parsing 8Hrs 1, 2 and 3*

Grammars and methods: Bottom up and top down parsing,
Languages Simplification of grammar. Normal form of
CFGs: Chomsky Normal Form and Greibach
Normal Form, CKY algorithm, Closure
Properties of CFLs.

LO1: Able to perform syntax analysis and

construct CFG for different programming
constructs.

LO2: Apply universal parsing algorithms to

parse any CFG.

3 Finite Finite automata, kleene’s theorem, non- 6 1, 2 3, and 4*

Automata deterministic finite automata. Equivalence of Hrs
FAs and NFAs. Construction of NFAs and
FAs Minimal state finite automata, Mealy
machine and Moore machine, Equivalence
of Mealy and Moore machine, Equivalence
of FAs.

LO1: Able to construct finite automata for

regular languages.

LO2: At this level, students will be able to

construct Mealy and Moore machine for real
world applications like traffic light
controller, elevator controller, vending
machine, parity checker and many such
applications.

4 Regular Regular languages, regular expression and 8 1, 2, 3 and 4*

Expressions corresponding languages, Equivalence of Hrs
and finite automata and regular expressions.
Languages Regular grammar and their equivalence to
finite automata, Pumping Lemma for non-
regular languages. Closure Properties of
Regular Languages.

LO1: Able to construct regular expressions

for regular languages.

LO2: Able to apply regular expressions in

various pattern matching applications.

5 Push Down Definition, examples, deterministic PDA, 4 1, and 2 *

Automata non-deterministic PDA, Parsing and PDAs, Hrs
PDA and Context Free Languages.

LO1: Student will have an understanding of

PDA.
LO2: Able to construct PDA for context
free languages.

6 Turing Models of computations, definition, 6 1 to 5*

machines Representation of Turing Machines (TM), Hrs
TMs as language acceptors, Techniques for
TM construction. Universal Turing
machines, Variants of Turing machine.

LO1: Student will have an understanding of

TM.

LO2: Able to construct TM for recursively

enumerable languages.

7 Undecidability Church - Turing thesis, Unsolvable Decision 4 1 to 5*

Problems- Decidability, Decidable Hrs
Languages, Undecidable Languages Halting
Problem of Turing Machine.

LO1: Student will have an understanding of

decision problems.

LO2: Able to write non-deterministic

algorithms.

LO3: Analyze and evaluate the

computability and complexity of given
problem.

* 1- Remember, 2- Understand, 3- Apply, 4- Analyze, 5- Evaluate, 6- Create

Books and Reading

https://sites.google.com/site/shaligramiipsdavvindore/Core-Activities/theory-of-computation

Hopcraft and Ullman, Introduction to Automata Theory, Languages and Computation, Narosa
Publishing House.

Peter Linz, An Introduction to Formal Languages and Automata, Narosa Publishing House.

Cohen Daniel I.A., Introdution to Computer Theory, John Weley and Sons , inc New York

Martyn John C, Introduction to Languages and Theory of Computation, McGraw Hill, N.Y. (Internal
Edition McGraw Hill)

Mandrioli Dino, Ghezzio Carlo, Theoretical Fundamentals of Computer Science, John Weley and
Sons, Inc , New York.
Electronic Materials, Web Sites etc

http://nptel.iitm.ac.in/courses/Webcourse-contents/IIT-%20Guwahati/afl/index.htm
http://www.eecs.wsu.edu/~ananth/CptS317/Lectures/

CO-PO Mapping

PROGRAM SPECIFIC CO1 CO2 CO3 CO4

OUTCOMES
PSO1 Algorithm development ✔ ✔ ✔
Computer Based Solution ✔ ✔ ✔ ✔
Application Development ✔ ✔ ✔ ✔
Disciplinary Knowledge ✔ ✔
PSO2 Programming Skill ✔
Problem Solving/ Critical ✔ ✔ ✔ ✔
thinking
Mathematical Analysis ✔ ✔
PSO3 Financial Aspects
Modern Tools
Complex Problems solving ✔ ✔ ✔
Time Frame Analysis
PSO4 Computer Architecture
Cooperation/Teamwork
Resource Management ✔
PSO5 Modern Problem solving
Technique
Business Skills
PSO6 Communication skills
Decision making skills
Managerial Skill
Environmental constraints
Research Skills ✔ ✔ ✔
INTERNATIONAL INSTITUTE OF PROFESSIONAL STUDIES, DAVV, INDORE
MCA (5 Years) VIII SEMESTER
IC-803: Enterprise Computing Technique

Aim of the course: To enable the students understand the concepts of EJB and build web-
based and/or enterprise-based applications that incorporate EJB technology.
Objectives:
The course is designed to make students:
 Implement business-tier functionality using EJB technology
 Learn the concepts and implementation of RMI and JNDI
 Get an overview of EJB fundamentals.
 Learn the concepts and implementation of Entity and Session beans..

Course Contents:
UNIT I
RMI: Object Serialization, Developing Applications with RMI, and the RMI security
manager, Parameters passing in RMI.

UNIT II
JNDI: Naming services, Directory services, Benefits of JNDI, JNDI Architecture, JNDI
concepts

UNIT III
Overview & EJB Fundamentals: Motivation for EJB, Component architecture, Various roles
in J2EE architecture, Type of Beans, Distributed object & Middleware, Constituents of
enterprise beans: Enterprise beans class, EJB Object, Home object, Local interfaces,
Deployment description, Vendor specific files.

UNIT IV
Session Beans: Stateless session beans, statefull session beans, characteristics of statefull
session beans, lifecycle diagram for session beans. JMS, Integrating JMS with EJB,
Developing message driver beans.

UNIT V
Entity Beans: Persistence concepts, Features of entity beans, Bean managed Persistent entity
beans, and Container managed persistent entity beans, Life cycle Diagrams, BMP and CMP
relationships.

Text Books:
1. Ed Roman “Mastering Enterprise Java Beans”, Wiley Publishing, 2005, 3rd Edition
Reference Books:
1.P
1. G Sarang ,Kyle Gabhart Professional EJB wrox publication
2.Richard Monson-Haefel ,Bill, Burke,Enterprise java beans 3.0,5 th Ed Developing
Enterprise Java Components,O’Reilly Media
Ka.
2. Ahmed “Professional JAVA server programming”, SPD, 2005
3. J2EE Tutorial from www.java.sun.com
Semeter –VIII

IT-804B Mobile and Wireless Computing

Course Objectives:

CO1 : understand the basic concepts of wireless and mobile communication with focus on mobile
networking.

CO2: provide knowledge of different techniques of wireless communication.

CO3: Understand the concept of wireless LAN, Mobile networks and Advances in Mobile Technologies.

CO4: Acquaint with various transmission and reception techniques used in different mobile
communication systems

Course Outcomes—

 CO1: students will be familiar with mobile and wireless communication methodologies
 CO2 : Learn wireless communication protocols and different standards.
 CO3: able to apply these concepts in Wireless Network planning, design and administration to
support mobility.
 CO4 : Current and future Mobile communication standards and techniques used in standards

Prerequisites: Computer Networks

Unit Name Contents Hours

No.
I Introduction Wireless Networks, Wireless vs Wired Networks, mobile 8
devices, mobile applications, mobile environments and
limitations, Wireless transmission-frequencies and regulation,
multipath propagation, channel fading, Multiplexing and
Modulation techniques, Spread spectrum-DSSS & FHSS
2 Medium motivation for specialized MAC, Hidden/Exposed, Near/Far 8
Access Control terminal effect, MAC protocols – SDMA,FDMA,TDMA,
Reservation Aloha, PRMA, MACA, DSMA etc.
3 Cellular Introduction to Cellular Mobile System: A basic cellular 8
Mobile System system, Performance criteria, Concept of frequency reuse
channels, C/I ratio, cell splitting, sectoring, types of non co-
channel interference, co-channel interference: measurement &
reduction factor, Frequency management, Channel
Assignment, Handoffs, Dropped call rate.
4 GSM GSM- Architecture, GSM-Air Interface, protocols, HLR/VLR, 10
localization & calling, security, GPRS, CDMA.
5 Wireless LAN Infra vs Radio transmission, infrastructure vs ad hoc 10
network,IEEE 802.11- system and protocol architecture, MAC
management, IEEE 802.11 flavours, Bluetooth – architecture,
radio and basband layer, L2CAP, IEEE 802.15, WiMax and
Zigbeeoverview.
6 Mobile Mobile Network Layer : Entities, Packet delivery, Agent 8
Network Layer Discovery, Tunneling and encapsulation, optimization, reverse
and Mobile tunnelling,
Transport Mobile Transport Layer : Congestion control and implication
Layer of mobility, slow start, Mobile TCP – Indirect TCP, Snooping
TCP, Mobile TCP, Fast retransmit/ Fast recovery
7 Advances in Mobile AdhocNetworks- Protocols and Routing. 8
Mobile Advances in Mobile Technologies- 5G and Beyond, Interne of
Technologies Things (IoT), Internet of Every Thing (IoE), Wireless Sensor
Networks, Mobile Opportunistic Network

1. Jochen Schiller, “Mobile Communications”, Second Edition, Pearson, 2009.

2. Paul Bedell, “Cellular networks: Design and Operation – A real world Perspective”,
Outskirts Press, 2014.
3. “Introduction to wireless and Mobile Systems” by Dharma Prakash Agrawal and Qing-
An Zeng 2015.
4. Upena Dalal “Wireless and Mobile Communication” Oxford University Press.