MASTER OF COMPUTER APPLICATION

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

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:
 Software Engineering, N.S. Gill, Khanna Publishing House
 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 Larman Motilal Uk 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:
 A Classical Approach to Artificial Intelligence, Munesh Trivedi, Khanna Book Publishing.
 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.

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:
 Design and Analysis of Algorithms, Gajendra Sharma, Khanan Publishing House.
 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
 Digital Image Processing, Munesh Trivedi, Khanna Publishing House, Delhi.

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
 Core JAVA, Tanweer Alam, Khanna Publishing House.
 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.
 Learning PHP, Ramesh Bangia, Khanna Publishing House.

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
 Mastering Android, Khanna Publishing House.

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:
 Data Sciences and Analytics, V.K. Jain, Khanna Publishing House.
 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.
 Data Mining and Warehousing, Ikvinderpal Singh, Khanna Book Publishing 2017.

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:
 Big Data and Hadoop, V.K. Jain, Khanna Publishing House 2021.
 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.
 Combinatorics and Graph Theory, S.B. Singh, Khanna Publishing House.
 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:
 Machine Learning, Rajiv Chopra, Khanna Publishing House
 Introduction to Machine Learning, Jeeva Jose, AICTE Recommended.
 Machine Learning, V.K. Jain, Khanna Book Publishing, Delhi.
 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