MA4151 APPLIED PROBABILITY AND STATISTICS FOR L T P C

COMPUTER SCIENCE ENGINEERS 3 1 0 4

COURSE OBJECTIVES:
To encourage students to develop a working knowledge of the central ideas of Linear
Algebra.
To enable students to understand the concepts of Probability and Random Variables.
To understand the basic probability concepts with respect to two dimensional random
variables along with the relationship between the random variables and the significance of
the central limit theorem.
To apply the small / large sample tests through Tests of hypothesis.
To enable the students to use the concepts of multivariate normal distribution and principal
components analysis.

UNIT I LINEAR ALGEBRA 12

Vector spaces norms Inner Products Eigenvalues using QR transformations QR
factorization generalized eigenvectors Canonical forms singular value decomposition and
applications pseudo inverse least square approximations.

UNIT II PROBABILITY AND RANDOM VARIABLES 12

Probability Axioms of probability Conditional probability Bayes theorem Random variables
Probability function Moments Moment generating functions and their properties Binomial,
Poisson , Geometric, Uniform, Exponential, Gamma and Normal distributions Function of a
random variable.

UNIT III TWO DIMENSIONAL RANDOM VARIABLES 12

Joint distributions Marginal and conditional distributions Functions of two dimensional random
variables Regression curve Correlation.

UNIT IV TESTING OF HYPOTHESIS 12

Sampling distributions Type I and Type II errors Small and Large samples Tests based on
Normal, t, Chi square and F distributions for testing of mean , variance and proportions Tests for
independence of attributes and goodness of fit.

UNIT V MULTIVARIATE ANALYSIS 12

Random vectors and matrices Mean vectors and covariance matrices Multivariate normal
density and its properties Principal components Population principal components Principal
components from standardized variables.
TOTAL : 60 PERIODS
COURSE OUTCOMES:
At the end of the course, students will be able to
apply the concepts of Linear Algebra to solve practical problems.
use the ideas of probability and random variables in solving engineering problems.
be familiar with some of the commonly encountered two dimension random variables and be
equipped for a possible extension to multivariate analysis.
use statistical tests in testing hypothesis on data.
develop critical thinking based on empirical evidence and the scientific approach to
knowledge development.

8
REFERENCES:
1.
press, Singapore, 1998.
2.
Pearson Education, Fifth Edition, 6th Edition, New Delhi, 2013.
3.
New York, 2011.
4.
Press, Boston, 2014.
5.
Pearson India Education, Asia, 9th Edition, New Delhi, 2017.

RM4151 RESEARCH METHODOLOGY AND IPR L T P C

2 0 0 2
UNIT I RESEARCH DESIGN 6
Overview of research process and design, Use of Secondary and exploratory data to answer the
research question, Qualitative research, Observation studies, Experiments and Surveys.

UNIT II DATA COLLECTION AND SOURCES 6

Measurements, Measurement Scales, Questionnaires and Instruments, Sampling and methods.
Data - Preparing, Exploring, examining and displaying.

UNIT III DATA ANALYSIS AND REPORTING 6

Overview of Multivariate analysis, Hypotheses testing and Measures of Association. Presenting
Insights and findings using written reports and oral presentation.

UNIT IV INTELLECTUAL PROPERTY RIGHTS 6

Intellectual Property The concept of IPR, Evolution and development of concept of IPR, IPR
development process, Trade secrets, utility Models, IPR & Biodiversity, Role of WIPO and WTO in
IPR establishments, Right of Property, Common rules of IPR practices, Types and Features of IPR
Agreement, Trademark, Functions of UNESCO in IPR maintenance.

UNIT V PATENTS 6
Patents objectives and benefits of patent, Concept, features of patent, Inventive step,
Specification, Types of patent application, process E-filling, Examination of patent, Grant of patent,
Revocation, Equitable Assignments, Licences, Licensing of related patents, patent agents,
Registration of patent agents.
TOTAL: 30 PERIODS
REFERENCES:
1.
Tata McGraw Hill Education, 11e (2012).
2.
preneur Press, 2007.
3. David Hunt, Long Nguyen, Matthew Rodgers,
Wiley, 2007.
4. The Institute of Company Secretaries of India, Statutory body under an Act of parliament,

9
MC4101 ADVANCED DATA STRUCTURES AND ALGORITHMS LTPC
3 003
COURSE OBJECTIVES:
To understand the usage of algorithms in computing
To learn and use hierarchical data structures and its operations
To learn the usage of graphs and its applications
To select and design data structures and algorithms that is appropriate for problems
To study about NP Completeness of problems.

UNIT I ROLE OF ALGORITHMS IN COMPUTING & COMPLEXITY ANALYSIS 9

Algorithms Algorithms as a Technology -Time and Space complexity of algorithms- Asymptotic
analysis-Average and worst-case analysis-Asymptotic notation-Importance of efficient algorithms-
Program performance measurement - Recurrences: The Substitution Method The Recursion-
Tree Method- Data structures and algorithms.

UNIT II HIERARCHICAL DATA STRUCTURES 9

Binary Search Trees: Basics Querying a Binary search tree Insertion and Deletion- Red Black
trees: Properties of Red-Black Trees Rotations Insertion Deletion -B-Trees: Definition of B -
trees Basic operations on B-Trees Deleting a key from a B-Tree- Heap Heap
Implementation Disjoint Sets - Fibonacci Heaps: structure Mergeable-heap operations-
Decreasing a key and deleting a node-Bounding the maximum degree.

UNIT III GRAPHS 9

Elementary Graph Algorithms: Representations of Graphs Breadth-First Search Depth-First
Search Topological Sort Strongly Connected Components- Minimum Spanning Trees:
Growing a Minimum Spanning Tree Kruskal and Prim- Single-Source Shortest Paths: The
Bellman-Ford algorithm Single-Source Shortest paths in Directed Acyclic Graphs
Algorithm; Dynamic Programming - All-Pairs Shortest Paths: Shortest Paths and Matrix
Multiplication The Floyd-Warshall Algorithm

UNIT IV ALGORITHM DESIGN TECHNIQUES 9

Dynamic Programming: Matrix-Chain Multiplication Elements of Dynamic Programming
Longest Common Subsequence- Greedy Algorithms: Elements of the Greedy Strategy- An
Activity-Selection Problem - Huffman Coding.

UNIT V NP COMPLETE AND NP HARD 9

NP-Completeness: Polynomial Time Polynomial-Time Verification NP- Completeness and
Reducibility NP-Completeness Proofs NP-Complete Problems.
TOTAL : 45 PERIODS

SUGGESTED ACTIVITIES:
1. Write an algorithm for Towers of Hanoi problem using recursion and analyze the complexity
(No of disc-4)
2. Write any one real time application of hierarchical data structure
3. Write a program to implement Make_Set, Find_Set and Union functions for Disjoint Set
Data Structure for a given undirected graph G(V,E) using the linked list representation with
simple implementation of Union operation
4. Find the minimum cost to reach last cell of the matrix from its first cell

10
 5. Discuss about any NP completeness problem

COURSE OUTCOMES:
CO1:Design data structures and algorithms to solve computing problems.
CO2:Choose and implement efficient data structures and apply them to solve problems.
CO3:Design algorithms using graph structure and various string-matching algorithms to solve
real-life problems.
CO4:
CO5: Apply suitable design strategy for problem solving.

REFERENCES
1.
2.
2013.
3. T.H. Cormen, C.E.Leiserson, R.L. Rivest and C.Stein, "Introduction to Algorithms", Prentice
Hall of India, 3rd Edition, 2012.
4.
3rd Edition, 2009.
5.
University Press, 2nd Edition, 2008.
6.
Pearson Education, Reprint 2006.

MC4102 OBJECT ORIENTED SOFTWARE ENGINEERING L T P C

3 0 0 3

COURSE OBJECTIVES:
To understand the phases in object oriented software development
To gain fundamental concepts of requirements engineering and analysis.
To know about the different approach for object oriented design and its methods
To learn about how to perform object oriented testing and how to maintain software
To provide various quality metrics and to ensure risk management.

UNIT I SOFTWARE DEVELOPMENT AND PROCESS MODELS 9

Introduction to Software Development Challenges An Engineering Perspective Object
Orientation Software Development Process Iterative Development Process Process Models
Life Cycle Models Unified Process Iterative and Incremental Agile Processes.

UNIT II MODELING OO SYSTEMS 9

Object Oriented Analysis (OOA / Coad-Yourdon), Object Oriented Design (OOD/Booch),
Hierarchical Object Oriented Design (HOOD), Object Modeling Technique (OMT) Requirement
Elicitation Use Cases SRS Document OOA - Identification of Classes and Relationships,
Identifying State and Behavior OOD - Interaction Diagrams Sequence Diagram
Collaboration Diagrams - Unified Modeling Language and Tools.

UNIT III DESIGN PATTERNS 9

Design Principles Design Patterns GRASP GoF Dynamic Object Modeling Static Object

11
Modeling.

UNIT IV SYSTEM TESTING 9

Software testing: Software Verification Techniques Object Oriented Checklist :- Functional
Testing Structural Testing Class Testing Mutation Testing Levels of Testing Static and
Dynamic Testing Tools - Software Maintenance Categories Challenges of Software
Maintenance Maintenance of Object Oriented Software Regression Testing

UNIT V SOFTWARE QUALITY AND METRICS 9

Need of Object Oriented Software Estimation Lorenz and Kidd Estimation Use Case Points
Method Class Point Method Object Oriented Function Point Risk Management Software
Quality Models Analyzing the Metric Data Metrics for Measuring Size and Structure
Measuring Software Quality - Object Oriented Metrics

SUGGESTED ACTIVITIES:
1. Discuss the different phases in any domain like Health Monitoring System using extreme
programming
2. Describe Business Requirement Specification (BRS) and SRS (Software Requirement
Specification) for any Project like Automatic Intelligent Plant Watering System .using any
one of requirement analysis tool
3. Identify the classes , relationship between classes and draw standard UML diagrams using
any one UML modeling tool (eg: ArgoUML that supports UML 1.4 and higher)
4. for a system (eg: Conference Management System, student management system)
5. Test the above UML for all the scenarios identified using Selenium /JUnit / Apache JMeter
6. Perform COCOMO estimation for Book Management System to find effort and development
time considering all necessary cost estimation factors. (Use GanttPRO Software for
estimation)

COURSE OUTCOMES:
On completion of the course the student would be able to :
CO1: Design object oriented software using appropriate process models.
CO2: Differentiate software processes under waterfall and agile methodology.
CO3: Design and Develop UML diagrams for software projects.
CO4: Apply Design Patterns for a software process.
CO5: Categorize testing methods and compare different testing tools for software processes.
CO6: Analyze object oriented metrics and quality for software engineering processes.

TOTAL: 45 PERIODS

REFERENCES:
1. Yogesh Singh, PHI Learning
Private Limited ,First edition,2012
2.
Software Engineering, A Use
Impression, 2009
3. -Oriented Analysis and

4. Grady Booch, Robert A. Maksimchuk, Michael W. Engle, Bobbi J. Young, Jim Conallen,

12
 Kelli A. Houston,
Pearson Education,2010
5. McGraw-Hill
th
Education, 8 Edition, 2015

MC4103 PYTHON PROGRAMMING LT PC

3 0 03
COURSE OBJECTIVES:
To develop Python programs with conditionals, loops and functions.
To use Python data structures lists, tuples, dictionaries.
To do input/output with files in Python
To use modules, packages and frameworks in python
To define a class with attributes and methods in python

UNIT I BASICS OF PYTHON 9

Introduction to Python Programming Python Interpreter and Interactive Mode Variables and
Identifiers Arithmetic Operators Values and Types Statements. Operators Boolean Values
Operator Precedence Expression Conditionals: If-Else Constructs Loop
Structures/Iterative Statements While Loop For Loop Break Statement-Continue statement
Function Call and Returning Values Parameter Passing Local and Global Scope Recursive
Functions

UNIT II DATA TYPES IN PYTHON 9

Lists, Tuples, Sets, Strings, Dictionary, Modules: Module Loading and Execution Packages
Making Your Own Module The Python Standard Libraries.

UNIT III FILE HANDLING AND EXCEPTION HANDLING 8

Files: Introduction File Path Opening and Closing Files Reading and Writing Files File
Position Exception: Errors and Exceptions, Exception Handling, Multiple Exceptions

UNIT IV MODULES, PACKAGES AND FRAMEWORKS 10

Modules: Introduction Module Loading and Execution Packages Making Your Own Module
The Python Libraries for data processing, data mining and visualization- NUMPY, Pandas,
Matplotlib, Plotly-Frameworks- -Django, Flask, Web2Py

UNIT V OBJECT ORIENTED PROGRAMMING IN PYTHON 9

Creating a Class, Class methods, Class Inheritance, Encapsulation, Polymorphism, class method
vs. static methods, Python object persistence.

SUGGESTED ACTIVITIES:
1. Display a multiplication Table Both players are given the same string, S ; Both players
have to make substrings using the letters of the string S.
2. Player A has to make words starting with consonants. Player B has to make words starting
with vowels. The game ends when both players have made all possible substrings. Do
Scoring
3. Write a function definition for JTOI() in Python that would display the corrected version of
entire content of the file .TXT (has wrongly alphabet J in place of alphabet I ) with all the
alphabets "J" to be displayed as an alphabet "I" on screen.
4. Consider a CSV file of profit of 10 items in monthly sales of a year . Read this file using

13
 Pandas or NumPy or using the in-built matplotlib function. Perform the following task.

5. Read Total profit of all months and show it using a line plot
Read all product sales data and show it using a multi-line plot
Read each item sales data of each month and show it using a scatter plot
Read each item product sales data and show it using the bar chart
Read sales data of bathing soap of all months and show it using a bar chart.
Calculate total sale data an year for each product and show it using a Pie chart
6. Create a Python class called Bank Account which represents a bank account, having as
attributes: account Number (numeric type), name (name of the account owner as string
type), balance. Create a constructor with parameters: account Number, name, balance.
Create a Deposit() method which manages the deposit actions. Create a Withdrawal()
method which manages withdrawals actions

COURSE OUTCOMES:
On completion of the course the student would be able to :
CO1: Develop algorithmic solutions to simple computational problems
CO2: Represent compound data using Python lists, tuples and dictionaries.
CO3: Read and write data from/to files in Python Programs
CO4: Structure simple Python programs using libraries, modules etc.
CO5: Structure a program by bundling related properties and behaviors into individual objects.

TOTAL : 45 PERIODS
REFERENCES
1.
Press, First edition, 2017
2.

3. Revised and Updated for

Python 3.2, Network Theory Ltd., First edition, 2011
4. John V
Expanded Edition, MIT Press, 2013
5.
Edition, 2016

MC4104 FUNDAMENTALS OF ACCOUNTING L T PC

3 02 4
COURSE OBJECTIVES:
To understand the basic principles of Accounting
To understand the Double entry system and the preparation of ledger.
To understand the process and importance of the electronic accounting system.
To Prepare the estimate for various business activities such as purchase, sale,
production and cash budgets
To ensure the decision making process of an organization.

14
UNIT I INTRODUCTION TO ACCOUNTING 15
Introduction to Financial, Cost and Management Accounting - Objectives of Financial Accounting
Accounting Principles, Concepts and Conventions Bookkeeping and Accounting
Practical exercise session using Tally:
1. Company Creation, Creating Groups
2. Creation of Ledgers and Vouchers

UNIT II MANAGEMENT ACCOUNTING AND BOOKKEEPING 15

Meaning-Objectives of Management Accounting-Accounting System Preparation of Journal,
Ledger, Cash Book and Trial Balance Errors disclosed and not disclosed by Trial Balance Final
Accounts - Ratio Analysis
Practical exercise session using Tally.:
1. Creating Contra, Journals, Credit and Debit Notes
2. Preparing Trial Balance and Final Accounts

UNIT III BUDGETS AND BUDGETARY CONTROL 15

Budgets and Budgetary Control-Meaning-Types-Sales Budget-Production Budget-Cost of
Production Budget-Flexible Budgeting-Cash Budget-Master Budget-Zero Base Budgeting-
Computerized Accounting with adjustments
Practical sessions using Advanced tools in MS-Excel:
1. Preparing Revenue Management and Portfolio Selection
2. Preparing Final Accounts with Adjustments

UNIT IV FINANCIAL MANAGEMENT 15

Objectives of Financial Management- preparation of Suspense Account Depreciation Meaning
and Types Methods of Charging and Providing depreciation Inventory
Practical exercise session using Tally.:
1. Preparing Inventory Creation, Purchase order, Sales Order
2. Preparing Sales Journal, Rejections, Delivery Note.

UNIT V BANK RECONCILIATION STATEMENT AND REPORTING 15

Preparing Bank Reconciliation Statement (simple problems) Insurance Claim Average Clause -
Export and Import of Data, Data Security,
Practical exercise session using Tally.:
1. Preparing the Bank Reconciliation Statement
2. Preparing the Trading, Profit And Loss Account and Trial Balance

TOTAL : 75 PERIODS
COURSE OUTCOMES:
On completion of the course the student would be able to :
CO1. Able to understand the basic concepts of Accounting standards.
CO2. Able to understand the process of maintaining Accounts in an organization
CO3. Helps to understand and calculating the financial position of an organization
CO4. Helps to understand Financial Management concepts and its components
CO5. It helps to understand the importance of BRS and generation of various financial reports

15
REFERENCES:
1.
edition,2010
th
2. Edition, 2009.
3. Tata
th
McGraw Hill, 5 Edition, 2008.
4. Reddy and Murthy, Financial Accounting by Margham Publications, 2015,Chennai
rd
5. Edition, 2009
6. Advanced Accounting, R.L.Gupta and P.K.Gupta, Advanced Accounting, Sultan Chand, New
Delhi.

MC4111 ADVANCED DATA STRUCTURES AND ALGORITHMS LT PC

LABORATORY 0 04 2
COURSE OBJECTIVES:
To acquire the knowledge of using advanced tree structures
To learn the usage of heap structures
To understand the usage of graph structures and spanning trees
To understand the problems such as matrix chain multiplication, activity selection and
Huffman coding
To understand the necessary mathematical abstraction to solve problems.

LIST OF EXPERIMENTS:
1: Implementation of recursive function for tree traversal and Fibonacci
2: Implementation of iteration function for tree traversal and Fibonacci
3: Implementation of Merge Sort and Quick Sort
4: Implementation of a Binary Search Tree
5: Red-Black Tree Implementation
6: Heap Implementation
7: Fibonacci Heap Implementation
8: Graph Traversals
9: Spanning Tree Implementation
10: Shortest Path Algorithms (Dijkstra's algorithm, Bellman Ford Algorithm)
11: Implementation of Matrix Chain Multiplication
12: Activity Selection and Huffman Coding Implementation

HARDWARE/SOFTWARE REQUIREMENTS
1: 64-bit Open source Linux or its derivative
2: Open Source C++ Programming tool like G++/GCC
TOTAL : 60 PERIODS
COURSE OUTCOMES:
CO1: Design and implement basic and advanced data structures extensively
CO2: Design algorithms using graph structures
CO3: Design and develop efficient algorithms with minimum complexity using design techniques
CO4: Develop programs using various algorithms.
CO5: Choose appropriate data structures and algorithms, understand the ADT/libraries, and use

16
 it to design algorithms for a specific problem.

REFERENCES:
1. 3rd
Edition, 2014.
2.
Education, Reprint 2006.
3. http://www.coursera.org/specializations/data-structures-algorithms
4. http://www.tutorialspoint.com/data_structures_algorithms
5. http://www.geeksforgeeks.org/data-structures/

LTPC
MC4112 PYTHON PROGRAMMING LABORATORY
0 042
COURSE OBJECTIVES:
Develop Python programs with conditionals, loops and functions
Represent compound data using Python lists, tuples, dictionaries
Read and write data from/to files in Python
Implement NumPy, Pandas, Matplotlib libraries
Implement object oriented concepts

LIST OF EXPERIMENTS:
Note: The examples suggested in each experiment are only indicative. The lab instructor is expected to
design other problems on similar lines.
1. Python programming using simple statements and expressions (exchange the values of two
variables, circulate the values of n variables, distance between two points).
2. Scientific problems using Conditionals and Iterative loops.
3. Linear search and Binary search
4. Selection sort, Insertion sort
5. Merge sort, Quick Sort
6. Implementing applications using Lists, Tuples.
7. Implementing applications using Sets, Dictionaries.
8. Implementing programs using Functions.
9. Implementing programs using Strings.
10. Implementing programs using written modules and Python Standard Libraries (pandas, numpy,
Matplotlib, scipy)
11. Implementing real-time/technical applications using File handling.
12. Implementing real-time/technical applications using Exception handling.
13. Creating and Instantiating classes

HARDWARE/SOFTWARE REQUIREMENTS

2: Disk space: 1GB.

3: Operating systems: Windows 7,macOS and Linux
4: Python versions:2.7, 3.6, 3.8
TOTAL : 60 PERIODS

17
COURSE OUTCOMES:
On completion of the laboratory course, the student should be able to
CO1: Apply the Python language syntax including control statements, loops and functions to solve a
wide variety of problems in mathematics and science.
CO2: Use the core data structures like lists, dictionaries, tuples and sets in Python to store, process and
sort the data
CO3: Create files and perform read and write operations
CO4: Illustrate the application of python libraries.
CO5: Handle exceptions and create classes and objects for any real time applications

REFERENCES:
1.

2. ing Python: Powerful Object-Oriented Programming; Fifth edition, 2013.

3. -Wesley Professional; Fourth edition,
2009.
4.
5. http://www.edx.org/

MC4113 COMMUNICATION SKILLS ENHANCEMENT I L T P C

0 0 2 1

COURSE OBJECTIVES:
To provide opportunities to learners to practice English and thereby make them proficient users
of the language.
To enable learners to fine-tune their linguistic skills (LSRW) with the help of technology.

thereby enhance their career opportunities.

LIST OF ACTIVITIES:
1. Listening:
Listening and practicing neutral accents
Listening to short talks and lectures and completing listening comprehension exercises
Listening to TED Talks

2. Speaking:
Giving one minute talks
Participating in small Group Discussions
Making Presentations

3. Reading:
Reading Comprehension
Reading subject specific material
Technical Vocabulary

4. Writing:
Formal vs Informal Writing

18
 Paragraph Writing
Essay Writing
Email Writing

REFERENCES / MANUALS / SOFTWARE: Open Sources / websites

TOTAL: 30 PERIODS
COURSE OUTCOMES:
On completion of the course, the students will be able to:
Listen and comprehend lectures in English
Articulate well and give presentations clearly
Participate in Group Discussions successfully
Communicate effectively in formal and informal writing
Write proficient essays and emails

MC4201 FULL STACK WEB DEVELOPMENT L T PC

3 0 0 3
COURSE OBJECTIVES:
To understand the fundamentals of web programming and client side scripting.
To learn server side development using NodeJS.
To understand API development with Express Framework.
To understand and architect databases using NoSQL and SQL databases.
To learn the advanced client side scripting and ReactJS framework
UNIT I INTRODUCTION TO CSS and JAVASCRIPT 9
Introduction to Web: Server - Client - Communication Protocol (HTTP) Structure of HTML
Documents Basic Markup tags Working with Text and Images with CSS CSS Selectors CSS
Flexbox - JavaScript: Data Types and Variables - Functions - Events AJAX: GET and POST
UNIT II SERVER SIDE PROGRAMMING WITH NODE JS 9
Introduction to Web Servers Javascript in the Desktop with NodeJS NPM Serving files with the
http module Introduction to the Express framework Server-side rendering with Templating
Engines Static Files - async/await - Fetching JSON from Express

UNIT III ADVANCED NODE JS AND DATABASE 9

Introduction to NoSQL databases MongoDB system overview - Basic querying with MongoDB
shell Request body parsing in Express NodeJS MongoDB connection Adding and retrieving
data to MongoDB from NodeJS Handling SQL databases from NodeJS Handling Cookies in
NodeJS Handling User Authentication with NodeJS

9
UNIT IV ADVANCED CLIENT SIDE PROGRAMMING
React JS: ReactDOM - JSX - Components - Properties Fetch API - State and Lifecycle - -JS
Localstorage - Events - Lifting State Up - Composition and Inheritance

UNIT V APP IMPLEMENTATION IN CLOUD 9

Cloud providers Overview Virtual Private Cloud Scaling (Horizontal and Vertical) Virtual
Machines, Ethernet and Switches Docker Container Kubernetes

19