MCA - Second - Year - Detailed - Syllabus - 2021 - 22 Final

MASTER
M O COMPU
OF UTER APPL
LICATION
N (MCA)
DR
R. A.P.JJ. ABDU
UL KAL
LAM TECHN
T NICAL
UNIV
VERSITTY, UTT TAR PR
RADES
SH, LUC
CKNOWW
EVA
ALUAT
TION SC
CHEME
E & SYL
LLABU
US
FOR
MAS
STER OF
F COM
MPUTERR APPLICATIO
ON
(M
MCA)
Two Year Coourse)

(T
AS PER
AICTE
E MODE
EL CUR
RRICUL
LUM
[E
Effectivee from the
t Sesssion: 20
021-22]
Curricculum & Evalluation Schem

me MCA(III & IV semesteer) Pagee 1
MASTER OF COMPUTER APPLICATION (MCA)
MCA SECOND YEAR, 2021-22
SEMESTER-III
S. No. Subject Subject Name Periods Sessional ESE Total Credit

Code L T P CT TA Total
1. KCA301 Artificial Intelligence 3 0 0 30 20 50 100 150 3
2. KCA302 Software Engineering 4 0 0 30 20 50 100 150 4
3. KCA303 Computer Network 3 1 0 30 20 50 100 150 4
4. Elective – 1 3 0 0 30 20 50 100 150 3
5. Elective – 2 3 1 0 30 20 50 100 150 3
6. KCA351 Artificial Intelligence Lab 0 0 3 30 20 50 50 100 2
7. KCA352 Software Engineering Lab 0 0 3 30 20 50 50 100 2
8. KCA353 Mini Project** 0 0 4 30 20 50 50 100 2
Total 1050 23
CT: Class Test TA: Teacher Assessment L/T/P: Lecture/ Tutorial/ Practical
SEMESTER-IV
S. No. Subject Subject Name Periods Sessional ESE Total Credit

Code L T P CT TA Total
1. Elective – 3 3 0 0 30 20 50 100 150 3
2. Elective – 4 3 0 0 30 20 50 100 150 3
3. Elective – 5 3 0 0 30 20 50 100 150 3
4. KCA451 Project - - - - 200 200 500 700 14
Total 1050 23
CT: Class Test TA: Teacher Assessment L/T/P: Lecture/ Tutorial/ Practical
** The Mini Project (6 weeks) conducted during summer break after II semester and will be assessed
during III semester. The Course will be carried out at the Institute under the guidance of a Faculty
Members.
Elective-1 KCA011 Cryptography & Network Security

KCA012 Data Warehousing & Data Mining
KCA013 Software Project Management
KCA014 Cloud Computing
KCA015 Compiler Design
Elective-2 KCA021 Web Technology

KCA022 Big Data
KCA023 Simulation & Modeling
KCA024 Software Testing & Quality Assurance
KCA025 Digital Image Processing
Curriculum & Evaluation Scheme MCA(III & IV semester) Page 2

Elective-3 KCA031 Privacy & Security in Online Social Media

KCA032 Soft Computing
KCA033 Pattern Recognition
KCA034 Data Analytics
KCA035 Software Quality Engineering
Elective-4 KCA041 Blockchain Architecture

KCA042 Neural Network
KCA043 Internet of Things
KCA044 Modern Application Development
KCA045 Distributed Database Systems
Elective-5 KCA051 Mobile Computing

KCA052 Computer Graphics and Animation
KCA053 Natural Language Processing
KCA054 Machine Learning
KCA055 Quantum Computing

SECOND YEAR SYLLABUS

SEMESTER-III

KCA301: Artificial Intelligence
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
CO 1 Define the meaning of intelligence and study various intelligent agents. K1
CO 2 Understand, analyze and apply AI searching algorithms in different problem K2 , K3, K4
domains.
CO 3 Study and analyze various models for knowledge representation. K1, K3
CO 4 Understand the basic concepts of machine learning to analyze and implement K2 , K4, K6
widely used learning methods and algorithms.
CO 5 Understand the concept of pattern recognition and evaluate various K2 , K5
classification and clustering techniques
DETAILED SYLLABUS 3-0-0
Unit Topic Proposed
Lecture
I Artificial Intelligence: Introduction to artificial intelligence, Historical 08
development and foundation areas of artificial intelligence, Tasks and
application areas of artificial intelligence. Introduction, types and structure of
intelligent agents, Computer Vision, Natural language processing.
II Searching Techniques: Introduction, Problem solving by searching, Searching 08
for solutions, Uniformed searching techniques, Informed searching techniques,
Local search algorithms, Adversarial search methods, Search techniques used
in games, Alpha-Beta pruning.
III Knowledge Representation and Reasoning: Propositional logic, Predicate 08
logic, First order logic, Inference in first order logic, Clause form conversion,
Resolution. Chaining- concept, forward chaining and backward chaining,
Utility theory and Probabilistic reasoning, Hidden Markov model, Bayesian
networks.
IV Machine Learning: Introduction, types and application areas, Decision trees, 08
Statistical learning methods, Learning with complete data - concept and Naïve
Bayes models, Learning with hidden data- concept and EM algorithm,
Reinforcement learning.
V Pattern Recognition: Introduction and design principles, Statistical pattern 08
recognition, Parameter estimation methods - Principle component analysis and
Linear discrimination analysis, Classification techniques - Nearest neighbor
rule and Bayes classifier, K-means clustering, Support vector machine.
Suggested Readings:
1. Russell S. and Norvig P., “Artificial Intelligence – A Modern Approach”, Pearson Education.
2. Rich E. and Knight K., “Artificial Intelligence”, McGraw Hill Publications.
3. Charnik E. and McDermott D., “Introduction to Artificial Intelligence”, Pearson Education.
4. Patterson D. W., “Artificial Intelligence and Expert Systems”, Prentice Hall of India
Publications.
5. Khemani D., “A First Course in Artificial Intelligence”, McGraw Hill.
6. Winston P. H., “Artificial Intelligence”, Pearson Education.
7. Thornton C. and Boulay B.,” Artificial Intelligence- Strategies, Applications and Models through
Search”, New Age International Publishers.

KCA302: Software Engineering

Course Outcome ( CO) Bloom’s Knowledge Level (KL)
CO 1 Explain various software characteristics and analyze different software K1, K2
Development Models.
CO 2 Demonstrate the contents of a SRS and apply basic software quality K1, K2
assurance practices to ensure that design, development meet or exceed
applicable standards.
CO 3 Compare and contrast various methods for software design. K2, K3
CO 4 Formulate testing strategy for software systems, employ techniques such
as unit testing, Test driven development and functional testing. K3
CO 5 Manage software development process independently as well as in
teams and make use of various software management tools for K5
development, maintenance and analysis.
Unit Topic Proposed
Lecture
I Introduction: Introduction to Software Engineering, Software 08
Components, Software Characteristics, Software Crisis, Software
Engineering Processes, Similarity and Differences from Conventional
Engineering Processes, Software Quality Attributes. Software
Development Life Cycle (SDLC) Models: Water Fall Model, Prototype
Model, Spiral Model, Evolutionary Development Models, Iterative
Enhancement Models.
II Software Requirement Specifications (SRS): Requirement 08
Engineering Process: Elicitation, Analysis, Documentation, Review and
Management of User Needs, Feasibility Study, Information Modelling,
Data Flow Diagrams, Entity Relationship Diagrams, Decision Tables,
SRS Document, IEEE Standards for SRS. Software Quality Assurance
(SQA): Verification and Validation, SQA Plans, Software Quality
Frameworks, ISO 9000 Models, SEI-CMM Model.
III Software Design: Basic Concept of Software Design, Architectural 08
Design, Low Level Design: Modularization, Design Structure Charts,
Pseudo Codes, Flow Charts, Coupling and Cohesion Measures, Design
Strategies: Function Oriented Design, Object Oriented Design, Top-
Down and Bottom-Up Design. Software Measurement and Metrics:
Various Size Oriented Measures: Halestead’s Software Science,
Function Point (FP) Based Measures, Cyclomatic Complexity Measures:
Control Flow Graphs.
IV Software Testing: Testing Objectives, Unit Testing, Integration 08
Testing, Acceptance Testing, Regression Testing, Testing for
Functionality and Testing for Performance, Top Down and Bottom- Up
Testing Strategies: Test Drivers and Test Stubs, Structural Testing
(White Box Testing), Functional Testing (Black Box Testing), Test Data
Suit Preparation, Alpha and Beta Testing of Products. Static Testing
Strategies: Formal Technical Reviews (Peer Reviews), Walk Through,

Code Inspection, Compliance with Design and Coding Standards.
V Software Maintenance and Software Project Management: 08
Software as an Evolutionary Entity, 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, An Overview of CASE
Tools. Estimation of Various Parameters such as Cost,
Efforts, Schedule/Duration, Constructive Cost Models (COCOMO),
Resource Allocation Models, Software Risk Analysis and
Management.
Suggested Readings:
1. R S Pressman, “Software Engineering: A Practitioners Approach”, McGraw Hill.
2. Pankaj Jalote, “Software Engineering”, Wiley
3. Rajib Mall, “Fundamentals of Software Engineering”, PHI Publication.
4. K K Aggarwal and Yogesh Singh, “Software Engineering”, New Age International
Publishers.
5. Ghezzi, M. Jarayeri, D. Manodrioli, “Fundamentals of Software Engineering”, PHI
Publication.
6. Ian Sommerville, “Software Engineering”, Addison Wesley.
7. Kassem Saleh, “Software Engineering”, Cengage Learning
8. Pfleeger, “Software Engineering”, Macmillan Publication

KCA303: Computer Networks

CO 1 Describe communication models TCP/IP, ISO-OSI model, network K2
topologies along with communicating devices and connecting media.
CO 2 Apply knowledge of error detection, correction and learn concepts of K3
flow control along with error control.
CO 3 Classify various IP addressing techniques, subnetting along with K4
network routing protocols and algorithms.
CO 4 Understand various transport layer protocols and their design K2
considerations along with congestion control to maintain Quality of
Service.
CO 5 Understand applications-layer protocols and elementary standards of K2
cryptography and network security.
Unit Topic Proposed
Lecture
Data Communications: Introduction: Data communication
Components and characteristics, Data representation and Data flow.
Networks: LAN, WAN, MAN, Topologies.
Protocols and Standards: ISO-OSI model and TCP-IP Model.
I 08
Network Connecting Devices: HUB, Bridge, Switch, Router and
Gateways.
Transmission Media: Guided and unguided Media
Classification and Arrangement: Wired LANs and Wireless LANs
Data Link Layer:
Error Detection and Error Correction: Types of errors, LRC, VRC,
Checksum, CRC, and Hamming Code.
Flow Control and Error Control: Stop and Wait Protocol, Sliding
II Window, Go-back-N-ARQ Protocol and Selective-Repeat ARQ 08
Protocol.
Channel Allocation Protocols: Random Access, Controlled and
Channelization techniques such as ALOHA, CSMA, CSMA/CD,
CDMA/CA, TDMA, FDMA, Token Passing, etc.
Network Layer:
Switching Techniques: Circuit Switching, Packet Switching, and
Message Switching.
Logical addressing: IPv4 and IPv6 Address schemes, Classes and
III subnetting 08
Network Layer Protocols: ARP, RARP, BOOTP and DHCP
Routing Techniques: Interdomain and Intradomain routing with
examples.
Transport Layer:
IV 08
Introduction to Transport Layer: Process-to-Process Delivery:

Reliable and unreliable Connection, Port and Socket Addressing
Transport Layer Protocols with packet formats: User Datagram
Protocol (UDP), Transmission Control Protocol (TCP), Stream Control
Transmission Protocol (SCTP).
Congestion Control: Techniques for handling the Congestion Control.
Quality of Service (QoS): Flow Characteristics and techniques to
improve QoS.
Application Layer:
Basic Concept of Application Layer: Domain Name System, World
Wide Web, Hyper Text Transfer Protocol, Electronic mail, File Transfer
V Protocol, Remote login. 08
Introduction to Cryptography: Definition, Goal, Applications,
Attacks, Encryption, decryption, public-key and private key
cryptography.
Suggested Readings:
1. Behrouz Forouzan, “Data Communication and Networking”, McGraw Hill
2. Andrew Tanenbaum “Computer Networks”, Prentice Hall.
3. William Stallings, “Data and Computer Communication”, Pearson.
4. Kurose and Ross, “Computer Networking- A Top-Down Approach”, Pearson.
5. Peterson and Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann
6. W. A. Shay, “Understanding Communications and Networks”, Cengage Learning.
7. D. Comer, “Computer Networks and Internets”, Pearson.
8. Behrouz Forouzan, “TCP/IP Protocol Suite”, McGraw Hill.

ELECTIVE-1

KCA011: Cryptography & Network Security
CO 1 Understand various security attacks and their protection mechanism. K2
CO 2 Apply and analyze various encryption algorithms. K3, K4
CO 3 Understand functions and algorithms to authenticate messages and study and K1, K2, K3
apply different digital signature techniques.
CO 4 Analyze different types of key distributions. K4
CO 5 Study and appraise different IP and system security mechanism. K1, K5
Unit Topic Proposed
Lecture
I Introduction to security attacks, Services and mechanism, Classical encryption
techniques substitution ciphers and transposition ciphers, Cryptanalysis,
Steganography, Stream and block ciphers.
Modern Block Ciphers: Block ciphers principles, Shannon’s theory of 08
confusion and diffusion, Feistel structure, Data encryption standard(DES),
Strength of DES, Idea of differential cryptanalysis, Block cipher modes of
operations, Triple DES
II Introduction to group, field, finite field of the form GF(p), Modular arithmetic,
Prime and relative prime numbers, Extended Euclidean Algorithm, Advanced
Encryption Standard (AES). 08
Fermat’s and Euler’s theorem, Primality testing, Chinese Remainder theorem,
Discrete Logarithmic Problem, Principals of public key crypto systems, RSA
algorithm, Security of RSA
III Message Authentication Codes: Authentication requirements, Authentication
functions, Message authentication code, Hash functions, Birthday attacks,
Security of hash functions, Secure hash algorithm (SHA). 08
Digital Signatures: Digital Signatures, Elgamal Digital Signature Techniques,
Digital signature standards (DSS), Proof of digital signature algorithm.
IV Key Management and distribution: Symmetric key distribution, Diffie-
Hellman Key Exchange, Public key distribution, X.509 Certificates, Public key
Infrastructure. 08
Authentication Applications: Kerberos Electronic mail security: pretty good
privacy (PGP), S/MIME.
V IP Security: Architecture, Authentication header, Encapsulating security
payloads, Combining security associations, Key management.
Introduction to Secure Socket Layer, Secure electronic transaction (SET). 08
System Security: Introductory idea of Intrusion, Intrusion detection, Viruses
and related threats, firewalls.
Suggested Readings:
1. Stallings W., “Cryptography and Network Security: Principals and Practice”, Pearson
Education.
2. Frouzan B. A., “Cryptography and Network Security”, McGraw Hill.
3. Kahate A., “Cryptography and Network Security”, Tata McGraw Hill.

KCA012: Data Warehousing & Data Mining

CO1 Demonstrate knowledge of Data Warehouse and its components. K1, K2
CO2 Discuss the process of Warehouse Planning and Implementation. K1, K2
CO3 Discuss and implement various supervised and Non supervised learning K6
algorithms on data.
CO4 Explain the various process of Data Mining and decide best according to K2, K5
type of data.
CO5 Explain process of knowledge discovery in database (KDD). Design Data K2, K5
Mining model.
Unit Topic Proposed
Lecture
I Data Warehousing: Overview, Definition, Data Warehousing
Components, Building a Data Warehouse, Warehouse Database, Mapping 08
the Data Warehouse to a Multiprocessor Architecture, Difference between
Database System and Data Warehouse, Multi Dimensional Data Model,
Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept.
II Data Warehouse Process and Technology: Warehousing Strategy,
Warehouse /management and Support Processes, Warehouse Planning and
Implementation, Hardware and Operating Systems for Data Warehousing, 08
Client/Server Computing Model & Data Warehousing. Parallel Processors
& Cluster Systems, Distributed DBMS implementations, Warehousing
Software, Warehouse Schema Design
III Data Mining: Overview, Motivation, Definition & Functionalities, Data
Processing, Form of Data Pre-processing, Data Cleaning: Missing Values,
Noisy Data, (Binning, Clustering, Regression, Computer and Human 08
inspection), Inconsistent Data, Data Integration and Transformation. Data
Reduction:-Data Cube Aggregation, Dimensionality reduction, Data
Compression, Numerosity Reduction, Discretization and Concept
hierarchy generation, Decision Tree
IV Classification: Definition, Data Generalization, Analytical
Characterization, Analysis of attribute relevance, Mining Class
comparisons, Statistical measures in large Databases, Statistical-Based
Algorithms, Distance-Based Algorithms, Decision Tree-Based
Algorithms. 08
Clustering: Introduction, Similarity and Distance Measures, Hierarchical
and Partitional Algorithms. Hierarchical Clustering- CURE and
Chameleon. Density Based Methods DBSCAN, OPTICS. Grid Based
Methods- STING, CLIQUE. Model Based Method – Statistical Approach,
Association rules: Introduction, Large Item sets, Basic Algorithms,
Parallel and Distributed Algorithms, Neural Network approach.
V Data Visualization and Overall Perspective: Aggregation, Historical
information, Query Facility, OLAP function and Tools. OLAP Servers,
ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and
Recovery, Tuning Data Warehouse, Testing Data Warehouse.
Warehousing applications and Recent Trends: Types of Warehousing
Applications, Web Mining, Spatial Mining and Temporal Mining. 08
Suggested Readings:
1. Alex Berson, Stephen J. Smith “Data Warehousing, Data-Mining & OLAP”, TMH.
2. Mark Humphries, Michael W. Hawkins, Michelle C. Dy, “Data Warehousing:
Architecture and Implementation”, Pearson.
3. I.Singh, “Data Mining and Warehousing”, Khanna Publishing House.
4. Margaret H. Dunham, S. Sridhar,”Data Mining:Introductory and Advanced Topics”
Pearson Education 5. Arun K. Pujari, “Data Mining Techniques” Universities Press.
5. Pieter Adriaans, Dolf Zantinge, “Data-Mining”, Pearson Education

KCA013: Software Project Management
CO 1 Identify project planning objectives, along with various cost/effort estimation models. K3
CO 2 Organize & schedule project activities to compute critical path for risk analysis K3
CO 3 Monitor and control project activities. K4, K5
CO 4 Formulate testing objectives and test plan to ensure good software quality under SEI-
K6
CMM
CO 5 Configure changes and manage risks using project management tools. K2, K4
Unit Topic Proposed
Lecture
I Project Evaluation and Project Planning: Importance of Software Project
Management – Activities – Methodologies – Categorization of Software Projects – 08
Setting objectives – Management Principles – Management Control – Project
portfolio Management – Cost-benefit evaluation technology – Risk evaluation –
Strategic program Management – Stepwise Project Planning.
II Project Life Cycle and Effort Estimation: Software process and Process Models –
Choice of Process models – Rapid Application development – Agile methods – 08
Dynamic System Development Method – Extreme Programming– Managing
interactive processes – Basics of Software estimation – Effort and Cost
estimation techniques – COSMIC Full function points – COCOMO II – a Parametric
Productivity Model.
III Activity Planning and Risk Management: Objectives of Activity planning – Project
schedules – Activities – Sequencing and scheduling – Network Planning models –
Formulating Network Model – Forward Pass & Backward Pass techniques – Critical 08
path (CRM) method – Risk identification – Assessment – Risk Planning –Risk
Management – – PERT technique – Monte Carlo simulation – Resource Allocation
– Creation of Critical paths – Cost schedules.
IV Project Management and Control: Framework for Management and control –
Collection of data – Visualizing progress – Cost monitoring – Earned Value Analysis 08
– Prioritizing Monitoring – Project tracking – Change control Software
Configuration Management – Managing contracts – Contract Management.
V Staffing in Software Projects: Managing people – Organizational behavior – Best
methods of staff selection – Motivation – The Oldham – Hackman job 08
characteristic model – Stress – Health and Safety – Ethical and Professional
concerns – Working in teams – Decision making – Organizational structures –
Dispersed and Virtual teams – Communications genres – Communication plans –
Leadership.
Suggested Readings:
1. Bob Hughes, Mike Cotterell and Rajib Mall: “Software Project Management” – Fifth
Edition, McGraw Hill,New Delhi, 2012.
2. Robert K. Wysocki ― “Effective Software Project Management” – Wiley Publication, 2011.
3. Walker Royce: ― “Software Project Management” - Addison-Wesley, 1998.
4. Gopalaswamy Ramesh, ― “Managing Global Software Projects” – McGraw Hill Education (India),
FourteenthReprint 2013.
5. Koontz Harold & Weihrich Heinz, "Essentials of Management", McGraw Hill 5thEdition 2008.
6. Robbins and Coulter, "Management", Prentice Hall of India, 9th edition.
7. James A. F., Stoner, "Management", Pearson Education Delhi.
8. P. D. Chaturvedi, "Business Communication", Pearson Education.

KCA014: Cloud Computing

CO 1 Understand the concepts of Cloud Computing, key technologies, K1 , K2
strengths and limitations of cloud computing.
CO 2 Develop the ability to understand and use the architecture to compute K1, K3
and storage cloud, service and models.
CO 3 Understand the application in cloud computing. K4, K5
CO 4 Learn the key and enabling technologies that help in the development of K3, K4
cloud.
CO 5 Explain the core issues of cloud computing such as resource K2, K6
management and security.
Unit Topic Proposed
Lecture
I Introduction: Cloud Computing – Definition of Cloud – Evolution of 08
Cloud Computing – Underlying Principles of Parallel and Distributed,
History of Cloud Computing - Cloud Architecture - Types of Clouds -
Business models around Clouds – Major Players in Cloud Computing-
issues in Clouds - Eucalyptus - Nimbus - Open Nebula, CloudSim.
II Cloud Services: Types of Cloud services: Software as a Service- 08
Platform as a Service –Infrastructure as a Service - Database as a
Service - Monitoring as a Service –Communication as services. Service
providers- Google, Amazon, Microsoft Azure, IBM, Sales force.
III Collaborating Using Cloud Services: Email Communication over the 08
Cloud - CRM Management – Project Management-Event Management -
Task Management – Calendar - Schedules - Word Processing –
Presentation – Spreadsheet - Databases – Desktop - Social Networks and
Groupware.
IV Virtualization for Cloud: Need for Virtualization – Pros and cons of 08
Virtualization – Types of Virtualization –System VM, Process VM,
Virtual Machine monitor – Virtual machine properties - Interpretation
and binary translation, HLL VM - supervisors – Xen, KVM, VMware,
Virtual Box, Hyper-V.
V Security, Standards and Applications: Security in Clouds: Cloud 08
security challenges – Software as a Service Security, Common
Standards: The Open Cloud Consortium – The Distributed management
Task Force – Standards for application Developers – Standards for
Messaging – Standards for Security, End user access to cloud
computing, Mobile Internet devices and the cloud.
Hadoop – MapReduce – Virtual Box — Google App Engine –
Programming Environment for Google App Engine

Suggested Readings:
1. David E.Y. Sarna, “Implementing and Developing Cloud Application”, CRC press 2011.
2. Lee Badger, Tim Grance, Robert Patt-Corner, Jeff Voas, NIST, Draft cloud computing
synopsis and recommendation, May 2011.
3. Anthony T Velte, Toby J Velte, Robert Elsenpeter, “Cloud Computing : A Practical
Approach”, Tata McGraw-Hill 2010.
4. Haley Beard, “Best Practices for Managing and Measuring Processes for On-demand
Computing, Applications and Data Centers in the Cloud with SLAs”, Emereo Pty Limited,
July 2008.
5. G. J. Popek, R.P. Goldberg, “Formal requirements for virtualizable third generation
Architectures, Communications of the ACM”, No.7 Vol.17, July 1974

KCA015 : Compiler Design

At the end of course , the student will be able to:
Acquire knowledge of different phases and passes of the compiler and also able to use the K3, K6
CO 1 compiler tools like LEX, YACC, etc. Students will also be able to design different types of
compiler tools to meet the requirements of the realistic constraints of compilers.
Understand the parser and its types i.e. Top-Down and Bottom-up parsers and construction K2, K6
CO 2
of LL, SLR, CLR, and LALR parsing table.
Implement the compiler using syntax-directed translation method and get knowledge about K4, K5
CO 3
the synthesized and inherited attributes.
Acquire knowledge about run time data structure like symbol table organization and K2, K3
CO 4
different techniques used in that.
Understand the target machine’s run time environment, its instruction set for code K2, K4
CO 5
generation and techniques used for code optimization.
Unit Topic Propose
d
Lecture
Introduction to Compiler: Phases and passes, Bootstrapping, Finite state machines and
regular expressions and their applications to lexical analysis, Optimization of DFA-Based
I Pattern Matchers implementation of lexical analyzers, lexical-analyzer generator, LEX 08
compiler, Formal grammars and their application to syntax analysis, BNF notation,
ambiguity, YACC. The syntactic specification of programming languages: Context free
grammars, derivation and parse trees, capabilities of CFG.
Basic Parsing Techniques: Parsers, Shift reduce parsing, operator precedence parsing, top
down parsing, predictive parsers Automatic Construction of efficient Parsers: LR parsers,
II 08
the canonical Collection of LR(0) items, constructing SLR parsing tables, constructing
Canonical LR parsing tables, Constructing LALR parsing tables, using ambiguous
grammars, an automatic parser generator, implementation of LR parsing tables.
Syntax-directed Translation: Syntax-directed Translation schemes, Implementation of
Syntax-directed Translators, Intermediate code, postfix notation, Parse trees & syntax trees,
III three address code, quadruple & triples, translation of assignment statements, Boolean
08
expressions, statements that alter the flow of control, postfix translation, translation with a
top down parser. More about translation: Array references in arithmetic expressions,
procedures call, declarations and case statements.
Symbol Tables: Data structure for symbols tables, representing scope information. Run-
IV Time Administration: Implementation of simple stack allocation scheme, storage allocation 08
in block structured language. Error Detection & Recovery: Lexical Phase errors, syntactic
phase errors semantic errors.
Code Generation: Design Issues, the Target Language. Addresses in the Target Code,
Basic Blocks and Flow Graphs, Optimization of Basic Blocks, Code Generator. Code
optimization: Machine-Independent Optimizations, Loop optimization, DAG representation
V 08
of basic blocks, value numbers and algebraic laws, Global Data-Flow analysis.

Text books:
1. K. Muneeswaran,Compiler Design,First Edition,Oxford University Press.
2. J.P. Bennet, “Introduction to Compiler Techniques”, Second Edition, Tata McGraw-Hill,2003.
3. Henk Alblas and Albert Nymeyer, “Practice and Principles of Compiler Building with C”, PHI, 2001.
4. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools”, Pearson Education
5. V Raghvan, “ Principles of Compiler Design”, TMH
6. Kenneth Louden,” Compiler Construction”, Cengage Learning.
7. Charles Fischer and Ricard LeBlanc,” Crafting a Compiler with C”, Pearson Education

ELECTIVE-2

KCA021: Web Technology

At the end of course, the student will be able to:
Apply the knowledge of HTML and CSS to develop web application and K3, K6
CO 1 analyze the insights of internet programming to implement complete
application over the web.
Understand, analyze and apply the role of JavaScript in the workings of the K2, K3
CO 2
web and web applications.
CO 3 Understand, analyze and build dynamic web applications using servlet and JSP. K2, K3
Develop Spring-based Java applications using Java configuration, XML K2, K4,K6
CO 4 configuration, annotation-based configuration, beans and their scopes, and
properties.
CO 5 Develop web application using Spring Boot and RESTFul Web Services K3, K6
Unit Topic Proposed
Lecture
Web Page Designing: Introduction and Web Development Strategies, History of
Web and Internet, Protocols Governing Web, HTML-Introduction, HTML Tags,
HTML-Grouping Using Div & Span, HTML-Lists, HTML-Images, HTML-
Hyperlink, HTML-Table, HTML-Iframe, HTML-Form, Introduction of CSS, CSS
I 08
Syntax, External Style Sheet using < link >, Multiple Style Sheets, Value Lengths
and Percentages, CSS-Selectors, CSS-Box Model, Floats, Clear, Introduction to
Bootstrap.
Scripting: Introduction to JavaScript, Creating Variables in JavaScript, Creating

Functions in JavaScript, UI Events, Returning Data from Functions, Working with
Conditions, looping in JavaScript, Block Scope Variables, Working with Objects,
II 08
Creating Object using Object Literals, Manipulating DOM Elements with
JavaScript
Web Application development using JSP & Servlets: Servlet Overview and
Architecture, Interface Servlet and the Servlet Life Cycle, Handling HTTP get
Requests, Handling HTTP post Requests, Redirecting Requests to Other
III Resources, Session Tracking, Cookies, Session Tracking with Http Session. Java 08
Server Pages (JSP): Introduction, Java Server Pages Overview, A First Java Server
Page Example, Implicit Objects, Scripting, Standard Actions, Directives, Custom
Tag Libraries.
Spring: Spring Core Basics-Spring Dependency Injection concepts, Introduction
to Design patterns, Factory Design Pattern, Strategy Design pattern, Spring
IV Inversion of Control, AOP, Bean Scopes- Singleton, Prototype, Request, Session, 08
Application, WebSocket, Auto wiring, Annotations, Life Cycle Call backs, Bean
Configuration styles
Spring Boot: Spring Boot- Spring Boot Configuration, Spring Boot Annotations,
Spring Boot Actuator, Spring Boot Build Systems, Spring Boot Code Structure,
V Spring Boot Runners, Logger, BUILDING RESTFUL WEB SERVICES, Rest 08
Controller, Request Mapping, Request Body, Path Variable, Request Parameter,
GET, POST, PUT, DELETE APIs, Build Web Applications

Text books:
1. Burdman, Jessica, “Collaborative Web Development” Addison Wesley
2. Xavier, C, “Web Technology and Design” , New Age International
3. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication
4. Bhave, “Programming with Java”, Pearson Education
6. Hans Bergsten, “Java Server Pages”, SPD O’Reilly
7. Naughton, Schildt, “The Complete Reference JAVA2”, TMH
8. Craig Walls, “Spring Boot in Action”

KCA022: Big Data
CO1 Demonstrate knowledge of Big Data Analytics concepts and its applications in K1, K2
business.
CO2 Demonstrate functions and components of Map Reduce Framework and HDFS. K1, K2
CO3 Develop queries in NoSQL environment. K6
CO4 Explain process of developing Map Reduce based distributed processing K2, K5
applications.
CO5 Explain process of developing applications using HBASE, Hive, Pig etc. K2,K5
Unit Topic Proposed
Lecture
I Introduction to Big Data: Types of digital data, history of Big Data innovation, 08
introduction to Big Data platform, drivers for Big Data, Big Data architecture and
characteristics, 5 Vs of Big Data, Big Data technology components, Big Data
importance and applications, Big Data features – security, compliance, auditing and
protection, Big Data privacy and ethics, Big Data Analytics, Challenges of
conventional systems, intelligent data analysis, nature of data, analytic processes
and tools, analysis vs reporting, modern data analytic tools.
II Hadoop: History of Hadoop, Apache Hadoop, the Hadoop Distributed File System, 08
components of Hadoop, data format, analyzing data with Hadoop, scaling out,
Hadoop streaming, Hadoop pipes, Hadoop Echo System.
Map-Reduce: Map-Reduce framework and basics, how Map Reduce works,
developing a Map Reduce application, unit tests with MR unit, test data and local
tests, anatomy of a Map Reduce job run, failures, job scheduling, shuffle and sort,
task execution, Map Reduce types, input formats, output formats, Map Reduce
features, Real-world Map Reduce
III HDFS (Hadoop Distributed File System): Design of HDFS, HDFS concepts, 08
benefits and challenges, file sizes, block sizes and block abstraction in HDFS, data
replication, how does HDFS store, read, and write files, Java interfaces to HDFS,
command line interface, Hadoop file system interfaces, data flow, data ingest with
Flume and Scoop, Hadoop archives, Hadoop I/O: Compression, serialization, Avro
and file-based data structures. Hadoop Environment: Setting up a Hadoop cluster,
cluster specification, cluster setup and installation, Hadoop configuration, security
in Hadoop, administering Hadoop, HDFS monitoring & maintenance, Hadoop
benchmarks, Hadoop in the cloud
IV Hadoop Eco System and YARN: Hadoop ecosystem components, schedulers, fair 08
and capacity, Hadoop 2.0 New Features – Name Node high availability, HDFS
federation, MRv2, YARN, Running MRv1 in YARN.
NoSQL Databases: Introduction to NoSQL MongoDB: Introduction, data types,
creating, updating and deleing documents, querying, introduction to indexing,
capped collections
Spark: Installing spark, spark applications, jobs, stages and tasks, Resilient
Distributed Databases, anatomy of a Spark job run, Spark on YARN
SCALA: Introduction, classes and objects, basic types and operators, built-in
control structures, functions and closures, inheritance.
V Hadoop Eco System Frameworks: Applications on Big Data using Pig, Hive and 08
HBase
Pig : Introduction to PIG, Execution Modes of Pig, Comparison of Pig with
Databases, Grunt, Pig Latin, User Defined Functions, Data Processing operators,
Hive - Apache Hive architecture and installation, Hive shell, Hive services, Hive

metastore, comparison with traditional databases, HiveQL, tables, querying data and
user defined functions, sorting and aggregating, Map Reduce scripts, joins &
subqueries.
HBase – Hbase concepts, clients, example, Hbase vs RDBMS, advanced usage,
schema design, advance indexing, Zookeeper – how it helps in monitoring a cluster,
how to build applications with Zookeeper. IBM Big Data strategy, introduction to
Infosphere, BigInsights and Big Sheets, introduction to Big SQL.
Suggested Readings:
1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today's Businesses", Wiley.
2. Big-Data Black Book, DT Editorial Services, Wiley.
3. Dirk deRoos, Chris Eaton, George Lapis, Paul Zikopoulos, Tom Deutsch, “Understanding Big
Data Analytics for Enterprise Class Hadoop and Streaming Data”, McGrawHill.
4. Thomas Erl, Wajid Khattak, Paul Buhler, “Big Data Fundamentals: Concepts, Drivers and
Techniques”, Prentice Hall.
5. Bart Baesens “Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications (WILEY Big Data Series)”, John Wiley & Sons
6. Arshdeep Bahga, Vijay Madisetti, “Big Data Science & Analytics: A Hands On Approach “, VPT
7. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP
8. Tom White, "Hadoop: The Definitive Guide", O'Reilly.
9. Eric Sammer, "Hadoop Operations", O'Reilly.
10. Chuck Lam, “Hadoop in Action”, MANNING Publishers
11. Deepak Vohra, “Practical Hadoop Ecosystem: A Definitive Guide to Hadoop-Related
Frameworks and Tools”, Apress
12. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilly
13. Lars George, "HBase: The Definitive Guide", O'Reilly.
14. Alan Gates, "Programming Pig", O'Reilly.
15. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer.
16. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics”, John Wiley & sons.
17. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons
18. Pete Warden, “Big Data Glossary”, O’Reilly

KCA023 : Simulation and Modelling
At the end of course , the student will be able to understand
CO 1 Study the concept of system, its components and types. K1
CO 2 Understand and analyze nature and techniques of major simulation K2, K4
models.
CO 3 Study and analyze the idea of continuous and discrete system K1, K4
simulation.
CO 4 Understand the notion of system dynamics and system dynamics K2
diagrams.
CO 5 Finding critical path computation and understanding PERT networks K1, K4
Unit Topic Proposed
Lecture
I System definition and components, stochastic activities, continuous and
discrete systems, System modeling, Types of models, static and dynamic 08
physical models, static and dynamic mathematical models, full corporate
model, types of system study.
II System simulation, Need of simulation, Basic nature of simulation,
techniques of simulation, comparison of simulation and analytical 08
methods, types of system Simulation, real time simulation, hybrid
simulation, simulation of pursuit problem, single-server queuing system
and an inventory problem, Monte-Carlo simulation, Distributed Lag
model, Cobweb model.
III Simulation of continuous Systems, analog vs digital simulation,
simulation of water reservoir system, simulation of a servo system,
simulation of an auto-pilot. Discrete system simulation, fixed time step 08
vs. event-to-event model, generation of random numbers, test of
randomness, Monte-Carlo computation vs. stochastic simulation.
IV System dynamics, exponential growth models, exponential decay
models, logistic curves, system dynamics diagrams, world model. 08
V Simulation of PERT networks, critical path computation, uncertainties in
activity duration, resource allocation and consideration, Simulation 08
languages, object oriented simulation
Suggested Readings:
1. Geoffrey Gordon, “System Simulation”, PHI
2. Narsingh Deo, “System Simulation with digital computer”, PHI.
3. Averill M. Law and W. David Kelton, “Simulation Modelling and Analysis”,
TMH.

KCA024: Software Testing & Quality Assurance

CO 1 Test the software by applying testing techniques to deliver a product free from K3
bugs.
CO 2 Investigate the scenario and select the proper testing technique. K1, K4
CO 3 Explore the test automation concepts and tools and estimation of cost, schedule K2, K4
based on standard metrics.
CO 4 Understand how to detect, classify, prevent and remove defects. K1, K2
CO 5 Choose appropriate quality assurance models and develop quality. Ability to K3, K4
conduct formal inspections, record and evaluate results of inspections.
Unit Topic Proposed
Lecture
I Software Testing Basics: Testing as an engineering activity, Role of process 08
in software quality, Testing as a process, Basic definitions, Software testing
principles, The tester’s role in a software development organization, Origins of
defects, Defect classes, The defect repository and test design, Defect examples,
Developer / Tester support for developing a defect repository.
II Testing Techniques and Levels of Testing: Using White Box Approach to 08
Test design– Static Testing Vs. Structural Testing, Code Functional Testing,
Coverage and Control Flow Graphs, Using Black Box Approaches to Test
Case Design, Random Testing, Requirements based testing, Decision tables,
State-based testing, Cause-effect graphing, Error guessing, Compatibility
testing, Levels of Testing -Unit Testing, Integration Testing, Defect Bash
Elimination. System Testing - Usability and Accessibility Testing,
Configuration Testing, Compatibility Testing.
III Software Test Automation And Quality Metrics: Software Test Automation, 08
Skills needed for Automation, Scope of Automation, Design and Architecture
for Automation, Requirements for a Test Tool, Challenges in Automation
Tracking the Bug, Debugging. Testing Software System Security - Six-Sigma,
TQM - Complexity Metrics and Models, Quality Management Metrics,
Availability Metrics, Defect Removal Effectiveness, FMEA, Quality Function
Deployment, Taguchi Quality Loss Function, Cost of Quality.
IV Fundamentals of Software Quality Assurance: SQA basics, Components of 08
the Software Quality Assurance System, software quality in business context,
planning for software quality assurance, product quality and process quality,
software process models, 7 QC Tools and Modern Tools.
V Software Assurance Models: Models for Quality Assurance, ISO-9000 series, 08
CMM, CMMI, Test Maturity Models, SPICE, Malcolm Baldrige Model- P-
CMM.
Software Quality Assurance Trends: Software Process- PSP and TSP, OO
Methodology, Clean room software engineering, Defect Injection and
prevention, Internal Auditing and Assessments, Inspections & Walkthroughs,
Case Tools and their affect on Software Quality.
Suggested Readings:
1. Srinivasan Desikan, Gopalaswamy Ramesh, “Software Testing: Principles and Practices”,
Pearson.
2. Daniel Galin, “Software Quality Assurance: From Theory to Implementation”, Pearson

Addison Wesley.
3. Aditya P. Mathur, “Foundations of Software Testing”, Pearson.
4. Paul Ammann, Jeff Offutt, “Introduction to Software Testing”, Cambridge University Press.
5. Paul C. Jorgensen, “Software Testing: A Craftsman's Approach”, Auerbach Publications.
6. William Perry, “Effective Methods of Software Testing”, Wiley Publishing, Third Edition.
7. Renu Rajani, Pradeep Oak, “Software Testing – Effective Methods, Tools and Techniques”,
Tata McGraw Hill.
8. Stephen Kan, “Metrics and Models in Software Quality”, Addison – Wesley, Second Edition.
9. S. A. Kelkar, “Software quality and Testing”, PHI Learning Pvt, Ltd.
10. Watts S Humphrey, “Managing the Software Process”, Pearson Education Inc.

KCA025: Digital Image Processing

CO 1 Explain the basic concepts of two-dimensional signal acquisition, sampling, K1, K2
quantization and color model.
CO 2 Apply image processing techniques for image enhancement in both the spatial K2, K3
and frequency domains.
CO 3 Apply and compare image restoration techniques in both spatial and frequency K2, K3
domain.
CO 4 Compare edge based and region based segmentation algorithms for ROI K3, K4
extraction.
CO 5 Explain compression techniques and descriptors for image processing. K2, K3
Unit Topic Proposed
Lecture
I Digital Image Fundamentals: Steps in Digital Image Processing – 08
Components – Elements of Visual Perception – Image Sensing and Acquisition
– Image Sampling and Quantization – Relationships between pixels – Color
image fundamentals – RGB, HSI models, Two-dimensional mathematical
preliminaries, 2D transforms – DFT, DCT.
II Image Enhancement: Spatial Domain: Gray level transformations – 08
Histogram processing – Basics of Spatial Filtering–Smoothing and Sharpening
Spatial Filtering, Frequency Domain: Introduction to Fourier Transform–
Smoothing and Sharpening frequency domain filters – Ideal, Butterworth and
Gaussian filters, Homomorphic filtering, Color image enhancement.
III Image Restoration: Image Restoration – degradation model, Properties, Noise 08
models – Mean Filters – Order Statistics –Adaptive filters – Band reject Filters
– Band pass Filters – Notch Filters – Optimum Notch Filtering – Inverse
Filtering – Wiener filtering
IV Image Segmentation: Edge detection, Edge linking via Hough transform – 08
Thresholding – Region based segmentation – Region growing – Region
splitting and merging – Morphological processing- erosion and dilation,
Segmentation by morphological watersheds – basic concepts – Dam
construction – Watershed segmentation algorithm.
V Image Compression and Recognition: Need for data compression, Huffman, 08
Run Length Encoding, Shift codes, Arithmetic coding, JPEG standard, MPEG.
Boundary representation, Boundary description, Fourier Descriptor, Regional
Descriptors – Topological feature, Texture – Patterns and Pattern classes –
Recognition based on matching.
Suggested Readings:
1. Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing”, Pearson, Third Edition,
2010.
2. Anil K. Jain, “Fundamentals of Digital Image Processing”, Pearson, 2002.
3. Kenneth R. Castleman, “Digital Image Processing” Pearson, 2006.
4. D, E. Dudgeon and R M. Mersereau, “Multidimensional Digital Signal Processing”, Prentice
Hall Professional Technical Reference, 1990.
5. William K. Pratt, “Digital Image Processing” John Wiley, New York, 2002.
6. Milan Sonka et al, “Image processing, analysis and machine vision Brookes/Cole”, Vikas
Publishing House, 2nd edition,1999.

KCA351: Artificial Intelligence Lab

CO 1 Study and understand AI tools such as Python / MATLAB. K1,K2
CO 2 Apply AI tools to analyze and solve common AI problems. K3, K4
CO 3 Implement and compare various AI searching algorithms. K6
CO 4 Implement various machine learning algorithms. K6
CO 5 Implement various classification and clustering techniques. K6
DETAILED SYLLABUS
1. Installation and working on various AI tools such as Python / MATLAB.
2. Programs to solve basic AI problems.
3. Implementation of different AI searching techniques.
4. Implementation of different game playing techniques.
5. Implementation of various knowledge representation techniques.
6. Program to demonstrate the working of Bayesian network.
7. Implementation of pattern recognition problems such as handwritten character/ digit
recognition, speech recognition, etc.
8. Implementation of different classification techniques.
9. Implementation of various clustering techniques.
10. Natural language processing tool development.
Note:
TheInstructormayadd/delete/modify/tuneexperiments,whereverhe/shefeelsinajustifiedmanner.

KCA352: Software Engineering Lab

CO 1 Identify ambiguities, inconsistencies and incompleteness from a requirements K2, K4
specification and state functional and non-functional requirement.
CO 2 Identify different actors and use cases from a given problem statement K3, K5
and draw use case diagram to associate use cases with different types of
relationship.
CO 3 Draw a class diagram after identifying classes and association among them. K4, K5
CO 4 Graphically represent various UML diagrams and associations among them K4, K5
and identify the logical sequence of activities undergoing in a system, and
represent them pictorially.
CO 5 Able to use modern engineering tools for specification, design, implementation K3, K4
and testing.
DETAILED SYLLABUS
For any given case/ problem statement do the following;
1. Prepare a SRS document in line with the IEEE recommended standards.
2. Draw the use case diagram and specify the role of each of the actors.
3. Prepare state the precondition, post condition and function of each use
case.
4. Draw the activity diagram.
5. Identify the classes. Classify them as weak and strong classes and draw the
class diagram.
6. Draw the sequence diagram for any two scenarios.
7. Draw the collaboration diagram.
8. Draw the state chart diagram.
9. Draw the component diagram.
10. Draw the deployment diagram.
Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a
justified manner. Draw the deployment diagram

SECOND YEAR SYLLABUS

SEMESTER-IV

ELECTIVE-3

KCA031: Privacy and Security in Online Social Media

CO 1 Understand working of online social networks K2
CO 2 Describe privacy policies of online social media K2
Analyse countermeasures to control information sharing in Online social K3
CO 3
networks.
CO 4 Apply knowledge of identity management in Online social networks K3
CO 5 Compare various privacy issues associated with popular social media. K3
Unit Topic Proposed
Lecture
Introduction to Online Social Networks: Introduction to Social Networks, From
offline to Online Communities, Online Social Networks, Evolution of Online
Social Networks, Analysis and Properties, Security Issues in Online Social
I Networks, Trust Management in Online Social Networks, Controlled Information 08
Sharing in Online Social Networks, Identity Management in Online Social
Networks, data collection from social networks, challenges, opportunities, and
pitfalls in online social networks, APIs; Collecting data from Online Social Media.
Trust Management in Online Social Networks: Trust and Policies, Trust and
Reputation Systems, Trust in Online Social, Trust Properties, Trust Components,
Social Trust and Social Capital, Trust Evaluation Models, Trust, credibility, and
II 08
reputations in social systems; Online social media and Policing, Information
privacy disclosure, revelation, and its effects in OSM and online social networks;
Phishing in OSM & Identifying fraudulent entities in online social networks
Controlled Information Sharing in Online Social Networks: Access Control
Models, Access Control in Online Social Networks, Relationship-Based Access
III 08
Control, Privacy Settings in Commercial Online Social Networks, Existing Access
Control Approaches
Identity Management in Online Social Networks: Identity Management, Digital
Identity, Identity Management Models: From Identity 1.0 to Identity 2.0, Identity
IV 08
Management in Online Social Networks, Identity as Self-Presentation, Identity
thefts, Open Security Issues in Online Social Networks
Case Study: Privacy and security issues associated with various social media such
V 08
as Facebook, Instagram, Twitter, LinkedIn etc.
Textbooks:
1. Security and Privacy-Preserving in Social Networks, Editors: Chbeir, Richard, Al Bouna,

Bechara (Eds.), Spinger, 2013.
2. Security and Trust in Online Social Networks, Barbara Carminati, Elena Ferrari, Marco Viviani,
Morgan & Claypool publications.
3. Security and Privacy in Social Networks, Editors: Altshuler, Y., Elovici, Y., Cremers, A.B.,
Aharony, N., Pentland, A. (Eds.), Springer, 2013
4. Security and privacy preserving in social networks, Elie Raad & Richard Chbeir, Richard
Chbeir& Bechara Al Bouna, 2013
5. Social Media Security: Leveraging Social Networking While Mitigating Risk, Michael Cross,
2013

KCA032: Soft Computing

CO 1 Recognize the need of soft computing and study basic concepts and techniques K1, K2
of soft computing.
CO 2 Understand the basic concepts of artificial neural network to analyze widely K2, K4
used neural networks.
CO 3 Apply fuzzy logic to handle uncertainty in various real-world problems. K3
CO 4 Study various paradigms of evolutionary computing and evaluate genetic K1, K5
algorithm in solving optimization problems.
CO 5 Apply hybrid techniques in applications of soft computing. K3
Unit Topic Proposed

Lecture
I Introduction to Soft Computing: Introduction, Comparison with hard 08
computing, Concept of learning and adaptation, Constituents of soft computing,
Applications of soft computing.
Artificial Neural Networks: Basic concepts of neural networks, Human brain,
Biological neural network, History of artificial neural networks, Basic building
blocks of an artificial neuron, Neural network architectures, Activation
functions, Characteristics and limitation of neural networks.
II Artificial Neural Networks: Learning methods - Supervised, Unsupervised, 08
Reinforcement, Hebbian, Gradient descent, Competitive, Stochastic.
Major classes of neural networks: Perceptron networks, Multilayer
perceptron model, Back-propagation network, Radial basis function network,
Recurrent neural network, Hopfield networks, Kohonen self-organizing feature
maps.
III Fuzzy Logic: Introduction to Fuzzy Logic, Comparison with crisp logic, 08
Properties of classical sets, Operations on classical sets, Properties of fuzzy
sets, Operations on fuzzy sets, Classical relations, Fuzzy relations, Features and
types of fuzzy membership functions, Fuzzy arithmetic, Fuzzy measures.
Fuzzy Systems: Crisp logic, Predicate logic, Fuzzy logic, Fuzzy propositions,
Inference rules, Fuzzy inference systems- Fuzzification, Inference,
Defuzzification, Types of inference engines.
V Evolutionary Computing: Introduction, Evolutionary algorithm, Biological 08
evolutionary process, Paradigms of evolutionary computing – Genetic
algorithm and Genetic programming, Evolutionary strategies, Evolutionary
programming.
Genetic Algorithm: Introduction, Traditional optimization and search
techniques, Comparison with traditional algorithms, Operations- Encoding,
Selection, Crossover and Mutation, Classification of Genetic algorithm.
V Hybrid Soft Computing Techniques: Introduction, Classification of hybrid 08
systems, Neuro-fuzzy hybrid systems, Neuro-genetic hybrid systems, Fuzzy-
genetic hybrid systems.
Other Soft Computing Techniques: Tabu Search, Ant colony based
optimization, Swarm Intelligence.
Suggested Readings:
1. Sivanandam S.N. and Deepa S.N., “Principles of Soft Computing”, Wiley-India.
2. Rajasekaran S. and Vijayalakshmi Pai G.A., “Neural Networks, Fuzzy Logic and Genetic
Algorithms- Synthesis and Applications”, PHI Learning.
3. Chakraverty S., Sahoo D.M. and Mahato N. R., “Concepts of Soft Computing- Fuzzy and ANN
with Programming”, Springer.
4. Kaushik S. and Tiwari S., “Soft Computing – Fundamentals, Techniques and Applications’,
McGrawHill Education.
5. Jang J.-S.R., Sun C.-T. and Mizutani E., “Neuro-Fuzzy and Soft Computing”, Prentice-Hall of
India.
6. Karray F. O. and Silva C. D., “Soft Computing and Intelligent Systems Design – Theory, Tools
and Applications”, Pearson Education.
7. Freeman J. A. and Skapura D. M., “Neural Networks: Algorithms, Applications and Programming
Techniques”, Pearson.
8. Siman H., “Neural Netowrks”, Prentice Hall of India.

KCA033: Pattern Recognition

CO 1 Study of basics of Pattern recognition. Understand the designing principles and K1, K2
Mathematical foundation used in pattern recognition.
CO 2 Analysis the Statistical Patten Recognition. K3, K4
CO 3 Understanding the different Parameter estimation methods. K1, K2
CO 4 Understanding the different Nonparametric Techniques. K1, K2,
CO 5 Understand and Make use of unsupervised learning and Clustering in Pattern K2 K3, K4
recognition.
Unit Topic Proposed
Lecture
I Introduction: Basics of pattern recognition, Design principles of pattern 08
recognition system, Learning and adaptation, Pattern recognition approaches,
Mathematical foundations – Linear algebra, Probability Theory, Expectation,
mean and covariance, Normal distribution, multivariate normal densities, Chi
squared test.
II Statistical Patten Recognition: Bayesian Decision Theory, Classifiers, 08
Normal density and discriminant functions
III Parameter estimation methods: Maximum-Likelihood estimation, Bayesian 08
Parameter estimation, Dimension reduction methods - Principal Component
Analysis (PCA), Fisher Linear discriminant analysis, Expectation-
maximization (EM), Hidden Markov Models (HMM), Gaussian mixture
models.
IV Nonparametric Techniques: Density Estimation, Parzen Windows, K- 08
Nearest Neighbor Estimation, Nearest Neighbor Rule, Fuzzy classification.
V Unsupervised Learning & Clustering: Criterion functions for clustering, 08
Clustering Techniques: Iterative square - error partitional clustering – K means,
agglomerative hierarchical clustering, Cluster validation.
Suggested Readings:
1. Duda R. O., Hart P. E. and Stork D. G., “Pattern Classification”, John Wiley.
2. Bishop C. M., “Neural Network for Pattern Recognition”, Oxford University Press.
3. Singhal R., “Pattern Recognition: Technologies & Applications”, Oxford University Press.
4. Theodoridis S. and Koutroumbas K., “Pattern Recognition”, Academic Press.

KCA034: Data Analytics

CO1 Describe the life cycle phases of Data Analytics through discovery, planning and K1, K2
building.
CO2 Understand and apply Data Analysis Techniques. K2, K3
CO3 Implement various Data streams. K3
CO4 Understand item sets, Clustering, frame works & Visualizations. K2
CO5 Apply R tool for developing and evaluating real time applications. K3, K5, K6
Unit Topic Proposed
Lecture
I Introduction to Data Analytics: Sources and nature of data, classification of 08
data (structured, semi-structured, unstructured), characteristics of data,
introduction to Big Data platform, need of data analytics, evolution of analytic
scalability, analytic process and tools, analysis vs reporting, modern data analytic
tools, applications of data analytics.
Data Analytics Lifecycle: Need, key roles for successful analytic projects,
various phases of data analytics lifecycle – discovery, data preparation, model
planning, model building, communicating results, operationalization
II Data Analysis: Regression modeling, multivariate analysis, Bayesian modeling, 08
inference and Bayesian networks, support vector and kernel methods, analysis of
time series: linear systems analysis & nonlinear dynamics, rule induction, Neural
Networks: Learning and generalisation, competitive learning, principal
component analysis and neural networks, fuzzy logic: extracting fuzzy models
from data, fuzzy decision trees, stochastic search methods.
III Mining Data Streams: Introduction to streams concepts, stream data model and 08
architecture, stream computing, sampling data in a stream, filtering streams,
counting distinct elements in a stream, estimating moments, counting oneness in
a window, decaying window, Real-time Analytics Platform ( RTAP)
applications, Case studies – Real time sentiment analysis, stock market
predictions.
IV Frequent Itemsets and Clustering: Mining frequent itemsets, market based 08
modelling, Apriori algorithm, handling large data sets in main memory, limited
pass algorithm, counting frequent itemsets in a stream, Clustering techniques:
hierarchical, K-means, clustering high dimensional data, CLIQUE and
ProCLUS, frequent pattern based clustering methods, clustering in non-euclidean
space, clustering for streams and parallelism.
V Frame Works and Visualization: MapReduce, Hadoop, Pig, Hive, HBase, 08
MapR, Sharding, NoSQL Databases, S3, Hadoop Distributed File Systems,
Visualization: visual data analysis techniques, interaction techniques, systems
and applications.
Introduction to R - R graphical user interfaces, data import and export, attribute
and data types, descriptive statistics, exploratory data analysis, visualization
before analysis, analytics for unstructured data.
Suggested Readings:
1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer.
2. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge
University Press.
3. Bill Franks, “Taming the Big Data Tidal wave: Finding Opportunities in Huge Data Streams
with Advanced Analytics”, John Wiley & Sons.
4. John Garrett, “Data Analytics for IT Networks : Developing Innovative Use Cases”, Pearson
Education.
5. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today's Businesses", Wiley.
6. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big Data Analytics”, EMC
Education Series, John Wiley.
7. Frank J Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley and SAS
Business Series.
8. Colleen Mccue, “Data Mining and Predictive Analysis: Intelligence Gathering and Crime
Analysis”, Elsevier.
9. Michael Berthold, David J. Hand,” Intelligent Data Analysis”, Springer.
10. Paul Zikopoulos, Chris Eaton, Paul Zikopoulos, “Understanding Big Data: Analytics for
Enterprise Class Hadoop and Streaming Data”, McGraw Hill.
11. Trevor Hastie, Robert Tibshirani, Jerome Friedman, "The Elements of Statistical Learning",
Springer.
12. Mark Gardner, “Beginning R: The Statistical Programming Language”, Wrox Publication.
13. Pete Warden, “Big Data Glossary”, O’Reilly.
14. Glenn J. Myatt, “Making Sense of Data”, John Wiley & Sons.
15. Peter Bühlmann, Petros Drineas, Michael Kane, Mark van der Laan, "Handbook of Big Data",
CRC Press.
16. Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques”, Second Edition,
Elsevier.

KCA035: Software Quality Engineering
Understand basic concepts of Software Quality along with its documents and K2
CO 1
process
CO 2 Apply knowledge of Software Quality in various types of software K3
CO 3 Compare the various reliability models for different scenarios K4
CO 4 Illustrate the software Quality Planning and Assurance K2
CO 5 Make use of various testing techniques in software implementation K3
Unit Topic Proposed
Lecture
Software Quality: Definition, Software Quality Attributes and Specification, Cost
of Quality, Defects, Faults, Failures, Defect Rate and Reliability, Defect
I Prevention, Reduction, and Containment, Overview of Different Types of Software 08
Review, Introduction to Measurement and Inspection Process, Documents and
Metrics.
Software Quality Metrics Product Quality Metrics: Defect Density, Customer
Problems Metric, Customer Satisfaction Metrics, Function Points, In-Process
II Quality Metrics: Defect Arrival Pattern, Phase-Based Defect Removal Pattern, 08
Defect Removal Effectiveness, Metrics for Software Maintenance: Backlog
Management Index, Fix Response Time, Fix Quality, Software Quality Indicators.
Software Quality Management and Models:Modeling Process, Software
Reliability Models: The Rayleigh Model, Exponential Distribution and Software
III Reliability Growth Models, Software Reliability Allocation Models, Criteria for 08
Model Evaluation, Software Quality Assessment Models: Hierarchical Model of
Software Quality Assessment.
Software Quality Assurance: Quality Planning and Control, Quality Improvement
Process, Evolution of Software Quality Assurance (SQA), Major SQA Activities,
IV 08
Major SQA Issues, Zero Defect Software, SQA Techniques, Statistical Quality
Assurance, Total Quality Management, Quality Standards and Processes.
Software Verification, Validation & Testing: Verification and Validation,
Evolutionary Nature of Verification and Validation, Impracticality of Testing all
V Data and Paths, Proof of Correctness, Software Testing, Functional, Structural and 08
Error-Oriented Analysis & Testing, Static and Dynamic Testing Tools,
Characteristics of Modern Testing Tools.
Text books:
1. Jeff Tian, Software Quality Engineering (SQE), Wiley-Interscience, 2005; ISBN 0-471-
71345 -7
2. Metrics and Models in Software Quality Engineering, Stephen H. Kan, AddisonWesley
(2002), ISBN: 0201729156
3. Norman E. Fenton and Shari Lawrence Pfleeger, “Software Metrics” Thomson, 2003
4. Mordechai Ben – Menachem and Garry S.Marliss, “Software Quality”, Thomson Asia
Pte Ltd, 2003.

ELECTIVE-4

KCA041: Blockchain Architecture

CO1 Study and understand basic concepts of blockchain architecture. K1, K2
CO2 Analyze various requirements for consensus protocols. K4
CO3 Apply and evaluate the consensus process. K3, K5
CO4 Understand the concepts of Hyperledger fabric. K1
CO5 Analyze and evaluate various use cases in financial software and supply chain. K4, K5
Unit Topic Proposed
Lecture
I Introduction to Blockchain: Digital Money to Distributed Ledgers, Design 08
Primitives: Protocols, Security, Consensus, Permissions, Privacy.
Blockchain Architecture and Design: Basic crypto primitives: Hash, Signature,
Hashchain to Blockchain, Bitcoin Basic, Basic consensus mechanisms.
II Consensus: Requirements for the consensus protocols, Proof of Work (PoW), 08
Scalability aspects of Blockchain consensus protocols, distributed consensus,
consensus in Bitcoin.
Permissioned Blockchains: Design goals, Consensus protocols for Permissioned
Blockchains
III Hyperledger Fabric: Decomposing the consensus process, Hyperledger fabric 08
components.
Chaincode Design and Implementation Hyperledger Fabric: Beyond
Chaincode: fabric SDK and Front End, Hyperledger composer tool.
IV Use case 1: Blockchain in Financial Software and Systems (FSS): (i) 08
Settlements, (ii) KYC, (iii) Capital markets, (iv) Insurance.
Use case 2: Blockchain in trade/supply chain: (i) Provenance of goods, visibility,
trade/supply chain finance, invoice management discounting, etc.
V Use case 3: Blockchain for Government: (i) Digital identity, land records and 08
other kinds of record keeping between government entities, (ii) public
distribution system social welfare systems, Blockchain Cryptography, Privacy
and Security on Blockchain
Suggested Readings:
1. Andreas Antonopoulos, “Mastering Bitcoin: Unlocking Digital Cryptocurrencies”, O’Reilly
2. Melanie Swa, “Blockchain”, O’Reilly
3. “Hyperledger Fabric”, https://www.hyperledger.org/projects/fabric
4. Bob Dill, David Smits, “Zero to Blockchain - An IBM Redbooks course”,
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.html

KCA042: Neural Networks

CO 1 Study of basic concepts of Neuro Computing, Neuroscience and ANN. Understand the K1, K2
different supervised and unsupervised and neural networks performance.
CO 2 Study of basic Models of neural network. Understand the Perception network. and K2, K3
Compare neural networks and their algorithm.
CO 3 Study and Demonstrate different types of neural network. Make use of neural networks K2 K3, K4
for specified problem domain.
CO 4 Understand and Identify basic design requirements of recurrent network and Self- K1, K2
organizing feature map.
CO 5 Able to understand the some special network. Able to understand the concept of Soft K1, K2 K3
computing.
Unit Topic Proposed
Lecture
I Neurocomputing and Neuroscience: The human brain, biological neurons, neural 08
processing, biological neural network.
Artificial Neural Networks: Introduction, historical notes, neuron model, knowledge
representation, comparison with biological neural network, applications.
Learning process: Supervised learning, unsupervised learning, error correction
learning, competitive learning, adaptation learning, Statistical nature of the learning
process.
II Basic Models: McCulloch-Pitts neuron model, Hebb net, activation functions, 08
aggregation functions.
Perceptron networks: Perceptron learning, single layer perceptron networks,
multilayer perceptron networks.
Least mean square algorithm, gradient descent rule, nonlinearly separable problems
and bench mark problems in NN.
III Multilayer neural network: Introduction, comparison with single layer networks. 08
Back propagation network: Architecture, back propagation algorithm, local minima
and global minima, heuristics for making back propagation algorithm performs better,
applications.
Radial basis function network: Architecture, training algorithm, approximation
properties of RBF networks, comparison of radial basis function network and back
propagation networks.
IV Recurrent network: Introduction, architecture and types. 08
Self-organizing feature map: Introduction, determining winner, Kohonen Self
Organizing feature maps (SOM) architecture, SOM algorithm, properties of feature
map; Learning vector quantization-architecture and algorithm.
Principal component and independent component analysis.
V Special networks: Cognitron, Support vector machines. Complex valued NN and 08
complex valued BP.
Soft computing: Introduction, Overview of techniques, Hybrid soft computing
techniques.
Suggested Readings:
1. Kumar S., “Neural Networks- A Classroom Approach”, McGraw Hill.
2. Haykin S., “Neural Networks – A Comprehensive Foundation”, Pearson Education.
3. Yegnanarayana B. “Artificial Neural Networks”, Prentice Hall of India.
4. Freeman J. A., “Neural Networks”, Pearson Education.
5. James F., “Neural Networks – Algorithms, Applications and Programming Techniques”, Pearson
Education.

KCA043: Internet of Things
CO 1 Demonstrate basic concepts, principles and challenges in IoT. K1,K2
CO 2 Illustrate functioning of hardware devices and sensors used for IoT. K2
CO 3 Analyze network communication aspects and protocols used in IoT. K4
CO 4 Apply IoT for developing real life applications using Ardunio programming. K3
CP 5 To develop IoT infrastructure for popular applications K2, K3

Proposed
Unit Topic
Lecture
Internet of Things (IoT): Vision, Definition, Conceptual Framework,
Architectural view, technology behind IoT, Sources of the IoT, M2M
I Communication, IoT Examples. Design Principles for Connected Devices: 08
IoT/M2M systems layers and design standardization, communication technologies,
data enrichment and consolidation, ease of designing and affordability
Hardware for IoT: Sensors, Digital sensors, actuators, radio frequency
identification (RFID) technology, wireless sensor networks, participatory sensing
II technology. Embedded Platforms for IoT: Embedded computing basics, Overview 08
of IOT supported Hardware platforms such as Arduino, NetArduino, Raspberry pi,
Beagle Bone, Intel Galileo boards and ARM cortex.
Network & Communication aspects in IoT: Wireless Medium access issues,
III MAC protocol survey, Survey routing protocols, Sensor deployment & Node 08
discovery, Data aggregation & dissemination
Programming the Ardunio: Ardunio Platform Boards Anatomy, Ardunio IDE,
IV coding, using emulator, using libraries, additions in ardunio, programming the 08
ardunio for IoT.
Challenges in IoT Design challenges: Development Challenges, Security
Challenges, Other challenges IoT Applications: Smart Metering, E-health, City
V Automation, Automotive Applications, home automation, smart cards, 08
communicating data with H/W units, mobiles, tablets, Designing of smart street
lights in smart city.
Text books:
1. Olivier Hersent,DavidBoswarthick, Omar Elloumi“The Internet of Things key applications and
protocols”, willey
2. Jeeva Jose, Internet of Things, Khanna Publishing House
3. Michael Miller “The Internet of Things” by Pearson
4. Raj Kamal “INTERNET OF THINGS”, McGraw-Hill, 1ST Edition, 2016
5. ArshdeepBahga, Vijay Madisetti “Internet of Things (A hands on approach)” 1ST edition, VPI
publications,2014
6. Adrian McEwen,Hakin Cassimally “Designing the Internet of Things” Wiley India

KCA044: Modern Application Development
Understand the fundamental of Kotlin Programing for Android Application K2
CO 1 Development.
CO 2 Describe the UI Layout and architecture of Android Operating System. K3

Designing android application using Jetpack Library based on MVVM K6
CO 3
Architecture.
Developing android application based on REST API using Volley and Retrofit K6
CO 4
Library.
CO 5 Ability to debug the Performance and Security of Android Applications. K5
Unit Topic Proposed
Lecture
Kotlin Fundamental: Introduction to Kotlin,Basic Syntax, Idioms, Coding
Conventions, Basics, Basic Types, Packages, Control Flow, Returns and Jumps,
Classes and Objects, Classes and Inheritance, Properties and Fields, Interfaces,
Visibility Modifiers, Extensions, Data Classes, Generics, Nested Classes, Enum
I Classes, Objects, Delegation, Delegated Properties, Functions and Lambdas, 08
Functions, Lambdas, Inline Functions, Higher-Order Functions, Scope Functions,
Collections, Ranges, Type Checks and Casts, This expressions, Equality, Operator
overloading, Null Safety, Exceptions, Annotations, Reflection.
Android Fundamental: Android Architecture: Introduction to Android,

Layouts, Views and Resources, Activities and Intents, Activity Lifecycle and
Saving State, Implicit or Explicit Intents.
II 08
User Interaction and Intuitive Navigation: Material Design, Theme, Style and
Attributes, Input Controls, Menus, Widgets, Screen Navigation, Recycler View,
ListView, Adapters,Drawables, Notifications.
Storing, Sharing and Retrieving Data in Android Applications: Overview to

storing data, shared preferences, App settings, Store and query data in Android's
SQLite database, Content Providers, Content Resolver, Loading data using
loaders.
III 08
Jetpack Components : Fragments, Jetpack Navigation, Lifecycle, Lifecycle
Observer, Lifecycle Owner, View Model, View Model Factory, View Model
Provider, LiveData, Room API, Data Binding, View Binding, MVVM
Architecture Basics
Asynchronous Data Handling, Networking and Files: Asynchronous Task,

Coroutines, API Handling, JSON Parsing, Volley Library, Retrofit Library, File
IV 08
Handling, HTML and XML Parsing, Broadcast receivers, Services

Permissions, Performance and Security:

Firebase, AdMob, APK Singing, Publish App, Packaging and deployment,
V Google Maps, GPS and Wi-Fi, Download Manager, Work Manager, Alarms, 08
Location, Map and Sensors, APK Singing, Publish App
Text books:
1. Meier R.,"Professionai Android 2 Application Development", Wiley.

2. Hashimi S., KomatineniS. and MacLeanD., "Pro Android 2", Apress.
3. Murphy M., "Beginning Android 2", Apress.
4. Delessio C. and Darcey L., "Android Application Development", Pearson Education.
5. DiMarzio J.F., "Android a Programming Guide", Tata McGraw Hill.

KCA045: Distributed Database Systems
CO 1 Understand theoretical and practical aspects of distributed database systems. K2
Study and identify various issues related to the development of distributed K3
CO 2
database system
Understand the design aspects of object-oriented database system and related K4
CO 3
development
CO 4 Equip students with principles and knowledge of distributed reliability. K3
Equip students with principles and knowledge of parallel and object-oriented K5

CO 5
databases.
Unit Topic Proposed
Lecture
Introduction: Distributed Data Processing, Distributed Database System,
Promises of DDBSs, Problem areas. Distributed DBMS Architecture:
I Architectural Models for Distributed DBMS, DDMBS Architecture. Distributed 08
Database Design: Alternative Design Strategies, Distribution Design issues,
Fragmentation, Allocation.
Query processing and decomposition: Query processing objectives,
characterization of query processors, layers of query processing, query
II decomposition, localization of distributed data. Distributed query Optimization: 08
Query optimization, centralized query optimization, distributed query
optimization algorithms.
Transaction Management: Definition, properties of transaction, types of
transactions, distributed concurrency control: Serializability, concurrency control
III 08
mechanisms & algorithms, time - stamped & optimistic concurrency control
Algorithms, deadlock Management.
Distributed DBMS Reliability: Reliability concepts and measures, fault-
tolerance in distributed systems, failures in Distributed DBMS, local & distributed
IV reliability protocols, site failures and network partitioning. Parallel Database 08
Systems: Parallel database system architectures, parallel data placement, parallel
query processing, load balancing, database clusters.
Distributed object Database Management Systems: Fundamental object
concepts and models, object distributed design, architectural issues, object
management, distributed object storage, object query Processing.
V 08
Object Oriented Data Model: Inheritance, object identity, persistent
programming languages, persistence of objects, comparison OODBMS and
ORDBMS
Text books:
M. Tamer OZSU and Patuck Valduriez: Principles of Distributed Database Systems, Pearson Edn. Asia,
2001. 2. Stefano Ceri and Giuseppe Pelagatti: Distributed Databases, McGraw Hill. REFERENCE
BOOKS: 1. Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom: “Database Systems: The
Complete Book”, Second Edition, Pearson International Edition

ELECTIVE-5

KCA051: Mobile Computing

CO 1 Study and aware fundamentals of mobile computing. K1, K2
CO 2 Study and analyze wireless networking protocols, applications and K1, K4
environment.
CO 3 Understand various data management issues in mobile computing. K2
CO 4 Analyze different type of security issues in mobile computing K4
environment.
CO 5 Study, analyze, and evaluate various routing protocols used in mobile K1, K4, K5
computing.
Unit Topic Proposed
Lecture
I Introduction, Issues in mobile computing, Overview of wireless
telephony, Cellular concept, GSM- air interface, channel structure; 08
Location management- HLR-VLR, hierarchical, handoffs; Channel
allocation in cellular systems, CDMA, GPRS, MAC for cellular system.
II Wireless Networking, Wireless LAN Overview- MAC issues, IEEE
802.11, Blue Tooth, Wireless multiple access protocols, TCP over 08
wireless, Wireless applications, Data broadcasting, Mobile IP, WAP-
architecture, protocol stack, application environment, applications.
III Data management issues in mobile computing, data replication for
mobile computers, adaptive clustering for mobile wireless networks, File
system, Disconnected operations. 08
IV Mobile Agents computing, Security and fault tolerance, Transaction

processing in mobile computing environment. 08
V Adhoc networks, Localization, MAC issues, Routing protocols, Global
state routing (GSR), Destination sequenced distance vector routing 08
(DSDV), Dynamic source routing (DSR), Adhoc on demand distance
vector routing (AODV), Temporary ordered routing algorithm (TORA),
QoS in Adhoc Networks, applications
Suggested Readings:
1. Schiller J., “Mobile Communications”, Pearson
2. Upadhyaya S. and Chaudhury A., “Mobile Computing”, Springer
3. Kamal R., “Mobile Computing”, Oxford University Press.
4. Talukder A. K. and Ahmed H., “Mobile Computing Technology, Applications
and Service Creation”, McGraw Hill Education
5. Garg K., “Mobile Computing Theory and Practice”, Pearson.
6. Kumar S., “Wireless and Mobile Communication”, New Age International
Publishers
7. Manvi S. S. and Kakkasageri M. S., “Wireless and Mobile Networks- Concepts and
Protocols”, Wiley India Pvt. Ltd.

KCA052: Computer Graphics and Animation
CO 1 Understand the graphics hardware used in field of computer graphics. K2
CO 2 Understand the concept of graphics primitives such as lines and circle based on K2, K4
different algorithms.
CO 3 Apply the 2D graphics transformations, composite transformation and Clipping K4
concepts.
CO 4 Apply the concepts and techniques used in 3D computer graphics, including K2, K3
viewing transformations, projections, curve and hidden surfaces.
CO 5 Perform the concept of multimedia and animation in real life. K2, K3
Unit Topic Proposed
Lecture
I Introduction and Line Generation: Types of computer graphics, Graphic 08
Displays- Random scan displays, Raster scan displays, Frame buffer and video
controller, Points and lines, Line drawing algorithms, Circle generating
algorithms, Mid-point circle generating algorithm, and parallel version of these
algorithms.
II Transformations: Basic transformation, Matrix representations and 08
homogenous coordinates, Composite transformations, Reflections and
shearing.
Windowing and Clipping: Viewing pipeline, Viewing transformations, 2-D
Clipping algorithms- Line clipping algorithms such as Cohen Sutherland line
clipping algorithm, Liang Barsky algorithm, Line clipping against non
rectangular clip windows; Polygon clipping – Sutherland Hodgeman polygon
clipping, Weiler and Atherton polygon clipping, Curve clipping, Text clipping.
III Three Dimensional: 3-D Geometric Primitives, 3-D Object representation, 3- 08
D Transformation, 3-D viewing, projections, 3-D Clipping.
Curves and Surfaces: Quadric surfaces, Spheres, Ellipsoid, Blobby objects,
Introductory concepts of Spline, Bspline and Bezier curves and surfaces.
IV Hidden Lines and Surfaces: Back Face Detection algorithm, Depth buffer 08
method, A- buffer method, Scan line method, basic illumination models–
Ambient light, Diffuse reflection, Specular reflection and Phong model,
Combined approach, Warn model, Intensity Attenuation, Color consideration,
Transparency and Shadows.
V Multimedia Systems: Design Fundamentals, Back ground of Art, Color theory 08
overview, Sketching & illustration, Storyboarding, different tools for
animation.
Animation: Principles of Animations, Elements of animation and their use,
Power of Motion, Animation Techniques, Animation File Format, Making
animation for Rolling Ball, making animation for a Bouncing Ball, Animation
for the web, GIF, Plugins and Players, Animation tools for World Wide Web.
Suggested Readings:
1. Hearn D. and Baker M. P., “Computer Graphics C Version”, Pearson Education
2. Foley, Vandam, Feiner, Hughes,“Computer Graphics principle”, Pearson Education.
3. Rogers, “ Procedural Elements of Computer Graphics”, McGraw Hill
4. Newman W. M., Sproull R. F., “Principles of Interactive computer Graphics”, McGraw Hill.
5. Sinha A. N. and Udai A. D.,” Computer Graphics”, McGraw Hill.
6. Mukherjee, “Fundamentals of Computer graphics & Multimedia”, PHI Learning Private Limited.
7. Vaughan T., “Multimedia, Making IT Work”,Tata McGraw Hill.

KCA053: Natural Language Processing

CO 1 Study and understand basic concepts, background and representations of K1, K2
natural language.
CO 2 Analyze various real-world applications of NLP. K4
CO 3 Apply different parsing techniques in NLP. K3
CO 4 Understand grammatical concepts and apply them in NLP. K2, K3
CO 5 Apply various statistical and probabilistic grammar methods to handle and K3, K5
evaluate ambiguity.
Unit Topic Proposed
Lecture
I Introduction to Natural Language Understanding: The study of Language, 08
Applications of NLP, Evaluating Language Understanding Systems, Different
levels of Language Analysis, Representations and Understanding, Organization
of Natural language Understanding Systems, Linguistic Background: An
outline of English syntax.
II Introduction to semantics and knowledge representation, some applications like 08
machine translation, database interface.
III Grammars and Parsing: Grammars and sentence Structure, Top-Down and 08
Bottom-Up Parsers, Transition Network Grammars, Top- Down Chart Parsing.
Feature Systems and Augmented Grammars: Basic Feature system for English,
Morphological Analysis and the Lexicon, Parsing with Features, Augmented
Transition Networks.
IV Grammars for Natural Language: Auxiliary Verbs and Verb Phrases, 08
Movement Phenomenon in Language, Handling questions in Context-Free
Grammars. Human preferences in Parsing, Encoding uncertainty, Deterministic
Parser.
V Ambiguity Resolution: Statistical Methods, Probabilistic Language 08
Processing, Estimating Probabilities, Part-of Speech tagging, Obtaining
Lexical Probabilities, Probabilistic Context-Free Grammars, Best First Parsing.
Semantics and Logical Form, Word senses and Ambiguity, Encoding
Ambiguity in Logical Form.
Suggested Readings:
1. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, “NLP: A Paninian Perspective”, Prentice
Hall, New Delhi.
2. James Allen, “Natural Language Understanding”, Pearson Education.
3. D. Jurafsky, J. H. Martin, “Speech and Language Processing”, Pearson Education.
4. L. M. Ivansca, S. C. Shapiro, “Natural Language Processing and Language Representation”,
AAAI Press, 2000.
5. T. Winograd, Language as a Cognitive Process, Addison-Wesley.

KCA054: Machine Learning Techniques

Course Outcome ( CO) Bloom’s Knowledge Level
(KL)
At the end of course , the student will be able:
CO 1 To understand the need for machine learning for various problem solving K1 , K2
To understand a wide variety of learning algorithms and how to evaluate K1 , K3

CO 2
models generated from data
CO 3 To understand the latest trends in machine learning K2 , K3
To design appropriate machine learning algorithms and apply the algorithms to K4 , K6

CO 4
a real-world problems
To optimize the models learned and report on the expected accuracy that can K4, K5
CO 5
be achieved by applying the models
Unit Topic Proposed
Lecture
INTRODUCTION – Learning, Types of Learning, Well defined learning
problems, Designing a Learning System, History of ML, Introduction of Machine
I Learning Approaches – (Artificial Neural Network, Clustering, Reinforcement 08
Learning, Decision Tree Learning, Bayesian networks, Support Vector Machine,
Genetic Algorithm), Issues in Machine Learning and Data Science Vs Machine
Learning;
REGRESSION: Linear Regression and Logistic Regression
BAYESIAN LEARNING - Bayes theorem, Concept learning, Bayes Optimal
II Classifier, Naïve Bayes classifier, Bayesian belief networks, EM algorithm. 08
SUPPORT VECTOR MACHINE: Introduction, Types of support vector kernel
– (Linear kernel, polynomial kernel,and Gaussiankernel), Hyperplane – (Decision
surface), Properties of SVM, and Issues in SVM.
DECISION TREE LEARNING - Decision tree learning algorithm, Inductive
bias, Inductive inference with decision trees, Entropy and information theory,
III 08
Information gain, ID-3 Algorithm, Issues in Decision tree learning.
INSTANCE-BASED LEARNING – k-Nearest Neighbour Learning, Locally
Weighted Regression, Radial basis function networks, Case-based learning.
ARTIFICIAL NEURAL NETWORKS – Perceptron’s, Multilayer perceptron,
Gradient descent and the Delta rule, Multilayer networks, Derivation of
Backpropagation Algorithm, Generalization, Unsupervised Learning – SOM
Algorithm and its variant;
IV DEEP LEARNING - Introduction,concept of convolutional neural network , 08
Types of layers – (Convolutional Layers , Activation function , pooling , fully
connected) , Concept of Convolution (1D and 2D) layers, Training of network,
Case study of CNN for eg on Diabetic Retinopathy, Building a smart speaker,
Self-deriving car etc.
REINFORCEMENT LEARNING–Introduction to Reinforcement Learning ,
Learning Task,Example of Reinforcement Learning in Practice, Learning Models
V 08
for Reinforcement – (Markov Decision process , Q Learning - Q Learning
function, Q Learning Algorithm ), Application of Reinforcement
Learning,Introduction to Deep Q Learning.
GENETIC ALGORITHMS: Introduction, Components, GA cycle of
reproduction, Crossover, Mutation, Genetic Programming, Models of Evolution
and Learning, Applications.
Text books:
1. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private Limited, 2013.
2. Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and Machine Learning),
MIT Press 2004.
3. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press, 2009.
4. Bishop, C., Pattern Recognition and Machine Learning. Berlin: Springer-Verlag.
5. M. Gopal, “Applied Machine Learning”, McGraw Hill Education

KCA055: Quantum Computing

At the end of course , the student will be able to understand
Distinguish problems of different computational complexity and explain why certain K1 , K2
CO
problems are rendered tractable by quantum computation with reference to the relevant
1
concepts in quantum theory.
Demonstrate an understanding of a quantum computing algorithm by simulating it on a K2 , K3
CO
classical computer, and state some of the practical challenges in building a quantum
2
computer.
CO Contribute to a medium-scale application program as part of a co-operative team, making K2 , K3
3 use of appropriate collaborative development tools (such as version control systems).
Produce code and documentation that is comprehensible to a group of different K3 , K4
CO
programmers and present the theoretical background and results of a project in written and
4
verbal form.
CO Apply knowledge, skills, and understanding in executing a defined project of research, K3, K6
5 development, or investigation and in identifying and implementing relevant outcomes.
Proposed
Unit Topic
Lecture
Fundamental Concepts: Global Perspectives, Quantum Bits, Quantum Computation,
I 08
Quantum Algorithms, Quantum Information, Postulates of Quantum Mechanisms.
Quantum Computation: Quantum Circuits – Quantum algorithms, Single Orbit
operations, Control Operations, Measurement, Universal Quantum Gates, Simulation of
II Quantum Systems, Quantum Fourier transform, Phase estimation, Applications, Quantum 08
search algorithms – Quantum counting – Speeding up the solution of NP – complete
problems – Quantum Search for an unstructured database.
Quantum Computers: Guiding Principles, Conditions for Quantum Computation,
III Harmonic Oscillator Quantum Computer, Optical Photon Quantum Computer – Optical 08
cavity Quantum electrodynamics, Ion traps, Nuclear Magnetic resonance
Quantum Information: Quantum noise and Quantum Operations – Classical Noise and
Markov Processes, Quantum Operations, Examples of Quantum noise and Quantum
IV 08
Operations – Applications of Quantum operations, Limitations of the Quantum operations
formalism, Distance Measures for Quantum information.
Quantum Error Correction: Introduction, Shor code, Theory of Quantum Error –
Correction, Constructing Quantum Codes, Stabilizer codes, Fault – Tolerant Quantum
V Computation, Entropy and information – Shannon Entropy, Basic properties of Entropy, 08
Von Neumann, Strong Sub Additivity, Data Compression, Entanglement as a physical
resource .
Text books:
1. Micheal A. Nielsen. &Issac L. Chiang, “Quantum Computation and Quantum Information”, Cambridge University Press,
Fint South Asian edition, 2002.
2. Eleanor G. Rieffel , Wolfgang H. Polak , “Quantum Computing - A Gentle Introduction” (Scientific and Engineering
Computation) Paperback – Import,
3 Oct 2014 3. Computing since Democritus by Scott Aaronson
4. Computer Science: An Introduction by N. DavidMermin 5. Yanofsky's and Mannucci, Quantum Computing for
Computer Scientists.

MCA - Second - Year - Detailed - Syllabus - 2021 - 22 Final

Uploaded by

Copyright:

Available Formats

MCA - Second - Year - Detailed - Syllabus - 2021 - 22 Final

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCA - Second - Year - Detailed - Syllabus - 2021 - 22 Final

Uploaded by

Copyright:

Available Formats

MASTER

Two Year Coourse)

Curricculum & Evalluation Schem

S. No. Subject Subject Name Periods Sessional ESE Total Credit

S. No. Subject Subject Name Periods Sessional ESE Total Credit

Elective-1 KCA011 Cryptography & Network Security

Elective-2 KCA021 Web Technology

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 2

Elective-3 KCA031 Privacy & Security in Online Social Media

Elective-4 KCA041 Blockchain Architecture

Elective-5 KCA051 Mobile Computing

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 3

SECOND YEAR SYLLABUS

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 4

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 5

KCA302: Software Engineering

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 6

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 7

KCA303: Computer Networks

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 8

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 9

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 10

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 11

KCA012: Data Warehousing & Data Mining

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 13

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 14

KCA014: Cloud Computing

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 15

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 16

KCA015 : Compiler Design

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 17

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 18

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 19

KCA021: Web Technology

Scripting: Introduction to JavaScript, Creating Variables in JavaScript, Creating

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 20

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 21

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 22

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 23

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 24

KCA024: Software Testing & Quality Assurance

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 25

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 26

KCA025: Digital Image Processing

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 27

KCA351: Artificial Intelligence Lab

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 28

KCA352: Software Engineering Lab

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 29

SECOND YEAR SYLLABUS

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 30

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 31

KCA031: Privacy and Security in Online Social Media

1. Security and Privacy-Preserving in Social Networks, Editors: Chbeir, Richard, Al Bouna,

Curriculum & Evaluation Scheme MCA(III & IV semester) Page 32

KCA032: Soft Computing

At the end of course, the student will be able to understand

DETAILED SYLLABUS 3-0-0

Unit Topic Proposed