Department of Computer Science & Engineering

Curriculum Structure for M.Tech CSE

Batch: 2019-21

DIT UNIVERSITY
Dehradun

COURSE STRUCTURE
OF
M.TECH. IN COMPUTER SCIENCE & ENGG
BATCH 2019–21

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21

Year: 1st Semester: I

Course Course L T P Credit

Code Title

CS601 Agile Programming 3 0 2 4

Modeling and Simulation
CS602 3 0 2 4

Cloud Technologies
CS603 3 0 2 4

CS611 Data Structures and Algorithms 4 0 0 4

CS612 Fuzzy Logic & Genetic Algorithms 4 0 0 4

Total 20

Year: 1st Semester: II

Course Course L T P Credit

Code Title

CS604 Advanced DBMS 3 0 2 4

CS605 Big Data Analytics 3 0 2 4

Elective-I 4 0 0 4

CS606 Dissertation phase-I 0 0 4 4

Total 16

List of Electives for 2nd Semester

Elective – I LTP Credits

CS651 Digital Image Processing 4-0-0 4

CS652 Cryptography 4-0-0 4
Advanced Computer 4-0-0 4
CS653
Networks
Neural Networks & 4-0-0 4
CS654
Neuro Fuzzy Systems
Machine learning& 4-0-0 0
noc19_CS655
Applications
noc19_CS656 Virtual Reality 4-0-0 0

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21

AGILE PROGRAMMING

SEMESTER - I
Subject Code CS601
Marks 100
Number of Lecture Hours/Week 3
Total Number of Contact Hours 5x13=65
CREDITS 4 ( L T P : 3 0 2)
COURSE OBJECTIVE:
To understand a new approach to systems development projects that cuts through the complexity and
ambiguity of complex, emergent requirements and unstable technology to iteratively and quickly produce
quality software.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. Learn how to immediately start producing software incrementally regardless of existing engineering
practices or methodologies
CO2. Learn how to simplify the implementation of Agile processes
CO3. Learn why Agile processes work and how to manage them
CO4. Understand the theoretical underpinnings of agile processes.
CO5. Testing Strategies of Agile Product as well as the Marketing of Agile projects.

Particulars Hours
Unit 1: Fundamentals of Agile

Genesis of Agile, Introduction and background, Agile Manifesto and principles , Overview of Agile
Methodologies –Scrum Methodology, Extreme programming, Feature Driven Development,
Continuous Integration, Refactoring,Pair programming, Simple Design, User Stories, Agile Testing, 8
Agile Tool.

Unit 2: Agile Project Management

Agile Scrum Methodology, Project phases, agile Estimation, Planning game, product game, product
backlog, Sprint backlog, Iteration planning, User story definition, Characteristics and content of user
stories, Acceptance test and Verifying stories, Agile project velocity, Burn down chart, Sprint 8
planning and retrospective, Daily scrum, Scrum roles-product Owner, Scrum Master, Scrum
Developer, Scrum casestudy,Tools for Agile Project Management.

Unit 3 Agile Software Design and Programming

Agile Design Principles with UML Examples, Single Responsibility Principle, Open Closed 8
Principle, LiskovSubstitution principle, Interface Segregation principles, Dependency Inversion

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Principle, Need and significance of Refactoring Techniques, Continuous Integration, Automated build
tool, Version control, Test- Driven Development (TDD),xUnit framework and tools for TDD.

Unit-4 Agile Testing

The Agile lifecycle and its impact on testing, Testing user stories-acceptance test and scenarios,
Planning and managing Agile testing, Exploratory testing, Risk based testing, Regression tests, Test 8
Automation, Tools to support the Agile tester.
Unit- 5:Agile in Market

Market scenario and adoption of Agile, Roles in an Agile project, Agile applicability, Agile
Distributed teams, Business benefits, Challenges in Agile, Risk and Mitigation, Agile project on 7
cloud, balancing agility with Discipline, Agile rapid development technologies.
TEXT BOOKS
1. Ken Schawber, mike Beedle,Agile Software Development with scrum , Pearson Published 21 Mar 2008.
2. Robert C. Martin, Pattern ,Agile Software Development Principle, Pearson Education, 2003

REFERENCES
1. Lisa Crispin,Janet Gregory ,A practical Guide for Testers and Agile Teams ,Agile Testing: Addison
Wesley,2009
2.Alistair Cockburn ,Agile Software Development: The Cooperative Game ,Pearson, second edition,2006.

SR.NO EXPERIMENT NAME

1 Recent development in agile practices.
2 Class diagram of given any one of the case study
3 Use case Diagram
4 Activity Diagram
5 Boundary Value Analysis Testing for finding root of quadratic equation.
6 Construct independent path for finding root of quadratic equation.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
MODELLING & SIMULATION

SEMESTER - I
Subject Code CS602
Marks 100
Number of Lecture Hours/Week 3
Total Number of Contact Hours 5x13=65
CREDITS 4 ( L T P : 3 0 2)
COURSE OBJECTIVE:
The goal is to introduce students to basic methods and tools for modeling and simulation of continuous, discrete and
combined systems in time and space dimension. Behavior of common industrial and engineering systems in mechanical,
electrical, civil, environmental, and transport disciplines etc. needs to be represented for analysis.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. They will be able to create simulation models of various types.
CO2. Use graphs to present their results
CO3. Write scripting languages to generate other reports.

Particulars Hours
Unit 1: Modelling

Modelling: Definition of SYSTEM, system concepts, types of system, continuous and discrete systems,
modelling process, verification and validation. Simulation: Introduction, classification of simulation
models, advantages and disadvantages of simulation. 8

Unit 2: Discrete system simulation

Discrete system simulation: Monte Carlo method, Random Number Generation: Congruence
generators, long period generators, uniformity and independence testing. Random Variate Generation:
Location, scale and shape parameters, discrete and continuous probability distributions; Inverse 8
transformation method.

Unit 3 Introduction to Queuing Theory

Queuing Theory: Introduction, notation and assumption, Little’s theorem, queuing model with poison
input, exponential service and arbitrary service times, simulation of queuing system, simulation of 8
single-server queue, Simulation of two server queuing system.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Unit-4 Inventory Control :
Inventory Control: Elements of Inventory Theory, more complex inventory models, finite and infinite
delivery rate model with and without back ordering, simulation of inventory systems. 8

Unit- 5:Evaluation of simulation:

Evaluation of simulation: length of simulation runs, variance reduction techniques. Project

Management: PERT/CPM techniques, simulation of PERT networks. Model as components of 10
information systems, modelling for decision support. Virtual Reality: the ultimate interactive model.
TEXT BOOKS
1. Gorden G., System Simulation,Prentice-Hall(second edition) 1989.
2. DeoNarsing,System Simulation, , Mc Graw Hill(1st edition)2009.

REFERENCES
1. Banks, Carson, Nelson, and Nicol, Discrete-Event System Simulation (Fourth Edition), Prentice-Hall,
2005. (available online).

2. Law and Kelton, Simulation Modeling and Analysis (Third Edition), McGraw Hill, 2000. (available
online).

SR.NO EXPERIMENT NAME

1 Introduction to MATLAB
2 Programming in MATLAB:Introduction, Branching statements, loops, functions, additional data
types, plots, arrays, inputs/outputs etc.
3 Program to display a Matrix
4 Program to Addition of matrix
5 Program to transpose of a Matrix.
6 Practical to Implementation of Random Number Generator Model using C
7 Practical Implementation of Queuing Models using C/C++.
8 Applications of MATLAB

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
CLOUD TECHNOLOGIES

SEMESTER - I
Subject Code CS603
Marks 100
Number of Lecture Hours/Week 3
Total Number of Contact Hours 5x13=65
CREDITS 4 ( L T P : 3 0 2)
COURSE OBJECTIVE:
The objective of the course is to make the students able to learn about cloud computing and the technologies working
behind it. The students will learn the technical foundation of cloud such as Virtualization and Service oriented
architecture. They will learn the basic cloud applications and their benefits and why it is the wave of future.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. An ability to make a cloud application.
CO2. An ability to share online calendars and to-do-list.
CO3. An ability to collaborate online for a big project.
CO4. An ability of hardware and software virtualization.
CO5. An ability of private cloud development.

Particulars Hours
Unit 1:

Fundamentals of Cloud Computing: What it is & what it is not?, The old IT infrastructure versus the
cloud, www, Internet, Cloud and cloud computing, Motivation for Cloud Computing, A comparison of IT
infrastructure options, Historical developments: Client-Server computing, Peer to Peer Computing,
Distributed Computing, Cluster & Grid Computing, Principals of parallel and distributed computing- Eras of 8
computing, parallel vs. Distributed computing, Elements of parallel of computing, Elements of Distributed of
computing, Technologies of distributed computing: Service oriented computing and architecture.

Unit 2:

Introduction to High performance computing, Technical foundations of Cloud Computing, Goals

of Cloud Computing, Resource Sharing at various levels,Cloud Architecture, NIST USA Cloud
Computing Model: Essential Characteristics, Delivery Models, IaaS, PaaS, Saas, Deployment Models,
Public, private, Hybrid & Community, Pricing Model of Cloud Computing, Advantages & 9
Disadvantages of Cloud Computing, Open challenges: Cloud definition, cloud interoperability and
standards, scalability and fault tolerance, Security, trust and privacy, Organizational aspects.

Unit 3:

Companies in Cloud Computing, Cloud computing Engines- GAE, EC2, Microsoft Azure,
Virtualization: Characteristics of virtualized environment, taxonomy of virtualization techniques, 8
Virtualization and cloud computing, pros and cons of virtualization, Technology examples, Flex
Tenancy architecture, Pros & Cons of Cloud service development, Cloud application development,

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Cloud computing applications, Cloud Computing for everyone, Computing for Community &
corporate.

Unit-4:

Security: Securing the cloud-The security boundary, Security service boundary, security mapping, Data
security- Brokered cloud storage access, storage location and tenancy, encryption, Auditing and compliance,
8
Establishing identity and presence, Network security, Host security, compromise response, High-throughput
computing: Task programming.
Unit- 5:

Advanced topics in cloud computing: energy efficiency in clouds, market based management of clouds-
market oriented cloud computing; A reference model of MOCC technologies and initiatives supporting MOCC, 8
Federated clouds / InterClouds, Third party cloud services- Meta CDN; SpotCloud, Using the mobile cloud.
TEXT BOOKS
1. R. Buyya, C. Vecchiola, S. T. Selvi, Matering Cloud Computing, Ed. Third reprint 2013, Mc Graw Hill education
(India) Pvt. Ltd.

2. B. Sosinsky, Cloud computing Bible, Ed. Reprint 2014(1st edition), Willy India Pvt. Ltd.

REFERENCES

1. M. Miller, Cloud Computing,(ninth edition)2014, Pearson education in South Asia.

SR.NO EXPERIMENT NAME

1 Working on Cloudsim including installation.
2 Design & implementation of one cloud center.
3 Design & implementation of two cloud centers.
4 Implementation of time sharing scheduling.
5 Implementation of Space sharing algorithm.
6 Practice on Google app engine.
7 Storing data on Justcloud or google drive.
8 Create website using google site services.
9 Creating and using shared word, presentations.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
DATA STRUCTURES AND ALGORITHMS

SEMESTER - I
Subject Code CS611
Marks 100
Number of Lecture Hours/Week 4
Total Number of Contact Hours 4x13=52
CREDITS 4 ( L T P : 4 0 0)
COURSE OBJECTIVE:
The course is aimed to provide the knowledge for target students to get the concept of advanced techniques for the
designing of the algorithms including few contemporary algorithms.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. Define basic static and dynamic data structures and relevant standard algorithms for them: stack, queue,
dynamically linked lists, trees, graphs, heap, priority queue, hash tables, sorting algorithms, min-max algorithm,
CO2. Demonstrate advantages and disadvantages of specific algorithms and data structures,
CO3. Select basic data structures and algorithms for autonomous realization of simple programs or program parts
CO4. Determine and demonstrate bugs in program, recognize needed basic operations with data structures

Particulars Hours
Unit 1:

Introduction: Algorithms, The role of algorithms in computing, analysis of algorithms, Time and Space
Complexity ; Relation; Asymptotic notation, Growth of Functions, asymptotic analysis of recurrence
relations, Recursion Tree; Master's Theorem, Medians and Order Statistics; Max-Min. Divide and 12
conquer paradigm: Analysis of Divide-and-Conquer Algorithm; Quick Sort, Merge sort Analysis; Best
Case, Worst Case and Average Case Analysis.

Unit 2:

Advanced Design and Analysis Techniques : Dynamic Programming : Longest Common

subsequence, optimal binary search trees ;Greedy Algorithm :Activity Selection problem, Theoretical
foundation of greedy algorithm, Task Scheduling problem, Comparison of dynamic programming 10
and Greedy algorithm with Knapsack as case study ; Fractional Knapsack and 0/1 Knapsack ; Back
Tracking: Queen Problem, BFS,DFS ; Amortized Analysis:

Unit 3

Advanced Data Structure: Red-Black Trees, B Trees, Binomial Heaps, Fibonacci Heaps, Data
10
Stricture for Disjoint Sets, Number–Theoretic Algorithm.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21

Unit-4

Approximation Algorithms- the vertex-cover problem, The set covering problem; Randomized
Algorithms ; String Matching : Knuth - Morris-Pratt Algorithm ; Polynomial time, Polynomial time 10
verification, NP-completeness and reducibility, NP-Completeness proofs.
Unit- 5:

Introduction: Need for parallel computers, Models of computation, analyzing parallel

algorithms, expressing parallel algorithms,

Dense Matrix algorithms: Matrix vector Multiplication, Matrix matrix multiplication 10

Sorting: Hyper quick sort, Merge sort, Bitonic merge sort

TEXT BOOKS
1.T.H. Cormen,C. E. Leiserson,R.L. Rivest, C. Stein, Introduction to Algorithms, 3rd Edition(2009), PHI.
2. Ellis Harwitz and SartazSahani, Fundamentals of Computer Algorithms, Galgotia. 3.Basse, "Computer
Algorithms: Introduction to Design & Analysis", Addision Wesley
3. Basse,Computer Algorithms: Introduction to Design & Analysis, Addision Wesley(third
edition)2000

REFERENCES
1. The Design & Analysis of Computer Algorithms, A.V. Aho, J. E. Hopcroft, J.D. Ulman, Addison Wesley, 1975

2. Behrooz Parhami: Introduction to parallel Processing :Plenum series in Computer Science,2002

3. F.T.Leighton, "Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes", MK Publishers,
San Mateo California,1992

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21

FUZZY LOGIC AND GENETIC ALGORITHM

SEMESTER - I
Subject Code CS612
Marks 100
Number of Lecture Hours/Week 4
Total Number of Contact Hours 4x13=52
CREDITS 4 ( L T P : 4 0 0)
COURSE OBJECTIVE:
The course has been designed with the purpose to teach the students the fundamentals of Reasoning under uncertain
circumstances (covered through Probabilistic Reasoning) and the Reasoning with imprecise knowledge (covered through
Fuzzy Sets and Fuzzy Logic). The objective of the course is also to teach the fundamentals and applications of Genetic
Algorithms. These three major areas contribute to the study and design of Machine Learning.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. The Fuzzy Sets Fuzzy Systems and the reasoning using the Fuzzy Logic
CO2. How to develop a decision support system using the fuzzy knowledge
CO3. The Reasoning Techniques under uncertain circumstances
CO4. The Bayesian Networks and the Bayesian Reasoning
CO5. Dempsters- Shafers theory and Certainty theory as alternative to Bayesian reasoning uncer uncertain
circumstances.
CO6. Genetic Algorithms provide one of the best optimization techniques when the serch space is large. Starting
from the very fundamentals the students shall learn as to how to find solutions to problems using Genetic
Algorithms.

Particulars Hours
Unit 1:

Fuzzy Sets (Introduction)

Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set theory, Basic operations, 12
Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion.

Unit 2: Fuzzy Logic (Fuzzy Membership, Rules)

Fuzzy Logic (Fuzzy Membership, Rules)

Membership functions, Propositional logic and predicate logic, Inference in fuzzy logic, Fuzzy if-then rules,
10
Fuzzy mapping rules, Fuzzy implications, Min-Max Theorem, Resolution Rule under Fuzzy environment,
Refutation method for theorem proving, Defuzzifications,

Unit 3 Reasoning with uncertain and incomplete information:

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Reasoning with uncertain and incomplete information: The statistical approach to uncertainty,
10
Introduction, Uncertain & incomplete knowledge. Review of Probability theory

Unit-4 Bayes Theorem:

Bayes Theorem, Bayesian Networks, Bayesian reasoning. Decision Making, Joint Probabilities, Relationships,
Polytrees.,Dempster-Shafer theory of evidence, Certainty Factor, Non-monotonic systems. 10

Unit- 5:Theoretical Foundation of Genetic Algorithms

Theoretical Foundation of Genetic Algorithms

Introduction: Basic Operators: Reproduction, Crossover & Mutation. Fitness function. Search Space, Schemas 10
& Two-Armed and k-armed problem, Exact mathematical models, Applications of Genetic Algorithms.
TEXT BOOKS
1. Timothy J Ross, “Fuzzy Logic with Engineering Applications”, 3rd Edition, John Wiley, 2004.

2. David E. Goldberg, “Genetic algorithms in search, optimization & Machine Learning” ,1st ed,Pearson Education, 2006
3. Stuart Russel, Peter Norvig, ”Artificial Intelligence A Modern Approach” Pearson, 2014 (3rd Ed.)

REFERENCES
1. John Yen, Reza Langari, “Fuzzy Logic Intelligence, Control and Information”, Pearson Education, 2006.

2. Timothy J Ross, “Fuzzy Logic with Engineering Applications”, 2nd Edition, John Wiley, 2004.

3. H. Zimmermann, “Fuzzy Set Theory and its applications”, 2nd Edition, Allied Publishers, 1996.

4. Melanle Mitchell, “An introduction to genetic algorithms”, Prentice Hall India, 2002.

5. SN Sivanandam, SN Deepa, Principals of Soft Computing,2nd Edition, Wiley India, 2008.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
ADVANCED DBMS

SEMESTER - II
Subject Code CS604
Marks 100
Number of Lecture Hours/Week 3
Total Number of Contact Hours 5x13=65
CREDITS 4 ( L T P : 3 0 2)
COURSE OBJECTIVE:
This course aims to provide a basic understanding of different ADBMS concepts and queries. In the current scenario the
volume of data collected by organizations has increased exponentially over the last decade. The course emphasizes the
understanding of the fundamentals of relational systems including data models, database architectures, and database
manipulations. The course also provides an understanding of new developments and trends such as Internet database
environment and data warehousing. The course uses a problem-based approach to learning.

COURSE OUTCOME:
At the end of the course, the student can :

CO1. Explain terms related to database design and management.

CO2. Understand the objectives of data and information management.
CO3. Understand data modeling and database development process.
CO4. Construct and normalize conceptual data models.
CO5. Develop logical data models.
CO6. Implement a relational database into a database management system.
CO7. Use database management systems such as Microsoft Access and Oracle SQL Plus.
CO8. Understand the issues related to database performance.

Particulars Hours
Unit 1:

RDBMS: Entity –Relationship model – Relational Model – Relational constraints- Relational algebra ,Tuples
and Domain Relational calculus, Database Administrator, Introduction to SQL, Data Definition Language,
Data Manipulation Language, Data Control Language, Queries, Join, Functions, Operators, Invoking SQL 8
*Plus, Commit, Rollback, Normal forms, ER Diagram, mapping.

Unit 2:

Introduction to Pl/SQL, Control Statements, View, Indexes, Sequences, PL/SQL Cursor, Database Trigger, 9
Function, Procedure, Exceptional Handling in Oracle 11i.

Unit 3:

Query processing and optimization-Transactions-Properties of Transactions-Concurrency Control, Recovery,

Security and Authorization, Storage-Indexing and Hashing, B+ Trees, Trees-X Trees, Dynamic Hashing .
10

Distributed Databases-Principles –Design-Queries Translation of queries optimization Access Strategies,

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Management of Distributed Transactions actions-concurrency Control-Reliability .DBMS benchmarking.

Unit-4 :

Object Oriented Concepts-Data Object Models-Object Based Databases –Object Oriented Databases-Object
Oriented Databases Relational Databases-Object Definition Languages-Object Query Languages-SQL3- 4
Concurreency in OODBs-Storage and Access Data Access .

Unit- 5:

Other Database Models-Multimedia Databases-Parallel Databases Data Mining - Data Warehousing –Spatial
Databases Concepts –Temporal Databases Concepts-Active Databases. Mobile databases; Geographical 8
Information Systems; Genome data management.

TEXT BOOKS
1. Fred R. McFadden, Jeffery A. Hoffer, Mary B. ,Modern Database Management, Prescott, Fifth Edition , Edition
Wesley, 2000 .
2. Elmasri, Navathe, ,Fundamentals Of Database Systems, Third Edition,Addison Wesley, 2000 .
3. Abraham Silberchartz, Henry F. Korth, S. Sudarshan, Database System Concepts ,Third Edition, McGraw-Hill, 1996 .

REFERENCES
1. Jefry D. Ullman , Jenifer Widom ,A First Course in Database Systems, Pearson Education Asia, 2001(third edition)
2. Stefano Ceri, Giuseppe Pelagatti, Distributed Databases Principles & Systems, McGraw-Hill International Editions,
1985
3. Rajesh Narang, Object Oriented Interfaces & Databases, Prentice Hall Of India, 2003.

SR.NO EXPERIMENT NAME

1 Use of DDL, DML and DCL commands for table creation in database.
2 Use of where, rename, tuple variables and string operations on tables.
3 Use of nested queries, set operations and join operations on tables.
4 Use of substitution variables and use of the DBMS_OUTPUT.PUT_LINE statement in PL/SQL.
5 Use of PL/SQL variables, reserved words, identifiers and anchored data types.
6 Use of block, nested blocks and labels in PL/SQL.
7 Use of DML & SAVEPOINT in PL/SQL.
8 Use of IF, ELSEIF, NESTED IF & Case statement in PL/SQL.
9 Use of Error handling and Built-In Exceptions in PL/SQL.
10 Use a cursor for loop and process nested cursors in PL/SQL.
11 Use of Procedures and functions in PL/SQL.
12 Use of row and statement triggers in PL/SQL.
13 Introduction and creation of dataset in MongoDB and Neo4j.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
BIG DATA ANALYTICS

SEMESTER - II
Subject Code CS605
Marks 100
Number of Lecture Hours/Week 3
Total Number of Contact Hours 5x13=65
CREDITS 4 ( L T P : 3 0 2)
COURSE OBJECTIVE:
The objectives of this subject are to introduce students the concept and challenges of big data (5 V’s: volume,
velocity, variety, veracity and value) and expose them to the impact of big data analysis for business decisions
and strategy. This course will teach students in applying specialized skills and tools to manage and analyze the
big data. Students will acquire hands on experience in R programming for descriptive and predictive analysis of
data.
COURSE OUTCOME:
At the end of the course, the student can :
CO1. Understand the concept and challenges of big data
CO2. Collect, manage, store, query, and analyze various forms of big data, structured and unstructured.
CO3. Apply machine learning algorithms like regression, decision tree, Bayes’ algorithm, k-means
clustering etc. using R programming language.
CO4. Demonstrate ability to use large-scale analytics tools like Hadoop, MapReduce to solve some open big data
problems

Particulars Hours
Unit 1: Introduction,Overview of BigData and itsImportance
Big data concept and challenges, key characteristics of big data, structured vs.
unstructured data. Dependence of businesses on Bigdata for business intelligence
extraction. Business case evaluation, Tackling the challenges of bigdata, data collection 6
from various sources, data preparation, processing, data warehousing and
visualization.Data security, provenance, privacy, ethics and governance.
Unit 2: Foundation of Data Science
Data types, topics in statistical modeling,descriptive analysis,mean, mode, histogram,
correlation, scatter plot, box plot. Statistical inference techniques, probability, probability
distribution and conditional probability.
Introduction to R programming language, reading and getting data into R, ordered and 8
unordered factors, arrays and matrices, lists and data frames, reading data from files,
probability distributions, statistical models in R, manipulating objects,plotting data
distribution, and visualization.

Unit 3 :Topics in Machine Learning

Understand data mining techniques, algorithms and applications.Data integration,
cleaning, mapping, transformation, analysis and visualization. Supervised learning,
Decision Trees, Classification and Regression, Artificial Neural Network.Unsupervised 16
Learning, clustering, Associative Rule Mining, text Mining.Page rank, community
detection, recursive queriesand semantic web mining.

Unit-4 :BigData Technology

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Big data technology used for storage and analysis in massive parallel hardware
architecture.To recognize the key concepts of Hadoop framework, MapReduce, Pig, 4
Hive,and No-SQL.Distributing data processing jobs across several processors.
Unit- 5: Communicating Results & Special Topics
Visualization, provenance, privacy, ethicsand governance.
6
Text Mining, Web Mining, PageRank, community detection, recursive queries semantic web.
TEXT BOOKS
1. Data Analytics- Anil Maheshwari
2. Data Mining- Concepts and techniques, Han and Kamber

REFERENCES
1. Data Science and Big Data Analytics; Discovering, Analyzing, Visualizing and Presenting Data. EMC
Education Service.

2. Big Data Analytics: Turning Big Data into Big Money (Wiley and SAS Business Series). Frank J.
OlhorstBig
3. Big data, Big analytics- Minelli, Chambers and Dhiraj.

SR.NO EXPERIMENT NAME

1 Learning R programming language, libraries
2 Data handling, reading from files, making data frames
3 Descriptive analysis histogram, box plot, word cloud using R programming tool
4 Predictive analysis : decision tree model, Gini Index method
5 Predictive analysis : clustering
6 Predictive analysis : Naïve Bayes classification
7 Predictive analysis : scatter plot, correlation, linear regression using EXCEL spread sheet and data
analytics functions
8 Text summary, TDM, Visualization using word cloud

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
DIGITAL IMAGE PROCESSING

SEMESTER - II
Subject Code CS651
Marks 100
Number of Lecture Hours/Week 4
Total Number of Contact Hours 4x13=52
CREDITS 4 ( L T P : 4 0 0)
COURSE OBJECTIVE:
To learn and understand the fundamentals of digital image processing, and various image Transforms, Image
Enhancement Techniques, Image restoration Techniques and methods, image compression and Segmentation
used in digital image processing.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. The fundamentals of digital image processing

CO2. Image transform used in digital image processing

CO3. Image enhancement techniques used in digital image processing

CO4. Image restoration techniques and methods used in digital image processing

CO5. Image compression and Segmentation used in digital image processing

Particulars Hours
Unit 1:

Introduction and Fundamentals

Motivation and Perspective, Applications, Components of Image Processing System, Element of
Visual Perception, A Simple Image Model, Sampling and Quantization.
Image Enhancement in Spatial Domain
8
Introduction; Basic Gray Level Functions – Piecewise-Linear Transformation Functions:Contrast
Stretching; Histogram Specification; Histogram Equalization; Local Enhancement; Enhancement
using Arithmetic/Logic Operations – Image Subtraction, Image Averaging; Basics of Spatial
Filtering; Smoothing - Mean filter, Ordered Statistic Filter; Sharpening – The Laplacian.

Unit 2:

Image Enhancement in Frequency Domain

Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters –
Low-pass, High-pass; Correspondence Between Filtering in Spatial and Frequency Domain;
Smoothing Frequency Domain Filters – Gaussian Lowpass Filters; Sharpening Frequency Domain
8
Filters – Gaussian Highpass Filters; Homomorphic Filtering.
Image Restoration
A Model of Restoration Process, Noise Models, Restoration in the presence of Noise only-Spatial
Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic Filters –

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain Filtering –
Bandpass Filters; Minimum Mean-square Error Restoration.

Unit 3

Color Image Processing

Color Fundamentals, Color Models, Converting Colors to different models, Color Transformation,
Smoothing and Sharpening, Color Segmentation.
8
Morphological Image Processing: Introduction, Logic Operations involving Binary Images,
Dilation and Erosion, Opening and Closing, Morphological Algorithms – Boundary Extraction,
Region Filling, Extraction of Connected Components, Convex Hull, Thinning, Thickening

Unit-4 :

Registration:
Introduction, Geometric Transformation – Plane to Plane transformation, Mapping, Stereo Imaging –
Algorithms to Establish Correspondence, Algorithms to Recover Depth
Segmentation: Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, 8
Local Thresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge
Operators, Pattern Fitting Approach, Edge Linking and Edge Following, Edge Elements Extraction
by Thresholding, Edge Detector Performance, Line Detection, Corner Detection.
Unit- 5:

Feature Extraction:Representation, Topological Attributes, Geometric

AttributesDescription,Boundary-based Description, Region-based Description and Relationship.
8
Object Recognition:Deterministic Methods, Clustering, Statistical Classification, Syntactic
Recognition, Tree Search, Graph Matching
TEXT BOOKS
1. Rafael C. Gonzalvez and Richard E.Woods,Digital Image Processing 3rd Edition , Pearson
Education,2016.

REFERENCES

1. R.J. Schalkoff. ,Digital Image Processing and Computer Vision ,John Wiley and Sons, NY,1989
2. A.K. Jain. , Fundamentals of Digital Image Processing, ,Prentice Hall, Upper Saddle River, NJ,2002(second edition)

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21

CRYPTOGRAPHY

SEMESTER - II
Subject Code CS652
Marks 100
Number of Lecture Hours/Week 4
Total Number of Contact Hours 4x13=52
CREDITS 4 ( L T P : 4 0 0)
COURSE OBJECTIVE: Security attacks, mechanisms, and services. Network security and access security
models. Overview of secret-key and public-key cryptography. Authentication protocols and key management.
Network security practice. Email security. IP security and web security. Intrusion detection and prevention
systems. Firewalls and virtual private networks. Wireless network security.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. Have internalized the fundamental notions of threat, vulnerability, attack and countermeasure.
CO2. Able to identify the security goals of an information system, point out contradictory goals and suggest
compromises.
CO3. Have a theoretical understanding of the principles underlying cryptography and cryptanalysis and have a
technical understanding of the main cryptographic concepts and technologies available today, including
symmetric and asymmetric encryption, hashing, and digital signatures.
CO4. Understand the purpose of security protocols and be witness to the difficulties of their verification.
CO5. Understand how malicious code functions (e.g., viruses), what the vulnerabilities that make propagation
possible (e.g., buffer overflows), and what methods and practices are available for mitigation (e.g., the
Common Criteria).
CO6. Explain the main authorization mechanisms in an operating system
Particulars Hours
Unit 1:

Introduction to Security in Networks, Characteristics of Networks, Intrusion, Kinds of security

breaches, Plan of attack, Points of vulnerability, Methods of defense , Control measures , 12
Effectiveness of controls .

Unit 2:

Basic encryption and decryption, Encryption techniques, Characteristics of good encryption Systems,
Secret key cryptography, Data Encryption Standard, International Data Encryption Algorithm,
Advanced Encryption Standard. 10

Unit 3:

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Public Key encryptions, Introduction to number theory, RSA algorithm, Diffie-Hellman, Digital
Signature standard, Elliptic Curve cryptography, Digital signatures and authentication Trusted 10
intermediaries, Security handshake pitfalls, Hash and MAC algorithms, Security standards,
Kerberos.X.509AuthenticationService

Unit-4 :

Secure sockets, IPsec overview, IP security architecture, IPsec-Internet Key Exchanging (IKE) , IKE
phases ,encoding , Internet security ,Threats to privacy ,Packet sniffing, Spoofing , Web security 10
requirements , Real Time communication security .
Unit- 5:

Secret Sharing Schemes, The Shamir Threshold Scheme, Access Structure and General Secret key
sharing, Information Rate and Construction of Efficient Schemes, Multicast Security and Copyright
10
production-Multicast Security, Broadcast Encryption ,Multicast Rekeying, Copyright Protection
,Tracing Illegally Redistribution keys.
TEXT BOOKS
1.William Stallings, “Cryptography and Network Security: Principles and Standards”,
Prentice Hall India, 3rd Edition, 2003.

2.Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security: Private
Communication in a public world”, Prentice Hall India, 2nd Edition, 2002.

REFERENCES

1.Charles P. Pleeger, “Security in Computing”, Pearson Education Asia, 5 th Edition, 2001.

2.William Stallings, “Network Security Essentials: Applications and standards”, Person

Education Asia, 2000.

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
ADVANCED COMPUTER NETWORKS

SEMESTER - II
Subject Code CS653
Marks 100
Number of Lecture Hours/Week 4
Total Number of Contact Hours 4x13=52
CREDITS 4 ( L T P : 4 0 0)
COURSE OBJECTIVE:
This course aims to provide advanced background on relevant computer networking topics to have a comprehensive and
deep knowledge in computer networks.

COURSE OUTCOME:
At the end of the course, the student can :
CO1. To master the terminology and concepts of the OSI reference model and the TCP‐IP Reference model.

CO2. To master the concepts of protocols, network interfaces, and Design/performance issues in local area networks and
wide area networks,
CO3. To be familiar with wireless networking concepts,
CO4. To be familiar with contemporary issues in networking technologies,To be familiar with network tools and network
programming
Particulars Hours
Unit 1:

Network Layer design Issues, IPv4, IPv6, Shortest Path Routing, Distance Vector Routing, Flooding, 12
Hierarchical Routing, Broadcast Routing, Multicast Routing.

Unit 2:

Wireless Networks, GSM Architecture, CDMA, Mobility in networks, Handoffs.Mobile IP- IP 10

Packet Delivery, Agent Discovery, Registration, Tunneling and Encapsulation.

Unit 3

Mobile TCP- Traditional TCP (Congestion Control, Slow Start, Fast Retransmit/Fast Recovery), Indirect
10
TCP, Snooping TCP, Mobile TCP, Selective Retransmission, Transaction Oriented TCP.

Unit-4 :

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Wireless LAN- Infrared Vs Radio Transmission, Infrastructure and Ad-hoc Network, IEEE 802.11-
System Architecture, Protocol Architecture, Physical Layer, Bluetooth. 10

Unit- 5:

IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security

associations, key management, SSL. 10

TEXT BOOKS
1. JochenSchiller”Mobile “Communications”, 2008(second edition)
2. Andrew S. Tanenbaum ,“Computer Networks,” Pearson Education, fifth edition

REFERENCES

1. Forouzan, B.A., Data communication and Networking, McGraw Hill (2006) (fouth edition)

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
NEURAL NETWORKS & NEURO FUZZY SYSTEMS

SEMESTER - II
Subject Code CS654
Marks 100
Number of Lecture Hours/Week 4
Total Number of Contact Hours 4x13=52
CREDITS 4 ( L T P : 4 0 0)

COURSE OBJECTIVE:
It deals with Introduction and different architectures of neural network and with the Application of Neural Networks

COURSE OUTCOME:
At the end of the course, the student can :
CO1. The student will be able to obtain the fundamentals and types of neural networks
CO2. The student will have a broad knowledge in developing the different algorithms for neural networks.
CO3. Student will be able analyze neural controllers
CO4. Student will be able to determine different methods of Deffuzification

Particulars Hours
Unit 1:

Introduction: Biological neural system, Artificial Intelligent Systems, Modeling human performance. Uncertain &
incomplete knowledge, Expert Systems Vs Neural Networks. 12

Unit 2:

Foundations for connectionist networks. Architecture, Activation functions, Characteristics of Neural 10

Networks, McCulloch-Pitts Neurons, Liner Separability

Unit 3

Perceptron learning, Pattern Classification. Hebb Rule. Adaline. Madaline. Delta Rule.Back propagation
10
learning, Competitive learning, Hebbian learning, BAMs.

Unit-4 :

Supervised and Unsupervised learning. Reinforcement learning, Kohonen Self Organizing

10
Maps, Applications of SOMs ,Adaptive Resonance Theory, Neural Network Applications.
Unit- 5:

DIT, University
 Department of Computer Science & Engineering
Curriculum Structure for M.Tech CSE
Batch: 2019-21
Neuro-Fuzzy Systems: Types of Fuzzy Neural Nets, Neural components in a Fuzzy System
10
Fuzzy-ANN Contoroller, Support Vector Machines, Appliactions of SVMs.
TEXT BOOKS
1. Simon Haykin, “Neural Networks : A Comprehensive Foundation” , Prentice Hall (2nd edition)2002
2. Nils J. Nilsson, “Artificial Intelligence - A New Synthesis”, Morgan Kaufmann Publishers(1st edition)1998
3. Robert J. Scholkoof“ Artifical Neural Networks”; McGraw Hill Eductaion, 2011

REFERENCES

1. “Fuzzy Logic with Engineering Applications” ,Timothy J. Ross, Wiley India(fourth edition 2016)
2. ”Artificial Intelligence A Modern Approach” ,Stuart Russel, Peter Norvig, Pearson (3rd edition)

DIT, University