25

ANNEXURE – III
SCHEME OF COURSES FOR V SEMESTER B. TECH (IT)

B. TECH (IT) SEMESTER V

Evaluation Scheme AICTE COURSE

(Percentage weights) TYPE
Course Type Course L T P Credits Offering
Code Theory Practical Dept.

CA MS ES CA ES

Theory of
ITITC14 CC 3 1 0 4 25 25 50 - - IT PROGRAM CORE
Computation
Number
ITITC15 CC 3 0 2 4 15 15 40 15 15 IT PROGRAM CORE
Theory and
Cryptography
Artificial
ITITC16 CC 3 0 2 4 15 15 40 15 15 IT PROGRAM CORE
Intelligence
Mobile PROGRAM CORE
ITITC17 CC Computing 3 0 2 4 15 15 40 15 15 IT
ED/EG/EO Elective 1
ED/EG/EO Elective 2
ED/EG/EO Elective 3

Max.
28

25
26

SCHEME OF COURSES FOR V SEMESTER (with pre-requisites)

B. TECH (IT)

B. TECH (IT) SEMESTER V(with pre-requisites)

Pre-requisites
Course Offering
Code Type Course L T P Credits Dept.
Course Course
Code Name
ITITC14 CC Theory of Computation 3 1 0 4 IT ITITC03 Discrete Structures
CC Number Theory and - -
ITITC15
Cryptography 3 0 2 4 IT
Artificial Intelligence Design and Analysis
ITITC16 CC 3 0 2 4 IT ITITC10 of Algorithm

ITITC17 CC Mobile Computing IT ITITC12 Computer Networks

3 0 2 4
1* Elective(s)
ED/EG/EO - - - - - -

1*: The LTP allocation, Evaluation Scheme and Pre-requisites for Electives are given in Table below. The course code
will depend upon the elective(s) chosen by the student.

2*: The actual weekly load will depend upon the elective(s) chosen by the student.

3*: A student may register for courses leading to a minimum of 16 credits and a maximum of 28 credits. Normally, a
student registers for courses leading to 22 credits.

26
27

V SEMESTER ELECTIVES (Minor 1: Network Computing and

Security and Minor 2: Machine Intelligence and Data Analytics)
B.TECH (IT)

Minor 1: Network Computing and Security Minor 2: Machine Intelligence and Data
Analytics
Course Course Name Prerequisite Course Course Name Prerequisite
No. No.
ITITE01 Intrusion Detection Systems Computer ITITE04 Image Analytics Computer Graphics
and Firewalls Networks (ITITC08)
(ITITC12)
ITITE02 Advance Computer Computer ITITE05 Data Warehouse Data Base
Networks Networks and Data Mining Management System
(ITITC12) (ITITC05)
ITITE03 Cloud Computing Computer ITITE06 Soft Computing Design and Analysis
Networks of Algorithm
(ITITC12) (ITITC10)

27
 28

SYLLABI OF CORE COURSES OF SEMESTER V

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

Theory of 3 1 0 25 25 50 Nil Nil Discrete

ITITC14 CC 4
Computation Structures

COURSE OUTCOMES (COs)

By the end of the course students will be able to:

CO1: Describe the Finite Automata, their capabilities and limitations.

CO2: Classify the different types of grammars, languages and machines.
CO3: Discover the equivalence of languages described by finite state machines and regular expressions.
CO4: Analyze the problem-solving situations in related areas of theory of computer science.
CO5: Design the FA, CFG, Push Down Automata and Turing recognizable languages.

COURSE CONTENT No. of hours:39

Unit 1
Finite Automata: Introduction to Automata Theory, Use of Automata, Characteristics of Automaton, Alphabets,
Strings & Languages, Finite Automata (FA), Graphical and Tabular Representation FA, Deterministic finite
Automata (DFA) & Nondeterministic finite Automata (NDFA), Conversion of NDFA to DFA, Minimization of
Finite Automata, NFA with ε (null) Move, Moore and Mealy machine and their equivalence, Limitations of Finite
Automata. [10 hrs]

Unit 2
Regular expressions and languages: Regular Expressions and Regular Languages, Operations on Regular
Expression, Identities of Regular Expression, The Arden’s Theorem, Kleen's Theorem, Regular Expression to
Finite Automata, Equivalence of Two Regular Expressions, Closure Properties of Regular Languages, Pumping
Lemma for regular Languages. [8 hrs]

Unit 3
Grammar and Language: Definition of Grammar, Derivations from a Grammar, Types of Grammars, Regular
and Linear Grammar, FA to Regular Grammar, Regular Grammar to FA, Context free grammar, Derivation and
parse tree, Ambiguity in Context-free Grammar, Simplification of Context Free grammar, Normal forms for CFGs:
Chomsky Normal Form & Greibach Normal Form, Pumping Lemma for Context Free languages. [8 hrs]

Unit 4
Pushdown Automata: Push Down Automata (PDA), languages of PDA, Graphical Notation for PDA, Acceptance
by a PDA: Empty stack, Final state, Deterministic PDA, Non-Deterministic PDA, Construction of PDA from CFG,
Construction of CFG Equivalent to PDA. [6 hrs]

Unit 5
Turing Machine: Basics of Turing Machine (TM), Instantaneous Description (ID) of TM, Transitional
Representation of Turing Machine, Regular Expression to Turing Machine, Nondeterministic Turing Machines,
Linear Bounded Automata, Recursive and recursively enumerable languages, Computability and Decidability,
Halting problem. [7 hrs]

28
 29

SUGGESTED READINGS:
1. Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D “Introduction to Automata Theory, Languages, and
Computation”, Third Edition, Pearson.
2. John C. Martin. “Introduction to Languages and Theory of Computations”, TMH.
3. K.L.P. Mishra, “Theory of Computer Science. Automata, Languages and Computation. Third Edition”, PHI.
4. PETER LINZ, "An Introduction to FORMAL LANGUAGES and AUTOMATA", Fifth Edition, Jones &
Bartlett Learning
5. Sudkamp Thomas, “Languages and Machines: An Introduction to the Theory of Computer Science”, Peason
Addison Wesley
6. Sipser, Michael, ”Introduction to the theory of Computation”, Third Edition, Cengage.
7. Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI
8. Daniel I.A. Cohen, ”Introduction to Computer Theory”,Second Edition, John Wiley.

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

ITITC15 CC Number 3 0 2 4 15 15 40 15 15 None

Theory and
Cryptography

COURSE OUTCOMES (COs)

By the end of the course students will be able to:

CO1: To build a solid mathematical basis to understand foundations of cryptography

CO2: To understand the traditional and modern symmetric key ciphers
CO3: To understand the public key cryptographic algorithms
CO4: To understand the notions related to integrity, authentication and privacy

COURSE CONTENT No. of hours:36

UNIT I: Elementary Number Theory

Groups, Rings, Finite Fields, Modular Arithmetic, Matrices, Linear Congruence, Efficient Algorithms for Modular
Arithmetic, Fermat's Little Theorem, Euler's Criteria, Euler's Totient Function [7 hrs]

UNIT II: Advanced Number Theory

Primality Testing, Prime Factorization, Chinese Remainder theorem, Quadratic Congruence, Exponentiation and
Logarithm, Legendre and Jacobi Symbols [6 hrs]

UNIT III: Classical Symmetric-Key Ciphers

Basic Cryptographic Concept, Caesar Cipher, Affine Cipher, Autokey Cipher, Playfair Cipher, Vigenere Cipher,
Hill Cipher, Rotor Cipher, Enigma Cipher, Transposition Ciphers [7 hrs]

UNIT IV: Modern Symmetric-Key Ciphers

Modern Block ciphers, Structure of a block cipher, Fiestel and Non-Fiestel Ciphers, Modern Stream Cipher, Linear
and Differential Cryptanalysis, Blowfish, DES, AES [9 hrs]

UNIT V: Public Key Cryptography

RSA, Knapsack, Rabin, ElGamal, Diffie Hellman Key Exchange algorithm, Digital Signatures, Hash Functions

29
 30

and its properties [7

hrs]
SUGGESTED READINGS
• B. A. Forouzan, "Cryptography & Network Security", Tata Mc Graw Hill.
• J.Katz, Y.Lindell, Introduction to Modern Cryptography, Chapman Hall.
• Wen Bo Mao, Modern cryptography - Theory and practice, Prentice Hall.
• Douglas Stinson, "Cryptography Theory and Practice", Second Edition, Chapman & Hall/CRC.
W. Stallings, "Cryptography and Network Security", Pearson Education

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

ITITC16 CC Artificial 3 0 2 4 15 15 40 15 15 Design and

Intelligence Analysis of
Algorithm
Course Outcomes (COs)
CO1: Distinguish between a conventional system and an intelligent system.
CO2: Explain Artificial Intelligence concept and its applications.
CO3: Represent knowledge using various different techniques.
CO4: Use the appropriate searching techniques in achieving desired goals.
CO5: Apply Artificial Intelligent techniques in solving problems of a particular domain
COURSE CONTENT No. of hours:40

Unit I: Foundations in intelligent systems: What is Artificial Intelligence? The AI problems, Underlying
assumption, AI technique, Criteria for success, Problems, Problem Spaces and Search Defining problem as a state
space search, production systems, problem characteristics, production system characteristics. [8 hrs]

Unit II: AI search techniques: Generate and test, hill climbing, Depth first search, Best first search, best first- A
* algorithm, AO* algorithm problem reduction, Tabu search, Simulated annealing, constraint satisfaction, means
and ends analysis. [8 hrs]

Unit III: Knowledge Representations: Knowledge representation issues Representations and mappings,
Propositional Logic, approaches to knowledge representation, issues in knowledge representation Using Predicate
Logic Representing simple facts in logic, representing instance and Isa relationships, computable functions and
predicates, resolution, Representing knowledge using rules Procedural vs. declarative knowledge, logic
programming, forward vs. backward reasoning, Unification, Forward Chaining-Backward Chaining, Resolution.
[10 hrs]

Unit IV: Reasoning under un-certainty: Non-monotonic reasoning, Bayesian networks, Fuzzy logic,
Introduction to Computing with words, Dempster Shafer theory. Game Playing Overview, Mini-max search
procedure, Alpha-beta cutoffs. [6 hrs]

Unit V: Planning and Learning: Planning Overview, blocks world problem, components of planning system,
goal stack planning, Inductive learning, decision trees, logical approaches, computational learning theory,
Intelligent agents, Natural language understanding. [8 hrs]

30
 31

SUGGESTED READINGS
[T1]Elain Rich and Kevin Knight- Artificial Intelligence, TMH, 1991.
[T2]Stuart Russell, Peter Norvig, Artificial intelligence : A Modern Approach, Prentice Hall, Fourth edition, 2020
References:
[R1]Nils J. Nilsson, Artificial Intelligence: A New Synthesis, Morgan-Kaufmann, 1998.
[R2]Judea Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley
Publishing Company, 1984

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

ITITC17 CC Mobile 3 0 2 4 15 15 40 15 15 Computer

Computing Networks
COURSE OUTCOMES
CO1: To identify and familiarize the basics of wireless and mobile communication and developments towards
modern systems.
CO2: To classify and extract the propagation characteristics of wireless channels
CO3: To provide an overview of 4G LTE and 5G technologies.
CO4: To apply and illustrate the concept with the state of art standards used in wireless mobile systems.
CO5: To design and evaluate the working of mobile wireless systems.
COURSE CONTENT No. of hours: 40

UNIT I: Wireless Communication Fundamentals

Introduction, Evolution of Wireless Communication, Applications areas, Switching techniques for Data: Circuit
switching, Message Switching and packet Switching in perceptive with mobile communication, Multiplexing in
wireless transmission: TDMA, CDMA, SDMA, FDMA, Modulation techniques, Spread spectrum techniques,
Cellular systems, Wireless medium access techniques, Hidden terminal problem, Exposed terminal problem, Near
and far terminals. [8 hrs]

UNIT II: GSM Fundamentals

Introduction, Architecture of GSM, characteristics of GSM standards, services, Radio transmission parameters in
GSM System, Applications, Traffic and Logical Channels in GSM, GSM time hierarchy, GSM burst structure,
Description of call setup procedure, Handover mechanism in GSM, Security in GSM. [8 hrs]

UNIT III: GPRS/ UMTS Fundamentals

GPRS and packet data network, GPRS network architecture, GPRS network operation, data services in GPRS,
Applications of GPRS, Billing and charging in GPRS. UTRAN, UMTS core network, UMTS network
architecture, UMTS network operation, data services in UMTS, Applications of UMTS.
[8 hrs]

UNIT IV: Recent Mobile Technologies (4G, 5G and above)

Overview of LTE: LTE basics, LTE frame structure, LTE Design parameters with Standardization and
Architecture of LTE, VOLTE. Overview of 5G Networks: Comparison of 4G and 5G technology, Opportunities
and requirements in 5G network, Open Wireless Architecture of 5G network and Disruptive technologies for 5G,
Overview of 6G networks.
[8 hrs]
UNIT V: Communication Protocols for Mobile IP and TCP
IEEE 802.11: System architecture, Protocol architecture, Medium access control layer, MAC management,
Bluetooth: Introduction, User Scenario, Architecture, and protocol stack, Mobile IP, TCP protocols for mobile

31
 32

communication, Mobile TCP, Snooping TCP, ITCP. [8 hrs]

Text Books:
[T1] Dr. Jochen H. Schiller, “Mobile communications.” Pearson education
[T2] Chai K. Toh, “Ad hoc mobile wireless networks: protocols and systems.” Pearson Education
[T3] Asoke K. Talukdar, “Mobile Computing.” Tata McGraw-Hill Education
[T4] “Wireless Communications & Networks,” By William Stallings, Second Edition, Pearson Education
References:
[R1] Man Young Rhee, “Mobile communication systems and security.” John Wiley & Sons.
[R2] CX Wang, Haider F, Gao X, You XH, Yang Y, Yuan D, Aggoune HM, Haas H, Fletcher S, Hepsaydir E,
“Cellular architecture and key technologies for 5G wireless communication networks.” IEEE communications
magazine 52, no. 2 (2014): 122-130.
[R3] Christopher Cox, “An Introduction to LTE: LTE, LTE-Advanced, SAE and 4G Mobile Communications,”
Wiley publications
[R4] Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks,” PHI/Pearson Education,
2003.

32
 33

SYLLABI OF ELECTIVE COURSES OF SEMESTER V

Course L T P Pre-
Code Type Subject Credi CA MS ES PCA PES Requisites
ts
ITITE01 ED Intrusion 3 0 2 4 15 15 40 15 15 Computer
Detection Networks
Systems
and
Firewalls
COURSE OUTCOMES
CO1: To know about intrusion detection
CO2: To know about different IDS techniques
CO3: To understand the architecture of IDS and IPS
CO4: To configure firewalls and IDS

COURSE CONTENT No. of hours:36

UNIT I: Introduction
Concept and definition, Internal and external threats to data, Impersonation attack, MITM attack, DDoS Attack,
need and types of Intrusion Detection Systems (IDS), information sources for
IDS [5 hrs]

UNIT II: Intrusion Detection Techniques

Host based IDS, Network based IDS, Information Sources for IDS, Host and Network Vulnerabilities and
Countermeasures, Intrusion detection techniques, misuse detection, pattern matching, rule-based and state-based
anomaly detection, statistical based, machine learning based, data mining based hybrid
detection. [10 hrs]

UNIT III: IDS and IPS Architecture

Single-tiered, Multi-tiered, Peer-to-Peer, sensor functions, sensor deployment and security, agent functions, agent
deployment and security, manager functions, manager deployment and security, information flow in IDS and IPS,
defending IDS/IPS, Case study on commercial and open-source
IDS. [8 hrs]

UNIT IV: Firewall Introduction

Definition and need of firewall, characteristics, types, advantages and disadvantages, location and
configuration [6 hrs]

UNIT V: Building Firewalls

Firewall architectures, firewall Design, packet Filtering, proxy systems, VPN, pttp, peer-to-peer networking, firewall
testing, hosting of firewalls in Linux and Windows [7 hrs]

[7 hrs]

33
 34

SUGGESTED READINGS

• Carl Endorf, Eugene Schultz and Jim Mellander, “Intrusion Detection & Prevention”, Tata McGraw-Hill,
2004.
• Elizabeth D. Zwicky, Simon Cooper & D. Brent Chapman , “Building Internet Firewalls“ O’Reilly
• Ali A. Ghorbani, Network intrusion detection and prevention concepts and techniques, Springer

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

Advance 3 0 2 15 15 40 15 15 Computer
ITITE02 ED 4
Computer Networks
Networks

COURSE OUTCOMES (COs)

By the end of the course students will be able to:
CO1: Describe IP addressing for the given network.
CO2: Choose relevant routing protocol in the given network situation.
CO3: Compare Dynamic Routing and Static Routing on the given aspect.
CO4: Analyze techniques/algorithms to solve different layers problems and issues in computer networks.
CO5: To understand the evolution of networks and their technologies and analyse the issues.

COURSE CONTENT No. of hours:36

Unit 1
Network Layer Services
Mobile IP: Addressing, Agents, Inefficiency in Mobile IP.
Virtual Private Network: VPN Technology.
IPv6 Addressing: Representation, Address Space, Address Space Allocation, Autoconfiguration.
Transition from IPv4 to IPv6, IPv6 protocol: Packet Format, Header Extension.
[7 hrs]

Unit 2
Unicast and Multicast Routing Protocols
Introduction: Inter-domain, Intradomain Routing.
Routing Algorithms: Distance Vector Routing, Bellman-Ford algorithm, Link State Routing, Path Vector
Routing.
Unicast Routing Protocols: Internet Structure, Routing Information Protocol (RIP), Open Shortest Path First
(OSPF), Border Gateway Protocol Version 4 (BGP)
Intradomain Multicast Protocols: Multicast Distance Vector (DVMRP), Multicast Link State
(MOSPF).
[8 hrs]

Unit 3
Local Area Network Technologies (Wired and Wireless LAN):
Fast Ethernet, Gigabit Ethernet, IEEE 802.11 WLAN, Need of WLAN, Limitations and challenges of WLAN,
WLAN Transmission Mode: Infrared, Radio and Microwave, Topology: BSS and ESS, Hidden and Exposed Station

34
 35

Problems and their solutions, Medium Access Control, Four way handshake protocol, Frame format of IEEE 802.11,
WLAN Security, VLANS [7 hrs]

Unit 4

Security and QoS

Quality of Service Mechanisms, Message Confidentiality: Symmetric-Key Cryptography, Asymmetric-Key

Cryptography, Message Integrity, Message Authentication: MAC, Digital Signature, Key Management, Types of
attacks. [7 hrs]

Unit 5

Evolution of Networks

Introduction to Cellular Networks, Ad hoc Networks, Wireless Sensor Networks, Delay Tolerant Networks,
Opportunistic Networks, Cognitive Radio Networks, Internet of Things (IoT), Introduction to Cloud Computing
(Fog/Edge), Optical networks, Quantum networking, Complex networks.

SUGGESTED READINGS:
1. Natalia Olifer, Victor Olifer, “Computer networks, Principles, Technologies and protocols for network Design”,
Wiley.
2. B.M. Harwani, ”Advanced Computer Network”, Dreamtech.
3. Forouzan, “Data Communication and Networking”, TMH, 5th Edition.
4. A.S. Tanenbaum, “Computer Networks”, PHI, 4th Edition.
5. Comer, “Computer Networks and Internet”, PHI.
6. Comer, “Internetworking with TCP/IP”, PHI.

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

Cloud 3 0 2 15 15 40 15 15 Computer
ITITE03 ED 4
Computing Networks

COURSE OUTCOMES (COs)

By the end of the course students will be able to:
CO1: Describe the concept of cloud computing, its quality issues, services, applications, benefits and limitations.
CO2: Classify the different types of Deployment and Service models of cloud computing.
CO3: Discover the underlying technologies that drive a cloud computing environment.
CO4: Analyze various security concern in Cloud computing.
CO5: Evaluate the cloud deployment and service models and their failure considerations.
COURSE CONTENT No. of hours:38

Unit 1
Cloud Computing Fundamentals: Need of Cloud Computing, NIST Definition of Cloud Computing, Principles
of Cloud computing, Cloud Ecosystem, Requirements for Cloud Services, Cloud Application, Benefits and
Drawbacks, Vendors of Cloud Computing, Cloud Architecture, Anatomy of the Cloud, Network Connectivity in
35
 36

Cloud Computing, Managing the Cloud, Migrating Application to Cloud.

[8 hrs]

Unit 2
Cloud Deployment and Service Models: Private cloud, Public cloud, Community Cloud, Hybrid Cloud, Managed
Cloud, Virtual Private Cloud, Cloud Service Models: SaaS, PaaS and IaaS, Comparison of Cloud Service Models
their Architecture and Working, Advantages and disadvantage of service models over traditional software and
hardware, Cloud Economics, service-level agreements (SLAs): Role and Management of SLA, Types of SLA,
SLA Lifecycle. [8 hrs]

Unit 3
Virtualization: Introduction to Virtualization, Virtualization Opportunities, Approaches to Virtualization,
Hypervisors, Advantages and Downsides of Virtualization, Virtualization Security Threats and Recommendations,
Virtualization and Cloud Computing, Introduction to containerization.
[7 hrs]

Unit 4
Cloud Security: Security Concern in Cloud, Security Issues: Threat, Vulnerability and Risk, Threats to Cloud
Security, Infrastructure Security, Host level security, Application-Level Security, Information Security, Identity
Management and Access Control, Models for Access Control, Cloud Security Design Principles, Security-as-a-
Service, Policy Design and Cloud security.
[7 hrs]

Unit 5
Load Balancing: Importance of Load Balancing in Cloud Computing, Goals of Load Balancing, Categories of
Load Balancing, Parameters for Load Balancing, Load Balancing Algorithms, The Persistence Issue.
Advanced Concepts in Cloud Computing: Mobile cloud computing, Media Cloud, Green Cloud, Introduction to
Fog Computing. [8 hrs]

SUGGESTED READINGS:
1. K. Chandrasekaran, “Essentials of Cloud Computing,” CRC Press.
2. Shailendra Singh, "Cloud Computing", Oxford University Press.
3. Sandeep Bhowmik, "Cloud Computing", Cambridge University Press.
4. U.S. Pandey, Kavita Choudhary, “Cloud Computing", S. Chand.
5. R. Buyya, C. Vecchiola, S.T. Selvi, “Mastering Cloud Computing", Morgan Kaufmann.

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

Image 3 0 2 15 15 40 15 15 Computer
ITITE04 ED 4
Analytics Graphics
Course Outcomes(COs)
CO1: A comprehensive understanding of pixel connectivity, digital image and components.
CO2: Explain the concept of different image processing algorithms.
CO3: Represent different techniques for extraction and representation of image features.
CO4: Use the appropriate techniques for object detection and segmentation algorithms.
CO5: Apply image for measurements, recognition and analysis.

36
 37

COURSE CONTENT No. of hours:40

Unit I: Introduction to Pixel connectivity and Image: Digitization of image, Digital image, image formation, Image
formats, Image analysis applications, Relation and connectivity of pixels, Adjacency of pixels, Distance measures,
Connected Components, Connected Component Algorithm. [8 hrs]

Unit II: Image enhancement and filtering: Grey level transformation, Contrast stretching, Bit plane slicing and
data hiding, Image zooming and shrinking, Histogram equalization, Histogram Specification, Image arithmetic,
Image filtering: Smoothing, sharpening filters, Image noise and de-noising. [8 hrs]

Unit III: Extraction of Image features: Image features, Edge Detection and analytics, Representation and
Description, Representation Schemes, Boundary Descriptors, Regional Descriptors, Image morphology. [8 hrs]

Unit IV: Image analysis and thresholding: Detection and Segmentation, Thresholding in images for segmentation
and motion estimation, Image classification, object identification and recognition, image search, object detection
techniques. [8 hrs]

Unit V: Image Understanding: Template matching by Correlation, stereo vision and depth measurements,
evaluate and measure texture information, human action recognition, Visual cryptography, texture analysis,
Dimensionality reduction, Data Compression, matching and recognition, Applications [8 Hrs]

Text Books:
[T1] Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson Education 2003.
[T2] Richard Szelisk, Computer Vision: Algorithms and Applications

References:
[R1] William K Pratt, Digital Image Processing John Willey (2001).
[R2] A.K. Jain, PHI, New Delhi (1995)-Fundamentals of Digital Image Processing.
[R3] Jerome H. Friedman, Robert Tibshirani, and Trevor Hastie, The Elements of Statistical Learning

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

Data ware 3 0 2 15 15 40 15 15 Data Base

ITITE05 ED 4
house and Management
data mining System
COURSE OUTCOMES (COs)
By the end of the course students will be able to:
CO1: Identify the basic principles, concepts and applications of data warehousing and data mining.
CO2: Choose the task of data mining as an important phase of knowledge recovery process.
CO3: Compare Conceptual, Logical, and Physical design of Data Warehouses OLAP applications and OLAP
deployment and design a data warehouse or data mart to present information needed by management in a form that
is usable for management client.
CO4: Analyze concepts that provide the foundation of data mining.
CO5: Design and develop Data Mining algorithms for classification applications.

COURSE CONTENT No. of hours:40

Unit 1
Introduction
37
 38

Introduction to Data Warehousing: Overview, Difference between Database System and Data Warehouse, The
Compelling Need for data warehousing, Data warehouse – The building Blocks: Defining Features, data
warehouses and data marts, overview of the components, Three tier architecture, Metadata in the data warehouse.
Data pre-processing: Data cleaning, Data gateway, Synchronization of databases, Data transformation and ETL
Process, ETL tools, interoperability of data and applications.
[7 hrs]

Unit 2
Dimensional Modelling
Defining the business requirements: Dimensional analysis, information packages – a new concept, requirements
gathering methods, requirements definition: scope and content.
Principles of Dimensional Modelling: Objectives, From Requirements to data design, Multi-Dimensional Data
Model, Schemas: the STAR schema, the Snowflake schema, fact constellation schema. [8 hrs]

Unit 3
OLAP in the Data Warehouse: Demand for Online Analytical Processing, limitations of other analysis methods-
OLAP is the answer, OLAP definitions and rules, OLAP characteristics, major features and functions, hyper cubes.
OLAP Operations: Drill-down and roll-up, slice-and-dice , pivot or rotation, OLAP models, overview of variations, the
MOLAP model, the ROLAP model, the DOLAP model, ROLAP versus MOLAP, OLAP implementation considerations.
Query and Reporting, Executive Information Systems (EIS), Data Warehouse and Business Strategy.
Advanced Data warehouse Techniques: Document oriented NoSQL Databases- MangoDB, CouchDB; Graph Databases-
Neo4J, Infinite Graph.
[8 hrs]

Unit 4
Introduction to Data Mining
Data Mining Basics: What is Data Mining, Data Mining Defined, The knowledge discovery process (KDD
Process), Data Mining Applications- The Business Context of Data Mining, Data Mining for Process Improvement,
Data Mining as a Research Tool, Data Mining for Marketing, Benefits of data mining,
Major Data Mining Techniques: Classification and Prediction: Issues Regarding Classification and Prediction,
Classification by Decision Tree Induction, KNN Algorithm. [9 hrs]

Unit 5
Data Mining Algorithms
Cluster detection, K- means Algorithm, Outlier Analysis, memory-based reasoning, link analysis, Mining
Association Rules in Large Databases: Association Rule Mining, genetic algorithms, neural networks, Data mining
tools. [8 hrs]
[8 hrs]

SUGGESTED READINGS:
1. Paul Raj Poonia, “Fundamentals of Data Warehousing”, John Wiley & Sons.
2. Kamber and Han, “Data Mining Concepts and Techniques”, Hart Court India P. Ltd. Elsevier Publications
Second Edition.
3. W. H. Inmon, “Building the operational data store”, 2nd Ed., John Wiley.
4. “Data Warehousing”, BPB Publications.
5. Pang- Ning Tan, Michael Steinbach, Viach, Vipin Kumar, Introduction to Data Mining, Pearson.
6. Shmueli, “Data Mining for Business Intelligence : Concepts, Techniques and Applications in Microsoft Excel
with XLMiner”,Wiley Publications.

38
 39

Course Pre-
Type Subject L T P Credits CA MS ES PCA PES
Code Requisites

Soft 3 0 2 15 15 40 15 15 Design and

ITITE06 ED 4
Computing Analysis of
Algorithm

COURSE OUTCOMES (COs)

By the end of the course students will be able to:
CO1: Identify and describe soft computing techniques and their roles in building intelligent machines.
CO2: Choose the feasibility of applying a soft computing methodology for a particular problem.
CO3: Compare solutions by various soft computing approaches for a given problem.
CO4: Analyze existing software tools to solve real problems using a soft computing approach.
CO5: Design and develop certain scientific and commercial application using computational neural network models,
fuzzy models, evolutionary algorithms for optimization, learning, and design of intelligent systems in specified
applications.
COURSE CONTENT No. of hours:40

Unit 1
Introduction
Neural networks: definition, advantage of neural networks, Applications scope of neural networks, fuzzy logic,
hybrid systems: neuro-fuzzy, Soft computing
Artificial neural network
Fundamental concept: ANN, biological NN, brain vs. computer, evolution of neural networks, basic models of ANN:
connections, learning, activation functions, important terminologies of ANNs: weights, bias, threshold, learning rate,
momentum factor, vigilance parameter, notations, Mc-Culloch –pitts neuron: theory, architecture, linear separability,
Introduction to Deep neural network: CNN and RNN. [8 hrs]

Unit 2
Supervised and Unsupervised learning network
Introduction, perceptron networks: theory, perceptron learning rule, architecture, flowchart for training process,
single output class, multiple output class, network testing algorithm, adaptive linear neuron: theory, delta rule for
single output unit, architecture, multiple adaline linear neurons: theory, architecture, back propagation network:
theory, architecture, flowchart for training process, training algorithm, learning factors, testing algorithms, Hebb
network: theory, flowchart of training algorithm, training algorithm, K-mean clustering.
[8
hrs]

Unit 3
Fuzzy Logic and Fuzzy Relations: Introduction to Fuzzy sets , Crisp vs Fuzzy Sets, Types of Fuzzy sets, Operations
on Fuzzy Sets, Membership functions: Triangular membership function, Trapezoidal membership function, generalized
bell membership, Sigmoidal and Gaussian distribution.

Fuzzy Relations: Introduction to fuzzy relations, Fuzzification, Membership value assignment, development of rule
base and decision making system, Defuzzification to crisp sets, Defuzzification methods: Center of Sums Method
(COS), Center of gravity (COG) / Centroid of Area (COA) Method, Center of Area / Bisector of Area Method
(BOA), Weighted Average Method, Maxima Methods- First of Maxima Method (FOM), Last of Maxima Method
(LOM), Mean of Maxima Method (MOM), Introduction to Bert techniques and Computing with
39
 40

words. [12
hrs]

Unit 4
Introduction to Evolutionary algorithms, Genetic Algorithm: Introduction to Selection, Proportional Selection,
Tournament Selection, Rank-based Selection, Boltzmann Selection, A comparison of Selection Mechanisms, Selection
pressure, Exploration and exploitation, Introduction to Search Operators, Mutation Operators, Recombination, learning
of neural network using genetic algorithm. [7 hrs]

Unit 5
Multiobjective Optimization, Introduction to nature inspired metaheuristic algorithms: Swarm Intelligence -Particle
Swarm Optimization and its variants, Artificial Bee Colony Optimization algorithm. [5 Hrs]

SUGGESTED READINGS:
1. “Principles of soft Computing”: Sivanandam and Deepa : Wiley India edition.
2. "Neural Network, Fuzzy Logic, and Genetic Algorithms - Synthesis and Applications", by S. Rajasekaran and G.A.
Vijayalaksmi Pai, (2005), Prentice Hall, Chapter 1-15, page 1-435.
3. “Soft Computing and Intelligent Systems - Theory and Application”, by Naresh K. Sinha and Madan M. Gupta
(2000), Academic Press, Chapter 1-25, page 1-625.
4. “Genetic algorithms in search, optimization, and machine learning”, by David E. Goldberg, Pearson Education.

40