R19M.Tech - CS CSESyllabus

R19 M.TECH.
CSE/CS
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
M. Tech. COMPUTER SCIENCE AND ENGINEERING/COMPUTER SCIENCE
EFFECTIVE FROM ACADEMIC YEAR 2019 - 20 ADMITTED BATCH
R19 COURSE STRUCTURE AND SYLLABUS
I YEAR I – SEMESTER
Course Code Course Title L T P Credits
Professional Mathematical Foundations of Computer Science
3 0 0 3
Core - I
Professional Advanced Data Structures
3 0 0 3
Core - II
1. Information Security
Professional
2. Mobile Application Development 3 0 0 3
Elective - I
3. Machine Learning
1. Network Security
Professional
2. Cloud Computing 3 0 0 3
Elective - II
3. Data Mining
Lab - I Advanced Data Structures Lab 0 0 4 2
Lab - II Machine Learning Lab 0 0 4 2
Research Methodology & IPR 2 0 0 2
Audit - I Audit Course - I 2 0 0 0
Total 16 0 8 18
I YEAR II – SEMESTER
Professional Advanced Algorithms
3 0 0 3
Core - III
Professional Advanced Computer Architecture
3 0 0 3
Core - IV
1. Web and Database Security
Professional
2. Internet of Things 3 0 0 3
Elective - III
3. Data Science
1. Cyber Security
Professional
2. Advanced Computer Networks 3 0 0 3
Elective - IV
3. Big Data Analytics
Lab - III Advanced Algorithms Lab 0 0 4 2
Lab - IV Data Science Lab 0 0 4 2
Mini Project with Seminar 0 0 4 2
Audit - II Audit Course - II 2 0 0 0
Total 14 0 12 18
Page 1 of 55
R19 M.TECH. CSE/CS
II YEAR III – SEMESTER

1. Digital Forensics
Professional
2. High Performance Computing 3 0 0 3
Elective - V
3. Deep Learning
Open Elective Open Elective 3 0 0 3
Dissertation Dissertation Work Review - II 0 0 12 6
Total 6 0 12 12
II YEAR II - SEMESTER
Dissertation Dissertation Work Review - III 0 0 12 6
Dissertation Dissertation Viva-Voce 0 0 28 14
Total 0 0 40 20
*For Dissertation Work Review - I, Please refer 7.8 in R19 Academic Regulations.
Audit Course I & II:

1. English for Research Paper Writing
2. Disaster Management
3. Sanskrit for Technical Knowledge
4. Value Education
5. Constitution of India
6. Pedagogy Studies
7. Stress Management by yoga
8. Personality Development Through Life Enlightenment Skills
Page 2 of 55
R19 M.TECH. CSE/CS

M. Tech - CSE/CS – I Year – I Semester
Common to CSE and CS Syllabus
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (PC – I)
Pre-Requisites: UG level course in Discrete Mathematics/ Mathematical Foundations of Computer

Science
Course Objectives:
 To understand the mathematical fundamentals that is prerequisites for a variety of courses
like Data mining, Network protocols, analysis of Web traffic, Computer security, Software
engineering, Computer architecture, operating systems, distributed systems, Bioinformatics,
Machine learning.
 To develop the understanding of the mathematical and logical basis to many modern
techniques in information technology like machine learning, programming language design,
and concurrency.
 To study various sampling and classification problems.
Course Outcomes: After completion of course, students would be able to:

 To understand the basic notions of discrete and continuous probability.
 To understand the methods of statistical inference, and the role that sampling distributions
play in those methods.
 To be able to perform correct and meaningful statistical analyses of simple to moderate
complexity.
UNIT – I
Probability mass, density, and cumulative distribution functions, Parametric families of distributions,
Expected value, variance, conditional expectation,
Applications of the univariate and multivariate Central Limit Theorem, Probabilistic inequalities,
Markov chains
UNIT - II
Random samples, sampling distributions of estimators, Methods of Moments and Maximum
Likelihood,
UNIT - III
Statistical inference, Introduction to multivariate statistical models: regression and classification
problems, principal components analysis, The problem of over fitting model assessment.
UNIT – IV
Graph Theory: Isomorphism, Planar graphs, graph colouring, Hamilton circuits and Euler cycles.
Permutations and Combinations with and without repetition. Specialized techniques to solve
combinatorial enumeration problems
UNIT-V
Computer science and engineering applications Data mining, Network protocols, analysis of Web
traffic, Computer security, Software engineering, Computer architecture, operating systems,
distributed systems, Bioinformatics, Machine learning.
Recent Trends in various distribution functions in mathematical field of computer science for varying
fields like bio-informatics, soft computing, and computer vision.
Page 3 of 55
R19 M.TECH. CSE/CS
Text Book:
John Vince, Foundation Mathematics for Computer Science, Springer.
References:
1. K. Trivedi. Probability and Statistics with Reliability, Queuing, and Computer Science
Applications. Wiley.
2. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and
Probabilistic Analysis.
3. Alan Tucker, Applied Combinatorics, Wiley
Page 4 of 55
R19 M.TECH. CSE/CS

ADVANCED DATA STRUCTURES (PC- II)
Pre-Requisites: UG level course in Data Structures

Course Objectives:
 The student should be able to choose appropriate data structures, understand the
ADT/libraries, and use it to design algorithms for a specific problem.
 Students should be able to understand the necessary mathematical abstraction to solve
problems.
 To familiarize students with advanced paradigms and data structure used to solve algorithmic
problems.
 Student should be able to come up with analysis of efficiency and proofs of correctness.

 Understand the implementation of symbol table using hashing techniques.
 Understand the implementation of symbol table using hashing techniques.
 Develop algorithms for text processing applications.
 Identify suitable data structures and develop algorithms for computational geometry problems.
UNIT - I
Dictionaries:
Definition, Dictionary, Abstract Data Type, Implementation of Dictionaries.
Hashing:
Review of Hashing, Hash Function, Collision Resolution Techniques in Hashing, Separate Chaining,
Open Addressing, Linear Probing, Quadratic Probing, Double Hashing, Rehashing, Extendible
Hashing.
UNIT - II
Skip Lists:
Need for Randomizing Data Structures and Algorithms, Search and Update Operations on Skip Lists,
Probabilistic Analysis of Skip Lists, Deterministic Skip Lists.
UNIT - III
Trees:
Binary Search Trees, AVL Trees, Red Black Trees, 2-3 Trees, B-Trees, Splay Trees
UNIT - IV
Text Processing:
Sting Operations, Brute-Force Pattern Matching, The Boyer- Moore Algorithm, The Knuth-Morris-Pratt
Algorithm, Standard Tries, Compressed Tries, Suffix Tries, The Huffman Coding Algorithm, The
Longest Common Subsequence Problem (LCS), Applying Dynamic Programming to the LCS Problem
UNIT - V
Computational Geometry:
One Dimensional Range Searching, Two-Dimensional Range Searching, constructing a Priority
Search Tree, Searching a Priority Search Tree, Priority Range Trees, Quadtrees, k-D Trees.
Recent Trands in Hashing, Trees, and various computational geometry methods for efficiently solving
the new evolving problem
Page 5 of 55
R19 M.TECH. CSE/CS
References:
1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C++, 2nd Edition, Pearson,
2004.
2. M T Goodrich, Roberto Tamassia, Algorithm Design, John Wiley, 2002.
Page 6 of 55
R19 M.TECH. CSE/CS

INFORMATION SECURITY (Professional Elective - I)
Prerequisites
1. A Course on “Computer Networks and a course on Mathematics
Course Objectives
1. To understand the fundamentals of Cryptography
2. To understand various key distribution and management schemes
3. To understand how to deploy encryption techniques to secure data in transit across data
networks
4. To apply algorithms used for secure transactions in real world applications
Course Outcomes
1. Demonstrate the knowledge of cryptography, network security concepts and applications.
2. Ability to apply security principles in system design.
3. Ability to identify and investigate vulnerabilities and security threats and mechanisms to
counter them.
UNIT - I
Security Attacks (Interruption, Interception, Modification and Fabrication), Security Services
(Confidentiality, Authentication, Integrity, Non-repudiation, access Control and Availability) and
Mechanisms, A model for Internetwork security.
Classical Encryption Techniques, DES, Strength of DES, Differential and Linear Cryptanalysis, Block
Cipher Design Principles and Modes of operation, Blowfish, Placement of Encryption Function, Traffic
Confidentiality, key Distribution, Random Number Generation.
UNIT - II
Public key Cryptography Principles, RSA algorithm, Key Management, Diffie-Hellman Key Exchange,
Elliptic Curve Cryptography.
Message authentication and Hash Functions, Authentication Requirements and Functions, Message
Authentication, Hash Functions and MACs Hash and MAC Algorithms SHA-512, HMAC.
UNIT - III
Digital Signatures, Authentication Protocols, Digital signature Standard, Authentication Applications,
Kerberos, X.509 Directory Authentication Service.
Email Security: Pretty Good Privacy (PGP) and S/MIME.
UNIT - IV
IP Security:
Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload,
Combining Security Associations and Key Management.
Web Security: Web Security Requirements, Secure Socket Layer (SSL) and Transport Layer Security
(TLS), Secure Electronic Transaction (SET).
UNIT - V
Intruders, Viruses and Worms Intruders, Viruses and related threats Firewalls: Firewall Design
Principles, Trusted Systems, Intrusion Detection Systems.
Text Book:
Page 7 of 55
R19 M.TECH. CSE/CS
1. Cryptography and Network Security (principles and approaches) by William Stallings Pearson
Education, 4th Edition.
Reference Books:
1. Network Security Essentials (Applications and Standards) by William Stallings Pearson
Education.
2. Principles of Information Security, Whitman, Thomson.
Page 8 of 55
R19 M.TECH. CSE/CS

MOBILE APPLICATION DEVELOPMENT (Professional Elective - I)
Prerequisites
1. Acquaintance with JAVA programming
2. A Course on DBMS
Course Objectives:
1. To demonstrate their understanding of the fundamentals of Android operating systems
2. To improves their skills of using Android software development tools
3. To demonstrate their ability to develop software with reasonable complexity on mobile
platform
4. To demonstrate their ability to deploy software to mobile devices
5. To demonstrate their ability to debug programs running on mobile devices
Course Outcomes:
1. Student understands the working of Android OS Practically.
2. Student will be able to develop Android user interfaces
3. Student will be able to develop, deploy and maintain the Android Applications.
UNIT - I
Introduction to Android Operating System: Android OS design and Features – Android development
framework, SDK features, Installing and running applications on Android Studio, Creating AVDs,
Types of Android applications, Best practices in Android programming, Android tools
Android application components – Android Manifest file, Externalizing resources like values, themes,
layouts, Menus etc, Resources for different devices and languages, Runtime Configuration Changes
Android Application Lifecycle – Activities, Activity lifecycle, activity states, monitoring state changes
UNIT - II
Android User Interface: Measurements – Device and pixel density independent measuring UNIT - s
Layouts – Linear, Relative, Grid and Table Layouts
User Interface (UI) Components – Editable and non editable TextViews, Buttons, Radio and Toggle
Buttons, Checkboxes, Spinners, Dialog and pickers
Event Handling – Handling clicks or changes of various UI components
Fragments – Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments to
Activity, adding, removing and replacing fragments with fragment transactions, interfacing between
fragments and Activities, Multi-screen Activities
UNIT - III
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new Activity,
Implicit Intents, Passing data to Intents, Getting results from Activities, Native Actions, using Intent to
dial a number or to send SMS
Broadcast Receivers – Using Intent filters to service implicit Intents, Resolving Intent filters, finding
and using Intents received within an Activity
Notifications – Creating and Displaying notifications, Displaying Toasts
UNIT - IV
Page 9 of 55
R19 M.TECH. CSE/CS
Persistent Storage: Files – Using application specific folders and files, creating files, reading data from
files, listing contents of a directory Shared Preferences – Creating shared preferences, saving and
retrieving data using Shared Preference
UNIT - V
Database – Introduction to SQLite database, creating and opening a database, creating tables,
inserting retrieving and etindelg data, Registering Content Providers, Using content Providers (insert,
delete, retrieve and update)
Text Books:
1. Professional Android 4 Application Dnetwork evelopment, Reto Meier, Wiley India, (Wrox) ,
2012
2. Android Application Development for Java Programmers, James C Sheusi, Cengage
Learning, 2013
Reference:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
Page 10 of 55
R19 M.TECH. CSE/CS

MACHINE LEARNING (Professional Elective - I)
Course Objectives:
 To learn the concept of how to learn patterns and concepts from data without being explicitly
programmed in various IOT nodes.
 To design and analyse various machine learning algorithms and techniques with a modern
outlook focusing on recent advances.
 Explore supervised and unsupervised learning paradigms of machine learning.
 To explore Deep learning technique and various feature extraction strategies.

 Extract features that can be used for a particular machine learning approach in various IOT
applications.
 To compare and contrast pros and cons of various machine learning techniques and to get an
insight of when to apply a particular machine learning approach.
 To mathematically analyse various machine learning approaches and paradigms.
UNIT - I
Supervised Learning (Regression/Classification)
Basic methods: Distance-based methods, Nearest-Neighbours, Decision Trees, Naive Bayes.
Linear models: Linear Regression, Logistic Regression, Generalized Linear Models.
Support Vector Machines, Nonlinearity and Kernel Methods.
Beyond Binary Classification: Multi-class/Structured Outputs, Ranking.
UNIT – II
Unsupervised Learning:
Clustering: K-means/Kernel K-means.
Dimensionality Reduction: PCA and kernel PCA.
Matrix Factorization and Matrix Completion.
Generative Models (mixture models and latent factor models).
UNIT - III
Evaluating Machine Learning algorithms and Model Selection, Introduction to Statistical Learning
Theory, Ensemble Methods (Boosting, Bagging, Random Forests)
UNIT - IV
Sparse Modeling and Estimation, Modeling Sequence/Time-Series Data, Deep Learning and Feature
Representation Learning
UNIT - V
Scalable Machine Learning (Online and Distributed Learning) A selection from some other advanced
topics, e.g., Semi-supervised Learning, Active Learning, Reinforcement Learning, Inference in
Graphical Models, Introduction to Bayesian Learning and Inference.
Recent trends in various learning techniques of machine learning and classification methods for IOT
applications. Various models for IOT applications.
References:
1. Kevin Murphy, Machine Learning: A Probabilistic Perspective, MIT Press, 2012
Page 11 of 55
R19 M.TECH. CSE/CS
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman, The Elements of Statistical Learning,
Springer 2009 (freely available online)
3. Christopher Bishop, Pattern Recognition and Machine Learning, Springer, 2007
Page 12 of 55
R19 M.TECH. CSE/CS

NETWORK SECURITY (Professional Elective - II)
Pre-Requisites: Computer Networks, Web Programming
Course Objectives:
 To learn the basics of security and various types of security issues.
 To study different cryptography techniques available and various security attacks.
 Explore network security and how they are implemented in real world.
 To get an insight of various issues of Web security and biometric authentication.

 To understand basics of security and issues related to it.
 Understanding of biometric techniques available and how they are used in today’s world.
 Security issues in web and how to tackle them.
 Learn mechanisms for transport and network security.
UNIT – I
Data security: Review of cryptography. Examples RSA, DES, ECC.
UNIT – II
Authentication, non-repudiation and message integrity. Digital signatures and
certificates. Protocols using cryptography (example Kerberos). Attacks on
protocols
UNIT - III
Network security: Firewalls, Proxy-Servers, Network intrusion detection.
Transport security: Mechanisms of TLS, SSL, IPSec.
UNIT - IV
Web security – SQL injection, XSS, etc. Software security and buffer overflow.
Malware types and case studies. Access Control, firewalls and host/network intrusion detection.
UNIT - V
Other topics: Biometric authentication, Secure E-Commerce (ex. SET), Smart
Cards, Security in Wireless Communication. Recent trends in IOT security, IDS and Biometric.
References:
1. W. R. Cheswick and S. M. Bellovin. Firewalls and Internet Security. Addison Wesley, 1994.
2. W. Stallings. Cryptography and Network Security. Prentice Hall, 1999.
3. B. Schneier. Applied Cryptography. Wiley, 1999.
Page 13 of 55
R19 M.TECH. CSE/CS

CLOUD COMPUTING (Professional Elective - II)
Pre-Requisites: Computer Networks, Web Programming
Course Objectives:
 The student will also learn how to apply trust-based security model to real-world security
problems.
 An overview of the concepts, processes, and best practices needed to successfully secure
information within Cloud infrastructures.
 Students will learn the basic Cloud types and delivery models and develop an understanding
of the risk and compliance responsibilities and Challenges for each Cloud type and service
delivery model.

 Identify security aspects of each cloud model
 Develop a risk-management strategy for moving to the Cloud
 Implement a public cloud instance using a public cloud service provider
 Apply trust-based security model to different layer
UNIT – I
Introduction to Cloud Computing:
Online Social Networks and Applications, Cloud introduction and overview, Different clouds, Risks,
Novel applications of cloud computing
UNIT – II
Cloud Computing Architecture:
Requirements, Introduction Cloud computing architecture, On Demand Computing Virtualization at
the infrastructure level, Security in Cloud computing environments, CPU Virtualization, A discussion
on Hypervisors Storage Virtualization Cloud Computing Defined, The SPI Framework for Cloud
Computing, The Traditional Software Model, The Cloud Services Delivery Model
Cloud Deployment Models:
Key Drivers to Adopting the Cloud, The Impact of Cloud Computing on Users, Governance in the
Cloud, Barriers to Cloud Computing Adoption in the Enterprise
UNIT - III
Security Issues in Cloud Computing:
Infrastructure Security, Infrastructure Security: The Network Level, The Host Level, The Application
Level, Data Security and Storage, Aspects of Data Security, Data Security Mitigation Provider Data
and Its Security
Identity and Access Management:
Trust Boundaries and IAM, IAM Challenges, Relevant IAM Standards and Protocols for Cloud
Services, IAM Practices in the Cloud, Cloud Authorization Management
UNIT - IV
Security Management in the Cloud
Security Management Standards, Security Management in the Cloud, Availability Management:
SaaS, PaaS, IaaS
Privacy Issues
Page 14 of 55
R19 M.TECH. CSE/CS
Privacy Issues, Data Life Cycle, Key Privacy Concerns in the Cloud, Protecting Privacy, Changes to
Privacy Risk Management and Compliance in Relation to Cloud
Computing, Legal and Regulatory Implications, U.S. Laws and Regulations, International Laws and
Regulations
UNIT - V
Audit and Compliance
Internal Policy Compliance, Governance, Risk, and Compliance (GRC), Regulatory/External
Compliance, Cloud Security Alliance, Auditing the Cloud for
Compliance, Security-as-a-Cloud
Advanced Topics
Recent developments in hybrid cloud and cloud security.
References:
1. Cloud Computing Explained: Implementation Handbook for Enterprises, John Rhoton,
Publication Date: November 2, 2009.
2. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance (Theory in
Practice), Tim Mather, ISBN-10: 0596802765, O'Reilly Media, September 2009.
Page 15 of 55
R19 M.TECH. CSE/CS

DATA MINING (Professional Elective - II)
Course Objectives:
 To understand data mining concepts.
 To learn about various data preprocessing techniques.
 To learn about data warehousing.
 To learn about various data mining functionalities such as association rule mining, clustering,
classification and outlier analysis.
UNIT - I
Introduction: Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining
systems, Data Mining Task Primitives, Integration of a Data Mining System with a Database or a Data
Warehouse System, Issues in Data Mining.
Data Preprocessing: Need for Preprocessing the Data, Data Cleaning, Data Integration and
Transformation, Data Reduction, Discretization and Concept Hierarchy Generation.
UNIT - II
Data Warehouse and OLAP Technology for Data Mining: Data Warehouse, Multidimensional Data
Model, Data Warehouse Architecture, Data Warehouse Implementation, Usage of Data Warehousing
Online Analytical Processing and Mining
Data Cube Computation: Efficient Methods for simple Data Cube Computation (Full Cube, Iceberg
Cube, Closed Cube and Shell Cube), Discovery Driven exploration of data cubes, Attribute-Oriented
Induction for data characterization and its implementation
UNIT - III
Mining Frequent Patterns, Associations and Correlations: Basic Concepts, The Apriori algorithm
for finding frequent itemsets using candidate generation, Generating association rules from frequent
itemsets, Mining frequent itemsets without candidate generation, Mining various kinds of Association
Rules, Correlation Analysis
UNIT - IV
Classification and Prediction: Description and comparison of classification and prediction,
preparing data for Classification and Prediction
Classification by Decision Tree Induction, Bayesian Classification, Rule-Based Classification,
Classification by Backpropagation
Prediction, linear and non-linear regression, evaluating accuracy of a Classifier or a Predictor
UNIT - V
Cluster Analysis: Types of Data in Cluster Analysis, A Categorization of Major Clustering Methods,
k-means and k-mediods methods, CLARANS, Agglomerative and divisive hierarchical clustering,
chameleon dynamic modeling, DBSCAN, Grid based clustering method: STING, Conceptual
Clustering, Constraint-Based Cluster Analysis, Outlier Analysis.
Text Books:
1. Data Mining – Concepts and Techniques - Jiawei Han, Micheline Kamber and Jian Pei, 3rd
edition, Morgan Kaufmann Publishers, ELSEVIER.
2. Introduction to Data Mining – Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Pearson
education.
Page 16 of 55
R19 M.TECH. CSE/CS
References:
1. Data Warehousing in the Real World – Sam Aanhory & Dennis Murray Pearson Edn Asia.
2. Insight into Data Mining, K. P. Soman, S. Diwakar, V. Ajay, PHI, 2008.
3. Data Warehousing Fundamentals – Paulraj Ponnaiah Wiley student Edition
4. The Data Warehouse Life cycle Tool kit – Ralph Kimball Wiley student edition
5. Building the Data Warehouse By William H Inmon, John Wiley & Sons Inc, 2005.
6. Data Mining Introductory and advanced topics –Margaret H Dunham, Pearson education
7. Data Mining Techniques – Arun K Pujari, 2nd edition, Universities Press.
8. Data Mining, V. Pudi and P. Radha Krishna, Oxford University Press.
9. Data Mining: Methods and Techniques, A.B. M Shawkat Ali and S. A. Wasimi, Cengage
Learning.
10. Data Warehouse 2.0, The Architecture for the next generation of Data Warehousing, W.H.
Inmon, D. Strauss, G. Neushloss, Elsevier, Distributed by SPD.
Page 17 of 55
R19 M.TECH. CSE/CS

ADVANCED DATA STRUCTURES LAB (Lab - I)
Prerequisites: A course on Computer Programming & Data Structures
Course Objectives:
1. Introduces the basic concepts of Abstract Data Types.
2. Reviews basic data structures such as stacks and queues.
3. Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs,
and B-trees.
4. Introduces sorting and pattern matching algorithms.
Course Outcomes:
1. Ability to select the data structures that efficiently model the information in a problem.
2. Ability to assess efficiency trade-offs among different data structure implementations or
combinations.
3. Implement and know the application of algorithms for sorting and pattern matching.
4. Design programs using a variety of data structures, including hash tables, binary and general
tree structures, search trees, tries, heaps, graphs, and B-trees.
List of Programs
1. Write a program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from a binary search tree.
c) Search for a key element in a binary search tree.
2. Write a program for implementing the following sorting methods:

a) Merge sort b) Heap sort c) Quick sort

a) Insert an element into a B- tree.
b) Delete an element from a B- tree.
c) Search for a key element in a B- tree.

a) Insert an element into a Min-Max heap
b) Delete an element from a Min-Max heap
c) Search for a key element in a Min-Max heap

a) Insert an element into a Lefiist tree
b) Delete an element from a Leftist tree
c) Search for a key element in a Leftist tree

a) Insert an element into a binomial heap
b) Delete an element from a binomial heap.
c) Search for a key element in a binomial heap
Page 18 of 55
R19 M.TECH. CSE/CS

a) Insert an element into a AVL tree.
b) Delete an element from a AVL search tree.
c) Search for a key element in a AVL search tree.

a) Insert an element into a Red-Black tree.
b) Delete an element from a Red-Black tree.
c) Search for a key element in a Red-Black tree.
9. Write a program to implement all the functions of a dictionary using hashing.
10. Write a program for implementing Knuth-Morris-Pratt pattern matching algorithm.
11. Write a program for implementing Brute Force pattern matching algorithm.
12. Write a program for implementing Boyer pattern matching algorithm.
TEXT BOOKS:
1. Fundamentals of Data structures in C, E.Horowitz, S.Sahni and Susan Anderson Freed, 2nd
Edition, Universities Press
2. Data Structures Using C – A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson
education.
3. Introduction to Data Structures in C, Ashok Kamthane, 1st Edition, Pearson.
REFERENCES:
1. The C Programming Language, B.W. Kernighan, Dennis M.Ritchie, PHI/Pearson Education
2. C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press
3. Data structures: A Pseudocode Approach with C, R.F.Gilberg And B.A.Forouzan, 2nd
Edition, Cengage Learning.
Page 19 of 55
R19 M.TECH. CSE/CS

MACHINE LEARNING LAB (Lab – II)
Course Objective:
1. The objective of this lab is to get an overview of the various machine learning techniques and
can able to demonstrate them using python.
Course Outcomes: After the completion of the “Machine Learning” lab, the student can able to:
1. Understand complexity of Machine Learning algorithms and their limitations;
2. Understand modern notions in data analysis-oriented computing;
3. Be capable of confidently applying common Machine Learning algorithms in practice and
implementing their own;
4. Be capable of performing experiments in Machine Learning using real-world data.
List of Experiments
1. The probability that it is Friday and that a student is absent is 3 %. Since there are 5 school
days in a week, the probability that it is Friday is 20 %. What is theprobability that a student is
absent given that today is Friday? Apply Baye’s rule in python to get the result. (Ans: 15%)
2. Extract the data from database using python
3. Implement k-nearest neighbours classification using python
4. Given the following data, which specify classifications for nine combinations of VAR1 and
VAR2 predict a classification for a case where VAR1=0.906 and VAR2=0.606, using the
result of k-means clustering with 3 means (i.e., 3 centroids)
VAR1 VAR2 CLASS
1.713 1.586 0
0.180 1.786 1
0.353 1.240 1
0.940 1.566 0
1.486 0.759 1
1.266 1.106 0
1.540 0.419 1
0.459 1.799 1
0.773 0.186 1
5. The following training examples map descriptions of individuals onto high, medium and low
credit-worthiness.
medium skiing design single twenties no -> highRisk
high golf trading married forties yes -> lowRisk
low speedway transport married thirties yes -> medRisk
medium football banking single thirties yes -> lowRisk
high flying media married fifties yes -> highRisk
low football security single twenties no -> medRisk
medium golf media single thirties yes -> medRisk
medium golf transport married forties yes -> lowRisk
high skiing banking single thirties yes -> highRisk
low golf unemployed married forties yes -> highRisk
Input attributes are (from left to right) income, recreation, job, status, age-group, home-owner. Find
the unconditional probability of `golf' and the conditional probability of `single' given `medRisk' in the
dataset?
Page 20 of 55
R19 M.TECH. CSE/CS
6. Implement linear regression using python.

7. Implement Naïve Bayes theorem to classify the English text
8. Implement an algorithm to demonstrate the significance of genetic algorithm
9. Implement the finite words classification system using Back-propagation algorithm
Text Books:
1. Machine Learning – Tom M. Mitchell, MGH
2. Fundamentals of Speech Recognition By Lawrence Rabiner and Biing – Hwang Juang.
Reference Book:
1. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis
Page 21 of 55
R19 M.TECH. CSE/CS

RESEARCH METHODOLOGY & IPR
Prerequisite: None
Course Objectives:
 To understand the research problem
 To know the literature studies, plagiarism and ethics
 To get the knowledge about technical writing
 To analyze the nature of intellectual property rights and new developments
 To know the patent rights
Course Outcomes: At the end of this course, students will be able to

 Understand research problem formulation.
 Analyze research related information
 Follow research ethics
 Understand that today’s world is controlled by Computer, Information Technology, but
tomorrow world will be ruled by ideas, concept, and creativity.
 Understanding that when IPR would take such important place in growth of individuals &
nation, it is needless to emphasis the need of information about Intellectual Property Right
to be promoted among students in general & engineering in particular.
 Understand that IPR protection provides an incentive to inventors for further research work
and investment in R & D, which leads to creation of new and better products, and in turn
brings about, economic growth and social benefits.
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.
Page 22 of 55
R19 M.TECH. CSE/CS
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”
REFERENCES:
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.
7. T. Ramappa, “Intellectual Property Rights Under WTO”, S. Chand, 2008
Page 23 of 55
R19 M.TECH. CSE/CS

M. Tech - CSE/CS – I Year – II Semester
ADVANCED ALGORITHMS (Professional Core – III)
Pre-Requisites: UG level course in Algorithm Design and Analysis

Course Objectives:
 Introduce students to the advanced methods of designing and analyzing algorithms.
 The student should be able to choose appropriate algorithms and use it for a specific
problem.
 To familiarize students with basic paradigms and data structures used to solve advanced
algorithmic problems.
 Students should be able to understand different classes of problems concerning their
computation difficulties.
 To introduce the students to recent developments in the area of algorithmic design.

 Analyze the complexity/performance of different algorithms.
 Determine the appropriate data structure for solving a particular set of problems.
 Categorize the different problems in various classes according to their complexity.
 Students should have an insight of recent activities in the field of the advanced data structure.
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
(Dijkasra'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.
Page 24 of 55
R19 M.TECH. CSE/CS
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.
One or more of the following topics based on time and interest:
Approximation algorithms, Randomized Algorithms, Interior Point Method, Advanced Number
Theoretic Algorithm
Recent Trends in problem solving paradigms using recent searching and sorting techniques by
applying recently proposed data structures.
References:
1. "Introduction to Algorithms" by Cormen, Leiserson, Rivest, Stein.
2. "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, Ullman.
3. "Algorithm Design" by Kleinberg and Tardos.
Page 25 of 55
R19 M.TECH. CSE/CS

ADVANCED COMPUTER ARCHITECTURE (Professional Core - IV)
Prerequisites: Computer Organization

Course Objectives:
1. To impart the concepts and principles of parallel and advanced computer architectures.
2. To develop the design techniques of Scalable and multithreaded Architectures.
3. To Apply the concepts and techniques of parallel and advanced computer architectures to
design modern computer systems
Course Outcomes: Gain knowledge of

1. Computational models and Computer Architectures.
2. Concepts of parallel computer models.
3. Scalable Architectures, Pipelining, Superscalar processors, multiprocessors
UNIT - I
Theory of Parallelism, Parallel computer models, The State of Computing, Multiprocessors and
Multicomputers, Multivector and SIMD Computers, PRAM and VLSI models, Architectural
development tracks, Program and network properties, Conditions of parallelism, Program partitioning
and Scheduling, Program flow Mechanisms, System interconnect Architectures.
UNIT - II
Principals of Scalable performance, Performance metrics and measures, Parallel Processing
applications, Speed up performance laws, Scalability Analysis and Approaches, Hardware
Technologies, Processes and Memory Hierarchy, Advanced Processor Technology, Superscalar and
Vector Processors, Memory Hierarchy Technology, Virtual Memory Technology.
UNIT - III
Bus Cache and Shared memory, Backplane bus systems, Cache Memory organizations, Shared-
Memory Organizations, Sequential and weak consistency models, Pipelining and superscalar
techniques, Linear Pipeline Processors, Non-Linear Pipeline Processors, Instruction Pipeline design,
Arithmetic pipeline design, superscalar pipeline design.
UNIT - IV
Parallel and Scalable Architectures, Multiprocessors and Multicomputers, Multiprocessor system
interconnects, cache coherence and synchronization mechanism, Three Generations of
Multicomputers, Message-passing Mechanisms, Multivetor and SIMD computers, Vector Processing
Principals, Multivector Multiprocessors, Compound Vector processing, SIMD computer Organizations,
The connection machine CM-5,
UNIT - V
Scalable, Multithreaded and Dataflow Architectures, Latency-hiding techniques, Principals of
Multithreading, Fine-Grain Multicomputers, Scalable and multithreaded Architectures, Dataflow and
hybrid Architectures.
Text Book
1. Advanced Computer Architecture, Kai Hwang, 2nd Edition, Tata McGraw Hill Publishers.
Page 26 of 55
R19 M.TECH. CSE/CS
References:
1. Computer Architecture, J.L. Hennessy and D.A. Patterson, 4th Edition, ELSEVIER.
2. Advanced Computer Architectures, S.G.Shiva, Special Indian edition, CRC, Taylor &Francis.
3. Introduction to High Performance Computing for Scientists and Engineers, G. Hager and G.
Wellein, CRC Press, Taylor & Francis Group.
4. Advanced Computer Architecture, D. Sima, T. Fountain, P. Kacsuk, Pearson education.
5. Computer Architecture, B. Parhami, Oxford Univ. Press.
Page 27 of 55
R19 M.TECH. CSE/CS

WEB AND DATABASE SECURITY (Professional Elective - III)
Pre-Requisites: Database Management

Course Objectives:
1. Give an Overview of information security
2. Give an overview of Access control of relational databases
Course Outcomes: Students should be able to

1. Understand the Web architecture and applications
2. Understand client side and service side programming
3. Understand how common mistakes can be bypassed and exploit the application
4. Identify common application vulnerabilities
UNIT - I
The Web Security
The Web Security Problem, Risk Analysis and Best Practices
Cryptography and the Web: Cryptography and Web Security, Working Cryptographic Systems and
Protocols, Legal Restrictions on Cryptography, Digital Identification
UNIT - II
The Web Privacy
The Web’s War on Your Privacy, Privacy-Protecting Techniques, Backups and Antitheft, Web Server
Security, Physical Security for Servers, Host Security for Servers, Securing Web Applications
UNIT - III
Database Security
Recent Advances in Access Control, Access Control Models for XML, Database Issues in Trust
Management and Trust Negotiation, Security in Data Warehouses and OLAP Systems
UNIT - IV
Security Re-engineering for Databases
Concepts and Techniques, Database Watermarking for Copyright Protection, Trustworthy Records
Retention, Damage Quarantine and Recovery in Data Processing Systems, Hippocratic Databases:
Current Capabilities and
UNIT - V
Future Trends Privacy in Database Publishing
A Bayesian Perspective, Privacy-enhanced Location-based Access Control, Efficiently Enforcing the
Security and Privacy Policies in a Mobile Environment
Text Books:
1. Web Security, Privacy and Commerce, Simson G. Arfinkel, Gene Spafford, O’ Reilly.
2. Handbook on Database security applications and trends, Michael Gertz, Sushil Jajodia.
Page 28 of 55
R19 M.TECH. CSE/CS

INTERNET OF THINGS (Professional Elective - III)
Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of M2M (machine to machine) with necessary protocols
 To introduce the Python Scripting Language which is used in many IoT devices
 To introduce the Raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of web-based services on IoT devices
UNIT - I
Introduction to Internet of Things –Definition and Characteristics of IoT,
Physical Design of IoT – IoT Protocols, IoT communication models, Iot Communication APIs
IoT enabaled Technologies – Wireless Sensor Networks, Cloud Computing, Big data analytics,
Communication protocols, Embedded Systems, IoT Levels and Templates
Domain Specific IoTs – Home, City, Environment, Energy, Retail, Logistics, Agriculture, Industry,
health and Lifestyle
UNIT - II
IoT and M2M – Software defined networks, network function virtualization, difference between SDN
and NFV for IoT
Basics of IoT System Management with NETCOZF, YANG- NETCONF, YANG, SNMP NETOPEER
UNIT - III
Introduction to Python - Language features of Python, Data types, data structures, Control of flow,
functions, modules, packaging, file handling, data/time operations, classes, Exception handling
Python packages - JSON, XML, HTTPLib, URLLib, SMTPLib
UNIT - IV
IoT Physical Devices and Endpoints - Introduction to Raspberry PI-Interfaces (serial, SPI, I2C)
Programming – Python program with Raspberry PI with focus of interfacing external gadgets,
controlling output, reading input from pins.
UNIT - V
IoT Physical Servers and Cloud Offerings – Introduction to Cloud Storage models and communication
APIs
Webserver – Web server for IoT, Cloud for IoT, Python web application framework
Designing a RESTful web API
Text Books:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities
Press, 2015, ISBN: 9788173719547
2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly (SPD), 2014,
ISBN: 9789350239759
Page 29 of 55
R19 M.TECH. CSE/CS

DATA SCIENCE (Professional Elective - III)
Course Objectives:
 Provide you with the knowledge and expertise to become a proficient data scientist.
 Demonstrate an understanding of statistics and machine learning concepts that are vital for
data science;
 Produce Python code to statistically analyse a dataset;
 Critically evaluate data visualizations based on their design and use for communicating
stories from data;

 Explain how data is collected, managed and stored for data science;
 Understand the key concepts in data science, including their real-world applications and the
toolkit used by data scientists
 Implement data collection and management scripts using MongoDB
UNIT – I
Introduction to core concepts and technologies: Introduction, Terminology, data science process, data
science toolkit, Types of data, Example applications.
UNIT – II
Data collection and management: Introduction, Sources of data, Data collection and APIs, Exploring
and fixing data, Data storage and management, Using multiple data
Sources
UNIT-III
Data analysis: Introduction, Terminology and concepts, Introduction to statistics, Central tendencies
and distributions, Variance, Distribution properties and arithmetic, Samples/CLT, Basic machine
learning algorithms, Linear regression, SVM, Naive Bayes.
UNIT-IV
Data visualization: Introduction, Types of data visualization, Data for visualization: Data types, Data
encodings, Retinal variables, Mapping variables to encodings, Visual encodings.
UNIT-V
Applications of Data Science, Technologies for visualization, Bokeh (Python).
Recent trends in various data collection and analysis techniques, various visualization techniques,
application development methods of used in data science.
References:
1. Cathy O’Neil and Rachel Schutt. Doing Data Science, Straight Talk from The Frontline.
O’Reilly.
2. Jure Leskovek, Anand Rajaraman and Jeffrey Ullman. Mining of Massive Datasets. v2.1,
Cambridge University Press.
Page 30 of 55
R19 M.TECH. CSE/CS

CYBER SECURITY (Professional Elective - IV)
Course Objectives:
 To learn about cyber crimes and how they are planned.
 To learn the vulnerabilities of mobile and wireless devices.
 To learn about the crimes in mobile and wireless devices.
UNIT - I
Introduction to Cybercrime: Introduction, Cybercrime and Information security, who are
cybercriminals, Classifications of Cybercrimes, Cybercrime: The legal Perspectives and Indian
Perspective, Cybercrime and the Indian ITA 2000, A Global Perspective on Cybercrimes.
Cyber offenses: How criminals Plan Them: Introduction, How Criminals plan the Attacks, Social
Engineering, Cyber stalking, Cyber cafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack
Vector, Cloud Computing.
UNIT- II
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile and Wireless
Devices, Trends in Mobility, Credit card Frauds in Mobile and Wireless Computing Era, Security
Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices, Authentication service
Security, Attacks on Mobile/Cell Phones, Mobile Devices: Security Implications for Organizations,
Organizational Measures for Handling Mobile, Organizational Security Policies an Measures in Mobile
Computing Era, Laptops.
UNIT - III
Cybercrimes and Cyber security: the Legal Perspectives
Introduction, Cyber Crime and Legal Landscape around the world, Why Do We Need Cyber laws: The
Indian Context, The Indian IT Act, Challenges to Indian Law and Cybercrime Scenario In India, Digital
signatures and the Indian IT Act, Amendments to the Indian IT Act, Cybercrime and Punishment,
Cyber law, Technology and Students: Indian Scenario.
UNIT - IV
Understanding Computer Forensics
Introduction, Historical background of Cyber forensics, Digital Forensics Science, The Need for
Computer Forensics, Cyber Forensics and Digital evidence, Forensics Analysis of Email, Digital
Forensics Lifecycle, Chain of Custody concept, Network Forensics, Approaching a computer,
Forensics Investigation, Challenges in Computer Forensics, Special Tools and Techniques, Forensics
Auditing
UNIT - V
Cyber Security: Organizational Implications
Introduction, Cost of Cybercrimes and IPR issues, Web threats for Organizations, Security and
Privacy Implications, Social media marketing: Security Risks and Perils for Organizations, Social
Computing and the associated challenges for Organizations.
Text Books:
1. Cyber Security: Understanding Cyber Crimes, Computer Forensics and Legal Perspectives,
Nina Godbole and Sunil Belapure, Wiley INDIA.
Page 31 of 55
R19 M.TECH. CSE/CS
2. Introduction to Cyber Security, Chwan-Hwa(john) Wu, J. David Irwin. CRC Press T & F
Group.
Reference Book:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC
Page 32 of 55
R19 M.TECH. CSE/CS

ADVANCED COMPUTER NETWORKS (Professional Elective - IV)
Prerequisites: Data Communication, Basic Networking Principles

Course Objective:
 This course aims to provide advanced background on relevant computer networking topics to
have a comprehensive and deep knowledge in computer networks.
Course Outcomes:
 Understanding of holistic approach to computer networking
 Ability to understand the computer networks and their application
 Ability to design simulation concepts related to packet forwarding in networks.
UNIT - I
Review of Computer Networks, Devices and the Internet: Internet, Network edge, Network core,
Access Networks and Physical media, ISPs and Internet Backbones, Delay and Loss in Packet-
Switched Networks, Networking and Internet - Foundation of Networking Protocols: 5-layer TCP/IP
Model, 7-Layer OSI Model, Internet Protocols and Addressing.
Multiplexers, Modems and Internet Access Devices, Switching and Routing Devices, Router
Structure. The Link Layer and Local Area Networks-Link Layer, Introduction and Services, Error-
Detection and Error-Correction techniques, Multiple Access Protocols, Link Layer
Addressing, Ethernet, Interconnections: Hubs and Switches, PPP: The Point-to-Point Protocol, Link
Virtualization
UNIT - II
Data-link protocols: Ethernet, Token Ring and Wireless (802.11). Wireless Networks and Mobile IP:
Infrastructure of Wireless Networks, Wireless LAN Technologies, IEEE 802.11 Wireless Standard,
Cellular Networks, Mobile IP, Wireless Mesh Networks (WMNs), Multiple access schemes Routing
and Internetworking: Network–Layer Routing, Least-Cost-Path algorithms, Non-Least-Cost-Path
algorithms, Intra-domain Routing Protocols, Inter-domain Routing Protocols, Congestion Control at
Network Layer.
UNIT - IV
Transport and Application Layer Protocols: Client-Server and Peer-To-Peer Application
Communication, Protocols on the transport layer, reliable communication. Routing packets through a
LAN and WAN. Transport Layer, Transmission Control Protocol (TCP), User Datagram Protocol
(UDP), Mobile Transport Protocols, TCP Congestion Control. Principles of Network Applications,
UNIT - V
The Web and HTTP, File Transfer: FTP, Electronic Mail in the Internet, Domain Name System (DNS),
P2P File Sharing, Socket Programming with TCP and UDP, building a Simple Web Server Creating
simulated networks and passing packets through them using different routing techniques. Installing
and using network monitoring tools.
Text books:
1. Computer Networking: A Top-Down Approach, James F. Kuros and Keith W. Ross, Pearson,
6th Edition, 2012.
2. Computer Networks and Internets, Duglas E. Comer, 6th Edition, Pearson.
Page 33 of 55
R19 M.TECH. CSE/CS
References:
1. A Practical Guide to Advanced Networking, Jeffrey S. Beasley and Piyasat Nilkaew, Pearson,
3rd Edition, 2012
2. Computer Networks, Andrew S. Tanenbaum, David J. Wetherall, Prentice Hall.
Page 34 of 55
R19 M.TECH. CSE/CS

BIG DATA ANALYTICS (Professional Elective - IV)
Course Objectives:
 To understand about big data
 To learn the analytics of Big Data
 To Understand the MapReduce fundamentals
UNIT - I
Big Data Analytics: What is big data, History of Data Management; Structuring Big Data; Elements of
Big Data; Big Data Analytics; Distributed and Parallel Computing for Big Data;
Big Data Analytics: What is Big Data Analytics, What Big Data Analytics Isn’t, Why this sudden Hype
Around Big Data Analytics, Classification of Analytics, Greatest Challenges that Prevent Business
from Capitalizing Big Data; Top Challenges Facing Big Data; Why Big Data Analytics Important; Data
Science; Data Scientist; Terminologies used in Big Data Environments; Basically Available Soft State
Eventual Consistency (BASE); Open source Analytics Tools;
UNIT - II
Understanding Analytics and Big Data: Comparing Reporting and Analysis, Types of Analytics; Points
to Consider during Analysis; Developing an Analytic Team; Understanding Text Analytics;
Analytical Approach and Tools to Analyze Data: Analytical Approaches; History of Analytical Tools;
Introducing Popular Analytical Tools; Comparing Various Analytical Tools.
UNIT - III
Understanding MapReduce Fundamentals and HBase : The MapReduce Framework; Techniques to
Optimize MapReduce Jobs; Uses of MapReduce; Role of HBase in Big Data Processing; Storing
Data in Hadoop : Introduction of HDFS, Architecture, HDFC Files, File system types, commands,
org.apache.hadoop.io package, HDF, HDFS High Availability; Introducing HBase, Architecture,
Storing Big Data with HBase , Interacting with the Hadoop Ecosystem; HBase in Operations-
Programming with HBase; Installation, Combining HBase and HDFS;
UNIT - IV
Big Data Technology Landscape and Hadoop: NoSQL, Hadoop; RDBMS versus Hadoop; Distributed
Computing Challenges; History of Hadoop; Hadoop Overview; Use Case of Hadoop; Hadoop
Distributors; HDFC (Hadoop Distributed File System), HDFC Daemons, read, write, Replica
Processing of Data with Hadoop; Managing Resources and Applications with Hadoop YARN.
UNIT - V
Social Media Analytics and Text Mining: Introducing Social Media; Key elements of Social Media;
Text mining; Understanding Text Mining Process; Sentiment Analysis, Performing Social Media
Analytics and Opinion Mining on Tweets;
Mobile Analytics: Introducing Mobile Analytics; Define Mobile Analytics; Mobile Analytics and Web
Analytics; Types of Results from Mobile Analytics; Types of Applications for Mobile Analytics;
Introducing Mobile Analytics Tools;
Page 35 of 55
R19 M.TECH. CSE/CS
Text Books:
1. Big Data and Analytics, Seema Acharya, Subhasinin Chellappan, Wiley publications.
2. Big Data, Black BookTM , DreamTech Press, 2015 Edition.
3. Business Analytics 5e , BY Albright |Winston
Reference Books:
1. Rajiv Sabherwal, Irma Becerra- Fernandez,” Business Intelligence –Practice, Technologies
and Management”, John Wiley 2011.
2. Lariss T. Moss, Shaku Atre, “Business Intelligence Roadmap”, Addison-Wesley It Service.
3. Yuli Vasiliev, “Oracle Business Intelligence: The Condensed Guide to Analysis and
Reporting”, SPD Shroff, 2012.
Page 36 of 55
R19 M.TECH. CSE/CS

ADVANCED ALGORITHMS LAB (Lab - III)
Course Objective: The student can able to attain knowledge in advance algorithms.
Course Outcomes: The student can able to analyze the performance of algorithms
List of Experiments
1. Implement assignment problem using Brute Force method
2. Perform multiplication of long integers using divide and conquer method.
3. Implement solution for knapsack problem using Greedy method.
4. Implement Gaussian elimination method.
5. Implement LU decomposition
6. Implement Warshall algorithm
7. Implement Rabin Karp algorithm.
8. Implement KMP algorithm.
9. Implement Harspool algorithm
10. Implement max-flow problem.
Text Book:
1. Design and Analysis of Algorithms, S.Sridhar, OXFORD University Press
References:
1. Introduction to Algorithms, second edition, T.H. Cormen, C.E. Leiserson, R.L. Rivest and
C.Stein,PHI Pvt. Ltd./ Pearson Education.
2. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam,
Universities Press.
3. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
Page 37 of 55
R19 M.TECH. CSE/CS

DATA SCIENCE LAB (Lab – IV)
Course Objectives:
 To make students understand learn about a Big Data – R Programming, way of solving
problems.
 To teach students to write programs in Scala to solve problems.
Introduction to R Programming:
What is R and RStudio? R is a statistical software program. It has extremely useful tools for data
exploration, data analysis, and data visualization. It is flexible and also allows for advanced
programming. RStudio is a user interface for R, which provides a nice environment for working with R.
1. Write an R program to evaluate the following expression ax+b/ax-b.
2. Write an R program to read input from keyboard (hint: readLine()).
3. Write an R program to find the sum of n natural numbers: 1+2+3+4+….n
4. Write an R program to read n numbers.
(i) Sum of all even numbers (ii) Total number of even numbers.
5. Write an R program to read n numbers.
(i) Total number of odd numbers (ii) Sum of all odd numbers
6. Write an R program to obtain
(i)sum of two matrices A and B (ii) subtraction of two matrices A and B
(iii) Product of two matrices.
7. Write an R program for “declaring and defining functions “
8. Write an R program that uses functions to add n numbers reading from keyboard
9. Write an R program uses functions to swap two integers.
10. Write an R program that use both recursive and non-recursive functions for implementing the
Factorial of a given number, n.
11. Write an R program to reverse the digits of the given number {example 1234 to be written as
4321}
12. Write an R program to implement
(i)Linear search (ii) Binary Search.
13. Write an R program to implement
(i)Bubble sort (ii) selection sort.
14. Write a R program to implement the data structures
(i) Vectors (ii) Array (iii) Matrix (iv) Data Frame (v) Factors
15. Write a R program to implement scan(), merge(), read.csv() and read.table() commands.
16. Write an R program to implement “Executing Scripts” written on the note pad, by
calling to the R console.
17. Write a R program, Reading data from files and working with datasets
(i) Reading data from csv files, inspection of data.
(ii) Reading data from Excel files.
18. Write a R program to implement Graphs
(i) Basic high-level plots (ii)Modifications of scatter plots
(iii) Modifications of histograms, parallel box plots.
Suggested Books for Lab:

1. Big data – Black Book: 2015 edition: dreamtech press. Pg. (490- 642)
2. Introducing to programming and problem solving by scala, mark c. lewis, lisa l.lacher.
Page 38 of 55
R19 M.TECH. CSE/CS
CRC press, second edition.
Suggested Links:
1. https://www.tutorialspoint.com/scala/
2. https://www.tutorialspoint.com/r/
Page 39 of 55
R19 M.TECH. CSE/CS

M. Tech - CSE/CS – II Year – I Semester
DIGITAL FORENSICS (Professional Elective - V)
Pre-Requisites: Cybercrime and Information Warfare, Computer Networks
Course Objectives:
 Provides an in-depth study of the rapidly changing and fascinating field of computer forensics.
 Combines both the technical expertise and the knowledge required to investigate, detect and
prevent digital crimes.
 Knowledge on digital forensics legislations, digital crime, forensics processes and procedures,
data acquisition and validation, e-discovery tools
 E-evidence collection and preservation, investigating operating systems and file systems,
network forensics, art of steganography and mobile device forensics
Course Outcomes: On completion of the course the student should be able to

 Understand relevant legislation and codes of ethics.
 Computer forensics and digital detective and various processes, policies and procedures.
 E-discovery, guidelines and standards, E-evidence, tools and environment.
 Email and web forensics and network forensics.
UNIT - I
Digital Forensics Science: Forensics science, computer forensics, and digital forensics.
Computer Crime: Criminalistics as it relates to the investigative process, analysis of cyber-
criminalistics area, holistic approach to cyber-forensics
UNIT - II
Cyber Crime Scene Analysis:
Discuss the various court orders etc., methods to search and seizure electronic evidence, retrieved
and un-retrieved communications, Discuss the importance of understanding what court documents
would be required for a criminal investigation.
UNIT - III
Evidence Management & Presentation:
Create and manage shared folders using operating system, importance of the forensic mindset, define
the workload of law enforcement, Explain what the normal case would look like, Define who should be
notified of a crime, parts of gathering evidence, Define and apply probable cause.
UNIT - IV
Computer Forensics: Prepare a case, Begin an investigation, Understand computer forensics
workstations and software, Conduct an investigation, Complete a case, Critique a case,
Network Forensics: open-source security tools for network forensic analysis, requirements for
preservation of network data.
UNIT - V
Mobile Forensics: mobile forensics techniques, mobile forensics tools.
Legal Aspects of Digital Forensics: IT Act 2000, amendment of IT Act 2008.
Recent trends in mobile forensic technique and methods to search and seizure electronic evidence
Page 40 of 55
R19 M.TECH. CSE/CS
References:
1. John Sammons, The Basics of Digital Forensics, Elsevier
2. John Vacca, Computer Forensics: Computer Crime Scene Investigation, Laxmi Publications
Page 41 of 55
R19 M.TECH. CSE/CS

HIGH PERFORMANCE COMPUTING (Professional Elective - V)
Prerequisites: Computer Organization & Architecture, Operating System Programming

Course Objectives:
 To Improve the system performance
 To learn various distributed and parallel computing architecture
 To learn different computing technologies
Course Outcomes:
 Understanding the concepts in grid computing
 Ability to set up cluster and run parallel applications
 Ability to understand the cluster projects and cluster OS
 Understanding the concepts of pervasive computing & quantum computing.
UNIT - I
Grid Computing: Data & Computational Grids, Grid Architectures And Its Relations To Various
Distributed Technologies. Autonomic Computing, Examples Of The Grid Computing Efforts (Ibm).
UNIT - II
Cluster Setup & Its Advantages, Performance Models & Simulations; Networking Protocols & I/O,
Messaging Systems. Process Scheduling, Load Sharing And Balancing; Distributed Shared Memory,
Parallel I/O.
UNIT - III:
Example Cluster System – Beowulf; Cluster Operating Systems: Compas And Nanos Pervasive
Computing Concepts & Scenarios; Hardware & Software; Human – Machine Interface.
UNIT - IV
Device Connectivity; Java For Pervasive Devices; Application Examples.
UNIT - V
Classical Vs Quantum Logic Gates; One, Two & Three Qubit Quantum Gates; Fredkin & Toffoli
Gates; Quantum Circuits; Quantum Algorithms.
Text Book:
1. “Selected Topics In Advanced Computing” Edited By Dr. P. Padmanabham And Dr. M.B.
Srinivas, 2005 Pearson Education.
References:
1. J. Joseph & C. Fellenstien: ‘Grid Computing ‘, Pearson Education
2. J. Burkhardt et.al: ‘pervasive computing’ Pearson Education
3. Marivesar:’ Approaching quantum computing’, Pearson Education.
4. Raj kumar Buyya:’High performance cluster computing’, Pearson Education.
5. Neilsen & Chung L:’Quantum computing and Quantum Information’, Cambridge University
Press.
6. A networking approach to Grid Computing, Minoli, Wiley.
Page 42 of 55
R19 M.TECH. CSE/CS

DEEP LEARNING (Professional Elective - V)
Course Objectives:
 To introduce the foundations of Artificial Neural Networks
 To acquire the knowledge on Deep Learning Concepts
 To learn various types of Artificial Neural Networks
 To gain knowledge to apply optimization strategies
Course Outcomes:
 Ability to understand the concepts of Neural Networks
 Ability to select the Learning Networks in modeling real world systems
 Ability to use an efficient algorithm for Deep Models
 Ability to apply optimization strategies for large scale applications
UNIT - I
Deep Feedforward Networks: Example: Learning XOR, Gradient-Based Learning, Hidden Units,
Architecture Design, Back-Propagation and Other Differentiation Algorithms, Historical Notes
UNIT - II
Regularization for Deep Learning:
Parameter Norm Penalties, Norm Penalties as Constrained Optimization, Regularization and Under-
Constrained Problems, Dataset Augmentation, Noise Robustness, Semi-Supervised Learning, Multi-
Task Learning, Early Stopping, Parameter Tying and Parameter Sharing, Sparse Representations,
Bagging and Other Ensemble Methods, Dropout, Adversarial Training, Tangent Distance, Tangent
Prop, and Manifold Tangent Classifier.
UNIT - III
Optimization for Training Deep Models, How Learning Differs from Pure Optimization, Challenges in
Neural Network Optimization, Basic Algorithms, Parameter Initialization Strategies, Algorithms with
Adaptive Learning Rates, Approximate Second-Order Methods, Optimization Strategies and Meta-
Algorithms
UNIT - IV
Convolutional Networks:
The Convolution Operation, Motivation, Pooling, Convolution and Pooling as an Infinitely Strong Prior,
Variants of the Basic Convolution Function, Structured Outputs, Data Types, Efficient Convolution
Algorithms, Random or Unsupervised Features, The Neuro-scientific Basis for Convolutional
Networks, Convolutional Networks and the History of Deep Learning
UNIT - V
Applications:
Large-Scale Deep Learning, Computer Vision, Speech Recognition, Natural Language Processing,
Other Applications
Text Book:
1. Goodfellow, Yoshua Bengio, Aaron Courville, Deep Learning (Adaptive Computation and
Machine Learning series), MIT Press.
Page 43 of 55
R19 M.TECH. CSE/CS
Reference Books:
1. Li Deng and Dong Yu, Deep Learning Methods and Applications, Foundations and Trends®
in Signal Processing Volume 7 Issues 3-4, ISSN: 1932-8346.
2. Dr. N.D. Lewis, Deep Learning Made Easy with R A Gentle Introduction for Data Science.
Create Space Independent Publishing Platform (January 10, 2016).
3. François Chollet, JJ Allaire, MEAP Edition Manning Early Access Program Deep Learning
with R Version 1, Copyright 2017 Manning Publications.
Page 44 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
ENGLISH FOR RESEARCH PAPER WRITING (Audit Course - I & II)
Prerequisite: None
Course objectives: Students will be able to:

 Understand that how to improve your writing skills and level of readability
 Learn about what to write in each section
 Understand the skills needed when writing a Title Ensure the good quality of paper at very
first-time submission
UNIT-I:
Planning and Preparation, Word Order, Breaking up long sentences, Structuring Paragraphs and
Sentences, Being Concise and Removing Redundancy, Avoiding Ambiguity and Vagueness
UNIT-II:
Clarifying Who Did What, Highlighting Your Findings, Hedging and Criticizing, Paraphrasing and
Plagiarism, Sections of a Paper, Abstracts. Introduction
UNIT-III:
Review of the Literature, Methods, Results, Discussion, Conclusions, The Final Check.
UNIT-IV:
key skills are needed when writing a Title, key skills are needed when writing an Abstract, key skills
are needed when writing an Introduction, skills needed when writing a Review of the Literature,
UNIT-V:
skills are needed when writing the Methods, skills needed when writing the Results, skills are needed
when writing the Discussion, skills are needed when writing the Conclusions. useful phrases, how to
ensure paper is as good as it could possibly be the first- time submission
TEXT BOOKS/ REFERENCES:

1. Goldbort R (2006) Writing for Science, Yale University Press (available on Google Books)
2. Day R (2006) How to Write and Publish a Scientific Paper, Cambridge University Press
3. Highman N (1998), Handbook of Writing for the Mathematical Sciences, SIAM. Highman’s
book.
4. Adrian Wallwork, English for Writing Research Papers, Springer New York Dordrecht
Heidelberg London, 2011
Page 45 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
DISASTER MANAGEMENT (Audit Course - I & II)
Prerequisite: None
Course Objectives: Students will be able to

 learn to demonstrate a critical understanding of key concepts in disaster risk reduction and
humanitarian response.
 critically evaluate disaster risk reduction and humanitarian response policy and practice from
multiple perspectives.
 develop an understanding of standards of humanitarian response and practical relevance in
specific types of disasters and conflict situations.
 critically understand the strengths and weaknesses of disaster management approaches,
 planning and programming in different countries, particularly their home country or the countries
they work in
UNIT-I:
Introduction:
Disaster: Definition, Factors and Significance; Difference Between Hazard and Disaster; Natural and
Manmade Disasters: Difference, Nature, Types and Magnitude.
Disaster Prone Areas in India:
Study of Seismic Zones; Areas Prone to Floods and Droughts, Landslides and Avalanches; Areas
Prone to Cyclonic and Coastal Hazards with Special Reference to Tsunami; Post-Disaster Diseases
and Epidemics
UNIT-II:
Repercussions of Disasters and Hazards:
Economic Damage, Loss of Human and Animal Life, Destruction of Ecosystem. Natural Disasters:
Earthquakes, Volcanisms, Cyclones, Tsunamis, Floods, Droughts and Famines, Landslides and
Avalanches, Man-made disaster: Nuclear Reactor Meltdown, Industrial Accidents, Oil Slicks and
Spills, Outbreaks of Disease and Epidemics, War and Conflicts.
UNIT-III:
Disaster Preparedness and Management:
Preparedness: Monitoring of Phenomena Triggering A Disaster or Hazard; Evaluation of Risk:
Application of Remote Sensing, Data from Meteorological and Other Agencies, Media Reports:
Governmental and Community Preparedness.
UNIT-IV:
Risk Assessment Disaster Risk:
Concept and Elements, Disaster Risk Reduction, Global and National Disaster Risk Situation.
Techniques of Risk Assessment, Global Co-Operation in Risk Assessment and Warning, People’s
Participation in Risk Assessment. Strategies for Survival.
UNIT-V:
Disaster Mitigation:
Meaning, Concept and Strategies of Disaster Mitigation, Emerging Trends In Mitigation. Structural
Mitigation and Non-Structural Mitigation, Programs of Disaster Mitigation in India.
Page 46 of 55
R19 M.TECH. CSE/CS

1. R. Nishith, Singh AK, “Disaster Management in India: Perspectives, issues and strategies “’New
Royal book Company.
2. Sahni, Pardeep Et. Al. (Eds.),” Disaster Mitigation Experiences and Reflections”, Prentice Hall of
India, New Delhi.
3. Goel S. L., Disaster Administration and Management Text and Case Studies”, Deep &Deep
Publication Pvt. Ltd., New Delhi.
Page 47 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
SANSKRIT FOR TECHNICAL KNOWLEDGE (Audit Course - I & II)
Prerequisite: None
Course Objectives:
 To get a working knowledge in illustrious Sanskrit, the scientific language in the world
 Learning of Sanskrit to improve brain functioning
 Learning of Sanskrit to develop the logic in mathematics, science & other subjects enhancing
the memory power
 The engineering scholars equipped with Sanskrit will be able to explore the huge knowledge
from ancient literature
Course Outcomes: Students will be able to

 Understanding basic Sanskrit language
 Ancient Sanskrit literature about science & technology can be understood
 Being a logical language will help to develop logic in students
UNIT-I:
Alphabets in Sanskrit,
UNIT-II:
Past/Present/Future Tense, Simple Sentences
UNIT-III:
Order, Introduction of roots,
UNIT-IV:
Technical information about Sanskrit Literature
UNIT-V:
Technical concepts of Engineering-Electrical, Mechanical, Architecture, Mathematics

1. “Abhyaspustakam” – Dr. Vishwas, Samskrita-Bharti Publication, New Delhi
2. “Teach Yourself Sanskrit” Prathama Deeksha-Vempati Kutumbshastri, Rashtriya Sanskrit
Sansthanam, New Delhi Publication
3. “India’s Glorious Scientific Tradition” Suresh Soni, Ocean books (P) Ltd., New Delhi.
Page 48 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
VALUE EDUCATION (Audit Course - I & II)
Prerequisite: None
Course Objectives: Students will be able to

 Understand value of education and self- development
 Imbibe good values in students
 Let the should know about the importance of character
Course outcomes: Students will be able to

 Knowledge of self-development
 Learn the importance of Human values
 Developing the overall personality
UNIT-I:
Values and self-development –Social values and individual attitudes. Work ethics, Indian vision of
humanism. Moral and non- moral valuation. Standards and principles. Value judgements
UNIT-II:
Importance of cultivation of values. Sense of duty. Devotion, Self-reliance. Confidence, Concentration.
Truthfulness, Cleanliness. Honesty, Humanity. Power of faith, National Unity. Patriotism. Love for
nature, Discipline
UNIT-III:
Personality and Behavior Development - Soul and Scientific attitude. Positive Thinking. Integrity and
discipline, Punctuality, Love and Kindness.
UNIT-IV:
Avoid fault Thinking. Free from anger, Dignity of labour. Universal brotherhood and religious
tolerance. True friendship. Happiness Vs suffering, love for truth. Aware of self-destructive habits.
Association and Cooperation. Doing best for saving nature
UNIT-V:
Character and Competence –Holy books vs Blind faith. Self-management and Good health. Science
of reincarnation, Equality, Nonviolence, Humility, Role of Women. All religions and same message.
Mind your Mind, Self-control. Honesty, Studying effectively

1. Chakroborty, S.K. “Values and Ethics for organizations Theory and practice”, Oxford University
Press, New Delhi
Page 49 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
CONSTITUTION OF INDIA (Audit Course - I & II)
Prerequisite: None
Course Objectives: Students will be able to:

 Understand the premises informing the twin themes of liberty and freedom from a civil rights
perspective.
 To address the growth of Indian opinion regarding modern Indian intellectuals’ constitutional
role and entitlement to civil and economic rights as well as the emergence of nationhood in
the early years of Indian nationalism.
 To address the role of socialism in India after the commencement of the Bolshevik Revolution
in 1917 and its impact on the initial drafting of the Indian Constitution.
Course Outcomes: Students will be able to:

 Discuss the growth of the demand for civil rights in India for the bulk of Indians before the
arrival of Gandhi in Indian politics.
 Discuss the intellectual origins of the framework of argument that informed the
conceptualization of social reforms leading to revolution in India.
 Discuss the circumstances surrounding the foundation of the Congress Socialist Party [CSP]
under the leadership of Jawaharlal Nehru and the eventual failure of the proposal of direct
elections through adult suffrage in the Indian Constitution.
 Discuss the passage of the Hindu Code Bill of 1956.
UNIT-I:
History of Making of the Indian Constitution: History Drafting Committee, (Composition &
Working), Philosophy of the Indian Constitution: Preamble, Salient Features.
UNIT-II:
Contours of Constitutional Rights & Duties: Fundamental Rights Right to Equality, Right to
Freedom, Right against Exploitation, Right to Freedom of Religion, Cultural and Educational Rights,
Right to Constitutional Remedies, Directive Principles of State Policy, Fundamental Duties.
UNIT-III:
Organs of Governance: Parliament, Composition, Qualifications and Disqualifications, Powers and
Functions, Executive, President, Governor, Council of Ministers, Judiciary, Appointment and Transfer
of Judges, Qualification, Powers and Functions.
UNIT-IV:
Local Administration: District’s Administration head: Role and Importance, Municipalities:
Introduction, Mayor and role of Elected Representative, CEO of Municipal Corporation. Pachayati raj:
Introduction, PRI: Zila Pachayat. Elected officials and their roles, CEO Zila Pachayat: Position and
role. Block level: Organizational Hierarchy (Different departments), Village level: Role of Elected and
Appointed officials, Importance of grass root democracy.
UNIT-V:
Election Commission: Election Commission: Role and Functioning. Chief Election Commissioner
and Election Commissioners. State Election Commission: Role and Functioning. Institute and Bodies
for the welfare of SC/ST/OBC and women.
Page 50 of 55
R19 M.TECH. CSE/CS

1. The Constitution of India, 1950 (Bare Act), Government Publication.
2. Dr. S. N. Busi, Dr. B. R. Ambedkar framing of Indian Constitution, 1st Edition, 2015.
3. M. P. Jain, Indian Constitution Law, 7th Edn., Lexis Nexis, 2014.
4. D.D. Basu, Introduction to the Constitution of India, Lexis Nexis, 2015.
Page 51 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
PEDAGOGY STUDIES (Audit Course - I & II)
Prerequisite: None
Course Objectives: Students will be able to:

 Review existing evidence on the review topic to inform programme design and policy making
undertaken by the DfID, other agencies and researchers.
 Identify critical evidence gaps to guide the development.
Course Outcomes: Students will be able to understand:

 What pedagogical practices are being used by teachers in formal and informal classrooms in
developing countries?
 What is the evidence on the effectiveness of these pedagogical practices, in what conditions,
and with what population of learners?
 How can teacher education (curriculum and practicum) and the school curriculum and
guidance materials best support effective pedagogy?
UNIT-I:
Introduction and Methodology: Aims and rationale, Policy background, Conceptual framework and
terminology Theories of learning, Curriculum, Teacher education. Conceptual framework, Research
questions. Overview of methodology and Searching.
UNIT-II:
Thematic overview: Pedagogical practices are being used by teachers in formal and informal
classrooms in developing countries. Curriculum, Teacher education.
UNIT-III:
Evidence on the effectiveness of pedagogical practices, Methodology for the indepth stage: quality
assessment of included studies. How can teacher education (curriculum and practicum) and the scho
curriculum and guidance materials best support effective pedagogy? Theory of change. Strength and
nature of the body of evidence for effective pedagogical practices. Pedagogic theory and pedagogical
approaches. Teachers’ attitudes and beliefs and Pedagogic strategies.
UNIT-IV:
Professional development: alignment with classroom practices and follow-up support, Peer support,
Support from the head teacher and the community. Curriculum and assessment, Barriers to learning:
limited resources and large class sizes
UNIT-V:
Research gaps and future directions: Research design, Contexts, Pedagogy, Teacher education,
Curriculum and assessment, Dissemination and research impact.

1. Ackers J, Hardman F (2001) Classroom interaction in Kenyan primary schools, Compare, 31
(2): 245-261.
2. Agrawal M (2004) Curricular reform in schools: The importance of evaluation, Journal of
Curriculum Studies, 36 (3): 361-379.
3. Akyeampong K (2003) Teacher training in Ghana - does it count? Multi-site teacher education
research project (MUSTER) country report 1. London: DFID.
Page 52 of 55
R19 M.TECH. CSE/CS
4. Akyeampong K, Lussier K, Pryor J, Westbrook J (2013) Improving teaching and learning of

basic maths and reading in Africa: Does teacher preparation count? International Journal
Educational Development, 33 (3): 272–282.
5. Alexander RJ (2001) Culture and pedagogy: International comparisons in primary education.
Oxford and Boston: Blackwell.
6. Chavan M (2003) Read India: A mass scale, rapid, ‘learning to read’ campaign.
7. www.pratham.org/images/resource%20working%20paper%202.pdf.
Page 53 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
STRESS MANAGEMENT BY YOGA (Audit Course - I & II)
Prerequisite: None
Course Objectives:
 To achieve overall health of body and mind
 To overcome stress
Course Outcomes: Students will be able to:

 Develop healthy mind in a healthy body thus improving social health also
 Improve efficiency
UNIT-I:
Definitions of Eight parts of yog. (Ashtanga)
UNIT-II:
Yam and Niyam.
UNIT-III:
Do`s and Don’t’s in life.
i) Ahinsa, satya, astheya, bramhacharya and aparigraha
ii) Shaucha, santosh, tapa, swadhyay, ishwarpranidhan
UNIT-IV:
Asan and Pranayam
UNIT-V:
i) Various yog poses and their benefits for mind & body
ii) Regularization of breathing techniques and its effects-Types of pranayam

1. ‘Yogic Asanas for Group Tarining-Part-I”: Janardan Swami Yogabhyasi Mandal, Nagpur
2. “Rajayoga or conquering the Internal Nature” by Swami Vivekananda, Advaita Ashrama
(Publication Department), Kolkata
Page 54 of 55
R19 M.TECH. CSE/CS

M. Tech. (CSE/CS)
PERSONALITY DEVELOPMENT THROUGH LIFE ENLIGHTENMENT SKILLS

(Audit Course - I & II)
Prerequisite: None
Course Objectives:
 To learn to achieve the highest goal happily
 To become a person with stable mind, pleasing personality and determination
 To awaken wisdom in students
Course Outcomes: Students will be able to

 Study of Shrimad-Bhagwad-Geeta will help the student in developing his personality and
achieve the highest goal in life
 The person who has studied Geeta will lead the nation and mankind to peace and prosperity
 Study of Neetishatakam will help in developing versatile personality of students
UNIT-I:
Neetisatakam-Holistic development of personality
 Verses- 19,20,21,22 (wisdom)
 Verses- 29,31,32 (pride & heroism)
 Verses- 26,28,63,65 (virtue)
UNIT-II:
Neetisatakam-Holistic development of personality
 Verses- 52,53,59 (dont’s)
 Verses- 71,73,75,78 (do’s)
UNIT-III:
Approach to day to day work and duties.
 Shrimad Bhagwad Geeta: Chapter 2-Verses 41, 47,48,
 Chapter 3-Verses 13, 21, 27, 35, Chapter 6-Verses 5,13,17, 23, 35,
 Chapter 18-Verses 45, 46, 48.
UNIT-IV:
Statements of basic knowledge.
 Shrimad Bhagwad Geeta: Chapter2-Verses 56, 62, 68
 Chapter 12 -Verses 13, 14, 15, 16,17, 18
 Personality of Role model. Shrimad Bhagwad Geeta:
UNIT-V:
 Chapter2-Verses 17, Chapter 3-Verses 36,37,42,
 Chapter 4-Verses 18, 38,39
 Chapter18 – Verses 37,38,63

1. “Srimad Bhagavad Gita” by Swami Swarupananda Advaita Ashram (Publication Department),
Kolkata.
2. Bhartrihari’s Three Satakam (Niti-sringar-vairagya) by P.Gopinath, Rashtriya Sanskrit
Sansthanam, New Delhi.
Page 55 of 55

R19M.Tech - CS CSESyllabus

Uploaded by

Copyright:

Available Formats

R19M.Tech - CS CSESyllabus

Uploaded by

Document Information

Original Title

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

R19M.Tech - CS CSESyllabus

Uploaded by

Copyright:

Available Formats

R19 M.TECH.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

M. Tech. COMPUTER SCIENCE AND ENGINEERING/COMPUTER SCIENCE

EFFECTIVE FROM ACADEMIC YEAR 2019 - 20 ADMITTED BATCH

R19 COURSE STRUCTURE AND SYLLABUS

II YEAR III – SEMESTER

Audit Course I & II:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (PC – I)

Pre-Requisites: UG level course in Discrete Mathematics/ Mathematical Foundations of Computer

Course Outcomes: After completion of course, students would be able to:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

ADVANCED DATA STRUCTURES (PC- II)

Pre-Requisites: UG level course in Data Structures

Course Outcomes: After completion of course, students would be able to:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

INFORMATION SECURITY (Professional Elective - I)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

MOBILE APPLICATION DEVELOPMENT (Professional Elective - I)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

MACHINE LEARNING (Professional Elective - I)

Course Outcomes: After completion of course, students would be able to:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

NETWORK SECURITY (Professional Elective - II)

Pre-Requisites: Computer Networks, Web Programming

Course Outcomes: After completion of course, students would be able to:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

CLOUD COMPUTING (Professional Elective - II)

Pre-Requisites: Computer Networks, Web Programming

Course Outcomes: After completion of course, students would be able to:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

DATA MINING (Professional Elective - II)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

ADVANCED DATA STRUCTURES LAB (Lab - I)

Prerequisites: A course on Computer Programming & Data Structures

2. Write a program for implementing the following sorting methods:

3. Write a program to perform the following operations:

4. Write a program to perform the following operations:

5. Write a program to perform the following operations:

6. Write a program to perform the following operations:

7. Write a program to perform the following operations:

8. Write a program to perform the following operations:

9. Write a program to implement all the functions of a dictionary using hashing.

10. Write a program for implementing Knuth-Morris-Pratt pattern matching algorithm.

12. Write a program for implementing Boyer pattern matching algorithm.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

MACHINE LEARNING LAB (Lab – II)

6. Implement linear regression using python.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

RESEARCH METHODOLOGY & IPR

Course Outcomes: At the end of this course, students will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

ADVANCED ALGORITHMS (Professional Core – III)

Pre-Requisites: UG level course in Algorithm Design and Analysis

Course Outcomes: After completion of course, students would be able to:

Modulo Representation of integers/polynomials:

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

ADVANCED COMPUTER ARCHITECTURE (Professional Core - IV)

Prerequisites: Computer Organization