VISVESVARAYA TECHNOLOGICAL UNIVERSITY

BELAGAVI

Scheme of Teaching and Examinations and Syllabus

M.Tech Computer Engineering (SCE)
(Effective from Academic year 2020 - 21)
 2

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Engineering (SCE)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
I SEMESTER

Credits
Sl.
Course Course Code Teaching Hours /Week Examination
No
Course Title

Total Marks
SEE Marks
Duration in

CIE Marks
Assignment
Field work/
Theory

Practical/

hours
Title Of The Course
1 PCC 20SCE11 04 -- 03 40 60 100 4
(Mathematics course)
2 PCC 20SCE12 Advanced Digital Design 04 -- 03 40 60 100 4
3 PCC 20SCE13 Embedded Computing Systems 04 -- 03 40 60 100 4
4 PCC 20SCE14 Cloud Computing 04 -- 03 40 60 100 4
5 PCC 20SCE15 Distributed Operating System 04 -- 03 40 60 100 4
6 PCC 20SCEL16 Embedded Computing Laboratory - 04 03 40 60 100 2
7 PCC 20RMI17 Research Methodology and IPR 02 -- 03 40 60 100 2
TOTAL 22 04 21 280 420 700 24
Note: PCC: Professional core.
Internship: All the students have to undergo mandatory internship of 6 weeks during the vacation of I and II
semesters and /or II and III semesters. A University examination shall be conducted during III semester and the
prescribed credit shall be counted for the same semester. Internship shall be considered as a head of passing and
shall be considered for the award of degree. Those, who do not take-up/complete the internship shall be declared
as fail in internship course and have to complete the same during the subsequent University examination after
satisfying the internship requirements.
Note: (i) Four credit courses are designed for 50 hours Teaching – Learning process.
(ii) Three credit courses are designed for 40 hours Teaching – Learning process.
 3

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Engineering (SCE)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
II SEMESTER
Teaching Hours /Week Examination

Total Marks
SEE Marks
Duration in
Assignment/

CIE Marks

Credits
Field work/
Theory
Sl.

Practical/

hours
Course Course Code Course Title
No

Project
1 PCC 20SCE21 Managing Big Data 04 -- 03 40 60 100 4
Multi Core Architecture and
2 PCC 20SCE22 04 -- 03 40 60 100 4
Programming
3 PCC 20SCE23 Internet of Things 04 -- 03 40 60 100 4
4 PEC 20SCE24X Professional elective 1 04 -- 03 40 60 100 4
5 PEC 20SCE25X Professional elective 2 04 -- 03 40 60 100 4
6 PCC 20SCEL26 Big data analytics Laboratory -- 04 03 40 60 100 2
7 PCC 20SCE27 Technical Seminar -- 02 -- 100 -- 100 2
TOTAL 20 06 20 340 360 700 24
Note: PCC: Professional core, PEC: Professional Elective.
Professional Elective 1 Professional Elective 2
Course Code Course title Course Code under Course title
under 20SCE24X 20SCE25X
20SCE241 Wireless Networks & Mobile 20SCE251
Wireless Sensor Networks
Computing
20SCE242 20SCE252 Advances in Data Base Management
Pattern Recognition
System
20SCE243 Natural Language Processing and 20SCE253
Decision Support System
Text Mining
20SCE244 Cyber Security and Cyber law 20SCE254 Computer Vision

Note:
1. Technical Seminar: CIE marks shall be awarded by a committee comprising of HoD as Chairman, Guide/co-guide, if
any, and a senior faculty of the department. Participation in the seminar by all postgraduate students of the same and other
semesters of the programme shall be mandatory.
The CIE marks awarded for Technical Seminar, shall be based on the evaluation of Seminar Report, Presentation skill and
Question and Answer session in the ratio 50:25:25.
2. Internship: All the students shall have to undergo mandatory internship of 6 weeks during the vacation of I and II
semesters and /or II and III semesters. A University examination shall be conducted during III semester and the prescribed
credit shall be counted in the same semester. Internship shall be considered as a head of passing and shall be considered for
the award of degree. Those, who do not take-up/complete the internship shall be declared as fail in internship course and
have to complete the same during the subsequent University examination after satisfying the internship requirements.
 4

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Engineering (SCE)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
III SEMESTER
Teaching Hours /Week Examination

Total Marks
SEE Marks
Duration in

CIE Marks

Credits
Assignment
Field work/
Theory
Sl.

Practical/

hours
Course Course Code Course Title
No

1 PCC 20SCE31 ARM Processors 04 -- 03 40 60 100 4

2 PEC 20SCE32X Professional elective 3 04 -- 03 40 60 100 3
3 PEC 20SCE33X Professional elective 4 04 -- 03 40 60 100 3
4 Project 20SCE34 Project Work phase -1 -- 02 -- 100 -- 100 2
5 PCC 20SCE35 Mini-Project -- 02 -- 100 -- 100 2
(Completed during the
intervening vacation of I
6 Internship 20SCEI36 Internship and II semesters and /or
03 40 60 100 6
II and III semesters.)
TOTAL 12 02 12 260 240 500 20
Note: PCC: Professional core, PEC: Professional Elective.
Professional elective 3 Professional elective 4
Course Code under Course title Course Code Course title
20SCE32X under 20SCE33X
20SCE321 Machine Learning Techniques 20SCE331 Cloud Security
20SCE322 Multimedia Communications 20SCE332 Database Security
20SCE323 Advances in Storage Area Network 20SCE333 Software Defined Networks
20SCE324 Agile Technologies 20SCE334 Object Oriented Software Engineering

Note:
1. Project Phase-1:Students in consultation with the guide/co-guide if any, shall pursue literature survey and
complete the preliminary requirements of selected Project work. Each student shall prepare relevant introductory
project document, and present a seminar.
CIE marks shall be awarded by a committee comprising of HoD as Chairman, Guide/co-guide if any, and a
senior faculty of the department. The CIE marks awarded for project work phase -1, shall be based on the
evaluation of Project Report, Project Presentation skill and Question and Answer session in the ratio 50:25:25.
SEE (University examination) shall be as per the University norms.
2. Internship: Those, who have not pursued /completed the internship shall be declared as fail in internship
course and have to complete the same during subsequent University examinations after satisfying the internship
requirements. Internship SEE (University examination) shall be as per the University norms.
 5

VISVESVARAYA TECHNOLOGICAL UNIVERSITY, BELAGAVI

Scheme of Teaching and Examinations – 2020 - 21
M.Tech Computer Engineering (SCE)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
IV SEMESTER
Teaching Hours /Week Examination

Total Marks
Duration in

CIE Marks

Credits
Assignment

SEE Marks
Field work/
Theory
Sl.

Viva voce
Practical/

hours
Course Course Code Course Title
No

1 Project 20SCE41 Project work phase -2 -- 04 03 40 60 100 20

TOTAL -- 04 03 40 60 100 20

Note:
1. Project Phase-2:
CIE marks shall be awarded by a committee comprising of HoD as Chairman, Guide/co-guide, if any, and a Senior faculty of the
department. The CIE marks awarded for project work phase -2, shall be based on the evaluation of Project Report subjected to plagiarism
check, Project Presentation skill and Question and Answer session in the ratio 50:25:25.
SEE shall be at the end of IV semester. Project work evaluation and Viva-Voce examination (SEE), after satisfying the plagiarism check,
shall be as per the University norms.
 M.TECH COMPUTER ENGINEERING (SCE)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER – I
ADVANCED DIGITAL DESIGN
Course Code 20SCE12 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction: Design methodology – An introduction; IC technology options
Module-2
Logic Design with Verilog: Structural models of combinational logic; Logic simulation, Design
verification, and Test methodology; Propagation delay; Truth-Table models of Combinational
and sequential logic with Verilog.
Module-3
Logic Design with Behavioral Models: Behavioral modeling; A brief look at data types for
behavioral modeling; Boolean-Equation – Based behavioral models of combinational logic;
Propagation delay and continuous assignments; Latches and Level – Sensitive circuits in
Verilog; Cyclic behavioral models of Flip-Flops and Latches; Cyclic behavior and edge
detection; A comparison of styles for behavioral modeling; Behavioral models of multiplexers,
encoders, and decoders; Dataflow models of a Linear- Feedback Shift Register; Modeling digital
machines with repetitive algorithms; Machines with multi-cycle operations; Design
documentation with functions and tasks; Algorithmic state machine charts for behavioral
modeling; ASMD charts; Behavioral models of counters, shift registers and register files; Switch
debounce, meta-stability and synchronizers for asynchronous signals; Design example
Module-4
Synthesis of Combinational and Sequential Logic: Introduction to synthesis; Synthesis of
combinational logic; Synthesis of sequential logic with latches; Synthesis of three-state devices
and bus interfaces; Synthesis of sequential logic with flip-flops; Synthesis of explicit state
machines; Registered logic; State encoding; Synthesis of implicit state machines, registers and
counters; Resets; Synthesis of gated clocks and clock enables; Anticipating the results of
synthesis; Synthesis of loops; Design traps to avoid; Divide and conquer: Partitioning a design.
Module-5
Programmable Logic and Storage Devices: Programmable logic devices; storage devices; PLA;
PAL; Programmability of PLDs; CPLDs; FPGAs; Verlog-Based design flows for FPGAs;
Synthesis with FPGAs.

Course outcomes:
At the end of the course the student will be able to:
• Work on various IC technology options.
• Demonstrate logic simulation, Design verification, Verilog.
• Work on Flip-Flops and Latches; multiplexers, encoders, and decoders, synchronizers for
asynchronous signals.
• Design and implement circuits on combinational logic; Registered logic; registers and counters;
Resets; Divide and conquer: Partitioning a design.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
 • The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Advanced Digital Design with the Michael D. Celetti PHI 2013
Verilog HDL
Reference Books
1 Degital Design –An PeterJ. Asheden ELSEVIER 2013
Embedded Systems Approach
Using VERILOG
2 Fundamentals of Digital Logic Stephen Brown, Tata Mc-Graw Hill 2009
with Verilog Design Zvonko Vranesic

M.TECH COMPUTER ENGINEERING (SCE)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER – I
EMBEDDED COMPUTING SYSTEMS
Course Code 20SCE13 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction to embedded systems: Embedded systems, Processor embedded into a system,
Embedded hardware units and device in a system, Embedded software in a system, Examples of
embedded systems, Design process in embedded system, Formalization of system design, Design
process and design examples, Classification of embedded systems, skills required for an
embedded system designer.
Module 2
Devices and communication buses for devices network: IO types and example, Serial
communication devices, Parallel device ports, Sophisticated interfacing features in device ports,
Wireless devices, Timer and counting devices, Watchdog timer, Real time clock, Networked
embedded systems, Serial bus communication protocols, Parallel bus device protocols-parallel
communication internet using ISA, PCI, PCI-X and advanced buses, Internet enabled systems-
network protocols, Wireless and mobile system protocols.
Module 3
Device drivers and interrupts and service mechanism: Programming-I/O busy-wait approach
without interrupt service mechanism, ISR concept, Interrupt sources, Interrupt servicing
(Handling) Mechanism, Multiple interrupts, Context and the periods for context switching,
interrupt latency and deadline, Classification of processors interrupt service mechanism from
Context-saving angle, Direct memory access, Device driver programming.
Module 4
Inter process communication and synchronization of processes, Threads and tasks: Multiple
process in an application, Multiple threads in an application, Tasks, Task states, Task and Data,
Clear-cut distinction between functions. ISRS and tasks by their characteristics, concept and
semaphores, Shared data, Inter-process communication, Signal function, Semaphore functions,
Message Queue functions, Mailbox functions, Pipe functions, Socket functions, RPC functions.
Module 5
Real-time operating systems: OS Services, Process management, Timer functions, Event
functions, Memory management, Device, file and IO subsystems management, Interrupt routines
in RTOS environment and handling of interrupt source calls, Real-time operating systems, Basic
design using an RTOS, RTOS task scheduling models, interrupt latency and response of the tasks
as performance metrics, OS security issues. Introduction to embedded software development
process and tools, Host and target machines, Linking and location software.

Course outcomes:
At the end of the course the student will be able to:
• Distinguish the characteristics of embedded computer systems.
• Examine the various vulnerabilities of embedded computer systems.
• Design an embedded system.
• Design and develop modules using RTOS.
• Implement RPC, threads and tasks

Question paper pattern:

The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Embedded Systems: Architecture, Raj Kamal Tata McGraw hill 2nd edition 2013
Programming, and Design
Reference Books
1 Computer as Components, Marilyn Wolf Elsevier 3rd edition, 2014
Principles of Embedded
Computing System Design

M.TECH COMPUTER ENGINEERING (SCE)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER – I
CLOUD COMPUTING
Course Code 20SCE14, 20LNI15, 20SIT22, 20SSE251,
CIE Marks 40
20SCN31, 20SCS243
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction, Cloud Infrastructure: Cloud computing, Cloud computing delivery models and
services, Ethical issues, Cloud vulnerabilities, Cloud computing at Amazon, Cloud computing
the Google perspective, Microsoft Windows Azure and online services, Open-source software
platforms for private clouds, Cloud storage diversity and vendor lock-in, Energy use and
ecological impact, Service level agreements, User experience and software licensing. Exercises
and problems.
Module 2
Cloud Computing: Application Paradigms.: Challenges of cloud computing, Architectural
styles of cloud computing, Workflows: Coordination of multiple activities, Coordination based
on a state machine model: The Zookeeper, The Map Reduce programming model, A case study:
The Gre The Web application, Cloud for science and engineering, High-performance computing
on a cloud, Cloud computing for Biology research, Social computing, digital content and cloud
computing.
Module 3
Cloud Resource Virtualization: Virtualization, Layering and virtualization, Virtual machine
monitors, Virtual Machines, Performance and Security Isolation, Full virtualization and
paravirtualization, Hardware support for virtualization, Case Study: Xen a VMM based
paravirtualization, Optimization of network virtualization, vBlades, Performance comparison of
virtual machines, The dark side of virtualization, Exercises and problems
Module 4
Cloud Resource Management and Scheduling: Policies and mechanisms for resource
management, Application of control theory to task scheduling on a cloud, Stability of a two-level
resource allocation architecture, Feedback control based on dynamic thresholds, Coordination of
specialized autonomic performance managers, A utility-based model for cloud-based Web
services, Resourcing bundling: Combinatorial auctions for cloud resources, Scheduling
algorithms for computing clouds, Fair queuing, Start-time fair queuing, Borrowed virtual time,
Cloud scheduling subject to deadlines, Scheduling MapReduce applications subject to deadlines,
Resource management and dynamic scaling, Exercises and problems.
Module 5
Cloud Security, Cloud Application Development: Cloud security risks, Security: The top
concern for cloud users, Privacy and privacy impact assessment, Trust, Operating system
security, Virtual machine Security, Security of virtualization, Security risks posed by shared
images, Security risks posed by a management OS, A trusted virtual machine monitor, Amazon
web services: EC2 instances, Connecting clients to cloud instances through firewalls, Security
rules for application and transport layer protocols in EC2, How to launch an EC2 Linux instance
and connect to it, How to use S3 in java, Cloud-based simulation of a distributed trust algorithm,
A trust management service, A cloud service for adaptive data streaming, Cloud based optimal
FPGA synthesis .Exercises and problems.

Course outcomes:
At the end of the course the student will be able to:
• Compare the strengths and limitations of cloud computing
• Identify the architecture, infrastructure and delivery models of cloud computing
• Apply suitable virtualization concept.
• Choose the appropriate cloud player
• Address the core issues of cloud computing such as security, privacy and interoperability
 • Design Cloud Services
• Set a private cloud
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Cloud Computing Theory and Dan C Marinescu Elsevier(MK) 2013.
Practice
Reference Books
1 Rajkumar Buyya , James Broberg, Computing Willey 2014
Andrzej Goscinski Principles and
Paradigms
2 Cloud Computing Implementation, John W CRC Press 2013
Management and Security Rittinghouse, James
F Ransome

M.TECH COMPUTER ENGINEERING (SCE)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER – I
DISTRIBUTED OPERATING SYSTEM
Course Code 20SCE15, 20SIT15 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Fundamentals: What is Distributed Computing Systems? Evolution of Distributed Computing
System; Distributed Computing System Models; What is Distributed Operating System? Issues
in Designing a Distributed Operating System; Introduction to Distributed Computing
Environment (DCE). Message Passing: Introduction, Desirable features of a Good Message
Passing System, Issues in PC by Message Passing, Synchronization, Buffering, Multi-datagram
Messages, Encoding and Decoding of Message Data, Process Addressing, Failure Handling,
Group Communication, Case Study: 4.3 BSD UNIX IPC Mechanism.
Module 2
Remote Procedure Calls: Introduction, The RPC Model, Transparency of RPC, Implementing
RPC Mechanism, Stub Generation, RPC Messages, Marshaling Arguments and Results, Server
Management, Parameter-Passing Semantics, Call Semantics, Communication Protocols for
RPCs, Complicated RPCs, Client-Server Binding, Exception Handling, Security, Some Special
Types of RPCs, RPC in Heterogeneous Environments, Lightweight RPC, Optimization for Better
Performance, Case Studies: Sun RPC.
Module 3
Distributed Shared Memory: Introduction, General Architecture of DSM Systems, Design and
Implementation Issues of DSM, Granularity, Structure of Shared Memory Space, Consistency
Models, Replacement Strategy, Thrashing, Other approaches to DSM, Heterogeneous DSM,
Advantages of DSM. Synchronization: Introduction, Clock Synchronization, Event Ordering,
Mutual Exclusion, Dead Lock, Election Algorithms.
Module 4
Resource Management: Introduction, Desirable Features of a Good Global Scheduling
Algorithm, Task Assignment Approach, Load – Balancing Approach, Load – Sharing Approach
Process Management: Introductjion, Process Migration, Threads.
Module 5
Distributed File Systems: Introduction, Desirable Features of a Good Distributed File System,
File models, File–Accessing Models, File – Sharing Semantics, File – Caching Schemes, File
Replication, Fault Tolerance, Atomic Transactions and Design Principles.

Course outcomes:
At the end of the course the student will be able to:
• The concepts underlying distributed systems
• Demonstrate an ability to apply theory and techniques to unseen problems.
• Demonstrate the Mutual exclusion, Deadlock detection and agreement protocols of Distributed
operating system
• Explore the various resource management techniques for distributed systems.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Distributed Operating Systems: Pradeep. K. Sinha PHI 2007
Concepts and Design
Reference Books
1 Distributed Operating Systems Andrew S. Pearson Education 2013
Tanenbaum

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
MANAGING BIG DATA
Course Code 20SIT31, 20LNI251, 20SCE21, 20SFC331 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Meet Hadoop: Data!, Data Storage and Analysis, Querying All Your Data, Beyond Batch,
Comparison with Other Systems: Relational Database Management Systems, Grid Computing,
Volunteer Computing Hadoop Fundamentals MapReduce A Weather Dataset: Data
Format, Analyzing the Data with Unix Tools, Analyzing the Data with Hadoop: Map and
Reduce, Java MapReduce, Scaling Out: Data Flow, Combiner Functions, Running a
Distributed MapReduce Job, Hadoop Streaming
The Hadoop Distributed Filesystem The Design of HDFS, HDFS Concepts: Blocks,
Namenodes and Datanodes, HDFS Federation, HDFS High-Availability, The Command-Line
Interface, Basic Filesystem Operations, Hadoop Filesystems Interfaces, The Java Interface,
Reading Data from a Hadoop URL, Reading Data Using the FileSystem API, Writing Data,
Directories, Querying the Filesystem, Deleting Data, Data Flow: Anatomy of a File Read,
Anatomy of a File Write.

Module -2
YARN Anatomy of a YARN Application Run: Resource Requests, Application Lifespan,
Building YARN Applications, YARN Compared to MapReduce, Scheduling in YARN: The
FIFO Scheduler, The Capacity Scheduler, The Fair Scheduler, Delay Scheduling, Dominant
Resource Fairness
Hadoop I/O Data Integrity, Data Integrity in HDFS, LocalFileSystem,
ChecksumFileSystem, Compression, Codecs, Compression and Input Splits, Using
Compression in MapReduce, Serialization, The Writable Interface, Writable Classes,
Implementing a Custom Writable, Serialization Frameworks, File-Based Data Structures:
SequenceFile
Module – 3
Developing a MapReduce Application The Configuration API, Combining Resources,
Variable Expansion, Setting Up the Development Environment, Managing Configuration,
GenericOptionsParser, Tool, and ToolRunner, Writing a Unit Test with MRUnit: Mapper,
Reducer, Running Locally on Test Data, Running a Job in a Local Job Runner, Testing the
Driver, Running on a Cluster, Packaging a Job, Launching a Job, The MapReduce Web UI,
Retrieving the Results, Debugging a Job, Hadoop Logs, Tuning a Job, Profiling Tasks,
MapReduce Workflows: Decomposing a Problem into MapReduce Jobs, JobControl, Apache
Oozie
How MapReduce Works Anatomy of a MapReduce Job Run, Job Submission, Job
Initialization, Task Assignment, Task Execution, Progress and Status Updates, Job
Completion, Failures: Task Failure, Application Master Failure, Node Manager Failure,
Resource Manager Failure, Shuffle and Sort: The Map Side, The Reduce Side, Configuration
Tuning, Task Execution: The Task Execution Environment, Speculative Execution, Output
Committers
Module-4
MapReduce Types and Formats: MapReduce Types, Input Formats: Input Splits and
Record,s Text Input, Binary Input, Multiple Inputs, Database Input (and Output) Output
Formats: Text Output, Binary Output, Multiple Outputs, Lazy Output, Database Output,
Flume Installing Flume, An Example,Transactions and Reliability, Batching, The HDFS Sink,
Partitioning and Interceptors, File Formats, Fan Out, Delivery Guarantees, Replicating and
Multiplexing Selectors, Distribution: Agent Tiers, Delivery Guarantees, Sink Groups, Integrating
Flume with Applications, Component Catalog
Module-5
Pig Installing and Running Pig, Execution Types, Running Pig Programs, Grunt, Pig Latin
Editors, An Example: Generating Examples, Comparison with Databases, Pig Latin:
Structure, Statements, Expressions, Types, Schemas, Functions, Data Processing Operators:
Loading and Storing Data, Filtering Data, Grouping and Joining Data, Sorting Data,
Combining and Splitting Data.
Spark An Example: Spark Applications, Jobs, Stages and Tasks, A Java Example, A Python
Example, Resilient Distributed Datasets: Creation, Transformations and Actions, Persistence,
Serialization, Shared Variables, Broadcast Variables, Accumulators, Anatomy of a Spark Job
Run, Job Submission, DAG Construction, Task Scheduling, Task Execution, Executors and
Cluster Managers: Spark on YARN

Course outcomes:
At the end of the course the student will be able to:
• Understand managing big data using Hadoop and SPARK technologies
• Explain HDFS and MapReduce concepts
• Install, configure, and run Hadoop and HDFS.
• Perform map-reduce analytics using Hadoop and related tools
• Explain SPARK concepts
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Hadoop: The Definitive Guide Tom White O'Reilley Third Edition, 2012
Reference Books
1 SPARK: The Definitive Guide Matei Zaharia Oreilly 2018
and Bill Chambers
2 Apache Flume: Distributed Log . D'Souza and Steve Oreilly 2014
Collection for Hadoop Hoffman

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -
MULTICORE ARCHITECTURE AND PROGRAMMING
Course Code 20SCE22,
CIE Marks 40
20SCS324
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Classes of Computers, Trends in Technology, Power, Energy and Cost – Dependability –
Measuring, Reporting and Summarizing Performance.
Single core to Multi-core architectures: Limitations of Single Core Processors - The Multi core
era – Case Studies of Multi core Architectures.
System Overview of Threading : Defining Threads, System View of Threads, Threading above
the Operating System, Threads inside the OS, Threads inside the Hardware, What Happens
When a Thread Is Created, Application Programming Models and Threading,
Module-2
Fundamental Concepts of Parallel Programming: Designing for Threads, Task Decomposition,
Data Decomposition, Data Flow Decomposition, Implications of Different Decompositions,
Parallel Programming Patterns, A Motivating Problem: Error Diffusion, Analysis of the Error
Diffusion Algorithm, An Alternate Approach: Parallel Error Diffusion.
Threading and Parallel Programming Constructs: Performance – Scalability – Synchronization
and data sharing – Data races – Synchronization primitives (mutexes, locks, semaphores,
barriers) – deadlocks and livelocks – communication between threads (condition variables,
signals, message queues and pipes).
Module-3
TLP AND MULTIPROCESSORS : Symmetric and Distributed Shared Memory Architectures –
Cache Coherence Issues -Performance Issues – Synchronization Issues – Models of Memory
Consistency -Interconnection Networks – Buses, Crossbar and Multi-stage Interconnection
Networks.
Module-4
A Portable Solution for Threading : Challenges in Threading a Loop, Loop-carried Dependence,
Data-race Conditions, Managing Shared and Private Data, Loop Scheduling and Portioning,
Effective Use of Reductions, Minimizing Threading Overhead, Work-sharing Sections,
Performance-oriented Programming, Using Barrier and No wait, Interleaving Single-thread and
Multi-thread Execution.
OpenMP: OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing
Constructs - Library functions – Handling Data and Functional Parallelism – Handling Loops –
Performance Considerations.
Module-5
Solutions to Common Parallel Programming Problems : Too Many Threads, Data Races,
Deadlocks, and Live Locks, Deadlock, Heavily Contended Locks, Priority Inversion, Solutions
for Heavily Contended Locks, Non-blocking Algorithms, ABA Problem, Cache Line Ping-
ponging, Memory Reclamation Problem, Recommendations, Thread-safe Functions and
Libraries, Memory Issues, Bandwidth, Working in the Cache, Memory Contention, Cache-
related Issues, False Sharing, Memory Consistency, Current IA-32 Architecture, Itanium
Architecture.

Course outcomes:
At the end of the course the student will be able to:
• Identify the limitations of single core architecture and the need for multicore architectures
• Define fundamental concepts of parallel programming and its design issues
• Solve the issues related to multiprocessing and suggest solutions
• Demonstrate the role of OpenMP and programming concept
• Make out the salient features of different multicore architectures and how they exploit
 parallelism
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Multicore Programming, Increased Shameem Akhter Intel Press 2006
Performance through Software and Jason Roberts
Multi-threading

2 An Introduction to Parallel Peter S Pacheco Morgan/Kuffman, 2011

Programming Elsevier

3 Multicore Apllication Darryl Gove Pearson 2011

Programming for Windows, Linux,
Oracle, Solaris
Reference Books
1 Parallel Programming in C with Michael J Quinn Tata McGraw Hill 2003
MPI and OpenMP

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
INTERNET OF THINGS
Course Code 20SCS15, 20LNI22, 20SCE23, 20SCN14 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
What is The Internet of Things? Overview and Motivations, Examples of Apllications, IPV6
Role, Areas of Development and Standardization, Scope of the Present Investigation.Internet of
Things Definitions and frameworks-IoT Definitions, IoT Frameworks, Basic Nodal Capabilities.
Internet of Things Apjplication Examples-Overview, Smart Metering/Advanced Metering
Infrastructure-Health/Body Area Networks, City Automation, Automotive Applications, Home
Automation, Smart Cards, Tracking, Over-The-Air-Passive Surveillance/Ring of Steel, Control
Application Examples, Myriad Other Applications.
Module -2
Fundamental IoT Mechanism and Key Technologies-Identification of IoT Object and Services,
Structural Aspects of the IoT, Key IoT Technologies. Evolving IoT Standards-Overview and
Approaches, IETF IPV6 Routing Protocol for RPL Roll, Constrained Application Protocol,
Representational State Transfer, ETSI M2M,Third Generation Partnership Project Service
Requirements for Machine-Type Communications, CENELEC, IETF IPv6 Over Low power
WPAN, Zigbee IP(ZIP),IPSO
Module – 3
Layer ½ Connectivity: Wireless Technologies for the IoT-WPAN Technologies for IoT/M2M,
Cellular and Mobile Network Technologies for IoT/M2M,Layer 3 Connectivity :IPv6
Technologies for the IoT: Overview and Motivations. Address Capabilities,IPv6 Protocol
Overview, IPv6 Tunneling, IPsec in IPv6,Header Compression Schemes, Quality of Service in
IPv6, Migration Strategies to IPv6.
Module-4
Case Studies illustrating IoT Design-Introduction, Home Automation, Cities, Environment,
Agriculture, Productivity Applications.
Module-5
Data Analytics for IoT – Introduction, Apache Hadoop, Using Hadoop MapReduce for Batch
Data Analysis, Apache Oozie, Apache Spark, Apache Storm, Using Apache Storm for Real-time
Data Analysis, Structural Health Monitoring Case Study.

Course outcomes:
At the end of the course the student will be able to:
• Develop schemes for the applications of IOT in real time scenarios
• Manage the Internet resources
• Model the Internet of things to business
• Understand the practical knowledge through different case studies
Understand data sets received through IoT devices and tools used for analysis
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Building the Internet of Things Daniel Minoli Wiley 2013
with IPv6 and MIPv6:The
Evolving World of M2M
Communications
2 Internet of Things: A Hands on Arshdeep Bahga, Universities Press 2015
Approach Vijay Madisetti
Reference Books
1 The Internet of Things Michael Miller Pearson 2015 First Edition
2 Designing Connected Products Claire O’Reilly First Edition, 2015
Rowland,Elizabeth
 Goodman et.al

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
WIRELESS NETWORKS & MOBILE COMPUTING
Course Code 20LNI331, 20SCE241 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Mobile Computing Architecture: Architecture for Mobile Computing, 3-tier Architecture, Design
Considerations for Mobile Computing. Emerging Technologies: Wireless broadband (WiMAX),
Mobile IP: Introduction, discovery, Registration, Tunneling, Cellular IP, Mobile IP with IPv6.
Wireless Networks : Global Systems for Mobile Communication (GSM): GSM Architecture,
Entities, Call routing in GSM, PLMN Interface, GSM Addresses and Identities, Network Aspects
in GSM, Mobility Management, GSM Frequency allocation. Short Service Messages (SMS):
Introduction to SMS, SMS Architecture, SMMT, SMMO, SMS as Information bearer,
applications, GPRS and Packet Data Network, GPRS Network Architecture, GPRS Network
Operations, Data Services in GPRS, Applications for GPRS, Billing and Charging in GPRS.
Module -2
Spread Spectrum technology, IS-95, CDMA versus GSM, Wireless Data, Third Generation
Networks, Applications on 3G, Mobile Client: Moving beyond desktop, Mobile handset
overview, Mobile phones and their features, PDA, Design Constraints in applications for
handheld devices.
Module – 3
Mobile OS and Computing Environment: Smart Client Architecture, The Client: User Interface,
Data Storage, Performance, Data Synchronization, Messaging. The Server: Data
Synchronization, Enterprise Data Source, Messaging. Mobile Operating Systems: WinCE, Palm
OS, Symbian OS, Linux, Proprietary OS Client Development: The development process, Need
analysis phase, Design phase, Implementation and Testing phase, Deployment phase,
Development Tools, Device Emulators

Module-4
Building Wireless Internet Applications: Thin client overview: Architecture, the client,
Middleware, messaging Servers, Processing a Wireless request, Wireless Applications Protocol
(WAP) Overview, Wireless Languages: Markup Languages, HDML, WML, HTML, cHTML,
XHTML, VoiceXML.
Module-5
J2ME: Introduction, CDC, CLDC, MIDP; Programming for CLDC, MIDlet model, Provisioning,
MIDlet life-cycle, Creating new application, MIDlet event handling, GUI in MIDP, Low level
GUI Components, Multimedia APIs; Communication in MIDP, Security Considerations in
MIDP.

Course outcomes:
At the end of the course the student will be able to:
• Explain state of art techniques in wireless communication.
 • Discover CDMA, GSM. Mobile IP, WImax
• Demonstrate program for CLDC, MIDP let model and security concerns
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Mobile Computing,Technology, Ashok Talukder, Tata McGraw Hill 2nd Edition, 2010.
Applications and Service Creation Roopa Yavagal,
Hasan Ahmed
2 Mobile and Wireless Design Martyn Mallik Wiley India 2003
Essentials
Reference Books
1 Mobile Computing Raj kamal Oxford University 2007
Press
2 Wireless Communications and Iti Saha Misra Tata McGraw Hill 2009
Networks, 3G and Beyond

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -
PATTERN RECOGNITION
Course Code 20SCE242, 20SCS244 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction: Definition of PR, Applications, Datasets for PR, Different paradigms for PR,
Introduction to probability, events, random variables, Joint distributions and densities, moments.
Estimation minimum risk estimators, problems
Module -2
Representation: Data structures for PR, Representation of clusters, proximity measures, size of
patterns, Abstraction of Data set, Feature extraction, Feature selection, Evaluation
Module – 3
Nearest Neighbor based classifiers & Bayes classifier: Nearest neighbor algorithm, variants of
NN algorithms, use of NN for transaction databases, efficient algorithms, Data reduction,
prototype selection, Bayes theorem, minimum error rate classifier, estimation of probabilities,
estimation of probabilities, comparison with NNC, Naive Bayes classifier, Bayessian belief
network
Module-4
Naive Bayes classifier, Bayessian belief network, Decision Trees: Introduction, DT for PR,
Construction of DT, Splitting at the nodes, Over fitting & Pruning, Examples , Hidden
Markov models: Markov models for classification, Hidden Markov models and classification
using HMM
Module-5
Clustering: Hierarchical (Agglomerative, single/complete/average linkage, wards, Partitional
(Forgy’s, k-means, Isodata), clustering large data sets, examples, An application: Handwritten
Digit recognition

Course outcomes:
At the end of the course the student will be able to:
• Explain pattern recognition principals
• Develop algorithms for Pattern Recognition.
• Develop and analyze decision tress.
• Design the nearest neighbor classifier.
• Apply Decision tree and clustering techniques to various applications
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Pattern Recognition ( An V Susheela Devi, M Universities Press 2011
Introduction) Narsimha Murthy
2 Pattern Recognition & Image Earl Gose, Richard PH 1996.
Analysis Johnsonbaugh,
Steve Jost
Reference Books
1 Pattern Classification Duda R. O., P.E. John Wiley and sons 2000.
Hart, D.G. Stork

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -II
NATURAL LANGUAGE PROCESSING
Course Code 20SCS242,
CIE Marks 40
20SCE243
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
OVERVIEW AND LANGUAGE MODELING: Overview: Origins and challenges of NLP-
Language and Grammar-Processing Indian Languages- NLP Applications-Information Retrieval.
Language Modeling: Various Grammar- based Language Models-Statistical Language Model.
Module -2
WORD LEVEL AND SYNTACTIC ANALYSIS: Word Level Analysis: Regular Expressions-
Finite-State Automata-Morphological Parsing-Spelling Error Detection and correction-Words
and Word classes-Part-of Speech Tagging. Syntactic Analysis: Context-free Grammar-
Constituency- Parsing-Probabilistic Parsing.
Module - 3
Extracting Relations from Text: From Word Sequences to Dependency Paths: Introduction,
Subsequence Kernels for Relation Extraction, A Dependency-Path Kernel for Relation
Extraction and Experimental Evaluation. Mining Diagnostic Text Reports by Learning to
Annotate Knowledge Roles: Introduction, Domain Knowledge and Knowledge Roles, Frame
Semantics and Semantic Role Labeling, Learning to Annotate Cases with Knowledge Roles and
Evaluations. A Case Study in Natural Language Based Web Search: InFact System Overview,
The GlobalSecurity.org Experience.
Module-4
Evaluating Self-Explanations in iSTART: Word Matching, Latent Semantic Analysis, and Topic
Models: Introduction, iSTART: Feedback Systems, iSTART: Evaluation of Feedback Systems,
Textual Signatures: Identifying Text-Types Using Latent Semantic Analysis to Measure the
Cohesion of Text Structures: Introduction, Cohesion, Coh-Metrix, Approaches to Analyzing
Texts, Latent Semantic Analysis, Predictions, Results of Experiments. Automatic Document
Separation: A Combination of Probabilistic Classification and Finite-State Sequence Modeling:
Introduction, Related Work, Data Preparation, Document Separation as a Sequence Mapping
Problem, Results. Evolving Explanatory Novel Patterns for Semantically-Based Text Mining:
Related Work, A Semantically Guided Model for Effective TextMining.
Module-5
INFORMATION RETRIEVAL AND LEXICAL RESOURCES: Information Retrieval: Design
features of Information Retrieval Systems-Classical, Non classical, Alternative Models of
Information Retrieval – valuation Lexical Resources: World Net-Frame Net- Stemmers-POS
Tagger- Research Corpora.

Course outcomes:
At the end of the course the student will be able to:
• Analyze the natural language text.
• Generate the natural language.
• Demonstrate Text mining.
• Apply information retrieval techniques.
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
 • Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Natural Language Processing and Tanveer Siddiqui, Oxford University 2008
Information Retrieval U.S. Tiwary Press
2 Anne Kao and Stephen R. Potee Natural Springer-Verlag 2007
LanguageProcessing London Limited
andText Mining
Reference Books
1 Speech and Language Processing: Daniel Jurafsky and Prentice Hall 2008 2nd Edition
Anintroduction to Natural James H Martin
Language Processing,
Computational Linguistics and
SpeechRecognition
2 Natural Language Understanding James Allen Benjamin/Cumming 2nd edition, 1995
spublishing
company
3 Information Storage and Retrieval Gerald J. Kowalski Kluwer academic 2000.
systems and Mark.T. Publishers
Maybury
4 Natural Language Processing with Steven Bird, Ewan O'Reilly Media 2009
Python Klein, Edward
Loper
5 Foundations of Statistical Natural Christopher MIT Press 1999
Language Processing D.Manning and
Hinrich Schutze

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
CYBER SECURITY AND CYBER LAW
Course Code 20LNI244, 20SCE244, 20SIT244 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction to Cybercrime: Cybercrime: Definition and Origins of the Word, Cybercrime and
Information Security, Who are Cybercriminals?, Classifications of Cybercrimes, Cybercrime:
The Legal Perspectives, Cybercrimes: An Indian Perspective, Cybercrime and the Indian ITA
2000, A Global Perspective on Cybercrimes, Cybercrime Era: Survival Mantra for the Netizens.
Cyberoffenses: How Criminals Plan Them: How Criminals Plan the Attacks, Social
Engineering, Cyberstalking, Cybercafe and Cybercrimes, Botnets: The Fuel for
Cybercrime, Attack Vector, Cloud Computing.

Module -2
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile and Wireless
Devices, Trends in Mobility, Credit Card Frauds in Mobile and Wireless Computing Era,
Security Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices,
Authentication Service Security, Attacks on Mobile/Cell Phones, Mobile Devices: Security
Implications for organizations, Organizational Measures for Handling Mobile, Organizational
Security Policies and Measures in Mobile Computing Era, Laptops

Module – 3
Tools and Methods Used in Cybercrime: Introduction, Proxy Servers and Anonymizers,
Phishing, Password Cracking, Keyloggers and Spywares, Virus and Worms, Trojan Horses and
Backdoors, Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Overflow, Attacks on
Wireless Networks. Phishing and Identity Theft: Introduction, Phishing, Identity Theft (ID
Theft).
Module-4
Understanding Computer Forensics: Introduction, Historical Background of Cyberforensics,
Digital Forensics Science, The Need for Computer Forensics, Cyberforensics and Digital
Evidence, Forensics Analysis of E-Mail, Digital Forensics Life Cycle, Chain of Custody
Concept, Network Forensics, Approaching a Computer Forensics Investigation, Setting up a
Computer Forensics Laboratory: Understanding the Requirements, Computer Forensics and
Steganography, Relevance of the OSI 7 Layer Model to Computer Forensics, Forensics and
Social Networking Sites: The Security/Privacy Threats, Computer Forensics from Compliance
Perspective, Challenges in Computer Forensics, Special Tools and Techniques, Forensics
Auditing, Antiforensics.
Module-5
Introduction to Security Policies and Cyber Laws: Need for An Information Security Policy,
Information Security Standards – Iso, Introducing Various Security Policies and Their Review
Process, Introduction to Indian Cyber Law, Objective and Scope of the it Act, 2000, Intellectual
Property Issues, Overview of Intellectual - Property - Related Legislation in India, Patent,
Copyright, Law Related to Semiconductor Layout and Design, Software License.

Course outcomes:
At the end of the course the student will be able to:
• Define cyber security, cyber law and their roles
• Demonstrate cyber security cybercrime and forensics.
• Infer legal issues in cybercrime,
• Demonstrate tools and methods used in cybercrime and security.
• Illustrate evidence collection and legal challenges
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Cyber Security: Understanding Sunit Belapure and Wiley India Pvt Ltd 2013
Cyber Crimes, Computer Nina Godbole
Forensics And Legal Perspectives
2 Introduction to information Surya Prakash Dreamtech Press 2015
security and cyber laws Tripathi, Ritendra
Goyal, Praveen
Kumar Shukla
Reference Books
1 Cybersecurity: Managing Systems, Thomas J. Mowbray John Wiley & Sons,
Conducting Testing, and
Investigating Intrusions
2 Cyber Security Essentials James Graham, CRC Press 2010
Ryan Olson, Rick
Howard

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER - III
WIRELESS SENSOR NETWORKS
Course Code 20SCS334, 20LNI324, 20SCE251, 20SCN251, CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
CHARACTERISTICS OF WSN
Characteristic requirements for WSN - Challenges for WSNs – WSN vs Adhoc Networks -
Sensor node architecture – Commercially available sensor nodes –Imote, IRIS, Mica Mote,
EYES nodes, BTnodes, TelosB, Sunspot -Physical layer and transceiver design considerations in
WSNs, Energy usage profile, Choice of modulation scheme, Dynamic modulation scaling,
Antenna considerations.
Module-2
MEDIUM ACCESS CONTROL PROTOCOLS
Fundamentals of MAC protocols - Low duty cycle protocols and wakeup concepts – Contention
based protocols - Schedule-based protocols - SMAC - BMAC - Traffic-adaptive medium access
protocol (TRAMA) - The IEEE 802.15.4 MAC protocol.
Module-3
ROUTING AND DATA GATHERING PROTOCOLS
Routing Challenges and Design Issues in Wireless Sensor Networks, Flooding and gossiping –
Data centric Routing – SPIN – Directed Diffusion – Energy aware routing - Gradient-based
routing - Rumor Routing – COUGAR – ACQUIRE – Hierarchical Routing - LEACH, PEGASIS
– Location Based Routing – GF, GAF, GEAR, GPSR – Real Time routing Protocols – TEEN,
APTEEN, SPEED, RAP - Data aggregation - data aggregation operations - Aggregate Queries in
Sensor Networks - Aggregation Techniques – TAG, Tiny DB.
Module-4
EMBEDDED OPERATING SYSTEMS
Operating Systems for Wireless Sensor Networks – Introduction - Operating System Design
Issues - Examples of Operating Systems – TinyOS – Mate – MagnetOS – MANTIS - OSPM -
EYES OS – SenOS – EMERALDS – PicOS – Introduction to Tiny OS – NesC – Interfaces and
Modules- Configurations and Wiring - Generic Components -Programming in Tiny OS using
NesC, Emulator TOSSIM.
Module-5
APPLICATIONS OF WSN
WSN Applications - Home Control - Building Automation - Industrial Automation - Medical
Applications - Reconfigurable Sensor Networks - Highway Monitoring - Military Applications -
Civil and Environmental Engineering Applications - Wildfire Instrumentation - Habitat
Monitoring - Nanoscopic Sensor Applications – Case Study: IEEE 802.15.4 LR-WPANs
Standard - Target detection and tracking - Contour/edge detection - Field sampling.

Course outcomes:
At the end of the course the student will be able to:
• Know the basics , characteristics and challenges of Wireless Sensor Network
• Apply the knowledge to identify appropriate physical and MAC layer protocol
• Apply the knowledge to identify the suitable routing algorithm based on the network and
user requirement
• Be familiar with the OS used in Wireless Sensor Networks and build basic modules
• Understand the applications of WSN in various fields
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Wireless Sensor Networks Kazem Sohraby, John Wiley & Sons 2007
Technology, Protocols, and Daniel Minoli and
Applications Taieb Znati
2 Protocols and Architectures for Holger Karl and John Wiley & Sons, 2005
Wireless Sensor Network Andreas Willig Ltd.
Reference Books
1 A survey of routing protocols in K. Akkaya and M. Elsevier Ad Hoc Vol. 3, no. 3, pp.
wireless sensor networks Younis Network Journal 325--349
2 TinyOS Programming Philip Levis
3 Wireless Sensor Network Designs Anna Ha´c John Wiley & Sons
Ltd.

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
ADVANCES IN DATA BASE MANAGEMENT SYSTEM
Course Code 20SCE252, 20SIT14, 20SSE15 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Review of Relational Data Model and Relational Database Constraints:
Relational model concepts; Relational model constraints and relational database schemas;
Update operations, anomalies, dealing with constraint violations, Types and violations.
Object and Object-Relational Databases:
Overview of Object Database Concepts, Object Database Extensions to SQL, The ODMG Object
Model and the Object Definition Language ODL, Object Database Conceptual Design, The
Object Query Language OQL, Overview of the C++ Language Binding in the ODMG Standard.
Module-2
Disk Storage, Basic File Structures, Hashing, and Modern Storage Architectures:
Introduction, Secondary Storage Devices, Buffering of Blocks, Placing File Records on Disk
Operations on Files, Files of Unordered Records (Heap Files) , Files of Ordered Records (Sorted
Files), Hashing Techniques, Other Primary File Organizations, Parallelizing Disk Access Using
RAID Technology, Modern Storage Architectures.
Distributed Database Concepts:
Distributed Database Concepts, Data Fragmentation, Replication, and Allocation Techniques for
Distributed Database Design, Overview of Concurrency Control and Recovery in Distributed
Databases, Overview of Transaction Management in Distributed Databases,Query Processing
and Optimization in Distributed Databases, Types of Distributed Database Systems , Distributed
Database Architectures, Distributed Catalog Management.
Module-3
NOSQL Databases and Big Data Storage Systems:
Introduction to NOSQL Systems, The CAP Theorem, Document-Based NOSQL Systems and
MongoDB, NOSQL Key-Value Stores, Column-Based or Wide Column NOSQL Systems,
NOSQL Graph Databases and Neo4j.
Big Data Technologies Based on MapReduce and Hadoop:
What Is Big Data? Introduction to MapReduce and Hadoop, Hadoop Distributed File System
(HDFS), MapReduce: Additional Details Hadoop v2 alias YARN, General Discussion

Module-4
Enhanced Data Models: Introduction to Active, Temporal, Spatial, Multimedia, and
Deductive Databases:
Active Database Concepts and Triggers, Temporal Database Concepts, Spatial Database
Concepts, Multimedia Database Concepts, Introduction to Deductive Databases.
Introduction to Information Retrieval and Web Search:
Information Retrieval (IR) Concepts, Retrieval Models, Types of Queries in IR Systems, Text
Preprocessing, Inverted Indexing, Evaluation Measures of Search Relevance, Web Search and
Analysis. Trends in Information Retrieval
Module-5
Data Mining Concepts:
Overview of Data Mining Technology, Association Rules, Classification, Clustering, Approaches
to Other Data Mining Problems, Applications of Data Mining, Commercial Data Mining Tools
Overview of Data Warehousing and OLAP:
Introduction, Definitions, and Terminology, Characteristics of Data Warehouses, Data Modeling
for Data Warehouses, Building a Data Warehouse, Typical Functionality of a Data Warehouse,
Data Warehouse versus Views, Difficulties of Implementing Data Warehouses.

Course outcomes:
At the end of the course the student will be able to:
• Select the appropriate high performance database like parallel and distributed
database
• Infer and represent the real world data using object oriented database
• Interpret rule set in the database to implement data warehousing of mining
• Discover and design database for recent applications database for better
interoperability
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Fundamentals of Database Elmasri and Navathe Pearson Education 2013
Systems
2 Database Management Systems Raghu McGraw-Hill 3rd Edition, 2013.
Ramakrishnan and
Johannes Gehrke
Reference Books
1 Database System Concepts Abraham McGraw Hill 6th Edition, 2010
Silberschatz, Henry
F. Korth, S.
Sudarshan

M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)

Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
DECISION SUPPORT SYSTEM
Course Code 20SCE253 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
Introduction to decision support systems: DSS Defined, History of decision support systems,
Ingredients of a DSS, Data and model management, DSS Knowledge base, User interfaces, User
interfaces, The DSS user, Categories and classes of DSSs, Chapter Summary. Decisions and
decision makers Decision makers: who are they, Decision styles, Decision effectiveness, How
can a DSS help?, A Typology of decisions, Decision theory and simon’s model of problem
solving, Bounded decision making, The process of choice, Cognitive processes, Biases and
heuristics in decision making, Chapter summary.
Module-2
Decisions in the organization: Understanding the organization, Organizational culture. Modeling
decision processes: Defining the problem and its structures, Decision models, Types of
probability, Techniques for forecasting probabilities, Calibration and sensitivity, Chapter
summary
Module-3
Group decision support and groupware technologies: Group Decision making, the problem with
groups, MDM support technologies, Managing MDM activities, the virtual workspace, chapter
summary. Executive information systems: What exactly is an EIS, Some EIS history, Why area
top executives so different?, EIS components, Making the EIS work, The future of executive
decision making and the EIS, chapter summary
Module-4
Designing and building decision support systems: Strategies for DSS analysis and design, The
DSS developer, DSS user interface issues, chapter summary. Implementing and integrating
decision support systems: DSS implementation, System evaluation, The importance of
integration, chapter summary.
Module-5
Creative decision making and problem solving What is creativity?, Creativity defined, The
occurrence of creativity, Creative problem solving techniques, Creativity and the role of
technology, chapter summary.

Course outcomes:
At the end of the course the student will be able to:
• Recognize the relationship between business information needs and decision making
• Appraise the general nature and range of decision support systems
• Appraise issues related to the development of DSS
• Select appropriate modeling techniques
• Analyze, design and implement a DSS
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 DECISION SUPPORT SYSTEM George M.Marakas PHI 2011
Reference Books
 M.TECH COMPUTER SCIENCE AND ENGINEERING (SCS)
Choice Based Credit System (CBCS) and Outcome Based Education(OBE)
SEMESTER -I
COMPUTER VISION
Course Code 20SCE254 CIE Marks 40
TeachingHours/Week 4:0:0
SEE Marks 60
(L:T:P)
Credits 04 Exam Hours 03
Module-1
CAMERAS: Pinhole Cameras, Radiometry – Measuring Light: Light in Space, Light Surfaces,
Important Special Cases, Sources, Shadows, And Shading: Qualitative Radiometry, Sources and
Their Effects, Local Shading Models, Application: Photometric Stereo, Interreflections: Global
Shading Models, Color: The Physics of Color, Human Color Perception, Representing Color, A
Model for Image Color, Surface Color from Image Color.
Module -2
Linear Filters: Linear Filters and Convolution, Shift Invariant Linear Systems, Spatial Frequency
and Fourier Transforms, Sampling and Aliasing, Filters as Templates, Edge Detection: Noise,
Estimating Derivatives, Detecting Edges, Texture: Representing Texture, Analysis (and
Synthesis) Using Oriented Pyramids, Application: Synthesis by Sampling Local Models, Shape
from Texture.
Module – 3
The Geometry of Multiple Views: Two Views, Stereopsis: Reconstruction, Human Stereposis,
Binocular Fusion, Using More Cameras, Segmentation by Clustering: What Is Segmentation?,
Human Vision: Grouping and Getstalt, Applications: Shot Boundary Detection and Background
Subtraction, Image Segmentation by Clustering Pixels, Segmentation by Graph-Theoretic
Clustering,
Module-4
Segmentation by Fitting a Model: The Hough Transform, Fitting Lines, Fitting Curves, Fitting
as a Probabilistic Inference Problem, Robustness, Segmentation and Fitting Using Probabilistic
Methods: Missing Data Problems, Fitting, and Segmentation, The EM Algorithm in Practice,
Tracking With Linear Dynamic Models: Tracking as an Abstract Inference Problem, Linear
Dynamic Models, Kalman Filtering, Data Association, Applications and Examples.
Module-5
Geometric Camera Models: Elements of Analytical Euclidean Geometry, Camera Parameters
and the Perspective Projection, Affine Cameras and Affine Projection Equations, Geometric
Camera Calibration: Least-Squares Parameter Estimation, A Linear Approach to Camera
Calibration, Taking Radial Distortion into Account, Analytical Photogrammetry, An
Application: Mobile Robot Localization, Model- Based Vision: Initial Assumptions, Obtaining
Hypotheses by Pose Consistency, Obtaining Hypotheses by pose Clustering, Obtaining
Hypotheses Using Invariants, Verification, Application: Registration In Medical Imaging
Systems, Curved Surfaces and Alignment.

Course outcomes:
At the end of the course the student will be able to:
• Implement fundamental image processing techniques required for computer vision
 • Perform shape analysis
• Implement boundary tracking techniques
• Apply chain codes and other region descriptors
• Apply Hough Transform for line, circle, and ellipse detections.
• Apply 3D vision techniques.
• Implement motion related techniques.
• Develop applications using computer vision techniques
Question paper pattern:
The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to
60.
• The question paper will have ten full questions carrying equal marks.
• Each full question is for 20 marks.
• There will be two full questions (with a maximum of four sub questions) from each
module.
• Each full question will have sub question covering all the topics under a module.
• The students will have to answer five full questions, selecting one full question from each
module.
Textbook/ Textbooks
Sl No Title of the book Name of the Publisher Name Edition and year
Author/s
1 Computer Vision – A Modern David A. Forsyth PHI Learning 2009
Approach and Jean Ponce
Reference Books
1 Computer and Machine Vision – E. R. Davies Elsevier 4th edition, 2013
Theory, Algorithms and
Practicalities