MASTER OF COMPUTER APPLICATION

Syllabus w.e.f. the Academic Session 2020-2021

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY

WEST BENGAL
Master of Computer Application

First Year: Semester-I

Code: MCAN-101 Paper: Programming Concept with Python
Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
Learn, understand and comprehend the concept of programming.
Design algorithm to solve simple programming problem.
Understand and remember syntax and semantics of Python.
Create application using secondary storage.
Understand and apply library for data analysis.
 Apply Python to implement different solutions for the same problem and analyze why one solution is better than the
other.
To write program for real life problem.
UNIT COURSE CONTENT
Fundamentals of Computer (6L)
History of Computers, Basic Anatomy of Computer System, Primary & Secondary Memory, Processing Unit, Input
& Output devices. Basic Concepts of Assembly language, High level language, Compiler and Assembler.
1 Number systems (decimal, octal and hexadecimal) with signed and unsigned numbers (using 1’s and 2’s
complement) - their representation, conversion and arithmetic operations.
Packed and unpacked BCD system, ASCII. IEEE-754 floating point representation (half- 16 bit, full- 32 bit, double-
64 bit).
Programming Basics (2L)
2 Problem analysis, Flowchart, algorithms, Pseudo codes, structured programming, Example of Flowchart and
Algorithm representation
Variable and Expression (4L)
Variables as names for values; expressions (arithmetic and logical) and their evaluation (operators, associativity,
3
precedence). Assignment operation; difference between left hand side and right hand side of assignment, Console
input/output: taking input from user and printing user information.
Control Statement and Iteration (5L)
4 If statement, else-if statement, multiple statements within if, multiple if statement. While Loop, For Loop, Nesting
Loops, Controlling Loops using Break and Continue, Else Statement, Range Statement and Pass Statement in Loop.
Collections (2L)
5
Strings, List, Tuples, Dictionary, Set, Selection sort, Bubble sort
Function (2L)
6 Built in function, user defined function, function passing values, function returning values, default parameter values,
Recursive function
File Management (4L)
7 Operations on files (opening, modes, attributes, encoding, closing), read() & write() methods, tell() & seek()
methods, renaming & deleting files and directories
Errors and Exception Handling (2L)
8
Dealing with syntax errors, Exceptions, Handling exceptions with try/except, Cleaning up with finally
Classes and Objects (5L)
Create a Class, Create Object, __Init__() Function, Methods, Self Parameter, Modification and Deletion of Object
9 Parameter, Deletion of Object, Pass Statement, Inheritance and Polymorphism, Scope, Module, Built-In Math
Function, Math Module, Module datetime and Date Objects, RegEx Module andRegEx Functions, Exception
Handling.
Modules& Packages (2L)
10
Importing a module, Creating module, Function aliases, packages
Numpy (6L)
11 ndArray, Pandas: reading files, exploratory data analysis, data preparation and processing, , Matplolib: Scatterplot,
Line plot, Bar plot, Histogram, Box plot, Pair plot
Reference Books:
 N.S. Gill, Handbook of Computer Fundamentals, Khanna Publishing House
 Dr.Jeeva Jose-Taming Python by Programming, Khanna Publishing
 Martin C. Brown – The Complete Reference Python, Mc Graw Hill
 A. Martelli, A. Ravenscroft, S. Holden, Python in a Nutshell,OREILLY.
 Jason Rees-Python Programming:Practical introduction to Python Programming for total beginners,
 Anthony Brun - Python Programming: A Step By Step Guide From Beginner To Expert (Beginner,
Intermediate & Advanced)
 Mark Pilgrim-Diva into Python, Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
 Summerfield Mark- Programming in Python 3,Pearson Education India

MCA Syllabus Page 1 MAKAUT

Master of Computer Application

Code: MCAN-102 Paper: Relational Database Management System

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Identify the need for a database over the file system.
 Understand and implement the process of data insertion, retrieval, and manipulation.
 Understand and analyze the functional dependencies among attributes of the entity set and normalization between
the relations.
 Implement SQL concept for a database transaction.
 Understand and Implement the Transaction control and concurrency control management.
 Evaluate the relational tables, PL/SQL programs, triggers, database files, indexing of RDBMS.
UNITS COURSE CONTENT
Basic Concept (7L)
Database Management System , File based system, Advantages of DBMS over file based system, Database
Approach, Logical DBMS Architecture, Three level architecture of DBMS or logical DBMS architecture,
Need for three level architecture, Physical DBMS Architecture, Database Administrator (DBA) Functions &
Role, Data files indices and Data Dictionary
1 Types of Database, Relational and ER Models: Data Models , Relational Model, Domains, Tuple and Relation,
Super keys, Candidate keys , Primary keys and foreign key for the Relations, Relational Constraints, Domain
Constraint, Key Constraint , Integrity Constraint,- Update Operations and Dealing with Constraint Violations,
Relational Operations
Entity Relationship (ER) Model: Entities, Attributes, Relationships,More about Entities and Relationships,
Conversion of E-R Diagram to Relational Database.
Database Integrity And Normalization (8L)
Relational Database Integrity, The Keys, Referential Integrity, Entity Integrity, Redundancy and Associated
Problems, Single Valued Dependencies, Normalization, Rules of Data Normalization, The First Normal Form,
2
The Second Normal Form, The Third Normal Form, Boyce CODD Normal Form, The Fourth Normal Form,
The Fifth Normal Form, Multi-valued Functional Dependency, Attribute Preservation,Losslessjoin
Decomposition, Dependency Preservation.
File Organization (4L)
Physical Database Design Issues, Storage of Database on Hard Disks, File Organization and Its Types, Heap
3 files (Unordered files), Sequential File Organization, Indexed (Indexed Sequential) File Organization, Hashed
File Organization, Types of Indexes, Index and Tree Structure, Multi-key File Organization, Need for Multiple
Access Paths, Multi-list File Organization, Inverted File Organization.
Structured Query Language (SQL) (7L)
Meaning, SQL commands, Data Definition Language, Data Manipulation Language, Data Control Language,
4
Transaction Control Language, Queries using Order by, Where, Group by, Nested Queries. Joins, Views,
Sequences, Indexes and Synonyms, Table Handling.
Transaction and Concurrency Management (8L)
Transactions, Concurrent Transactions, Locking Protocol,Serializable Schedules, Locks Two Phase Locking
5 (2PL), Deadlock and its Prevention, Optimistic& Pessimistic Concurrency Control. Database Recovery and
Security: Database Recovery meaning, Kinds of failures, Failure controlling methods, Database errors, Backup
& Recovery Techniques, Security & Integrity, Database Security Authorization.
PL/SQL (6L)
6 Introduction to PL/SQL, Variables & Data types, Basic blocks, Conditional & branching statement, Handling
of Cursor, Trigger, Function, Procedure, Package and Exception.
Reference Books:
 Silverchatz, Korth&Sudarshan-Data Base System Concepts, MH.
 Elmasri, Navathe- Fundamentals of Database Systems, Pearson
 C J date-An Introduction to Database, Addison-Wesley Publishing Company
 Majumder& Bhattacharyya-Data Base Management Systems, TMH
 Feuerstein-Oracle PL/SQL Programming,SPD/O’REILLY
 Leon-Data Base Management Systems, VIKAS
 Kroenke-Data Base Processing:Fundamentals, Design &Implementation,PHI
 P.S Deshpande-SQL PL/SQL for Oracle 8 & 8i, Wiley Dreamtech
 P. Bhatia, S. Bhatia, G. Singh- Concepts of Database Management System, Kalyani Publishers

MCA Syllabus Page 2 MAKAUT

Master of Computer Application

Code: MCAN-103 Paper: Computer Organization and Architecture

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Describe the merits and pitfalls in computer performance measurements and analyze the impact of instruction set
architecture on cost-performance of computer design
 Explain Digital Logic Circuits, Data Representation, Register and Processor level Design and Instruction Set
architecture
 Solve problems related to computer arithmetic and Determine which hardware blocks and control lines are used for
specific instructions
 Design a pipeline for consistent execution of instructions with minimum hazards
 Explain memory organization, I/O organization and its impact on computer cost/performance.
UNITS COURSE CONTENT
INTRODUCTION (8L)
Digital Logic Design: Axioms and laws of Boolean algebra, Reduction of Boolean expressions, conversion
1 between canonical forms, Karnaugh map (4 variable), Half Adder, full adder, 4-bitparallel parity bit generator,
checker circuit, Decoder, Encoder, Multiplexer, IC RAM, ROM, Memory Organization, Sequential Circuits, State
transistors, Flip-flop, RS, JK, D-Latch, Master-slave.
INSTRUCTION SET ARCHITECTURE: (8L)
Memory Locations and Addresses: Byte Addressability, Big-Endian and Little-Endian
2 Assignments, Word Alignment, Instructions and Instruction Sequencing, Addressing Modes,
Assembly Language, Subroutines, Additional Instructions, dealing with 32-Bit Immediate
Values.
BASIC PROCESSING UNIT & PIPELINING (8L)
Basic Processing Unit: Some Fundamental Concepts, Instruction Execution, Hardware Components, Instruction
3 Fetch and Execution Steps, Control Signals, Hardwired Control, CISC-Style Processors.
Pipelining: Basic Concept, Pipeline Organization, Pipelining Issues, Data Dependencies, Memory Delays,
Branch Delays, Pipeline Performance Evaluation.
MEMORY ORGANIZATION (8L)
Basic Concepts, Semiconductor RAM Memories, Read-only Memories, Direct Memory Access, Memory
4
Hierarchy, Cache Memories, Performance Considerations, Virtual Memory, Memory Management Requirements,
Secondary Storage.
INPUT OUTPUT & PARALLEL PROCESSING (8L)
Basic Input Output: Accessing I/O Devices, Interrupts, Input Output Organization: Bus Structure, Bus
5 Operation, Arbitration, Interface, Interconnection Standards. Parallel Processing: Hardware Multithreading,
Vector (SIMD) Processing, Shared-Memory Multiprocessors, Cache Coherence, Message-Passing
Multicomputers, Parallel Programming for Multiprocessors, Performance Modeling.
Reference Books:
 Computer Organization and Embedded Systems, 6thEdition, Hamacher Carl, et. al, Tata McGraw
Hill, New Delhi, 2011.
 Computer Organization and Design: The Hardware Software / Interface, 5thEdition, 1994, Patterson David A.
 Computer System Architecture, Revised 3rdEdition, Mano M. Morris,Pearson Education,

MCA Syllabus Page 3 MAKAUT

 Master of Computer Application

Code: MCAN-104 Paper: Discrete Mathematics

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Interpret the problems that can be formulated in terms of graphs and trees.
 Explain network phenomena by using the concepts of connectivity, independent sets, cliques, matching, graph coloring
etc.
 Achieve the ability to think and reason abstract mathematical definitions and ideas relating to integers through
concepts of well-ordering principle, division algorithm, greatest common divisors and congruence.
 Apply counting techniques and the crucial concept of recurrence to comprehend the combinatorial aspects of
algorithms.
 Analyze the logical fundamentals of basic computational concepts.
 Compare the notions of converse, contrapositive, inverse etc. in order to consolidate the comprehension of the logical
subtleties involved in computational mathematics.
UNITS COURSE CONTENT
Logic and Proofs (3L)
1
Propositional logic, Propositional equivalences, Predicates and quantifiers, Nested quantifiers, Rules of inference.
Principles of Mathematical Induction (5L)
2 The Well-Ordering Principle, Recursive definition, The Division algorithm: Prime Numbers, The Greatest Common
Divisor: Euclidean Algorithm, The Fundamental Theorem of Arithmetic.
Sets and Sequence (8L)
Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, Binary Relation, Partial Ordering
3 Relation, Equivalence Relation, Image of a Set, Sum and Product of Functions, Bijective functions, Inverse and
Composite Function, Size of a Set, Finite and infinite Sets, Countable and uncountable Sets, Cantor's diagonal
argument and The Power Set theorem, Schroeder-Bernstein theorem. Fuzzy set, Basic properties of fuzzy set.
Counting and Combinatorics (8L)
Counting, Sum and product rule, Principle of Inclusion Exclusion. Pigeon Hole Principle, Counting by Bijections.
4
Double Counting. Linear Recurrence relations - methods of solutions. Generating Functions. Permutations and
Combination.
Algebraic Structure (9L)
Algebraic Structures with one Binary Operation, Semi Groups, Monoids, Groups, Congruence Relation and
Quotient Structures, Free and Cyclic Monoids and Groups, Permutation Groups, Substructures, Normal Subgroups,
5
Algebraic Structures with two Binary Operation, Rings, Integral Domain and Fields. Boolean Algebra and Boolean
Ring, Identities of Boolean Algebra, Duality, Representation of Boolean Function, Disjunctive and Conjunctive
Normal Form
Graph and Tree (7L)
Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph, Isomorphism, Eulerian and Hamiltonian
6 Walks, Graph Colouring, Colouring maps and Planar Graphs, Colouring Vertices, Colouring Edges, List Colouring,
Perfect Graph, definition properties and Example, rooted trees, trees and sorting, weighted trees and prefix codes,
Bi-connected component and Articulation Points, Shortest distances.
Reference Books:
 Kandel& Baker- Discrete Mathematics for Comp. Scientists & Mathematicians, Mott, PHI
 C.L.Liu- Discrete Mathematical Structure, C.L.Liu,TMH
 G.S.RAO- Discrete Mathematical Structure, New Age International
 DeoNarsingh - Graph Theory With Applications To Engineering And Computer Science, PHI Learning
 Arumugam, Ramachandran- Invitation to Graph Theory, Scitech Publications (India)

MCA Syllabus Page 4 MAKAUT

Master of Computer Application

Code: MCAN-E105A Paper: Environment and Ecology

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Be able to understand the natural environment and its relationships with human activities.
 Be able to apply the fundamental knowledge of science and engineering to assess environmental and health risk.
 Be able to understand environmental laws and regulations to develop guidelines and procedures for health and
safety issues
 Be able to solve scientific problem-solving to air, water, noise and land pollutions.
UNITS COURSE CONTENT
Introduction (4L)
Basic ideas of environment and interrelationship among man society and environment.
1 Environmental problems and issues, Segments of environments, Natural Cycles of environments
Mathematics of population growth and its associated problems, Logistic population growth
Elements of Ecology (3L)
2 Open and closed system ecology, species, population, community, definition of ecosystem-components types
and functions, Environmental perspectives, Montreal protocol
Pollutants and Contaminants (3L)
3 Definition of primary and secondary pollutants and contaminants. Source and effects of different air pollutants
suspended particulate matter, oxides of carbon, nitrogen, sulphur particulate
Air Pollution (5L)
Structures of the atmosphere, global temperature models, Greenhouse effect, global warming; acid rain: causes,
4
effects and control. Lapse rate and atmospheric stability; pollutants and contaminants; smog; depletion of ozone
layer; standards and control measures of air pollution.
Water Pollution (5L)
Hydrosphere; pollutants of water: origin and effects; oxygen demanding waste; thermal pollution; pesticides;
5
salts. Biochemical effects of heavy metals; eutrophication: source, effect and control. Water quality parameters:
DO, BOD, COD. Water treatment: surface water and wastewater.
Land Pollution (5L)
6
Land pollution: sources and control; solid waste: classification, recovery, recycling, treatment and disposal.
Noise Pollution (5L)
7 Noise: definition and classification; noise frequency, noise pressure, noise intensity, loudness of noise, noise
threshold limit value; noise pollution effects and control.
Reference Books:
 Basic Environmental Engineering and Elementary Biology, GourKrishna Das Mahapatra, Vikas
Publishing House P. Ltd.
 Environmental Chemistry, A. K. De, New Age International.
 Environmental Engineering, G.M.Masters, Tata Mc Graw Hills
 Environmental Chemistry with Green Chemistry, A. K. Das, Books and Allied P. Ltd.
 Fundamentals of Environment & Ecology, D. De, D. De, S. Chand & Company Ltd.

MCA Syllabus Page 5 MAKAUT

Master of Computer Application

Code: MCAN-E105B Paper: Management Accounting

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the basic concepts related to Business.
 Demonstrate the roles, skills and functions of different discipline of business management.
 To disseminate knowledge among the students inculcate with theoretical structures about banking system
 Record basic accounting transactions and prepare annual financial statements; and analyse, interpret and communicate
the information contained in basic financial statements
 Analyse and provide recommendations to improve the operations of Organisations through the application of Cost and
Management accounting techniques
 Equip students with in-depth and expert knowledge of Tally ERP with GST.
UNITS COURSE CONTENT
Introduction (3L)
1 Basics of management; Planning, scheduling, organizing, staffing, directing, controlling
Management (3L)
2 Marketing Management, Financial management, Operation management,
Human resource management, Management information System
Strategy (3L)
3 Firm and its environment, strategies and resources, industry structure and analysis, corporate strategies and its
evaluation, strategies for growth and diversification, strategic planning
Business Trade and Banking (3L)
Business: Types of business, Sole Proprietorship, Partnership, Limited company and cooperative society – their
characteristics.
4
Banking: role of commercial banks; credit creation and its importance in industrial functioning. Role of central
bank: Reserve Bank of India.
International Business or Trade Environment.
Financial Accounting (7L)
5 Journals, Ledgers, Trial Balance, Profit & Loss Account, Balance Sheet, Financial Reporting
Financial Statement Analysis and Interpretation (Financial Ratio and Cash Flow analysis)
Cost Accounting (7L)
6 Concepts and Classification of costs, Cost Sheet
Break Even Analysis, Variance Analysis, Cost-volume profit (CVP) relationship, Cash Budgeting
Packages (4L)
7
Financial accounting computer package (Tally ERP with GST)
Reference Books:
 Financial Accounting- A Managerial Perspective, R. Narayanswami, Prentice-Hall of India Private Limited. New
Delhi
 Fundamentals of Financial Management, Horne, James C Van, Prentice-Hall of India Private Limited, New Delhi
 Modern Economic Theory, H. L. Ahuja., S. Chand. New Delhi.
 Management Accounting, Khan & Jain, TMH
 Management Accounting,M.E.ThukaramRao,New Age International

MCA Syllabus Page 6 MAKAUT

 Master of Computer Application

Code: MCAN-E105C Paper: Constitution of India

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the premises informing the twin themes of liberty and freedom from a civil rights perspective.
 To address the growth of Indian opinion regarding modern Indian intellectuals’ constitutional role and entitlement to
civil and economic rights as well as the emergence of nationhood in the early years of Indian nationalism.
 To address the role of socialism in India after the commencement of the Bolshevik Revolution in 1917 and its impact
on the initial drafting of the Indian Constitution.
UNITS COURSE CONTENT
History of Making of the Indian Constitution (5L)
1
History Drafting Committee, ( Composition & Working)
Philosophy of the Indian Constitution (5L)
2
Preamble Salient Features
Contours of Constitutional Rights & Duties (5L)
Fundamental Rights, Right to Equality, Right to Freedom ,Right against Exploitation, Right to Freedom of
3
Religion, Cultural and Educational Rights, Right to Constitutional Remedies, Directive Principles of State Policy,
Fundamental Duties.
Organs of Governance (5L)
Parliament , Composition, Qualifications and Disqualifications, Powers and Functions, Executive, President,
4
Governor, Council of Ministers, Judiciary, Appointment and Transfer of Judges, Qualifications, Powers and
Functions
Local Administration (5L)
District’s Administration head: Role and Importance, Municipalities: Introduction, Mayor and role of Elected
5 Representative, CEO of Municipal Corporation. Pachayati raj: Introduction, PRI: ZilaPachayat. Elected officials
and their roles, CEO ZilaPachayat: Position and role. Block level: Organizational Hierarchy (Different
departments), Village level: Role of Elected and Appointed officials, Importance of grass root democracy
Election Commission (5L)
6 Role and Functioning. Chief Election Commissioner and Election Commissioners. State Election Commission:
Role and Functioning. Institute and Bodies for the welfare of SC/ST/OBC and women.
Reference Books:
 The Constitution of India, 1950 (Bare Act), Government Publication.
 Dr. S. N. Busi, Dr. B. R. Ambedkar framing of Indian Constitution, 1st Edition, 2015.
 M. P. Jain, Indian Constitution Law, 7th Edn., Lexis Nexis, 2014.
 D.D. Basu, Introduction to the Constitution of India, Lexis Nexis, 2015.

MCA Syllabus Page 7 MAKAUT

 Master of Computer Application

Code: MCAN-E105D Paper: Stress Management through Yoga

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 To achieve overall health of body and mind
 To overcome stress
UNITS COURSE CONTENT
Astanga (8L)
1
Definitions of Eight parts of Yoga ( Ashtanga )
Yam and Niyam (8L)
2 Do`s and Don’t’s in life. i) Ahinsa, satya, astheya, bramhacharya and aparigraha ii) Shaucha, santosh, tapa,
swadhyay, ishwarpranidhan
Asan and Pranayam (8L)
3 i) Various yog poses and their benefits for mind & body ii)Regularization of breathing techniques and its effects-
Typesof pranayama
4 Meditation Techniques (6L)
Reference Books:
 Janardan Swami Yogabhyasi Mandal- Yogic Asanas for Group Tarining-Part-I, Nagpur
 Swami Vivekananda- Rajayoga or conquering the Internal Nature, AdvaitaAshrama (Publication Department),
Kolkata

MCA Syllabus Page 8 MAKAUT

 Master of Computer Application

Code: MCAN-E105E Paper: Ethics in Business Profession

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Earn about morals, values & work ethics, Learn to respect others and develop civic virtue.
 Learn about the ethical responsibilities of the engineers, create awareness about the customs and religions, Install
Moral and Social Values and Loyalty and to appreciate the rights of others.
 Demonstrate knowledge to become a social experimenter, Provide depth knowledge on framing of the problem and
determining the facts.
 Create awareness about safety, risk & risk benefit analysis, Provide knowledge on Intellectual Property Rights.
 Develop knowledge about global issues, Create awareness on computer and environmental ethics, Analyze ethical
problems in research.
UNITS COURSE CONTENT
Human Values (6L)
1 Morals, Values and Ethics-Integrity-Work Ethic-Service learning, Civic Virtue, Respect for others, Living
Peacefully, Caring, Sharing, Honesty, Courage-Cooperation, Commitment, Empathy, Self Confidence Character.
Professional Ethics (6L)
Senses of ‘Professional Ethics-Variety of moral issued, Types of inquiry, Moral dilemmas, Moral autonomy,
2
Kohlberg’s theory-Gilligan’s theory, Consensus and controversy, Models of professional roles, Theories about
right action, Self-interest, Customs and religion.
Professional As Social Experimentation (6L)
3 Profession As Social Experimentation, Framing the problem, Determining the facts, Codes of Ethics, Clarifying
Concepts, Application issues, Common Ground, General Principles, Utilitarian thinking respect for persons.
Safety, Responsibilities And Rights in Profession (6L)
Safety and Risk – Assessment of Safety and Risk – Risk Benefit Analysis and Reducing Risk – Respect for
4
Authority – Collective Bargaining – Confidentiality – Conflicts of Interest – Occupational Crime – Professional
Rights – Employee Rights – Intellectual Property Rights (IPR) – Discrimination
Global Issues (6L)
Globalization, Cross culture issues-Environmental Ethics, Computer Ethics –Computers as the instrument of
5 Unethical behavior, Computers as the object of Unethical acts, Autonomous Computers, Computer codes of
Ethics, Moral Leadership, Code of Conduct, Corporate Social Responsibility. Ethics and Research, Analyzing
Ethical Problems in research.
Reference Books:
 Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of India, New Delhi.
 A. R. Aryasri, DharanikotaSuyodhana “Professional Ethics and Morals” Maruthi Publications.
 Mike W. Martin and Roland Schinzinger, “Ethics in Engineering”, Tata McGraw Hill, New Delhi.
 John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi.

MCA Syllabus Page 9 MAKAUT

 Master of Computer Application

Code: MCAN-E105F Paper: Managerial Economics

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 To understand applications of managerial economics.
 To understand and interpret demand function,
 To assess the relationships between short-run and long-run costs.
 To analyze perfectly competitive markets including substitution.
 To explain uniform pricing and how it relates to price discrimination and total revenue.
 To analyze the causes and consequences of different market conditions.
 To integrate the concept of price and output decisions of firms under various market structure.
UNITS COURSE CONTENT
Introduction (2L)
1 Introduction to Managerial Economics, Basic problems of an economic system; Goals of managerial decision
making; Resource allocation using PPC
Demand Analysis (6L)
A. Demand Functions - Law of Demand, Explaining the law of demand, Violations of theLaw of Demand, Shifts in
Demand; Elasticity of Demand: Price Elasticity (at a point andover and interval), Factors affecting price elasticity,
Price elasticity and Change in TotalRevenue, AR, MR and Price elasticity, Range of Values of Price Elasticity;
2
IncomeElasticity, Inferior, Superior and Normal goods, Income Elasticity and Share in TotalExpenditure; Cross-
Price Elasticity, Substitutes and Complements
Indifference curves, budget line and consumer equilibrium
Introduction to methods of demand estimation (concepts only)
Production and Cost Analysis (10L)
Production Function, Short Run and Long Run, Production with One Variable Input,Total Product, Average and
Marginal Products, Law of Variable proportions,Relationship between TP, AP and MP.

Short Run Costs of Production, Fixed and Variable Costs, Short Run Total, Average andMarginal Cost and
Relationship between them, Short Run Cost Curves, Relationshipbetween AVC, MC, AP and MP; Long run cost
3 curves, Relationship between LAC andSAC, Economies of Scale and Scope.

Production with Two Variable Inputs, Isoquants – Characteristics, Marginal Rate of

Technical Substitution, Laws of Returns to Scale, Isocost Curves, * # Finding the Optimal
Combination of Inputs, Production of a given output at Minimum Cost, Production of
Maximum Output with a given level of Cost, Expansion Path, Finding the Long Run
Cost Schedules from the Production Function,
Alternate Goals of Managerial Firms (2 L)
4
Profit maximization; Revenue maximization; Managerial utility maximization
Managerial Decision Making under Alternative Market Structures (6 L)
. Characteristics of Perfect Competition, #Profit Maximization in Competitive Markets, Output Decision in the Short
Run, Shut Down Point, Short Run Supply for the Firm and Industry; Output Decision in the Long Run, Break Even
5 Point, Long Run Supply for the Perfectly Competitive Industry.

Price and output decision under different market structure – Monopoly, Monopolistic
Competition, Oligopoly – cartel, price leadership.
Pricing Decisions [4 L]
Price Discrimination under Monopoly, Transfer Pricing.
6
Market Failure
Game theory &Asymmetric information
Reference Books:
 Damodaran, Suma – Managerial Economics – Oxford University Press
 Lipsey & Chrystal – Economics – Oxford University Press
 Peterson & Lewis – Managerial Economics – Pearson Education.
 Pindyck and Rubenfeld - Micro Economics – Pearson Education
 H.L. Ahuza- Managerial Economics, S. Chand
 D.N. Dwivedi- Managerial Economics, Prentice Hall.

MCA Syllabus Page 10 MAKAUT

Master of Computer Application

Code: MCAN-190 Paper: Soft Skill and Interpersonal Communication

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Effectively communicate through verbal/oral communication and improve the listening skills
 Able to be self-confident with positive vibes
 Actively participate in group discussion / meetings / interviews and prepare & deliver presentations
 Become more effective individual through goal/target setting, self-motivation and practicing creative thinking.
 Function effectively in multi-disciplinary and heterogeneous teams through the knowledge of team work, Inter-
personal relationships, conflict management and leadership quality.
UNITS COURSE CONTENT
Soft Skills& Interpersonal Communication
An Introduction – Definition and Significance of Soft Skills; Process, Importance and Measurement of Soft Skill
Development.
1
Inter personal relations; communication models, process and barriers; team communication; developing
interpersonal relationships through effective communication; listening skills; essential formal writing skills;
corporate communication styles –assertion, persuasion, negotiation.
SWOT & Creative Thinking
Discovering the Self; Setting Goals; Beliefs, Values, Attitude, Virtue.
2
Developing Positive Thinking and Attitude; Driving out Negativity; Meaning and Theories of Motivation;
Enhancing Motivation Levels.
Corporate Communication
Public Speaking: Skills, Methods, Strategies and Essential tips for effective public speaking.
Group Discussion: Importance, Planning, Elements, Skills assessed; Effectively disagreeing, Initiating,
Summarizing and Attaining the Objective.
3
Interview& Presentation Skills: Interviewer and Interviewee– in-depth perspectives. Before, During and After the
Interview.
Tips for Success: Types, Content, Audience Analysis, Essential Tips – Before, During and After, Overcoming
Nervousness.
Non-Verbal Communication & Personality Development
Importance and Elements; Body Language.
4
Concept, Essentials, Tipsc
Meaning, Nature, Features, Stages, Models; Learning Skills; Adaptability Skills.
Business Etiquette & Team Work
5 Concept of Teams; Building effective teams; Concept of Leadership and honing Leadership skills.
Meaning, Nature, Features, Stages, Models; Learning Skills; Adaptability Skills.
Reference Books:
 Managing Soft Skills for Personality Development – edited by B.N.Ghosh,McGraw Hill India, 2012.
 Effective Communication and Soft Skills, Nitin Bhatnagar, Pearson Education India, 2011
 English and Soft Skills – S.P.Dhanavel, Orient Blackswan India, 2010.

MCA Syllabus Page 11 MAKAUT

 Master of Computer Application

Code: MCAN-191 Paper: Python Programming Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 To write simple programs relating to different logical problems.
 To be able to interpret, understand and debug syntax errors reported by the compiler.
 Understand and implement the native data types (Python in this course)
 To implement conditional branching, iteration.
 To decompose a problem intofunctions.
 To be able to create, read from and write into simple text files.
 To understand the basic concept of OOPs
 To understand and implement Python NumpyArrray operations
UNITS COURSE CONTENT
Python Basics: Installing Python, Setting up Path and Environment Variables, Running Python, First Python
1
Program
Python Data Types & Input/output: Keywords, Identifiers, Python Statement, Indentation, Documentation,
2 Variables, Multiple Assignment, Understanding Data Type, Data Type Conversion, Python Input and Output
Functions, Import command.
Operators and Expressions: Operators in Python, Expressions, Precedence, Associativity of Operators, Non
3
Associative Operators.
4 Control Structures: Decision making statements, Python loops, Python control statements.
Python Native Data Types: Numbers, Lists, Tuples, Sets, Dictionary, Functions & Methods of Dictionary,
5
Strings(in detail with their methods and operations).
Python Functions: Built-in Functions, User defined functions, Anonymous functions, Pass by value, Pass by
6
Reference, Recursion
7 Exception Handling: Exceptions, Built-in exceptions, Exception handling, User defined exceptions in Python.
File Management in Python: Operations on files (opening, modes, attributes, encoding, closing), read() & write()
8
methods, tell() & seek() methods, renaming & deleting files in Python, directories in Python.
Python OOPs
9
Python OOPs Concepts, Object Class, Constructors, Inheritance
Python Numpy
10 Numpy data types, Operations on Numpy Array (indexing,slicing, shape/reshape, iteration, join, split, search, sort,
filter)

MCA Syllabus Page 12 MAKAUT

 Master of Computer Application

Code: MCAN-192 Paper: Relational Database Management System Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Learn to use Entity Relationship Diagram (ERD) model as a blueprint to develop the corresponding relational model in
a RDBMS system like Oracle DBMS.
 Apply DDL component of Structured query language (SQL) to create a relational database from scratch through
implementation of various constraints in Oracle RDBMS system.
 Apply DML component of Structured query language (SQL) for storing and modification of data in Oracle RDBMS
system.
 Apply DQL component of Structured query language (SQL) to construct complex queries for efficient retrieval of data
from existing database as per the user requirement specifications.
 Conceptualize and apply various P/L SQL concepts like cursor, trigger in creating database programs.
 Develop a fully-fledged database backend system using SQL and P/L SQL programming to establish overall integrity
of the database system.
 Implement PL/SQL function, Procedure and Package and Apply Exception.
UNITS COURSE CONTENT
Creation of a database based on given ERD Model:
SQL Data Definition Language (DDL)
Create (and Alter) table structure, Apply (and Alter) constraints on columns/tables viz., primary key, foreign key,
unique, not null, check. Verify/ Review the table structure (along with applied constraints) using appropriate data
1 dictionary tables like user_constraints, user_cons_columns, etc. Create view, materialized view using one or more
table.
SQL Data Manipulation Language (DML)
Insert into rows (once at a time/ and in bulk) from a table, Update existing rows of a table, Delete rows (a few or all
rows) from a table.
Data Query Language (DQL)
Basic select-from-where structure - Usage of Top, Distinct, Null keywords in query, Using String and Arithmetic
Expressions, Exploring Where Clause with various Operators and logical combination of various conditions,
Sorting data using Order By clause. Usage of IN, LIKE, ALL keywords.
Introduction to Joins, Natural Joins, equi-join, non-equi-join, Self-Join, Inner Join, Outer (left, right) Join.
Set operations:
2 Unions, Intersect, minus set operations on table data using SQL.
Using single row functions in Queries
NVL function (to handle ambiguity of null data), upper, lower, to_date, to_char functions, etc.
Using group/multiple row functions in Queries like Count, Sum, Min, Max, Avg, etc, using Group By and Having
Clause, Using Group By with Rollup and Cube.
Sub-query - Working with various nested structure of Sub Queries - use in from or where clause with more than one
level of nesting, correlated sub-query- Ranking table data using correlated sub-query.
PL/SQL
Stored Procedures and Functions- Basic programming constructs of PL / SQL like if, else, else-if, loop, while, for
structure
Populate stored procedure variables with the data fetched from table using SQL command.
Working with Cursors - Creating Cursors, parameterized cursor, Locks on cursors, Exploring advantages of cursors.
3
Introduction to triggers - Constraints Vs Triggers, Creating, Altering, Dropping triggers, use of for/ after/ instead of
triggers, Using trigger to validate/ rollback a Transaction, Automatically populate integer data based primary key
columns (e.g., Id.) using trigger.
Handling Function, Procedure & Package – Create Function, Create Procedure and Create Package.
Exception Handling.

MCA Syllabus Page 13 MAKAUT

MASTER OF COMPUTER APPLICATION
Syllabus w.e.f. the Academic Session 2020-2021

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY

WEST BENGAL
 Master of Computer Application

First Year: Semester-II

Code: MCAN-201 Paper: Data Structure with Python
Contacts Hours / Week: 4 Total Contact Hours 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the concept of abstract data type such as stack, queue, linked list, and trees
 Chose appropriate data structure to design algorithm to solve the problem.
 Analyze the algorithms in the context of efficiency.
 Apply the knowledge of stack and queue to design algorithm
 Design application using sorting, searching and the concept of tree.
UNITS COURSE CONTENT
Introduction (6L)
Basic Terminologies: Elementary Data Organizations, Data Structure Operations: insertion, deletion, traversal etc.;
1
Analysis of an Algorithm, Asymptotic Notations, Time-Space trade off.
Searching: Linear Search and Binary Search Techniques and their complexity
Stacks and Queues (8L)
ADT Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks: Expression
2 Conversion and evaluation – corresponding algorithms and complexity analysis.
ADT, queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue; Operations on each type of Queue:
Algorithms and their analysis.
Linked Lists (6L)
Singly linked lists: Representation in memory, Algorithms of several operations: Traversing, Searching, Insertion
into, Deletion from linked list;
3
Linked representation of Stack and Queue, Header nodes,
Doubly linked list: operations on it and algorithmic analysis;
Circular Linked Lists: all operations their algorithms and the complexity analysis.
Trees (6L)
Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL
4 Tree;
Tree operations on each of the trees and their algorithms with complexity analysis.
Applications of Binary Trees. B Tree, B+ Tree: definitions, algorithms and analysis.
Graph (6L)
5 Graph Terminology, Representation of graphs, Path Matrix, Graph Traversal, BFS, DFS, Minimum Spanning Tree,
Kruskal’s Algorithm and Prim’s Algorithm.
Sorting (6L)
6 Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort,
Merge Sort, Heap Sort; Performance and Comparison among all the methods.
Hashing (2L)
7 Review of Hashing, Hash Function, Collision Resolution Techniques in Hashing, Separate Chaining, Open
Addressing, Linear Probing, Quadratic Probing, Double Hashing, Rehashing, Extendible Hashing.
Reference Books:
 Fundamentals of Data Structures of C, Ellis Horowitz, SartajSahni, Susan Anderson-freed
 Python Programming A modular approach, Taneja Sheetal, Kumar Naveen Pearson Ed
 Data Structure and Algorithmic Thinking with Python, Narasimha Karumanchi, Career Monk Publications
 Data Structures and Algorithms in Python, Michael T. Goodrich, R.Tamassia, Michael H. Goldwasser, WILEY
 Taming Python, Jeeva Jose, Khanna Publishing
 Python Data Structures and Algorithms, Dr. Basant Agarwal & Benjamin Baka, Packt
 Data Structures and Algorithms Using Python, Rance D. Necaise, Wiley

MCA Syllabus Page 1 MAKAUT

Master of Computer Application

Code: MCAN-202 Paper: Operating System

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
Describe the main components of OS and their working
Explain the concepts of process and thread and their scheduling policies
Explain the various memory management techniques
Compare the different techniques for managing memory, I/O, disk and files
Explains the security and protection features of an Operating System
UNITS COURSE CONTENT
Introduction (6L)
Generations Concept of Operating systems, Systems, Types of Operating Systems, OS Services, System Calls,
1 Structure of an OS - Layered, Monolithic, Microkernel Operating Systems, Concept of Virtual Machine. Real
Time Operating Systems, Distributed Operating Systems, Multiprocessor Operating System.
Case Study: Architecture of Unix and Windows Operating Systems
Process Management (14L)
Processes and Threads: 7 state process model, Process scheduling, Operations on processes, Inter-process
communication, Threads overview, Benefits of threads, User and kernel threads.
CPU Scheduling: Scheduling criteria, Preemptive & non-preemptive scheduling, Scheduling algorithms (FCFS,
SJF, RR, Priority, Multi-level queue, Multi-level feedback queue), Comparative study of the algorithms, Multi-
2 processor scheduling.
Process Synchronization: Background, Critical section problem, Software solution – Peterson and Bakery
algorithm, Synchronization hardware, Semaphores, Classical problems of synchronization.
Deadlocks: System model, Deadlock characterization, Methods for handling Deadlocks, Deadlock prevention,
Deadlock avoidance, Deadlock detection, Recovery from deadlock.
Case Study: Scheduling on Unix and Windows Operating Systems
Memory Management (9L)
Basic concept, Logical and Physical address map, Memory allocation: Contiguous Memory allocation– Fixed
and variable partition– Internal and External fragmentation and Compaction; Paging: Principle of operation –
Page allocation Hardware support for paging, Protection and sharing, Disadvantages of paging.
3
Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of reference, Page
fault, Working Set , Dirty page/Dirty bit – Demand paging, Page Replacement algorithms(Optimal, FIFO, SC,
NRU and LRU), Thrashing
Case Study: Unix Virtual Memory, Windows Virtual Memory
File Systems and I/O Management (7L)
File concept, Fundamental File System Organization and Access Methods, Directory structure, File system
structure, Allocation methods (Contiguous, Linked, Indexed), Free-space management (Bit vector, Linked list,
Grouping), Directory Implementation (Linear list, Hash table), Efficiency and Performance.
4
PC Bus Structure, I/O connections, Data transfer techniques (Programmed, Interrupt driven, DMA), Bus
arbitration (Daisy chain, Polling, Independent request), Blocking and non-blocking I/O, Kernel I/O subsystem
(Scheduling, Buffering, Caching, Spooling and device reservation, Error handling).
Case Study: UnixFile System, Windows File System
Security and Protection: (4L)
Overview of Security and Protection, Goals of Security and Protection, Security Attacks, Formal and Practical
5 aspects of Security, Encryption, Authentication and Password Security, Access Descriptors and the Access
Control Matrix, Protection Structures, Capabilities,
Case Study: Unix Security, Windows Security.
Reference Books:
 Operating System Concepts Essentials, 10th Edition by Avi Silberschatz, Peter Galvin, Greg Gagne, Wiley
Asia Student Edition.
 Operating Systems: Internals and Design Principles, 5th Edition, William Stallings, Prentice Hall of India.
 Operating System Concepts, EktaWalia, Khanna Publishing House (AICTE Recommended Textbook – 2018)
 Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin Publishing
 Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison- Wesley
 Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of India
 Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and Associates

MCA Syllabus Page 2 MAKAUT

Master of Computer Application

Code: MCAN-203 Paper: Object Oriented Programming with JAVA

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Use the characteristics of Java language in a program. Use variables and data types in program development.
 Identify and implement arrays, String and Selection Statements.
 Write Java programs using object-oriented programming techniques including classes, objects, methods, instance
variables, interface.
 Design and implementation programs of Exception handling, Packages, Multithreading Programming, Window based
programs.
UNITS COURSE CONTENT
Object-Oriented Languages (10L)
1 Java’s History, Creation of Java, Internet & Java, Byte-code, Its Features, Java Program Structure and Java’s
Class Library, Data Types, Variables, and Operators, Operator Precedence; Selection Statements, Scope of
Variable, Iterative Statement; Defining Classes & Methods, Creating Objects of a Class, Defining and Using a
Class, Automatic Garbage Collection.
Arrays and Strings: Arrays, Arrays of Characters, String Handling Using String Class, Operations on String
Handling Using, String Buffer Class.
Classes and Inheritance (10L)
2 Using Existing Classes, Class Inheritance, Choosing Base Class, Multiple Levels of Inheritance, Abstraction
through Abstract Classes, Using Final Modifier,
Packages: Understanding Packages, Defining a Package, Packaging up Your Classes, Adding Classes from a
Package to Your Program, Understanding CLASSPATH, Standard Packages, Access Protection in Packages,
Concept of Interface.
Exception Handling: The concept of Exceptions, Types of Exceptions, Dealing with Exceptions, Exception
Objects, Defining Your Own Exceptions.
Multithreading Programming (10L)
3 The Java Thread Model, Understanding Threads, The Main Thread, creating a Thread, Creating Multiple
Threads, Thread Priorities, Synchronization.
Input / Output in Java: I/O Basic, Byte and Character Structures, I/O Classes, Reading Console Input,
Writing Console Output, Reading and Writing on Files, Random Access Files, Storing and Retrieving Objects
from File, Stream Benefits.
Creating Applets in Java: Applet Basics, Applet Architecture, Applet Life Cycle, Simple Applet Display
Methods, The HTML Applet Tag Passing Parameters to Applets.
Working with Windows (10L)
4 AWT Classes, Window Fundamentals, Working with Frame, Creating a Frame Window in an Applet; Displaying
Information within a Window.
Working with Graphics and Texts: Working with Graphics, Working with Color, Setting the Paint Mode,
Working with Fonts, Managing Text Output; Using Font Metrics, Exploring Text and Graphics, Working with
AWT Controls, Layout Managers and Menus.
Reference Books:
 The Complete Reference JAVA, Herbert Schildt, TMH Publication.
 JAVA and Object-Oriented Programming Paradigm, Debasish Jana, Prentice Hall of India
 Beginning JAVA, Ivor Horton, WROX Publication.
 JAVA 2 UNLEASHED, Tech Media Publications.
 JAVA 2(1.3) API Documentations.

MCA Syllabus Page 3 MAKAUT

Master of Computer Application

Code: MCAN-204 Paper: Networking

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the purpose of network layered models, network communication using the layered concept and able to
compare and contrast OSI and TCP/IP model.
 Differentiate among and discuss the four level of address (physical, logical, port and url) used by the internet TCP/IP
protocols.
 Understand the routing principals and algorithm such as distance vector routing and link state.
 Judge the efficiency of the connection oriented and connectionless protocol.
 Familiar with the routing techniques, protocols and quality of service.
 Explain the concept of network security and cryptography.
UNITS COURSE CONTENT
Introduction (4L)
1 Direction of data flow (simplex, half duplex, full duplex), Network topology, categories of network (LAN, MAN,
WAN).
Protocol and Standard (4L)
2
Layered Task, The OSI model, TCP/IP protocol suite, Addressing
Internetworking (10L)
Internetworking concept, IPv4 and IPv6 Addressing, IPv4 protocol, IPv6 protocol, transition from IPV4 to IPV6,
3 transition from IPv4 to IPv6, Address Mapping, Error Reporting, Multicasting, Unicast Routing Protocols, Distance
Vector routing, Link state routing, Path vector routing, Multicasting Routing Protocols, Transmission Control
Protocol(TCP), User Datagram Protocol(UDP)
Quality of Service (6L)
4 Data traffic, Congestion, congestion control, Quality of service, Techniques to improve QoS, Integrated services,
Differentiated service, QoS in Frame Relay, QoS in ATM
DNS and Web (8L)
Name Space, Domain Name System, Distribution of Name Space, Remote Logging, Electronic Mail and File
5
Transfer, WWW, Web document and HTTP, Network Management, Simple Network Management Protocol
(SNMP)
Network Security (8L)
6 Symmetric Key Cryptography, DES, AES, Asymmetric Key Cryptography, RSA, Diffie-Hellman, Security Services,
Digital Signature, Key Management, IP Security, SSL/TLS, PGP, Firewalls
Reference Books:
 Computer Networks, Andrew S. Tanenbaum, Pearson Education, Fourth edition.
 Data and Computer Communication, William Stallings, Prentice hall, Seventh edition.
 High speed Networks and Internets, William Stallings, Pearson education, Second edition.
 Behrouz A Forouzan, - Data communication & Networking , TMH
 Behrouz A Forouzan, - TCP/IP Protocol Suite , TMH
 Kelvin R Fall, W. Richard Stevens- TCP/IP Illustrated Volume 1, Addison Wesley

MCA Syllabus Page 4 MAKAUT

 Master of Computer Application

Code: MCAN-E205A Paper: Numerical and Statistical Analysis

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 To understand approximation and propagation error.
 To understand and implement different interpolation techniques.
 To understand and implement integration techniques.
 To understand and implement solutions for linear and algebraic and differential equations.
UNITS COURSE CONTENT
Approximation in numerical computation (2L)
1 Truncation and rounding errors, Fixed and floating point arithmetic, Propagation of errors.
Interpolation (3L)
2
Newton forward/backward interpolation, Lagrange’s and Newton’s divided difference Interpolation
Numerical integration (3L)
3
Trapezoidal rule, Simpson’s1/3 rule, Romberg’s Integration, Expression for corresponding error terms.
Numerical solution of Linear equations (3L)
4
Gauss elimination method, Matrix inversion, LU Factorization method, Gauss-Seidel iterative method.
Numerical solution of Algebraic equation (5L)
5
Bisection method, Regula-Falsi method, Newton-Raphson method, Iteration Method, Secant Method.
Numerical solution of ordinary differential equation (4L)
6 Euler’s method, Runge-Kutta methods, Taylor’s series, method, Predictor Corrector methods and Finite Difference
method.
Least Square Curve fitting (2L)
7
Linear & non-linear curve fitting
Introduction to Statistics& Probability (8L)
Basic Statistics-measure of central tendency, dispersion.
8
Probability, distribution introduction to mass function, density function, distribution function (Binomial, Poisson,
Normal).
Reference Books:
 R.S. Salaria: Computer Oriented Numerical Methods, Khanna Publishing House
 C.Xavier: C Language and Numerical Methods.
 Dutta & Jana: Introductory Numerical Analysis.
 J.B.Scarborough: Numerical Mathematical Analysis.
 Jain, Iyengar, & Jain: Numerical Methods (Problems and Solution).
 Balagurusamy: Numerical Methods, Scitech.
 Baburam: Numerical Methods, Pearson Education.
 N. Dutta: Computer Programming & Numerical Analysis, Universities Press

MCA Syllabus Page 5 MAKAUT

 Master of Computer Application

Code: MCAN-E205B Paper: Computer Graphics

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Identify the basic terminologies of Computer Graphics and interpret the mathematical foundation of the concepts of
computer graphics.
 Apply mathematics to draw basic primitives.
 Illustrate the concepts of windowing and clipping and apply various algorithms to fill and clip polygons.
 Understand and apply the core concepts of computer graphics, including transformation in two and three dimensions,
viewing and projection.
 Create effective programs using concepts of curves.
 Understand the concepts of color models, lighting, shading models and hidden surface elimination.
UNITS COURSE CONTENT
Introduction (6L)
Overview of computer graphics, representing pictures, preparing, presenting & interacting with pictures for
1 presentations; Visualization & image processing; RGB color model, direct coding, lookup table; storage tube
graphics display, Raster scan display, 3D viewing devices, Plotters, printers, digitizers, Light pens etc.; Active &
Passive graphics devices; Computer graphics software.
Graphics Primitives: (6L)
Points, Lines andCircles as primitives, Scan conversion algorithms for primitives, Fill area primitives including
2
scan-line polygon filling, inside-outside test, Boundary and Flood-fill, Character generation, line attributes, area-fill
attributes, character attributers.
2D Transformation and Viewing: (6L)
Transformations (translation, rotation, scaling), matrix representation, homogeneous coordinates, composite
3 transformations, reflection and shearing, viewing pipeline and coordinates system, window-to-viewport
transformation, clipping including point clipping, line clipping (Cohen-Sutherland, Liang-Bersky), Polygon
clipping
3D Transformations: (4L)
4 Translation, rotation, scaling & other transformations. Rotation about an arbitrary axis in space, Reflection through
an arbitrary plane; General parallel projection transformation; clipping, viewport clipping, 3D viewing.
Curve: (3L)
5 Curve representation, surfaces, designs, Bezier curves, B-spline curves, end conditions for periodic B-spline
curves, rational B-spline curves.
Hidden surfaces (3L)
6 Depth comparison, Z-buffer algorithm, Back face detection, BSP tree method, The Painter’s algorithm, scan-line
algorithm; Hidden line elimination.
Color & shading models (2L)
7
Light &Color Model; Interpolative Shading Models; Texture;
Reference Books:
 D. Hearn and M.P. Baker, Computer Graphics, Pearson Eduction.
 D.P. Mukherjee, D. Jana, Computer Graphics : Algorithms and Implementations, Pentice Hall of India.
 J. Foley, V. Dam, S. Feiner, J. Hughes, “Computer Graphics Principles and Practice”, Pearson Education.
 D. Rogers, Procedural Elements for Computer Graphics, TataMcGraw-Hill Publications.
 D.Rogers,J.Adams,MathematicalElementsforComputerGraphics,TataMcGraw Hill Publication.

MCA Syllabus Page 6 MAKAUT

 Master of Computer Application

Code: MCAN-E205C Paper: Probability and Statistics

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Explain the concept of probability and its feature in terms of random event, sample space, favorable event.
 Describe the idea of random variable and the probability distribution.
 Calculate the expectation, standard deviation and moments.
 Critically evaluate the underlying assumptions of analysis tools.
 Carry out basic statistical analysis of data.
UNITS COURSE CONTENT
Probability (3L)
1 Sample Space, Probability Axioms, Combinatorics: probability of finite sample space, Conditional
probability and Bayes Theorem, Independence of Events,
Random Variables (5L)
Discrete, continuous and mixed random variables, probability mass, probability density and
2
cumulative distribution functions, mathematical expectation, moments, probability and moment
generating function, median and quantiles, Markov inequality, Chebyshev’s inequality, problems
Special Distributions (6L)
3 Discrete uniform, binomial, geometric, negative binomial, hypergeometric, Poisson, continuous uniform,
exponential, gamma, Pareto, beta, normal
Joint Distributions (3L)
4 Joint, marginal and conditional distributions, product moments, correlation and regression, independence
of random variables, bivariate normal distribution, problems.
Sampling Distributions (2L)
5 The Central Limit Theorem, distributions of the sample mean and the sample variance for a normal
population, Chi-Square, t and F distributions, problems.
Descriptive Statistics (2L)
6
Graphical representation, measures of locations and variability.
Estimation (3L)
Unbiasedness, consistency, the method of moments and the method of maximum likelihood estimation,
7
confidence intervals for parameters in one sample and two sample problems of normal populations,
confidence intervals for proportions, problems.
Testing of Hypotheses (6L)
Null and alternative hypotheses, the critical and acceptance regions, two types of error, power of the test,
8 the most powerful test and Neyman-Pearson Fundamental Lemma, tests for one sample and two sample
problems for normal populations, tests for proportions, Chi-square goodness of fit test and its
applications, problems.
Reference Books:
 Vijay K. Rohatgi, A. K. Md. Ehsanes Saleh- An Introduction To probability And statistics, John Wiley &Sons
 V.K.Rohatgi& A.K. Md. E. Saleh - An Introduction to Probability and Statistics
 J.S. Milton &J.C. Arnold- Introduction to Probability and Statistics
 H.J. Larson -Introduction to Probability Theory and Statistical Inference.
 S.M. Ross - Introduction to Probability and Statistics for Engineers andScientists

MCA Syllabus Page 7 MAKAUT

 Master of Computer Application

Code:MCAN-E205D Paper: Introduction to Cyber Security

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Know Fundamental knowledge in Cyber Security
 Understand the security challenges as well as the best practices that are essential to protect one from becoming the
victims of cybercrimes.
 Understand the current status of cyber world.
 To safe-guard the individual, society, organization and the government from the dangers of cyber frauds, scams,
threats and attacks.
 Able to further exploration in Cyber Security Domain.
UNITS COURSE CONTENT
Introduction (2L)
1
Introduction to Cyber Space, Information Systems, Need for Cyber Security
Cyber Attacks (3L)
Introduction to Cyber Attacks,
2
Classification of Cyber Attacks,
Classification of Malware, Threats
Intrusion Detection and Prevention (2L)
Vulnerability Assessment
3
Intrusion Detection Systems
Intrusion Prevention Systems
Authentication Methods (2L)
4 Introduction to User Authentication Methods
Biometric Authentication Methods, Biometric Systems
Security Models (3L)
Different Security Models and Security Mechanisms
5
Information Security and Network Security
Operating System Security
Online Security (2L)
Web Security
6
Email Security
Mobile Device Security, Cloud Security
IoT & Social Media Security (3L)
IoT Security
7
Cyber Physical System Security
Social Media Security
Security and Virtual Currency (3L)
Virtual Currency
8
Block Chain Technology
Security Auditing
Cyber Crimes (4L)
9 Introduction, Different Types of Cyber Crimes, Scams and Frauds, Analysis of Crimes, Human Behavior,
Stylometry, Incident Handling, Investigation Methods, Criminal Profiling, Cyber Trails
Digital Forensics (3L)
10 Digital Forensics, History, Challenges, Branches of Digital Forensics, Digital Forensic Investigation Methods,
Reporting, Management of Evidence
Cyber Law (3L)
Cyber laws, Cyber terrorism, Information Technology Act 2000 and Amendments,Evidentiary value of
11
Email/SMS, Cybercrimes and Offenses dealt with IPC, RBI Act and IPR Act in India, Jurisdiction of Cyber
Crime, Cyber Security Awareness Tips
Reference Books:
 Fundamentals of Cyber Security By MayankBhushan, BPB Publications
 https://heimdalsecurity.com/pdf/cyber_security_for_beginners_ebook.pdf
 Information Security & Cyber Laws, Gupta & Gupta, Khanna Publishing House
 Certified Ethical Hacker Certification Exam by William Manning
 Data communication and Networking by Behrouz A. Forouzan, McGraw Hill Education (India) Pvt. Ltd.
 http://larose.staff.ub.ac.id/files/2011/12/Cyber-Criminology-Exploring-Internet-Crimes-and-Criminal-Behavior.pdf

MCA Syllabus Page 8 MAKAUT

 Master of Computer Application

Code:MCAN-E205E Paper: Introduction to IoT

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Explain what Internet of Thins is
 Describe key technologies in Internet of Things.
 Understand wireless sensor network architecture and its framework along with WSN applications.
 Explain resource management in the Internet of Things.
 Understand business models for the Internet of Things.
UNITS COURSE CONTENT
Introduction: (6L)
What is the Internet of Things? : History of IoT, About IoT, Overview and Motivations, Examples of
1
Applications, Internet of Things Definitions and Frameworks : IoT Definitions, IoT Architecture, General
Observations, ITU-T Views, Working Definition, IoT Frameworks, Basic Nodal Capabilities
Fundamental IoT Mechanisms And Key Technologies (6L)
Identification of IoT Objects and Services, Structural Aspects of the IoT, Environment Characteristics, Traffic
2 Characteristics, Scalability, Interoperability, Security and Privacy, Open Architecture, Key IoT Technologies,
Device Intelligence, Communication Capabilities, Mobility Support, Device Power, Sensor Technology, RFID
Technology, Satellite Technology,
Radio Frequency Identification Technology (6L)
RFID: Introduction, Principle of RFID, Components of an RFID system, Issues EPCGlobal Architecture
Framework: EPCIS & ONS, Design issues, Technological challenges, Security challenges, IP for IoT, Web of
3 Things. Wireless Sensor Networks: History and context, WSN Architecture, the node, Connecting nodes,
Networking Nodes, Securing Communication WSN specific IoT applications, challenges: Security, QoS,
Configuration, Various integration approaches, Data link layer protocols, routing protocols and infrastructure
establishment.
Resource Management In The Internet Of Things (6L)
Clustering, Software Agents, Clustering Principles in an Internet of Things, Architecture, Design Guidelines,
and Software Agents for Object Representation, Data Synchronization. Identity portrayal, Identity
4
management, various identity management models: Local, Network, Federated and global web identity, user-
centric identity management, device centric identity management and hybrid-identity management, Identity
and trust.
Internet Of Things Privacy, Security And Governance (6L)
Vulnerabilities of IoT, Security requirements, Threat analysis, Use cases and misuse cases, IoT security
5
tomography and layered attacker model, Identity establishment, Access control, Message integrity, Non-
repudiation and availability, Security model for IoT.
Reference Books:
 Pethuru Raj and Anupama C Raman, The Internet of Things – Enabling Technologies, Platforms, and use cases,
CRC Press, Taylor and Francis
 Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities Press.
 Yasuura, H., Kyung, C.M., Liu, Y., Lin, Y.-L., Smart Sensors at the IoT Frontier, Springer International
Publishing.
 David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert Barton, Jerome Henry, IoT Fundamentals:
Networking Technologies, Protocols, and Use Cases for the Internet of Things, 1stEdition, Pearson Education
(Cisco Press Indian Reprint).
 Srinivasa K G, Internet of Things,CENGAGE Leaning India.

MCA Syllabus Page 9 MAKAUT

 Master of Computer Application

Code: MCAN-E205F Paper: Automata Theory & Computational Complexity

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the formal notation for strings, languages and machines.
 Design and Implement Finite automata to accept a string of a language.
 For a given language determine whether the given language is regular or not.
 Design context free grammars to generate strings of context free language.
 Determine equivalence of languages accepted by Push Down Automata and languages generated by context free
grammars
 Understand and analyze the hierarchy of formal languages, grammars and machines.
 Distinguish between computability and non-computability and Decidability and un-decidability.
UNITS COURSE CONTENT
Introduction (2L)
1
Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of languages.
Regular languages and finite automata: (6L)
Regular expressions and languages, deterministic finite automata (DFA) and equivalence with regular
2 expressions, nondeterministic finite automata (NFA) and equivalence with DFA, regular
grammars and equivalence with finite automata, properties of regular languages, pumping lemma
for regular languages, minimization of finite automata)
Context-free languages and pushdown automata: (6L)
Context-free grammars (CFG) and languages (CFL), Chomsky and Greibach normal forms, nondeterministic
3
pushdown automata (PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma for
context-free languages, deterministic push down automata, closure properties of CFLs.
Turing machines: (8L)
The basic model for Turing machines (TM), Turing recognizable(recursively enumerable) and Turing-decidable
(recursive) languages and their closure properties, variants of Turing machines, nondeterministic TMsand
4
equivalence with deterministic TMs, unrestricted grammars and equivalence with Turing machines,
TMsasenumerators.Context Sensitive Language, The model of Linear Bounded Automaton, relation between LBA
and context sensitive language
Decidability: (4L)
5
Decidability, decidable language and undecidable language, Halting problem of TM, Halting problem of TM
Complexity (4L)
6 Growth rate of functions, The classes P and NP, Polynomial time reduction and NP completeness, SAT is NP
complete, Cook’s theorem, Church-Turing Thesis
Reference Books:
 Introduction to Automata Theory, Languages, and Computation,John E. Hopcroft, Rajeev Motwani and Jeffrey D.
Ullman, Pearson Education Asia.
 Elements of the Theory of Computation,Harry R. Lewis and Christos H. Papadimitriou, Pearson Education Asia.
 Theory of Computer Science, Automata Languages and computation, Mishra and Chandra shekaran, 2nd edition, PHI.
 Automata and Computability, Dexter C. Kozen, Undergraduate Texts in Computer Science, Springer.
 Introduction to the Theory of Computation, Michael Sipser, PWS Publishing.
 Introduction to Languages and The Theory of Computation,John Martin, TataMcGraw Hill., PEARSON.

MCA Syllabus Page 10 MAKAUT

 Master of Computer Application

Code: MCAN-291 Paper: Data Structure Lab with Python

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 To understand linear and non-linear data structures.
 To understand different types of sorting and searching techniques.
 To know how to create an application specific data structure.
 To solve the faults / errors that may appear due to wrong choice of data structure.
 To analyze reliability of different data structures in solving different problems.
UNITS COURSE CONTENT
Implementation of data structure operations (Insertion, deletion, traversing, searching) on array. Linear search,
1 Binary search.
Implementation of stack, queue operation using array. Pop, Push, Insertion, deletion, Implementation of circular
2
queue. Infix to postfix conversion, postfix expression evaluation
Implementation of linked lists: Single linked list, circular linked list, double linked list, doubly circular linked list.
3 Implementation of stack and queue using linked list. Merging two linked list, Linked list representation of a
polynomial, polynomial addition, polynomial multiplication.
Tree: creating Binary Search tree, recursive and non-recursive traversal of BST, deletion in BST, calculating height
4
of a BST, building AVL tree.
Implementation of sorting techniques: selection, bubble, quick sort, insertion sort, merge sort, heap sot,
5
implementation of priority queue. Hash table implementation.
6 Implementation of Graph: representation, searching, BFS, DFS

MCA Syllabus Page 11 MAKAUT

 Master of Computer Application

Code: MCAN-292 Paper: Operating System Lab (Unix)

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Do the use of basic UNIX Commands from the command line, and create Shell Scripts to customize their UNIX
Working Environment.
 Organize and manage their processes within UNIX through system calls.
 Organize and manage their files within the UNIX through system calls.
 Provide a mechanism for handling asynchronous events through signals (Software Interrupt).
 Implement the Inter-process communication using FIFOs, Message Queues, Semaphores, and Shared Memory.
 Explain Socket programming to design Client-Server Environment.
 Understand and implement Multithreaded Programming Environment.
UNITS COURSE CONTENT
Shell programming
1 Creating a script, making a script executable, shell syntax (variables, Conditions, control structures, functions and
commands).
Process
2 Starting new process, replacing a process image, duplicating a process image, waiting for a process, Zombie Process,
Orphan Process
File Handling
3
Programming on files (use create(), open(), read(), write(), close(), lseek(), dup()).
Signal
4
Signal Handling, Blocking, Suspending, Delivering Signals, Various Signal Related Functions.
Inter-process communication
Pipes (use functions pipe(), popen(), pclose()),
Named Pipes (FIFOs, accessing FIFO),
5
Message Queues (use functions msgget(), msgsnd(), msgrcv(), msgctl()),
Semaphores (use functions semctl(), semget(), semop())
Shared Memory (use functions shmget(), shmat(), shmdt(), shmctl())
Sockets:
6
TCP Sockets, UDP Sockets, Socket Options, Cliient /Server Example, Name and Address Conversions
POSIX Threads
7 Programming with pthread functions (viz. pthread_create(), pthread_join(), pthread_exit(), pthread_attr_init(),
pthread_cancel())

MCA Syllabus Page 12 MAKAUT

Master of Computer Application

Code: MCAN-293 Paper: Object Oriented Programming Lab using JAVA

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Apply object-oriented principles or features in software design process to develop Java programs for real life applications.
 Reduce the complexity of procedural language by employing different OOP technologiesfor developing robust and
reusable software.
 Develop programs using stream classes for various I/O operations and design concurrent.
 Design graphical user interface to develop user interactive applications.

UNITS COURSE CONTENT

1 Assignments on class, constructor, overloading, inheritance, overriding.
2 Assignments on wrapper class, arrays.
3 Assignments on developing interfaces- multiple inheritance, extending interfaces.
4 Assignments on creating and accessing packages.

5 Assignments on multithreaded programming

6 Assignments on applet programming

MCA Syllabus Page 13 MAKAUT

MASTER OF COMPUTER APPLICATION
Syllabus w.e.f. the Academic Session 2020-2021

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY

WEST BENGAL
Master of Computer Application

Second Year: Semester-III

Code: MCAN-301 Paper: Software Engineering using UML

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Analyze the problem scenario and identify classes/ objects and their properties, relationship in class model.
 Demonstrate the conceptual modeling techniques of UML for solving Real-World problem.
 To learn software development life cycle for Object-Oriented solutions for Real-World Problems.
 Ability to apply the concepts of object oriented methodologies to analyze requirements and design to the point where it
is ready for implementation.
 Demonstrate the concept of Testing to measure quality of software.
UNITS COURSE CONTENT
Introduction to Software Engineering: (2L)
1 What is Software Engineering? Software Engineering Concepts, Software Engineering Development Activities,
Managing Software Development.
Object Oriented Concept and Modelling: (5L)
Object-Oriented Principals and Concepts: Classes and Object, Modularity, Abstraction and Encapsulation;
Object Relationship like Association, Aggregation and Composition; Inheritance, Polymorphism and Dynamic
2 Binding Interfaces
Model: Importance of Modeling, Object Oriented Modeling
Identifying the Elements of an Object Model: Identifying classes and objects, Specifying the attributes
Defining operations, Finalizing the object definition.
Introduction to UML: (3L)
3
Overview of UML, Conceptual Model of UML, Architecture, S/W Development Life Cycle.
Basic and Advanced Structural Modeling: (7L)
4 Classes Relationship, Common mechanism, Diagrams, Class Diagram, Advanced classes, Advanced
Relationship, Interface, Types and Roles, Packages, Object Diagram.
Basic and Advanced Behavioral Modeling: (7L)
5 Interactions, Use cases, Use Case Diagram, Sequence Diagram, Collaboration Diagram, Interaction Diagram,
Activity Diagram, State Chart Diagram.
Architectural Modeling: (3L)
6
Artifacts, Artifact Diagram, Implementation Diagram, Deployment Diagram.
Object-Oriented Design: (5L)
Generic components of Object-Oriented Design model, System Design process, Partitioning the Analysis Model,
7
Concurrency and subsystem Allocation, Task Management component, Data Management Component, Resource
Management Component, Inter Sub-system Communication.
Object Oriented Analysis: (4L)
8 Iterative Development, Unified process & its Phases: Inception, Elaboration, Construction, Transition,
Understanding requirements.
Object Oriented Testing: (4L)
9 Overview of Testing and object oriented Testing, Types of Testing, Object oriented Testing strategies, Test case
design for Object-Oriented software, Inter class test case design.
Reference Books:
 The Unified Modeling Language User Guide, Grady Booch, James Raumbaugh, Ivar Jacobson.
 Object Oriented Software Engineering, Ivar Jacobson, ACM Press
 Applying UML and Patterns, Craig LarmanMotilalUk Books Of India
 Object-Oriented Software Engineering: Using UML, Patterns, and Java, Bernd Bruegge, Allen Dutoit, Pearson.
 Software Engineering – A Practitioner’s Approach, Roger. S. Pressman and Bruce R. Maxim, McGraw Hill

MCA Syllabus Page 1 MAKAUT

Master of Computer Application

Code: MCAN–302 Paper: Artificial Intelligence

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
 After successful completion of this course, students will be able to understand the underlying assumption of philosophy
of the logical sequences of real life problem by applying State Space Search behind the limitation of non-solving method
of conventional computational approach.
 Incorporating heuristic search technique on Game Playing.
 Various strategies of representing knowledge with decision making algorithms. Creation of substantial domain
knowledge base with meta data. Application of knowledge representation issues using Prolog/LISP.
 To recognize the adoption of new system through learning by an Intelligent System and processing of Natural Language.
 Ability to apply machine learning techniques to solve real world problems and how Expert Systems can be carried out by
the help of learning, analyzing by applying various search techniques and resolute to provide solutions.
UNITS COURSE CONTENT
Introduction to Intelligent Systems: (8L)
1 Overview of Artificial intelligence- Problems of AI, AI technique, Tic – Tac – Toeproblem.

Search Techniques: (10L)

Problems, Problem Space & search.
2
Heuristic Search Techniques,
Game planning –Minimax search procedure, adding alpha beta cut-off’s, Iterative Deepening.
Knowledge Representation Issues: (7L)
Representing knowledge using rules.
Weak slot & filler structures.
3
Strong slot & filler structures.
Implementation of Knowledge with Prolog Programs.
Basic knowledge of programming language like Prolog & Lisp.
Adoption of New Knowledge: (10L)
Deep Learning: Introduction to Neural Networks, Convolution of New Knowledge
4
Natural language processing, Understanding.
Learning – induction & explanation based learning.
Expert systems: (5L)
5
Expert system shells, knowledge acquisition.
Reference Books:
 Artificial Intelligence: A Modern Approach, Stuart Russell & Peter Norvig, Pearson Education.
 Artificial Intelligence, Rich & Knight, TMH.
 Reference Books
 Artificial Intelligence & Intelligent Systems, N.P Padhy, Oxford University Press.
 Introduction to Artificial Intelligence & Expert Systems, Dan W. Patterson, PHI.
 Artificial Intelligence: A new Synthesis, Nils J. Nilsson, Morgan Kaufmann Publishers, Inc.
 M.C. Trivedi, Artificial Intelligence, Khanna Publishing House, New Delhi

MCA Syllabus Page 2 MAKAUT

 Master of Computer Application

Code: MCAN-303 Paper: Design and Analysis of Algorithm

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 4
Course Outcome:
After successful completion of this course, students will be able to:
 Understand and analyze the running times of algorithms based on asymptotic analysis and justify the correctness of
algorithms.
 Describe the divide-and-conquer paradigm and explain when an algorithmic design situation calls for it.
 Understand and implement the greedy paradigm for a given problem.
 Design the dynamic-programming paradigm and implement it.
 Understand and implement the Back Tracking and Branch-&-Bound problem.
 For a given model engineering problem model it using graph and write the corresponding algorithm to solve the
problems.
 Explain the ways to analyze randomized algorithms (expected running time, probability of error).
UNITS COURSE CONTENT
Introduction: (8L)
Characteristics of algorithm. Analysis of algorithm: Asymptotic analysis of complexity bounds – best,
1 average and worst-case behavior; Performance measurements of Algorithm, Time and space trade-offs,
Analysis of recursive algorithms through recurrence relations: Substitution method, Recursion tree method and
Masters’ theorem.
Divide-&-Conquer and Greedy Method: (8L)
Divide & Conquer: General Method - Finding maximum and minimum – Merge sort, Quick sort, Selection,
2 Strassen's matrix multiplication.
Greedy Method: General Method –knapsack problem - Tree vertex splitting - Job sequencing with deadlines –
optimal storage on tapes.
Dynamic Programming: (6L)
3
Assembly-line programming, Matrix Chain Multiplication, 0-1 knapsack problem
Graph Algorithms: (4L)
4
Introduction to Spanning tree, growing a minimum spanning tree, Prims and Kruskal Algorithm
Back Tracking and Branch-&-Bound: (8L)
5 Back Tracking: General Method – 8-queens - Sum of subsets - Graph Coloring –Hamiltonian cycles. Branch
and Bound: General Method - Traveling Salesperson problem.
Lower Bound Theory: (6L)
6 Comparison trees - Oracles and advisory arguments – Lower bounds through reduction - Basic Concepts of NP-
Hard and NP-Complete problems.
Reference Books:
 E. Horowitz, S. Sahni and S. Rajasekaran, 2008, Computer Algorithms, 2ndEdition, Universities Press, India.
 Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein, Introduction to Algorithms, 4TH
Edition, MIT Press/McGraw-Hill.
 A.V. Aho, J.E. Hopcroft, J.D. Ullmann, 1974, The Design and Analysis of Computer Algorithms, Addison Wesley,
Boston.

MCA Syllabus Page 3 MAKAUT

 Master of Computer Application

Code: MCAN-E304A Paper: Image Processing

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Describe the fundamental concept of the digital image processing system.
 Experiment the images in the frequency domain and spatial domain using various transforms.
 Evaluate the techniques for image enhancement and restoration.
 Explain different feature extraction techniques for image analysis and recognition.
 Categorize various compression techniques.
 Develop any image processing application.
UNITS COURSE CONTENT
Introduction (4L)
1 Background, Digital Image Representation, Fundamental steps in Image Processing, Elements of Digital Image
Processing - Image Acquisition, Storage, Processing, Communication, Display.
Digital Image Formation (4L)
2 A Simple Image Model, Geometric Model- Basic Transformation (Translation, Scaling, Rotation), Perspective
Projection, Sampling & Quantization - Uniform & Non uniform.
Mathematical Preliminaries (6L)
Neighbour of pixels, Connectivity, Relations, Equivalence & Transitive Closure; Distance Measures,
3
Arithmetic/Logic Operations, Fourier Transformation, Properties of The Two Dimensional Fourier Transform,
Discrete Fourier Transform, Discrete Cosine & Sine Transform
Image Enhancement (6L)
Spatial Domain Method, Frequency Domain Method, Contrast Enhancement -Linear & Nonlinear Stretching,
4 Histogram Processing; Smoothing - Image Averaging, Mean Filter, Low-pass Filtering; Image Sharpening. High-
pass Filtering, High-boost Filtering, Derivative Filtering, Homomorphic Filtering; Enhancement in the frequency
domain - Low pass filtering, High pass filtering.
Image Restoration (5L)
Degradation Model, Discrete Formulation, Algebraic Approach to Restoration - Unconstrained & Constrained;
5
Constrained Least Square Restoration, Restoration by Homomorphic Filtering, Geometric Transformation –
Spatial Transformation, Gray Level Interpolation.
Image Segmentation (5L)
Point Detection, Line Detection, Edge detection, Combined detection, Edge Linking & Boundary Detection –
6 Local Processing, Global Processing via The Hough Transform; Thresholding - Foundation, Simple Global
Thresholding, Optimal Thresholding; Region Oriented Segmentation - Basic Formulation, Region Growing by
Pixel Aggregation, Region Splitting & Merging.
Reference Books:
 Digital Image Processing, Rafael C.Gonzalez& Richard E.Woods, Pearson
 Fundamentals of Digital Image Processing, Anil K. Jain, Pearson Education-2003.
 Digital Image Processing, Jahne, Springer India
 Digital Image Processing & Analysis, Chanda &Majumder, PHI
 Fundamentals of Digital Image Processing, Jain, PHI

MCA Syllabus Page 4 MAKAUT

 Master of Computer Application

Code: MCAN-E304B Paper: Web Enabled JAVA Programming

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the basic working methodology of JSP, servlet and JSF Frameworks
 Create dynamic web application using JSP and servlet and database.
 Design and develop a Web site using AJAX.
 Debug the Programs by applying concepts and error handling techniques.
UNITS COURSE CONTENT
Core Java Overview: (4L)
Object oriented concepts, Exception Handling, Multi Threading Introduction to JDBC: Overview of JDBC API,
The Java.sql package, JDBC Drivers, Executing SQL commands using JDBC Drivers, static and dynamic
1
Execution of SQL statements, Execution of Stored Procedures using JDBC. Introduction to Transactions and
Transaction Methods. Introduction to JNDI, Introduction to Data Source and Connection pooling, Introduction to
Web Applications, Web Servers Overview of J2EE Technologies. (6L)
Introduction to Java Servlets: (6L)
Static and Dynamic contents, Servlet life Cycle and Life cycle methods, Servlet Request and Response Model,
2 Deploying a Servlet, Servlet State Transitions, Servlet Config and Servlet Context, Servlet Redirection and
Request Dispatch, Servlet Synchronization and Thread Model. Maintaining Client State: Cookies, URL rewriting,
Hidden form fields, Session Tracking. (8L)
Introduction to JSP : (6L)
JSP & Servlet as Web Components, Servlets vs. JSP, JSP Lifecycle, JSP Page Lifecycle Phases, General Rules of
3 Syntax, JSP syntactic elements, JSP element syntax, Template content. JSP elements-directives, declarations,
expressions, scriptlets, actions. JSP Standard Actions: jsp:useBean, jsp:getPreoperty, jsp:setProperty, jsp:include,
jsp:forward, jsp:plugin, jsp:param,java Server Pages Standard Tag Library(JSTL).
Introduction to JSF Frameworks: (8L)
Getting started: A Simple Example, Sample Application Analysis, Development Environments for JSF. Managed
Beans: A Sample Application, Bean Scopes Configuring Beans, Navigation, Static Navigation, Dynamic
Navigation, Standard JSF tags, Data tables, conversion and validation Overview of the Conversion and Validation
Process, Using Standard Converters. Event Handling: Life Cycle Events, Value Change Events, Action Events,
4
Event Listener Tags, Immediate Components, Passing Data from the UI to the Server, Custom Components,
Converters and Validators: Classes for Implementing Custom components, Tags and Components, The Custom
Component Developer’s Toolbox, Encoding: Generating Markup, Decoding: Processing Request Values, Using
Converters, Implementing Custom Component Tags, The TLD File, The Tag Handler Class, Defining Tag
Handlers in JSF 1.1.
AJAX: (6L)
Ajax Fundamentals, JavaScript Libraries, The Prototype Library, The Fade Anything Technique Library, Form
Completion. Realtime Validation, Propagating Client-Side View State Direct Web Remoting, Ajax Components,
5
Hybrid Components, Keeping JavaScript Out of Renderers, Transmitting JSP Tag Attributes to JavaScript
Code,Ajax4jsf,Implementing Form Completion with Ajax4jsf,Implementing Realtime Validation with
Ajax4jsf.Introduction to Java Web Services.
Reference Books
 Professional Java Server Programming- J2EE 1.3 Edition- SubrahmanyamAllamaraju and Cedric Buest- Apress
publication, 2007.
 Core JavaServer Faces-Second Edition-David Geary,CayHorstmann-Prentice Hall-2007

MCA Syllabus Page 5 MAKAUT

 Master of Computer Application

Code:MCAN-E304C Paper: Cloud Computing

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understandand identify the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS, public
cloud, private cloud,hybrid cloud.
 Describe the core issues of cloud computing such as security, privacy, and interoperability to choose the appropriate
technologies, algorithms, and approaches for the identified problems.
 Analyze various cloud computing solutions.
 Understand cloud Storage systems and Cloud security, the risks involved, its impact.
 Apply knowledge for solving real life cloud computing problem scenario and illustrate solutions.
UNITS COURSE CONTENT
Basics of Cloud Computing [4L]
Defining a Cloud, Cloud Types – NIST Cloud Reference Model, Cloud Cube Model, Deployment Models
1
(Public, Private, Hybrid and Community Clouds), Service Models – IaaS, PaaS, SaaS, Benefits and
Advantages of Cloud Computing
Concepts of Abstraction and Virtualization [4L]
2
Taxonomy of Virtualization, Reference model for Virtualization
Services and Applications by Type [5L]
IaaS – Basic Concept, Workload, Partitioning of Virtual Private Server Instances, Pods, Aggregations, Silos
3 PaaS – Basic Concept, Tools and Development Environment with examples
SaaS - Basic Concept and Characteristics, Open SaaS, examples of SaaS Platform
Identity as a Service (IDaaS), Compliance as a Service (CaaS)
Concepts of Service Oriented Architecture (SOA) and Web Service (WS) [2L]
Service Oriented Architecture – Basics, Terminologies, Components, Standards and Technologies, Benefits and
4 Challenges
Web Services – Basics, Characteristics, Terminologies, Characteristics and Scope, Business Models
Cloud-based Storage [3L]
5
Cloud File Systems, including GFS and HDFS
Cloud Security [2L]
Cloud security concerns, security boundary, security service boundary
Overview of security mapping
6
Security of data: cloud storage access, storage location, tenancy, encryption, auditing, compliance
Identity management (awareness of identity protocol standards)
Risk Management and Compliance
Cloud Security [2L]
Cloud security concerns, security boundary, security service boundary
Overview of security mapping
7
Security of data: cloud storage access, storage location, tenancy, encryption, auditing, compliance
Identity management (awareness of identity protocol standards)
Risk Management and Compliance
Introduction to Various Web Services [6L]
8
Amazon Web Services, Google Web Services, Microsoft Cloud Services
Cloud Federation [2L]
9
Definition, different scenario description, replace ability and negotiation mechanism
Reference Books:
 Mastering Cloud Computing by RajkumarBuyya, Christian Vecchiola, S. ThamaraiSelvi, McGraw Hill Education
 Cloud Computing Bible by Barrie Sosinsky, Wiley India Pvt. Ltd
 Cloud Computing: A Practical Approach by Anthony T. Velte, Tata Mcgraw-Hill
 Building Applications in Cloud: Concept, Patterns and Projects by Moyer, Pearson.
 Cloud Security by Ronald Krutz and Russell Dean Vines, Wiley-India

MCA Syllabus Page 6 MAKAUT

 Master of Computer Application

Code: MCAN-E304D Paper: Web Technology using PHP

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
 After successful completion of this course, students will be able to understand the underlying assumption of defining
variables, constants, operators, expressions, HTML Form creation and submissions. POST & GET Method.
 Incorporating HTML form with PHP
 Implementation of Decision, Loops, Functions, Array and Exception Handling concepts using PHP server concept.
 Strategy to connect with MYSQL Server.
 Ability to check validation using JavaScript & JQuery.
 Connecting Forms using AJAX Concept.
UNITS COURSE CONTENT
Introduction to Web Technology & implementation of PHP Programs: (4L)
1 Evaluation of PHP. Basic Syntax. Defining variables and constants. PHP Data type Operator and Expression.
Basics of HTML: Form Creation, Handling of Forms, Submission of Forms. POST& GET method.
Handling Html Form With PHP (4L)
2 Capturing Form. Data Dealing with Multi-value files. Generating File uploaded form. Redirecting a form after
submission.
Decisions, Functions, String, Array & Exception Handling (8L)
Making Decisions. Doing Repetitive task with looping. Mixing Decisions and looping with Html
What is a function? Cookies, Session and in-built functions.
Creating and accessing String. Searching & Replacing String. Formatting String. String Related Library
3
function.
PHP Array. Creating index based and Associative array. Accessing array Element. Looping with Index based
array. Looping with associative array using each() and foreach(). Some useful Library function.
Understanding Exception and error. Try, catch, throw.
Database Connectivity with MySql (6L)
Introduction to RDBMS. Connection with MySql Database. Performing basic database operation(DML) (Insert,
4
Delete, Update, Select). Setting query parameter. Executing query Join (Cross joins, Inner joins, Outer Joins,
Self joins.).
Java Script & JQuery (4L)
5 Introduction to Javascript. Three ways to use Javascript. Working with events Client-side Validation.
Introduction to JQuery. Validation using JQuery. JQuery Forms. JQuery Examples.
Connecting Forms using AJAX Concept (4L)
6
Introduction to AJAX. PHP with AJAX. Working with database.
Reference Books:
 The Joy of PHP Programming: A Beginner’s Guide to Programming Interactive Web Applications with PHP and
MySQL. Alan Forbes, Fifth Edition, Plum Island
 Beginning Web Programming, Jon Duckett, WROX
 Open Source for the Enterprise: Managing Risks, Reaping Rewards,DanWoods and GautamGuliani, O’Reilly, Shroff
Publishers and Distributors, 2005.

MCA Syllabus Page 7 MAKAUT

 Master of Computer Application

Code:MCAN-E304E Paper: Android Application Development

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand mobile application development trends and Android platform
 Analyze the need of simple applications, game development, Location map based services
 Be familiar with SMS, email, service, binding and deploying APks
 To develop, deploy and maintain the Android Applications.
UNITS COURSE CONTENT
Android Fundamentals (6L)
Mobile Application development and trends – Android overview and Versions – Android open stack, features –
1
Setting up Android environment (Eclipse, SDK, AVD)- Simple Android application development – Anatomy of
Android applications – Activity and Life cycle – Intents, services and Content Providers
Android User Interface (6L)
Layouts: Linear, Absolute, Table, Relative, Frame, Scroll view, Resize and reposition - Screen orientation – Views:
2 Text view, Edit Text, Button, Image Button, Checkbox, Toggle Button, Radio Button, Radio Group, Progress Bar,
Auto complete Text, Picker, List views and Web view– Displaying pictures with views: Gallery and Image View,
Image Switcher, Grid view – Displaying Menus: Helper methods, Option and Context
Data Persistence (6L)
3 Shared User preferences – File Handling: File system, System partition, SD card partition, user partition, security,
Internal and External Storage – Managing data using SQLite –User defined content providers
Messaging, Networking And Services (6L)
SMS Messaging: Sending and Receiving – Sending email and networking – Downloading binary and text data files
4
– Access Web services – Developing android services: create your own services, performing long running task in a
service-performing repeated task in a service
Location Access And Publish Android Application (6L)
5 Location based services: Display map, zoom control, view and change, Marking, Geocoding, Get location - Publish
Android applications and Deployment
Reference Books:
 Beginning Android Application Development, WeiMeng Lee,(2012) Wrox Publications (John Wiley, New York)
 Hello Android: Introducing Google's Mobile Development Platform, Ed Burnette (2010), The Pragmatic Publishers,
3rd edition, North Carolina USA
 Professional Android 4 Application Development, Reto Meier (2012),Wrox Publications (John Wiley, New York).
 Programming Android: Java Programming for the New Generation of Mobile Devices,ZigurdMednieks, Laird
Dornin, Blake Meike G, Masumi Nakamura (2011), OReilly Media, USA

MCA Syllabus Page 8 MAKAUT

 Master of Computer Application

Code:MCAN-E304F Paper: Basic Data Science

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the fundamental knowledge of Data Science and the task of Data Science people.
 Understand fundamental of statistics.
 Calculate the correlation, covariance, central tendency.
 Estimate confidence interval.
 Perform hypothesis testing.
 Understand the mechanics of regression analysis.
 Carry out regression, classification using kNN, decision tree.
 Use clustering method to cluster records.

UNITS COURSE CONTENT

Introduction to Data Science (2L)
1
Define Data Science, why data science, data science in business
Descriptive Statistics (4L)
2
Matrix, Matrix operations, Sample, Population, Descriptive statistics, Central tendency, outlier detection
Inferential Statistics (4L)
3
Basics of probability, probability distribution, Central Limit theorem
Hypothesis testing (6L)
4 Null and Alternate Hypothesis, Making a Decision, and Critical Value Method, p-Value Method and Types of
Errors, Two-Sample Mean and Proportion Test
Regression Analysis (4L)
5 Fundamentals of Regression analysis, assumption of regression analysis, accuracy, validity, Dealing with
categorical data
Classification (4L)
6
Introduction, Logistic regression, model building and evaluation
Clustering (2L)
7
Introduction to clustering, k-means clustering, hierarchical clustering
Decision tree and kNN (4L)
8 Introduction to decision tree, regression tree, truncation & pruning, random forest, kNN for regression,
classification, weighted kNN

Reference Books:
 Introducing Data Science; Davy Cielen, Arno D Meysman and Mohamed Ali; Dreamtech Press
 Practical Statistics for Data Scientists; Peter Bruce and Andrew Bruce; O‟Reilly Media Inc.
 Doing Data Science; Cathy O‟Neil and Rachel Schutt; O‟Reilly Media Inc.
 Mining of Massive Datasets; Jure Leskovek, AnandRajaraman and Jeffrey Ullman; Cambridge University Press
Datasets may be downloaded from the website “http://www1.aucegypt.edu/faculty/hadi/RABE5/”

MCA Syllabus Page 9 MAKAUT

 Master of Computer Application

Code: MCAN-E305A Paper: Information Retrieval

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Learn the information retrieval models.
 Be familiar with Web Search Engine.
 Be exposed to Link Analysis.
 Understand Hadoop and Map Reduce.
 Learn document text mining techniques.
UNITS COURSE CONTENT
Introduction (6L)
Introduction -History of IR- Components of IR - Issues –Open source Search engine Frameworks - The impact of
1
the web on IR - The role of artificial intelligence (AI) in IR – IR Versus Web Search - Components of a Search
engine- Characterizing the web.
Information Retrieval (6L)
Boolean and vector-space retrieval models- Term weighting - TF-IDF weighting- cosine similarity –
2
Preprocessing - Inverted indices - efficient processing with sparse vectors – Language Model based IR -
Probabilistic IR –Latent Semantic Indexing - Relevance feedback and query expansion.
Web Search Engine – Introduction And Crawling (6L)
Web search overview, web structure, the user, paid placement, search engine optimization/ spam. Web size
3
measurement - search engine optimization/spam – Web Search Architectures - crawling - meta-crawlers-
Focused Crawling - web indexes –- Near-duplicate detection - Index Compression - XML retrieval.
Web Search – Link Analysis And Specialized Search (6L)
Link Analysis –hubs and authorities – Page Rank and HITS algorithms -Searching and Ranking – Relevance
4 Scoring and ranking for Web – Similarity - Hadoop & Map Reduce - Evaluation - Personalized search -
Collaborative filtering and content-based recommendation of documents and products – handling “invisible”
Web - Snippet generation, Summarization, Question Answering, Cross- Lingual Retrieval.
Document Text Mining (6L)
5 Information filtering; organization and relevance feedback – Text Mining -Text classification and clustering -
Categorization algorithms: naive Bayes; decision trees; and nearest neighbor - Clustering algorithms:
agglomerative clustering; k-means; expectation maximization (EM).
Reference Books:
 Manning, P. Raghavan, and H. Schütze, “Introduction to Information Retrieval”, Cambridge University Press.
 Ricardo Baeza -Yates and Berthier Ribeiro - Neto, “Modern Information Retrieval: The Concepts and Technology
behind Search”, ACM Press Books.
 Bruce Croft, Donald Metzler and Trevor Strohman, “Search Engines: Information Retrieval in Practice”, Addison
Wesley.
 Mark Levene, “An Introduction to Search Engines and Web Navigation”, Edition Wiley.
 Stefan Buettcher, Charles L. A. Clarke, Gordon V. Cormack, “Information Retrieval: Implementing and Evaluating
Search Engines”, The MIT Press.
 Ophir Frieder “Information Retrieval: Algorithms and Heuristics: The Information Retrieval Series“, Springer.
 Manu Konchady, “Building Search Applications: Lucene, Ling Pipe”, and First Edition, Gate Mustru Publishing.

MCA Syllabus Page 10 MAKAUT

 Master of Computer Application

Code: MCAN-E305B Paper: Data Warehousing and Data Mining

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Study of different sequential pattern algorithms
 Study the technique to extract patterns from time series data and it application in real world.
 Can extend the Graph mining algorithms to Web mining
 Help in identifying the computing framework for Big Data
UNITS COURSE CONTENT
Introduction to Data Warehousing: (6L)
The need for data warehousing, Operational and informational Data stores, Data warehouse definition and
1
characteristics, Data warehouse architecture, Data warehouse Database, Sourcing, Acquisition, Cleanup and
transformation tools, Metadata, Access tools, Data marts, Data warehousing administration and management.
Online analytical processing (OLAP): (4L)
2 Need for OLAP, Multidimensional data model, OLAP guidelines, Multidimensional vs. Muilti-relational
(OLAP), Categorization of OLAP tools, OLAP tools internet.
Introduction to data mining: (6L)
The motivation, Learning from past mistake, Data mining, Measuring data mining effectiveness, Embedded data
3
mining into business process, What is decision tree, Business score card, Where to use decision tree, The general
idea, How the decision tree works.
Classification and prediction: (5L)
4 Cluster Analysis – Types of Data in Cluster Analysis, Partitioning methods, Hierarchical Methods; Transactional
Patterns and other temporal based frequent patterns
Time Series Analysis: (4L)
5 Time series Data, Periodicity Analysis for time related sequence data, Trend analysis, Similarity search in Time-
series analysis.
Web Mining: (5L)
6 Web Mining, Mining the web page layout structure, mining web link structure, mining multimedia data on the
web, Automatic classification of web documents and web usage mining; Distributed Data Mining.
Reference Books:
 Data warehousing, Data mining and OLAP by Alex Berson& Stephon J. Smith, Tata McGraw Hill.2003.
 Data Warehousing Fundamentals for IT Professionals, Second Edition by PaulrajPonniah, Wiley India.
 Principles and Implementation of Data Ware housing, Rajeev Parida Fire Wall Media, Lakshmi Publications.2006.

MCA Syllabus Page 11 MAKAUT

 Master of Computer Application

Code: MCAN-E305C Paper: Introduction to Big Data Analytics

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 To optimize business decisions and create competitive advantage with Big Data
 analytics
 Explore the fundamental concepts of big data analytics.
 Learn to analyze the big data using intelligent techniques.
 Understand the various search methods and visualization techniques.
 Learn to use various techniques for mining data stream.
 Understand the applications using Map Reduce Concepts.
 Introduce programming tools PIG & HIVE in Hadoop echo system.
UNITS COURSE CONTENT
Introduction to big data (4L)
1 Introduction to Big Data Platform – Challenges of Conventional Systems - Intelligent data analysis – Nature of
Data - Analytic Processes and Tools - Analysis vs Reporting.
Mining data streams (6L)
Introduction To Streams Concepts – Stream Data Model and Architecture - Stream Computing - Sampling Data
2 in a Stream – Filtering Streams –Counting Distinct Elements in a Stream – Estimating Moments – Counting
Oneness in a Window – Decaying Window - Real time Analytics Platform(RTAP) Applications – Case Studies -
Real Time Sentiment Analysis- Stock Market Predictions.
Hadoop (8L)
History of Hadoop, Hadoop Distributed File System, Components of Hadoop Analysing the Data with Hadoop,
3 Scaling Out, Hadoop Streaming- Design of HDFS-Java interfaces to HDFS Basics- Developing a Map Reduce
Application-How Map Reduce Works-Anatomy of a Map Reduce Job run-Failures-Job Scheduling-Shuffle and
Sort – Task execution - Map Reduce Types and Formats- Map Reduce FeaturesHadoop environment.
Frameworks (6L)
4 Applications on Big Data Using Pig and Hive – Data processing operators in Pig – Hive services – HiveQL –
Querying Data in Hive - fundamentals of HBase and ZooKeeper - IBM InfoSphere BigInsights and Streams.
Predictive Analytics (6L)
5 Simple linear regression, Multiple linear regression, Interpretation of regression coefficients.
Visualizations - Visual data analysis techniques- interaction techniques - Systems and applications.
Reference Books:
 Hadoop: The Definitive Guide, Tom White Third Edition, O’reilly Media, 2012.
 Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming Data, Chris Eaton, Dirk DeRoos,
Tom Deutsch, George Lapis, Paul Zikopoulos, McGrawHill Publishing, 2012.
 Mining of Massive Datasets, Anand Rajaraman and Jeffrey David Ullman, CUP,2012.
 Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics, Bill
Franks, John Wiley& sons, 2012.
 Making Sense of Data, Glenn J. Myatt, John Wiley & Sons, 2007.

MCA Syllabus Page 12 MAKAUT

 Master of Computer Application

Code: MCAN-E305D Paper: Graph Theory

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Write precise and accurate mathematical definitions of objects in graph theory.
 Use mathematical definitions to identify and construct examples and to distinguish examples from non-examples.
 Validate and critically assess a mathematical proof.
 Use a combination of theoretical knowledge and independent mathematical thinking in creative investigation of
questions in graph theory.
 Reason from definitions to construct mathematical proofs.
UNITS COURSE CONTENT
Introduction: (6L)
Graph, Application of Graph, Finite and Infinite Graph, Incidence & Degree, Isolated & Pendant Vertex, Null
1 Graph, Isomorphism, Subgraphs, Walks, Paths, and Circuits, Connected Graphs, Disconnected Graphs, and
Components, Euler Graphs, Operations On Graphs, Hamiltonian Paths and Circuits, The Traveling Salesman
Problem.
Trees (6L)
Trees, Properties, Distance and Centres, Types of Tree, Tree Enumeration, Labeled Tree, Unlabeled Tree,
2 Spanning Tree, Fundamental Circuits, Cut Sets, Properties, Fundamental Circuit and Cut-set, Connectivity,
Separability, Related Theorems.Spanning trees, Fundamental circuits, Spanning trees in a weighted graph, cut sets,
Properties of cut set, All cut sets, Fundamental circuits and cut sets, Connectivity and separability.
Connectivity And Planarity (6L)
3 Network Flows, Planar Graph, Representation, Detection, Dual Graph, Geometric and Combinatorial Dual,
Related Theorems, Digraph, Properties, Euler Digraph.
Matrices, Colouring (6L)
Matrix Representation, Adjacency matrix, Incidence matrix, Circuit matrix, Cut-set matrix, Path Matrix, Properties
4
– Related Theorems – Correlations. Graph Coloring, Chromatic Polynomial, Chromatic Partitioning, Matching,
Covering, Related Theorems.
Graph Theoretic Algorithm (6L)
5 Graph Algorithms- Connectedness and Components- Spanning Tree- Fundamental Circuits- Cut Vertices-
Directed Circuits- Shortest Path – Applications overview.
Reference Books:
 NarsinghDeo, “Graph Theory: With Application to Engineering and Computer Science”, Prentice Hall of India.
 Grimaldi R.P. “Discrete and Combinatorial Mathematics: An Applied Introduction”, Addison Wesley.
 Clark J. and Holton D.A, “A First Look at Graph Theory”, Allied Publishers.
 Mott J.L., Kandel A. and Baker T.P. “Discrete Mathematics for Computer Scientists and Mathematicians” , Prentice
Hall of India.
 Liu C.L., “Elements of Discrete Mathematics”, McGraw Hill.
 Rosen K.H., “Discrete Mathematics and Its Applications”, McGraw Hill.

MCA Syllabus Page 13 MAKAUT

 Master of Computer Application

Code: MCAN-E305E Paper: Operation Research and Optimization Techniques

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Describe the way of writing mathematical model for real-world optimization problems.
 Identify Linear Programming Problems and their solution techniques
 Categorize Transportation and Assignment problems
 Apply the way in which Game Theoretic Models can be useful to a variety of real-world scenarios in economics and
in other areas.
 Convert practical situations into non-linear programming problems.
 Solve unconstrained and constrained programming problems using analytical techniques.
UNITS COURSE CONTENT
Linear Programming Problem (LPP)-I (8L)
Formulation of an LPP; Graphical Method of solution of an LPP; Convex Combination and Convex Set; Convex
1
Hull and Convex Polyhedron; Canonical and Standard form of an LPP; Basic Solution of a system of linear
equations; Simplex Method; Big-M Method; Concept of Duality; Mathematical formulation of duals.
Linear Programming Problem (LPP)-II (8L)
Transportation Problems (TP) ; Representation of Transportation Problems as LPP; Methods of finding initial basic
2
feasible solution of TP: North-West Corner Rule, Matrix Minima Method, Vogel’s Approximation Method;
Optimality test of the basic feasible solution; Assignment Problems; Hungarian Method.
Game Theory (7L)
Introduction; Strategies; The Minimax and Maximin Criterion; Existence of Saddle Point; Two person zero some
3
Games; Games with saddle Point – Pure Strategies; Games without a Saddle Point – Mixed Strategies; Symmetric
Games; Dominance Principle; Graphical Method of Solution; Algebraic Method of Solution.
Non-Linear Programming Problem (NLPP) (7L)
Single-variable Optimization; Multivariate Optimization with no constraints: Semidefinite Case, Saddle Point;
4
Multivariate Optimization with Equality Constraints: Method of Lagrange Multipliers; Multivariable Optimization
with inequality constraints: Kuhn-Tucker Conditions.
Reference Books:
 Linear Programming and Game Theory by J. G. Chakraborty and P. R. Ghosh, Moulik Library.
 Operations Research by KantiSwarup, P. K. Gupta and Man Mohan, S. Chand and Sons.
 Engineering Optimization by S. S. Rao, New Age Techno Press.
 Operations Research by J K Sharma, Macmillan India Ltd

MCA Syllabus Page 14 MAKAUT

 Master of Computer Application

Code: MCAN-E305F Paper: Pattern Recognition

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Identify where, when and how pattern recognition can be applied.
 Equipped with basic mathematical and statistical techniques commonly used in pattern recognition
 Understand a variety of pattern recognition algorithms.
 Apply machine learning concepts in real life problems.
 Design and develop a pattern recognition system for the specific application
 Evaluate quality of solution of the pattern recognition system.
UNITS COURSE CONTENT
Basics of Probability, Random Processes and Linear Algebra (2L)
1 Probability: independence of events, conditional and joint probability, Bayes theorem Random Processes: Stationary
and non-stationary processes, Expectation, Autocorrelation, Cross-Correlation, spectra.
Linear Algebra (2L)
2
Inner product, outer product, inverses, eigen values, eigen vectors, singular values, singular vectors.
Bayes Decision Theory (4L)
3 Minimum-error-rate classification. Classifiers, Discriminant functions, Decision surfaces. Normal density and
discriminant functions. Discrete features.
Parameter Estimation Methods (8L)
Maximum-Likelihood estimation :Gaussian case. Maximum a Posteriori estimation. Bayesian estimation: Gaussian
case. Unsupervised learning and clustering - Criterion functions for clustering. Algorithms for clustering: K-Means,
4 Hierarchical and other methods. Cluster validation. Gaussian mixture models, Expectation-Maximization method for
parameter estimation. Maximum entropy estimation. Sequential Pattern Recognition. Hidden Markov Models
(HMMs). Discrete HMMs. Continuous HMMs. Nonparametric techniques for density estimation. K-Nearest
Neighbour method.
Dimensionality reduction (6L)
Principal component analysis - it relationship to eigen analysis. Fisher discriminant analysis - Generalised eigen
5
analysis. Eigen vectors/Singular vectors as dictionaries. Factor Analysis, Total variability space - a dictionary
learning methods. Non negative matrix factorisation - a dictionary learning method.
Linear discriminant functions (2L)
6
Gradient descent procedures, Perceptron, Support vector machines - a brief introduction.
Artificial neural networks (4L)
7 Multilayer perceptron - feedforward neural network. A brief introduction to deep neural networks, convolutional
neural networks, recurrent neural networks.
Non-metric methods for pattern classification (2L)
8 Non-numeric data or nominal data. Decision trees: Classification and Regression Trees (CART). K-Nearest
Neighbour method
Reference Books:
 Richard O. Duda, Peter E. Hart, David G. Stork, "Pattern Classification", 2/E, Wiley - Interscience, 2000.
 Christopher M. Bishop :, "Pattern Recognition And Machine Learning (Information Science and Statistics)" ,1/E,
Springer, January 2008
 T. Hastie , R. Tibshirani, J. H. Friedman:, "The Elements of Statistical Learning",1/E ,Springer, Reprint 3/E, 2003
 Christopher M. Bishop ; "Pattern Recognition and Machine Learning", Springer, 2006
 Shigeo Abe, "Advances in Pattern Recognition", Springer, 2005
Datasets may be downloaded from the website “http://www1.aucegypt.edu/faculty/hadi/RABE5/”

MCA Syllabus Page 15 MAKAUT

 Master of Computer Application

Code: MCAN-305G Paper: Machine Learning

Contacts Hours / Week: 3 Total Contact Hours: 30 Credit: 3
Course Outcome:
After successful completion of this course, students will be able to:
 Understand the concept of machine learning.
 Identify the regression and classification problem.
 Relate the supervised, unsupervised learning in the real life problem.
 Evaluate the machine learning models with respect to the performance parameters.
 Design and implement various machine learning algorithms in the range of real world problems.
UNITS COURSE CONTENT
Introduction to Machine Learning (2L)
1 Introduction to Artificial Intelligence, Machine Learning, Deep Learning
Types of Machine Learning, Application of Machine Learning
Linear Algebra (2L)
2 Scalar, Vector, Matrix, Matrix Operation, Norms, Probability, Joint Distribution, Bayes Theorem, Expectation, Co-
variance.
Regression and Classification (4L)
3 Simple Linear Regression, Multiple Linear Regression, Least square gradient descent, Linear Classification,
Logistic Regression
Decision Tree Learning (2L)
Representing concepts as decision trees. Recursive induction of decision trees. Picking the best splitting attribute:
4
entropy and information gain. Searching for simple trees and computational complexity. Overfitting, noisy data,
and pruning.
Ensemble Learning (2L)
5
Bagging, boosting, and DECORATE. Active learning with ensembles.
Artificial Neural Networks (4L)
Neurons and biological motivation. Linear threshold units. Perceptrons: representational limitation and gradient
6
descent training. Multilayer networks and backpropagation. Hidden layers and constructing intermediate,
distributed representations. Overfitting, learning network structure, recurrent networks.
Support Vector Machines (4L)
7 Maximum margin linear separators. Quadratic programming solution to finding maximum margin separators.
Kernels for learning non-linear functions.
Bayesian Learning (4L)
8 Probability theory and Bayes rule. Naive Bayes learning algorithm. Parameter smoothing. Generative vs.
discriminative training. Logistic regression. Bayes nets and Markov nets for representing dependencies.
Clustering and Unsupervised Learning (2L)
Learning from unclassified data. Clustering. Hierarchical Aglomerative Clustering. k-means partitional clustering.
9
Expectation maximization (EM) for soft clustering. Semi-supervised learning with EM using labeled and unlabled
data.
Dimensionality Reduction (4L)
10 Principal component Analysis(PCA), Linear Discriminant Analysis(LDA), Feature selection, Feature manipulation
and normalization
Reference Books:
 Pattern Recognition and Machine Learning- Christopher M. Bishop, Springer
 The Elements of Statistical Learning: Data Mining, Inference, and Prediction - Trevor Hastie, Robert Tibshirani, and
Jerome Friedman, Springer
 Machine Learning for Absolute Beginners: A Plain English Introduction - Oliver Theobald, Scatterplot Press
 Machine Learning -Tom M. Mitchell, Mc Graw Hill
Datasets may be downloaded from the website “http://www1.aucegypt.edu/faculty/hadi/RABE5/”

MCA Syllabus Page 16 MAKAUT

Master of Computer Application

Code: MCAN-E394A Paper: Image Processing Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Students will learn to convert one image form to another image form.
 Able to learn various kinds of image enhancement and image restoration techniques.
 They will learn various techniques of image compression, image segmentation etc.
UNIT COURSE CONTENT
1 Display of Grayscale Images
2 Histogram Equalization
3 Non-linear Filtering
4 Edge detection using Operators
5 2-D DFT and DCT
6 Filtering in frequency domain
7 Filtering in spatial domain
8 Display of color images
9 Discrete Wavelet Transform (DWT) of images
10 Segmentation using watershed transform
11 Image Compression
12 Applications of image zooming and image shrinking etc

MCA Syllabus Page 17 MAKAUT

Master of Computer Application

Code: MCAN-E394B Paper: Web Enabled JAVA Programming LAB

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Create dynamic Website/ Web based Applications
UNIT COURSE CONTENT
1 HTML to Servlet Applications
2 Applet to Servlet Communication
3 Designing online applications with JSP
4 Creating JSP program using JavaBeans
5 Working with Enterprise JavaBeans
6 Performing Java Database Connectivity.
7 Creating and Sending Email with Java
8 Building web applications

MCA Syllabus Page 18 MAKAUT

Master of Computer Application

Code: MCAN-E394C Paper: Cloud Computing Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Adapt different types of virtualization and increase resource utilization.
 Build a private cloud using open source technologies.
 Analyze security issues on cloud.
 Develop real world web applications and deploy on commercial cloud.
 Demonstrate various service models.
UNIT COURSE CONTENT
1 Study of NIST model of cloud computing
Understand different types of virtualizations, Host and bare metal hypervisors and implement horizontal
2 scalability.
Technology: XEN/ Vmwares EXSi
Implement IaaS using your resources.
3
Technology: Open Stack / Eucalyptus
Simulate identity management in private cloud
4
Technology: Open Stack
Explore Storage as a Service for remote file access using web interface.
5
Technology: ownCloud
Understand security of web server and data directory
6
Technology: ownCloud
Deploy Platform as a Service; web applications on commercial cloud .
7
Technology: Google appEngine/ Windows Azure
To create and access VM instances and demonstrate various components such as EC2, S3, Simple DB,
8 DynamoDB
Technology: Amazon Web Services
Understand on demand application delivery and Virtual desktop infrastructure (Software as a Service)
9
Technology: Ulteo
10 Understanding of implementation/applications of basic fog computing.

MCA Syllabus Page 19 MAKAUT

Master of Computer Application

Code: MCAN-E394D Paper: Web Technology using PHP Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
 After successful completion of this course, students will be able to understand the underlying assumption of defining
variables, constants, operators, expressions, HTML Form creation and submissions. POST & GET Method &
Implementation of Decision, Loops, Functions, Array and Exception Handling concepts.
 How HTML forms are submitted with PHP Server.
 Strategy to connect with MYSQL Server.
 Ability to check validation using JavaScript & JQuery.
 Connecting Forms using AJAX Concept.
UNITS COURSE CONTENT
Fundamental of Web Design
HTML: Introduction, Editor(VS Code/ Sublime), Element, Attribute, Head, Heading, Paragraph, Style,
Formatting, Quotation, Comment, Color, CSS, Link, Image, Table, List, Block & Inline, Class, ID, Iframe, Script,
File path, Layout, Code, Entity, Symbol, Emoji, Charset, Forms, Form Attributes, Elements, Input types, Input
1 Attributes.
CSS: Introduction, Selector, External-Internal-Inline CSS, Comments, Color, Background, Border, Margin,
Padding, Height, Width, Box model, Outline, Text, Font, Icon, Link, List, Table, Display, Max width, Position,
Overflow, Float, Inline-bock, Align, Pseudo-class, Pseudo-element, Opacity, Navigation Bar, Dropdowns, Image
gallery, Image sprites, Text Effect, Web Fonts, Transition, Animation, Tooltip, Style Image, Button etc.
Advance Web Design
CSS Responsive Design: Introduction, Viewport, Grid view, Media queries, Responsive image, Responsive
video.
2
Bootstrap: Introduction, Container, Grid, Typography, Color, tables, Images, jumbotron, Alerts, Button, Button
group, Badges, Progress bar, Spinner, Pagination, List group, Card, Dropdown, Collapse, Navs, Navbar, Forms,
Input, Input group, Carousel, Modal, Tooltip, Popover, Toast, Scrollspy, Flex, Media object.
Introduction to Web Technology & implementation of PHP Programs &Knowing about Connection
3 Strings and Functions.
Implementing basic PHP programs with Form, Loop, Functions Array and Strings.
Handling Html Form With PHP:
5 Capturing Form. Data Dealing with Multi-value files. Generating File uploaded form. Redirecting a form after
submission.
Database Connectivity with MySql:
Programs implementing displaying data from MYSQL to HTML forms using PHP.
6
Programs implementing updating data from MYSQL to HTML forms using PHP.
Programs implementing deleting data from MYSQL to HTML forms using PHP.
Java Script & JQuery:
7
Validating forms using JAVASCRIPT.
Connecting Forms using AJAX Concept:
8
Fetching data from one form to another form using AZAX.

MCA Syllabus Page 20 MAKAUT

Master of Computer Application

Code: MCAN-E394E Paper: Android Application Development Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Learn to use Android Application development platform.
 To create simple android application
 To understand and implement various designing components of Android user interfaces
 To design application’s main navigation screen
 To understand and designing Android Notification (including push notification)
 To connect android application to database for data insertion and retrieval
UNITS COURSE CONTENT
Writing First Application
1 Creating Android Project, Android Virtual Device Creation, Set up debugging environment, Workspace set up for
development, Launching emulator, debugging on mobile devices.
Basic UI design
2
Basics about Views, Layouts, Resources, Input controls, Input Events, Toasts.
More UI Design
3 Layouts design GridView and ListView, Action bar, Adapters, Menus: Option menu, context menu, sub menu,
Pickers - Date and Time, Spinners.
Activity and Fragment
4
Activity, Fragment, Activity Lifecycle and Fragment Lifecycle.
Intents
5
Implicit Intents, Explicit intents, communicating data among Activities.
Navigation Drawer
6
Panel that displays the app’s main navigation screens on the left edge of the screen
Android Notifications
7
Toast, Dialogs (TimePicker, DatePicker, Progress, Alert), Notification Manager and Push Notification
Introducing SQLite
8 SQLiteOpenHelper and creating a database - Opening and closing a database, Working with cursors Inserts, updates,
and deletes

MCA Syllabus Page 21 MAKAUT

 Master of Computer Application

Code: MCAN-E394F Paper: Basic Data Science Lab

Contacts Hours / Week: 4 Total Contact Hours: 40 Credit: 2
Course Outcome:
After successful completion of this course, students will be able to:
 Perform the quantitative and qualitative analysis of the data.
 Realized the basic trends in two variable plots of numerical data.
 Compute the mean, median, mode, standard deviation, and variance of grouped data
 Determine the equation of the trend line to forecast outcomes for time periods in the future, using alternate coding for
time periods if necessary.
 Use a computer to develop a regression analysis, and interpret the output that is associated with it.
 Construct machine learning models for providing business ideas.
UNITS COURSE CONTENT
1 Read the datasets(.txt, .xlsx, .csv) from the local system
2 Make numerical summery(descriptive statistics) of data
3 Apply various measures- range, interquartile range, mean absolute deviation, variance, and standard deviation
4 Make graphical summery(histogram, scatterplot, pie plot, boxplot) of data
5 Detect the outliers(if exists), impute the outliers using suitable methods.
6 Implement simple linear regression with suitable datasets, observe the standard error, p-value, R-square values.
Implement the multivariate regression with suitable datasets and present the outputs
(a) What percentage of variation in the response is explained by these predictors?
(b) Which observation has the largest (positive) residual? Give the case number.
7
(c) Compute the mean and median of the residuals.
(d) Compute the correlation of the residuals with the fitted values.
(e) Compute the correlation of the residuals with the target variable.
8 Implement the logistic regression using suitable datasets. Evaluate the performance of the model.
9 Implement kNN for classification and regression problem.
10 Implement weighted kNN for classification and regression problem.
11 Implement decision tree and regression tree and check the model performance.
Datasets may be downloaded from the website “http://www1.aucegypt.edu/faculty/hadi/RABE5/”

MCA Syllabus Page 22 MAKAUT

 Master of Computer Application

Code: MCAN-381 Paper: Minor Project and Viva-voce

Contacts Hours / Week: 8 Total Contact Hours: 80 Credit: 5
A student needs to pursue a research/application based project in his/her institution under the direct
supervision/mentorship of assigned teacher(s) and on completion of the same an evaluation will be made on the basis of
Project Report, Project Presentation and Viva-voce.

MCA Syllabus Page 23 MAKAUT

MASTER OF COMPUTER APPLICATION
Syllabus w.e.f. the Academic Session 2020-2021

MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY

WEST BENGAL
 Master of Computer Application

Second Year: Semester-IV

Code: MCAN-O401 Paper: Open Elective
Contacts Hours / Week: Not applicable Total Contact Hours: Not applicable Credit: 3
Open Elective
 Business Analytics
 Robotics
 Bioinformatics
 Information Theory &Coding
 Automation in VLSI Design
 Intelligent Control
 Design of Embedded Systems
 Machine Learning
 Soft Computing
 Information Retrieval
 Distributed System
 Digital Marketing
(While opting for a domain for pursuing the online course, a student needs to ensure that the domain was not covered in
previous semesters of the program.)

Student may opt for a minimum 12-week online course from Massive Open Online Courses (MOOCs) in one or any of the
above domains with prior approval form the University and/or his/her Institution. In such case, student needs to submit a
self-attested copy of the mark-sheet of this online course to college well before the end of Semester IV. Directly on the
basis of the result obtained by a student, final marks will be allocated to him/her. In case a student pursues a non-
evaluation based online course, an in-house evaluation would be done.

MCA Syllabus Page 1 MAKAUT

 Master of Computer Application

Code: MCAN-481 Paper: Comprehensive Viva-Voce

Contacts Hours / Week: Not Applicable Total Contact Hours: Not Applicable Credit: 2
Course Objective
Objective of comprehensive viva-voce is to assess the overall knowledge of the student in the relevant field of computer
science and application acquired over 2 years of study in the MCA Program.
The viva shall normally cover the subjects taught in all the semesters of MCA Program. This will test the student’s learning
and understanding during the course. In doing so, the main objective of this course is to prepare the students to face interview
both in the academic and the industrial sector.

MCA Syllabus Page 2 MAKAUT

 Master of Computer Application

Code: MCAN-482 Paper: Major Project & Viva-Voce

Contacts Hours / Week: 28 Total Contact Hours: 12-15 Weeks Credit: 20
A student needs to pursue a research/application based project in any of the following modes:
[A] In his/her institution under the supervision/mentorship of assigned teacher(s) belonging to that institution.
[B] In his/her institution under the joint supervision/mentorship of assigned teacher(s) belonging to that institution and invited
external expert(s).
[C] In a research/software/hardware organization under the joint supervision/mentorship of assigned teacher(s) belonging to
that institution and external expert(s) belonging to that research/software/hardware organization.
On completion of the same, an evaluation will be made by the institution on the basis of Project Report, Project Presentation,
Viva-voce and sufficient measures will be taken by the institution to understand that the project is an outcome based work as
a product of student’s sole effort.

MCA Syllabus Page 3 MAKAUT