R24-M.Tech(CSE) course Structure and Syllabus (1)

Program Structure and Syllabus
M. Tech. (CSE)
Computer Science and

Engineering
R24 Regulations
September, 2024
M. Tech. PROGRAM STRUCTURE
I YEAR I SEMESTER
Course Hours per week
S. No Category Course Credits
Code L T P
1 PC Advanced Data structures 3 0 0 3
2 PC Python Programming 3 0 0 3
1. Information Security
2. An Introduction to Artificial
3 Intelligence
PE-I 3 0 0 3
3.Computer Networks and
Internet Protocol
4. Computer Vision
1. Introduction to Human
Computer Interaction
4 2. Data Mining
PE-II 3 0 0 3
3. Operating System
Fundamentals
4. Cloud Computing
1.Cyber Security and Privacy
2. Software Engineering
5 PE-III 3 0 0 3
3. Data Science
4. Introduction to Machine
Learning
Research Methodology 2 0 0 2
PC LAB Advanced Data structures Lab 0 0 3 1.5
PC LAB Python Programming Lab 0 0 3 1.5
TOTAL 17 0 6 20
I YEAR II SEMESTER
Course Hours per week
S. No Category Course Credits
Code L T P
1 PC Advanced Algorithms 3 1 0 4
2 PC Programming in JAVA 3 1 0 4
1.BlockChain and its
Applications
2.Introduction to Database
3 PE-IV 3 0 0 3
Systems
3. Natural Language Processing
4. Deep Learning
1. Internet of Things
2. Predictive Analytics with R
4
PE-V 3. Mobile Application 3 0 0 3
Development
4. Web Technologies
1. English for Professionals
2. Entrepreneurship
5 OE Development 3 0 0 3
3. Technical and Business
Communication Skills
4. Project Management
6 PC LAB JAVA Programming lab 0 0 3 1.5
7 PC LAB PE-V Lab 0 0 3 1.5
TOTAL 15 2 6 20
M.TECH II YEAR (Project Work)
S.No Phase Minimum Deliverables Credits CIE* SEE*

Duration
1 Project Within 7 days Project work Registration -- -- --
Registration from the date of
commencement
of project work
(say X)
2 Project proposal X + 24 days (Say Y) Presentation of objectives, 2 25 --
defence methodology, expected outcomes,
Review of previous work /
technologies / processes /
literature
3 Progress Report - 1 Y + 3 months Presentations/ Achievements of 8 25 --
and Viva milestones (may include
Synopsis/Oral Presentation / Viva-
voce)
4 Progress Report - 2 Y + 6 months Presentations/ Achievements of 8 25 --
and Viva milestones (may include Extended
Synopsis / Oral Presentation/ Viva-
voce
5 Pre-Submission Y + 10 months Draft Project work/Oral 2 25 --
Seminar Presentation / Viva-voce
6 Final submission Y + 11 months Achievement of Objectives/ 20 -- 100
and Viva-voce Outcomes/Efficiency/innovativene
ss in the form of Project work /
Oral Presentation/ Viva-voce
Total 40 100 100
Note:
1. 40% of the courses are offered through NPTEL.

2. The syllabus for professional electives I to IV are synchronized with NPTEL courses.
3. In case the course is not offered in the current semester.
a) an alternate course will be suggested by the BoS-Chairperson. (or)
(b)The student has to complete the course by using videos available on the
NPTEL site in self learning mode and appear for both mid examination and
final examination conducted by the examination branch.
ANURAG UNIVERSITY
SCHOOL OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING (CSE)
M.Tech (CSE)
R24 REGULATIONS
M .TECH(CSE) I YEAR I SEM
I Year M.Tech(CSE)- I Sem L T/P/D C

3 0 3
ADVANCED DATA STRUCTURES

(PC)
Course Objectives:
1. Understand various static and dynamic representations of data structures.
2. Know the basic concepts of Hashing.
3. To introduce various techniques for representation of the data in the real world.
4. To be familiar with Graph representations and traversals.
5. Compute the complexity of various algorithms
Course Outcomes:
1. Design and implement the mechanism of stacks, general tree data structures with their
applications.
2. Outline the concepts of hashing, collision and its resolution methods using hash
Function.
3. Implement various algorithms on graph data structures.
4. Implementation of various advance concepts of binary trees with real time
applications.
5. Determine and analyse the complexity of given Algorithms
UNIT I:
Algorithms, Performance analysis- Time complexity and space complexity, Asymptotic
Notation-Big Oh, Omega and Theta notations, Complexity Analysis Examples. Data
structures-Linear and non-linear data structures, ADT concept, Linear List ADT, Array
representation, Linked representation, singly linked lists -insertion, deletion, search
operations, doubly linked lists-insertion, deletion operations, circular lists. Representation of
single, two-dimensional arrays.
UNIT II:
Stack and Queue ADTs, array and linked list representations, infix to postfix conversion
using stack, implementation of recursion, Circular queue-insertion and deletion, array and
linked list representations, implementation using Heaps, Insertion into a Max Heap, Deletion
from a Max Heap.
UNIT III:
Searching–Linear and binary search methods, Hashing-Hash functions, Collision Resolution
methods-Open and closed Addressing.
Sorting –Bubble sort, Insertion sort, Quick sort, Merge sort, Heap sort, Radix sort,
comparison of sorting methods.
UNIT IV:
Trees- Ordinary and Binary trees terminology, Properties of Binary trees, Binary tree ADT,
representations, recursive and non-recursive traversals, threaded binary trees.
Graphs- Graphs terminology, Graph ADT, representations, graph traversals/search methods-

DFS and BFS, Applications of Graphs-Minimum cost spanning tree using Kruskal’s
algorithm, Dijkstra’s algorithm for Single Source Shortest Path Problem.
UNIT V:
Search trees- Binary search tree-Binary search tree ADT, insertion, deletion and searching
operations, Balanced search trees, AVL trees-Definition and examples only, Red Black trees
– Definition and examples only, B-Trees-definition, insertion and searching operations.
TEXT BOOKS:
1.Data structures, Algorithms and Applications in Java, S.Sahni, Universities Press.

2.Data structures and Algorithms in Java, Adam Drozdek, 3rd edition, Cengage learning.
3 Data structures and Algorithm Analysis in Java, M. A. Weiss, 2nd edition, Addison-Wesley
(Pearson Education).
REFERENCE BOOKS:
1.Java for Programmers, Deitel and Deitel, Pearson education.

2Data structures and Algorithms in Java, R.Lafore, Pearson education.
3java: The Complete Reference, 8th edition, Herbert Schildt, TMH.
4Data structures and Algorithms in Java, M. T. Goodrich, R. Tomassia, 3 rd edition, Wiley
India Edition
5.Data structures and the Java Collection Frame work, W. J. Collins, Mc Graw Hill.
6.Classic Data structures in Java, T.Budd, Addison-Wesley (Pearson Education).
7. www.tutorialspoint.com/Data Structures Algorithms
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
PYTHON PROGRAMMING
(PC)
Course Objectives
1. Use Python interactively, execute a Python script at the shell prompt, use Python
types, expressions, and None, use string literals and string type, use Python statements
(if...elif..else, for, pass, continue, . . . )
2. understand the difference between expressions and Statements.
3. utilize high-level data types such as lists and dictionaries, understand the difference
between mutable and immutable types.
4. write a simple class and access methods and attributes,
5. import and utilize a module, read from and write to a text file.
Course Outcomes
1. Build programs using primitive data types and user defined functions.
2. Write applications that include string builtin functions, modules, packages along with
respective exceptional handling mechanism.
3. Writes applications using OO features of Python
4. Develops web-based applications to deal with data communication between client and
server modules and also process data that is stored in possible databases.
5. Hands on exposure on SciPy/Tkinter/ Plotpy modules
UNIT -I :
Introduction to Python: History, Features, setting up path, Working with Python Basic
Syntax
Variable and Data Types, Operator. Conditional Statements (If, If- else, Nested if-else)
Looping (for, While Nested loops) Control Statements (Break, Continue, Pass)
Functions: Defining a function, Calling a function, Types of functions, Function Arguments
Anonymous functions, Global and local variables
UNIT-II:
String Manipulation: Accessing Strings, Basic Operations, String slices, Function and
Methods
Lists: Accessing list, Operations, Working with lists Function and Methods
Tuple: Accessing tuples, Operations, Working.
Dictionaries: Accessing values in dictionaries, Working with dictionaries, Properties
Functions and Methods.
UNIT-III:
Modules: Importing module, Math module, Random module, Packages, Composition
Input-Output: Printing on screen, reading data from keyboard, Opening and closing file
Regular expressions: Match function, Search function, Matching VS Searching, Modifiers
Patterns.
UNIT-IV:
Advance Python- OOPs concept: Class and object, Attributes, Inheritance, Overloading
Overriding, Data hiding
Exception Handling: Exception, Exception Handling, Except clause, Try, finally clause
User Defined Exceptions
UNIT -V:
CGI : Introduction , Architecture ,CGI environment variable, GET and POST methods
Cookies, File upload.
Python for Database: Introduction, Connections, Executing queries, Transactions Handling
error Working with NumPy/ PlotPy/ SciPy/GUI Programming, Introduction, Tkinter
programming, Tkinter widgets
Text books:
1.Think Python: How to Think Like a Computer Scientist Allen B. Downey, O'Relly
publications.
2. Learning with Python by Jeffrey Elkner, Chris Meyers Allen Downey , Dreamtech Press.
Reference books:
1.Introduction to Computation and Programming using Python, Revised and Expanded
Edition,John V. Guttag, The MIT Press.
2. Programming Python,Fourth Edition by Mark Lutz, O'Relly
3. Python Programming using problem solving approach, Reema Thareja, Oxford Higher
Education.
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
INFORMATION SECURITY
(PE-I)
Course Objectives:
1. Describe the encryption and decryption Algorithms

2. Illustrate basics of application of cryptography which are one of the key technologies
to implement security functions.
3. Describe the importance of security in the real world through Applications
4. Interpret various types of Intruders and Viruses.
5. Explore Various network security applications, IPSec, Firewall, IDS, Web security,
Email security, and Malicious software etc.
Course Outcomes:
1. Demonstrate information security, in both management and technical aspects.

2. Design symmetric and asymmetric cryptography applications.
3. Describe the importance of security in the real world through Applications
4. Illustrate various types of Intruders and Viruses
5. Understand various types of security incidents and attacks, and learn methods to
prevent, detect and react incidents and attacks..
UNIT I:
Information Security: Introduction, History of Information security, What is Security,

CNSS Security Model, Components of Information System, Balancing Information Security
and Access, Approaches to Information Security Implementation, The Security Systems
Development Life Cycle.
UNIT II :
Cryptography: Concepts and Techniques, symmetric and asymmetric key cryptography,

steganography, Symmetric key Ciphers: DES structure, DES Analysis, Security of DES,
variants of DES, Block cipher modes of operation , AES structure, Analysis of AES , Key
distribution Asymmetric key Ciphers: Principles of public key cryptosystems, RSA
algorithm, Analysis of RSA, Diffie-Hellman Key exchange.
UNIT III:
Message Authentication and Hash Functions: Authentication requirements and functions,
MAC and Hash Functions, MAC Algorithms: Secure Hash Algorithm, Whirlpool, HMAC,
Digital signatures, X.509, Kerberos.
UNIT IV:
Security at layers (Network, Transport, Application): IPSec, Secure Socket Layer(SSL),

Transport Layer Security(TLS), Secure Electronic Transaction(SET), Pretty Good
Privacy(PGP), S/MIME.
UNIT V:
Intruders, Virus and Firewalls: Intruders, Intrusion detection, password management, Virus
and related threats, Countermeasures, Firewall design principles, Types of firewalls.
Text Books:
1. Michael E. Whitman, Herbert J. Mattord, Principles of Information Security, 4th Edition,

Cengage Learning.
2. William Stallings, Cryptography and Network Security, 7th Edition, 2017 Pearson
Education.
Reference Books:
1. C K Shyamala, N Harini, Dr T R Padmanabhan, Cryptography and Network Security, 1st

Edition, Wiley India,
2. Bernard Menezes, Network Security and Cryptography: Cengage Learning
3. AtulKahate, Cryptography and Network Security, 2nd Edition, McGraw Hill.
Reference Links:
1. http://www.cs.iit.edu/~cs549/cs549s07/lectures.htm
2. http://williamstallings.com/Extras/Security-Notes/
3. http://williamstallings.com/NetworkSecurity/styled/
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
AN INTRODUCTION TO ARTIFICIAL INTELLIGENCE
(PE-1)
Course Objectives:
1. Gain a historical perspective of AI and its foundations.

2. Become familiar with basic principles of AI toward problem solving, inference,
knowledge representation, and learning.
3. Investigate applications of AI techniques in intelligent agents, expert systems,
artificial neural networks and other machine learning models.
4. Explore the current scope, potential, limitations, and implications of intelligent
systems.
Course Outcomes:
1. Understand history of AI and strengths of AI to identify problems applicable to AI.

2. Explain appropriate knowledge representation techniques to generate inferences for
any search problem.
3. Outline knowledge that allows systematic and rigorous reasoning to enhance clarity
and precision of knowledge representation
4. Design and implement probabilistic models using Bayesian Networks, and evaluate
policies in Markov Decision Processes using iterative methods.
5. Understand the reinforcement and deep learning models’ architectures to implement
those in various applications.
UNIT-I: Introduction: Philosophy of AI, History of AI, Definitions, Modeling a Problem

as Search Problem, Uninformed Search: Basic Search Strategies, Iterative Deepening,
Bidirectional Search.
UNIT-II: Search Algorithms: Best first search, A* Algorithm, Iterative Deepening A*

and Depth First Branch, Admissible Heuristics and Domain Relaxation, Local Search:
Satisfaction Vs Optimization, The Example of N-Queens, Hill Climbing, Hill Climbing with
Simulated Annealing, Genetic Algorithms, Adversarial Search: Minimax Algorithm, Alpha
Beta Pruning.
UNIT-III: Constraint Satisfaction: Representation of the atomic state, Map coloring,

Backtracking Search, Inference for detecting failures, Propositional Logic & Satisfiability:
Different Knowledge Representation systems, Forward Chaining, Reduction to Satisfiability
Problems, DPLL, WalkSAT Algorithms, Uncertainty in AI.
UNIT-IV: Bayesian Networks: Factorization, Conditional Independences & d-Separation,

Inference using Variable Elimination, MCMC with Gibbs Sampling, Bayesian Learning,
Structure Learning and Expectation Maximization, Decision Theory: Markov Decision
Processes, Policy Evaluation using system of linear equations, Iterative Policy Evaluation.
UNIT-V: Reinforcement Learning: Model-based Learning for policy evaluation (Passive

Learning), TD, Q Learning, Generalization in RL. Deep Learning: Perceptron and
Activation functions, Neural Layer as matrix operations, loss function, Backpropagation,
Convolutional Neural Networks, Deep Reinforcement Learning.
Text Books:
1. StephenLucci, DannyKopec. Artificial Intelligence in the 21st Century. A Living
Introduction. Mercury Learning and Information. 2nd Edition. 2016
Reference Books:
1. Russell, Norvig: Artificial Intelligence, A Modern Approach, Pearson Education,
Second Edition. 2004
2. Rich, Knight, Nair: Artificial Intelligence, Tata Mc GrawHill, Third Edition 2009
3. Saroj Kaushik. Artificial Intelligence. Cengage Learning.2011
NPTEL Course details:
· https://archive.nptel.ac.in/courses/106/102/106102220/
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
COMPUTER NETWORKS AND INTERNET PROTOCOL
(PE-I)
Course Objectives:
1. The fundamental concepts of computer networking, different types of topologies, and

protocols
2. Error correction and detection examples and applications in data link layer and uses of
other media access control.
3. The data transmission through protocols across the network in wired and wireless
using routing algorithms.
Course Outcomes:
1. Outline the basic concepts of data communications including the key aspects of
networking and their interrelationship, packet, circuit and cell switching as internal and
external operations, physical structures, types, models, and internetworking.
2. Illustrate the various application layer protocols (FTP, SMTP, EMAIL) and standards
(DNS) in data communications among networks.
3. Analyse and implement IP addressing, NAT, IPv6, and Internet QoS mechanisms.
4. Apply IP routing protocols (Intra and Inter Domain), and manage IP services like
SNMP and ARP.
5. Understand Ethernet, flow/error control, MAC protocols, and end-to-end principles in
computer networks.
UNIT-I: INTRODUCTION: Introduction to Computer Networks History, Circuit Switching

and Packet Switching, TCP/IP Protocol Stack – Basic Overview.
UNIT-II: Application Layer Services: HTTP, FTP, Internet mail transfer, Domain Name
Systems (DNS), Transport Layer Primitives: Connection Establishment and Closure, Flow
Control and Congestion Control at the Transport Layer, Transmission Control Protocol, Basic
Features, TCP Congestion Control.
UNIT-III: Network Layer Primitives: Introduction, IP Addressing (IPv4), classful

addressing, Network Address Translation (NAT), IPv6 Addressing. Basic Internet QoS
Architecture, Traffic policing, shaping and scheduling.
UNIT-IV: IP Routing: IP Routing – Intra Domain Routing Protocols, Inter Domain Routing
Protocols (BGP), IP Services – SNMP, ARP.
UNIT-V: Data Link Layer Service: Introduction, Ethernet, Flow and error control, Media
Access Control - Channel Access Protocols, Framing, End to End Principles of Computer
Networks.
Text Books:
1. Behrouz A Forouzan ,Data Communications and Networking,4th Edition, McGraw-

Hill.
Reference Books:
1. Andrew S. Tanenbaum, Computer Networks, Third Edition.

2. William Stallings, Data Communications, Eight Edition. Pearson Publishers.
3. http://highered.mheducation.com/sites/0072967757/student_view0/index.html
· https://archive.nptel.ac.in/courses/106/105/106105183/
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
COMPUTER VISION
(PE-I)
Course Objectives:
1. The theoretical and practical aspects of computing with images and connect issues
from computer vision to human vision.
2. The Hough Transform and its applications to detect lines, circles, ellipses. The
applications related to computer vision algorithms.
3. Machine and deep learning models applications to various computer vision
applications.
Course Outcomes:
1. Understand fundamental concepts and principles of computer vision, including image

filtering, edge detection, and feature extraction.
2. Analyze camera geometry and apply stereo geometry for 3D depth estimation.
3. Describe, and match features using various algorithms like SIFT, SURF, HoG, and
matching metrics.
4. Understand color models, perception, and apply range data processing for 2D and 3D
image analysis.
5. Apply machine and deep learning techniques for classification, clustering,
dimensionality reduction, and feature extraction using models like ANN and U-Net.
UNIT-I: Fundamentals of Image Processing: Introduction, Image representation, Image

Transform: DFT, GFT, DCT, projective geometry, Homography.
UNIT-II: Geometry: Camera Geometry: Image formation in optical camera, pinhole camera
mapping, projection matrix, shifting of world coordinate, estimation of camera matrix. Stereo
Geometry: Epipolar geometry, Fundamental and essential matrices, pure translation,
computer depth, normalized 8-point diagram, affine epipolar geometry.
UNIT-III: Feature Detection and Description: Feature detection, scoring function, local
maximum, Harris operator, feature matching, scale invariant detection, SIFT descriptor,
SURF, Hessian operator, Region descriptors, HoG, LBP, Cooccurrence matrix, VALD.
Feature matching: matching with filters, weighted distance function, matching metrics EMD,
LSH, model fitting, Hough transform.
UNIT-IV: Color Fundamentals and Range Processing: Electromagnetic spectrum, color

perception, color matching, Grassman’s Laws, CMY, CIE, YIQ, YCbCr, HSV model.
Range data, imaging principle, space encoding, parametric curve 2D, 3D, First and second
fundamental form, linear map, Gaussian and mean curvatures, edge models, scale-space
matching.
UNIT-V: Machine & Deep Learning Approaches: Introduction to classification & clustering,
Naïve Bayes’, LDA, KNN, ANN, K-means, K-medoid, EM algorithms. Need of
dimensionality reduction, PCA, Fisher linear discriminant, Sparse representation, OMP,
dictionary learning-ksvd. Deep features, activation functions, convolutional layers, max and
average pooling, dense layers, pretrained models: RNN, U-Net.
Text Books:
1. Daniel Lelis Baggio, Shervin Emami, David Millan Escriva,“Mastering OpenCV
with Practical Computer Vision Projects”, Packt Publishing, 2012..
2. E. R. Davies, “Computer Machine Vision – Theory, Algorithms, Practicalities”,
Academic Press, 4th Edition, 2012.
Reference Books:
1. Jan Erik Solem, “Programming Computer Vision with Python: Tools and algorithms
for analyzing images”, O’Reilly Media, 2012..
2. Mark Nixon, Alberto S. Aquado, “Feature Extraction Image Processing for Computer
Vision”, 3rd edition, Academic Press, 2012.
https://archive.nptel.ac.in/courses/106/105/106105216/
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
INTRODUCTION TO HUMAN COMPUTER INTERACTION
(PE-II)
Course Objectives:
1. The Essentials of designing interactive systems

2. The different Techniques for designing interactive systems
3. The Contexts for designing interactive systems
4. The important aspects of implementation of human-computer interfaces.
5. Identify the various tools and techniques for interface analysis, design, and evaluation.
UNIT-I: Essentials of Designing Interactive Systems: Designing interactive systems: a fusion

of skills: The variety of interactive systems - The concerns of interactive systems design-
Being digital-The skills of the interactive systems designer-Why being human-centred is
important; The process of human-centred interactive systems design: Introduction-
Developing personas and scenarios- Using scenarios throughout design - A scenario-based
design method.
UNIT-II: Techniques for Designing Interactive Systems: Understanding: Understanding

requirements- Participative design- Interviews- Questionnaires- Probes- Card sorting
techniques-Working with groups - Fieldwork: observing activities in situ - Artefact collection
and 'desk work'; Envisionment: Finding suitable representations- Basic techniques-
Prototypes- Envisionment in practice; Design Introduction-Conceptual design- Metaphors in
design- Conceptual design using scenarios - Physical designDesigning interactions;
Evaluation Introduction -Expert evaluation -Participant-based evaluation - Evaluation in
practice -Evaluation: further issues.
UNIT-III: Visual Interface Design, Multimodal Interface Design: Visual interface design:
Introduction, Graphical user interfaces, interface design guidelines, psychological principles
and interface design, information design, visualization. Multimodal interface design:
Introduction, interacting in mixed reality, using sound at the interface, tangible interaction,
gestural interaction and surface computing.
UNIT-IV: Contexts for Designing Interactive Systems: Designing websites 3io: Introduction,
website development, the information architecture of websites, navigation design for
websites; Case study: designing the Robert Louis Stevenson website; Social media:
Introduction, background ideas, Social networking, Sharing with others, the developing web;
Collaborative environments: Introduction, issues for cooperative working, technologies to
support cooperative working, collaborative virtual environments; Case study: Developing a
collaborative tabletop application.
UNIT-V: Ubiquitous Computing, Mobile Computing, Wearable Computing: Ubiquitous

computing: Information spaces, blended spaces, home environments, navigating in wireless
sensor networks; Mobile computing: Introduction, context awareness, understanding in
mobile computing, designing for mobiles, evaluation for mobile computing; Wearable
computing Introduction: Smart materials, material design, from materials to implants.
Text Books:
1. David R. Benyon, “Designing Interactive Systems: A Comprehensive Guide to HCI, UX

and Interaction Design”, Pearson; 3rd Edition, 2013
2. James Cabrera, “Modular Design Frameworks: A Projects-based Guide for UI/UX
Designers”, Apress, 1st Edition, 2017.
Reference Books:
1. Ben Schneiderman, “Designing the User Interface”, Pearson Education Asia, 3rd Edition,
2013.
2. Prece, Rogers, Sharps, “Interaction Design”, Wiley Dreamtech.
3. SorenLauesen, “User Interface Design”, Pearson Education.
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
DATA MINING
(PE-II)
Course Objectives:
1. The analyses of data, choosing relevant models and algorithms for respective
applications.
2. The process and mining of complex datatypes such as streams, spatial, web and
multimedia.
3. The research perspectives towards advances in data mining
Course Outcomes:
1. Understand and apply basic concepts of data mining, including data pre-
processing, transformation, and reduction techniques.
2. Develop knowledge of association rule mining and use algorithms like Apriori and
FP-Growth for pattern discovery.
3. Apply classification techniques like decision trees, Naive Bayes, and k-nearest
neighbors for supervised learning tasks.
4. Demonstrate understanding of clustering techniques such as K-means, hierarchical
clustering, and density-based methods for unsupervised learning.
5. Analyze and evaluate the performance of different data mining models using
various validation and evaluation metrics.
UNIT-I: Introduction: Knowledge discovery process, Data Mining definition, knowledge

discovery in data (KDD), data mining functionalities, technologies, applications, issues in
data mining, data objects and attribute types, basic statistical descriptions of data, data
visualization, measuring data similarity and dissimilarity. Data Pre-processing: Data quality,
data cleaning, data integration and transformation, data reduction, data discretization,
Association rules, Apriori Algorithm.
UNIT-II: Classification Basics: Rule generation, classification-Decision Tree, Bayes

Classifier, Naïve Byes’ classifier, K nearest neighbour, classifier evaluation, metrics for
performance evaluation.
UNIT-III: Classifiers: Support vector machine (SVM), linear separators, decision

boundaries, Kernel machines, Artificial Neural networks: History, perceptron, training rules,
gradient descent, MLP.
UNIT-IV: Clustering, Outlier detection: Introduction, types of clustering, partitioning based

clustering, k-means, Hierarchical clustering, top-down and bottom-up approaches.
UNIT-V: Regression & Dimensionality Reduction: Introduction, linear, non-linear

regression, logistic regression, multivariate linear regression. Dimensionality reduction,
feature subset, PCA-Linear transformation, geometric interpretation.
Text Books:
1. Jiawei Han, MichelineKamber, “Data Mining,Concepts and Techniques”, Morgan

Kaufmann Publishers, Elsevier, 3rd Edition, 2012.
2. Alex Berson, Stephen J.Smith, “Data warehousing Data mining and OLAP”, Tata
McGraw-Hill, 2nd Edition, 2007.
Reference Books:
1. Arum K Pujari, “Data Mining Techniques”, Universities Press, 3rd Edition, 2005.
2. PualrajPonnaiah, “Data Warehousing Fundamentals”, Wiley, Student Edition, 2004

ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
OPERATING SYSTEM FUNDAMENTALS
(PE-II)
Course Objectives:
1. Understand the functionalities of main components in operating systems.

2. Analyze the algorithms used in memory and process management.
3. Understand the clock synchronization protocols
4. Interpret the concepts of input and output storage for file management.
Course Outcomes:
1. Understand the basic concepts of operating systems, including system calls, process
management, and kernel functionalities.
2. Analyze process synchronization, inter-process communication, and apply techniques
like semaphores and monitors.
3. Understand and implement CPU scheduling algorithms to optimize process
management and resource allocation.
4. Demonstrate the ability to manage memory using paging, segmentation, and virtual
memory concepts.
5. Analyze the mechanisms of deadlock, its prevention, detection, and recovery
techniques in operating systems.
UNIT-I: Introduction: Operating systems objectives and functions: Computer system

architecture, operating systems structure, operating systems operations; Evolution of
operating systems: Simple batch, multi programmed, time shared, personal computer, parallel
distributed systems, real time systems, special purpose systems, operating system services,
user operating systems interface; Systems calls: Types of systems calls, system programs,
protection and security, operating system design and implementation, operating systems
structure, virtual machines.
UNIT-II: Process and CPU Scheduling, Process Coordination: Process concepts: The
process, process state, process control block, threads; Process scheduling: Scheduling queues,
schedulers, context switch, preemptive scheduling, dispatcher, scheduling criteria, scheduling
algorithms, multiple processor scheduling; Real time scheduling; Thread scheduling; Case
studies Linux windows; Process synchronization, the critical section problem; Peterson‘s
solution, synchronization hardware, semaphores and classic problems of synchronization,
monitors.
UNIT-III: Memory Management and Virtual Memory: Logical and physical address space:
Swapping, contiguous memory allocation, paging, structure of page table. Segmentation:
Segmentation with paging, virtual memory, demand paging; Performance of demand paging:
Page replacement, page replacement algorithms, allocation of frames, thrashing.
UNIT-IV: File System Interface, Mass-Storage Structure: The concept of a file, access
methods, directory structure, file system mounting, file sharing, protection, file system
structure, file system implementation, allocation methods, free space management, directory
implementation, efficiency and performance; Overview of mass storage structure: Disk
structure, disk attachment, disk scheduling, disk management, swap space management;
Dynamic memory allocation: Basic concepts; Library functions.
UNIT-V: Deadlocks, Protection: Deadlock characterization, methods of handling deadlocks,

deadlock prevention, dead lock avoidance, dead lock detection and recovery form deadlock
system protection, goals of protection, principles of protection, domain of protection, access
matrix, implementation of access matrix, access control, revocation of access rights,
capability based systems, language based protection.
Text Books:
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Principles”

Wiley Student Edition, 8th Edition, 2010.
2. William Stallings, “Operating System- Internals and Design Principles”, Pearson
Education, 6th Edition, 2002.
Reference Books:
1. Andrew S Tanenbaum, “Modern Operating Systems”, PHI, 3rd Edition, 2007.

2. D. M. Dhamdhere, “Operating Systems a Concept Based Approach”, Tata McGraw-
Hill,
2nd Edition, 2006.

ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
CLOUD COMPUTING
(PE-II)
Course Objectives:
1. To understand the concepts of virtualization and its benefits

2. To impart fundamental concepts in the area of cloud computing.
3. To impart knowledge in applications of cloud computing.
4. To understand various services in cloud applications
5. To know the architecture of disaster recovery and security of cloud
Course Outcomes:
1. Explain the fundamental concepts, models, and architectures of cloud computing,

including service models (IaaS, PaaS, SaaS).
2. Apply security principles and best practices to ensure data protection and compliance
in cloud environments.
3. Demonstrate proficiency in virtual machine provisioning, resource allocation, and
management in cloud platforms.
4. Develop and deploy serverless applications using Function as a Service (FaaS) and
understand the implications of serverless architectures.
5. Evaluate and implement solutions using both open-source and commercial cloud
platforms.
UNIT-I:
Introduction: Characteristics of Cloud Computing, Cloud Service Models (IaaS, PaaS, SaaS),
Virtualization Concepts, Key Enabling Technologies, Cloud Computing vs. Traditional
Computing vs Distributed computing, Service-Oriented Architecture (SOA) in Cloud,
Resource and data management in cloud, Cloud Networking and Communication, Cloud
Monitoring and Performance Optimization.
UNIT-II:
Service, Data, Resource Management in Cloud: Service Level Agreements (SLAs),
Monitoring and Reporting, Billing and Cost Management, Cloud Orchestration, Service
Optimization, Data Replication and Consistency, Data Backup and Disaster Recovery in
Cloud, Database-as-a-Service (DBaaS), Resource Provisioning, Auto-scaling, Load
Balancing in Cloud, Virtual Machine (VM) Management, Container Resource Management.
UNIT-III:
Cloud Security, open source and commercial cloud & Research Trends: Security Challenges
& Threats in Cloud, Identity and Access Management (IAM), Data Encryption &
Compliance, Cloud Security Monitoring & Incident Response, Performance Metrics in Cloud
Simulators, Open Source vs. Commercial Cloud Platforms, Research on Edge & Fog
Computing, AI, Machine Learning & Serverless Cloud, Security & Sustainability Trends in
Cloud Computing.
UNIT-IV:
VM Resource Allocation, Cloud-Fog-Edge Enabled Analytics: Virtual Machine Provisioning,

Dynamic Resource Allocation Strategies, Load Balancing in Virtualized Environments,
Monitoring VM Performance, Resource Management Policies. Introduction to Cloud-Fog-
Edge Architecture, Data Processing in Fog and Edge Environments, Analytics Frameworks
for Edge Devices, Latency Reduction Techniques.
UNIT-V:
Serverless Computing and FaaS Model: Introduction to Serverless Computing, Function as a

Service (FaaS), Challenges and Limitations, Serverless Frameworks and Platforms (AWS,
AZURE, Google Cloud), Event-Driven Architecture, Security Considerations, Monitoring
and Logging in FaaS, Cost Management in Serverless Environments
Text Books:
1. Ivanka menken, Gerard Blokdijk, Cloud Computing Virtualization Specialist

Complete Certification Kit - Study Guide Book, 2009
2. George Reese, Cloud Application Architectures Building Applications and
Infrastructure in the Cloud, O'Reilly Media Press, 2009.
Reference Books:
1. Anthony T. Velte, Tobe J. Velte, Robert Elsenpeter, Cloud Computing: A Practical

Approach, Publication Person Education, 2009
2. Tom Clark, Storage Virtualization: Technologies for Simplifying Data Storage and
Management, Addison-Wesley, 2005
3. Curtis Brian J.S. Chee, Cloud Computing Technologies and Strategies of the
Ubiquitous Datacenter, 2010
NPTEL Course details
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
CYBER SECURITY AND PRIVACY
(PE-III)
Course Objectives:
1. Analyze the importance of cyber Security and discuss major issues concerning cyber
security
2. Identify different cyber security vulnerabilities
3. Apply tools for cyber security safeguard
4. Interpret various malwares and implement different tools
5. Discuss the importance of cyber forensics.
Course Outcomes:
At the end of the course the students will be able to:

1. Analyze the role of cyber security and its challenges
2. Summarize various security vulnerabilities in Internet
3. Identify different tools to safeguard the network
4. Discuss various malwares and tools to analyze them
5. Interpret the role of cyber forensics in cyber secuirty
UNIT-I:
Introduction: Introduction to cyber security, Confidentiality, integrity, and availability,

Fundamental concepts, CIA, CIA triangle, data breach at target.
UNIT-II:
Security Management: Security management, Governance, risk, and compliance (GRC)-

GRC framework, security standards, Contingency planning - Incidence response, Disaster
Recovery, BCP, Cyber security policy - ESSP, ISSP, SYSSP, Risk Management - Cyber Risk
Identification, Assessment, and Control
UNIT-III:
Cyber security: Industry perspective - Defense Technologies, Attack, Exploits, Cyber
security technologies - Access control, Encryption, Standards.
UNIT-IV:
Privacy: Foundations of privacy- Information privacy, Measurement, Theories, Privacy

regulation - Privacy, Anonymity, Regulation, Data Breach, Privacy regulation in Europe,
Privacy: The Indian Way - Data Protection, GDPR, DPDP, Aadhar.
UNIT-V:
Information privacy: Economics and strategy, Economic value of privacy, privacy valuation,
WTA and WTC, Business strategy and privacy, espionage, Privacy vs safety.
Text Books:
1. Michael E. Whitman, Herbert J. Mattord, (2018). Principles of Information Security, 6th

edition, Cenage Learning, N. Delhi.
2. Darktrace, “Technology” https://www.darktrace.com/en/technology/#machine-
learning, accessed November 2018.
Reference Books:
1. Van Kessel, P. Is cyber security about more than protection? EY Global Information
Security Survey 2018-2019.
2. Johnston, A.C. and Warkentin, M. Fear appeals and information security behaviors:
An empirical study. MIS Quarterly, 2010.
3. Arce I. et al. Avoiding the top 10 software security design flaws. IEEE Computer
Society Center for Secure Design (CSD), 2014.
https://onlinecourses.nptel.ac.in/noc23_cs127/preview
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
SOFTWARE ENGINEERING
(PE-III)
Course Objectives:
1. The object-oriented concepts along with their applicability contexts.

2. The software development process models and coding standards.
3. The knowledge of testing methods and comparison of various testing techniques.
4. The underlying concepts and standards of quality and knowledge about software
quality assurance group.
Course Outcomes:
1. Outline the framework activities for a given project.

2. Apply the Right process model for a given project.
3. Design various system models for a given Context.
4. Apply various testing techniques for a given project.
5. Identify various risks in project development.
UNIT-I:
Introduction to Software Engineering: The evolving role of software, Changing Nature of

Software, Software myths. A Generic view of process: Software engineering- A layered
technology, a process framework, The Capability Maturity Model Integration (CMMI).
Process models: The waterfall model, Incremental process models, Evolutionary process
model.
UNIT-II:
Agile Process Model: Agile principles, Extreme programming, Dynamic System

Development Methods, Feature Driven Development, Scrum framework, Sprint, Scrum
master, Roles of Scrum Master, Implementing Scrum - A case study.
Software Requirements: Functional and non-functional requirements, the software

requirements document. Representation of complex programming logic, design
fundamentals, modular design.
UNIT-III:
Structured Analysis & Design: Basics of Data Flow Diagrams (DFD), developing DFD
model, essentials of structure chart, transform analysis, transaction analysis.
UNIT-IV:
Overview of class diagram: Inheritance relationship, Association relationship, Development

of sequence diagrams, state-machine diagram, Object-Oriented design process.
UNIT-V:
Testing Strategies: A strategic approach to software testing, test strategies for conventional
software, Black-Box and White-Box testing, Validation testing, System testing.
Product metrics: Software Quality, Metrics for Analysis Model- function based metrics,
Metrics for Design Model-object oriented metrics, class oriented metrics, component design
metrics, Metrics for source code, Metrics for maintenance.
Text Books:
1. Roger S. Pressman, Software Engineering - A practitioner‘s Approach, 6th edition.

McGraw Hill International Edition, 2005.
2. Somerville, Software Engineering, 7th edition, Pearson education, 2009.
Reference Books:
1. K.K. Agarwal & Yogesh Singh, Software Engineering, New Age International
Publishers,3rd edition, 2008
2. Pankaj Jalote, An Integrated Approach to Software Engineering, Narosa Publishing
House, 3rd edition 2005.
3. James F. Peters, Witold Pedrycz, Software Engineering - an Engineering approach,
JohnWiely, 2007.
4. Waman S Jawadekar, Software Engineering Principles and Practice, The McGraw-Hill
Companies, 2013.
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
DATA SCIENCE
(PE-III)
Course Objectives:
1. To gain a foundational understanding of data science.

2. To understand data exploration analysis in data science.
3. To understand and use basic machine learning algorithms for predictive
modeling.
4. To understand and use the various graphics in R and Tableau for data
visualization.
5. To understand the ethical and privacy issues in data science.
Course Outcomes:
1. Describe what Data Science is and the skillsets needed to be a data scientist.
2. Explain the significance of exploratory data analysis (EDA) in data science.
3. Apply basic machine learning algorithms for predictive modeling.
4. Learn to persuade effective visualization of given data.
5. Reason around ethical and privacy issues in data science conduct and
apply ethical practices.
UNIT I:
Introduction To Data Science: What is Data Science, Big Data and Data Science hype –
and getting past the hype, why now?
Datafication, Current and scape of perspectives, Skillsets needed, Statistical Inference,
Populations and samples, Statistical modeling, probability distributions, fitting a model,
Introduction to R.
UNIT II:
Exploratory Data Analysis and The Data Science Process: Basic tools (plots, graphs
and summary statistics) of EDA, Philosophy of EDA, The Data Science Process, Case
Study.
UNIT III:
Basic Machine Learning Algorithms: Linear Regression, k-Nearest Neighbors(k-NN), k-
means, Motivating application: Filtering Spam, Why Linear Regression and k-NN are poor
choices for Filtering Spam, Naive Bayes and why it works for Filtering Spam.
UNIT IV:
Data Visualization: Basic principles, ideas and tools for data visualization, Examples of
inspiring (industry) projects, Introduction to Tableau. Creating own visualization of a
complex dataset.
UNIT V:
Data Science and Ethical Issues: Discussions on privacy, security, ethics, A look back at
Data Science, Next-generation data scientists.
Text Books:
1. CathyO’ Neiland Rachel Schutt. Doing Data Science, Straight Talk from
The Frontline.O’Reilly.2014.
2. Foster Provost and Tom Fawcett. Data Science for Business: What You Need
to Know about Data Mining and Data-analytic Thinking. ISBN 1449361323.
2013.
ReferenceBooks:
1. Trevor Hastie, Robert Tibshirani and Jerome Friedman. Elements of

Statistical Learning, Second Edition. ISBN0387952845. 2009.
2. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and
Techniques, Third Edition. ISBN0123814790. 2011.
3. Chris Eaton, DirkDeRoos, TomDeutsch, GeorgeLapis,
PaulZikopoulos,“Understanding Big Data: Analytics for Enterprise Class
Hadoop and Streaming Data”,McGrawHillPublishing, 2012.
4. https://docs.google.com/file/d/0B6iefdnF22XQeVZDSkxjZ0Z5VUE/edit?pli=1
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
INTRODUCTION TO MACHINE LEARNING
(PE-III)
Course Objectives:
1. To understand the need for machine learning for various problem solving
2. To study the various supervised and unsupervised learning algorithms in machine
learning
3. To understand the latest trends in machine learning
4. To design appropriate machine learning algorithms for problem solving.
Course Outcomes:
1. Describe the core concepts, terminology, and principles of machine learning,

including supervised, unsupervised, and reinforcement learning.
2. Apply key machine learning algorithms such as linear regression, decision trees, and
clustering techniques to real-world datasets.
3. Assess and compare the performance of various machine learning models using
appropriate metrics.
4. Demonstrate skills in data pre-processing techniques, including data cleaning,
normalization, and feature selection, to prepare datasets for analysis.
5. Analyze various applications of machine learning in fields such as healthcare,
Finance, and natural language processing, recognizing the impact of these
technologies in solving real-world problems.
UNIT-I:
Introduction: Probability Theory, Linear Algebra, Convex Optimization, Statistical Decision

Theory - Regression, Classification, Bias Variance, Underfitting, over fitting, ridge and lasso
regularizations.
UNIT-II:
Linear models: Linear Regression, Multivariate Regression, Subset Selection, Shrinkage

Methods, Principal Component Regression, Partial Least squares, Support Vector Machines,
Linear Classification, Logistic Regression, Linear Discriminant Analysis.
UNIT-III:
NN & Decision Trees: Neural Networks - Introduction, Early Models, Perceptron Learning,
Backpropagation, Initialization, Training & Validation, Parameter Estimation - MLE, MAP,
Bayesian Estimation, Decision Trees, Regression Trees, Stopping Criterion & Pruning loss
functions, Categorical Attributes, Multiway Splits, Missing Values, Decision Trees -
Instability Evaluation Measures.
Model Validation: Bootstrapping & Cross Validation, Class Evaluation Measures, ROC
curve, MDL, Ensemble Methods - Bagging, Committee Machines and Stacking, Boosting.
UNIT-IV:
Advanced Machine Learning Techniques and Models-I: Gradient Boosting, Random Forests,
Multi-class Classification, Naive Bayes, Bayesian Networks, Undirected Graphical Models,
HMM, Variable Elimination, Belief Propagation.
UNIT-V:
Advanced Machine Learning Techniques and Models-II: Partitional Clustering, Hierarchical

Clustering, Birch Algorithm, CURE Algorithm, Density-based Clustering. Gaussian Mixture
Models, Expectation Maximization, Learning Theory, Introduction to Reinforcement
Learning, Optional videos (RL framework, TD learning, Solution Methods, Applications)
Text Books:
1. The Elements of Statistical Learning, by Trevor Hastie, Robert Tibshirani, Jerome H.

Friedman
2. Pattern Recognition and Machine Learning, by Christopher Bishop.
Reference Books:
1. Tom M. Mitchell, ―Machine Learning, McGraw-Hill Education (India) Private

Limited, 2013.
2. Ethem Alpaydin, ―Introduction to Machine Learning (Adaptive Computation and
Machine Learning), The MIT Press 2004.
3. Stephen Marsland, ―Machine Learning: An Algorithmic Perspective, CRC Press,
2009.
ANURAG UNIVERSITY
M.Tech (CSE)
I Year M.Tech (CSE) I Sem L T/P/D C

2 0 2
RESEARCH METHODOLOGY
Course Objectives:
1. Understand the research problem
2. Know the process of literature survey, plagiarism check and ethical means of doing
research
3. Get the knowledge about technical report writing
4. Create the awareness about the intellectual property rights
5. Know about the patent procedures
Course Outcomes: At the end of this course, students will be able to:
1. Formulate the research problem

2. Analyze research related information by following research ethics
3. Convert a technical paper into a research proposal by incorporating new ideas or
concepts
4. Develop patent from the obtained research outcome
5. Protect the research output for further development in the area chosen though ipr
UNIT I: Meaning of research problem, Sources of research problem, Criteria Characteristics

of a good research problem, Errors in selecting a research problem, Scope and objectives of
research problem. Approaches of investigation of solutions for research problem, data
collection, analysis, interpretation, Necessary instrumentations
UNIT II: Effective literature studies approaches, analysis Plagiarism, Research ethics
UNIT III: Effective technical writing, how to write report, Paper Developing a Research
Proposal, Format of research proposal, a presentation and assessment by a review committee
UNIT IV: Nature of Intellectual Property: Patents, Designs, Trade and Copyright. Process of
Patenting and Development: technological research, innovation, patenting, development
International Scenario: International cooperation on Intellectual Property. Procedure for
grants of patents, Patenting under PCT
UNIT V: Patent Rights: Scope of Patent Rights. Licensing and transfer of technology. Patent
information and databases. Geographical Indications. New Developments in IPR:
Administration of Patent System. New developments in IPR; IPR of Biological Systems,
Computer Software etc. Traditional knowledge Case Studies, IPR and IITs
TEXT BOOKS:
1. Stuart Melville and Wayne Goddard, “Research methodology: an introduction for

science & engineering students”
2. Wayne Goddard and Stuart Melville, “Research Methodology: An Introduction”
REFERENCE BOOKS:
1. Ranjit Kumar, 2nd Edition, “Research Methodology: A Step by Step Guide for
beginners”
2. Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd, 2007
3. Mayall , “Industrial Design”, McGraw Hill, 1992
4. Niebel , “Product Design”, McGraw Hill, 1974
5. Asimov, “Introduction to Design”, Prentice Hall, 1962
6. Robert P. Merges, Peter S. Menell, Mark A. Lemley, “ Intellectual Property in New
Technological Age”, 2016
ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
ADVANCED DATA STRUCTURES LAB

(PC LAB)
1. Write Java programs that use both recursive and non-recursive functions for
implementing the following searching methods:
a) Linear search b) Binary search
2. Write Java programs to implement the following using arrays and linked lists
a) List ADT
3. Write Java programs to implement the following using an array.
a) Stack ADT b) Queue ADT
4. Write a Java program that reads an infix expression and converts the expression to
postfix form. (Use stack ADT).
5. Write a Java program to implement circular queue ADT using an array.
6. Write Java programs to implement the following using a singly linked list.
a) Stack ADT b) Queue ADT
7. Write Java programs to implement the deque (double ended queue) ADT using
a) Array b) Singly linked list c) Doubly linked list.
8. Write a Java program to implement priority queue ADT.

9. Write a Java program to perform the following operations:
a) Construct a binary search tree of elements.
b) Search for a key element in the above binary search tree.
c) Delete an element from the above binary search tree.
10. Write a Java program to implement all the functions of a dictionary (ADT) using
Hashing.
11. Write a Java program to implement Dijkstra’s algorithm for Single source shortest1
path problem.
12. Write Java programs for the implementation of bfs and dfs for a given graph.
13. Write Java programs for implementing the following sorting methods:
a) Bubble sort d) Merge sort g) Binary tree sort
b) Insertion sort e) Heap sort
c) Quick sort f) Radix sort
14. Write a Java program to perform the following operations: a) Insertion into a B-tree b)
Searching in a B-tree
15. Write a Java program that implements Kruskal’s algorithm to generate minimum cost
spanning tree.
16. Write a Java program that implements the KMP algorithm for pattern matching.
(Note: Use packages like java.io, java.util, etc)

ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
PYTHON PROGRAMMING LAB

(PC LAB)
Week-1:
Installation and Environment set up of Python & Programs on Data types, Operators
Week-2:
Programs on Standard I/O, String, Files, List, Tuple
Week-3:
Programs on Dictionaries
Week-4:
Programs onControl Statement
Week-5
Programs on Functions
Week-6:
Programs on Strings and string operations
Week-7:
Programs on Regular Expressions.
Week-8:
Programs on Inheritance and overloding
Week-9:
Programs on Exception Handling
Week-10
Programs on Python Additional Concepts: Email and Web Programming
Week-11
Programs on Python Libraries
Week-12
Implementation of different application based on python programming.
Week-13:
Demonstration of Date and Time Packages
Week-14:Overview
Week-15:Overview
Text Books:
1. Beginning Python: using python 2.6 and Python 3.1, by James Payne, wiley Publication
2. Learning Python, 5th edition, O'reilly Publication
ANURAG UNIVERSITY
M.Tech(CSE)
I Year M.Tech(CSE)- II Sem L T/P/D C
3 1 4
ADVANCED ALGORITHMS
(PC)
Course Objectives:
1. Introduce students to the advanced methods of designing and analyzing algorithms.

2. The student should be able to choose appropriate algorithms and use it for a specific
problem.
3. To familiarize students with basic paradigms and data structures used to solve advanced
algorithmic problems.
4. Students should be able to understand different classes of problems concerning their
computation difficulties.
5. To introduce the students to recent developments in the area of algorithmic design.
Course Outcomes:
1. Analyze the complexity/performance of different algorithms.

2. Determine the appropriate data structure for solving a particular set of problems.
3. Categorize the different problems in various classes according to their complexity.
UNIT – I
Sorting: Review of various sorting algorithms, topological sorting
Graph: Definitions and Elementary Algorithms: Shortest path by BFS, shortest path in edge-
weighted case (Dijkstra's), depth-first search and computation of strongly connected
components, emphasis on correctness proof of the algorithm and time/space analysis,
example of amortized analysis.
UNIT – II
Matroids: Introduction to greedy paradigm, algorithm to compute a maximum weight
maximal independent set. Application to MST.
Graph Matching: Algorithm to compute maximum matching. Characterization of maximum
matching by augmenting paths, Edmond's Blossom algorithm to compute augmenting path.
UNIT - III
Flow-Networks: Maxflow-mincut theorem, Ford-Fulkerson Method to compute maximum
flow, Edmond-Karp maximum-flow algorithm.
Matrix Computations: Strassen's algorithm and introduction to divide and conquer
paradigm, inverse of a triangular matrix, relation between the time complexities of basic
matrix operations, LUP-decomposition.
UNIT - IV
Shortest Path in Graphs: Floyd-Warshall algorithm and introduction to dynamic
programming paradigm. More examples of dynamic programming.
Modulo Representation of integers/polynomials: Chinese Remainder Theorem, Conversion
between base-representation and modulo-representation. Extension to polynomials.
Application: Interpolation problem.
Discrete Fourier Transform (DFT): In complex field, DFT in modulo ring. Fast Fourier
Transform algorithm. Schonhage-Strassen Integer Multiplication algorithm.
UNIT - V
Linear Programming: Geometry of the feasibility region and Simplex algorithm
NP-completeness: Examples, proof of NP-hardness and NP-completeness.
Recent Trends in problem solving paradigms using recent searching and sorting techniques
by applying recently proposed data structures.
REFERENCES:
1. Cormen, Leiserson, Rivest, Stein, "Introduction to Algorithms".
2. Aho, Hopcroft, Ullman "The Design and Analysis of Computer Algorithms".
3. Kleinberg and Tardos."Algorithm Design".
ANURAG UNIVERSITY
M.Tech(CSE)
I Year M.Tech (CSE)- II Sem L T/P/D C

3 1 4
PROGRAMMING IN JAVA
(PC)
Course Objectives:
1. Understand the concept of OOP and learn the basic syntax and semantics of the Java
language and programming environment
2. Be familiar with the purpose and usage principles of inheritance, polymorphism,
encapsulation and method overloading.
3. Understand Exceptional handling and multithreading concepts
4. Be familiar with GUI applications.
Course Outcomes:
1. Understand the Object-Oriented Programming concepts

2. Design programs using package and interfaces.
3. Apply the concepts of Exceptions and multithreading.
4. Develop GUI applications and AWT using Frames .
5. Design the programs using Applet and JDBC Concepts.
UNIT-I:
Java Basics: History of Java, Java buzzwords, data types, variables, scope and life time of
variables, arrays, operators, expressions, control statements, type conversion and costing,
simple java program, concepts of classes, objects, constructors, methods, access control, this
keyword, static keyword, garbage collection, overloading methods and constructors,
parameter passing, recursion, nested and inner classes, Strings.
UNIT-II:
Input-Output Handling in Java: Introduction to Java I/O, Java I/O streams, File Handling in
Java.
Encapsulation: Access Modifiers in Java, Data Hiding, Frameworks and Libraries.
Inheritance –Introduction, forms of inheritance- specialization, specification, construction,

extension, limitation, combination, Member access rules, super uses, using final with
inheritance
Polymorphism- method overriding, abstract classes, Object class Packages and Interfaces:
Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing
packages, differences between classes and interfaces, File, Byte Streams, Character Streams.
UNIT- III
Exception handling - Concepts of exception handling, exception hierarchy, usage of try,

catch, throw, throws and finally, built in exceptions, creating own exception sub classes.
Package java.util- The Collection Interface, list interface, Queue interface, The Collection
class: LinkedListClass, HashSetClass. TreeSetClass, StringTokenizer, Date, Random,
Scanner.
Multi threading: Differences between multi threading and multitasking, thread life cycle,
creating threads, thread priorities, synchronizing threads, inter thread communication.
UNIT-IV:
Java Applets and Servlets: class hierarchy, component, container, panel, window, frame,
graphics class, Layout Manager – layout manager types – boarder, grid, flow, card and grib
bag.
AWT controls: Labels, button, scrollbars, text components, check box, check box groups,
choices, menu bar.
Applets – Concepts of Applets, differences between applets and applications, life cycle of an
applet, create applets, passing parameters to applets.
UNIT-V:
Networking with Java: JDBC Connectivity, JDBC Type 1 to 4 Drivers, connection

establishment, QueryExecution. Interface and Packages for Software Development.
Text Books:
1. Java- The Complete Reference, Seventh Edition, Herbert Schildt, Tata McGraw Hill,
Year of Publication:2017
2. Database Programming with JDBC&JAVA, Second Edition,GeorgeReese,
O’ReillyMedia, Year of Publication:2009
Reference Books:
1. Understanding OOP with Java, updated edition, T. Budd, Pearson Education.

2. Thinking in Java Fourth Edition, Bruce Eckel
3. Introduction to Java programming, Y. Daniel Liang, Pearson Education
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
BLOCKCHAIN AND ITS APPLICATIONS
(PE-IV)
Course Objectives:
1. Identify different components and types of Blockchain.

2. Apply Ethereum tool for application development
3. Interpret various components of DApps and multichain
4. Summarize the architecture of Hyperledger Fabric
5. Analyse the impact of Blockchain in business
Course Outcomes:
1. Summarize types and applications of Blockchain
2. Illustrate the design and deployment of smart contract through Ethereum
3. Apply DApps through Truffle IDE
4. Apply Hyper Ledger Fabric model in different Networks
5. Categorize different Business Applications of Blockchain
UNIT-I:
Introduction: Introduction to Blockchain Technology and its Importance, Decentralization,

immutability, and transparency, Blockchain Ecosystem: Nodes, miners, smart contracts, and
DApps. Challenges and Limitations: Scalability, energy consumption, and regulatory issues.
Introduction to Cryptographic Hash Functions, Common Hash Algorithms- MD5, SHA-256,
and their uses, Components of Digital Signature, Public Key Infrastructure, Digital Signature
vs. Encryption.
UNIT-II:
The Evolution of Cryptocurrencies: Distributed Systems for Decentralization, Open

Consensus and Bitcoin, Bitcoin Mining and Beyond, Smart Contracts and the Permissioned,
Blockchain Elements-blocks, chain, transactions, hash functions, merkle tree, nodes, smart
contracts, public and private keys, decentralization. Permissionless Model and Open
Consensus, Nakamoto Consensus, Limitations of PoW: Forking and Security.
UNIT-III
Ethereum: Proof of Stake (PoS) Consensus (Ethereum 2.0), Ethereum Blockchain, Tokens,
Decentralized Finance, Decentralized Autonomous Organizations (DAOs), Consensus for
Permissioned Models, State Machine Replication as Distributed Consensus, Paxos, Byzantine
Faults, Byzantine Agreement Protocols, Safety and Liveness of PBFT, Enterprise
Blockchains.
UNIT-IV
Hyperledger Fabric: Introduction, architecture, Consensus, API, frameworks, setting up

Development Environment using Composer, Developing and Testing business networks,
Hyperledger Fabric Model Various ways to create Hyperledger Fabric Blockchain Network,
Hyperledger Aries.
UNIT-V
Blockchain security: Consensus Mechanisms, Decentralization, Immutability, Security of

Smart Contracts, Sybil Attack Prevention, Privacy and Confidentiality, Governance and
Protocol Updates.
Text Books:
1. Josh Thompson, ‘Blockchain: The Blockchain for Beginnings, Guild to Blockchain

Technology and Blockchain Programming’, Create Space Independent Publishing
Platform, 2017.
Reference Books
1. Mastering Blockchain: A deep dive into distributed ledgers, consensus protocols,

smart contracts, DApps, cryptocurrencies, Ethereum, and more, 3rd Edition, Imran
Bashir, Packt Publishing, 2020, ISBN: 9781839213199, book website:
https://www.packtpub.com/product/mastering-blockchain-third-edition/9781839213199
2. Hyperledger Tutorials - https://www.hyperledger.org/use/tutorials
3. Ethereum Development Resources - https://ethereum.org/en/developers
NPTEL Course details
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
INTRODUCTION TO DATABASE SYSTEMS
(PE-IV)
Course Objectives:
1.To provide a sound introduction to Database management systems, databases and its
applications and familiarize the student to give a good formal foundation on the
relational model of data
2. To Introduce SQL for storing and retrieving databases
3. To give an introduction to systematic database design approaches concepts of
transactions and transaction processing and the issues, techniques related to
concurrency and recovery manager.
4. To Explore the File organizations, indexing and hashing mechanisms
5. To Explain the concepts of Distributed Database Management System
Course Outcomes:
1. Model Entity-Relationship diagrams for enterprise level databases

2. Formulate optimized Queries using SQL and Relational Formal Query Languages.
3. Apply Various Normal forms for schema refinement and Differentiate serial and
concurrent transaction and various concurrency control protocols algorithms.
4. Use of suitable File organization, Indices and Hashing mechanisms for effective
storage and retrieval of Data.
5. Identify the features and advantages of Distributed Databases over centralized
databases
UNIT I:
Introduction to Database System Concepts: Database-System Applications, Purpose of

Database Systems, View of Data, Database Language, Database Design, Database
Architecture, Database Users and Administrators.
Introduction to the Relation Models and Database Design using ER Model: Structure of
Relational Databases, Database Schema, Keys, Schema Diagrams, Relational Query
Languages, Relational Operations Overview of the Design Process, The Entity-Relationship
Model, Constraints, Entity-Relationship Diagrams- Unary, Binary, ternary, Aggregation.
UNIT II:
Introduction to SQL : Overview of the SQL Query Language, SQL Data Definition, Basic
Structure of SQL Queries, Additional Basic Operations, Set Operations, Aggregate
Functions, Nested Sub queries.
Formal Relational Query Languages & Query Optimization: The Relational Algebra, Tuple
Relational Calculus. Algorithm for Executing Query Operations: Select operation, Join
operation, Project and set operation, Aggregate operations, Outer join, Heuristics in Query
Optimization, Semantic Query Optimization.
UNIT III:
Relational Database Design: Features of Good Relational Designs, Atomic Domains and First
Normal Form, Functional Dependencies, Closure set of Functional dependencies, Procedure
for Computing F+, Boyce Codd Normal form, BCNF Decomposition Algorithm, Third
Normal Form, Third Normal Form Decomposition Algorithm
Transactions & Concurrency Control: Transaction Concept, A Simple Transaction Model,

Storage Structure, Transaction Atomicity and Durability, Serializability. Lock-Based
Protocols, Deadlock Handling, Multiple Granularity, Timestamp-Based Protocols.
UNIT IV:
File Organization: Fixed and variable length records, Sequential file organization, Data
Dictionary, Buffer manager.
Indexing and Hashing: Basic Concepts, Ordered Indices, B+-Tree Index Files, B+-Tree
Extensions, Multiple-Key Access, Static Hashing, Extendible Hashing, Comparison of
Ordered Indexing and Hashing, Bitmap Indices.
UNIT V:
Distributed Database Introduction of DDB, DDBMS architectures, Homogeneous and

Heterogeneous databases, Distributed data storage, Advantages of Data Distribution,
Disadvantages of Data Distribution Distributed transactions, Commit protocols, Availability,
Concurrency control & recovery in distributed databases, Directory systems, Data
Replication, Data Fragmentation. Distributed database transparency features, distribution
transparency.
Text Books:
1. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Database System Concepts,
Sixth Edition, Tata McGraw-Hill 2006.
Reference Books:
1. Raghu Rama Kirshna, Johannes Gchrke, Database Management System, Third

Edition, TATA MC Graw Hill, 2003.
2. C J Date, AKannan, S Swamynathan, An Introduction to Database Systems, eigth
Edition Pearson 2006.
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
NATURAL LANGUAGE PROCESSING
(PE-IV)
Course Objectives:
1. To learn the fundamentals of Natural Language Processing

2. To understand the use of CFG and PCFG in NLP
3. To understand the role of semantics of sentences and pragmatics
4. To apply the NLP techniques to IR applications
Course outcomes:
1. To model the language using N-grams.

2. To implement shallow processing models to tackle morphology/syntax of a language.
3. To Examine Syntagmatic and Paradigmatic relations be used for processing the real-
time applications.
4. To apply the algorithms for Discourse Analysis.
UNIT-I:
Introduction: Why is NLP hard, Empirical Laws, Text Processing: Basics, Spelling
Correction: Edit Distance, Weighted Edit Distance, Other Variations, Noisy Channel Model
for Spelling Correction, N-Gram Language Models, Evaluation of Language Models, Basic
Smoothing.
UNIT-II:
Language Modelling: Advanced Smoothing Models, Computational Morphology, Finite -

State Methods for Morphology, Introduction to POS Tagging, Hidden Markov Models for
POS Tagging, Viterbi Decoding for HMM, Parameter Learning, Baum Welch Algorithm,
Maximum Entropy Models – I, Conditional Random Fields, Syntax - Parsing I, Syntax -
CKY, PCFGs, PCFGs - Inside-Outside Probabilities, Inside-Outside Probabilities,
Dependency Grammars and Parsing, Transition Based Parsing, MST-Based Dependency
Parsing.
UNIT-III:
Distributional Semantics – Introduction, Distributional Models of Semantics, Distributional

Semantics: Applications, Structured Models, Word Embeddings, Lexical Semantics,
Wordnet, Word Sense Disambiguation, Novel Word Sense detection.
UNIT-IV:
Introduction: Latent Dirichlet Allocation, Formulation, Gibbs Sampling for LDA,

Applications, LDA Variants and Applications, Entity Linking, Information Extraction –
Introduction, Relation Extraction, Distant Supervision.
UNIT-V:
Text Summarization – LEXRANK, Optimization based Approaches for Summarization,

Summarization Evaluation, Text Classification.
Sentiment Analysis – Introduction, affective Lexicons, Computing with Affective Lexicons,

Aspect - Based Sentiment Analysis.
Text Books:
1. Daniel Jurafsky, James H. Martin ,”Speech and Language Processing: An

Introduction to Natural Language Processing, Computational Linguistics and
Speech”, Pearson Publication, 2014.
2. Deepti Chopra, Nisheeth Joshi, Iti Mathur “Mastering Natural Language Processing
with Python” First Edition, Packt Publishing, 2016
Reference Books:
1. James Allen, “Natural Language Understanding”, 2nd Edition, Benjamin, Cummings
publishing company, 1995.
2. Steven Bird, Ewan Klein and Edward Loper, “Natural Language Processing with
Python” , First Edition, OReilly Media, 2009
3. Rajesh Arumugam, Rajalingappaa Shanmugamani, “Hands-On Natural Language
Processing with Python” , Packt Publishing Ltd., 2018
4. http://www.pdfdrive.com/natural-language-processing-with-python-e1251452.html
5. https://learning.oreilly.com/library/view/hands-on-natural-language/9781789139495
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
DEEP LEARNING
(PE-IV)
Prerequisites: Basic Mathematics, P&S, Python and Machine Learning
Course Objectives:
1. To Give an exposure to Supervised Deep Learning for working with Linearly Non-
Separable Data
2. To provide understanding of Mathematical, Statistical and Computational challenges
of building improved neural net representations.
3. To Know the application of Convolution Neural Networks for High-Dimensional
data, such as image and other data types
4. To Explore Deep Recurrent and Memory Networks for Sentiment Analysis, Machine
Translation and Computer Vision tasks
Course outcomes:
1. Implement Deep Neural Networks for solving Classification and Regression

Problems.
2. Apply Regularization Methods to improve the way neural networks learn.
3. Analyze different optimization algorithms for training deep neural models
4. Apply the concepts of the Deep Convolution Neural networks for Image
classification.
5. Solve the sequence learning problems using Deep Recurrent Neural Networks and
Memory Networks.
UNIT-I
Introduction: Feature descriptor, region descriptor, intensity descriptor, color features,

traditional machine learning vs deep learning, Bayesian learning, Bayes minimum error
classifier, Risk classifier, discriminant function, decision boundary, discriminant function.
UNIT-II
Linear Classifier: KNN classifier, linear classifier, SVM, multi class SVM,
optimization, optimization techniques in machine learning, non-linear functions.
Introduction to Neural Network, single layer perceptron, multilayer perceptron,

Backpropagation Learning, loss function.
UNIT-III
Autoencoder: Autoencoder vs PCA, sparse Autoencoder, Denoising Autoencoder,

contractive Autoencoder, convolution Autoencoder.
CNN Architecture: MLP versus CNN, Popular CNN Architecture: LeNet, AlexNet,
VGG16, Transfer Learning, Vanishing and Exploding Gradient.
UNIT-IV
GoogleNet, ResNet, Optimisers: Momentum Optimiser, Optimisers: Momentum and

Nesterov Accelerated Gradient (NAG) Optimiser, Adagrad, RMSProp, AdaDelta and
Adam, Normalization, Batch Normalization, Layer, Instance, Group Normalization,
Training Trick, Regularization,Early Stopping.
UNIT-V
Applications: Face Recognition, Deconvolution Layer, Semantic Segmentation, LSTM,

Image Denoising, Variational Autoencoder, Generative Adversarial Network.
Text Books:
1. Ian Goodfellow, Yoshua Bengio and Aaron Courville, Deep Learning (1 st
Edition), MIT Press,2017, ISBN 978-0262035613.
2. Michael A. Nielsen, "Neural Networks and Deep Learning", Determination Press,

2015.
Reference Books:
1. Bharath Ramsundar & Reza Bosagh Zadeh, Tensor Flow for Deep Learning,
O’Reilly Media ,2018.
2. Francois Chollet, Deep Learning with Python (1 st Edition), Manning Publications
Company, 2017. ISBN 978-1617294433.
3. Aurélien Géron, Hands-on Machine Learning with Scikit-Learn and TensorFlow
nd
(2 Edition), O'Reilly Media, 2019. ISBN 978-9352139057.
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
INTERNET OF THINGS
(PE-V)
Course Objective:
1. Understand the fundamental concepts of IoT and its components.

2. Learn about various communication protocols and networking technologies essential
for IoT.
3. Explore IoT hardware platforms, edge computing, and the role of SDN in IoT.
4. Address the security, privacy challenges in IoT, and explore real-world IoT
applications.
Course Outcomes:
1. Explain IoT architecture, key technologies, and application areas in various domains.
2. Identify and compare IoT communication protocols, including MQTT, CoAP, and
LPWAN.
3. Develop IoT systems using platforms like Raspberry Pi, integrating sensors and
actuators.
4. Utilize Software-Defined Networking (SDN) for scalable and efficient IoT network
management.
5. Apply security mechanisms to safeguard IoT networks, addressing privacy and data
protection challenges.
UNIT-I:
Introduction: Overview of IoT, Evolution of IoT: From M2M (Machine to Machine) to IoT,
IoT Architecture (3-layer architecture: perception, network, application), IoT Protocol Stack
and Communication Models, Key Enabling Technologies: Sensors, Actuators, Embedded
Systems, IoT vs. Cyber-Physical Systems, Case Studies: Smart Homes, Connected Cars,
Healthcare IoT.
UNIT-II:
IoT Communication Protocols and Network Technologies: IoT Communication

Protocols-MQTT, CoAP, AMQP, XMPP, Low-Power Wide-Area Networks (LPWAN):
LoRa, Sigfox, NB-IoT, Short-Range Wireless Communication: Bluetooth Low Energy
(BLE), Zigbee, Z-Wave, RFID and NFC Technologies, Wireless Sensor Networks (WSN),
Network Security in IoT: Challenges and Solutions.
UNIT-III:
IoT Hardware Platforms and Edge Computing: IoT Hardware Platforms: Arduino,
Raspberry Pi, ESP8266, Intel Edison, Microcontrollers and Microprocessors in IoT,
Interfacing Sensors and Actuators with IoT Devices, IoT Gateways and their Role in the IoT
Ecosystem, Edge computing vs. Cloud Computing: Importance of Edge Computing in IoT,
Real-Time Data Processing and Edge Devices, Software-Defined Networking(SDN)-
Architecture, Controller, OpenFlow, Switches.
UNIT-IV:
IoT Data Management and Analytics: Data Generation, Acquisition, and Storage in IoT,
Cloud Platforms for IoT: AWS IoT, Google Cloud IoT, Azure IoT Hub, IoT Data Analytics:
Data Processing Pipelines and Algorithms, Big Data Solutions for IoT, Real-Time Analytics
in IoT Applications, Machine Learning for IoT: Predictive Analytics, Anomaly Detection,
Case Studies: Predictive Maintenance in IoT-enabled Industries.
UNIT-V:
Security, Privacy, and Applications of IoT: IoT Security Challenges: Attack Vectors,
Vulnerabilities, Secure Communication in IoT: Encryption, Authentication Mechanisms,
Privacy Concerns in IoT Applications, Blockchain and Distributed Ledger Technologies for
IoT Security, IoT Standards and Regulatory Frameworks, Future Trends in IoT: 5G and IoT,
AI in IoT, IoT Edge AI, Application Areas: Smart Cities, Smart Agriculture, Industrial IoT,
Healthcare, Wearables
Text Books:
1. Arshdeep Bahga and Vijay Madisetti, Internet of Things - A Hands-on Approach,

Universities Press, 2015.
2. Simon Monk, Programming Arduino Next Steps: Going Further with Sketches, Second
Edition,2019.
3. Saeed B. Niku, Introduction to Robotics Analysis, Application, Pearson Education
Asia,2001.
Reference Books:
1.The Internet of Things: Enabling Technologies, Platforms, and Use Cases", by Pethuru Raj
and Anupama C. Raman (CRC Press).
2. Matt Richardson & Shawn Wallace, Getting Started with Raspberry Pi, O’Reilly (SPD),
2014.
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
PREDICTIVE ANALYTICS WITH R

(PEC-V)
Course Objectives:
After taking the course, students will be able to

1. Use R for statistical programming, computation, graphics, and modeling,
2. Write functions and use R in an efficient way
3. Fit some basic types of statistical models
4. Use R in their own research,
Course Outcomes:
After successful completion of the course students should be able to
1. Understand the basics in R programming in terms of constructs, control
statements, functions,
2. Access online resources for R and import new function packages into the R workspace
3. Import, review, manipulate and explore ,summarise data-sets in R
4. Apply the R programming from a statistical perspective
5. Apply R Graphics and Tables to visualise results of various Statistical operations on
data.
UNIT I :
Basics of R: Introduction, R-Environment Setup, Help functions in R, Vectors – Scalars –

Declarations
Basic Data Types:Vectors – Scalars – Declarations, Creating and Naming Vectors, Vector
Arithmetic, Vector Sub setting,
Matrices:Creating matrices – Matrix operations – Applying Functions to Matrix Rows and

Columns – Adding and deleting rows and columns – Vector/Matrix Distinction – Arrays -
Class.
UNIT II :
Factors: Introduction to Factors: Factor Levels, Summarizing a Factor, Ordered Factors,

Comparing Ordered Factors, Common functions used with factors
Data Frame: Creating Data Frames – Matrix-like operations in frames – Merging Data
Frames – Applying functions to Data frames – Sub setting of Data Frames, Extending Data
Frames, Sorting Data Frames.
Lists: Creating a Named List, Accessing List Elements, Manipulating List Elements, Merging
Lists, Converting Lists to Vectors, applying functions to lists
Conditionals and Control Flow:Arithmetic and Boolean operators and values, Relational
Operators, Relational Operators and Vectors, Logical Operators, Logical Operators and
Vectors, Conditional Statements.
UNIT III :
Iterative Programming in R: Introduction, While Loop, For Loop, Looping Over List.
Functions in R: Introduction, Writing a Function in R, Nested Functions, Function Scoping,

Recursion, Loading an R Package, Mathematical Functions in R, Cumulative Sums and
Products, Calculus in R, Input and Output Operations.
UNIT IV :
Apply Family in R : Introduction, Using Apply in R, Using Lapply in R, Using Sapply, Using
Tapply in R: Split Function, Using Mapply in R,
Charts and Graphs : Introduction, Pie Chart: Chart Legend, 3D Pie Chart, Bar Chart, Box
Plot, Histogram, Line Graph: Multiple Lines in Line Graph, Scatter Plot.
UNIT V : Interfacing
Data Interfaces: Introduction, CSV Files: Syntax, Importing a CSV File, Excel Files: Syntax,
Importing an Excel file, Binary Files: Syntax, XML Files, Web Data, Databases.
Statistical Applications: Introduction, Basic Statistics – Linear Model – Generalized Linear
models – Non-linear models – Time Series and Auto-correlation – Clustering, Correlation
and Covariance, T-Tests,-ANOVA.
Text Books & Other References
1. R Programming for Data Science by Roger D. Peng

2. The Art of R Programming by Prashanth singh, Vivek Mourya, Cengage Learning India.
Reference Books:
1. R for Everyone, Lander, Pearson

2. R Cookbook, PaulTeetor, Oreilly.
3. R in Action,Rob Kabacoff, Manning
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
MOBILE APPLICATION DEVELOPMENT
(PEC-V)
Course Objectives:
1. Outline the usage of Android development framework.

2. Understand the main components of an Android application and its entire life Cycle.
3. Develop database programming using SQLite.
4. Identify the use of location-based service in android applications.
5. Build SMS and MMS applications using Intents.
Course Outcomes:
1. Analyse the architecture of android and current trends in mobile operating systems.
2. Apply suitable software tools and APIs for the design of User Interfaces to a particular
mobile application.
3. Design applications for mobile devices using SQLite Database.
4. Apply the location-based services in android applications.
5. Summarise the Monitoring changes to the phone, network, data connectivity and SIM
states.
UNIT I:
Introduction To Android: Features of Android, The development framework: Understanding
the Android Software Stack, Android Application Architecture; the Dalvik Virtual Machine,
Creating First Android Application, Types of Android Applications, Android Development
Tools: The Android Virtual Device Manager, Android Emulator, The Dalvik Debug Monitor
Service.
UNIT II:
Creating applications and Activities: Introduction to the application Manifest File, Using
the Manifest Editor, Externalizing Resources: Creating Resources - Simple Values,
Drawables, Layouts, Menus, Animations.The Android Activity Life cycle. Building User
Interfaces:Fundamental Android UI design, Introducing Layouts: Defining Layouts, Using
Layouts to Create Device Independent User Interfaces, Optimizing Layouts.
UNIT III:
Databases and Content Providers: Introduction to Android Databases, Introducing SQLite,

Content Values and Cursors, working with SQLite Databases - Introducing the
SQLiteOpenHelper, querying a Database, Extracting Values from a Cursor, Adding,
Updating, and Removing Rows, Creating Content Providers, Using Content Providers -
Introducing the Content Resolver, Querying Content Providers, Adding, Deleting, and
Updating Content
UNIT IV:
Maps and Location based services: Using the location-based services, selecting a Location
Provider, selecting a Location provider, finding current location; Creating Map-Based
Activities: Introducing Map View and Map Activity, Creating a Map-Based Activity, Maps
and Fragments
UNIT V:
Telephony and SMS: Using telephony - Initiating Phone Calls, Accessing Telephony
Properties and Phone State, Monitoring Changes in Phone State Using the Phone State
Listener, Introducing SMS and MMS - Using SMS and MMS in Your Application, Sending
SMS and MMS from Your Application Using Intents, Sending SMS Messages Using the
SMS Manager.
Text Book:
1. Reto Meier, Professional Android 4 Application Development, 1 stEdition, Wrox

Press, Wiley Publishing, 2014.
Reference Books:
1. Pradeep Kothari, Android Application Development (with Kitkat Support), Black

Book, 2014, Dreamtech Press publisher, Kogent Learning Inc., 2014
2. Erik Hellman, Android Programming: Pushing the Limits, 1st Edition, Wiley
Publications, 2014.
3. Mike Wolfson, Android Developer Tools Essentials, O’Reilly Edition, 1st Edition,
2013.
ANURAG UNIVERSITY
M.Tech(CSE)

3 0 3
WEB TECHNOLOGIES
(PE-V)
Course Objectives:
1. To provide knowledge on web architecture, web services.

2. Client side scripting technologies to focus on the development of web-based information
systems and web services.
3. To provide skills to design interactive and dynamic web sites.
4. To provide knowledge for implementing web applications with database connection
Course Outcomes:
1. Design static web pages and provide client side authentication.(L6)

2. Prepare Static Web pages With Validations.(L6)
3. Develop new tag sets using XML mechanism.(L5)
4. Design and develop web applications using JSP and MVC architecture.(L6)
5. Understand database connectivity and retrieving data using client/server database.(L2)
UNIT I:
INTRODUCTION TO WEB: Understanding Internet and Web, Web Architecture, Web

servers, protocols: HTTP, Introduction HTML: History of HTML, WWW, HTML Basics:
Elements, Attributes, Tags, Tables, Forms, Frames.div and span tags.HTML5
UNIT II:
CSS: Introduction to cascading style sheet, Types of style sheets, page layout, selectors,
pseudo classes and elements.CSS3
JAVA SCRIPT: Introduction to scripting, control structures, conditional statements, Arrays

functions, objects.JS framework( ReactJS)
HTML DOM: Predefined object (Window, Location, History, Navigator). Events, DOM
Node methods, Navigation, creating nodes, adding nodes, inserting nodes, removing &
Replaces Nodes, Form object and Elements, DHTML with Java Script. front end
frameworks(bootstrap),
UNIT III:
XML: Basics of XML, Elements, Attributes, validation, Name space.
XML Scheme Languages: Introduction to DTD, internal and external DTD, Elements of
DTD, DTD Limitations, XML Schema, Schema structure, Elements, parsing XML: XML
DOM, Document node, element node, Text node, Java and DOM, Navigating DOM Tree.
UNIT IV:
AJAX: Introduction, Environment, Asynchronous communication, process steps, sending

and Retrieving Information, Ajax with XML.
Servlets : Introduction, Lifecycle, Generic and HTTP servlet, passing parameters to servlet,
HTTP servlet Request & Response interfaces, Deploying web Applications, Session
Tracking: Hidden form fields, cookies, URL- Rewriting, session.
UNIT V:
JSP: Introduction, Difference Between servlets & JSP, Anatomy of JSP page, JSP elements:
Directives, comments, Expressions, scriptlets, Declaration, Implicit JSP objects, using Action
elements.
JDBC: Introduction, JDBC Drivers, Loading Driver, establishing connection, Executing

SQL statement in JSP pages, MVC architecture.
Text Book:
1. Uttam K. Roy, Web Technologies, 8th Impression, Oxford Publication, 2014.
Reference Books:
1. Thomas Powell, “The Complete Reference HTML and CSS”, 5th Edition, Tata
McGraw Hill, 2010.
2. Thomas Powell, Fritz Schneider, “The Complete Reference JavaScript 2.0”, 3rd
Edition, Tata McGraw Hill, 2012.
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
ENGLISH FOR PROFESSIONALS

(OE-I)
Coruse Objective:
To prepare the students to use the language effectively in all professional pursuits
Course Outcomes:
On successful completion of this course, students will be able to
1. Analyze the language use in communicative process

2. Describe the process and product
3. Interpret the ideas in group activities
4. Apply different approaches to comprehend the written text
5. Write any technical and official correspondence within the framework
UNIT-I
Essentials of Communication:
Essentials of Grammar-Rudiments of Communications Skills(Listening, Speaking, Reading,

and Writing)- Applied Grammar and Usage- Non-Verbal Communication
UNIT-II
Listening Skills:
Art of Listening- Developing Effective Listening Skills-Process of Listening, Intensive &
Extensive Listening
Podcasts, Vodcasts(ICT enabled)-Five steps to Active Listening-Effective and Ineffective

Listening Skills-Listening & Note-taking
UNIT-III
Speaking Skills:
Dynamics of Effective Speaking -Group Discussion-Simulated Presentations, Process &

Product Descriptions- Proxemics, Paralinguistic Features
UNIT-IV
Reading Skills:
The Art of Effective Reading- Basic steps to Effective Reading-Extensive and Intensive
Reading -Approaches to Efficient Reading-Reading Comprehension
UNIT-V
Writing Skills:
Art of Condensation-Descriptive Writing Techniques-Writing & Answering Memos,

Circulars -Inter & Intra Official Communication -Writing Minutes of Meeting-Netiquette - E-
mail & Blog Writing - Note-making
Textbook:
1. Kumar, Sanjay and Pushp Lata, Communication Skills, Second edition, Oxford
University Press, 2015.
References:
1. Adair, John.The Effective Communicator. Jaico Publishing House.1995.

2. Adler, B.Ronald.Communicating at Work.(Seventh edition.) McGraw Hill.2004.
3. Aruna, Koneru. Professional Communication.McGraw Hill.2017.
4. Ibbotson,Mark.Cambridge English for Engineering Professionals. Cambridge
University.2008.
5. Oxford English for Careers.Oxford University Press.
ANURAG UNIVERSITY
M.Tech(CSE)
I Year M.Tech(CSE)- II Sem L T / P / D
C
3 0 3
ENTREPRENEURSHIP DEVELOPMENT
(OE-I)
Course Objectives:
1. To provide insights into basic characteristics and process of entrepreneurship

2. To develop a business idea and prepare a bankable project report
3. To identify the methods to initiate ventures and the sources of finance
4. To create awareness about the legal challenges of entrepreneurship and IPR
5. To know and apply the various strategic and managerial concerns in the growth stage
of the firms
Course Outcomes: At the end of the course, students will be able to
1. Interpret concepts and process of entrepreneurship.

2. Apply idea development strategies and prepare a bankable project report
3. Analyse various opportunities towards initiating ventures.
4. Recognize legal challenges of entrepreneurship.
5. Assess the strategic perspectives of entrepreneurship.
UNIT- I
Introduction:Introduction to Entrepreneurship – Characteristics, Qualities, Key Elements

and Skills of an Entrepreneur, entrepreneurial stress, Corporate entrepreneurship,
Entrepreneurial process.
UNIT -II
Business Plan Preparation:Search for business idea, project identification, project

formulation and development, contents of business plan and Preparation of a Bankable
Project Report.
UNIT- III
Launching Entrepreneurial Venture:Opportunities identification, Methods to initiate

Ventures, Creating new ventures, Acquiring existing ventures, Franchising. Sources of
finance, Forms of capital requirements, funding agencies and supporting institutions.
UNIT- IV:
Legal challenges of Entrepreneurship:Intellectual Property Protection – Patents,

Copyrights, Trademarks and Trade Secrets. The challenges of new Venture Startups- Poor
financial understanding, critical factors for new venture development, Evaluation process,
Feasibility criteria approach.
UNIT -V:
Strategic perspectives in Entrepreneurship:Strategic planning- Strategic Action, Strategic

Positioning, Business Stabilization, Building the adaptive firms, understanding the growth
stage, unique managerial concern of growing ventures.
Text Book:
1. D F Kuratko and T V Rao “Entrepreneurship- A South-Asian Perspective “Cengage

Learning, 2012
2. Vasant Desai, Small Scale Industries and Entrepreneurship, HPH, 2012.
References:
1. Rajeev Roy, Entrepreneurship, 2e, Oxford, 2012.

2. B.Janakiram and M.Rizwana, Entrepreneurship Development:Text & Cases, Excel
Books,2011.
3. Stuart Read, Effectual Entrepreneurship, Routledge, 2013.
4. Robert Hisrich et al, Entrepreneurship, 6e, TMH, 2012.
5. Nandan H, Fundamentals of Entrepreneurship, PHI, 2013
6. Shejwalkar, Entrepreneurship Development, Everest, 2011
7. Khanka, Entrepreneurship Development, S.Chand, 2012
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
TECHNICAL AND BUSINESS COMMUNICATION SKILLS

(OE-I)
Course Objective:
To help the students to develop effective communication skills in all communicative contexts
for professional advancement
Course Outcomes:
On successful completion of the course, students will be able to:

1. Communicate technical and business correspondence
2. Reflect on the themes discussed
3. Recognize ethical implications of technical communication in professional contexts
4. Identify the contemporary issues in engineering from environmental, societal,
economic, and global perspectives
5. Demonstrate ethical decisions in complex situations
UNIT-I
E-World & E-Communication:
E-language - E-governance - E-commerce/E-business - E-banking - E-waste
UNIT-II
Business Establishment & Infrastructure Development:
Power Supply - Industrial Park - Business Correspondence: Follow-up letters - Acceptance &
Rejections - Persuasive letters - Resignation letters
UNIT-III
Technology and Society:
Robot Soldiers - For a Snapshot of a Web - Placing an order - Proposal Writing - Patents &
Rights (National & International) - Intellectual Property - Nanotechnology
UNIT-IV
Ethics in Business Communication:
Ethical issues involved in Business Communication - Ethical dilemmas facing managers -

Ethical Code & Communication - Standards in Daily Life - Total Quality Management -
World University Ranking
UNIT-V
Management Information System:
Corporate Governance - Business Process Outsourcing - Project Management

Communication - Marketing Communication
Textbook:
1. Dhanavel, P. S. English and Communication Skills for Students of Science and

Engineering. Orient Black Swan. 2009.
References:
1. Anderson, V. Paul. Technical Communication. Cengage. 2014.

2. Kalkar, Anjali. et.al. Business Communication. Orient Black Swan. 2010.
3. Knisely, W. Charles. and Knisely, I. Karin. Engineering Communication. Cengage.
2015.
4. Kumar, Sanjay. and Pushp Lata. Language and Communication skills for Engineers.
Oxford University Press. 2018.
5. Raman, Meenakshi and Singh, Prakash. Business Communication. (Second Edition.).
Oxford University Press. 2012.
ANURAG UNIVERSITY
M.Tech(CSE)
3 0 3
PROJECT MANAGEMENT
(OE-I)
Course Objectives:
1. To understand the concept of Project Management.

2. To know about the different approaches to project screening and planning.
3. To explain about the factors of risk involved in project execution.
4. To understand about team leading and functional cooperation.
5. To know about the project performance and future trends in the project management.
Course Outcomes: At the end of the course students will be able to
1. Explain about the life cycle and other concepts of Project Management.
2. Apply different approaches to project screening and planning
3. Analyze different risk factors in project execution
4. Estimate how to lead a team, to get functional cooperation
5. Build performance evaluation reports and future trends in project management.
UNIT-I
Introduction: Meaning, Need, Principles Project Lifecycle and itsPhases, Project

Management Research in brief, Project Management today, Organization strategy and
structure and culture, Format of organization structure, Stake holder Management,
Organization Culture, creating a culture for Project Management.
UNIT-II
Project Identification and Planning: Defining the project, Project Identification Process,
Approaches to Project Screening and Selection, Project Planning, Work Breakdown
Structure, Financial Module, Getting Approval and Compiling a Project Charter, setting up a
Monitoring and Controlling Process.
UNIT-III
Project Execution: Initiating the Project, Controlling and Reporting Project Objectives,
Conducting project evaluation, Risk, Risk Management Factors, Project Management, Four
Stage Process, Risk Management an Integrated Approach, Cost Management, Creating a
Project Budget.
UNIT-IV
Leading Project Teams: Building a Project Team, Characteristics of an effective Project

Team, achievingCross- Functional Co-operation, Virtual Project Teams, Conflicts
Management, Negotiations.
UNIT-V
Performance Measurement and Evaluation: Monitoring Project Performances, Project

Control Cycles,Earned Value Management, Human factors in Project Evaluation and Control,
Project Termination, Typesof Project Terminations, Project Follow-up. Current and Future
Trends in Project Management.
TEXT BOOKS:
1. Gray, Larson, Project Management, Tata McGraw Hill,2015

2. Jeffery K.Pinto, Project Management,Pearson Education,2015
REFERENCES
1. Enzo Frigenti, Project Management, Kogan, 2015

2. R. Panneerselvam & P. Senthil Kumar, Project Management, PHI, 2015
3. Thomas M. Cappels, Financially Focused Project Management, SPD, 2008.
ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
JAVA PROGRAMMING LAB
(PC LAB)
Course Outcomes:
1. Explain Java Environment and use of Java Development Kit for the creation
and execution of java programs
2. Develop programs on various concepts like data abstraction & data hiding,
encapsulation, inheritance, polymorphism.
3. Develop the programs using interfaces and packages
4. Create and use threads and handle exceptions
5. Develop GUI applications using Applet and JDBC programs.
Week 1:
Write a Java Program to define a class, define instance methods for setting and
retrieving values of instance variables and instantiate its object
Write a program to implement static and this keyword?
Week 2:
Write a program to illustrate types of constructors and constructor overloading
Write a java program to illustrate Method overloading
Week 3:
Write a Java program to practice using String class and its methods
.
Write a program to illustrate parameter passing Techniques.
Week 4:
Write a program to find Minimum and Maximum element using Arrays
Write a java program to illustrate Recursion and nested class
Week 5:
Write a program to illustrate types of inheritance.
Write a program to illustrate the use of creation of packages.
Week 6:
Write a java program to demonstrate the concept of polymorphism.
Write a java program to illustrate Method Overriding and abstract class?
Week 7:
Write a program to illustrate Interfaces
Write a program to illustrate Files
Week 8:
Write a program to illustrate try, catch, throw, throws and finally keywords
Write a program to implement the concept of User defined Exceptions.
Week 9:
Write a program to illustrate String Tokenizer, Date, Random and Scanner classes?
Write a program to illustrate collection classes and interfaces
Week 10:
Write a program to illustrate Multithreading?
Write a program to illustrate thread priorities.
Week 11:
Write a program to illustrate Thread Synchronization
Write a program to illustrate Inter Thread Communication

Week 12:
Write a program to illustrate applet concept.
Write a program to illustrate passing parameters to applet
Week 13:
Write a program to illustrate Event Handling(keyboard,Mouse events)
Week 14:
Write a program to illustrate AWT controls.
Write a program to develop a calculator application using AWT
Week 15:
Write a program to illustrate JDBC.
ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
INTERNET OF THINGS LAB

(PE-V LAB)
Week 1:
1. Study and Install IDE of Arduino and different types of Arduinos.
2. Write a program using Arduino IDE for Blink LED.
3. Write Program for RGB LED using Arduino.
Week 2:
4. Write a program for buzzer using Arduino.
5. Write a program for LDR using Arduino.
6. Write a program for IR Sensor using Arduino.
Week 3:
7. Study the Temperature sensor and Write Program for monitor temperature using
Arduino.
Week 4:
8. Study and Implement RFID, NFC using Arduino.
Week 5:
9. Study and implement MQTT protocol using Arduino.
Week 6:
10. Study and Implement Arduino Uno with Ethernet Connection to Send data to a
Cloud
Week 7:
11. Study and Implement Arduino Uno with ESP 32 Connection to Send data to a
Cloud
Week 8:
12. Study and Configure Raspberry Pi.
13. Write program for LED blink using Raspberry Pi
14. Write program for RGB LED using Raspberry Pi
Week 9:
15. Implement Raspberry Pi based Automated Street Lighting System.
16. Write an Arduino program for Distance Measurement Using Ultrasonic Sensor
and displaying on LCD.
Week 10:
17. Write program for Buzzer using Raspberry Pi
18. Write program for LDR using Raspberry Pi
19. Write program for IR Sensor using Raspberry Pi
Week 11:
20. Implement an IoT based weather monitoring system using Raspberry Pi.
Week 12:
21. Study and Implement RFID, NFC using Raspberry Pi.
Week 13:
22. Study and Implement Raspberry Pi with Ethernet Connection to Send data to a
Cloud
Week 14:
23. Study and Implement Raspberry Pi with Wifi Connection to Send data to a Cloud
Week 15:
24. Study and Implement Zigbee Protocol using Arduino.
Week 16:
25. Study and Implement Zigbee Protocol using Raspberry Pi.
ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
PREDICTIVE ANALYSIS WITH R LAB

(PE-V LAB)
Course Outcomes:
1.Install and use R for simple programming tasks.

2.Explore R environment
3.Create loops and their own customized functions to solve different types of
problems
4. Visualize data insights using charts and graphs
Week-1: Installation and Environment set up R and Rstudio

Week-2: Experiments on Vector Arithmetic operations
Week-3: Experiments on Matrices operations
Week-4 Experiments on Arrays functions
Week-5: Experiments on Factors
Week-6: Experiments on Data Frames
Week-7: Experiments on List operations
Week-8: Write R scripts which demonstrate logical operations and Conditional
Statements
Week-9: Write R scripts which demonstrate Looping Over List
Week-10: Write R scripts which demonstrate Nested Functions and Function Scoping
Week-11: Experiments on Mathematical Functions in R
Week-12: Experiments on Calculus in R
Week13: Experiments on Lapply, Sapply and Apply functions
Week-14: Genarate different Charts and Graphs using R
ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
MOBILE APPLICATION DEVELOPMENT LAB

(PE-V LAB)
Course Outcomes:
1. Develop user interfaces for the Android platform.

2. Implement various mobile applications using Emulators.
3. Create a database for mobile applications using SQLite Database.
4. Perform location-based services in android applications.
5. Create telephony and SMS for android applications.
List of Experiments:
1. Develop an Application that Uses GUI Components, Font and Colors

2. Develop an Application that Uses Layout Managers and Event Listeners.
3. Develop a Native Calculator Application.
4. Write an Application that Draws Basic Graphical Primitives on The Screen.
5. Develop an Application that Makes Use of Database.
6. Develop a Native Application that Uses GPS Location Information.
7. Implement an Application that Writes Data to The SD Card.
8. Implement an Application that Creates an Alert Upon Receiving A Message.
9. Write a Mobile Application that Creates Alarm Clock
ANURAG UNIVERSITY
M.Tech(CSE)

0 3 1.5
WEB TECHNOLOGIES LAB

(PE-V LAB)
Course Objectives:
1. Client server architecture and able to develop static web application

2. Client-side data validation using java script
3. To create dynamic web application using server side technologies
4. To create fully functional web application with MVC architecture.
Course Outcomes:
Student will be able to:

1. Design static web pages and provide client side authentication.
2. Develop new tag sets using XML mechanism.
3. Understand database connectivity and retrieving data using client/server databases.
4. Design dynamic web pages and develop web applications using MVC architecture.
Week-1: Design the following static web pages required for an online book store web
site.
1) HOME PAGE: 2) LOGIN PAGE:
Week -2: Design the student REGISTRATION PAGE:
Week- 3: Apply internal and external CSS (Cascading Style Sheets) for week 1&2
pages.
Week -4: VALIDATION:
Write JavaScript to validate the following fields of the above registration page.
Week -5: Design the catalog page.
Week -6: Write an XML file which will display the Book information which includes
the following: Write a Document Type Definition (DTD) to validate the above XML
file.
Week -7: Develop week(1-5) using bootstrap.
Week -8: Write a program to display the HELLO WORLD message using servlet.
Week -9: Write a program to create cookies and retrieval using servlet.
Week -10: Write a program to display the HELLO WORLD message using JSP
Week -11: Convert all above static web pages into the JSP pages.
Week -12: Using registration form. Authenticate the user when he submits the login
form using the username and password from the database.
Week -13: Create tables in the database which contain the details of items (books in
our case like Book name , Price, Quantity, Amount )) of each category. Modify your
catalog page (week 4)in such a way that you should connect to the database and
extract data from the tables and display them in the catalog page using JDBC.
Week -14: Implement week -10 in MVC architecture.

R24-M.Tech(CSE) course Structure and Syllabus (1)

Uploaded by

Copyright:

Available Formats

R24-M.Tech(CSE) course Structure and Syllabus (1)

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

R24-M.Tech(CSE) course Structure and Syllabus (1)

Uploaded by

Copyright:

Available Formats

Program Structure and Syllabus

Computer Science and

S.No Phase Minimum Deliverables Credits CIE* SEE*

1. 40% of the courses are offered through NPTEL.

I Year M.Tech(CSE)- I Sem L T/P/D C

ADVANCED DATA STRUCTURES

Graphs- Graphs terminology, Graph ADT, representations, graph traversals/search methods-

1.Data structures, Algorithms and Applications in Java, S.Sahni, Universities Press.

1.Java for Programmers, Deitel and Deitel, Pearson education.

1. Describe the encryption and decryption Algorithms

1. Demonstrate information security, in both management and technical aspects.

Information Security: Introduction, History of Information security, What is Security,

Cryptography: Concepts and Techniques, symmetric and asymmetric key cryptography,

Security at layers (Network, Transport, Application): IPSec, Secure Socket Layer(SSL),

1. Michael E. Whitman, Herbert J. Mattord, Principles of Information Security, 4th Edition,

1. C K Shyamala, N Harini, Dr T R Padmanabhan, Cryptography and Network Security, 1st

1. Gain a historical perspective of AI and its foundations.

1. Understand history of AI and strengths of AI to identify problems applicable to AI.

UNIT-I: Introduction: Philosophy of AI, History of AI, Definitions, Modeling a Problem

UNIT-II: Search Algorithms: Best first search, A* Algorithm, Iterative Deepening A*

UNIT-III: Constraint Satisfaction: Representation of the atomic state, Map coloring,

UNIT-IV: Bayesian Networks: Factorization, Conditional Independences & d-Separation,

UNIT-V: Reinforcement Learning: Model-based Learning for policy evaluation (Passive

NPTEL Course details:

1. The fundamental concepts of computer networking, different types of topologies, and

UNIT-I: INTRODUCTION: Introduction to Computer Networks History, Circuit Switching

UNIT-III: Network Layer Primitives: Introduction, IP Addressing (IPv4), classful

1. Behrouz A Forouzan ,Data Communications and Networking,4th Edition, McGraw-

1. Andrew S. Tanenbaum, Computer Networks, Third Edition.

1. Understand fundamental concepts and principles of computer vision, including image

UNIT-I: Fundamentals of Image Processing: Introduction, Image representation, Image

UNIT-IV: Color Fundamentals and Range Processing: Electromagnetic spectrum, color

NPTEL Course details:

1. The Essentials of designing interactive systems

UNIT-I: Essentials of Designing Interactive Systems: Designing interactive systems: a fusion

UNIT-II: Techniques for Designing Interactive Systems: Understanding: Understanding

UNIT-V: Ubiquitous Computing, Mobile Computing, Wearable Computing: Ubiquitous

1. David R. Benyon, “Designing Interactive Systems: A Comprehensive Guide to HCI, UX

NPTEL Course details:

UNIT-I: Introduction: Knowledge discovery process, Data Mining definition, knowledge

UNIT-II: Classification Basics: Rule generation, classification-Decision Tree, Bayes

UNIT-III: Classifiers: Support vector machine (SVM), linear separators, decision

UNIT-IV: Clustering, Outlier detection: Introduction, types of clustering, partitioning based

UNIT-V: Regression & Dimensionality Reduction: Introduction, linear, non-linear

1. Jiawei Han, MichelineKamber, “Data Mining,Concepts and Techniques”, Morgan

NPTEL Course details:

1. Understand the functionalities of main components in operating systems.

UNIT-I: Introduction: Operating systems objectives and functions: Computer system

UNIT-V: Deadlocks, Protection: Deadlock characterization, methods of handling deadlocks,

1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne, “Operating System Principles”

1. Andrew S Tanenbaum, “Modern Operating Systems”, PHI, 3rd Edition, 2007.

NPTEL Course details:

1. To understand the concepts of virtualization and its benefits

1. Explain the fundamental concepts, models, and architectures of cloud computing,

VM Resource Allocation, Cloud-Fog-Edge Enabled Analytics: Virtual Machine Provisioning,

Serverless Computing and FaaS Model: Introduction to Serverless Computing, Function as a

1. Ivanka menken, Gerard Blokdijk, Cloud Computing Virtualization Specialist

1. Anthony T. Velte, Tobe J. Velte, Robert Elsenpeter, Cloud Computing: A Practical

NPTEL Course details

At the end of the course the students will be able to: