Mca Syllabus
Mca Syllabus
Course objectives:
CO1: Apply the fundamentals of set theory and matrices for the given problem.
CO2: Realize different types of distribution, evaluate the mean and variance for the given case
study.
CO3: Model the given problem by applying the concepts of graph theory.
CO4: Apply the concepts of mathematical logic for drawing inferences
CO5: Identify and list the different applications of discrete mathematical concepts in
computer science.
Module-1
Sets and Matrices: Set Theory, Operations on sets, Cardinality of sets, inclusion-exclusion principle,
matrices, finding Eigen values and Eigen vectors.
Teaching- Practice of problems on sets, matrices and Computation of Eigen values and exploring
Learning the applications of inclusion-exclusion principle and Eigen values.
Process
Module-2
Mathematical Logic: Propositional Logic, Applications of Propositional Logic, Propositional
Equivalences, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to
Proofs
Teaching- Problems on Pigeon hole principle and understanding it’s applications, Applications of
Learning Relations, Posets
Process
Module-4
Random variable and probability distribution: Concept of random variable, discrete probability
distributions, continuous probability distributions, Mean, variance and co-variance and co-variance of
random variables. Binomial and normal distribution, Exponential and normal distribution with mean
and variables and problems
Teaching- Solving problems related to different probability distributions and understanding the
Learning applications of probability distributions.
Process
Module-5
Graph Theory: Graphs and Graphs models, Graph Terminology and Special Types of Graphs,
Representing Graphs and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path
Problems, Planar Graphs, Graph Coloring
Course objectives:
1. To familiarize with the concepts, design, and structure of the UNIX operating system.
2. To use basic UNIX Utilities.
3. Discuss the principles of UNIX shell programming.
MODULE-1
Introduction to Operating Systems, Computer System Architecture; Operating System Operations; ;
Operating System Structure: Operating System Services; System Calls; Types of System Calls;
System Programs;; Virtual Machines; System boot. Process Management Process Scheduling: Basic
Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple Processor Scheduling. Process
Synchronization
Teaching-
Learning
Process
MODULE-2
Deadlocks: System model; Deadlock Characterization, Methods for handling deadlocks; Deadlock
Prevention; Deadlock Avoidance; Deadlock Detection and Recovery from deadlock. Memory
Management: Memory Management Strategies: Background, Swapping; Contiguous Memory
Allocation; Paging; Segmentation; Virtual Memory Management; Demand Paging; Page
Replacement; Allocation of Frames; Thrashing.
Teaching- .
Learning
Process
MODULE-3
The File System: The File, What’s in a File name? The Parent-Child Relationship, The HOME
Variable: The Home Directory, pwd, cd, mkdir, rmdir, Absolute Pathnames, Relative Pathnames,
The Unix File System. The vi Editor: vi Basics, Input Mode, ex Mode and Command Mode. Basic
File Attributes: ls options, File Ownership, File Permissions, chmod, Directory Permissions,
Changing the File Ownership More File Attributes: File Systems and Inodes, Hard Links, Symbolic
Links, The Directory, umask, Modification and Access Times, find. The Shell: The Shell’s
Interpretive Cycle, Shell Offerings, Pattern Matching-The Wild-cards, Escaping and Quoting,
Redirection: The Three Standard Files, Two Special Files: /dev/null and /dev/tty, pipes, tee:
Creating a Tee, Command Substitution.
Teaching-
Learning
Process
MODULE-4
The Process: Process Basics, ps: Process Status, System Processes, Mechanism of Process Creation,
Internal and External Commands, Running Jobs in Background, Killing Processes with Signals, Job
Control, at and batch, cron. Essential Shell Programming: Shell Variables, Environment Variables,
Shell Scripts, read, Using Command Line Arguments, exit and exit status of command, The Logical
Operators, The if Conditional, using test and [] to Evaluate Expression, The case Conditional, expr,
while: looping, for: looping with a list, set and shift, trap, Debugging Shell Scripts with set – x.
Teaching-
Learning
Process
MODULE 5
AWK and Advanced Shell Programming Simple AWK Filtering, Splitting a Line into Fields, printf,
the Logical and Relational Operators, Number Processing, Variables, The –f option, BEGIN and END
positional Parameters, getline, Built-invariables, Arrays, Functions, Interface with the Shell, Control
Flow. The sh command, export Command, Conditional Parameter Substitution, Merging Streams,
Shell Functions, eval, Exec Statement and Examples
Teaching-
Learning
Process
Sl.NO Experiments
1 a. Write a shell script that takes a valid directory name as a argument recursively
descend all the sub-directors, find the maximum length of any file in that hierarchy and
writ the maximum value to the standard output.
b. Write a shell script that accepts a path name and creates all the components in that
path name as directories. For example, if the script is named as mpc, then the command
mpc a/b/c/d should create sub-directories a, a/b, a/b/c, a/b/c/d.
2 a. Write a shell script that accepts two filenames as arguments, checks if the
permissions for these files are identical and if the permissions are identical, output
common permissions otherwise output each filename followed by its permissions.
b. Write a shell script which accepts valid log-in names as arguments and prints their
corresponding home directories, if no arguments are specified, print a suitable error
message.
3 a. Write a shell script that accept one or more file names as argument and convert all of
them to uppercase, provided they exists in current directory.
b. Write a shell script that displays all the links to a file specified as the first argument
to the script. The second argument, which is optional, can be used to specify in which
the search is to begin. If this second argument is not present, the search is to begin in
the current working directory. In either case, the starting directory as well as its
subdirectories at all levels must be searched. The script need not include error checking.
4 a. Write s a shell script to find a file/s that matches a pattern given as command line
argument in the home directory, display the contents of the file and copy the file into
the directory ~/mydir.
b. Write a shell script to list all the files in a directory whose filename is at least 10
characters. (use expr command to check the length).
5 a. Write a shell script that gets executed and displays the message either ―Good
Morning‖ or ―Good Afternoon‖ or ―Good Evening‖ depending upon time at which the
user logs in.
b. Write a shell script that accepts a list of filenames as its argument, count and report
occurrence of each word that is present in the first argument file on other argument
files.
6 a. Write a shell script that determine the period for which as specified user is working
on a system and display appropriate message.
b. Write a shell script that reports the logging on of as specified user within one minute
after he/she login. The script automatically terminates if specified user does not login
during
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing
marks in SEE is 40% of the maximum marks of SEE. A student shall be deemed to have satisfied the
academic requirements and earned the credits allotted to each subject/ course if the student secures not
less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and
SEE (Semester End Examination) taken together
1. The question paper will be set for 100 marks and marks scored will be scaled down
proportionately to 50 marks.
2. The question paper will have ten questions. Each question is set for 20 marks.
3. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
4. The students have to answer 5 full questions, selecting one full question from each module.
The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion
will have a CIE component only. Questions mentioned in the SEE paper shall include questions
from the practical component).
The minimum marks to be secured in CIE to appear for SEE shall be the 15 (50% of
maximum marks-30) in the theory component and 10 (50% of maximum marks -20) in the
practical component. The laboratory component of the IPCC shall be for CIE only. However,
in SEE, the questions from the laboratory component shall be included. The maximum of
04/05 questions to be set from the practical component of IPCC, the total marks of all
questions should not be more than the 20 marks.
SEE will be conducted for 100 marks and students shall secure 40% of the maximum marks to
qualify in the SEE. Marks secured will be scaled down to 50. (Student has to secure an
aggregate of 50% of maximum marks of the course(CIE+SEE)
Suggested Learning Resources:
Text Books:
1. Sumitabha Das: UNIX Concepts and Applications, 4th Edition, Tata McGraw Hill, 2006.
2. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating Systems Principles, 8th Edition,
Wiley – India.
Reference Books:
1. UNIX: The Complete Reference: Kenneth Roson et al, Osborne/McGraw Hill, 2000.
2. Using UNIX: Steve Montsugu, 2ndEdition, Prentice Hall India, 1999.
3. UNIX and Shell Programming: M G Venkateshmurthy, Pearson Education Asia, 2005
4. Behrouz A Forouzan and Richard F Gilberg
5. 4.D M Dhamdhere: Operating Systems – A Concept Based Approach, 2nd Edition, Tata McGraw –
Hill, 2002.
https://www.digimat.in/nptel/courses/video/106105214/L01.html
https://nptel.ac.in/courses/106108101
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO1 PO12
1
CO1 x x
CO2 x x
CO3 x x
CO4 x x
Data Structures with Algorithms
Course Code 22MCA13 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 4:0:0 SEE Marks 50
Total Hours of Pedagogy 50 Total Marks 100
Credits 04 Exam Hours 03
2. Data Structures Using C and C++ by Yedidyah Langsam and Moshe J. Augenstein and Aaron M
Tenanbanum, 2nd Edition, Pearson Education Asia, 2002.
3. Introduction to Data Structure and Algorithms with C++ by Glenn W. Rowe.
Computer Networks
Course Code 22MCA14 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 3:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Reference Books:
1. James F. Kurose, Keith W. Ross, ―Computer Networking – A Top-Down Approach Featuring the
Internet‖, Fifth Edition, Pearson Education, 2009.
2. Nader. F. Mir, ―Computer and Communication Networks‖, Pearson Prentice Hall Publishers, 2010.
3. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, ―Computer Networks: An Open Source Approach‖,
Mc Graw Hill Publisher, 2011.
4. Behrouz A. Forouzan, ―Data Communication and Networking‖, Fourth Edition, Tata McGraw –
Hill, 2011.
Reference Books:
2. Craig Larman, Applying UML and Patterns, 3rd ed, Pearson Education,2005.
Module-1
Research Methodology: Introduction, Meaning of Research, Objectives of Research, Motivation in
Research, Types of Research, Research Approaches, Significance of Research, Research Methods
versus Methodology, Research and Scientific Method, Importance of Knowing How Research is
Done, Research Process, Criteria of Good Research, and Problems Encountered by Researchers in
India.
Teaching- Ppt and case study.
Learning
Process
Module-2
Defining the Research Problem: Research Problem, Selecting the Problem, Necessity of Defining
the Problem, Technique Involved in Defining a Problem, An Illustration. Reviewing the literature:
How to review the literature, searching the existing literature, reviewing the selected literature,
Developing a theoretical framework, Developing a conceptual framework, Writing about the
literature reviewed
Teaching- Ppt, case study, show papers published.
Learning
Process
Module-3
Research Design: Meaning of Research Design, Need for Research Design, Features of a Good
Design, Important Concepts Relating to Research Design, Different Research Designs
Data Collection: Experimental and Surveys, Collection of Primary Data, Collection ofSecondary
Data, Selection of Appropriate Method for Data Collection, Case Study Method.
Teaching- Ppt, case study
Learning
Process
Module-4
Interpretation and Report Writing: Meaning of Interpretation, Technique of Interpretation,
Precaution in Interpretation, Significance of Report Writing, Different Steps in Writing Report,
Layout. Types of Reports, Oral Presentation, Mechanics of Writing a Research Report, Precautions
for Writing Research Reports.
Teaching- Ppt, real time examples
Learning
Process
Module-5
Intellectual Property (IP) Acts: Introduction to IP: Introduction to Intellectual Property (IP), different
types of IPs and its importance in the present scenario, Patent Acts: Indian patent acts 1970.Design
Act: Industrial Design act 2000. Copy right acts: Copyright Act 1957. Trade Mark Act, 1999
Teaching- Ppt , real time examples
Learning
Process
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing
marks in SEE is 40% of the maximum marks of SEE. A student shall be deemed to have satisfied the
academic requirements and earned the credits allotted to each subject/ course if the student secures not
less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and
SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
9. Three Unit Tests each of 20 Marks
10. Two assignments each of 20 Marks or one Skill Development Activity of 40 marks
to attain the COs and POs
The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50
marks
CIE methods /question paper is designed to attain the different levels of Bloom’s taxonomy as
per the outcome defined for the course.
Text books
1. Research Methodology: Methods and Techniques, C.R. Kothari, Gaurav Garg New Age
International 4th Edition, 2018.
2. Research Methodology a step-by- step guide for beginners. (For the topic Reviewing the literature
under module 2) Ranjit Kumar SAGE Publications Ltd 3rd Edition, 2011 Study Material.
3. Intelectual property, Debirag E. Bouchoux, Cengage learning, 2013.
Reference:
1.Research Methods: the concise knowledge base Trochim, Atomic Dog Publishing, 2005.
2.Conducting Research Literature Reviews: From the Internet to Paper Fink A Sage Publications,
2009.
Web links and Video Lectures (e-Resources):
https://youtu.be/E2gGF1rburw
Sl.N Experiments
O
PART A
Implement the following Computer Networks concepts using C/C++
1 Write a program for distance vector algorithm to find suitable path for transmission.
2 Using TCP/IP sockets, write a client-server program to make the client send the file name and
to make the server send back the contents of the requested file if present.
3
Write a program for Hamming code generation for error detection and correction
4
Write a program for congestion control using leaky bucket algorithm.
PART B
(Simulate the following Computer Networks concepts using any network simulators)
1 Simulate a three nodes point — to — point network with duplex links between them. Set the
queue size and vary the bandwidth and find the number of packets dropped
2 Simulate the network with five nodes n0, n1, n2, n3, n4, forming a star topology. The node n4
is at the centre. Node n0 is a TCP source, which transmits packets to node n3 (a TCP sink)
through the node n4. Node n1 is another traffic source, and sends UDP packets to node n2
through n4. The duration of the simulation time is 10 seconds.
3 Simulate to study transmission of packets over Ethernet LAN and determine the number of
packets drop destination.
4 Simulate working of multicasting routing protocol and analyse the throughput of the
network/protocol.
5 Simulate the different types of internet traffic such as FTP and TELNET over a wired network
and analyze the packet drop and packet delivery ratio in the network.
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
Apply the basic concepts of networking and to analyse different parameters such as
bandwidth, delay, throughput of the networks for the given problem.
Apply different techniques to ensure the reliable and secured communication in wired and
wireless communication
Analyse the networking concepts of TCP/IP for wired and wireless components
Simulate network topology with different protocols and analyse the performance using any
simulator
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE)
is 50%. The minimum passing mark for the CIE is 50% of the maximum marks. A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each course.
The student has to secure not less than 40%of maximum marks in the semester-end
examination(SEE). In total of CIE and SEE student has to secure 50% maximum marks of the
course.
Continuous Internal Evaluation (CIE):
CIE marks for the practical course is 50 Marks.
The split-up of CIE marks for record/ journal and test are in the ratio 60:40.
Each experiment to be evaluated for conduction with observation sheet and record write-up.
Rubrics for the evaluation of the journal/write-up for hardware/software experiments designed
by the faculty who is handling the laboratory session and is made known to students at the
beginning of the practical session.
Record should contain all the specified experiments in the syllabus and each experiment write-
up will be evaluated for 10 marks.
Total marks scored by the students are scaled downed to 30 marks (60% of maximum marks).
Weightage to be given for neatness and submission of record/write-up on time.
Department shall conduct 02 tests for 100 marks, the first test shall be conducted after the 8th
week of the semester and the second test shall be conducted after the 14th week of the semester.
In each test, test write-up, conduction of experiment, acceptable result, and procedural
knowledge will carry a weightage of 60% and the rest 40% for viva-voce.
The suitable rubrics can be designed to evaluate each student’s performance and learning ability.
The average of 02 tests is scaled down to 20 marks (40% of the maximum marks).
The Sum of scaled-down marks scored in the report write-up/journal and average marks of two tests
is the total CIE marks scored by the student.
Module-1
C Programming: decision making, control structures and arrays
C Structure, Data Types, Input-Output Statements, Decision making with if statement, simple if
statement, the if..else statement, nesting of if..else statements, the else.if ladder, the switch
statement, the ?: operator, the goto statement, the break statement, programming examples. The
while statement, the do...while statement, the for statement, nested loops, jumps in loops, the
continue statement, programming examples. One dimensional and two dimensional arrays,
declaration and initialization of arrays, reading, writing and manipulation of above types of arrays.
Teaching- Chalk and talk/PPT/case study/web content
Learning
Process
Module-2
Structures
Defining a structure, declaring structure variables, accessing structure members, structure
initialization, copying and comparing structure variables, operations on individual members, array
of structures, structures within structures, structures and functions, Unions, size of structures.
Teaching- Chalk and talk/PPT/case study/web content
Learning
Process
Module-3
Pointers
Pointers in C, Declaring and accessing pointers in C, Pointer arithmetic, Functions , Call by value,
Call by reference, Pointer as function arguments, recursion, Passing arrays to functions, passing
strings to functions, Functions returning pointers, Pointers to functions, Programming Examples
Semester – II
Database Management System
Course Code 22MCA21 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 3-2-0 SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 10-12 Lab
Total Marks 100
slots
Credits 4 Exam Hours 3hr
Course objectives:
Provide a strong foundation in database concepts, technology, and practice.
Practice SQL programming through a variety of database problems.
Demonstrate the use of concurrency and transactions in database.
Design and build database applications for real world problems.
MODULE-1
Introduction: Characteristics of Database approach, Actors on the Scene, Workers behind the scene,
Advantages of using DBMS approach, Data models, schemas and instances, Three -schema
architecture and data independence, Database languages and interfaces, the database system
environment, Centralized and client -server architectures, Classification of Database Management
systems, Entity-Relationship Model: Conceptual Database using high level conceptual data models
for Database Design, A Sample Database Application, Entity types, Entity sets Attributes and Keys
Relationship types, Relationship Sets, Roles and Structural Constraints Weak Entity Types.
Teaching-
Learning Class room Teaching, Active Learning, and Use Digital Portfolios
Process
MODULE-2
Relational Model Relational Model and Relational Algebra: Relational Model Concepts, Relational
Model Constraints and Relational Database Schema Update Operations, Transactions and Dealing
with Constraint violations, Unary Relational operations, Relational Algebra Operations from Set
Theory, Binary Relational Operations, JOIN and DIVISION, Additional Relational Operations,
Examples of Queries in Relational Algebra Relational Database Design Using ER-toRelational
Mapping .
Mapping
Teaching-
Learning Class room Teaching, Active Learning, and Use Digital Portfolios
Process
MODULE-3
Introduction to SQL: Overview of the SQL Query Language, SQL Data Definition, Basic structure
of SQL Queries, Additional Basic Operations, Null values, Aggregate Functions, nested Sub
queries, Modification of the Database, Join Expressions, Views, Transactions, Integrity Constraints,
SQL Data Types and Schemas, Authorization.
Teaching-
Learning Class room Teaching, Active Learning, and Use Digital Portfolios
Process
MODULE-4
Database Design: Informal Design Guidelines for Relation Schemas, Functional Dependencies,
Normal Forms based on Primary Keys, General Definitions of 2nd and 3rd Normal Forms, Boyce
Codd Normal Forms, Stored Procedures and functions, Triggers.
Teaching-
Learning Class room Teaching, Active Learning, and Use Digital Portfolios
Process
MODULE 5
Teaching-
Learning Class room Teaching, Active Learning, and Use Digital Portfolios
Process
The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion
will have a CIE component only. Questions mentioned in the SEE paper shall include questions
from the practical component).
The minimum marks to be secured in CIE to appear for SEE shall be the 15 (50% of
maximum marks-30) in the theory component and 10 (50% of maximum marks -20) in the
practical component. The laboratory component of the IPCC shall be for CIE only. However,
in SEE, the questions from the laboratory component shall be included. The maximum of
04/05 questions to be set from the practical component of IPCC, the total marks of all
questions should not be more than the 20 marks.
SEE will be conducted for 100 marks and students shall secure 40% of the maximum marks to
qualify in the SEE. Marks secured will be scaled down to 50. (Student has to secure an
aggregate of 50% of maximum marks of the course(CIE+SEE)
Suggested Learning Resources:
Books
1. RamezElmasri, Shamkant B. Navathe, Fundamentals of Database Systems ,7th Edition,
Pearson Education, 2017
2. Silberschatz, Korth and Sudharshan Data base System Concepts,6th Edition, Tata McGraw
Hill, 2011.
Web links and Video Lectures (e-Resources):
Module-3
Packages and Interfaces:
Packages, Defining a Package, Finding Packages and CLASSPATH, Access Protection, Importing
Packages.
Interfaces: Interfaces, Defining an Interface, Implementing Interfaces, Nested Interfaces, Applying
Interfaces, Variables in Interfaces, Interfaces Can Be Extended Default Interface Methods, Default
Method Fundamentals, Multiple Inheritance Issues, Use static Methods in an Interface.
Exception Handling: Exception-Handling Fundamentals, Exception Types, Uncaught Exceptions,
Using try and catch, Multiple catch Clauses, Nested try Statements, throw, throws, finally, Java’s
Built-in Exceptions, Creating Your Own Exception Subclasses
2. Address Book
This project is a great option to illustrate your skills in developing applications that can interact with
databases. Your application should keep track of contacts, their details (e.g., address, phone, email),
and notes about each contact in a simple database.
3. Creating a Calculator
Course outcome (Course Skill Set)
Cloud Computing
Course Code : 22MCA23 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 4:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 4 Exam Hours 03
Course Learning objectives: At the end of the course students will be able to
Classify various cloud services and their providers
Differentiate various types of computing environments
Compare various cloud deployment models
Module-1
Introduction ,Cloud Computing at a Glance, The Vision of Cloud Computing, Defining a Cloud, A
Closer Look, Cloud Computing Reference Model, Characteristics and Benefits, Challenges Ahead,
Historical Developments, Distributed Systems, Virtualization, Web 2.0, Service-Oriented Computing,
Utility-Oriented Computing, Building Cloud Computing Environments, Application Development,
Infrastructure and System Development, Computing Platforms and Technologies, Amazon Web
Services (AWS), Google AppEngine, Microsoft Azure, Hadoop, Force.com and Salesforce.com,
Manjrasoft Aneka Virtualization, Introduction, Characteristics of Virtualized, Environments
Taxonomy of Virtualization Techniques, Execution Virtualization, Other Types of Virtualization,
Virtualization and Cloud Computing, Pros and Cons of Virtualization.
Cloud Computing and Service Models, Data-Center Design and Interconnection Networks,
Architectural Design of Compute and Storage Clouds, Public Cloud Platforms: GAE, AWS, and
Azure, Cloud Security and Trust Management
Features of Cloud and Grid Platforms, Programming Support of Google App Engine, Programming
on Amazon AWS and Microsoft Azure, Emerging Cloud Software Environments.
Teaching- Power point presentation, Black board teaching.
Learning
Process
Module-5
Cloud Platforms in Industry, Amazon Web Services, Compute Services, Storage Services,
Communication Services, Additional Services, Google AppEngine, Architecture and Core Concepts,
Application Life-Cycle, Cost Model, Observations, Microsoft Azure, Azure Core Concepts, SQL
Azure, Windows Azure Platform Appliance. Cloud Applications Scientific Applications, Healthcare:
ECG Analysis in the Cloud, Biology: Protein Structure Prediction, Biology: Gene Expression Data
Analysis for Cancer Diagnosis, Geoscience: Satellite Image Processing, Business and Consumer
Applications, CRM and ERP, Productivity, Social Networking, Media Applications, Multiplayer
Online Gaming
https://www.youtube.com/watch?v=RWgW-CgdIk0
https://www.youtube.com/watch?v=-8O32k26RWA
Skill Development Activities Suggested
Cloud service platform expertise
Cloud security
Network management
Development and operations (DevOps)
Course outcome (Course Skill Set)
Cyber Security
Course Code 22MCA251 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 2:0:2 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03 Hours
2 Problem analysis: Identify, formulate, review research literature, and analyze PO2
complex engineering and business problems reaching substantiated
conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
5 Modern tool usage: Create, select, and apply appropriate techniques, PO5
resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations
6 The engineer and society: Apply reasoning informed by the contextual PO6
knowledge to assess societal, health, safety, legal and cultural issues and the
consequent responsibilities relevant to the professional engineering and
business practices.
7 Environment and sustainability: Understand the impact of the professional PO7
engineering solutions in business societal and environmental contexts, and
demonstrate the knowledge of, and need for sustainable development.
8 Ethics: Apply ethical principles and commit to professional ethics and PO8
responsibilities and norms of the engineering and business practices.
12 Life-long learning: Recognize the need for, and have the preparation and PO12
Enterprise Resource Planning
Course Code 22MCA253 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 02:00:02 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10
CO1
CO2
CO3
CO4
CO5
Module-2
Linear programming problem(LPP): Artificial variables-two-phase method, Big M method.
Duality in linear programming, formulation of dual linear programming and examples.
Module-3
Transportation and Assignment Problems: Mathematical model of transportation problem,
methods of finding initial solution (Northwest corner rule, Least cost method, Vogel’s approximation
method), test for optimality in TP using MODI Method. Mathematical model of assignment problem,
Hungarian method for solving assignment problem.
Introduction to operation Research, Hiller and Liberman, Mc GRawHill , 5th edition ,2001.
Operation Research, Prem Kumar Gupta, D S Heera, S Chand Pub., New Delhi, 2007.
Module-1
INTRODUCTION TO Al AND PRODUCTION SYSTEMS: Introduction to AI- Problem
Definition and formulation -Production systems, Control strategies, Search strategies. Problem
characteristics, Production system characteristics - Specialized productions system- Problem solving
methods – Problem graphs, Matching, Indexing and Heuristic functions -Hill Climbing-Depth first
and Breath first, Measure of performance and analysis of search algorithms.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-2
REPRESENTATION OF KNOWLEDGE: Introduction to Game playing – Knowledge
representation, Knowledge representation using Predicate logic, Introduction to predicate calculus,
Resolution, Use of predicate calculus, Knowledge representation using other logic-Structured
representation ofChalk
Teaching- and talk method / PowerPoint Presentation
knowledge.
Learning
Process
Module-3
KNOWLEDGE INFERENCE: Knowledge representation -Production based system, Frame based
system. Inference – Backward chaining, Forward chaining, Rule value approach, Fuzzy reasoning –
Certainty factors, Bayesian Theory-Bayesian Network-Dempster
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-4
PLANNING AND MACHINE LEARNING: Basic plan generation systems – Strips -Advanced
plan generation systems – K strips -Strategic explanations -Why, Why not and how
explanations. Learning- Machine learning, adaptive Learning.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-5
EXPERT SYSTEMS Introduction to Expert systems – Architecture of expert systems, Roles of
expert systems – Knowledge Acquisition – Meta knowledge, Heuristics. Typical expert systems –
MYCIN, DART, XOON, Expert systems shells.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Assessment Details (both CIE and SEE)
Skill
. Development Activities Suggested
The students with the help of the course teacher can take up technical –activities which will
enhance their skill or the students should interact with industry (small, medium and large),
understand their problems or foresee what can be undertaken for study in the form of
research/testing/projects, and for creative and innovative methods to solve the identified
Courseproblem.
outcomeThe prepared
(Course Skillreport
Set) shall be evaluated for CIE marks.
5 Modern tool usage: Create, select, and apply appropriate techniques, PO5
resources, and modern engineering and IT tools including prediction and
modeling to complex engineering activities with an understanding of the
limitations
6 The engineer and society: Apply reasoning informed by the contextual PO6
knowledge to assess societal, health, safety, legal and cultural issues and
the consequent responsibilities relevant to the professional engineering and
business practices.
7 Environment and sustainability: Understand the impact of the professional PO7
engineering solutions in business societal and environmental contexts, and
demonstrate the knowledge of, and need for sustainable development.
8 Ethics: Apply ethical principles and commit to professional ethics and PO8
responsibilities and norms of the engineering and business practices.
Module-1
Rich Internet Applications With Ajax: Limitations of Classic Web application model, AJAX
principles, Technologies behind AJAX, Examples of usage of AJAX; Asynchronous
communication and AJAX application model.
Ajax with XMLHTTP object: Part 1 Creating Ajax Applications: An example, Analysis of
example ajax.html, Creating the JavaScript, Creating and opening the XMLHttpRequest object,
Data download, Displaying the fetched data, Connecting to the server, Adding Server-side
programming, Sending data to the server using GET and POST
Teaching-Learning Power Point, Lecture, BlackBoard teaching, Implementation demo
Process
Module-2
Ajax with XMLHTTP object: Part 2 Handling multiple XMLHttpRequest objects in the same
page, Using two XMLHttpRequest objects, Using an array of XMLHttpRequest objects, AJAX
Patterns – Predictive Fetch, Multi-stage download, Periodic Refresh and Fallback patterns,
Submission throttling.
Teaching-Learning Power Point, Lecture, Black Board teaching, Implementation
Process demo
Module-3
Introduction to Bootstrap: What Is Bootstrap? Bootstrap File Structure, Basic HTML Template,
Global Styles, Default Grid System, Basic Grid HTML, Offsetting Columns, Nesting Columns,
Fluid Grid System, Container Layouts, Responsive Design. Typography, Emphasis Classes, Lists,
Code, Tables, Optional Table Classes, Table RowClasses, Forms, Buttons, Images, Icons.
Teaching-Learning Power Point, Lecture, Black Board teaching, Implementation
Process demo
Module-4
Introduction to JQuery: Introduction to JQuery, Syntax, selectors, events, JQuery HTML, JQuery
Effects, JQuery CSS,jQuery Effects,jQuery Traversing,jQuery AJAX.
Teaching-Learning Power Point, Lecture, Black Board teaching, Implementation
Process demo
Module-5
Introduction to React and UI Design: . Welcome to React, Your first React Web Application
:Setting up your development environment , What’s a component? , Making Product data-driven ,
Refactoring with the Babel plugin transform-class-properties .
Advanced Component Configuration with props, state, and children : Components , Context , state ,
Stateless Components , Talking to Children Components with props.children .
N-Grams: Counting Words in Corpora, Simple N-Grams, Smoothing, Back off, Deleted Interpolation, N-
Grams for Spelling and Pronunciation, Entropy, Summary. Word Classes and Part-of- Speech Tagging:
English Word Classes, Tag sets for English, Part-of-Speech Tagging.
2009.
Reference Books:
1. Christopher D.Manning and HinrichSchutze, ―Foundations of Statistical Natural
LanguageProcessing‖, MIT Press, 1999.
2.TanveerSiddiqui, U.S. Tiwary, ―Natural Language Processing and Information Retrieval‖, Oxford
University Press, 2008.
3.Anne Kao and Stephen R. Poteet (Eds), ―Natural Language Processing and Text Mining‖, Springer
Verlag London Limited 2007.
Web links and Video Lectures (e-Resources):
PO
CO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 2 - - - - 1 1 1 1 1 1 -
CO2 1 2 - - - 1 1 1 1 1 1 -
CO3 1 1 3 1 1 1 - 2 1 1 1 -
CO4 1 1 3 1 1 1 - 2 1 1 1 -
CO5 1 1 3 1 1 1 - 2 1 1 1 -