Scheme of Teaching and Evaluation

M Tech (Computer Engineering) Semester II

Scheme of evaluation
Sr
No

Course Code

1
2

CO5005S
CO5006S

Course Title

L-T-P
(Hours/Week)

ESE

ESE(W)
(hrs)

Credits

TA

IST

20

20

60

20

20

60

20

20

60

Research Methodologies
Cloud Architecture
Infrastructure &
Technology.
Advanced Database
Management Systems
Advanced Database
Management Systems
Lab
Information Security

3-1-0=4

0-0-2=2

Information Security
Lab
Elective 3

3-0-0=3

20

20

60

Elective 4

3-0-0=3

20

20

60

Elective 4 Lab

0-0-2=2

100% CIE

Technical Seminar *

0-0-4=4

2
25

100% CIE

CO5007T
CO5007P

CO5008T
CO5008P

CO5801D

3-1-0=4
3-0-0=3
0-0-2=2

1
100% CIE

3-0-0=3

30
Total
*Will be able into aspects of language proficiency
Elective 3:

20

20

CO5109S

Software Project Management

CO5110S

Programming Paradigms For Concurrency Control

3
4

CO5111S
CO5112S

Parallel & Distributed Algorithms

Big Data Analytics

CO5113S

Real Time Systems

Elective 4:

100% CIE

60

CO5114T

Network Attacks and Defense Mechanisms

CO5114P

Network Attacks and Defense Mechanisms Lab

CO5115T

Web Services and Service Oriented Architecture

CO5115P

Web Services and Service Oriented Architecture Lab

CO5116T

Distributed & Cloud Database System

CO5116P

Distributed & Cloud Database System Lab

CO5117T

Pattern Recognition

CO5117P

Pattern Recognition Lab

CO5118T

Graph Mining

CO5118P

Graph Mining Lab

CO5119T

Multi Core Architecture and Parallel Algorithms

CO5119P

Multi Core Architecture and Parallel Algorithms Lab

Total for Semester

Total Hours

Credits

18

10

30

25

Abbreviations: Lectures, T: Tutorial, P: Practical, TA: Teacher Assessment, IST: In Semester Test/s,
ESE (W):End Semester Written Examination, ESE (W) (hrs): End Semester Written Examination
duration
Programme
Name

: M. Tech. (Computer Engineering)

Course Code

: CO5005S

Course Title

: Research Methodologies

SEMESTER II

Prerequisites: statistics
Course Objectives
1. Demonstrate familiarity with major concepts, theoretical perspectives, empirical findings,
and historical trends.
2. Understand and apply basic research methods including research design, data analysis, and
interpretation.
3. Propose a research study and justify the theory as well as the methodological decisions,
including sampling and measurement.
4. Understand the importance of research ethics and integrate research ethics into the research
process.
Course Outcomes
1. To define research and describe the research process and research methods.
2. To understand the processes and requirements for conducting successful research.
3. To know how to apply the basic aspects of the research process in order to plan and execute a
research
project.
4. To be able to present, review and publish scientific articles.
Course Contents

Introduction to Research Methods: Definition and Objectives of Research, 10

Various Steps in Scientific Research, Types of Research; Research Problem ,
Research Design , Survey Research - Case Study Research

Sampling and Data Collection : , Sampling , Sampling errors, Non sampling 15

errors, Measurement and Scaling techniques , Methods of data collection: Primary
Data, Secondary Data; Procedure Questionnaire, Survey and Experiments , Design
of Survey and Experiments , Sampling Merits and Demerits , Control
Observations , Procedures, structured problems and algorithms , Efficient data
reduction methods & strategies for optimization

Computer Application in Research Methodology: SPSS software ,Descriptive

statistics ,Bivariare statistics ,Regression analysis, Data Processing and
Modeling :Data processing & Measures Mathematical model formulation for
queries using relational algebra, set theory & functions , Design of software
Architecture ,Database design ,Algorithm Design ,GUI design ,

20

Model Building and Decision making :,Model building and decision making
,stages in model building and types of decision making models, Probability
Distributions, Fundamentals of Statistical Analysis and Inference, Correlation
and Regression ,Classification ,Clustering

20

Report writing: Structure and Components of Research Report, Types of

Report, Layout of Research Report, Writing research proposal ,Mechanism of
writing a research report, Performance evaluation and curve fitting, Result
declaration by various graphs & charts

15

Application Of Results and Ethics , Environmental impacts , Ethical issues ,

ethical committees , Commercialization , Code of Research Ethics Intellectual
property rights: ,Trademark ,Copyright, Patent ,Plagiarism , royalty, Citation
and acknowledgement , Reproducibility and accountability ,IT Act.

10

Case Studies

10

Text Books
1

Research Methodology by G.C.Ramamurthy Dreamtech Publications

C.R. Kothari, Research Methodology Methods and Techniques, 2/e, VishwaPrakashan,

2006

Reference Books
1

Engineering Optimization methods and applications A.ravindran ,Wiley publication

Donald R. Cooper, Pamela S. Schindler, Business Research Methods, 8/e, Tata

McGraw-Hill Co. Ltd., 2006.

Programme
Name

M. Tech. (Computer Engineering )

Course Code

CO5006S

Course Title

Cloud Architecture ,Infrastructure and Technology

Prerequisites: distributed computing

Course Objectives
1. Student will learn basics of cloud computing
2. Students will learn virtualization
3. Student will learn Hypervisor
Course Outcomes
1.
2.
3.

Students will be able to design Cloud Applications.

Students will be able to handle data in cloud .
Students will be able to use virtualization.

Course Contents
1. Cloud Computing Fundamentals :Cloud Computing definition, private,
public and hybrid cloud. Cloud types; IaaS, PaaS, SaaS. Benefits and
challenges of cloud computing, public vs private clouds, role of
virtualization in enabling the cloud; Business Agility:. Application
availability, performance
2. Cloud Architecture : Benefits and challenges to Cloud architecture ,Cloud
application architecture
3. Cloud Infrastructure : Cloud Infrastructure models, Scaling cloud
Infrastructure ,Cloud scale
4. Cloud Computing Technology : Hardware and Infrastructure : Clients
thin, thick ,security, data leakage, offloading work ,Network: basic public
internet, the accelerated internet optimized internet overlay ,site-to-site vpn,
cloud providers ,cloud consumers ,redundancy
,services ,identity
integration, mapping
,payments , search , Virtualization technology ,
Hypervisor ,Accessing the Cloud : Platforms , Web Applications , Web
APIs , Web Browsers ,Cloud Storage: Storage as a Service , Providers ,
Cloud Storage Providers , Standards
5. Application Development: Service creation environments to develop
cloud based applications. Development environments for service
development; Amazon, Azure, Google App ,
6. Data in Cloud :Cloud file systems :GFS ,HDFS ,Bigtable ,Hbase and
Dynamo ,Cloud store :Datastore ,simpleDB ,Map reduce : Map reduce
Model , Parallel efficiency of Map reduce ,Map reduce examples
7. Security in Cloud :Infrastructure Security, Data Security and Storage,
Security Management in Cloud Computing , Multi-tenancy Issues: Isolation
of users/VMs from each other., Virtualization System Security Issues: e.g.
ESX and ESXi Security, ESX file system security, storage considerations,
backup and recovery; Virtualization System Vulnerabilities,VM
vulnerabilities, guest VM vulnerabilities, hypervisor vulnerabilities
8. Different cloud Environments :Eucalyptus ,Azure, Aneka, Openstack

10

10
10
10

10

10

10

10

1. Conventional Encryption : Algorithms, Confidentiality Using Conventional 10

Encryption Public Key Cryptography, Message Authentication and Hash
Functions Hash and MAC Algorithms
2. Storage Introduction:,Need for storage networking SAN, NAS, SAN/NAS 10
Convergence .Distributed Storage Systems,

Text Books
1
2
3

Toby Velte, Anthony Velte, Robert Elsenpeter, Cloud Computing, A Practical Approach McGrawHill Osborne Media; 1 edition [ISBN: 0071626948], 2009.
Gautam Shroff, Enterprise Cloud Computing Technology Architecture Applications
[ISBN: 978-0521137355].

Mastering Cloud Computing by Prof. Raj Buyya ISBN: 9781259029950 Mc-Graw

Hill

Reference Books :
Greg Schulz, Cloud and Virtual Data Storage Networking, Auerbach Publications [ISBN: 9781
1439851739], 2011

Cloud Security and Privacy: An Enterprise Perspective.. by Tim Mather

Cloud Application Architectures: Building Applications and Infrastructure in the Cloud

George Reese

Programme Name

M. Tech. (Computer Engineering)

Course Code

CO5007T

Course Title

Advance Database Management Systems

Prerequisites: Database Systems, Relational Database Concepts, Relational Algebra, SQL

Course Objectives
1. To comprehend the essential principles of the design, analysis and use of
contemporary DBMS systems.
2. To implement Web database applications that interact with a back end DBMS.
3. To familiarize with techniques associated with data integration.
4. To implement web data mining application and its data integration.
Course Outcomes
1. Ability to understand the distributed concurrency control, database recovery, query
optimization, spatial databases, parallel database, deductive database, multimedia
database.
2. Ability to understand the background and knowledge of some contemporary topics in
database research; typical topics are data mining, uncertainty data management, XML
data.
3. Ability to understand the information management, cloud computing, web
information management and social network technology.
4. Ability to understand and apply the techniques to web data mining.
Course Contents
1. Multimedia Databases : multimedia database system fundamentals , multimedia 10
data access, multimedia information modeling and querying , multimedia database,
multimedia communication, multimedia
storage and retrieval, multimedia
programming
2. Spatial Databases :Types of spatial data and queries, application involving spatial 10
data. spatial indexes, indexing based on space filling curves, grid files, r-trees: point
and region data, high dimensional indexing ,spatial database programming
3. Distributed Database :Distributed dbms, data fragmentation, replication, and 10
allocation techniques for distributed database design, query processing in distributed
databases.
4. Parallel Database :Introduction, i/o parallelism, inter-query parallelism, intra-query 10
parallelism, intra-operation parallelism, inter-operation parallelism, design of
parallel systems. parallel query processing .

5. Building Operational Systems : Analysis& design of operational systems, data and 10

processing modeling using multimedia data, implementation of operational systems.
6. Building Data Warehouse : Modeling, architecture and practices, extraction, 10
transformation and loading, implementation of data warehouse & testing. tools :
informatica and cognoz .
7. Data Mining: Classification, clustering, association, multimedia data mining. Web 10
mining
8. Database Administration and security
10

9. Transaction processing: concurrency control and recovery management

10

10. Case Studies and Applications

10

Text Books

Fundamentals of Database Management systems ,Elmasri ,Navathe ,Pearson

Education

Spatial database by Shashi shekhar,sanjay chawla Pearson education

Distributed database systems by chhanda ray Pearson publication

V.S. Subrahmanian, Multimedia database systems, Springer, 1996.

Reference Books

1.

Jiawei Han and Micheline Kamber, Data Mining concepts and Technique, 3rd
Edition, Morgan Kaufmann, 2012.

2.

Rajan Chattamvelli, Data Mining Methods, Alpha Science International, 2009.

3.

Thomas Connolly and Carolyn Begg, Database Systems 3rd Edition, Addison-Wesley,
2005.

Programme Name

M. Tech. ( Computer Engineering )

Course Code

CO5007P

Course Title

Advance Database Management Systems Lab

Course Prerequisites: Database management systems

Course Objectives
1. Know database implementation and tools.
2. Introduce object databases, databases that handle complex data types.
3. Understand the difference between object-oriented databases and object-relational
databases.
4. Identify and understand the components of warehousing.

Course Outcomes
1. Understand operational database, warehousing and multidimensional need of data
base to meet industrial needs.
2. Explain the Database Security and Authorization.
3. Identify and understand the Business analysis, query tools and application, OLAP
etc.
4. Introduce with and gain knowledge about data mining, decision tree, neural networks
and clustering.
Course Contents
1.

Building Multimedia database systems

15

2.

Building Spatial database systems

10

3.

Building distributed & parallel database system

15

4.

To Build Data ware house system using oracle

15

5.

To apply data mining Algorithms on the data

15

6.

To study ETL Tools and Reporting tools and its application/use in 15

building data ware house system

7.

Database administration and security

15

Text Books
1

Fundamentals of Database Management systems ,Elmasri ,Navathe ,Pearson Education

Spatial database by Shashi shekhar,sanjay chawla Pearson education

Distributed database systems by chhanda ray Pearson publication

V.S. Subrahmanian, Multimedia database systems, Springer, 1996.

Reference Books
1

Jiawei Han and Micheline Kamber, Data Mining concepts and Technique, 3rd
Edition, Morgan Kaufmann, 2012.

Rajan Chattamvelli, Data Mining Methods, Alpha Science International, 2009.

Thomas Connolly and Carolyn Begg, Database Systems 3rd Edition, AddisonWesley, 2005.

Shashi Shekhar and Sanjay Chawla, Spatial Databases, Pearson Education,

2009.
M. Tech. ( Computer
Engineering)

Programme Name

Course Code

: CO5008T

Course Title

: Information Security

SEMESTER II

Prerequisites: Computer Networks, Operating Systems, DBMS

Course Objectives
1. The course provides a comprehensive view of the Information security principles
and measures to prevent vulnerability and security attacks.
2. To learn Program Security, System Security
3. To learn Network and Web Security
Course Outcomes
1. Understands the concept of threats, vulnerability and control
2. Will able to code: security in programs, including applications, operating
systems, database management systems and networks.
3. Understands the fundamental concepts of web security.
4. Understands security law, privacy, ethics: non-technical approaches by which
society controls computer security risks
Course Contents
1.

Cryptography : : introduction: what does security mean? , attacks , computer 10

security , computer criminals, Security Services, Security Mechanisms ,A Model
for Network Security ,DES ,AES,RSA ,Diffie-Hellman Key Exchange, Hash
Algorithm ,Digital signature , Cryptanalysis

2. Program Security: secure software architecture design, architectural risk 10

analysis , threat analysis , attack patterns , common software code
vulnerabilities , software security testing , non-malicious program errors ,
virus and other malicious code , control against threats.
3. Database Security : vulnerabilities in database , security requirements , 10
reliability and integrity , sensitive data , inference , multilevel database ,
proposal for multilevel security , defense mechanism ,data mining and
security
4. Web Security: web security: obfuscation , web sites , web servers , web 10
browsers , attacking application logic , attacking users: sql injection, cross-site
scripting , a web application hackers methodology, attacks and defense
mechanisms, Attacking web authorization , Attacking web authentication
,Attacking web application ,Web hacking tools
5. System Security : protection in general-purpose operating system: 20
vulnerabilities in operating system ,security and controls , protected objects
and methods of protection ,memory and address protection , control of access
to general objects , local access control (case study - linux) , user
authentication, os hardening
6. Network Security: vulnerabilities in network and web , network security 25
controls , firewalls , intrusion detection systems , network layer, transport
layer, application layer vulnerabilities , routing protocol vulnerabilities,
Security protocols vulnerabilities ,attacks and defense mechanisms
7. Digital Forensic Analysis : Forensic terminology and developing forensic 15
science capabilities: traditional problems in computer investigations ,
processing crimes and incident scenes , working with dos and windows
systems , current computer forensic tools , recovering graphic files , network
forensic , email investigations , Processing of Evidence and Report
Preparation

Text Books
1

Charles P. Pfleeger, Security in Computing, Prentice Hall Publication.

Benard Menezes Network security and Cryptography Cengage learning

publications

Kamini C. Nalavade, Dr. B. B. Meshram, Network Attack and Defense

Mechanisms, Research India Publications.

Reference Books
1

Hacking Exposed Web Applications, 3rd Edition By Joel Scambray, Vincent Liu, Caleb
Sima, MC-Graw Hill

Computer Forensics JumpStart by Michael G. Solomon ,Diane Barrett, Neil

Broom SYBEX publications
Marjie Britz, Computer Forensic and Cyber Crime, Pearson.

3
4

Nelson, Phillips, Enfinger, Steuart, Computer Forensic and Investigations, Cengage

Learning, India Edition.

Programme
Name

M. Tech. ( Computer Engineering)

Course Code

CO5008P

Course Title

Information Security Lab

SEMESTER II

Course Prerequisites: Computer Networks, Operating Systems, DBMS

Course Objectives

1. The course provides a comprehensive view of the Information security principles

and measures to prevent vulnerability and security attacks.
2. To learn Program Security, System Security
3. To learn Network and Web Security
Course Outcomes

1. Understands the concept of threats, vulnerability and control

2. Will able to code: security in programs, including applications, operating
systems, database management systems and networks.
3. Understands the fundamental concepts of web security.
4. Understands security law, privacy, ethics: non-technical approaches by which society
controls computer security risks
Course Contents
1 Program Security: For the given case study apply secure software life cycle.
2 System Security: Information system security management, Study of Windows
security, UNIX and Linux Security.
3 Database Security: Data Management, security Management, Performance
Monitoring, backup and recovery using oracle
4 Web Security: Web Browser and Client Security, Web Security, Electronic Mail
Security, Server Security,
5 Network Security: Network monitoring, Host monitoring, Network scanning
Network attacks and Defense Mechanism tools, Firewalls, IDS.
6 Study of Network Monitoring and analysis Tools: Wireshark, PacketTracer,
NetworkMiner, ntopng, Vulnerability scanning :Nessus,Nikto, webInspect etc

10
20
10
10
10

20

Digital Forensic Analysis: Case Study on Forensic analysis and documentation,

Integrated Cyber Security. Forensic tools and Antiforensic tools
Text Books

20

1 Charles P. Pfleeger, Security in Computing, Prentice Hall Publication.

2 Benard Menezes Network security and Cryptography Cengage learning
publications
3 Kamini C. Nalavade, Dr. B. B. Meshram, Network Attack and Defense
Mechanisms, Research India Publications.
Reference Books
1 Hacking Exposed Web Applications, 3rd Edition By Joel Scambray, Vincent Liu, Caleb
Sima, MC-Graw Hill

2 Computer Forensics JumpStart by Michael G. Solomon ,Diane Barrett, Neil

Broom SYBEX publications
3 Marjie Britz, Computer Forensic and Cyber Crime, Pearson.
4 Nelson, Phillips, Enfinger, Steuart, Computer Forensic and Investigations,
Cengage Learning, India Edition.
Programme Name

: M. Tech. ( Computer Engineering )

Course Code

: CO5109S

Course Title

: Elective 3 Software Project Management

SEMESTER II

Prerequisites: Project Management

Course Objectives
1. The course provides a comprehensive view of Software Project Management
2. To learn Managing people
Course Outcomes:
1. Understands the concept of Software Project Management
2. Understands the fundamental concepts of Project Evaluation.
Course Contents:
1.

Introduction To Software Project Management: Project Definition , 10

Contract Management , Activities Covered By Software Project
Management , Overview Of Project Planning , Stepwise Project
Planning.

2.

Project Evaluation: Strategic Assessment , Technical Assessment , 10

Cost Benefit Analysis ,Cash Flow Forecasting , Cost Benefit
Evaluation Techniques , Risk Evaluation.

3.

Structured Project Management: : Software Project Planning: 20

Software
scope ,Resources, Software Project Estimation
,Decomposition Techniques ,Empirical Estimation Model , Risk
Analysis: Identification; Risk Projection; Assessment; Monitoring and
Managing
the
Risk

4.

Project Scheduling: Project Scheduling Relationship between people 15

and efforts ,Defining task set of project ,Selecting software engineering
Tasks ,Defining a task network ,Scheduling

5.

Object Oriented Software Project Management :Technical metrics 20

for Object Oriented systems ,Metrics for OO Design model ,class
oriented metrics ,Operation oriented Metrics ,Metrics for object
oriented testing ,Metrics for object oriented Projects

6.

Web based Software Project Management: The attributes of web 15

based applications ,The WebE process ,framework for WebE,
Formulate web based systems ,Design for web based application

7.

Security in Software Project Management :Secure software life 10

cycle, Security in software project

Text Books:
1

Roger Pressman Software Engineering :A practitioner approach TMH

Bob Hughes, Mikecotterell, Software Project Management, Third Edition, Tata

McGraw Hill, 2004.

Reference Books:
1

Ramesh, Gopalaswamy, "Managing Global Projects", Tata McGraw Hill, 2001.

Royce, Software Project Management, Pearson Education, 1999.

Jalote, Software Project Management in Practice, Pearson Education, 2002.

Programme
Name

: M. Tech. ( Computer Engineering)

Course Code

: CO5110S

Course Title

SEMESTER II

Elective 3 Programming Paradigms for Concurrency

control

Prerequisites: operating system

Course Objectives
1. To know basics of Programming Paradigms for concurrency.
2. To know the applications and case study of programming paradigms.
To know the problems and issues in transaction and message passing
programming paradigms.

Course Outcomes
1. To apply mutual exclusion, concurrent objects and Linearizability.
2. To analyze case study on lazy,lock-free implementation and its
properties.
3. To analyze performance and correctness issues in TM and message
passing paradigms.
Course Contents
1
2
3
4
5
6
7
8

Introduction: Shared objects and synchronization ,producer consumer problem,

parallel programming
Mutual exclusion: Time ,critical sections ,Thread solutions ,Filter lock

20

Theory of Concurrent Objects: concurrency and correctness, sequential objects

,Formal definitions ,Java Memory model , Proving Linearizability
Foundations of shared memory: The space of registers ,Register constructions
,atomic snapshots
Monitors and Blocking synchronization :Introduction,Monitor lock and
conditions, Reader writer locks ,Semaphores
Case study: Concurrent Linked Lists fine-grained locking, optimistic, lazy, lockfree implementations
Introduction to transactional memories: Introduction, Hardware
TM,Transactions and atomicity ,Hardware TM , Software transactional memories
Linked list :Introduction ,List based sets ,concurrency reasoning ,fine grained
synchronization

20

10

10
10
10
10
10

Text Books:
1

The Art of Multiprocessor Programming. Herlihy and Shavit, Morgan Kaufmann,

2008.

Concurrent Programming in ML. Reppy, Cambridge University Press, 1999.

Programme Name

: M. Tech. ( Computer Engineering )

Course Code

Course Title

: Elective 3 Parallel and Distributed Algorithms

CO5111S

Course Prerequisites: Data Structure, Algorithms.

Course Objectives
1. To provide students with contemporary knowledge in parallel and distributed
computing.
2. To equip students with skills to design and analyze parallel and distributed
applications.
3. To introduce basic algorithm, programming and Computer Engineering issues
associated with the development of parallel applications.

Course Outcomes
1. Understand the evolution of high performance computing with respect to laws and
contemporary notion that involves mobility for data, hardware devices and
software agents.
2. Understand, appreciate and apply parallel and distributed algorithms in problem
solving.
3. Evaluate the impact of network topology on parallel algorithm formulations and
traffic their performance.
Course Contents
1

Introduction to Distributed System: Defining distributed system, hardware 10

concepts, software concepts, architecture of distributed system, Distributed
algorithms.

Parallel architecture: Inter-process communication, Synchronization, Mutual 15

exclusion, Basics of parallel architecture, Parallel programming with message
passing using MPI

The Protocol Models: The transition systems and Algorithms, Properties of 10

transition system, Casual order of events and logical clocks, additional
assumptions and complexity.

Routing Algorithms and Deadlock-free packet switching: Destination- 20

based routing, All-pairs shortest path algorithm, Net change algorithm,
Routing with compact routing tables, Hierarchical routing, introduction to
packet-switching and deadlock in packet-switching network, structured
solution, and unstructured solutions.

Termination Detection: Introduction and definition, Computation trees and 10

forests, web-based solutions. other solutions.

Election Algorithms: Introduction, Ring Networks, Arbitrary network, The

Korach-Kuttan-Moran Algorithm, Introduction to anonymous networks, A
probabilistic election algorithm, two snapshot algorithms, preliminaries of
sense of direction and orientation, Election in rings and chordal rings,
computing in hypercubes and complexity related issues.

Synchrony in Networks: Introduction, Election in synchronous networks, 05

Synchronizer algorithm, Application: BFS

Fault tolerance in distributed system: Reasons to use fault tolerance 10

algorithms, Robust algorithms, stabilizing algorithms.

Fault tolerance in asynchronous and synchronous systems: Fault tolerance 05

in asynchronous systems: Impossibility of consensus, initially dead processes,
probabilistic consensus algorithm. Fault tolerance in synchronous systems:
Synchronous Decision Protocols, Authenticating, protocols, Clock
synchronization Failure detection and solving it with a Weakly accurate
detector

10

10 Principles of Parallel Algorithm Design: Decomposition Techniques, 05

Characteristics of task and interactions, Mapping technique for load balancing,
Method for containing Interaction overhead, Parallel algorithm model.

Text Books
1

Gerard Tel, Introduction to Distributed Algorithms, Cambridge University Press

Lynch, Nancy A. Lynch, Distributed Algorithms, The Morgan Kaufmann Series in

Data Management Systems, Book, ISBN: 1558603484

Introduction to parallel programming by Ananth Garma ,Anshul Gupta Pearson

Publication

Reference Books
1

George F. Coulouris, Jean Dollimore, Tim Kindberg, Distributed Systems: Concepts

and Design, Pearson Education

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5112S

Course Title

: Elective 3 Big Data Analytics

Prerequisites: Database Management System, Java, AI, Machine Learning.

Course Objectives
1. Being able to utilize and apply the data analytics lifecycle to big data analytics
projects.
2. Apply appropriate analytic technique and tools to analyze big data , develop ML
and statistical models and recognize insights that leads to actionable work items.
3. Have a basic understanding of R and RStudio, data visualization technique, as
well as hadoop.
Course Outcomes
1. Presented with data, students will choose the appropriate modeling technique,
build the model, check validity of the model and revise if necessary and employ
the model for estimation and prediction.
2. Students will propose and carry out projects , presenting results in written or oral
form.
3. Students will use the model statistical computing environments, SAS and R to
carry out
the analysis of data.
Course Contents
1 Introduction To Big Data: Introduction to BigData Platform , Challenges of 15
Conventional Systems , Intelligent data analysis , Nature of Data , Analytic
Processes and Tools , Analysis vs Reporting , Modern Data Analytic Tools ,
Statistical Concepts: Sampling Distributions , Re,Sampling , Statistical
Inference , Prediction Error.
2 Data Analysis: Regression Modeling , Multivariate Analysis , Bayesian 20
Methods , Bayesian Paradigm , Bayesian Modeling , Inference and Bayesian
Networks , Support Vector and Kernel Methods , Analysis of Time Series:
Linear Systems Analysis , Nonlinear Dynamics , Rule Induction , Fuzzy Logic:
Extracting Fuzzy Models from Data , Fuzzy Decision Trees

3 Search Methods and Visualization: Search by simulated Annealing , 25

Stochastic, Adaptive search by Evaluation , Evaluation Strategies , Genetic
Algorithm , Genetic Programming , Visualization , Classification of Visual Data
Analysis Techniques , Data Types , Visualization Techniques , Interaction
techniques , Specific Visual data analysis Techniques.
4 Mining Data Streams: Introduction To Streams Concepts , Stream Data Model 25
and Architecture , Stream Computing , Sampling Data in a Stream , Filtering
Streams , Counting Distinct Elements in a Stream , Estimating Moments ,
Counting Oneness in a Window , Decaying Window , Real time Analytics
Platform(RTAP) Applications , Case Studies , Real Time Sentiment Analysis,
Stock Market Predictions.
5 Frameworks: Map Reduce , Hadoop, Hive, MapR , Sharding , NoSQL 15
Databases - S3 - Hadoop Distributed, File Systems , Case Study.
TextBooks:
1 Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.
2 Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets,
Cambridge
University Press, 2012.
3 Bill Franks, Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics, John Wiley & sons, 2012.
4 Glenn J. Myatt, Making Sense of Data, John Wiley & Sons, 2007
Reference Books
1 Pete Warden, Big Data Glossary, OReilly, 2011.
2 Jiawei Han, Micheline Kamber Data Mining Concepts and Techniques, Second
Edition, Elsevier, Reprinted 2008.
3 Da Ruan, Guoquing Chen, Etienne E.Kerre, Geert Wets, Intelligent Data Mining,
Springer,2007
4 Paul Zikopoulos ,Dirk deRoos , Krishnan Parasuraman , Thomas Deutsch , James
Giles, David Corrigan , Harness the Power of Big Data The IBM Big Data Platform,
Tata McGraw Hill Publications, 2012
Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5113S

Course Title

: Elective3 :Real Time Systems

Course Prerequisites:
Course Objectives
1. To provide good understanding of fundamental concepts in real time systems.
2. To provide understanding of advanced topics in real time systems

SEMESTER II

Course Outcomes
1. Understand the basics and importance of real-time systems
2. To analyze Commercial RT Operating Systems
Course Contents

1. Introduction :Real-time systems, Applications ,Basic Model ,Characteristics

,Safety and Reliability, Real-Time tasks, Timing Constraints, Modelling Timing
Constraints.
2. Scheduling Real-Time Tasks :Concepts, Types of RT Tasks and their
Characteristics, Task Scheduling, Clock-Driven Scheduling ,Hybrid Schedulers Event-Driven Scheduling ,EDF Scheduling ,RMA Issues with RMA,Issues in
Using RMA in Practical Situations
3. Resource Sharing among RT Tasks & Scheduling RT Tasks: Resource
Sharing Among RT Tasks, Priority Inversion, PIP,HLP,PCP,Types of Priority
Inversions Under PCP, Features of PCP, Issues in using Resource Sharing
Protocol, Handling Task Dependencies, Multiprocessor Task Allocation,
Dynamic Allocation of Tasks, Fault-Tolerant Scheduling of Tasks,Clocks in
Distributed RT Systems , Centralized and Distributed Clock Synchronization.
4. Commercial RT Operating Systems :Time Services, Features of RT OS,Unix
as a RT OS,Unix Based RT OS, Windows as a RT OS,POSIX ,Survey of RTOS:
PSOS ,VRTX, VxWorks,QNX - C/OS-II,RT Linux,Lynx, Windows CE,
Benching RT Systems.
5. RT Communication & Databases :Examples of Applications Requiring RT
Communication, Basic Concepts ,RT Communication in a LAN, Soft & Hard RT
Communication in a LAN, Bounded Access Protocols for LANs, Performance
Comparison ,RT Communication Over Packet Switched Networks ,QoS
Framework ,Routing, Resource Reservation, Rate Control, QoS Models ,
Examples Applications of RT Databases, RT Databases ,Characteristics of
Temporal Data, Concurrency Control in RT Databases, Commercial RT
Databases.
6. Advances in Real time systems : Distributed real-time systems, multiprocessor
real-time systems
Text Books
1

Jane W. Liu, "Real-Time Systems" Pearson Education, 2001.

Rajib Mall, "Real-Time Systems: Theory and Practice," Pearson, 2008.

Reference Books
1

Krishna and Shin, "Real-Time Systems," Tata McGraw Hill. 1999.

Alan C. Shaw, Real-Time Systems and Software, Wiley, 2001.

10

20

20

10

20

20

Programme
Name

: M. Tech. (Computer Engineering)

Course Code

: CO5114T

Course Title

: Elective 4 Network Attacks and Defense Mechanism

SEMESTER II

Course Prerequisites: Computer Networks, Information security

Course Objectives
1. To gain the knowledge of Reconnaissance, Network Mapping and port scanning
techniques.
2. To understand Vulnerabilities of different layers.
3. To understand about attacks on different layers and also the defense strategies.
4. To know about the Network Infrastructure devices and Security &Controls.
Course Outcomes
1. They will be able to recognize Reconnaissance, Network Mapping and port scanning
Techniques.
2. They will be able to recognize Vulnerabilities of different layers.
3. They will be able to secure different layer by knowing different attacks and by using
the different defense strategies.
4. They will know about different Network infrastructure devices.
Course Contents
1. Network Interface Layer Protocols attacks, vulnerabilities and 10
defense mechanisms: PPP Protocol ,Ethernet ,ARP: Protocol,
vulnerabilities in ARP, attacks in ARP, defense mechanism for ARP ,
RARP: protocol, vulnerabilities in RARP , attacks in RARP, defense
mechanism for RARP
2. Network Layer Protocols attacks, vulnerabilities and defense 10
mechanisms: IPV4/V6: protocol, vulnerabilities in IP V4/V6 ,attacks
in IP V4/V6, defense mechanism for IP V4/V6, ICMP: Protocol
vulnerabilities in ICMP, attacks in ICMP, defense mechanism for
ICMP
3. Transport Layer Protocols: Attacks, vulnerabilities and Defense 20
mechanisms: TCP Protocol,. vulnerabilities in TCP,TCP Exploits ,
defense mechanism for TCP ,UDP Protocol,. vulnerabilities in
UDP,UDP Exploits , defense mechanism for UDP
4. Application Layer Protocol: DNS Protocol , vulnerabilities in 20
DNS,DNS Exploits , defense mechanism for DNS , SNMP Protocol ,
vulnerabilities in SNMP , attacks in SNMP , defense mechanism for
SNMP, FTP & TFTP Protocol , vulnerabilities in FTP & TFTP,
attacks in FTP & TFTP, defense mechanism for FTP & TFTP, HTTP
Protocol , vulnerabilities in HTTP, attacks in HTTP, defense
mechanism for HTTP, SMTP Protocol , vulnerabilities in SMTP ,
attacks in SMTP , defense mechanism for SMTP

5. Routing Protocols and Vulnerability, Attacks and Defense 20

mechanism: Routing information protocol(RIP), vulnerabilities in RIP
,attacks in RIP , defense mechanism for RIP , vulnerabilities in OSPF
,attacks in OSPF, defense mechanism for OSPF, vulnerabilities in
BGP ,attacks in BGP, defense mechanism for BGP , vulnerabilities in
EGP ,attacks in EGP, defense mechanism for EGP .
6. TCP/IP security protocols: vulnerabilities, attacks , defense 20
mechanism of following protocols: IP security(IPsec),Secure socket
layer,(SSL/TLS),secure shell(SSH),S/MIME architecture, Pretty good
privacy(PGP),DNS security
Text Books
1

Mrs.kamini Nalwade(Shirsath),Dr.B.B.Meshram Network Attack and Defense

Mechanism by Research India Publication ,Delhi

Reference Books
1

Kevin Lam, David LeBlanc, Ben Smith, Assessing Network Security , Publisher:
Microsoft Press Released: June 2004

Chris McNab ,Network Security Assessment, Publisher:O'Reilly Media

Released:March 2004

Susan Young, dave Aitel The hackers Handbook, Auerbach publications

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5114P

Course Title

Elective 4 Network Attacks and Defense Mechanism

Lab

Course Prerequisites: Data Structure, Algorithms, security

Course Objective:
1. Study of network attacks
2. To learn defense mechanism
3. To learn packet analysis
Course Outcomes
1) Will be able to recognize different attacks techniques.
2) Understands different defense techniques.
3) Understands different security tools and software.
Course Contents
1

Finding vulnerabilities in system

10

Port scan ,network scan

10

Attacks using Backtrack Operating system

20

Packet capture and analysis using wireshark

20

Configure Firewall

10

IDS-snort , IPS

10

Security services

20

Text Books
1

Mrs.kamini Nalwade(Shirsath),Dr.B.B.Meshram Network Attack and Defense

Mechanism by Research India Publication ,Delhi

Reference Books
1

Network Security Architecture By Sean Convery , ciscopress.

Network Security Bible second edition by eric cole

Programme Name
Course Code
Course Title

:
:
:

M. Tech. (Computer Engineering)

CO5115T
Elective 4 Web Services and Service Oriented Architecture

Course Prerequisites: Web Technologies

Course Objectives
1. Being able to utilize and apply the web technologies.
2. To learn Web Services
3. Have a basic understanding of soa lifecycle
Course Outcomes
1. Students will use the web services
2. Students will use service orientation
3. Students will use XML,BPEL in Service Oriented Architecture
Course Contents
1. Introduction: History of the Internet and World Wide Web 10
,HTML,HTTP, Introduction to JAVA Scripts ,Object Based Scripting for
the web. Structures ,Functions ,Arrays ,Objects, Dynamic HTML,
2. Web server:, Electronic Commerce ,E,Business Model ,Web Servers 10
,HTTP request types ,System Architecture ,Client Side Scripting and
Server side Scripting ,Accessing Web servers ,IIS ,Apache web server.
3. Web Services :XML,SOAP,WSDL,UDDI, Programming web services 20
,Restful example ,SOAP and REST
4. Service-Orientation: Introduction to service-orientation, Problems solved 10
by service-orientation, challenges introduced by service orientation,
Effects of service-orientation on the enterprise, Origins and influences of
service-orientation, Case study
5. Principles Of Service Oriented Computing: Use cases, Service oriented 10
Architectures , Composing services

6. Introduction to BPEL: File structure, scopes, message Exchange, 20

variables and XPath , BPEL Activity Highlights: Start and assign
activities; invoke, receive and reply activities. Web Service Application
with JAX-WS and SAAJ.
7. Service Contracts: Service Coupling Service Abstraction: Service 10
Reusability:
Service Autonomy Service Statelessness Service
Discoverability: Contract explained, profiling this principle, Types of
service contract standardization, Contracts and service design, Risk
associated with service contract design
8. SOA Security: SOA Security Goals and Fundamentals, Web Service 10
Security Standards and Specifications, SOA Security Blueprints. Claiming
and verifying identity with password, secure authentication with Kerberos

Text Books
1 Service oriented Computing by M.Singh ,M.Huhns Wiley Publication
2 SOA in practice by Nicolai M. Josuttis, OREILLY publications
Reference Books
1 Thomas Erl, SOA Principles of Service Design, 1st Edition, Prentice Hall,
2007.
2 SOA for business developer by Ben Margolis.
3 Enterprise SOA by Dan Woods and Tomas Mattern OReilly publication
Programme Name : M. Tech. (Computer Engineering)

SEMESTER II

Course Code

: CO5115P

Course Title

: Elective 4 Web Services and Service Oriented Architecture Lab

Course Prerequisites: Software Engineering

Course Objectives
1. To learn web service
2. To learn BPEL
3. To learn of SOA lifecycle
Course Outcomes
1. Students will be able to apply the web technogies
2 Students will be apply the techniques to implement xml schema
Course Contents
1 XML schema

20

2 Creation of web service

20

3 To create a web service for adding few numbers using NetBeans and write client
side code to invoke the web service

20

4 To create a web service for adding few numbers using NetBeans and write client
side code to invoke the web service.

20

5 Create a SOA project with BPEL Module to compose a web service.

20

Text Books
1 Michael Rosen, Applied SOA, 1st Edition, Wiley India, 2008
2 Shankar Kambhampaty, Service-Oriented
Applications, 1st Edition, Wiley, 2008.

Architecture

for

Enterprise

Reference Books
1 Thomas Erl, SOA Principles of Service Design, 1st Edition, Prentice Hall, 2007.
2 Ramarao kanneganti and Prasad Chodavarapu, SOA Security, 1st Edition, DreamTech
Press, 2008.

Programme
Name

M. Tech. (Computer Engineering )

Course Code

CO5116T

Course Title

Elective 4 Distributed and Cloud Database System

Prerequisites: Cloud Database, Map reduce

Course Objectives
1. To learn Web services and REST.
2. To learn distributed systems and cloud computing
3. To learn Mapreduce
Course Outcomes
To apply heuristics to design high performing distributed database
To characterize algorithms that are optimally solved by MapReduce, to design and
query large-scale databases, and to understand tradeoffs among distributed
database, cloud databases, and data warehouses.
3. To provide an understanding of architecture and design tradeoffs of all aspects of
distributed database
Course Contents
1.
2.

1. Introduction: Introduction to distributed systems and cloud computing. 10

Cloud architectures: SaaS, PaaS, IaaS. End-to-end system design.
Networks and protocol stacks.
2. Client Server Computing :Client-server computing. Sockets and remote 10
procedure call.
3. Distributed File Systems : Distributed file systems and cache 10
consistency, NFS, AFS. Storage in the Cloud: Google file system
4. Web Services :Web services and REST. Example: Amazon S3. The JAX- 10
RS API. Persistent cloud services.

5. Three-Tier Middleware.: Java EE APIs, Google App Engine, Contexts 10

and dependency injection.
6. Transactions. Atomic commitment protocols: 2PC and 3PC

10

7. Distributed Debugging: Distributed debugging, Time and ordering of 10

Events, Causal broadcasts.
8. Message Queues and Message Brokers.: JMS and Atmosphere. Web 10
sockets. Distributed snapshots. Highly available services. Replicated
services, quorum consensus and viewstamp replication.
9. Database: NoSQL data stores. Table-based: Google BigTable, Amazon 10
Dynamo, Cassandra. Document-based: CouchDB, MongoDB.
10. Batch cloud computing: MapReduce and Hadoop. Applications in 10
NoSQL data stores, Consensus and the Paxos algorithm. Applications in
the cloud: Google Chubby, Yahoo Zookeeper.
Text Books
1

Principles of Distributed Database Systems - M. Tamer zsu, Patrick Valduriez

Reference Books
1

Dominic Duggan , Enterprise Software Architecture and Design

Kristina Chodorow and Michael Dirolf , Mongodb: The Definitive Guide , O'Reilly,
2010

Programme
Name

: M. Tech. (Computer Engineering )

Course Code

: CO5116P

Course Title

: Elective 4 Distributed and Cloud Database System Lab

SEMESTER II

Prerequisites: Distributed computing ,Database systems

Course Objectives
1. To learn Web services
2. To learn distributed systems and cloud computing
3. To learn Mapreduce.
Course Outcomes
To apply heuristics to design high performing distributed database
To characterize algorithms that are optimally solved by MapReduce, to design
and query large-scale databases, and to understand tradeoffs among distributed
database, cloud databases, and data warehouses.
3. To provide an understanding of architecture and design tradeoffs of all aspects of
distributed database
1.
2.

Course Contents
1 Program on web services

20

2 Program on Cloud storage

20

3 Program using App Engine

15

4 MapReduce programmes

15

5 Hadoop programmes

15

6 NoSQL data stores

15

Text Books :
1 Principles of Distributed Database Systems - M. Tamer zsu, Patrick Valduriez
Reference Books
1 Dominic Duggan , Enterprise Software Architecture and Design
2 Kristina Chodorow and Michael Dirolf , Mongodb: The Definitive Guide , O'Reilly,
2010

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5117T

Course Title

: Elective 4 :Pattern Recognition

SEMESTER II

Course Prerequisites: Fundamentals of probability and linear algebra.

Course Objectives
1. To study pattern recognition topics and be exposed to recent developments in pattern
recognitions research.
2. To provide in-depth design concepts and implementation techniques of pattern recognitions
Course Outcomes
1. Identify and explain detailed aspects of internal structures of pattern recognitions
2. Compare and contrast design issues for statistical pattern recognition.
3. Develop implementation skills for building pattern recognition
Course Contents

1.

Introduction: Machine Perception, What is Pattern Recognition (PR)?, Pattern 10

Recognition system: sensing, segmentation & grouping, feature extraction,
classification and post processing, Design cycle: data collection, feature choice,
model choice, training, evaluation and computational complexity. Learning and
adaptation: supervised learning, unsupervised learning and reinforcement
learning. Examples of PR Applications, Pattern Recognition Extensions.
,Machine learning : Components of learning , learning models , geometric
models , probabilistic models , logic models , grouping and grading , learning
versus design , types of learning , supervised ,unsupervised , reinforcement ,
theory of learning , feasibility of learning , error and noise ,training versus
testing , theory of generalization , generalization bound , approximationgeneralization tradeoff , bias and variance , learning curve

2.

Statistical Pattern Recognition (StatPR): Introduction to StatPR, bayes 10

theorem, multiple features, conditionally independent features, decision
boundaries, unequal costs of error, estimation of error rates, characteristic
curves, estimating the composition of populations, introduction to Supervised
Parametric Approaches and Unsupervised Approaches. Cluster analysis:
clustering techniques, cluster analysis, cluster validity. Feature selection &
extraction: feature selection criteria, feature set search algorithm, feature
selection.

3.

Tree Classifiers G with real classifiers :(a) Decision Trees: CART, C4.5, 10
ID3. ,(b) Random Forests

4.

Linear Discriminants Discriminative Classifiers: the Decision Boundary

,(a) Separability ,(b) Perceptrons ,(c) Support Vector Machines ,

5.

Parametric Techniques :Generative Methods grounded in Bayesian Decision 10

Theory , (a) Maximum Likelihood Estimation , (b) Bayesian Parameter
Estimation , (c) Sufficient Statistics , Non-Parametric Techniques :(a) Kernel
Density Estimators ,(b) Parzen Window , (c) Nearest Neighbor Methods ,

6.

Syntactic (Structural) Pattern Recognition (Syntpr): Introduction to 20

SyntPR, Syntactic PR: primitive selection & pattern grammars, higher
dimensional grammars, syntactic recognition, automata, error correcting
parsing, shape & texture analysis, image database management. Structural
Analysis Using Constraint Satisfaction and Structural Matching, The Formal
Language-based Approach to SyntPR, Learning/Training in the Languagebased Approach (Grammatical Inference). Problem solving methods for PR:
problem solving models, problem solving algorithms.

7.

Unsupervised Methods : Exploring the Data for Latent Structure :(a) 10

Component Analysis and Dimension Reduction , i. The Curse of
Dimensionality ,ii. Principal Component Analysis , iii. Fisher Linear
Discriminant , iv. Locally Linear Embedding (b) Clustering , i. K-Means , ii.
Expectation Maximization , iii. Mean Shift ,

8.

Classifier Ensembles :(a) Bagging ,(b) Boosting / AdaBoost ,Algorithm 10

Independent Topics Theoretical Treatments in the Context of Learned Tools ,
(a) No Free Lunch Theorem , (b) Ugly Duckling Theorem , (c) Bias-Variance
Dilemma , (d) Jacknife and Bootstrap Methods ,

10

9.

Neural Pattern Recognition (Neurpr): Neurons and Neural Nets, Feed 10

forward Networks ,Hopfield (CAM) Approaches, Other Related Neural
Approaches and Extensions, processing of waveforms and images Introduction,
gray level scaling transformations, equalization, geometric image and
interpolation, Smoothing, transformations, edge detection, Laplacian and
sharpening operators, line detection and template matching, logarithmic gray
level sealing, the statistical significance of image features.

Text Books
1

Duda, R.O., Hart, P.E., and Stork, D.G. Pattern Classification. Wiley-Interscience.
2nd Edition. 2001

Eart Gose, Richard Johnsonburg and Steve Joust, Pattern Recognition and Image
Analysis, Prentice-Hall of India-2003.

Reference Books
1

Bishop, C. M. Pattern Recognition and Machine Learning. Springer. 2007.

Marsland, S. Machine Learning: An Algorithmic Perspective. CRC Press. 2009.

Theodoridis, S. and Koutroumbas, K. Pattern Recognition. Edition 4. Academic

Press, 2008.

Russell, S. and Norvig, N. Artificial Intelligence: A Modern Approach. Prentice

Hall Series in Artificial Intelligence. 2003.

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5117P

Course Title

: Elective 4 :Pattern Recognition Lab

SEMESTER II

Course Prerequisites: Fundamentals of probability and linear algebra.

Course Objectives
1. To study pattern recognition topics and be exposed to recent developments in pattern
recognitions research.
2. To provide in-depth design concepts and implementation techniques of pattern recognitions
Course Outcomes
1. Identify and explain detailed aspects of internal structures of pattern recognitions
2 Develop program related with feature representation
3. Develop implementation skills for building pattern recognition
Course Contents

1.

Feature Representation

20

2.

Mean and Covariance

10

3.

Linear Perceptron Learning

10

4.

Generation of Random Variables

10

5.

Bayesian Classification

10

6.

MLE: Learning the classifier from data

10

7.

From two class to multiclass

10

8.

Data Clustering: K-Means, MST-based

20

Text Books
1

Duda, R.O., Hart, P.E., and Stork, D.G. Pattern Classification. Wiley-Interscience.
2nd Edition. 2001.

Eart Gose, Richard Johnsonburg and Steve Joust, Pattern Recognition and Image
Analysis, Prentice-Hall of India-2003.

Reference Books
1

Bishop, C. M. Pattern Recognition and Machine Learning. Springer. 2007.

Marsland, S. Machine Learning: An Algorithmic Perspective. CRC Press. 2009.

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5118T

Course Title

: Elective 4 :Graph Mining

SEMESTER II

Course Prerequisites: Fundamentals of probability and linear algebra.

Course Objectives
1. To study graph mining and be exposed to recent developments in graph mining research.
2. To provide in-depth design concepts and implementation techniques of graph mining
Course Outcomes
1. Identify and explain detailed aspects of internal structures of graph mining
2. Develop implementation skills for building graph mining
Course Contents
1.

Introduction: Terminology, Graph Databases

10

2.

Graph MatchingExact And Error-Tolerant Methods And The Automatic 10

Learning Of Edit Costs : Introduction, Definitions and Graph Matching
Methods, Learning Edit Costs, Experimental Evaluation

3.

Graph Visualization And Data Mining : Introduction,

Techniques, Examples of Visualization Systems

Graph Drawing 10

4.

Graph Patterns And The R-Mat Generator : Introduction, NetMine and RMAT, Experiments

10

5.

Discovery Of Frequent Substructures : Introduction, Preliminary Concepts, 10

Apriori-based Approach, Pattern Growth Approach, Variant Substructure
Patterns, Experiments and Performance study

6.

Finding Topological Frequent Patterns From Graph Datasets

: 10
Introduction, Frequent Pattern Discovery from Graph Datasets, Problem
Definitions, FSG for the Graph-Transaction Setting, SIGRAM for the SingleGraph Setting, GREW, Scalable Frequent Subgraph Discovery Algorithm

7.

Unsupervised And Supervised Pattern Learning In Graph Data : 10

Introduction, Mining Graph Data Using Subdue, Comparison to Other GraphBased Mining Algorithms, Comparison to Frequent Substructure Mining
Approaches, Comparison to ILP Approaches

8.

Graph Grammar Learning : Introduction, Related Work, Graph Grammar 10

Learning, Empirical Evaluation

9.

Constructing Decision Tree Based On Chunkingless Graph-Based 10

Induction : Introduction, Graph-Based Induction Revisited, Problem Caused
by Chunking in B-GBI, Chunkingless Graph-Based Induction (Cl-GBI),
Decision Tree Chunkingless Graph-Based Induction (DT-ClGBI)

10. Links Between Formal Concept Analysis And Graph Mining : 10

Presentation, Basic Concepts and Notation, Formal Concept Analysis,
Extension Lattice and Description Lattice Give Concept Lattice, Graph
Description and Galois Lattice,
Graph Mining and Formal
Propositionalization, Kernel Methods For Graphs : Introduction, Graph
Classification, Vertex Classification
Text Books
1

Mining Graph Data By Diane J. Cook , Lawrence B. Holder Wiley Publication ISBN: 978-0471-73190-0

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5118P

Course Title

: Elective 4 :Graph Mining Lab

SEMESTER II

Course Prerequisites: Fundamentals of probability and linear algebra.

Course Objectives
1. To study graph mining and be exposed to recent developments in graph mining research.
2. To provide in-depth design concepts and implementation techniques of graph mining
Course Outcomes
1. Identify and explain detailed aspects of internal structures of graph mining
2. Develop implementation skills for building graph mining

Course Contents
1.

Implement Graph Matching

10

2.

Graph data sets

20

3.

Disk-based large-scale graph computation using Graphchi

10

4.

20

5.

Dealing with undirected edges , understanding asynchronous computation

using Graphchi
Deal with a bipartite graph using Graphchi

6.

R-MAT graph generation programs

20

7.

PEGASUS: A Peta-Scale Graph Mining System

10

10

Text Books
1

Mining Graph Data By Diane J. Cook , Lawrence B. Holder Wiley Publication

Isbn: 978-0-471-73190-0

SEMESTER II

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5119T

Course Title

: Elective 4 :Multi Core Architecture and Parallel Algorithms

Course Prerequisites: Parallel Computing.

Course Objectives
1. To understand the recent trends in the field of Computer Architecture and identify
2.

To understand performance related parameters

3. To appreciate the need for parallel processing

Course Outcomes
1. To expose the students to the problems related to multiprocessing
2. To identify the different types of Multicore architectures
3. To implement GPU Computing
Course Contents

1.

Fundamentals Of Quantitative Design And Analysis :

Classes of 20
Computers , Trends in Technology, Power, Energy and Cost ,Dependability
,Measuring, Reporting and Summarizing Performance ,
Quantitative
Principles of Computer Design

2.

Classes of Parallelism : ILP, DLP, TLP and RLP , Multithreading , SMT and 10
CMP

3.

Architectures : Limitations of Single Core Processors , The Multicore era , 10

Case Studies of Multicore Architectures

4.

DLP in VECTOR, SIMD and GPU Architectures : Vector Architecture 10

Introduction to Vector Architecture, Vector execution time - SIMD Instruction Set
Extensions for Multimedia , Graphics Processing Units, Programming the
GPU,NVIDIA GPU computational structures - Graphics Processing UnitsConditional branching in GPUs, Fermi GPU Architecture, Similarities and
differences between Vector Architectures and GPUs Detecting and Enhancing
Loop Level Parallelism , Case Studies

5.

TLP and multiprocessors : Symmetric and Distributed Shared Memory 10

Architectures , Cache Coherence Issues ,Performance Issues , Synchronization
Issues , Models of Memory Consistency ,Interconnection Networks , Buses,
Crossbar and Multi-stage Interconnection Networks. Multiple lanes, vector
length registers, vector mask register, memory banks, programming vector
architectures

6.

RLP and DLP in Warehouse-Scale Architectures: Programming Models 10

and Workloads for Warehouse-Scale Computers , Architectures for WarehouseScale Computing , Physical Infrastructure and Costs , Case Studies.

7.

Parallel Algorithms :Some Simple Computations, Architectures, Algorithms for a 10

Linear Array, Binary Tree, 2D Mesh, Shared Variables. Asymptotic Complexity,
Algorithm Optimality and Efficiency, Complexity Classes, Parallelizable Tasks and
the NC Class ,Parallel Programming Paradigms.
Multicore GPU Programming: CUDA / OpenCL : Program Structure, Importance 20
of Memory Access Efficiency, Many core architecture , Thread Organization

8.

Text Books
1

John L. Hennessey and David A. Patterson, Computer Architecture A Quantitative

Approach, Morgan Kaufmann / Elsevier, 5th. edition, 2012.

Programming Massively parallel processor by David B.Kirk ,Morgan Kuffman publication

Reference Books
1.

Richard Y. Kain, Advanced Computer Architecture a Systems Design Approach, PHI,

2011.

2.

. David E. Culler, Jaswinder Pal Singh, Parallel Computing Architecture : A Hardware/

Software Approach , Morgan Kaufmann / Elsevier, 1997 .

3.

Introduction to Parallel Algorithms By C. Xavier, S. S. Iyengar Wiley publicaiton

SEMESTER II

Programme Name

: M. Tech. (Computer Engineering )

Course Code

: CO5119P

Course Title

: Elective 4 :Multi Core Architecture and Parallel Algorithms Lab

Course Prerequisites: Parallel Computing.

Course Objectives
1. To understand the recent trends in the field of Computer Architecture and identify
2.

To understand performance related parameters

3. To appreciate the need for parallel processing

Course Outcomes
1. To expose the students to the problems related to multiprocessing
2. To identify the different types of Multicore architectures
3. To implement GPU Computing
Course Contents

1.

To use OPENMP

20

2.

To create cluster for parallel programming usage

20

3.

Program using MPI

20

4.

Program using CUDA

20

5.

Other platform for Multicore & GPU Computing

20

Text Books
1

John L. Hennessey and David A. Patterson, Computer Architecture A Quantitative

Approach, Morgan Kaufmann / Elsevier, 5th. edition, 2012.

Programming Massively parallel processor by David B.Kirk ,Morgan Kuffman publication

Reference Books
1

Richard Y. Kain, Advanced Computer Architecture a Systems Design Approach, PHI, 2011.

. David E. Culler, Jaswinder Pal Singh, Parallel Computing Architecture : A Hardware/

Software Approach , Morgan Kaufmann / Elsevier, 1997 .

Introduction to Parallel Algorithms By C. Xavier, S. S. Iyengar Wiley publicaiton

Programme Name

: M. Tech. (Computer Engineering)

Course Code

: CO5801D

Course Title

: Technical Seminar

Course Prerequisites: Domain knowledge

Course Objectives
i) To learn research methods in particular domain
ii)To learn different papers for literature survey

SEMESTER II

Course Outcomes
1.Student will able to put up proposed model to solve for a particular problem
2.Student will able to work on different methods for evaluating performance
Course Contents
1 Paper review at least 20 papers concerned of IEEE,ACM

20

2 Presenting literature survey

20

3 Proposal on the basis of literature survey

20

4 Implementation of Proposed model

20

5 Presentation & publication

20

Text Books
1 IEEE Journals of the particular domain
2 ACM Journals of the particular domain