MASTER OF COMPUTER APPLICATION (MCA)

ELECTIVE-4

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

 MASTER OF COMPUTER APPLICATION (MCA)

KCA041: Blockchain Architecture

Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
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
DETAILED SYLLABUS 4-0-0
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

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

 MASTER OF COMPUTER APPLICATION (MCA)

KCA042: Neural Networks

Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
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.
DETAILED SYLLABUS 3-0-0
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.

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

 MASTER OF COMPUTER APPLICATION (MCA)
KCA043: Internet of Things
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
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

DETAILED SYLLABUS 3-1-0

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

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

 MASTER OF COMPUTER APPLICATION (MCA)
KCA044: Modern Application Development
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
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
DETAILED SYLLABUS 3-1-0
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

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

 MASTER OF COMPUTER APPLICATION (MCA)

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.

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

 MASTER OF COMPUTER APPLICATION (MCA)
KCA045: Distributed Database Systems
Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course , the student will be able to:
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.
DETAILED SYLLABUS 4-0-0
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

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

 MASTER OF COMPUTER APPLICATION (MCA)

ELECTIVE-5

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

 MASTER OF COMPUTER APPLICATION (MCA)

KCA051: Mobile Computing

Course Outcome ( CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
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.
DETAILED SYLLABUS 3-0-0
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.

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

 MASTER OF COMPUTER APPLICATION (MCA)
KCA052: Computer Graphics and Animation
Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
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
DETAILED SYLLABUS 3-0-0
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.

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

 MASTER OF COMPUTER APPLICATION (MCA)

KCA053: Natural Language Processing

Course Outcome (CO) Bloom’s Knowledge Level (KL)
At the end of course, the student will be able to understand
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.
DETAILED SYLLABUS 3-0-0
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.

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

 MASTER OF COMPUTER APPLICATION (MCA)

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
DETAILED SYLLABUS 3-0-0
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.
Curriculum & Evaluation Scheme MCA(III & IV semester) Page 50
 MASTER OF COMPUTER APPLICATION (MCA)
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

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

 MASTER OF COMPUTER APPLICATION (MCA)

KCA055: Quantum Computing

Course Outcome ( CO) Bloom’s Knowledge Level (KL)
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.
DETAILED SYLLABUS 3-0-0
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.

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