Institute of Engineering & Management, Kolkata Department

Institute of Engineering & Management,

Kolkata Department of Computer Science

MSc(CS)

Proposed Syllabus 2019-2021 Session

Detailed Course Structure

Semester - I

A. THEORY

SL.

NO.

CODE THEORY CONTACTS

PERIODS/WEEK

CREDITS

L T P TOTAL

1 MCS101 Principles of Programming Languages 4 1 - 5 4

2 MCS102 Advanced DBMS 4 1 - 5 4

3 MCS103 Information Systems & Software

Engineering

4 1 - 5 4

4 MCS104 Discrete Mathematics & Numerical

Methods

4 1 - 5 4

5 MCS105 Corporate Culture & Communication 3 0 - 3 3

Total of Theory 23 19

B. PRACTICAL

6 MCS191 Programming Lab (C ) - - 3 3 2

7 MCS192 Advanced DBMS Lab - - 3 3 2

Total of Practical

6 4

Total of Semester 29 23

Semester - II

A. THEORY

SL.

NO.

CODE THEORY CONTACTS PERIODS/WEEK CREDITS

L T P TOTAL

1 MCS201 Object Oriented Analysis &

Design

4 1 - 5 4

2 MCS202 Data Structure and Analysis of

Algorithm

4 1 - 5 4

3 MCS203 Advanced Computer

Architecture

4 1 - 5 4

4 MCS204 Data Communication &

Networking

4 1 - 5 4


B. PRACTICAL

5 MCS291 Object Oriented Programming

Lab (using Java)

- - 4 4 2

6 MCS292 Data Structure Lab - - 4 4 2

7 MCS293 Microprocessor and

VHDL/Verilog Lab

- - 4 4 3

Total of Practical 12 7

C. SESSIONAL

8 MCS294 Statistics using R 2 1 - 3 2

9 MCS(GS)201 Essential Studies for

Professionals II

1 - - 1 0.5

Total of Sessional 4 2.5

Total of Semester 36 25.5

Semester – III

A. THEORY

SL. NO. CODE THEORY CONTACTS

PERIODS/WEEK

CREDITS

L T P TOTAL

1 MCS301 Operation Research 4 1 - 5 4

2 MCS302 Advanced Operating System 4 1 - 5 4

3 MCS303 Artificial Intelligence 4 1 - 5 4

4 MCSE301

A/B/C

Elective – 1 4 1 - 5 4


B. PRACTICAL

5 MCS391 Operation Research Lab - - 3 3 2

6 MCS392 Operating System (Unix) Lab - - 3 3 2

7 MCS393 Seminar - - 3 3 2

8 MCS394 Industrial Training - - - - 4


C. MOOCS

9 MOOCs(MSC)-

321

MOOCs I - 2 - - 2

10 MOOCs(MSC)-

322

MOOCs II - 2 - - 2

Total of MOOCS 4 4

11 MAR381 Mandatory Additional Requirements (MAR)


Elective Set Course Code Topic

1 MCS E301A Embedded Systems

MCS E301B Image Processing

MCS E301C Automata & Natural Language Processing

Semester - IV

A. THEORY

SL.

NO


PERIODS/WEEK

CREDITS

L T P TOTAL

1 MCSE401 A/B/C Elective – 2 3 1 0 4 4


Total of Theory 8 8

B. PRACTICAL

3 MCS491 Dissertation 0 0 13 13 6

4 MCS492 A/B/C Elective – 3 Lab 0 0 3 3 2

5 MCS493 Viva Voce 0 0 0 0 4


Total of MOOCS

6 MOOCs (MCS)-421 MOOCs III 3 1 - 4 5

7 MOOCs (MSC)-422 MOOCs IV 3 1 - 4 5

Total MOOCS 8 10



Elective Practical Lab for Semester IV


1 MCS 492A Data Warehousing & Mining Lab

MCS 492B Soft Computing Lab

MCS 492C Social Network Analysis Lab

Elective Theory Papers for Semesters III & IV


2 MCS E401A Cloud Computing

MCS E401B Mobile Computing

MCS E401C Network Security

3 MCS E402A Data Warehousing & Mining

MCS E402B Soft Computing

MCS E402C Social Network Analysis

1. Semester - I

A. THEORY

SL.

NO.


PERIODS/WEEK

CREDITS

L T P TOTAL

1 MCS101 Principles of Programming Languages 4 1 - 5 4

2 MCS102 Advanced DBMS 4 1 - 5 4

3 MCS103 Information Systems & Software

Engineering

4 1 - 5 4

4 MCS104 Discrete Mathematics & Numerical

Methods

4 1 - 5 4

5 MCS105 Corporate Culture & Communication 3 0 - 3 3

Total of Theory

23 19

B. PRACTICAL

6 MCS191 Programming Lab (C ) - - 3 3 2

7 MCS192 Advanced DBMS Lab - - 3 3 2



Principles of Programming Languages (MCS101)

Concepts of programming languages, Programming domains, Language Evaluation Criteria, influences on

Language design, Language categories, Programming Paradigms

– Imperative, Object Oriented, functional Programming , Logic Programming. Programming Language

Implementation – Compilation and Virtual Machines, programming environments.

Syntax and Semantics: general Problem of describing Syntax and Semantics, formal methods of describing

syntax - BNF, EBNF for common programming languages features, parse trees, ambiguous grammars,

attribute grammars, denotational semantics and axiomatic semantics for common programming language

features.

Data types: Introduction, primitive, character, user defined, array, union, pointer and reference types, structure,

design and implementation uses related to these types. Names, Variable, concept of binding, type checking,

strong typing, type compatibility, named constants, variable initialization.

Expressions and Statements: Arithmetic relational and Boolean expressions, Short circuit evaluation mixed

mode assignment, Assignment Statements, Control Structures

– Statement Level, Compound Statements, Selection, Iteration, Unconditional Statements, guarded commands.

Subprograms and Blocks: Fundamentals of sub-programs, Scope and lifetime of variable, static and dynamic

scope, Design issues of subprograms and operations, local referencing environments, parameter passing

methods, overloaded sub-programs, generic sub-programs, parameters that are sub-program names, design

issues for functions user defined overloaded operators, co routines.

Introduction and overview of logic programming, basic elements of prolog, application of logic programming,

Introduction, fundamentals of FPL, LISP.

Text Books:

1. Programming Languages –Louden, Second Edition, Thomson

2. LISP Patrick Henry Winston and Paul Horn Pearson Education.

3. Programming in PROLOG Clocksin, Springer

4. Programming With C, Gottfried, TMH

5. C Programming Essentials – Kashi Nath Dey and Samir K Bandyopadhyay, Pearson Education

Advanced DBMS (MCS102)

Overview of Database Management, Conceptual Database Design, Logical Database Design,

Physical Database Design

Introduction to Relational Database : Relation, Optimization, The Catalog, Base Relvars and Views,

Transactions, The Suppliers and Parts Database.

Relational Model Concepts, Relational Model, Constraining, Referential Integrity Constraints, Defining

Referential Integrity Constraints, Update Operations on Relations, Structured Query Language (SQL), Data

Definition Language Commands, Data Manipulation Language Commands, Transaction Control Commands,

SQL Command Syntax and Usage, The Basic Query Block, Querying Data with Multiple Conditions, Basic

Relational Algebra Operations, The Select Operation, Additional Relational Operations.

ER- and EER-to-Relational Mapping: ER- to Relational Mapping Algorithm, Summary of Mapping for Model

Constructs and Constraints Mapping EER Model Concepts to Relations, Query, Processing and Optimization:

Query Processing, Query Optimization, Database Tuning.

Object Oriented Database Systems: Characteristics of an Object-relation Database Management System

(ORDBMS), Complex Objects, Inheritance, Function Overloading, Rules.

Distributed Database : Distributed Database System, Distributed Database Design, Data Fragmentation, Data

Replication, Data Allocation, Query Processing in Distributed Databases.

Recovery : Transactions, Transaction Recovery, System Recovery, Media Recovery, Two-phase Commit.

Database Security : Security and Integrity Threats Intentional or Malicious Threats Defense Mechanisms,

Security Policies, Authorization, Objects, View as objects, Granularity, Subject, Access Types.

Database Operating Systems : Features of a Database as Concurrency Control, A Concurrency Control Model

Theory of Serializability Concurrency Control Algorithms, Concurrency Control Based on Timestamp

Ordering Multiversion Concurrency Control Techniques, Optimistic Algorithm.

Multimedia Databases : Multimedia Data Formats, Continuous - Media Data, Similarity - Based Retrieval,

Mobility and Personal Database, Database Technologies, Serving Database on the Web, Applying Databases to

the Internet.

Text Books:

1. Database System Concepts – 6th Edition by Silberschatz, Korth and Sudarshan

2. Fundamentals of Database Systems – 5th Edition by R.Elmasri, S. Navathe

3. Database Design and Relational Theory: Normal Forms and All That Jazz by C.J. Date

Information Systems & Software Engineering (MCS103)

Introduction and IS in Global Business Today. Global E-Business: How Business Use Information System, IT

Infrastructure and Emerging Technologies, Foundations of Business Intelligence, Telecommunications, the

internet, and wireless Technology, Securing Information Systems, Enterprise Applications, Knowledge

Management,

Enhancing Decision Making

information gathering, requirement and feasibility analysis, data flow diagrams, process specifications,

input/output design, process life cycle, software planning and managing the project (single & multi variable

model), design, software modularity & metrics, coding, testing, implementation, maintenance, software quality

and reliability

Text Books:

1. Management Information Systems: Managing the Digital Firm - 11th Edition by Kenneth

C. Laudon Kenneth C. Laudon

2. Software Engineering: A Practitioner's Approach, 7/e by Roger S Pressman, R. S. Pressman &

Associates, Inc.

3. An Integrated Approach to Software Engineering by P. jalote, Springer

http://www.cp1897.com.hk/product_info.php?BookId=9780136093688

Discrete Mathematics & Numerical Methods (MCS104)

Propositional logic, Logical equivalence, Permutation and combinations, Generating functions, Recurrence relations,

Graph Theory Concepts Graphs, sub-graphs, cyclic graphs, Trees, spanning trees, binary trees, Algorithms- Kruskal’s

, Prim’s , Dijkstra’s , Flyod’s ,Warshall’s, DFS, BFS, Isomorphism, homomorphism

Finite automata – NFA, DFA, Conversion, Mealy M/C, Moore M/C, Introduction to Languages & Grammars and

their relation with Automata.

Interpolation-Newtons Forward, Backward, Sterling & Bessel’s Interpolation formula, Lagrange's Interpolation

Integration- Trapezoidal, Simpson’s 1/3 rd, Weddel’s Rule, Romberg Integration, Gauss- Legendre two & three point

formula, Newton Cotes Formula.

Gram-Schmidt orthogonalisation, Tchebycheff polynomial

Solution of transcendental equations- Method of Iteration, Method of Bisection, Newton

-Raphson Method, Regula-Falsi method, Secant Method.

Solution of system of linear equations- Gauss Elimination Method, Gauss-Jacobi, Gauss-Seidel, LU factorisation,

Tri-diagonalisation.

Inverse Interpolation.

Least Square Curve fitting- linear & non-linear

Solution of Differential Equations- Picard’s method, Euler-modified method,Taylor’s Series method, Runge-Kutta

method, Milne’s Predictor-Corrector method

Text Books:

1. Theory of Computer Science, Mishra & Chandrasekharan, PHI

2. Discrete Mathematics for Comp. Scientists & Mathematicians, Mott, Kandel & Baker, PHI

3. Discrete Mathematical Structure, C.L.Liu,TMH

4. Discrete Mathematical Structure, G.S.RAO

5. Numerical Analysis, Shastri, PHI

6. Numerical Methods for Mathematics ,Science & Engg., Mathews, PHI

7. Numerical Analysis & Algorithms, Pradeep Niyogi, TMH

Corporate Culture & Communication( MCS105)

Module – I (20 hrs)

1. Principles of Communication – Definition, Purpose, Process, Types [ 2L]

2. Verbal Communication – Target group profile, Barriers of Communication, Listening, Feedback, Presentation

Skills,

Use of Aids, Public Speaking, Practice Presentation, Non Verbal Communication [ 6L+ 6p]]

3. Written Communication – Stages of Writing, Composing Business Messages, Preparing Notes, Style,

Punctuation,

Using simple words, Proof Reading. [ 4L]

4. Report Writing – Report Planning, Types of Reports, Developing an outline, Nature of Headings, Ordering of

Points,

Logical Sequencing, Graphs, Charts, Executive Summary, List of Illustration, Report Writing.

[ 2L ]

Module – II (20 hrs)

5. Internal Communication – Circulars, Notices, Memos, Agenda and Minutes [4L + 2P]

6. External Communication – Resume/CV, Using Facsimiles (Fax), Electronic Main, Handling Mail [ 4 L ]

7. Writing Business Letters – Formats, Styles Types – Request, Enquiry, Placing Order, Instruction,

Action, Complaint, Adjustment, Sales, Reference, Good News & Bad News,

Acknowledgement [2L + 4P ]

8. Handling Business Information – Annual Report, House Magazine, Press Release, Press Report . [ 2 L + 2P]

Text Books

1. Blundell J. A & Middle N. M. G.: Career – English for the Business and Commercial World, Oxford University

Press. .

2. Kaul , Asha - Effective Business Communication, Prentice Hall.

3. Raman, M & Singh, P - Business Communication, OUP

4. Rizvi, M. Ashraf - Effective Technical Communication, Tata McGraw Hill

5. Taylor, Shirley - Communication for Business, 4th Edn.-Pearson Education.

Course code MCS191

Course title Programming Lab (C)

Scheme and Credits L T P S Credits Semester-I

- - 3 2 Total Contact Hours- 3P

Pre-requisite (if any) Theory regarding basic C programming syntax and Intial idea of TURBO C

compiler

Modules Serial of Modules Text Book as per Syllabus

Variable and Constants

Declare variable of different data types and print them, Implement different types of integer and floating-point constants

[Kanetkar, Yashvant - Let us C. - 3rd revised Edn. BPB]

Operators and Expressions

Input integer number and apply different

arithmetic operators (+,-,*,/,%), Implement ++

and – operators, Implement assignment

operators, Implement bitwise operators.


Formatted Input/output

Input character constant and print, Implement

scanf() Format code, Implement printf() Format

code, Implement isdigit(), islower(), isupper(),

tolower() and other functions.


Decision Making and Branching

Implement relational operators using if

statements, Implement logical operators using if

statements, Implement simple if statement,

Implement else if ladder, Implement switch …

case, use of ternary operator, nested ternary

operator, pseudo loop using goto statement.


Looping: Implement

while loop, implement for loop, Implement do-

while loop, Implement nested loop, Apply break

statement within a loop, Apply continue

statement within a loop.


Array Implement a 1 dimensional and 2-dimensional

array.


String Implement different string functions such as

strcat(), strcmp(), strcpy(), strlen().


Function Implement different library functions,

Implement UDF with no argument and no

return type, with argument and no return value,

with argument and with return value and with

no return value and with return value,

Implement auto, extern, static and register

variables, Implement chaining of UDF,

Implement recursion.


Recommended Books:

Kanetkar, Yashvant - Let us C. - 3rd revised Edn. BPB

Pointer and Header File

Implement Pointer, implement pointer

expression, implement pointer to an array,

implement pointer to a function, implement

simple macro, Implement nested macro.



Basic SQL 1.1 Introduction to SQL constructs.

1.2 Review of Basic SQL statements

1.3 Select, Project, Join, Describing Oracle tables

1.4 Examining all forms of DDL commands with

integrity constraints

1.5 Restricting row returns Creating basic reports,

Using the set commands,

1.6 Adding prompts to queries

1.7 Joining Oracle tables

1.8 Equi-join, Outer join Hiding joins by creating

views, Using IN, NOT IN

1.9 EXISTS and NOTEXISTS, Subqueries, Exercise

– write a subquery, Correlated subquery, Non-

correlated subqueries

SQL, PL/SQL - The

Programming Language Of

Oracle - 3rd Revised Edition

by Ivan Bayross

Advanced SQL 2.1Advanced SQL operators -Between operator, IN

and NOT IN operators

2.2Sub-queries-EXISTS clause, Using wildcards in

queries (LIKE operator)

2.3Aggregation in SQL -Count (*), Sum, Avg, Min

and max

2.4Using the group by clause, SQL access methods,

Review of Basic joining

2.5methods-Merge join, Hash Join, Nested Loop

join.

SQL, PL/SQL - The



by Ivan Bayross

Transaction

Handling

3.1 Understanding Commit and Rollback in a multi-

user platform

3.2 Problems due to Concurrent Transaction

3.3 Lost Update

3.4 Phantom Read

3.5 Non-Repeatable Read

3.6 Dirty Read (Uncommitted Dependency

Problem)

3.7 How to apply Transaction Isolation level to

solve them

SQL, PL/SQL - The



by Ivan Bayross

Special database

objects and their

applications with

4.1 Oracle View Usage and different types of Views

possible

4.2 Oracle Sequence and how to create a primary

SQL, PL/SQL - The



Course code MCS192

Course title Advanced DBMS Lab

Scheme and Credits L T P S Credits Semester-I

- - 3 2 Total Contact Hours- 3P

Pre-requisite (if any) Basic knowledge of Database operations and overviews

examples

key using sequence

4.3 Synonym usage (public and private)

by Ivan Bayross

Oracle PL/SQL 5.1 What is PL/SQL

5.2 Anonymous Block and examples

5.3 Procedure and Function with examples

5.4 Exception Handling application in procedures

5.5 Oracle Triggers and categories of Triggers

SQL, PL/SQL - The



by Ivan Bayross

Database Security 6.1 User creation

6.2 User rights

6.3 Granting and revoking privileges

6.4 Creating roles

6.5 Granting and revoking roles

6.6 Data Dictionary Views

SQL, PL/SQL - The



by Ivan Bayross

Database

Concurrency and

Consistency in a

Multiuser

Environment

7.1 Two-Phase-Commit protocol

7.2 lock-based protocol

7.3 Comparison of Read Committed and

Serializable Isolation

7.4 Row level locking

7.5 Table level locking

7.6 Generate Deadlock and avoid it

SQL, PL/SQL - The



by Ivan Bayross

Recommended Books:

SQL, PL/SQL - The Programming Language Of Oracle - 3rd Revised Edition by Ivan Bayross

Semester – II

A. THEORY

SL.

NO.

CODE THEORY CONTACTS PERIODS/WEEK CREDITS

L T P TOTAL

1 MCS201 Object Oriented Analysis &

Design

4 1 - 5 4

2 MCS202 Data Structure and Analysis of

Algorithm

4 1 - 5 4

3 MCS203 Advanced Computer

Architecture

4 1 - 5 4

4 MCS204 Data Communication &

Networking

4 1 - 5 4


B. PRACTICAL

5 MCS291 Object Oriented Programming

Lab (using Java)

- - 4 4 2

6 MCS292 Data Structure Lab - - 4 4 2

7 MCS293 Microprocessor and

VHDL/Verilog Lab

- - 4 4 3


C. SESSIONAL

8 MCS294 Statistics using R 2 1 - 3 2

9 MCS(GS)201 Essential Studies for

Professionals II

1 - - 1 0.5

Total of Sessional 4 2.5

Total of Semester 36 25.5

Course code MCS 201

Course title Object Oriented Analysis and Design

Scheme and Credits L T P S Credits Semester-II

4 1 - 4 Total Contact Hours- 4L+1T


Fundamentals of

Object-Oriented

Programming

1.1 Introduction

1.2 Object-Oriented Paradigm

1.3 Basic Concepts of Object-Oriented

Programming

1.4 Benefits of OOP 1.5 Applications of OOP

[Chapter 1, Programming with

JAVA A Primer, Fourth

Edition, E Balagurusamy]

Object Oriented

Software

Development

8.3 Object Oriented Analysis and Design

Methodologies

8.3.1. Booch’s Object Identification Method

[Chapter 8, Fundamentals of

Software Engineering Third

Edition, Rajib Mall]

Object Modeling

Using UML

7.2 Unified Modeling Language (UML)

7.3 UML diagrams

7.4 Use Case Model

7.4.1 Representation of Use Cases

7.4.2 Why Develop the Use Case Diagram?

7.4.3 How to Identify the Use Cases of a

System?

7.4.4 Essential verses Real Use Case

7.4.5 Factoring of Commonality among Use

Cases

7.4.6 Use Case Packaging

7.5 Class Diagrams

7.6 Interaction Diagrams

7.7 Activity Diagrams

7.8 State Chart Diagrams

[Chapter 7, Fundamentals of

Software Engineering Third

Edition, Rajib Mall]

JAVA Evolution 2.1 JAVA History

2.2 JAVA Features

2.3 How JAVA differs from C and C++

2.4 JAVA and Internet

2.5 JAVA and World Wide Web

2.6 Web Browsers 2.9 JAVA Environment


JAVA A Primer Fourth


Overview of

JAVA Language

3.1 Introduction

3.2 Simple JAVA Program

3.3 More of JAVA 3.4 An Application with Two Classes

Chapter 3, Programming with



3.5 JAVA Program Structure

3.6 JAVA Tokens

3.7 JAVA Statements,

3.9 Implementing a JAVA Program

3.10 JAVA Virtual Machine

3.11 Command Line Argument 3.12 Programming Style

Constants,

Variable and

Data Types

4.1 Introduction

4.2 Constants

4.3 Variables

4.4 Data Types

4.5 Declaration of Variables

4.6 Giving Values to Variables

4.7 Scope of Variables

4.8 Symbolic Constants

4.9 Type Casting

4.10 Getting Values of Variables 4.11 Standard Default Values




Operators and

Expressions

5.1 Introduction

5.2 Arithmetic Operators

5.3 Relational Operators

5.4 Logical Operators

5.5 Assignment Operators

5.6 Increment and Decrement Operator

5.7 Conditional Operators

5.8 Bitwise Operators

5.9 Special Operators

5.10 Arithmetic Expressions

5.11 Evaluation of Expression

5.12 Precedence of Arithmetic Operators

5.13 Type Conversion in Expressions

5.14 Operator Precedence and Associativity 5.15 Mathematical Functions




Decision Making

and Branching

6.1 Introduction

6.2 Decision Making with if Statement

6.3 Simple if Statement

6.4 The if…Else Statement

6.5 Nesting if…Else Statement

6.6 The Else if Ladder

6.7 The Switch Statement 6.8 The ?: Operator




Decision Making

and Looping

6.1 Introduction

6.2 Decision Making with if Statement

6.3 Simple if Statement

6.4 The if…Else Statement 6.5 Nesting if…Else Statement




6.6 The Else if Ladder

6.7 The Switch Statement

6.8 The ?: Operator

Decision Making

and Looping

7.1 Introduction

7.2 The While Statement

7.3 The Do Statement

7.4 The For Statement

7.5 Jumps in Loop 7.6 Labeled Loops




Classes, Objects

and Methods

8.1 Introduction,

8.2 Defining a class

8.3 Fields Declaration

8.4 Methods Declaration

8.5 Creating Objects

8.6 Accessing Class Members

8.7 Constructors

8.8 Methods Overloading

8.9 Static Members

8.10 Nesting of Methods

8.11 Inheritance: Extending a class

8.12 Overriding Methods

8.13 Final Variables and Methods

8.14 Final Classes

8.15 Finalizer Methods

8.16 Abstract Method and Classes

8.17 Methods with Varargs 8.18 Visibility Control




Arrays, Strings

and Vectors

9.1 Introduction

9.2 One-dimensional Arrays

9.3 Creating an Array

9.4 Two-dimensional Arrays

9.5 Strings

9.6Vectors

9.7 Wrapper Classes 9.8 Enumerated Types




Interfaces:

Multiple

Inheritance

10.1 Introduction

10.2 Definition of Interface

10.3 Extending Interface

10.4 Implementing Interfaces 10.5 Accessing Interface Variables

[Chapter 10, Programming

with JAVA A Primer Fourth


Packages: Putting

Classes Together

11.1 Introduction

11.2 JAVA API Packages

11.3 Using System Packages

11.4 Naming Conventions

11.5 Creating Packages 11.6 Accessing a Package




11.7 Using a Package

11.8 Adding a Class to a Package

11.9 Hiding Classes

11.10 Static Import

Managing Errors

and Exceptions

13.1 Introduction

13.2 Types of Errors

13.3 Exceptions

13.4 Syntax of Exception Handling Code

13.5 Multiple Catch Statements

13.6 Using Finally Statement

13.7 Throw Our Own Exceptions 13.8 Using Exceptions for Debugging




Multithreaded

Programming

12.1 Introduction

12.2 Creating Threads

12.3 Extending the Thread Class

12.4 Stopping and Blocking a Thread

12.5 Life Cycle of a Thread

12.6 Using Thread Methods

12.7 Thread Exception

12.8 Thread Priority 12.9 Synchronization




Applet

Programming

14.1 Introduction

14.2 How Applets differ from Applications

14.3 Preparing to Write Applets

14.4 Building Applet Code

14.5 Applet Life Cycle

14.6 Creating Executable Applet

14.7 Designing a web page

14.8 Applet Tag

14.9 Adding Applet to HTML File

14.10 Running the Applet

14.12 Passing Parameters to Applet 14.17 Event Handling




Course code MCS202

Course title Data Structure and Analysis of Algorithm Scheme and Credits L T P S Credits Semester-II



An Introduction to

Data structures

1.1 Introduction,

1.2 Definition,

1.3 Classification of Data structure,

1.4 Description of various Data structures,

1.5 Memory allocation in C,

1.10 Data structure operations

1.11Abstract Data types

[Chapter 1, Data Structures

through C, 4th Edition, Author:

G.S Baluja]

Recursion- A breath

Breaker

2.1Introduction,

2.2Types of Recursion,

2.4 Basic requirements for Recursion,

2.5 Disadvantages of Recursion,

2.6 Simple Recursive Program,

2.7Tower of Hanoi, 2.8 Recursion vs Iterations


through C,4thEdition, Author:

G.S Baluja]

ARRAYS 3.1 Introduction,

3.2 One dimensional arrays,

3.3 Initializing One-dimensional arrays,

3.4 Accessing One- dimensional array

elemnents,

3.5 Implementation of One dimensional array

in memory,

3.7 Insertion in One dimensional array,

3.8 Deletion of an element from one

dimensional array,

3.9. Traversing the array,

3.12 Multi dimensional array,

3.18 Array of Structures,

3.21Limitation of Linear arrays.



G.S Baluja]

STACKS 5.1.Introduction,

5.2.Stack Implementation,

5.3 Operations on Stack,

5.4Stack terminology,

5.7 Applications of Stacks,

5.9 Converting Infix expression to postfix

form, 5.11 Binary Expression tree.



G.S Baluja]

QUEUES 6.1 Introduction,

6.2 Implementation on Queue,

6.3 Operations on Queue,

6.6. Algorithm and C program for Insertion in

a Queue(using array),

6.6 Algorithm and C program for Deletion in

a Queue (using array)

6.7. A circular Queue,

6.8. A Double Ended Queues, 6.10. Applications of Queue.



G.S Baluja]

LINKED LIST 7.1 Introduction,

7.2. Linked list(advantages and

disadvantages)

7.3 Key terms,

7.4 Representation of Linear Linked list,

7.5 Operations on Linked List,

7.6. Types of Linked List,

7.7 Singly Linked list,

7.11 Application, 7.12 Generalized Linked List



G.S Baluja]

TREES 8.1 Introduction,

8.2 Tree,

8.3 Binary Tree,

8.4 Binary Treerepresentation ,

8.5 Creation of Binary tree,

8.6 operations on Binary trees,

8.7 technique of converting an expression into

binary tree

8.8 Binary search tree,

8.13 Extended Binary tree, 8.10 Height balanced trees.



G.S Baluja]

SORTING 10.1 Introduction,

10.2. Sorting,

10.3 Bubble Sort,

10.4 Selection Sort,

10.5 Insertion Sort,

10.6 Quick Sort,

10.7. Radix sort

10.8 Merge Sort,

10.9 Heap Sort 10.11 Shell sort



G.S Baluja]

SEARCHING AND

HASHING

11.1 Introduction,

11.2. Linear searching,

11.3 Binary searching,

11.4 Hashing, 11.5 Terms associated with Hash tables Hash



G.S Baluja]

tables,

11.6 bucket overflow

THE ROLE OF

ALGORITHMS IN

COMPUTING

1.1 Algorithms,

1.2 Algorithms as a technology Chapter 1, Introduction to

Algorithms, Author: Introduction to

Algorithm by Thomas H. Cormen,

Charies E. Leiserson and Ronald. L. Riveit]

GETTING

STARTED

2.1 Insertion sort,

2.2 Analyzing

algorithms,

2.3Designing

algorithms

[Chapter 2, Introduction to

Algorithms, Author:

Introduction to Algorithm by

Thomas H. Cormen, Charies E.

Leiserson and Ronald. L. Riveit]

GROWTH OF

FUNCTIONS

3.1 Asymptotic notation ,

3.2 Standard notations and common

functions


Algorithms, Author:




DYNAMIC

PROGRAMMING

15.2 Matrix-chain multiplication ,

15.3 Elements of dynamic programming ,

15.4 Longest common subsequence


Algorithms, Author:




GREEDY

ALGORITHMS

16.1 An activity-selection problem ,

16.2 Elements of the greedy strategy ,

16.3 Huffman codes


Algorithms, Author:




MINIMUM

SPANNING TREES

23.1 Growing a minimum spanning tree,

23.2 The algorithms of Kruskal and Prim [Chapter 23, Introduction to

Algorithms, Author:




SINGLE-SOURCE

SHORTEST

PATHS

24.1 The Bellman-Ford algorithm ,

24.2 Single-source shortest paths in

directed acyclic graphs ,

24.3 Dijkstra’s algorithm ,

24.4 Difference constraints and shortest

paths 24.5 Proofs of shortest-paths properties


Algorithms, Author:




APPROXIMATION

ALGORITHMS

35.1 The vertex-cover problem,

35.2 The traveling-salesman problem,

35.3 The set-covering problem,

35.4 Randomization and linear programming,

35.5 The subset-sum problem


Algorithms, Author:




Course code MCS203

Course title Advanced Computer Architecture Scheme and Credits L T P S Credits Semester-II

4 1 - 4 Total Contact Hours- 4L+1CE


Digital Logic

Circuits

1.1 Basic structure of digital computer

1.2 Logic gates

1.3 Boolean algebra

1.3 De-Morgan’s theorem

1.4 Map simplification

1.4 POS and SOP Boolean expressions

simplification

1.4 Karnaugh map

1.4 Don’t care conditions

1.5 Combinational circuits

1.6 Flip-flop 1.7 Sequential circuits.

(Chapter 1 of COMPUTER

SYSTEM ARCHITECTURE

by Morris Mano-

Pearson,3rdEdition)

Memory

Organization

12.1 Memory hierarchy

12.2 Main memory

12.2 RAM and ROM chips

12.3 Auxiliary memory: magnetic disks and

magnetic tape

12.4 Associative memory

12.5 Cache memory

12.5 Associative mapping

12.5 Direct mapping

12.5 Set-associative mapping

12.6 Virtual memory

12.6 Address space and memory space

12.6 Paging

12.6 Page replacement

12.7 Memory management hardware 12.7 Segmented page mapping.


SYSTEM ARCHITECTURE

by Morris Mano-Pearson,

3rdEdition)

Input-Output

Organization

11.1 Peripheral devices

11.2 Input-output interface

11.2 Isolated versus Memory mapped I/O

11.3 Asynchronous Data transfer-strobe

control

11.3 Handshaking method

11.3 Asynchronous serial transfer

11.4 Programmed I/O 11.4 Interrupt initiated I/O


SYSTEM ARCHITECTURE


3rdEdition)

11.5 Priority Interrupt: Daisy chaining

11.5 Parallel priority interrupt

11.6 Direct Memory Access (DMA)

11.6 DMA controller

11.6 DMA transfer 11.5 Interrupt cycle.

Pipeline and Vector

Processing

9.1 Parallel processing

9.2 Pipelining: Arithmetic pipeline

9.2 Instruction pipeline

9.4 Four segment instruction pipeline

9.4 Data dependency

9.4 Handling of branch instruction

9.5 RISC pipeline

9.5 Delayed load

9.5 Delayed branch

9.6 Vector processing

9.6 Vector operations

9.6 Matrix multiplication

9.6 Memory interleaving

9.7 Array Processor: Attached Array

processor 9.7 SIMD array processor


SYSTEM ARCHITECTURE


3rdEdition)

Processors and

Memory Hierarchy

4.1 Instruction Set Architecture

4.2 Superscalar processor

4.2 VLIW architecture

4.2 Vector and symbolic processor

4.3Hierarchical memory technology

4.3 Inclusion, coherence and locality

(Chapter 4 of ADVANCED

COMPUTER

ARCHITECTURE:

PARALLELISM,

SCALABILITY,

PROGRAMMABILITYby Kai

Hwang, Naresh Jotwani-Tata

McGraw Hill, 3rdEdition)

Instruction Level

Parallelism

12.1 Introduction

12.2 Basic Design issues

12.3 Problem definition

12.5 Compiler detected instruction level

parallelism

12.6 Operand forwarding

12.7 Reorder buffer

12.8 Register renaming

12.10 Branch prediction

12.11 Limitations in exploiting instruction

level parallelism.


COMPUTER

ARCHITECTURE:

PARALLELISM,

SCALABILITY,

PROGRAMMABILITYby Kai

Hwang, Naresh Jotwani-Tata

McGraw Hill, 3rdEdition)

Multiprocessors and

Interconnection

Structures

13.1 Characteristics of Multiprocessors

13.2 Interconnection Structures: time-shared

common bus

13.2 multiport memory 13.2 crossbar switch


SYSTEM ARCHITECTURE


3rdEdition)

13.2 multistage switching network

13.2 hypercube interconnection

13.5 Cache coherence Problem and solution

Program and

Network Properties

2.1 Data and Resource Dependences

2.3Program flow mechanism: Control flow

versus Data flow computer

2.3 Demand driven mechanism

2.3 Comparison of flow mechanism

2.4 Systolic computer


COMPUTER

ARCHITECTURE:

PARALLELISM,

SCALABILITY,

PROGRAMMABILITY by

Kai Hwang, Naresh Jotwani-

Tata McGraw Hill, 3rd Edition)

Course code MCS204

Course title Data Communication & Networking

Scheme and Credits L T P S Credits Semester-II



Introduction 1.1 Data communication

1.2 Network

1.3 The Internet

1.4 Protocols and Standard

(Chapter 1, Data Communications &

Networking, 4th Edition,Behrouz A.

Forouzan)

Data and Signals 3.1 Analog and Digital

3.2 Periodic analog signal

3.3 Digital signals

3.4. Transmission imparement

3.5 Data rate limits 3.6 Performance

(Chapter 3, Data Communications &


Forouzan)

Digital Transmission 4.1 Digital to digital conversion

4.2 Analog to digital conversion

4.3 Transmission modes

(Chapter 4, Data

Communications &

Networking, 4th Edition,Behrouz A. Forouzan)

Analog

Transmission

5.1 Digital to analog conversion

5.2 Analog to analog conversion (Chapter 5, Data Communications &

Networking, 4th Edition, Behrouz A.

Forouzan)

Bandwidth

Utilization:

Multiplexing and

Spreading

6.1 Multiplexing

6.2 Spread spectrum (Chapter 6, Data

Communications &

Networking, 4th Edition,Behrouz

A.Forouzan)

Transmission Media 7.1 Guided media

7.2 Unguided media (Chapter 7,Data

Communications &

Networking, 4th Edition,Behrouz A. Forouzan)

Switching 8.1 Circuited- switched networks

8.2 datagram networks,

8.3 virtual –circuit network, 8.4 Structure of a switch

(Chapter 8, 4th Edition, Data

communication and Networking,

Author: Behrouz A Forouzan)

Data Link Control 11.1 Framing

11.2 Flow and error control

11.3 Protocols

11.4 Noiseless Channels 11.5 Noisy channel

(Chapter 11,Data Communications &


Forouzan)

11.6 HDLC

11.7 Point to point protocol

Network layer and

Logical addressing

19.1 IPv4 Addresses

19.2 IPv6 Addresses (Chapter 19, 4th Edition, Data

communication and

Networking, Author: Behrouz A Forouzan)

Network layer:

Delivery,

Forwarding and

Delivery

22.1 Delivery,

22.2 forwarding

22.3 unicast routing protocols,

22.4.multicast routing protocols


communication and

Networking, Author:Behrouz A Forouzan)

Transport Layer 23.1 Process to process delivery

23.2. User datagram protocol

23.3 TCP

23.4 SCTP

(Process to Process delivery,

UDP,TCP and SCTP) (Chapter

23, 4th Edition, Data

communication and

Networking, Author: Behrouz

A Forouzan)

Remote logging,

electronic mail and

file transfer

26.1 Remote logging

26.2 Electronic mail

26.3 File transfer


communication and


WWW and HTTP 27.1 Architecture

27.3 HTTP (Chapter 27, 4th Edition, Data

communication and


Cryptography 30.1 Cryptography

30.2 Symmetric Key cryptography

30.3Asymmetric Key cryptography


communication and


Practical Papers

Paper Name: Object Oriented Programming Lab (using Java)

Paper Code: MCS291

Object Oriented Programming Fundamentals, The Java environment, class, object, constructor, garbage

collection, array, access control, method overloading, nested & inner class, inheritance & interface, package,

exception handling, thread, I/O, applet & GUI, event handling, network (Socket) programming, RMI, JDBC,

J2EE overview, Servlet & JSP.

Paper Name: Data Structure Lab

Paper Code: MCS292

Implementation of list, stack, queue, hashing,two dimensional array, Tree structures: binary trees, AVL trees,

Red-Black trees, priority queues, Tree traversal algorithms, Graphs and algorithms: Prim’s algorithm,

Kruskal’s algorithm, Dijkstra’s method, Backtracking minimum spanning trees, Sorting & Searching

algorithms(using C)

Paper Name: Microprocessor and VHDL Lab

Paper Code: MCS293 1. Study of 8086 microprocessor kit

2. Write a program using 8086 for division of a defined double word (stored in a data segment) by

another double Word division and verify.

3. Write a program using 8086 for finding the square root of a given number and verify

4. Write a program using 8086 for copying 12 bytes of data from source to destination and verify.

5. Write a program using 8086 and verify for: a. Finding the largest number from an array. b. Finding

the smallest number from an array.

6. Write a program using 8086 for arranging an array of numbers in descending order and verify.

7. Write a program using 8086 for arranging an array of numbers in ascending order and verify.

8. Write a program for finding square of a number using look-up table and verify.

9. Write a program to interface a two-digit number using seven-segment LEDs. Use 8085/8086

microprocessor and 8255 PPI.

10. Write a program to control the operation of stepper motor usi8085/8086

11. Write VHDL programs for the following circuits, check the wave forms and the hardware

generated a. half adder b. full adder


generated a. multiplexer b. demultiplexer


generated a. decoder b. encoder

14. Write a VHDL program for a comparator and check the wave forms and the hardware

generated

15. Write a VHDL program for a code converter and check the wave forms and the hardware

generated

16. Write a VHDL program for a FLIP-FLOP and check the wave forms and the hardware generated

17. Write a VHDL program for a counter and check the wave forms and the hardware generated


generated a. register b. shift register

19. Implement the above mentioned VHDL circuits in FPGA kit.

Subject Code: BCA(GS)281

Subject Name: SKILL DEVELOPMENT FOR

PROFESSIONALS

Semester : 2nd

L-T-P : 2-0-0 (Total Contact Hrs. 2) Credit: 1

Pre-Requisites: Fundamental knowledge of Quantitative Aptitude, Logical Reasoning &Verbal English.

Course Outcomes:

1. Students will learn advance tricky approaches for solving Quant.

2. It will enhance student’s skill to appear in various aptitude test within limited time constrain.

3. This module will enhance students’ Analytical skill & will also improve quick decision-making skill.

4. Students can prepare various competitive exams and different placement aptitude test as well.

Course Content

Module

No.

Description

1. Quantitative Aptitude

1) Average- Concept on average, different missing numbers in average estimation, shortcuts

& their application.

2) Mixture & Allegation – Proportion & mixtures in percentages, populations & liquids,

shortcuts & their application.

3) Number System- concept of different numbers, remainder theorem, factors.

4) Time & Work- Basic concept, Different problems & their shortcut tricks. Time & Speed

& Tides- concept of speed, time & Distance, relative speed, formulae & their application.

Upstream & Downstream, Pipes & cistern.

2. Logical Reasoning

1) Cube, Dice, Miscellaneous Problems

2) Data Sufficiency

a) Problems on Blood Relation, ages, Numbers

b) Logical Test Based on Data Sufficiency

3) Non-Verbal Reasoning

a) Image Formation

b) Water –Images

c) Mirror Image

d) Image completion

e) Paper Cutting and Folding

3. Objective English-2

1) Clauses: Definition, Examples, Rules & Application, Types of Sentences

(Simple +Complex +Compound) Examples, Rules & Application, Voice- Concept,

Types, Examples, Rules & Application, Narration Change- Rules (Direct & Indirect

Speech)

2) Vocabulary-: Synonyms, Antonyms with examples, One word Substitution, Idioms

& Phrases

3) Spotting Errors

4) Reading Comprehension (Level II)

4. Data Interpretation level-II

Newspaper reading: The Hindu & Economic Times

Learning Resources:

Text Books:

1. Objective General English- S.P Bakshi

2. English Grammar and Competition-S.C Gupta

3. Fast Track Objective Arithmetic- Rajesh Verma

4. Quantitative Aptitude– S.Chand

Reference Books: 1. Advance Maths- Rakesh Yadav

2. Verbal and Non-Verbal Reasoning- R.S Agarwal

3.A new approach to Reasoning- BS Sijwali

Paper Name: Statistics using R

Paper Code: MCS294

Contacts Hours / Week: 2L+1T

Credits: 2

Unit 1 Collection of data : Introduction, Primary data, Secondary data, Method of collection of primary data, Source

of secondary data, Classification and Tabulation of data, Tabulation of data and Statistical table.

Frequency distribution charts and diagram :Frequency Distribution, Diagram- Bar diagram, Pie Chart, Line

chart, Histogram of a frequency Distribution, Cummulative Frequency Plygon or Ogive.

Measures of Central Tendency: Mean(AM,GM,HM), Median, Mode, Quartiles, Deciles, Percentiles

Measures of Dispersion

Classification of Measure of Dispersion, Range, Quarline deviation, Mean deviation, Variance and Standard

Deviation

Unit 2. MODULE 1 :

First steps in R, R Download and Environment , A first R session, Functions and objects , More

specific topics, Adding comments and layout, Vectors and data frames Programming: “if” statements

and the “for loop”

The basics of R; first steps in writing code; variables; functions; vectors; simple calculations

Vectors; matrices; indexing, Working directory, reading and writing, loading and saving data, data

frames. Character string manipulation

Programming: if, for, while and break .Lists, arrays, apply-functions, Reading data from a file

The working directory, The R workspace, Write data created in R to a file, Date and time formats

MODULE 2 : Graphics , Setting up the frame , Customizing axes , Colors and background elements , The actual data,

Exporting graphics, More custom plots and log-axes, Getting values from the graphic

Overlaying graphs; figure within a figure, More than one graph, Symbols and fonts and pixel images

Specific graphics packages, Discussion of R graphics.Simple graphing: Histograms. Stem and leaf

plots. Lineplots,Boxplots,Scatterplots. Bar graphs.

MODULE 3 :

Measures of Location ,Measures of dispersion, Quantiles and the boxplot, The standard error of the

mean Mean,Variance and standard deviation, Statistical modeling functions: lm and glm Linear and

generalized linear models.

Text Books: S. G. Purohit, S. D. Gore, and S. R. Deshmukh. Statistics Using R. Narosa Publishing House.

Semester - III

A. THEORY

SL. NO. CODE THEORY CONTACTS

PERIODS/WEEK

CREDITS

L T P TOTAL

1 MCS301 Operation Research 4 1 - 5 4

2 MCS302 Advanced Operating System 4 1 - 5 4

3 MCS303 Artificial Intelligence 4 1 - 5 4

4 MCSE301

A/B/C

Elective – 1 4 1 - 5 4


B. PRACTICAL

5 MCS391 Operation Research Lab - - 3 3 2

6 MCS392 Operating System (Unix) Lab - - 3 3 2

7 MCS393 Seminar - - 3 3 2

8 MCS394 Industrial Training - - - - 4


C. MOOCS

9 MOOCs(MSC)-

321

MOOCs I - 2 - - 2

10 MOOCs(MSC)-

322

MOOCs II - 2 - - 2

Total of MOOCS 4 4




1 MCS E301A Embedded Systems

MCS E301B Image Processing

MCS E301C Automata & Natural Language Processing

Course Code MCS 301

Course Title Operation Research

Schemes and Credits L T P Credits Semester-III

Total Contact

Hours- 4L+1T 4 1 - 4

Pre-requisites (if any) Mathematics and statistics, Operations Research Methodology

Course Outcome:

● Identify and develop operational research models from the description of the real system.

● Understand the mathematical tools that are needed to solve optimization problems.


Historical

Development

Introduction to OR, Quantitative approach to

management decision making, Analyzing

and defining the problem, Developing a

model, Selecting the inputs and putting the

model to work, Typical applications of OR.

[Chapter 1. Operations

Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)

LIMITED, PUBLISHERS]

Linear

Programming

models (Resource

allocation models)

Linear Programming, Formulating

maximization/minimization problems,

Graphical solution, Applications of LP.


Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Linear

Programming

models (Solution by

Simplex method)

Simplex methods, Special cases of LP,

Duality of LP and its interpretation, Dual

simplex methods, Post Optimality/sensitivity

analysis


Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Linear

Programming -

(Transportation

Problem,

Assignment Model)

Transportation and Assignment problems,

VAM method, Checking for optimally using

MODI method, Unbalanced problem and

degeneracy, Hungarian method for

assignment problem, Traveling salesman

problem.

[Chapter 4 & Chapter 5.

Operations Research BY P.

Rama MURTHY, NEW AGE

INTERNATIONAL (P)


Replacement Model Replacement models - Types of replacement

problems, Replacement of assets that

deteriorate with time, Markov Analysis:

Brand switching analysis, Prediction of

market shares for future periods, Equilibrium

conditions, Uses of Markov analysis.

[Chapter 7.Operations

Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Waiting line theory

or Queuing Model

Waiting lines - Characteristics of a queuing

system, Arrival and service patterns, Single

and multiple channel, Queue models with

Poisson arrival and exponential service

times.


Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Theory of Games or

Competitive

Strategies

Game theory - 2 Person zero sum games,

Saddle point, Mixes strategies use of

dominance rules, Solution by graphical

methods.


Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Simulation Simulation Modeling - Monte Carlo

simulation, Using random numbers,

Applications in inventory analysis, Waiting

lines, Maintenance and finance areas.

[Chapter13. Operations

Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Programme

Evaluation and

Review Technique

and Critical Path

Method (PERT

AND CPM)

PERT, CPM, Network Analysis, Critical

Path, Determination of Float

[Chapter15. Operations

Research BY P. Rama

MURTHY, NEW AGE

INTERNATIONAL (P)


Recommended Books: Operations Research BY P. Rama MURTHY, NEW AGE INTERNATIONAL (P) LIMITED, PUBLISHERS

Course code MCS 302

Course title Advanced Operating System

Scheme and Credits L T P S Credits

Semester-III

Total Contact Hours-

4L+1T

4 1 - - 4

Pre-requisite (if any) Basic concept of operating system

Course Outcome:

On completion of the course students will be able to

● Understand the architecture of distributed system, theoretical foundations, database operating system


Overview Functions of OS

Types of advanced OS

[Chapter 1 of Mukesh

Singhal and Niranjan

Shivaratri, Advanced

Concepts In Operating

Systems]

Process Deadlocks Preliminaries. Models of Deadlocks, Models

of Resources, Graph theoretic model of a

system state, Systems with Single-Unit

Request, Systems with only Consumable

Resources request, Systems with only

Reusable Resources





Systems]

Architectures of

Distributed Systems

Introduction, System Architecture Types,

Issues in Distributed OS, Communication

Networks, Communication Primitives

[Chapter 4 of MukeshSinghal

and Niranjan Shivaratri,

Advanced Concepts In

Operating Systems]

Theoretical

Foundations

Inherent Limitations of a Distributed System,

Lamport’s Logical clocks, Vector clocks,

Casual Ordering of Messages, Global states




Operating Systems]

Distributed

Deadlock Detection

Preliminaries, Deadlock handling strategies in

distributed systems, Issues in deadlock

detection and resolution, Control organizations

for distributed deadlock detection, Centralized

deadlock detection algorithms, Distributed

deadlock detection algorithms



Advanced Concepts

InOperating Systems]

Distributed File

Systems

Mechanisms for Building Distributed File

Systems, Design Issues




Operating Systems]

Distributed Shared

Memory

Architecture and Motivation, Algorithms for

Implementing DSM, Memory Coherence,

Coherence Protocols, Design Issues





Systems]

Resource Security

and Protection

Preliminaries, Access matrix models,

Implementation of Access matrix, Safety in

the Access matrix, Advanced models of

protection





Systems]

Introduction to

Database Operating

Systems

Introduction, What are different requirements

of a database OS





Systems]

Concurrency

Control

Database Systems,

The problem of concurrency control,

Serializability Theory,

Distributed Database Systems





Systems]

Recommended Books:

Mukesh Singhal and Niranjan Shivaratri, Advanced Concepts In Operating Systems

Course Code MCS 303

Course Title Artificial Intelligence


Total Contact

Hours- 4L+1T 4 1 - 4

Pre-requisites (if any) Basic math, Science and Computer programming

Course Outcome:


● Understand the various searching techniques, constraint satisfaction problems and

example problems- game playing techniques.

● Apply these techniques in applications which involve perception, reasoning and

learning.

● Explain the role of agents and how it is related to the environment and the way of

evaluating it and how agents can act by establishing goals.

● Acquire the knowledge of real world Knowledge representation.

● Analyze and design a real world problem for implementation and understand the

dynamic behavior of a system.

● Use different machine learning techniques to design AI machines and enveloping

applications for real world problems.

Modules

Serial of Modules Text Book as per Syllabus

What is Artificial Intelligence The AI Problems

The Underlying Assumption

What is an AI Technique

The level of the Model

Criteria for Success

Some General References

[Part 1:Chapter1, Artificial

Intelligence (Third Edition)

Elaine Rich, Kevin Knight,

Shivashankar B. Nair]

Heuristic Search Techniques Generate-and-Test

Hill Climbing

Best- first Search

Problem Reduction

[Part 1:Chapter3, Artificial




Game Playing Overview

The Minimax Search Procedure

Adding Alpha-beta Cutoffs

[Part 3:Chapter12,Artificial




https://www.abebooks.com/servlet/SearchResults?an=kevin%20knight%20elaine%20rich&cm_sp=det-_-bdp-_-author









Natural Language Processing Introduction

Syntactic Processing

Semantic Analysis

Statistical Natural Language

Processing

Spell Checking

[Part3:Chapter15, Artificial

Intelligence (Third

Edition)Elaine Rich, Kevin

Knight, Shivashankar B. Nair]

Connectionist Models Introduction

Hopfield Networks

Learning in Neural Networks

Applications of Neural

Networks

Recurrent Networks

Distributed Representations

[Part 3:Chapter 18, Artificial




Fuzzy Logic Systems Introduction

Crisp Sets

Fuzzy Sets

Some Fuzzy Terminology

Fuzzy Logic Control

α Cut Threshold

[Part3:Chapter22, Artificial




Genetic Algorithms : Copying

Nature’s Approaches

A Peek into the Biological

World

Genetic Algorithms (GAs)

Significance of the Genetic

Operators

[Part3:Chapter23,ArtificialIntelli

gence(Third Edition)Elaine

Rich, Kevin Knight,


Prolog-The Natural Language

of Artificial Intelligence

Introduction

Converting English to Prolog

Facts and Rules

Goals

Prolog Terminology

Variables

Control Structures

Arithmetic Operators

[Part3:Chapter25,ArtificialIntelli

gence(Third Edition)Elaine

Rich, Kevin Knight,


Recommended Books: Artificial Intelligence (Third Edition) Elaine Rich, Kevin Knight, Shivashankar B. Nair











Course Code MCS E301C

Course Title Automata & Natural Language Processing


Total Contact

Hours- 4L+1T 4 1 - 4

Pre-requisites (if any) Python, Relational Algebra, Knowledge of basic languages

Course Outcome:


● Acquire a fundamental understanding of the core concepts in automata theory and formal languages.

● Use NLP technologies to explore and gain a broad understanding of text data.

● Use NLP methods to analyze sentiment of a text document.

● Use NLP methods to perform topic modelling.

● Organize and implement a NLP project in a business environment.


Introduction to

Compiling

Compilers

Analysis of the source program

The phases of a compiler

Cousins of the compiler

The grouping of phases

[Chapter 1-Compilers:

Principles, Techniques and

Tools, Alfred V.Aho Ravi

Sethi Jeffrey D. Ullman]

Lexical Analysis The role of the lexical analyzer

Input buffering

Specification of tokens

Recognition of tokens

A language for specifying lexical

analyzers

Finite automata

From a regular expression to an NFA

Design of a lexical analyzer generator

[(Chapter 3-Compilers:

Principles,Techniques and



Syntax Analyzer The role of the parser

Context-free grammars

Writing a grammar

Topdown parsing

Bottom-up parsing

Operator-precedence parsing

LR parsers

Using ambiguous grammars

Parser generators

[ Chapter 4-Compilers:

Principles ,Techniques and



Language Processing

and Python

Computing with Language: Texts and

Words

A Closer Look at Python: Texts as

Lists of Words

Computing with Language: Simple

Statistics

Back to Python: Making Decisions and

Taking Control

Automatic Natural Language

Understanding

[ Chapter 1: Edward Loper,

Ewan Klein, Steven Bird, June

2009]

Accessing Text Corpora

and Lexical Resources

Accessing Text Corpora

Conditional Frequency Distributions

Lexical Resources

WordNet



2009]

Processing Raw Text Strings: Text Processing at the Lowest

Level, Text Processing with Unicode

Regular Expressions for Detecting,

Word Patterns, Useful Applications of

Regular Expressions, Normalizing Text

Regular Expressions for Tokenizing

Text, Segmentation, Formatting: From

Lists to Strings



2009]

Categorizing and

Tagging Words

Using a Tagger

Tagged Corpora

Mapping Words to Properties Using

Python Dictionaries

N-Gram Tagging



2009]

Learning to Classify

Text

Supervised Classification

Further Examples of Supervised

Classification

Evaluation

Decision Trees

Naive Bayes Classifiers

[Chapter 6: Edward Loper,


2009]

Recommended Books: Edward Loper, Ewan Klein, Steven Bird, June 2009

Course Code MCS 391

Course Title Operational Research Lab



3P - - 3 2

Pre-requisites (if any) Mathematics and Statistics, Operational Research Methodology

Modules Serial of

Modules

Text Book as per Syllabus

Linear

Programming

Tranportation

, Assignment ,

Duality ,

Simplex

OPERATIONS RESEARCH by Prem Kumar Gupta

Shortest Path Dijkstra’s ,

Floyd’s

Algorithm

OPERATIONS RESEARCH by Prem Kumar Gupta

Maximal Flow - OPERATIONS RESEARCH by Prem Kumar Gupta

Queuing Theory

- OPERATIONS RESEARCH by Prem Kumar Gupta

PERT/CPM


Integer

Programming

Problem (Branch

& Bound

Problem)


Recommended Books: OPERATIONS RESEARCH by Prem Kumar Gupta

Course Code MCS 392

Course Title OS LAB (UNIX)



3P - - 3 2

Pre-requisites (if any) Basic knowledge of computer fundamentals with operating system and

their functionalities


Essential Linux

Commands

Commands for files and directories cd, cp,

mv, rm, mkdir, more, less, creating and

viewing files, using cat, file comparisons,

View files, kill, ps, who, sleep, grep, fgrep,

find, sort, cal, banner, touch, file related

commands – ws, sat, cut, grep etc.

Mathematical commands –expr etc.

[Unix Concepts and

Applications by Sumitabha

Das, Fourth Edition,

McGraw Hill Publication]

Shell Programming

Creating a script, making a script

executable, shell syntax (variables,

conditions, control structures, functions,

and commands), array in shell script.

[Unix Concepts and




Process Starting a new process, replacing a process

image, duplicating a process image.

[Unix Concepts and




Signal Signal handling, sending signals etc.

[Unix Concepts and




Semaphore Programming with semaphores (use

functions semget, semop, semaphore_p,

semaphore_v).

[Unix Concepts and




POSIX Threads Programming with pthread functions (viz.

pthread_create, pthread_join, pthread_exit,

pthread_attr_init, pthread_cancel).

[Unix Concepts and




Recommended Books: Unix Concepts and Applications by Sumitabha Das, Fourth Edition, McGraw Hill Publication

Semester – IV

A. THEORY

SL.

NO


PERIODS/WEEK

CREDITS

L T P TOTAL



Total of Theory 8 8

B. PRACTICAL

3 MCS491 Dissertation 0 0 13 13 6

4 MCS492 A/B/C Elective – 3 Lab 0 0 3 3 2

5 MCS493 Viva Voce 0 0 0 0 4


Total of MOOCS

6 MOOCs (MCS)-421 MOOCs III 3 1 - 4 5

7 MOOCs (MSC)-422 MOOCs IV 3 1 - 4 5

Total MOOCS 8 10



Elective Practical Lab for Semester IV


1 MCS 492A Data Warehousing & Mining Lab

MCS 492B Soft Computing Lab

MCS 492C Social Network Analysis Lab

Elective Theory Papers for Semesters III & IV


2 MCS E401A Cloud Computing

MCS E401B Mobile Computing

MCS E401C Network Security

3 MCS E402A Data Warehousing & Mining

MCS E402B Soft Computing

MCS E402C Social Network Analysis

Course Code MCS E401A

Category Computer Science Course

Course Title Cloud Computing

Schemes and Credits L T P Credits Semester-IV

3 1 0 4

Pre-requisites (if any) Basic knowledge of Internet, Computer Networking and Operating

System like Windows or Unix

Module-1

Introduction (Chapter 1) by Mastering Cloud Computing by Rajkumar Buyya , Christian Vecchiola,

S.Thamarai Selvi

1.1 Cloud Computing at a Glance

1.1.1 The Vision of Cloud Computing

1.1.2 Defining a Cloud

1.1.3 A Closer Look

1.1.4 Cloud Computing Reference Model

1.1.5 Characteristics and Benefits

1.1.6 Challenges Ahead

1.2 Historical Developments

1.2.1 Distributed Systems

1.2.2 Virtualization

1.2.3 Web 2.0

1.2.4 Service Oriented Computing

1.2.5 Utility Oriented Computing

Module-2

Principles of Parallel and Distributed Computing (Chapter 2) by Mastering Cloud Computing by

Rajkumar Buyya , Christian Vecchiola, S.Thamarai Selvi

2.1 Eras of Computing

2.2 Parallel vs Distributed Computing

2.3 Elements of Parallel Computing

2.3.1 What is Parallel Processing

2.3.2 Hardware Architectures of Parallel Processing

2.3.3 Approaches to Parallel Programming

2.3.4 Levels of Parallelism

2.3.5 Laws of Caution

2.4 Elements of Distributed Computing

2.4.1 General Concepts and Definitions

2.4.2 Components of a Distributed System

2.4.3 Architectural Styles for Distributed Computing

2.4.4 Models for Inter Process Communication

2.5 Technologies for Distributed Computing

2.5.1 Remote Procedure Call

2.5.2 Distributed Object Framework

2.5.3 Service Oriented Computing

Module-3

Virtualization (Chapter 3) of by Mastering Cloud Computing by Rajkumar Buyya, Christian

Vecchiola, S.Thamarai Selvi

3.1 The Introduction

3.2 Characteristic of Virtualized Environments

3.3Taxonomy of Virtualization Techniques

3.3.1 Execution Virtualization

3.3.2 Other types of Virtualization

3.4 Virtualization and Cloud Computing

3.5 Pros and Cons of Virtualization

3.6 IAAS, PAAS, SAAS Types of Clouds and Security

Module-4



Concurrent Computing with Thread Programming

4.1 High-throughput Computing and Data-Intensive Computing

4.2 Programming applications with Threads

4.3 Thread API, Parallel computation with Threads, Task computing

Module-5



Task Computation with High-Throughput

5.1 Task Introduction

5.2 Frameworks for Task computing

5.3 Task-based application model

5.4 Data-intensive computing Characteristics

Module-6

Principles of Parallel and Distributed Computing (Chapter 9 and 10) by Mastering Cloud

Computing by Rajkumar Buyya , Christian Vecchiola, S.Thamarai Selvi

Cloud Platforms and Applications

6.1 Overview on Amazon Web Services (AWS)

6.2 Overview of Google Cloud Platform (GCP)

6.3 Overview of Microsoft Azure Cloud

6.4 Cloud applications in scientific, business and consumer domain

6.5 CRM and ERM

Course Outcomes:

• Students will be able to learn how to configure and work in Cloud Computing

• Students will be able to learn how to create applications-based Cloud Computing working

procedure.

• Students will be able to learn how to apply logic for problems and choose best way to solve

problems of Cloud Computing.

• Students will be test various application programming interfaces with Cloud Environments like

AWS using practical set up.

Recommended Books:

• Buyya, Vecciola and Selvi, Mastering Cloud Computing: Foundations and

Applications Programming, Tata McGraw Hill

• Aravind Doss, Cloud Computing, Tata McGraw Hill

Course Code MCS E401B


Course Title Mobile Computing (MCSE401B)


4 1 0 4



Introduction and Application of Mobile Computing

Wireless Transmission: Frequency for radio transmission, Signals, Antennas, Signal propagation,

Multiplexing, Modulation, Spread spectrum, Cellular systems

Medium Access Control:

Motivation for a specialized MAC: Hidden and Exposed terminals. Near and Far terminals;

SOMA, FOMA

TOMA: Fixed TOM, Classical Aloha, Slotted Aloha, Carrier sense multiple access, Demand

assigned multiple access, PRMA packet reservation multiple access, PRMA packet reservation

multiple access, reservation TOMA, Multiple access with collision avoidance, Polling, Inhibit

sense multiple access

CDMA: Spread Aloha multiple access

Telecommunication Systems: GSM: Mobile Services, System Architecture, radio interface,

Protocols, Localization and Calling, Handover, Security, New Data Services, DECT, Systems

Architecture

Protocol Architecture:

TETRA I, UMTS and IMT-2000, UMTS Basic Architecture, UTRA FDD mode, UTRA TDD

mode

Satellite Systems: History, Applications, Basics: GEO, LEO, MEO, Routing, Localization.

Handover

Examples Broadcast Systems: Overview, Cyclic Repetition, Digital Audio; broadcasting:

Multimedia object transfer Protocol; Digital Video broadcasting

Wireless LAN: Infrared vs. Radio Transmission, Infrastructure and Ad Hoc networks, IEEE

802.11: System Architecture, Protocol Architecture, Physical Layer, Medium Access Control

Layer, MAC management, Future development; HIPERLAN: Protocol architecture, Physical

Layer Channel access control. Sublayer, Medium Access control sublayer, Information bases and

networking;

Bluetooth: User Scenarios, Physical Layer, MAC layer, Networking, Security, Link management.

Wireless ATM: Motivation for WATM, Wireless ATM working group, WATM services,

Reference model: Example configurations, Generic reference model;

Handover: Handover reference model, Handover requirements, Types of handovers, Handover

scenarios, Backward handover, Forward handover; Location management: Requirements for

location management, Procedures and Entities; Addressing, Mobile quality of service, Access

point control protocol.

Mobile Network Layer: Mobile IP: Goals, assumptions and requirements, Entities and

Terminology, IP packet delivery, Agent advertisement and discovery, Registration, Tunneling and

Encapsulation, Optimizations, Reverse tunneling, Ipv6; Dynamic host configuration protocol, Ad

hoc networks: Routing, Destination sequence distance vector, Dynamic source routing,

Hierarchical algorithms, Alternative metrics.

Mobile Transport Layer: Traditional TCP: Congestion control, Slow start,

Fast retransmit/fast recovery, Implications on mobility; Indirect TCP, Snooping TCP,

Mobile rcp, Fast retransmit/fast recovery, Transmission/time- out freezing, Selective

retransmission, Transaction oriented TCP.

Support for Mobility:

File systems: Consistency, Examples; World Wide Web: Hypertext transfer protocol, Hypertext

markup language, Some approaches that might help wireless access, System architectures;

Wireless application protocol: Architecture, Wireless datagraram protocol, Wireless transport

layer security, Wireless transaction protocol, Wireless session protocol, Wireless application

environment, Wireless markup language; WML script, Wireless telephony application, Examples

"Stacks with WAP, Mobile databases, Mobile agents

Security and privacy aspects of Mobile Computing

Recommended Books:

1. Jochen Schiller, Mobile Communications, 2nd Edition, Pearson

2. William Stallings, Wireless Communications and Networks, PHI

3. Rappaport, Wireless Communications Principals and Practices, PHI

4. YI Bing Un , Wireless and Mobile Network Architectures, John Wiley

Course Code MCS E401C


Course Title Network Security (MCSE401C)


4 1 0 4



Concepts and Terminology:

Threats, Attacks, Services and Mechanisms, Security Attacks, Security Services, Integrity

check, digital Signature, authentication, Spoofing, Sniffing, Firewall.

Cryptography:

Techniques, Mathematical foundation, Stream Ciphers, Block Ciphers, Cryptanalysis, Hash

Algorithms.

Secret Key Cryptography:

Block Encryption, DES rounds, S-Boxes IDEA: Overview, comparison with DES, Key

expansion, IDEA rounds, Uses of Secret key Cryptography; ECB, CBC, OFB, CFB, Multiple

encryptions DES.

Hash Functions and Message Digests:

Length of hash, uses, algorithms (MD2, MD4, MD5, SHS) MD2: Algorithm (Padding,

checksum, passes.) MD4 and 5: algorithm (padding, stages, digest computation.) SHS:

Overview, padding, stages.

Public key Cryptography:

Algorithms, examples, Modular arithmetic (addition, multiplication, inverse, and

exponentiation) RSA: generating keys, encryption and decryption. Other Algorithms: PKCS,

Diffie-Hellman, El-Gamal signatures, DSS, Zero-knowledge signatures.

Authentication:

Password Based, Address Based, Cryptographic Authentication. Passwords in distributed

systems, on-line vs offline guessing, storing. Cryptographic Authentication: passwords as keys,

protocols, KDC’s Certification Revocation, Inter-domain, groups, delegation. Authentication of

People: Verification techniques, passwords, length of passwords, password distribution, smart

cards, biometrics.

Security Policies and Security Handshake Pitfalls:

What is security policy, high and low level policy, user issues? Protocol problems,

assumptions, Shared secret protocols, public key protocols, mutual authentication, reflection

attacks, use of timestamps, nonce and sequence numbers, session keys, one-and two-way

public key based authentication.

Network Security:

Electronic mail security, IP security, Network management security.

Security for electronic commerce: E-commerce security analysis, protocol, SSL, SET System

Security:

Intruders and Viruses, Firewalls, Intrusion Detection.

Case Studies

Web threats, E-mail threats, Domain controller threats, Extranet and VPN threats. Assignment

and Project work.

Recommended Books:

Atul Kahate, Cryptography and Network Security, McGraw Hill

Kaufman, c., Perlman,R., and Speciner, M., Network Security, Private Communication in a public

world, 2nd ed., Prentice Hall PTR., 2002

Stallings, W.,.Cryptography and Network Security: Principles and Practice, 3rd ed., Prentice Hall

PTR.,2003

Stallings, W. Network security Essentials: Applications and standards, Prentice Hall, 2000

Cryptography and Network Security; McGraw Hill; Behrouz A Forouzan

Information Security Intelligence Cryptographic Principles andApp. Calabrese Thomson

D. P. Nagpal, Information Security, S. Chand Complany Limited

7. Securing A Wireless Network Chris Hurley SPD.



Course Title Data Warehousing & Mining

Contents

Scope of Data Mining and Warehousing, analysis of data, selection of

relevant models and algorithms for respective application, studying

spatial and web data, developing research interest towards advances in

data mining.


3 1 0 4

Pre-requisites (if any) Concept of programming language, Database Management System, Data

Structure & Algorithm, Basic Statistics Knowledge

Introduction (Chapter 1 of Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd

Edition)

1.1 Introduction

1.2 Data mining as a subject

Data Warehousing (Chapter 2 of Data Mining Techniques by Arun Kumar Pujari, University Press,

3rd Edition)

2.1 Introduction

2.2 What is a Data Warehouse?

2.3 Definition

2.4 Multidimensional Data Model

2.5 OLAP operation

2.6 Warehouse Schema

2.7 Data Warehousing Architecture

2.8 Warehouse Server

2.9 Metadata

2.10 OLAP Engine

2.11 Data Warehouse Backend Process

2.12 Other Features

Data Mining (Chapter 3 of Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd

Edition)

3.1 Introduction

3.2 What is Data Mining?

3.3 Data Mining Definitions

3.4 KDD vs. Data Mining

3.5 DBMS vs DM

3.7 DM Techniques

3.8 Other Mining Problems

3.9 Issues and Challenges in DM

3.10 DM Application Areas

3.11 DM Applications-Case Studies

3.12 Conclusion

Association Rules (Chapter 4 of Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd

Edition)

4.1 Introduction

4.2 What is an Association Rule?

4.3 Methods to Discover Association Rules

4.4 A Priori Algorithm

4.5 Partition Algorithm

4.7 Dynamic Itemset Counting Algorithm

4.8 FP Tree Growth Algorithm

4.12 Generalized Association Rule

4.13 Association Rules with Item Constraints

Clustering Techniques (Chapter 5 of Data Mining Techniques by Arun Kumar Pujari, University

Press, 3rd Edition)

5.1 Introduction

5.2 Clustering Paradigms

5.3 Partitioning Algorithms

5.7 Hierarchical Clustering

5.11 Categorical Clustering Algorithms

5.15 Conclusion

Decision Trees(Chapter 6 of Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd

Edition)

6.1 Introduction

6.2 What is a Decision Tree?

6.3 Tree Construction Principle

6.4 Best Split

6.5 Splitting Indices

6.7 Decision Tree Construction Algorithms

6.13 Decision Tree Construction with Presorting

6.18 Pruning Techniques

Other Techniques (Chapter 7 of Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd

Edition)

7.1 Introduction

7.2 What is a Neural Network?

7.3 Learning in NN

7.4 Unsupervised Learning

7.5 Data Mining using NN: A Case Study

7.6 Genetic Algorithm

7.7 Rough Sets

7.8 Support Vector Machines

7.9 Conclusion

Web Mining (Chapter 8 of Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd

Edition)

8.1 Introduction

8.2 Web Mining

8.3 Web Content Mining

8.4 Web Structure Mining

8.5 Web Usage Mining

8.6 Text Mining

8.7 Unstructured Text

8.10 Text Clustering

8.11 Conclusion

Recommended Books:

1) Data Mining Techniques by Arun Kumar Pujari, University Press, 3rd Edition

Course Code MCS E402B


Course Title Soft Computing (MCSE402B) Schemes and Credits L T P Credits Semester-IV

3 1 0 4



Neural Networks: Supervised Learning Neural Networks – Perceptrons - Adaline – Back

propagation Multilayer Perceptrons – Radial Basis Function Networks – Unsupervised

Learning Neural Networks – Competitive Learning NetworksHebbian Learning.

Fuzzy Set Theory: Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic

Definition and Terminology – Set-theoretic Operations – Member Function Formulation and

Parameterization – Fuzzy Rules,Introduction to Fuzzy Reasoning – Extension Principle and

Fuzzy Relations

Genetic Algorithm: Difference between Traditional Algorithms and GA, The basic operators,

Schema theorem, convergence analysis, stochastic models, applications in search and

optimization. Encoding, Fitness Function, Reproduction, Cross Over, Mutation, Application of

Genetic Algorithm.

Neuro Fuzzy Modeling: Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid

Learning Algorithm – Learning Methods that Cross-fertilize ANFIS and RBFN – Coactive

Neuro Fuzzy Modeling – Framework Neuron Functions for Adaptive Networks – Neuro Fuzzy

Spectrum.

Recommended Books:

M. Mitchell, An Introduction to Genetic Algorithms, Prentice-Hall, 1998.

D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-

Wesley, 1989.

S. V. Kartalopoulos, Understanding Neural Networks and Fuzzy Logic: Basic Concepts and

Applications, IEEE Press - PHI, 2004.

S. Rajasekaran & G. A. Vijayalakshmi Pai, Neural Networks, Fuzzy Logic and Genetic

Algorithms: Synthesis & Applications, PHI, 2003.

S. N. Sivanandam & S. N. Deepa, Principles of Soft Computing, Wiley - India, 2007



Course Title Social Network Analysis (MCSE402C)


3 1 0 4



Introduction to Social Network Analysis: The Social Network Perspective, Historical

Foudations, Fundamental Conc epts in Network Analysis, Distinctive Features of Social

Network, Related statistical tools of Social Networks

Mathematical Representation of Social Networks: Notation for Social Network Data, Graph

Theoretic Notation, Sociometric Notation, Algebraic Notation, Graphs and Matrices

Graphic Techniques for Exploring Social Network Data and Centrality: Degree centrality,

Betweenness centrality, Closeness centrality, Igenvector centrality, Transitivity and

Reciprocity

Software for Social Network Analysis: Introduction to the Tools of Social Networks, Overview

on Gephi and Netlogo

Models and Methods in Social Network Analysis: Random Graph Model, Small World Model,

Preferential Attachment Model and power-laws

Diffusion on Networks: Information Diffusion and Cascade Model, Epidemics – SIR & SIS

Model, Threshold Model, Simple and complex contagion

Application of Data Mining in Social Networks: Overview on Data Mining and its various

techniques, Overview on Web Mining

Recommendation system: Concept, Content-based method, Collaborative filtering,

Applications

Recommended Books:

1. David Easley and Jon Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly

Connected World, Cambridge University Press, 2010

2. Zafarani, Abbasi and Liu, Social Media Mining: An Introduction, Cambridge University Press, 2014

Practical Papers

Data Warehousing & Mining Lab (MCS492A)

Software Tools: Weka/SPSS/R/Oracle

Data exploration and visualization , Statistical analysis

Association Rule mining, Classification, Clustering, Developing small application/ program

Soft Computing Lab (MCS492B)

Basic skills lab using Guaje Fuzzy/Fingram Generator Genetic

Algorithm,Fuzzy System,Artificial Neural Network

Social Network Analysis Lab (MCS492C)

Software Tools: Netlogo, Gephi/Pajek Measuring Network,

Community Detection,

Random Graph Generation,

Giant Component, Preferential Attachment, Community Detection, SIR & SIS Model

Paper Name: Numerical Analysis

Code: MOOCs (MCS)-421

Contacts:3L+1T

Credits: 5

Course Code BMN401

Category Computer Application Course

Course Title Numerical Analysis


3 1 0 5

Pre-requisites (if any) Data Communication and Networking, Python, Java

Causes and Estimation of Error in Calculation (Chapter 1, Numerical Analysis and Computational

Procedures, 3rd Edition, S.A. Mollah)

1.2 Numbers: Exact and Approximate

1.3 Rounding off Error

1.4 Significant Errors

1.5 Errors: Absolute, Relative and Relative Percentage Errors

Calculus of Finite Differences (Chapter 2, Numerical Analysis and Computational Procedures, 3rd

Edition, S.A. Mollah)

2.2 Forward Differences

2.3 Backward Differences

2.6 Shift operator E and it’s Relations with Difference Operator Δ

Interpolation with Equal and Unequal Intervals (Chapter 3, Numerical Analysis and

Computational Procedures, 3rd Edition, S.A. Mollah)

3.1 Introduction

3.2 Newton’s Forward Interpolation Formula

3.3 Newton’s Backward Interpolation Formula

3.10 Lagrange’s Interpolation Formula

3.24 Newton’s Divided Difference Formula

Numerical Integration (Chapter 5, Numerical Analysis and Computational Procedures, 3rd Edition,

S.A. Mollah)

5.3 Trapezoidal Rule

5.4 Simpson’s One-third Rule

5.6 Weddle’s Rule

Solution of Algebraic and Transcendental Equations (Chapter 6, Numerical Analysis and

Computational Procedures, 3rd Edition, S.A. Mollah)

6.3 Method of Bisection

6.4 Method of Iteration or Fixed-Point Iteration

6.7 Newton-Raphson Method

6.10 Regula Falsi Method or method of False Position

System of Linear Algebraic Equations (Chapter 7, Numerical Analysis and Computational

Procedures, 3rd Edition, S.A. Mollah)

7.2 Gauss Elimination Method

7.4 Gauss-Jacobi Iteration Method

7.8 Gauss-Seidel Iteration Method

7.11 Matrix Factorization Method

Numerical Solution of Ordinary Differential Equation of First order (Chapter 8, Numerical

Analysis and Computational Procedures, 3rd Edition, S.A. Mollah)

8.2 Euler’s Method

8.4 Euler’s Modified Method (Euler- Cauchy Method)

8.8 Taylor’s Series Method

8.10 Runge – Kutta Method

Suggested Books:

Numerical Analysis and Computational Procedures, 3rd Edition, S.A. Mollah

PAPER NAME: INTERNET OF THINGS

PAPER CODE: MOOCs (MCS)-422

CONTACT HOUR: 3L+1T

CREDIT: 5

Course Code BCAN-404

Category Computer Application Course

Course Title Internet of Things

Contents

i) Introduction of IoT ii) Layers of IoT iii) Sensing Technology iv) IoT

Protocol v) Issues and challenges of IoT vi) Case Study


3 1 0 5

Pre-requisites (if any) Data Communication and Networking, Python, Java

Module-1

Introduction to IoT and Sensing (Chapter 1 “Internet of Things a Hands-On Approach” by Arshdeep Bahga,

Vijay Madisetti)

Introduction to IoT, Characteristics of IoT, Physical design of IoT, Logical design of IoT, Functional blocks of

IoT, Sensing, Edge computing, Data processing, Learning.

Different type of sensors, working principal of some sensors like Ultrasonic sensor, Thermal Sensors, Infrared

Sensors, Pollutant Sensors, pH, Turbidity, Dissolved oxygen sensor, Temperature, water flow sensors etc.

Module-2

IoT & M2M (Chapter 3 “Internet of Things A Hands-On Approach” by Arshdeep Bahga, Vijay Madisetti)

Machine to Machine, Difference between IoT and M2M, Software defined Network

Module-3

Sensing Layer and Microcontroller/Microcomputer (Chapter 1 “Internet of Things A Hands-On Approach”

by Arshdeep Bahga, Vijay Madisetti)

Open-source hardware, Play with Sensors using Arduino Programming, Local data processing using Raspberry

Pi/Uddo Neo, Play with different Network Modules (Bluetooth, WiFi, GSM/GPRS)

Module-4

Wireless Networks Present and Future (Chapter 2 "The Internet of Things: Enabling Technologies, Platforms,

and Use Cases", by Pethuru Raj and Anupama C. Raman (CRC Press))

Concept of TCP/IP protocol Stack, 802.11 Protocol (WiFi Network), Wireless medium access issues, LoRa

Network, Acoustic Communication, Socket Programming, Wireshark Tool,

Module-5

IoT Protocol Design (Chapter 3 "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by

Pethuru Raj and Anupama C. Raman (CRC Press)) QUIC Protocol, CoAP, MQTT

Module-6

Challenges in IoT (Chapter 12 "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by

Pethuru Raj and Anupama C. Raman (CRC Press)) Design challenges, Development challenges, Security

challenges, Other challenges

Module-7

Case Study of IoT Based Applications (Chapter 2 “Internet of Things A Hands-On Approach” by Arshdeep

Bahga, Vijay Madisetti)

Case Study 1: (activity Identification) Human Activity using Ultra sonic Sensors/Thermal Sensors,

Case Study 2: (Environment Monitoring) Pollution Monitoring and Forecasting in Indoor and Outdoor,

Case Study 3: (Road Transportation System) (a)Important PoIs using GPS trails, (b)Context Aware Speed

Profiling from Mobile Phone Sensors, (c)My Smartphone Can Monitor My Street-lights

Case Study 4: (Challenged Networks) Offline Crisis Mapper Design using ChatBot, IoT Protocol Stack

Development using Acoustic Communication

Case Study 5: (Agriculture Monitoring): Smart Farming using MQTT Protocol through Cost-effective

Heterogeneous Sensors

Course Outcomes

• Students will be able to deploy sensors and work with microcontroller.

• Students will be able to learn what are the layers of IoT and how to develop a framework.

• Students will be able to learn how to process the data and form a knowledge base from the data.

• Students will be able to learn about the application areas and challenges of IoT

Suggested Books:

1. "The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by Pethuru Raj and Anupama C.

Raman (CRC Press)

2. "Internet of Things: A Hands-on Approach", by Arshdeep Bahga and Vijay Madisetti (Universities Press)

Documents

Institute of Engineering & Management, Kolkata Department