Course Outline of

2-Year Master of Computer Application (MCA),

University of Calcutta

Paper No. Paper Name L Full Marks Credit

L T P
MCA T11 Design and Analysis of Algorithms 2 1 100 3
MCA T12 Mathematical Foundations 2 1 100 3
MCA T13 Advanced Database Management 2 1 100 3
Systems
MCA T14 Group A: Theory of Computation 1 1 50 2
Semester-1 Group B: Compiler Design 1 1 50 2
MCA T15 Advanced Computer Architecture 2 1 100 3

MCA P11 Algorithm Design Laboratory 3 100 1.5

MCA P12 Advanced Database Management 3 100 1.5
and Web Design Laboratory
MCA P13 Internet Technologies Laboratory 3 100 1.5

MCA M11 Soft Skills 2 100 1

MCA T21 Advanced Networking 2 1 100 3
MCA T22 Machine Learning 2 1 100 3
MCA T23 Software Engineering 2 1 100 3
MCA T24 Economics and Accountancy 2 100 2
MCA T25 Elective I* 2 1 100 3
Semester-2 MCA P21 Advanced Networking Laboratory 3 100 1.5
MCA P22 Machine Learning Laboratory 3 100 1.5
MCA P23 Group A: Software Engineering 3 50 1.5
Laboratory
Group B: Seminar I 1 50 0.5
MCA M21 Environmental Science 2 100 1
MCA T31 Data Science 2 1 100 3
MCA T32 Cryptography and Network Security 2 1 100 3
MCA T33 IoT and Embedded Systems 2 1 100 3
MCA T34 Elective II** 2 1 100 3
MCA T35 Elective III*** 2 1 100 3
MCA P31 Data Science Laboratory 3 100 1.5
Semester-3 MCA P32 Group A: IoT and Embedded 3 50 1.5
Systems Laboratory
Group B: Seminar II 1 50 0.5
MCA P33 Mini Project 3 100 3

MCA M31 Ethics & Values and Cyber Law 2 100 1

MCA P41 Project 500 10
Semester-4 MCA P42 Journal Study 100 2
MCA P43 Grand Viva Voce 200 4

* Elective I **Elective II *** Elective III

1. Distributed Systems 1. Quantum Computing 1. Computer Vision
and Cloud Computing 2. High Performance 2. Deep Learning
2. Blockchain Computing 3. Natural Language
Technology 3. VLSI Processing
3. Mobile Computing 4. Real-time Systems 4. Computational Biology
4. Digital Marketing
 Detailed Syllabus
Semester 1

MCA T11 - Design and Analysis of Algorithms [40L]

Introduction and basic concepts.

Basics: Definition, properties, problems and instances, elementary operations. Time and space
complexity: worst-case, best-case and average-case. Asymptotic notations: big-oh, big-theta, big-
omega. Solving recurrences relations: substitution method, iteration method, change of variable,
recursion trees and using master theorem. Brief review of basic data structures – stack, queue,
linked list, tree. Algorithm Design Techniques: Brute Force and Exhaustive Search, Decrease and
Conquer, Divide and Conquer, Transform and Conquer, Dynamic Programming, Iterative
Improvement, Greedy Technique, Backtracking, Branch and Bound. [11L]

Sorting and searching.

Comparison sort with analysis: heap sort, radix sort, quick sort and merge sort, lower bound for
comparison based sorting. Linear time sorting: counting sort, radix sort, and bucket sort. Searching:
Linear, modified linear and binary search with analysis. [6L]

Data structures for disjoint sets.

Set: Tree representation of a set. Union and find methods: Algorithm, improvement by rank and
path compression heuristics, analysis and applications. [2L]

Graph problems.
Representation: Adjacency matrix, adjacency list. Traversal: breadth first search (BFS), depth first
search (DFS). Graph Sort: Topological sort. Component: Strongly connected components.
Minimum spanning trees: Kruskal’s and Prim’s algorithms. Shortest Path: Single source shortest
path, Dijkstra’s algorithm, Bellman Ford algorithm. [8L]

Backtracking.
Basic terminologies, n queen’s problem, Hamiltonian circuit problem, subset sum problem. [3L]

Branch and bound.

Basic terminologies, knapsack problem, travelling salesman problem (TSP). [2L]

String processing.
String searching and Pattern matching. String matching algorithm with analysis - naïve, finite
automata and Knuth-Morris-Pratt method. [4L]

Conceptual introduction to NP-completeness.

Informal concepts of deterministic and nondeterministic algorithms, P and NP, NP-completeness,
statement of Cook’s theorem, some standard NP-complete problems, approximation algorithms.
[4L]

References:
1. “Introduction to Algorithms”, T. Cormen, C. Leiserson, R. L. Rivest and C. Stein, Prentice-Hall
India.
2. “Algorithms in C”, R. Sedgewick, Pearson Education, India.
3. “Concrete Mathematics- A Foundation for Computer Science”, R. L. Graham, D. E. Knuth, O.
Patasnik, Pearson Education, India.
4. “The Art of Computer Programming (Vol. 1 -3)”, D.E. Knuth,Pearson Education, India.
5. “Introduction to Algorithms, A creative Approach”, Udi Manber, Addison Wesley.
6. “Computer Algorithms: Introduction to Design and Analysis”, S. Baase, 2nd ed., Addison
Wesley, California.
7. “Design and Analysis of algorithms”, Aho, Ullman and Hopcroft, Pearson education.

MCA T12 – Mathematical Foundations [40L]

Course Objectives:

1. To strengthen the knowledge of students in Linear Algebra.

2. To study the basics of statistics and Probability.

Basic Linear Algebra: Vector Spaces and their properties, Determinants, Matrices, Solution of
linear algebraic equations, Cayley-Hamilton Theorem, Linear differential equations of second and
higher order, Partial differentiation, Linear Transformation.
[12L]
Advanced Linear Algebra: Norms and spaces, orthogonal complements and Projection operator,
Eigen pairs and properties, Special matrices and properties, Least Square Approximation and
Minimum Norm Solution, SVD, Low rank Approximation, Gram Schmidt Process.
[12]
Statistics and Probability: Concept of mean, medial, and mode, moments about mean, variance,
skewness, kurtosis, Classical definition of probability, probability density functions, conditional and
marginal probabilities, expectation, Bayes’ theorem, Binomial, Poisson, Normal and Gaussian
distributions, Hypothesis testing.
[8]
Sampling Theory: Test of Hypothesis, Level of significance, Critical region, One Tailed and two
Tailed test, Test of significant for Large Samples: Means of the samples and test of significant of
means of two large samples. Test of significant of small samples, Chi square test, Karl Pearsons
coefficient of correlation.
[8]
Reference Books:
1. Higher Engineering Mathematics by Dr. B. S. Grewal 42th edition, Khanna Publication.
2. Advanced Engineering Mathematics by Kreyszig E. 9th edition, John Wiley.
3. Advanced Engg. Mathematics by C. Ray Wylie & Louis Barrett. TMH International Edition.
4. Mathematical Methods of Science and Engineering by Kanti B. Datta, Cengage Learning.
5. Theory And Problems of Statistics by Murry R. Spieget, Schaunsout line series- McGraw
Hill Publication.
6. Fundamentals Of Mathematical Statistics by S. C. Gupta, V. K. Kapoor, Sultan Chand &
Sons -2003
MCA T13 - Advanced DBMS 40L

Data modeling using Entity Relationship Model: E.R. model concept, notation for ER diagrams
mapping constraints; Aggregation, reducing ER diagrams to tables, extended ER model,
Relationships of higher degree. [4L]

Data Base Design: Functional dependencies, normal forms, first, second and third functional
personal normal forms. BCNF, multi-valued dependencies fourth normal forms, join dependencies
and fifth normal forms. Inclusion dependencies, loss less join decompositions, normalization using
FD, MVD. [4L]

Transaction processing concepts: Transaction processing system, ACID properties, schedule and
recoverability, Testing of serializability, serializability of schedules, conflict and view, serializable
schedule, transaction processing in distributed databases, fragmentation, locking, Protocols for
distributed database, recovery from transaction failures, deadlock handling. [8L]

Concurrency Control Techniques: Locking Techniques for concurrency control, time stamping
protocols for concurrency control, concurrency control in distributed systems. [4L]

Recovery system: Failure Classification, Log based recovery, Shadow Paging, Buffer Management
[2L]

Distributed Database: Basic concepts, Fragmentation, Distributed database design, Distributed

Transaction Management and Concurrency control, Timestamp. [4L]

Distributed Query Management and Access Strategy: Translation of global queries to fragment
queries, Join Query, Semi-Join Query. [4L]

Distributed Transaction and Concurrency Management: Introduction to distributed transaction,

Recovery of Distributed Transaction, 2 Phase commitment protocol, Serializability in distributed
database, Distributed deadlock detection, Concurrency control based on Timestamp. [6L]

Introduction to Big Data: Introduction, Big Data and its importance, 7Vs, Drivers for Big data,
Big data applications, Introduction of Hadoop, NoSQL Databases [4L]

MCA T14A - Theory of Computation [40L]

Course Objective : The objectives of this course is to introduce the mathematical foundations
of computation including automata theory and help establish a connection between algorithmic
problem solving and theory of languages and automata.

Finite Automata (FA) : Introduction, Deterministic Finite Automata (DFA) , Nondeterministic

Finite Automata (NFA), Equivalence of Deterministic and Nondeterministic Finite Automata,
Applications of Finite Automata, Finite Automata with Epsilon Transitions, Eliminating Epsilon
transitions, Minimization of Deterministic Finite Automata, Finite automata with output (Moore and
Mealy machines) and Inter conversion. [10L]

Regular Expressions (RE) : Introduction, Identities of Regular Expressions, Converting from

DFA’s to Regular Expressions, Converting Regular Expressions to Automata, applications of
Regular Expressions. [5L]

Regular Grammars (RG): Definition, regular grammars and FA, Pumping lemma, applications,
Closure properties of regular languages. [5L]
Context Free Grammar (CFG): Derivation Trees, Sentential Forms, Rightmost and Leftmost
derivations of Strings. Ambiguity in CFG’s, Minimization of CFG’s, CNF, GNF, Pumping Lemma
for CFL’s, Enumeration of Properties of CFL. [5L]

Pushdown Atomata (PA) : Definition, Model, Acceptance of CFL, Acceptance by Final State and
Acceptance by Empty stack and its Equivalence, Equivalence of CFG and PDA. [5L]

Turing Machines (TM) : Formal definition, Languages of a TM, TM as accepters. [6L]

Recursive and Recursively Enumerable Languages (REL) : Properties of recursive and

recursively enumerable languages, Universal Turing machine, The Halting problem, Undecidable
problems about TMs. Context sensitive language and linear bounded automata (LBA), Chomsky
hierarchy, Decidability, Post's correspondence problem (PCP), undecidability of PCP.
[4L]

References:
1. “Introduction to Automata Theory Languages and Computation”, John E. Hopcroft, Rajeev
Motwani, Jeffrey D. Ullman (2007), 3rd edition, Pearson Education, India.
2. “Theory of Computer Science-Automata Languages and Computation”, K. L. P Mishra, N.
Chandrashekaran (2003) , 2nd edition, Prentice Hall of India, India.

MCA T14B - Compiler Design [40L]

Course Objective : The objective of this course is to provides a complete description about inner
working of a compiler.The course gives a detail information about the different parts inside a
compiler, how they are constructed and how they coordinate with each other to implement the
task of compilation.
Introduction : Structure of a compiler, Lexical Analysis, role of Lexical Analyzer, Input Buffering,
Specification of Tokens, Recognition of Tokens, Lex. [5L]

Syntax Analysis : Role of Parser, Challenges of Parser- ambiguous grammar, left recursion, left
recursion, Top Down Parsing, Recursive Descent Parser, Predictive Parser, Bottom-up Parsing,
Operator Precedence Parser, SLR Parser, Canonial LR (1) Parser, LALR Parser, YACC.
[15L]

Intermediate Code Generation : Syntax Directed Definitions, Evaluation Orders for Syntax
Directed Definitions, Syntax Directed Translation, Intermediate language , Syntax Tree, Three
Address Code, Types and Declarations, Translation of Expressions, Type Checking, Control Flow,
Backpatching, Switch-Statements. [15L]

Run-Time Environment and Code Generation : Storage Organization, Stack Allocation Space,
Access to Non-local Data on the Stack, Heap Management, Garbage collection, Issues in Code
Generation ,Design of a simple Code Generator. [5L]

References:
3. “Compilers: Principles, Techniques and Tools”, Aho, Lam, Sethi, Ullman, Second Edition,
Pearson, 2014.
4. “Compilers: Principles, Techniques and Tools” By Aho, Sethi, and Ullman, Addison-
Wesley, 1986.
5. “Compiler Design in C” By Allen I. Holub, Prentice-Hall/Pearson.
6. “Advanced Compiler Design and Implementation” By Muchnick, Morgan and Kaufmann,
1998.
MCA T15 – Advanced Computer Architecture [40L]
Course Objective:
An overview of computer architecture, which stresses the underlying design principles and the
impact of these principles on computer performance. General topics include design methodology,
processor design, control design, memory organization, system organization, and parallel
processing.
Course Outcome:
 Discuss the organisation of computer-based systems and how a range of design choices are
influenced by applications
 Understand different processor architectures and system-level design processes.
 Understand the components and operation of a memory hierarchy and the range of
performance issues influencing its design.
 Understand the organisation and operation of current generation parallel computer systems,
including multiprocessor and multicore systems.
 Understand the principles of I/O in computer systems, including viable mechanisms for I/O
and secondary storage organisation.
 Develop systems programming skills in the content of computer system design and
organisation.
 Content

Module 1: Context for modern computer systems engineering: [5L]

 Dimensions for the classification of computer systems

 Persistent trends in embedded systems

 Forms of parallelism, Performance evaluation

 Architectural developments

Module 2: Memory systems [5L]

 Interleaved memory - structure, performance

 Virtual memory - utilisation, locality of reference, performance

 Paged memory - structure, challenges, address translation, optimisation

 Cache memory - structure, performance, implementation, optimisation

Module 3: Processor architecture [12L]

 CPU control issues

 Instruction sequencing and clock cycle grouping

 Instruction-level parallelism - data dependency, exploitation, measurement

 Branch predication and speculative execution

 Micro-operations and control signals - relationship, control signal generation, hardware

design consideration, implementations, microprogrammed control

 Principles of Pipelining - instruction pipelines, hazards, pipeline analysis

  Thread-level parallelism - multithreading to improve uniprocessor throughput, common
approaches, granularity issues, thread scheduling, measurement

 Forms of multithreading - block, interleaved, and simultaneous

 Principles of superscalar processors - structure, performance, evaluation

Module 4: Parallel computer organisation [10L]

 Classifications of parallelism

 SIMD architectures - vector computation, SIMD instruction set extensions

 MIMD architectures - cache coherence, cache restriction, broadcast-based cache writes,

snoop bus, directory coherence, MESI, models of consistency

 Processor interconnection - principles of processor interconnection, network topologies,

implementations, properties, performance, cost

 Multicore systems - structure, performance, complexity, power consumption, memory

utilisation, software development issues for multicore systems

 Data-level parallelism - motivation, challenges, applications

 Manycore architecture - motivations and persistent trends, GPUs, future architectures,

software development issues for manycore systems
Module 5: I/O and secondary storage [8L]

 I/O techniques - polling variants, interrupts, direct memory access

 I/O channels - structures, latency and bandwidth issues, standards

 RAID systems - organisation, performance-cost tradeoffs

 Storage area networks - motivation, organisation, control, performance issues

References:
1. DA Patterson and JL Hennessy, Computer Organization and Design, Morgan Kaufmann
Publisher, 4e, 2010
2. J.P. Hayes, Computer Architecture and Organization, Mc Graw Hill
3. A.S. Tanenbaum, Structured Computer Organization, PHI Publication
4. W. Stalling, Computer Organization and Architecture, PHI Publication

MCA M11 – Soft Skills

1. Personality Development and grooming

Body Language (Kinesics, Oculesics, Paralinguistics, Proxemics, Artifacts, Chronemics &

Tactilics), Dress Code & Etiquettes

2. Fluency and Vocabulary building

 Word Formations (by adding suffixes and prefixes),Root words from foreign languages and
their use in English; Synonyms; Antonyms; One Word Substitution/Single Word for a group
of Words, Standard abbreviations; Redundant Words/ Redundancies/Redundantism; Clichés.

3. Functional Grammar

Tenses, Subject-Verb agreement, Prepositions, Phrasal Verbs, Transformations, Clauses &

Phrases etc.

4. Technical Communication

Theory, Organisational Hierarchy, Types of Management, Barriers, Models etc

5. Organisational Communication

Memo, Notice, Minutes, Reports etc

6. Business Letters & CV Formats

7. Comprehension (Aural & Written) & Précis Writing

8. Group Discussions (Theory & Practice Sessions)

9. Public Speaking (Prepared & Extempore)

10. Business Presentations (PPTs)

11. Interview Preparations

 Semester 2

MCA T21- Advanced Networking 40L

Review: Networking principles; switching, scheduling - performance bounds, best effort

disciplines, naming and addressing, protocol stack, Internet addressing, routing.
[2L]
Point-to-Point Protocols and Links: Physical Layer, Error Detection, Comparative Performance
analysis of ARQ, Framing: Character Based, Bit Oriented, Length Field, Framing with Errors,
Maximum Frame Size.
[5L]

Delay Models in Data Networks: Introduction, Markov Chains, Queuing Models: Little’s
Theorem, Single Server M/M/1, m-Server M/M/m, Infinite Server M/M/∞, m-Server Loss
M/M/m/m Queuing System. M/G/1 Queues with vacation.
[10L]

Multi-access Communication: Introduction, Slotted Multi-access and the ALOHA system,

Splitting Algorithms, Carrier Sensing, Multi-access Reservation.
[7L]
Routing and Flow Control: WAN Routing, Shortest Path Routing, Optimization of routing data
structures. Flow Control Objectives, Window Flow Control, Rate Control Schemes, Rate
Adjustment Algorithms: Traffic and Congestion control.
[10L]
TCP/IP Protocol Suite:
IP addresses, Delivery and forwarding of IP packets, Mobile IP.
Unicast routing protocols: UDP, TCP, DHCP, DNS, Remote login-Telnet, SSH; FTP, e-mail- SMTP,
POP; SNMP.
[6L]

References:

1. “Modelling of Computer and Communication Systems”, I. Mitrani, Cambridge.

2. “High Performance Communication Networks”, J.Walrand and P.Varaiya, Harcourt Asia
(Morgan Kaufmann).
3. “An Engineering Approach to Computer Networking”, S.Keshav, Pearson Education.
4. “Computer Networking: A Top-Down Approach Featuring the Internet”, J.F.Kurose and
K.W.Ross, Pearson Education.
5. “Internetworking with TCP/IP”, Douglas Comer, Prentice Hall of India.
6. “TCP/IP Illustrated”, W. Richard Stevens, Addison-Wesley.
MCA T22-Machine Learning [40 Lectures]

Course Objectives:
 To introduce students to the basic concepts and techniques of Machine Learning.
 To develop skills of using recent machine learning software for solving practical
problems.
 To gain experience of doing independent study and research.

Course Outcome:
On completion of the course students will be expected to:
 Have a good understanding of the fundamental issues and challenges of machine learning:
data, model selection, model complexity, etc.
 Have an understanding of the strengths and weaknesses of machine learning solutions to
classification, regression, and clustering problems.
 Appreciate the underlying mathematical relationships within and across Machine Learning
algorithms and the paradigms of supervised and un-supervised learning.
 Be able to design and implement various machine learning algorithms in a range of real-
world applications.
 Be able to evaluate and interpret the results of the algorithms.

Introduction to Machine Learning [2L]

What is learning?
Types of learning
Applications of machine learning

Supervised Learning [20L]

Classification
 k-NN, Naive Bayesian, Decision Trees, Support Vector Machines, Logistic
Regression
 Introduction to Artificial Neural Networks – Percentron, MLP
 Evaluation measures

Regression
 Linear regression, Ridge, Lasso
 Evaluation measures

Unsupervised Learning [10L]

Clustering
 Partion-based (k-Means, k-Medoid, k-Mode, PAM)
 Hierarchical Clustering (AGNES, DIANA)
 Density based Clustering
 Evaluation measures

Association Rule Mining

Dimension Reduction [4L]

Principal Component Analysis
Least Discriminant Analysis
Ensemble Learning [4L]
Bagging
Boosting
Random Forests

Recommended Books:

1. Trevor Hastie, Robert Tibshirani, and Jerome Friedman, “The Elements of Statistical Learning:
Data Mining, Inference, and Prediction”, Springer 2013
2. Gareth JamesDaniela WittenTrevor HastieRobert Tibshirani, “An Introduction to Statistical
LearningGareth JamesDaniela WittenTrevor HastieRobert TibshiraniStatisticsAn Introduction to
Statistical Learningwith Applications in R”, Springer 2013
3. Christopher M. Bishop, “Pattern Recognition and Machine Learning”, Springer 2007.
4. Tom Mitchell, “Machine Learning”, McGraw Hill, 1997, ISBN 0-07-042807-7.
5. S. Haykin, “Neural networks and learning machines”, Pearson 2008.

MCA T23- Software Engineering [40L]

Introduction: System, Software, Engineering, Benefits, Problems, Errors, SDLC, Documentation,

Structured Programming, Coupling, Cohesion
[2L]
Basic Designing Tools: DFD, Structure Chart, Decision Table, Decision Tree
[4L]
Designing Approach: Top-Down, Bottom-Up, Hybrid.
[2L]
Model: Water Fall, Iterative Waterfall, Prototype, Iterative Enhancement, Spiral, Agile
[6L]
Cost Model: Function Point Metric, Estimation Model, Heuristic, COCOMO, Analytical.
[4L]
Testing: Program Testing: Unit Testing, Integration Testing
System Testing: Function Testing, Performance Testing, Acceptance Testing.
[6L]

Maintenance: Objective, Cost, Types: Corrective, Preventive, Perfective, Adaptive.

[2 L]
Quality: Metrics, SQA activities, Standard, Verification, Validation, Review, Inspection,
Walkthrough.
[ 4L]
Risk Analysis: Identification, Projection, Refinement, Monitoring & Management.
[ 2L]

Management Activities: Software Project Management, Software Configuration Management,

Staffing, Scheduling.
[ 2L]

Advanced Methodologies: Reverse Engineering, Re-Engineering, UML

[ 6L]
MCA T24- Economics and Accountancy [40L]

Course objectives
The prime objective of this course is to acquire conceptual knowledge of financial accounting . The
student will be in a position to understand the flow of accounting process.
This course will enable the students to develop the accounting software or build the financial
module in ERP solutions.
To develop and understand the basic concepts and processes used to determine product or process
costs & service costs. In turn it will help in determining the price of the product.
One of the main objectives of this course is to focus on developing a basic knowledge base of
economics.
Unit-1: Theoretical Frame Work [3L]
 An Introduction: Meaning of Accountancy, book-keeping and Accounting, Accounting
Process , Objectives for accounting, Differences between book-keeping and accounting,
Users of accounting information , Limitations of Accounting , Basic terminologies

 Accounting Concepts, Principles, Bases and Policies Structure: Accounting Concepts,

Principles, Policies and Standards, Types of accounting concepts, Accounting Principles,
Accounting Policies, Accounting Standards.

 Double Entry Accounting: Meaning of double entry accounting, Classification of accounts

under Traditional approach, Classification of accounts under Accounting Equation approach,
Comparison of traditional approach with Modern approach equal approach, Accounting
Trail, Transactions and events, Meaning and roles of debit and credit, accounting equation

Unit-2: Accounting Process [10L]

Recording of Business Transactions

 Voucher and Transactions: Source documents and Vouchers, Preparation of Vouchers,

Accounting Equation Approach: Meaning and Analysis, Rules of Debit and Credit.

 Recording of Transactions: Books of Original Entry- Journal

Special Purpose books:

 Cash Book: Simple, cash book with bank column and petty cashbook

 Purchases book

 Sales book

 Purchases return book

 Sales return book

Ledger:

 Format, Posting from journal and subsidiary books, Balancing of accounts

Bank Reconciliation Statement:

 Need and preparation

Depreciation, Provisions and Reserves

 Depreciation: Concept, Features, Causes, factors

 Other similar terms: Depletion and Amortization
 Methods of Depreciation:
1. Straight Line Method (SLM)
2. Written Down Value Method (WDV)

 Provisions and Reserves: Difference

 Difference between capital and revenue reserve

Trial balance and Rectification of Errors

 Trial balance: objectives and preparation

 Errors: types-errors of omission, commission, principles, and compensating; their effect on

Trial Balance

 Detection and rectification of errors; preparation of suspense account

Unit 3: Financial Statements of Sole Proprietorship [5L]

Financial Statements

Preparation of Trading and Profit and Loss account and Balance Sheet of a sole
proprietorship with adjustments.

Unit 4: Financial Statements Analysis [2L]

 Financial Statement Analysis: Objectives, importance and limitations.

 Tools for Financial Statement Analysis: Comparative statements, common size statements,
cash flow analysis, ratio analysis.

Unit 5: Understanding Cost [4L]

 Meaning of Cost, Objective of Costing, Methods of Costing, Technique of Costing,

Classification of Cost, Elements of Cost, Statement of Cost Sheet, Solved Problems

 Material Costing. Methods of Valuation of Material issue. Concept and material control and
its techniques.

Unit 6: Marginal Costing and Break Even Analysis [5L]

Concept of Marginal Costing, Characteristics of Marginal Costing, Difference between

Absorption Costing and Marginal Costing, Marginal Cost, Contribution , Cost Volume
 Profit (CVP) Analysis, Break Even Chart, Break Even Point , Profit Volume ratio, Margin
of Safety, Solved Problems

Unit 7: Utility and Consumer Behaviour [3L]

Utility and different approaches to utility--cardinal andordinal approach--relationship

between total and marginal utility--law of diminishingmarginal utility and its explanations--
Indifference curve--definition, features and differentshapes –marginalrate of substitution--
Budget line and its slope, shift and rotation—Consumerequilibrium--conditions and
economic interpretation--Income consumption curve and priceconsumption curve

Unit 8: Theory of Demand [3L]

Demand and its determinants--Law of demand and its exceptions; Demand function and
reasons for the negative slope of the demand curve--change in demandversus change in
quantity demanded; Law of supply and the determinants of supply; priceelasticity of demand
and its measurement--relationship between slope and elasticity of thedemand curve--income
elasticity of demand and the nature of the goods ( Superior, normal,neutral and inferior)--
Cross price elasticity of demand and the relationship between different goods; Concept of
equilibrium through the interaction of demand and the supply curve

Unit 9: Theory of production [2L]

Production function and the factors of production; short run and long run; relationship
among total product, average product and marginal product of the variable factor; Stages of
production; Law of variable proportion--Returns to scale andreturns to the factor; Isoquant,
Isocost and producer’s equilibrium; Expansion path
Unit 10: Theory of cost [3L]
Cost function; Total fixed cost (TFC), Total Variable Cost (TVC), Total cost(TC), Average
fixed Cost (AFC), Average Variable Cost (AVC), Average Cost (AC), Marginal Cost
(MC);Shapes and relationships; Relationship between AC and MC ;Reason for the “U”
shapeof short run average cost curve ; Long run Average cost Curve (LAC) and its
relationship withShort Run Average Cost Curves(SACs); Envelope curve

Recommended Books
1. NCERT Books for Class 11 and Class 12, Accountancy.( Free Pdf version available)
2. T.S. Grewal's Double Entry Book Keeping: Financial Accounting Textbook for CBSE Class
11 and Class 12
3. Cost Accounting Principles And Practice. Author, M. N. Arora.
4. Principles Of Microeconomics- H. L. Ahuja
 MCA T25: Elective I- CHOICE-I: Distributed Systems and Cloud Computing [40L]

Paper No. – MCA T25

Full Marks: 100
Paper Name - Distributed Systems and Cloud Computing
Module Topics Hours
Basic Concepts – Centralized Parallel and Distributed
Algorithms, Examples of distributed systems,
Correctness proof of distributed algorithms; Design
Module-1: issues in a distributed system; Distributed Computing
6
Introduction Models-Distributed Operating System, Network
Operating System, Middleware based Distributed
System; Client Server model – 2 tier and n-tier CS
model.
Shared memory and message passing systems,
synchronous and asynchronous systems, transient and
persistent system, point-to-point and publish-subscribe
Module-2:
systems; Distributed shared memory and memory
Inter Process Communication 8
consistency models; Group communication - multicast
(IPC)
and anycast communication, message ordering and
message delivery; Remote Procedure Call (RPC).
Case studies – Socket, MPI, JMS and RMI
Clock, events and process state in distributed systems;
Module-3: Physical clock synchronization, Logical clocks and
Synchronization Vector clocks; Distributed Snapshots – Global States;
6
in Distributed Systems Distributed mutual exclusions; Leader election
algorithms; Distributed transactions; Deadlocks in
distributed systems;
Basic concepts, fault models, consensus problems and
Module-4:
its applications, commit protocols, voting protocols, 4
Fault Tolerance
Checkpointing and recovery, reliable communication.
Big Data; Relation between Big Data and Distributed
Module 5:
File System; Map Reduce Programming Paradigm. 8
Distributed File System
Case Studies: HDFS and Hadoop Map Reduce
Definition of Cloud Computing; Cloud Service Models;
Module 6: Cloud Deployment Models; Virtualization Technologies.
8
Cloud Computing Case Studies: AWS, GCP and Windows Azure

Text Books:
1. Coulouris, Dollimore, Kindberg: Distributed System: Concepts and Design, Pearson Education
2. Tenenbaum Andrew S. and Steen Maarten Van: Distributed Systems: Principles and Paradigms, Prentice-
Hall.
3. Gerald Tel: Distributed Algorithms, Cambridge University Press.
4. M. Singhal and N. G. Shivaratri: Advanced Concepts in Operating Systems, Tata McGraw-Hill Publishing
Company Limited, 2005.
5. H. Attiya and J. Welch: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, John
Wiley and Sons, Inc., 2004.
6. N. Lynch: Distributed Algorithms, Elsevier (imprint: Morgan Kaufmann), 1996.
7. S. Ghosh: Distributed Algorithms: An Algorithmic Approach, Chapman and Hall, 2006.
8. R. K. Buyya: Mastering Cloud Computing, Tata McGraw-Hill, 2013
9. Tom White: Hadoop: The Definitive Guide, O'Reilly Media, Inc., 2009
MCA T25: Elective I- CHOICE-II: Blockchain Technology

COURSE OBJECTIVES [40 Lectures]

At the end of the course, students will be able to understand
 Distributed System
 How blockchain systems work,
 To securely interact with them with digital signature and hash,
 Design, build, and deploy smart contracts and distributed applications,
 Integrate ideas from blockchain technology into their own projects.

COURSE OUTCOMES
1. Explain design principles of Bitcoin and Ethereum platform.
2. Explain consensus algorithm and smart contract.
3. List and describe differences between proof-of-work and proof-of-stake consensus.
4. Interact with a blockchain system by sending and reading transactions.
5. Design, build, and deploy a distributed application.
6. Evaluate security, privacy, and efficiency of a given blockchain system.

Basic Cryptography [8 Lectures]

Hash function, SHA1, SHA-2, SHA-3, MD5, KECAAK, Public Key Cryptography, RSA, ECC,
Digital Signature - ECDSA, Memory Hard Algorithm, Zero Knowledge Proof., Morkle Tree.

Blockchain [10 Lectures]

Distributed vs Centralized System, Advantage over conventional distributed database, Introduction

of Blockchain, Blockchain Network, Mining Mechanism, Distributed Consensus, Merkle Patricia
Tree, Gas Limit, Transactions and Fee, Anonymity, Reward, Chain Policy, Private and Public
blockchain.

Distributed Consensus: [5 Lectures]

Distributed Trust, Nakamoto consensus, Proof of Work, Proof of Stake, Proof of Burn, Difficulty
Level, Sybil Attack, Energy utilization and alternate.

Cryptocurrency: [7 Lectures]
History, Distributed Ledger, Bitcoin protocols - Mining strategy and rewards, Ethereum -
Construction, DAO, Smart Contract, GHOST, Vulnerability, Attacks, Sidechain, Namecoin .

Cryptocurrency Regulation: [10 Lectures]

Stakeholders, Roots of Bit coin, Legal Aspects-Crypto currency Exchange, Black Market and
Global Economy. Applications: Internet of Things, Medical Record Management System, Domain
Name Service, Supply chain, Future of Blockchain.

Reference Book
1. Bitcoin and Cryptocurrency Technologies Arvind Narayanan, Joseph Bonneau, Edward
Felten, Andrew Miller, Steven Goldfeder with a preface by Jeremy Clark.
2. Antonopoulos, Mastering Bitcoin: Unlocking Digital Cryptocurrencies
3. Satoshi Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System
4. DR. Gavin Wood, “ETHEREUM: A Secure Decentralized Transaction Ledger,”Yellow
paper.2014.
MCA T25: Elective I- CHOICE-III: Mobile Computing [40L]

Course Objectives:

1. To explore both theoretical and practical issues of mobile computing;

2. To develop skills of finding solutions and building software for mobile computing
applications.

Learning Outcomes:

1. Grasp the concepts and features of mobile computing technologies and applications.
2. To have a good understanding of how the underlying wireless and mobile communication
networks work, their technical features, and what kinds of applications they can support.
3. Identify the important issues of developing mobile computing systems and applications.
4. To develop mobile computing applications by analysing their characteristics and
requirements, selecting the appropriate computing models and software architectures, and
applying standard programming languages and tools.

Introduction to Mobile Communications and Computing:

Applications, limitations and architecture. Radio Communications: power model, path loss model,
interference and frequency reuse. Cellular Networks: Generations, GSM, GRPS, UMTS and future
architectures. [6L]

Wireless Standards Wireless LAN – IEEE 802.11 – Infrared vs Radio Transmission, Infrastructure
Networks, Ad-hoc Networks, HIPERLAN, Bluetooth Wireless ATM – Working group, Services,
Reference Model, Functions, Radio Access Layer, Handover, Location Management, Addressing
Mobile Quality of Service, Access Point Control Protocol. [6L]

Wireless Medium Access Control:

Motivation for a specialized MAC (Hidden and exposed terminals, Near and far terminals), SDMA,
FDMA, TDMA, CDMA. IEEE 802.11 architecture and services. Distributed Coordination Function
(DCF) and Point Coordination Function (PCF). [6L]

Mobile Platforms and Applications:

Mobile Device Operating Systems – Special Constraints & Requirements – Commercial Mobile
Operating Systems – Software Development Kit: iOS, Android, BlackBerry, Windows Phone –
MCommerce – Structure – Pros & Cons – Mobile Payment System – Security Issues [10L]

Mobile Network Layer:

Basic Mobile Network Layer Mobile IP Goals, Assumptions and Requirements, Entities, IP packet
Delivery Agent Advertisement and Discovery, Registration. Tunnelling and Encapsulation,
Optimization Reverse Tunnelling, IPv6, DHCP. Adhoc Networks - Characteristics, Performance
Issues, Routing in mobile hosts. [6L]
Mobile Transport Layer:

Factors affecting TCP performance in wireless and mobile environment. Indirect TCP (I-TCP),
Snooping TCP(S-TCP), Mobile TCP (TCP) and Transaction oriented TCP (T-TCP). [6L]

Reference Books:

1. MartynMallick, “Mobile and Wireless Design Essentials”, Wiley Publishing, 2003.

2. D.P. Agrawal and Q.-A. Zeng, “Introduction to Wireless and Mobile Systems”, 2nd edition,
Thomson Learning, 2006.
3. J. Schiller, “Mobile Communications”, 2nd edition, Pearson Education, 2003.

MCA T25: Elective I- CHOICE-IV: Digital Marketing [40L]

Course Outcomes (COs):

CO1: Explain emerging trends in digital marketing and critically assess the use of digital marketing
tools
CO2: Implement SEO techniques, social media marketing and web analytics for business success
CO3: Demonstrate understanding of Social Media and Email Marketing
C0$: Use Web Analytics to improve digital marketing strategy

UNIT I: GOING DIGITAL - THE EVOLUTION OF MARKETING

The changing face of advertising, The technology behind digital marketing, Need of digital
marketing strategy, business and digital marketing, Defining the digital marketing strategy ,
Understanding the digital consumer, Mind the Ps – Place, Price, Product and Promotion., Building
your digital footprint (Website)

UNIT II: Search Engine Optimization (SEO)

Searching Engine Marketing, Search Engine Optimization, Measuring SEO Success, Mapping with
SEO Journey, Search Advertising: Online Advertising Payment Models, Search Advertising
(Desktop & Mobile Devices), Planning & Executing a search Advertising Camping, Strategic
Implications of Advertising on the search Network.

UNIT III: Social Media Marketing

What is Social Media? Social Media Marketing, Social Media Marketing Strategy, Adopting Social
Media in Organizations: Internal Learning, Paid-Owned Earned Media, Social CRM, Mobile
Marketing: Mobile Internet in India, What is Mobile Marketing? Email Marketing Strategy, Forms
of Mobile Marketing, Mobile Advertising, M-Commerce.

UNIT IV: E-Mail Marketing

E-Mail Marketing in India, What is E-Mail Marketing? E-Mail Marketing Strategy, Executing E-
Mail Marketing, Internet Marketing: Internet Marketing Strategy, Content Marketing, Content
Marketing in India.

Unit-V: WEB ANALYTICS

Introducing Google Analytics- Digital Analytics, Working of Google Analytics, Google Analytics
setup, How to set up views with filters, The Google Analytics Interface, Navigating Google
Analytics, Google Analytics reports- Case studies.

Text Books:
1. Marketing- A Practical approach in the India Context by Moutusy Maity, Oxford
2. Justin Cutroni, Google Analytics: Understanding Visitor Behavior, Shroff, First Edition,
2010
3. Deepak Bansal, A Complete Guide To Search Engine Optimization, B.R. Publishing
Corporation, First Edition,2009

MCA M21-Environmental Science [40L]

Perspectives of environment and society:

Genesis of environmentalism; Social issues and major environmental movements; Global
environmental crisis; Human population and environment; Concepts of ecological footprints;
Impact of technology on society; Gender and environment; Environment education and awareness;
Global environmental initiatives.

Ecosystems and biodiversity:

• Concept of an ecosystem.
• Structure and function of an ecosystem.
• Producers, consumers and decomposers.
• Energy flow in the ecosystem.
• Ecological succession.
• Food chains, food webs and ecological pyramids.
• Introduction, types, characteristic features, structure and function of the following ecosystem
:
a) Forest ecosystem
b) Grassland ecosystem
c) Desert ecosystem
d) Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)

 Types of diversity; Biodiversity documentation and bioprospecting; Ecosystem case studies

– wetland, forest and coastal; Wildlife biology and trade;

Natural Resources:
Renewable and non-renewable resources :
 Natural resources and associated problems.
a) Forest resources : Use and over-exploitation, deforestation, case studies. Timber extraction,
mining, dams and their effects on forest and tribal people.
b) Water resources : Use and over-utilization of surface and ground water, floods, drought,
conflicts over water, dams-benefits and problems.
c) Mineral resources : Use and exploitation, environmental effects of extracting and using
mineral resources, case studies.
d) Food resources : World food problems, changes caused by agriculture and overgrazing,
effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity, case
studies.
 e) Energy resources : Growing energy needs, renewable and non renewable energy sources,
use of alternate energy sources. Case studies.
f) Land resources: Land as a resource, land degradation, man induced landslides, soil erosion
and desertification.
 Role of an individual in conservation of natural resources.
 Equitable use of resources for sustainable lifestyles.

Environmental Pollution
Definition
 Cause, effects and control measures of :
a) Air pollution
b) Water pollution
c) Soil pollution
d) Marine pollution
e) Noise pollution
f) Thermal pollution
g) Nuclear hazards
 Solid waste Management: Causes, effects and control measures of urban and industrial
wastes.
 Role of an individual in prevention of pollution.
 Pollution case studies.
 Disaster management: floods, earthquake, cyclone and landslides.

Waste Reduction and Management: Classification of wastes; Strategies of waste segregation and
disposal; Technologies of waste remediation; Importance of “reduce, reuse, recycle and restore”;
Case studies- hazardous waste and electronic waste;

Environmental Law and Ethics: Environmental legislation in India; Provisions for environment in
Indian Constitution; Existing environmental acts in India; Indian Organization of Standards and
Ecomarks; Environmental ethics; Protection of traditional knowledge; Concepts of piracy and
patenting;
 Semester-3

MCA T31-Data Science [40L]

Course Objective:
To develop on understanding of data science pipeline. Data Cleaning, Pre-processing, EDA, Deep
Learning based Models, Overview of Big Data, Data Visualization.
Introduction: [4L]
 Defining Data Science and Data scientist
 Different types of data
 Gaining insight into the data science process
Overview of Data Science Process [5L]
 Defining Data Science Goals
 Data Retrieving
 Cleaning, Transforming, Integrating
 Exploratory Data Analysis

Statistics for Data Science: [6L]

 Descriptive Statistics
 Probability, Random Variable, Probability Distribution
 Sampling Distribution
 Hypothesis Testing and Inference
Data Visualization Tools: [5L]
 Pie Charts, Bar Charts
 Histogram
 Box Plot, Scatter Plots
 Heat Maps
 Word Clouds
Big Data Ecosystem: [8L]
 Defining Big data
 Hadoop and Map Reduce
 Apache Spark
 No SQL Databases
Building Models: [12L]
 Machine learning recap and motivation of deep learning
 Perceptron, Back Propagation
 Multi-Layer Network
 Activation Function, Loss Function
 Different Optimizers, Regularization Techniques
 Overview of CNN, RNN, Autoencoder, GAN
Reference Books:
1. Cady F. The data science handbook. John Wiley & Sons; 2017 Jan 20.
2. The Art of Data Science: A Guide for Anyone who Works with Data
3. Introducing Data Science: Big data, machine learning and More Davy Cielen, Arno
Meysman

MCA T32-Cryptography and Network Security [40L]

Introduction and Symmetric Key Encipherment [15L]

Introduction: Security goals, Attacks, Services and Mechanism, Techniques.

Symmetric Key Mathematics: Integer arithmetic, Modular arithmetic, Residue Matrices, Linear
Congruence, Algebraic Structures, GF(2n) fields.
Traditional Symmetric Key Ciphers: Substitution ciphers- monoalphabetic, polyalphabetic.
Transposition ciphers- keyless, keyed. Kerchoff’s Principle, Crypto analysis attacks- cipher text
only, known plaintext, chosen plaintext, chosen cipher text.
Block and Stream ciphers: Operational principal, Electronic Codebook Mode (ECB), Chain Block
Chaining Mode (CBC), Cipher Feedback Mode (CFB), Output Feedback Mode (OFB), Counter
Mode (CTR).
Data Encryption Standard (DES): Structure, Key generation, Security, Multiple DES.

Asymmetric Key Encipherment [10L]

Symmetric Key Mathematics : Primes, Euler’s Phi function, Fermat’s theorem, Euler’s Theorem,
Chinese Remainder Theorem, Quadratic Congruence, Fast Exponentiation , Discrete Logarithm.
Asymmetric Key Cryptography : General Principal, Trapdoor One Way Function, Knapsack
Cryptosystem, RSA Cryptosystem, Rabin Cryptosystem, El-GamalCryptosystem.

Integrity, Authentication, and Key Management [10L]

Message Integrity : Document and Finger print, Message and Message Digest, Difference,
integrity Check.
Message Authentication: Modification Detection Code (MDC), Message Authentication Code
(MAC), Cryptographic Hash Functions , Digital Signature.

Entity Authentication: Password, Challenge Response, Zero Knowledge, Biometrics.

Key Management: Symmetric Key Distribution, Public Key Distribution.

Key Management and Distribution: Symmetric key distribution using symmetric encryption,
Diffie-Hellman Exchange, Hierarchical Key Control, Session Key Lifetime, Transparent Key
Control Scheme, Decentralized Key Control, Controlling Key Usage, Symmetric Key Distribution
Using Asymmetric Encryption, Simple Secret Key Distribution Scheme, Distribution Of Public
Keys, Public Announcement Of Public Keys, Publicly Available Directory, Public Key Authority,
Public Keys Certificates.

Network Security [5L]

Layer Security: Application Layer- PGP and S/MIME, Transport Layer- SSL and TLS, Network
Layer-IPSec.
Reference Books:

1. Handbook of Applied Cryptography, Alfred J. Menezes, Paul C. Van Oorschot and Scott A.
Vanstone, CRC Press.
2. Cryptography and Network Security: Principles and Practice, William Stallings, Prentice Hall of
India.
3. A course in number theory and cryptography, Neal Koblitz, , Springer.
4. Introduction to Cryptography, Undergraduate Text in Mathematics, Johannes A. Buchmann,
Springer.
5. Cryptography Theory and Practice, Doug Stinson, CRC Press.

MCA T33-IoT and Embedded Systems [40L]

Course Objectives:
 To understand fundamentals of IoT and embedded system including essence, basic design
strategy and process modeling.
 To introduce students a set of advanced topics in embedded IoT and lead them to understand
research in network.
 To develop comprehensive approach towards building small low cost embedded IoT system.
 To understand fundamentals of security in IoT,
 To learn to implement secure infrastructure for IoT
 To learn real world application scenarios of IoT along with its societal and economic impact
using case studies

Course Outcomes:
 On completion of the course, student will be able to:
 Learn about the various phases of Embedded System Design.
 Learn about the various components of IOT infrastructure.
 Implement an architectural design for IoT for specified requirement
 Learn about Edge and Cloud computing for IoT Systems.
 Learn about the Security Implementation in IoT framework.
 Solve the given societal challenge using IoT

Syllabus:

Module 1: Introduction to Embedded System and Internet of Things- [5L]

Application Domain and Characteristic of Embedded System, Introduction to ARM processor and
its architecture, Definition and characteristics of IoT, IoT Technical Building Blocks, IoT
communication models.

Module 2: Embedded IoT and Physical Devices- [8L]

M2M: The internet of devices, RFID: The internet of objects, WSN: The internet of transducer,
SCADA: The internet of controllers, Exemplary device: Raspberry Pi, Raspberry Pi interfaces,
Programming Raspberry Pi with Python

Module 3: Embedded IoT Platform Design Methodology- [6L]

M2M and IoT Technology Fundamentals- Devices and gateways, Local and wide area networking,
Data management, Business processes in IoT, Everything as a Service(XaaS), M2M and IoT
Analytics, Knowledge Management.
Module 4: IoT Gateway- [5L]
Introduction Gateway, Edge vs Fog Computing, Communication Models - Edge, Fog and M2M,
Data Exchange Formats (JSON, XML), MQTT Protocol, Data Aggregation using Gateway.

Module 5: IoT Security- [6L]

Vulnerabilities of IoT, Security Requirements, Challenges for Secure IoT, Threat Modeling, Key
elements of IoT Security: Identity establishment, Access control, Data and message security, Non-
repudiation and availability.

Module 5: IoT Physical Servers, Cloud Offerings- [5L]

Introduction to Cloud Storage Models, Communication API, Cloud for IoT, Python Web
Application Framework, Web Services for IoT, Platform.

Module 6: Case Studies- [5L] Smart and

Connected Cities, An IoT Strategy for Smarter Cities, Smart City IoT Architecture. IoT Wearables,
Health care systems, Agri and Allied sectors.

MCA T34: Elective II- CHOICE-I: Quantum Computing

Course Objective:

 Learn the specific properties of quantum computing in comparison with randomized

computing;
 Provide basic knowledge of quantum information theory, quantum algorithms which exploit
different quantum mechanical phenomena like superposition, entanglement etc.
 Implement basic quantum algorithms.
 Learn about quantum circuit synthesis with focus on quantum error correction.
Course Syllabus: [40 Lectures]

1. Introduction to Hilbert Space: [6L]

Linear vector space, scalar product, eigenvalue and eigenvectors, self-adjoint operators, unitary
operators, projection operators, spectral decomposition, tensor product.
2. Basic Introduction to Quantum Mechanics: [8L]
Postulates of quantum mechanics, uncertainty principle, unitary dynamics, two-level quantum
system. (ii) Multipartite quantum systems, quantum entanglement, Schmidt decomposition, Density
operator. (iii) No-cloning theorem, Kraus operators.
3. Basic Quantum Information Processing: [6L]
(i) Quantum Dense Coding, (ii) Quantum Teleportation, (iii) Remote State Preparation, (iv)
Quantum Key Distribution .
4. Basic Quantum Circuit: [6L]
 Circuit model of computation, Reversible computing, Reversible to quantum circuits. (ii)
Quantum gates – Walsh-Hadamard transform, SWAP, CNOT, FREDKIN gates, Basic quantum
circuits.
5. Quantum Algorithms: [8L]
Quantum Parallelism, Deutschs algorithm, Deutsch-Jozsa algorithm, Simons algorithm, Grovers’
search algorithm, Quantum Fourier Transform and Shor’s factoring algorithm, Elementary idea of
Quantum Random Walk.
6. Quantum Error Correction: [6L]
Linear Quantum error correcting codes - Shor code, Steane code, Laflamme code and
corresponding Stabilizer structures. Topological codes.

Reference Books:

 Quantum Computation and Quantum Information, Michael A. Nielsen and Isaac L. Chuang,
Cambridge University Press, 2002.
 From Classical to Quantum Shannon Theory, Mark M. Wilde, arXiv: 1106.1445 [quant-ph]
 An Introduction to Quantum Computing, Phillip Kaye, Raymond Laflamme, and Michele Mosca.
Oxford U. Press, New York, 2007.
 Quantum Computing, Jozef Gruska, McGraw-Hill, 1999.

MCA T34: Elective II- CHOICE-II: High Performance Computing [40 Lectures]

Course Objective: Provide basic knowledge in High Performance Computing with focus on
practical aspects and include examples which are relevant to the current industry requirements like
Compiler Optimization and Open MP Parallelization, MPI Programming, Vectorization, Usage of
Performance Libraries and Profiling.

Learning Outcome:

After successful completion of the course, student will be able to:

 Understand the architecture of modern CPU’s and how this architecture influences the way
programs should be written.
 Optimize all aspects in the processes of programming: from compilation, starting and
running program by OS, executing (parallel) instructions by CPU, to writing output to disk.
 Write numerical software that exploits the memory hierarchy of a CPU, to obtain a code
with close to optimal performance.
 Analyze an existing program for OpenMP and MPI parallelization possibilities.
 Evaluate the possibilities of accelerators to speed up computational work.

Syllabus: [40 lectures]

Parallel architecture: [6L]
Inter-process communication, Synchronization, Mutual exclusion, Basics of parallel architecture,
Introduction to MPI, Portable Extensible Toolkit for Scientific Computation, and other software
frameworks for HPC Parallel programming with message passing using MPI.

Parallel Processing Concepts: [6L]

Levels of parallelism (instruction, transaction, task, thread, memory, function), Models (SIMD,
MIMD, SIMT, SPMD, Dataflow Models, Demand-driven Computation etc), Architectures: N-wide
superscalar architectures, multi-core, multi-threaded Processor Architecture, Multicore-
Interconnection.

High performance computing architectures: [10L]

BM CELL BE, Nvidia Tesla GPU, Intel Larrabee Micro architecture and Intel Nehalem micro-
architecture.
Design Issues in Parallel Computing: [12L]
Memory hierarchy and transaction specific memory design: Thread Organization, Synchronization,
Scheduling, Job Allocation, Job Partitioning, Dependency Analysis, Mapping Parallel Algorithms
onto Parallel Architectures, Open MP, Performance Analysis of Parallel Algorithms Limitations
Facing Parallel Computing, Bandwidth Limitations,Latency Limitations, Latency Hiding/Tolerating
Techniques and their limitations.

Parallel Programming Languages: [6L]

OpenCL and CUDA programming

Reference Books:

1. Kai Hwang & Briggs: Computer Architecture and Parallel Processing.

2. Kai Hwang: Advanced Computer Architecture Parallelism, Scalability, Programmability.

3. J. L. A. Patterson, Morgan Kaufmann: Computer Architecture: A Quantitative Approach

4. A.Silberschatz, P. B. Galvin, G. Gagne, Operating System Concepts, John Wiley.

5. Charles Severance and Kevin Dowd, O Reilly: High Performance Computing (RISC
Architectures, Optimization & Benchmarks)

6. K. A. Dowd, Michael Kosta Loukides, O Reilly: High Performance Computing.

7. Ananth Grama et. al, Addison-Wesley: Introduction to Parallel Computing.

8. David E. Culler, Jaswinder Pal Singh, Anoop Gupta: Parallel Computer Architecture: A
Hardware/Software Approach, Gulf Professional Publishing.

9. R. E. Bryant and D. R. O’Hallaron, Computer Systems: A Programmer’s Perspective,

Prentice Hall.

10. Jason Sanders and Edward Kandrot: CUDA by example - An introduction to General-
Purpose GPU programming.

MCA T34: Elective II- CHOICE-III: VLSI [40 Lectures]

Course Objective:

This course give a basic idea of the theories and techniques of design and testing of VLSI circuits
implemented using CMOS technology. In this course, we will learn the fundamental concepts and
structures of designing digital VLSI systems include CMOS devices and circuits, standard CMOS
fabrication processes, CMOS design rules, static and dynamic logic structures, interconnect
analysis, CMOS chip layout, simulation and testing, low power techniques, design tools and
methodologies, VLSI architecture. The course gives an understanding of the different steps in
designing a vlsi circuit and the different techniques for testing them in FPGA architecture.

1. Introduction to VLSI Physical Design : [1 Lecture]

VLSI design cycles, Design and system packaging style, design rules.
2. Fabrication of VLSI Devices : [3 Lectures]
Transistor fundamentals, Fabrication material, fabrication of VLSI circuits, layout of basic devices,
Scaling method.

3. Partitioning : [4 lectures]
Kernighan-Lin Algorithm, Stimulated Annealing.

4. Floor Planning and Pin-Assignment: [5 lectures]

Constraint based floor planning, Integer programming based floor Planning, Rectangular
Dualization, Floorplanning for Mixed block and cell design, Timing driven Floorplanning, General
Pin Assignment, Channel Pin Assignment.

5. Placement : [5 Lectures]
Simulated Annealing, Force Directed Placement, Sequence-Pair Technique, Breuer’s algorithm,
Terminal Propagation Algorithm.

6 . Routing : [10 lectures]

(i)Global Routing - Maze Routing Algorithms, Line-Probe Algorithms, Shortest Path Based
Algorithms, Steiner Tree based Algorithms.

(ii)Detailed Routing – Routing Models, routing problems, single layer routing algorithms,
double layer channel routing algorithms, three layer channel routing algorithms.

7.Compaction : [2 lectures]
One-Dimensional compaction, 11/2-Dimensional compaction, two-Dimensional compaction,
Hierarchical compaction.

8. Basics of Testing and Fault Modelling : [5 lectures]

Introduction to Testing, Faults in digital circuits, Modeling of Faults, Logical Fault Model, Fault
Detection, Fault Location, Stuck-at-fault Models, Fault Equivalence, fault collapsing, fault
Dominance, Checkpoint Theorem.

9. FPGA: [5 lectures]
FPGA Architectural options, granularity of function and wiring resources, coarse V/s fine grained,
vendor specific issues (emphasis on Xilinx and Altera), Logic block architecture: FPGA logic cells,
timing models, power dissipation I/O block architecture: Input and Output cell characteristics, clock
input, Timing, Power dissipation.

Reference Books :
1. Algorithms for VLSI Physical Design Automation, Naveed Sherwani.
2. An introduction to VLSI physical design, Majid Sarrafzadeh, C.K. Wong
3. Essential of Electronic Testing for Digital, Memory and Mixed Signal VLSI circuits :
Micheal L. Bushnell, Vishwani Agarwal.
4. VLSI Physical Design, Andrew B. Kahng, Jens Liening, Igor L. Markov, Jin Hu.
5. VLSI Design, K. Lal. Kishore, V.S.V Prabhakar.
6. Digital Systems and Testable Design, M. Abramovici, M.A. Breuer, A.D. Friedman, Jaico
Publishing House.
MCA T34: Elective II- CHOICE-IV: Real-time Systems [40 Lectures]

Course Objective:

 To study issues related to the design and analysis of systems with real-time constraints.
 The problem of satisfying real-time constraints is a scheduling problem, so much attention is
devoted to such problems.
Course Syllabus: [40 Lectures]

1. Introduction to Real-time Systems [ 6L]

Definition, Typical Real Time Applications: Digital Control, High Level Controls, Signal
Processing etc., Release Times, Dead-lines, and Timing Constraints, Hard Real Time Systems
and Soft Real Time Systems, Reference Models for Real Time Systems: Processors and
Resources, Temporal Parameters of Real Time Workload, Periodic Task Model, Precedence
Constraints and Data Dependency.

2. Approaches to Real-Time Scheduling [6L]

Clock-driven approach, Weighted round-robin approach, Priority-driven approach, Dynamic versus
static system, Effective release times and deadlines, Optimality of the EDF and LST algorithms,
Nonoptimality of the EDF and LST algorithms, Challenges in validating timing constraints in
priority-driven systems, Off-line versus on-line scheduling,

3. Scheduling of Periodic, aperiodic, sporadic Tasks [6L]

Static assumption, Fixed-priority versus dynamic-priority algorithms, Maximum schedule
utilization, Optimality of the RM and DM algorithms, A schedulability test for fixed-priority tasks
with short response times, Deferrable servers, Sporadic servers, Constant utilization, total
bandwidth, and weighted fair-queuing servers, Slack stealing in deadline-driven systems, Slack
stealing in fixed-priority systems, Scheduling of sporadic jobs, Real-time performance for jobs,
with soft timing constraints, Low-level scheme for integrated scheduling
4. Resources and Resource Access Control [6L]
Assumptions on resources and their usage, Effects of resources contention and resource access
control, Nonpreemptive critical sections, Basic priority-inheritance protocol, Basic priority-ceiling
protocol, Stack-based, priority-ceiling (ceiling-priority) protocol, Use of priority-ceiling protocol in
dynamic-priority system, Preemption-ceiling protocol, Controlling accesses to multiple-unit
resources, Controlling concurrent accesses to data objects
5. Multiprocessor Scheduling and recent trends [8L]
Model of multiprocessor and distributed systems, Task assignment, Multiprocessor priority-ceiling
protocol, Elements of scheduling algorithms for end-end periodic tasks, End-to-end tasks in
heterogeneous systems, Predictability and validation of dynamic multiprocessor systems. Mix-
critical scheduling, Fair Scheduling, P-fair scheduling, DP-Fair scheduling, Fair scheduling for
reconfigurable systems, fault-tolerant scheduling
6. Real –Time Communication [4L]
Model of real-time communication, Priority-based service disciplines for switched networks,
Weighted round-robin service disciplines, Medium access-control protocols of broadcast networks,
Internet and resource reservation protocols, Real-time protocol, Communication in multi computer
systems
 7. RTOS and Programming for Real-time Systems [4L]
From Pseudo-¬ kernels to Operating Systems, Theoretical Foundations of Scheduling, System
Services for Application Programs, Memory Management Issues, Selecting Operating Systems.
Coding of Real-¬‐Time Software, Object-¬‐Oriented, Languages, Overview of Programming
Languages, Automatic Code Generation.

Reference Books:

 Real Time Systems – Jane W. S. Liu, Pearson Education Publication

 Hard Real-Time Computing Systems, Buttazzo, Giorgio, Springer
 Real-Time Systems and Programming Languages: Ada, Real-Time Java and C/Real-Time
POSIX (International Computer Science Series), Addison Wesley Longmain

MCA T35: Elective III- CHOICE-I: Computer Vision [40 Lectures]

Course Objective:

Be familiar with both the theoretical and practical aspects of computing with images. Have
described the foundation of image formation, measurement, and analysis. Understand the various
techniques of feature extraction for image data. Grasp the principles of state-of-the-art pattern
analysis techniques. Get an overview of some important applications based on computer vision
approaches.

Course Syllabus: [40 Lectures]

Unit 1: [4L]
Overview, computer imaging systems, lenses, Image formation and sensing, Image analysis, pre-
processing and Binary image analysis.

Unit 2: [6L]
Edge detection, Edge detection performance, Hough transform, corner detection.

Unit 3: [6L]
Segmentation, Morphological filtering, Fourier transform. Wavelet Transform.

Unit 4: [8L]
Feature extraction:shape, histogram, color, spectral, texture etc., Feature analysis, feature vectors,
distance/similarity measures.

Unit 5: [12L]
Pattern Analysis: Clustering: K-Means, K-Medoids, Mixture of Gaussians
Classification: Discriminant Function, Supervised, Un-supervised, Semi-supervised
Classifiers: Bayes’, KNN, ANN models; Dimensionality Reduction: PCA, LDA, ICA, and Non-
parametric methods; Introduction to CNN

Unit 6: [4L]
Recent trends: Activity Recognition, 3D Vision, Biometrics.

Reference Books:

1. Digital Image Processing, Rafael C. Gonzalez and Richard E. Woods

 2. Computer Vision: A Modern Approach, David Forsyth and Jean Ponce
3. Computer Vision: Algorithms and Applications by Richard Szeliski.
4. Programming Computer Vision with Python, Jan Erik Solem
5. Pattern Recognition and Machine, Christopher Bishop

MCA T35: Elective III- CHOICE-II: Deep Learning [40 Lectures]

Course Outcome:
At the end of this course, students would be able:

 To understand basics of deep learning

 To study the architecture of deep neural networks.
 Apply deep neural networks in real life applications.

Introduction: [5L]

 Introduction to deep learning

 Neural network basics
 Artificial neural network and its layers
 Exploring activation functions
 Derivatives and loss functions

Deep Neural Networks [5L]

 Backpropagation in feed-forward networks

 Feed-forward networks for classification and regression
 Gradient descent
 Hands on working with Keras/TensorFlow/Pytorch

Improving performance of deep neural networks: [5L]

 Regularization: L1, L2, Dropout

 Early stopping
 Optimization for training deep neural network models
 Hyper-parameter tuning

Autoencoders: [5L]

 Introduction to auto-encoders
 Application of auto-encoders in dimension reduction
 Case study: Application of auto-encoder on MNIST dataset: Dimension reduction

Restricted Boltzmann machines (RBMs) [5L]

 Introduction to RBMs
  Training RBMs
 Collaborative filtering with RBM
 Case study: Application of RBM on MNSIT dataset: Dimension reduction / Classification /
Collaborative filtering / feature learning / Topic modelling
Convolutional Neural Network (CNN) [8L]
 Introduction to Convolutional neural networks
 Sub-operations: Convolution, Pooling
 Classical CNN architectures
 Case study: Application of CNN in computer vision: Image classification / Object detection
Recurrent Neural Networks [7L]
 The sequence learning problem
 The RNN sequence model
 The LSTM model
 Case study: Application of RNN in NLP / Time series forecasting

Reference Books:

1. Deep Learning- Ian Goodfelllow, Yoshua Benjio, Aaron Courville, The MIT Press
2. S. Haykin, “Neural networks and learning machines”, Pearson 2008.
3. Bishop, C. M. Neural Networks for Pattern Recognition. Oxford University Press. 1995.
4. Duda, R.O., Hart, P.E., and Stork, D.G. Pattern Classification. Wiley-Interscience. 2nd
Edition. 2001.
5. Trevor Hastie, Robert Tibshirani, and Jerome Friedman, “The Elements of Statistical
Learning: Data Mining, Inference, and Prediction”, Springer 2013
6. www.deeplearning.ai

MCA T35: Elective III- CHOICE-III: Natural Language Processing [40 Lectures]

Course Objective:
To understand natural language processing and to learn how to apply basic algorithms in this field.
To get acquainted with the algorithmic description of the main language levels: morphology, syntax,
semantics, and pragmatics, as well as the resources of natural language data - corpora. To
understand the techniques of retrieval, discovering relationship, topic modeling etc. To develop an
understanding of word embedding and LSTM.
Introduction: [4 Lectures]
 NLP tasks in syntax, semantics, and pragmatics.
 Applications such as information extraction, question answering, and machine translation.
 The problem of ambiguity
 The role of machine learning. Brief history of the field
Regular Expressions and Context Free Grammars [4 Lectures]
 Regular languages, and their limitations.
  Finite-state automata. Practical regular expressions for finding and counting language
phenomena.

 Constituency, CFG definition, use and limitations.

 Top-down parsing, bottom-up parsing, and the problems with each.

 The desirability of combining evidence from both directions

Language modelling and Naive Bayes: [8 Lectures]

 Probabilistic language modelling and its applications.
 Markov models. N-grams.
 Estimating the probability of a word, and smoothing.
 Generative models of language.
 Their application to building an automatically-trained email spam filter
Part of Speech Tagging and Sequence Labelling: [4 Lectures]
 Lexical syntax.
 Hidden Markov Models (Forward and Viterbi algorithms and EM training).
Text Retrieval [8 Lectures]
 Text Retrieval, Text Retrieval vs. Database Retrieval

 Document Selection vs. Document Ranking

 Common Form of a Retrieval Function

 Vector Space Retrieval Models

 TF, TF-IDF

Topic Analysis [4 lectures]

 Topics as Terms

 Matrix Factorization Techniques

 Latent Semantic Index

 Latent Dirichlet Allocation

LSTM Recurrent Neural Networks Introduction [8 Lectures]

 Any basic introduction to perceptron and back propagation

 Word Embedding

 Recurrent Neural Network

 LSTM, GRU
  Transformer

Reference Books:
1. Jurafsky, Dan and Martin, James, Speech and Language Processing, Second Edition,
Prentice Hall, 2008.
2. Manning, Christopher and Heinrich, Schutze, Foundations of Statistical Natural
Language Processing, MIT Press, 1999.
3. Text Data Management and Analysis: A Practical Introduction to Information Retrieval
and Text Mining ChengXiangZhai, Sean Massung, ACM books

MCA T35: Elective III- CHOICE-IV: Computational Biology [40L]

Course Learning Outcome:

After successful completion of the course, student will:

 Have a basic knowledge of modern molecular biology and genomics.

 Have basic understanding of how biological data is stored and retrieved from various
biological databases.
 Understand the advantages and disadvantages of different machine learning techniques in
bioinformatics and how the relative merits of different approaches can be evaluated by
correct benchmarking techniques.
 Understand how theoretical approaches can be used to model and analyse complex
biological systems.

Syllabus: [40 lectures]

Cell Biology: [4]
System Biology, Central Dogma of Molecular Biology, Biological Database: Sequence data, Gene
expression data, Micro-array experiment, NCBI database, Challenges faced in the integration of
biological data, Data management and data integration in bio-informatics, Introduction to Next
Generation Sequencing.

Sequence Analysis: [8]

Sequence similarity, homology, and alignment, Pair wise alignment: scoring model, dynamic
programming algorithms, heuristic alignment, and pair wise alignment using Hidden Markov
models (HMM), Sequence file formats – GenBank, FASTA, etc., Sequence similarity based search
engines (BLAST), Multiple alignment: scoring model, local alignment gapped and un-gapped
global alignment, Motif finding: motif models, finding occurrence of known sites, discovering new
sites, Amino Acid, Protein, Phylogenetic tree construction: Neighbor Joining Algorithm.

Biological Pathways: [4]

Gene regulatory network, Transcription factors, Signal Transduction, Protein-Protein interaction,
Boolean Network, Stochastic gene networks, Network connectivity.

Clustering, Classification & Rule mining: [14]

Clustering algoritms: k-means, k-medoid, Isodata, AGNES, DIANA, BIRCH, DBSCAN, Fuzzy C-
Means, Cluster validity indices: DB-Index, Dunn Index, Xie-Beni Index etc.
Classification algorithms: Bayes’ theorem, Naïve Bayes’ classifier, Bayesian belief network,
Decision Tree.Association rule Mining: Apriori, FP-Growth.

Statistical approach: [10]

Information theory (Entropy), Prediction using linear regression, multiple regression, predicting
reading frames, maximal dependence decomposition, Expectation-maximization, Bayesian model,
Gaussian Mixture Model(GMM), P-value statistics(GO), z-score, t-test, F-test, Validation
parameters: True positive, Sensitivity, Specificity, FDR, Accuracy.

Recommended Books:
1. Molecular Biology of the Cell, Bruce Alberts, Alexander Johnson, Julian Lewis, Martin
Raff, Keith Roberts, Peter Walter, New York: Garland Science; 2002.
2. Bioinformatics: Sequence and Genome Analysis, David W. Mount, Cold Spring Harbor
Laboratory Press.
3. Bioinformatics And Functional Genomics: A Short Course, Jonathan Pevsner, Wiley-Liss
4. Data Mining Concepts and tecniques, Han & Kamber, Elsevier
5. Introduction to Bioinformatics, Arthur M. Lesk, Oxford University Press

MCA M31-Ethics & Values and Cyber Law [40L]

Ethics:

1. Values- Definition - Sources / Formulation - Nature Values - Human integrity Values- Value
spectrum of good life - personality and mental health-values in Indian Constitution -Values
in simplicity - moral and ethical values comparison between Ethics and Values.
2. Ethics - Definition – Sources/ formulation – Nature of ethics - Descriptive - normative -
Applied -Ethical theories and Ethics in profession.
3. Morals and Principle in Ethics - Code Engineering of profesional ethics- Importance of
values and ethics in profession- Social and ethical responsibilities of technologies -
Environmental ethics in Sustainable development.

Cyber laws:

Electronic Governance- Digital Signature, Secure Electronic Records and Secure Digital Signature;
Attribution, Acknowledgement and dispatch Of electronic records; digital signature certificates;
regulation of certifying authorities; duties of subscribers; computer ethics-philosophical and
professional, privacy and accountability; On-line ethics in e-mail and the Internet . Offences,
Penalties and adjudications; the Cyber Regulations Appellate Tribunal.

General overview of Intellectual Property:

intellectual capital, intangible assets, Patents, Designs, Trademarks, trade secrets and unfair
competition, Copyrights and related rights.

Patent: Registration, filing applications and challenging registration in India.