14.M.E Big Data
14.M.E Big Data
14.M.E Big Data
UNIVERSITY DEPARTMENTS
M.E. COMPUTER SCIENCE AND ENGINEERING
(SPECIALIZATION IN BIG DATA ANALYTICS)
REGULATIONS – 2019
CHOICE BASED CREDIT SYSTEM
Provide motivated faculty and state of the art facilities for education and research,
both in foundational aspects and of relevance to emerging computing trends.
Develop knowledgeable, industry-ready students with pertinent competencies.
Inculcate responsibility through sharing of knowledge and innovative computing
solutions that benefit the society-at-large.
Engage in collaborative research with academia and industry for seamless transfer
of knowledge resulting in patentable solutions.
Generate adequate resources for research activities from sponsored projects and
consultancy.
ANNA UNIVERSITY, CHENNAI
UNIVERSITY DEPARTMENTS
M.E. COMPUTER SCIENCE AND ENGINEERING
(SPECIALIZATION IN BIG DATA ANALYTICS)
REGULATIONS – 2019
CHOICE BASED CREDIT SYSTEM
A broad relation between the programme educational objective and the outcomes is given in the
following table
PROGRAMME
EDUCATIONAL PO1 PO2 PO3 PO4 PO5 PO6
OBJECTIVES
√ √
1
√ √ √ √
2
√ √ √ √
3
√ √ √ √
4
√
5
√ √ √ √ √
6
YEAR SEMESTER COURSE TITLE PO1 PO2 PO3 PO4 PO5 PO6
IPR
Audit Course – I
Systems
Big Data Query Languages √ √ √ √
YEAR SEMESTER COURSE TITLE PO1 PO2 PO3 PO4 PO5 PO6
Machine Learning √ √ √ √
Program Elective I
Program Elective II
Audit Course –II
Machine Learning
√ √ √ √
Techniques Laboratory
Big Data Query Languages
√ √ √ √
Laboratory
Professional Practices √ √ √ √ √
Program Elective III
Program Elective IV
Program Elective V
SEM3
YEAR 2
Open Elective
Dissertation I √ √ √ √ √ √
SEM4
Dissertation I √ √ √ √ √ √
ANNA UNIVERSITY, CHENNAI
UNIVERSITY DEPARTMENTS
M.E. COMPUTER SCIENCE AND ENGINEERING
(SPECIALIZATION IN BIG DATA ANALYTICS)
REGULATIONS – 2019
CHOICE BASED CREDIT SYSTEM
I - IV SEMESTER CURRICULA AND SYLLABI
SEMESTER I
COURSE PERIODSPE TOTAL
S. CATE RWEEK
CODE COURSE TITLE CONTACT CREDITS
NO. GORY
L T P PERIODS
THEORY
Advanced Mathematics for
1. MA5153 Scientific Computing FC 3 1 0 4 4
SEMESTER IV
COURSE PERIODS TOTAL
S. CATE
CODE COURSETITLE PERWEEK CONTACT CREDITS
NO. GORY
L T P PERIODS
PRACTICALS
1. BD5411 Dissertation II EEC 0 0 24 24 12
TOTAL 0 0 24 24 12
PERIODS
SI. COURSE PER WEEK CONTACT
COURSE TITLE CATEGORY CREDITS
NO CODE PERIODS
L T P
1. OE5091 Business Data
OEC 3 0 0 3 3
Analytics
2. OE5092 Industrial Safety
OEC 3 0 0 3 3
3. OE5093 Operations Research
OEC 3 0 0 3 3
4. OE5094 Cost Management of
OEC 3 0 0 3 3
Engineering Projects
5. OE5095 Composite Materials
OEC 3 0 0 3 3
6. OE5096 Waste to Energy
OEC 3 0 0 3 3
PERIODS
PER
SL. COURSE CATE CONTACT
COURSE TITLE WEEK CREDITS
NO CODE GORY PERIODS
L T P
1. MA5153 Advanced Mathematics for
FC 3 1 0 4 4
Scientific Computing
PROGRAM CORE COURSES (PCC)
PERIODS CONTACT
PER PERIODS CREDITS
SL. COURSE
COURSE TITLE CATEGORY WEEK
NO. CODE
L T P
1. CP5151 Data Structures and
Algorithms PCC 3 0 0 3 3
2. CP5152 Multi Core Architectures PCC 3 0 0 3 3
3. BD5151 Big Data Mining and
Analytics PCC 3 0 0 3 3
4. CP5161 Data Structures and
Algorithms Laboratory PCC 0 0 4 4 2
5. BD5111 Big Data Computing
Laboratory PCC 0 0 4 4 2
6. CP5251 Advanced Operating
Systems PCC 3 0 0 3 3
7. BD5201 Big Data Query
Languages PCC 3 0 0 3 3
8. CP5253 Machine Learning PCC 3 0 0 3 3
9. BD5211 Big Data Query Languages
PCC 0 0 4 4 2
Laboratory
10. CP5261 Machine Learning
PCC 0 0 4 4 2
Techniques Laboratory
PERIODS PER
Sl. COURSE WEEK CONTACT
COURSE TITLE CATEGORY CREDITS
No CODE PERIODS
L T P
Professional
1. CP5262 EEC 0 0 2 2 1
Practices
2. BD5311 Dissertation I EEC 0 0 12 12 6
3. BD5411 Dissertation II EEC 0 0 24 24 12
UNIT I FUNDAMENTALS 9
Properties of Big-oh Notation –Conditional Asymptotic Notation – Algorithm Analysis – Amortized
Analysis – Introduction to NP-Completeness/NP-Hard – Recurrence Equations – Solving
Recurrence Equations – Time-Space Tradeoff.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √ √
√
2. √ √ √
√
3. √ √ √ √
√ √ √
4. √ √ √ √
√ √ √
5. √ √ √ √
OUTCOMES:
Upon Completion of the Course, the Student will be able to
Identify the limitations of ILP and the need for multicore architectures.
Discuss the issues related to multiprocessing and suggest solutions.
Point out the salient features of different multicore architectures and how they exploit
parallelism.
Point out the various optimizations that can be performed to improve the memory hierarchy
design.
Point out the salient features of vector, GPU and domain specific architectures.
REFERENCES:
1. John L. Hennessey and David A. Patterson, “Computer Architecture – A Quantitative
Approach”, Morgan Kaufmann, Elsevier, 5th edition, 2012.
2. Darryl Gove, “Multicore Application Programming: For Windows, Linux, and Oracle
Solaris”,
Pearson, 2011.
3. David B. Kirk, Wen-mei W. Hwu, “Programming Massively Parallel Processors”, Morgan
Kauffman, 2010.
4. Wen– mei W. Hwu, “GPU Computing Gems”, Morgan Kaufmann, Elsevier, 2011.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √ √
√ √ √ √
2. √
√ √
3. √
√ √ √
4.
√ √ √
5.
UNIT V CLUSTERING 9
Introduction to Clustering Techniques – Hierarchical Clustering –Algorithms – K-Means – CURE –
Clustering in Non – Euclidean Spaces – Streams and Parallelism – Case Study: Advertising on
the Web – Recommendation Systems
TOTAL: 45 PERIODS
OUTCOMES:
Upon Completion of the Course, the Student will be able to
Design algorithms by employing Map Reduce technique for solving Big Data problems.
Identify similarities using appropriate measures.
Point out problems associated with streaming data and handle them.
Discuss algorithms for link analysis and frequent itemset mining.
Design solutions for problems in Big Data by suggesting appropriate clustering techniques.
REFERENCES:
1. Jure Leskovec, AnandRajaraman, Jeffrey David Ullman, “Mining of Massive Datasets”,
Cambridge University Press, Second Edition, 2014.
2. Jiawei Han, MichelineKamber, Jian Pei, “Data Mining Concepts and Techniques”, Morgan
Kaufman Publications, Third Edition, 2011.
3. Ian H.Witten, Eibe Frank “Data Mining – Practical Machine Learning Tools and Techniques”,
Morgan Kaufman Publications, Third Edition, 2011.
4. David Hand, HeikkiMannila and Padhraic Smyth, “Principles of Data Mining”, MIT
Press,2001.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √ √ √
√
2. √ √ √
√ √ √
3. √ √ √
√ √ √
4. √ √ √
√ √ √
5. √ √ √
OBJECTIVES:
To impart knowledge and skills required for research and IPR:
Problem formulation, analysis and solutions.
Technical paper writing / presentation without violating professional ethics
Patent drafting and filing patents.
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES:
1. Asimov, “Introduction to Design”, Prentice Hall, 1962.
2. Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd ,2007.
3. Mayall, “Industrial Design”, McGraw Hill, 1992.
4. Niebel, “Product Design”, McGraw Hill, 1974.
5. Ranjit Kumar, 2nd Edition, “Research Methodology: A Step by Step Guide for beginners”
2010
LIST OF EXPERIMENTS:
1. Binary Search Trees
2. Min/Max Heaps
3. Leftist Heaps
4. AVL Trees
5. Red-Black Trees
6. B-Trees
7. Segment Trees
8. Line segment intersection
TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the student will be able to
Achieve programming skill to convert a problem to a programming logic.
Apply suitable data structure for the problem in hand.
Implement heap and various tree structures like AVL, Red-black, B- Tree and segment
trees.
Understand the usage of data structures for geometric problems.
Understand the importance of height balancing in search structures.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √ √ √ √
√ √
2. √ √ √
√
3. √ √
√ √ √
4. √
√
5. √ √
LIST OF EXERCISES:
1. Set up a pseudo-distributed, single-node Hadoop cluster backed by the Hadoop
Distributed File System, running on Ubuntu Linux. After successful installation on one
node, configuration of a multi-node Hadoop cluster (one master and multiple slaves).
2. MapReduce application for word counting on Hadoop cluster
3. Unstructured data into NoSQL data and do all operations such as NoSQL query with API.
4. K-means clustering using map reduce
5. Page Rank Computation
6. Mahout machine learning library to facilitate the knowledge build up in big data analysis.
7. Application of Recommendation Systems using Hadoop/mahout libraries
TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the student will be able to
Set up single and multi-node Hadoop Clusters.
Apply Map Reduce technique for various algorithms.
Design new algorithms that uses Map Reduce to apply on Unstructured and structured
data.
Develop Scalable machine learning algorithms for various Big data applications using
Mahout.
Represent NoSQL data.
CO PO PSO
1 2 3 4 5 6 1 2 3
1. √ √ √ √
√ √ √
2. √ √ √ √
√ √ √
3. √ √ √ √ √
√ √ √
4. √ √ √ √ √
5. √ √
UNIT I INTRODUCTION 9
Distributed Operating Systems – Issues – Communication Primitives – Limitations of a Distributed
System – Lamport’s Logical Clocks – Vector Clocks – Causal Ordering of Messages
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Identify the features of distributed operating systems.
Demonstrate the various protocols of distributed operating systems.
Identify the different features of real time operating systems.
Discuss the features of mobile operating systems.
Discuss the features of cloud operating systems.
REFERENCES:
1. MukeshSinghal and Niranjan G. Shivaratri, “Advanced Concepts in Operating Systems –
Distributed, Database and Multiprocessor Operating Systems”, Tata MC Graw-Hill, 2001.
2. Rajib Mall, “Real-Time Systems: Theory and Practice”, Pearson Education India, 2006.
3. KarimYaghmour, “Embedded Android”, O’Reilly, First Edition, 2013.
4. NikolayElenkov, “Android Security Internals: An In-Depth Guide to Android’s Security
Architecture”, No Starch Press, 2014.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √
1. √
√ √ √
2. √ √
√ √ √ √ √
3. √ √
√ √ √ √
4. √
√ √ √ √
5. √
OUTCOMES:
Upon completion of the course, the students will be able to
Design applications using R, HADOOP.
Design applications using RHADOOP& RHIPE.
Develop analytic applications for data Streams.
Develop Pig scripts for Big data applications.
Design Big data applications schema and use HIVE QL.
REFERENCES:
1. Michael Berthold, David J. Hand, “Intelligent Data Analysis”, Springer, 2007.
2. Tom White “ Hadoop: The Definitive Guide” Third Edition, O‟reilly Media, 2011.
3. Zikopoulos, P., Parasuraman, K., Deutsch, T., Giles, J., & Corrigan, D.V Harness the
Power of Big Data The IBM Big Data Platform. McGraw Hill Professional, 2012.
4. Prajapati, V, “Big Data Analytics with R and Hadoop”, Packt Publishing Ltd, 2013.
5. Gates, A. Programming Pig.” O’Reilly Media, Inc.”, 2011.
6. Capriolo, E., Wampler, D., &Rutherglen, J., “Programming Hive”, O’Reilly Media, Inc.”,2012
7. Norman Matloff , “The Art of R Programming: A Tour of Statistical Software Design”,
NoStarch Press, 2011.
8. Jared P. Lander, “R for Everyone: Advanced Analytics and Graphics”, Addison-Wesley
Data & Analytics Series, 2013.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √
1. √ √
√ √ √ √ √ √
2. √
√ √ √
3. √ √ √ √
√ √ √
4. √ √ √ √
√ √ √
5. √ √ √ √
UNIT I INTRODUCTION 8
Machine Learning–Types of Machine Learning –Machine Learning process- preliminaries, testing
Machine Learning algorithms, turning data into Probabilities, and Statistics for Machine Learning-
Probability theory – Probability Distributions – Decision Theory.
CO PO PSO
1 2 3 4 5 6 1 2 3
1. √ √ √ √ √ √
2. √ √ √ √ √ √
3. √ √ √ √ √ √
4. √ √ √ √ √ √
5. √ √ √ √ √ √
6. √ √ √ √ √ √ √
BD5211 BIG DATA QUERY LANGUAGES LABORATORY LT P C
0042
OBJECTIVES:
To understand the basic programming constructs of R and understand the use of R in Big Data
analytics.
To solve Big data problems using Map Reduce Technique in R, HADOOP.
To develop Pig scripts for analyzing large un-structured and semi-structured data.
To develop program for Query processing using Hive.
To perform analytics on Big data streams using Hadoop Streaming API.
To learn to work on Sqoop.
LIST OF EXPERIMENTS:
1. Perform descriptive and predictive analytics using “R programming”
2. MapReduce application for word counting on R HADOOP after successful installation of
three R packages(rhdfs, rmr, and rhbase)
3. Understand data pipeline using Pig Interactive Shell Commands after successful “Pig”
installation
4. Develop Pig Scripts and call UDF’s to accomplish functionalities to meet the problem
objectives
5. Embedding PIG Latin in Python
6. Log analysis using “Pig” on semi structured data
7. Perform query processing on data warehousing after successful installation of “Hive”
8. Perform adhoc query on HDFS data using Hive Query Language (HQL)
9. Accomplish MapReduce Job by using Hadoop Streaming API
10. Perform various HDFS commands
11. Loading data into HDFS using Sqoop
TOTAL: 60 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Set up R packages and develop a program using R Programming constructs.
Solve Big Data problems using RHADOOP.
Understand setting up of Pig and solve Big Data problems.
Understand setting up of Hive and perform query processing.
Apply Hadoop Streaming API for Big Data problems.
Apply Sqoop for data loading into HDFS.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √ √ √ √
√ √ √ √ √ √ √
2.
√ √ √ √ √ √ √ √
3.
√ √ √
4. √ √
√ √ √
5. √ √ √ √
√ √
6. √
CP5261 MACHINE LEARNING TECHNIQUES LABORATORY LT P C
0042
OBJECTIVES:
To apply the concepts of Machine Learning to solve real-world problems
To implement basic algorithms in clustering & classification applied to text & numeric
data
To implement algorithms emphasizing the importance of bagging & boosting in
classification & regression
To implement algorithms related to dimensionality reduction
To apply machine learning algorithms for Natural Language Processing applications
EXERCISES RECOMMENDED
1. Solving Regression & Classification using Decision Trees
2. Root Node Attribute Selection for Decision Trees using Information Gain
3. Bayesian Inference in Gene Expression Analysis
4. Pattern Recognition Application using Bayesian Inference
5. Bagging in Classification
6. Bagging, Boosting applications using Regression Trees
7. Data & Text Classification using Neural Networks
8. Using Weka tool for SVM classification for chosen domain application
9. Data & Text Clustering using K-means algorithm
10. Data & Text Clustering using Gaussian Mixture Models
11. Dimensionality Reduction Algorithms in Image Processing applications
12. Application of CRFs in Natural Language Processing
TOTAL:45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
To learn to use Weka tool for implementing machine learning algorithms related to numeric
data
To learn the application of machine learning algorithms for text data
To use dimensionality reduction algorithms for image processing applications
To apply CRFs in text processing applications
To use fundamental and advanced neural network algorithms for solving real-world data
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √ √ √ √
1.
√ √ √ √ √ √ √
2.
√ √ √ √ √ √
3.
√ √ √ √ √ √
4.
√ √ √ √
5. √ √ √
CP5262 PROFESSIONAL PRACTICES L T PC
0 02 1
OBJECTIVES:
To facilitate analysis, design and problem solving skills.
To have a thorough domain knowledge.
To understand the best Industry practices by reading case studies.
To kindle innovative and professional thinking.
To explore possible alternative solutions.
To estimate feasibility, cost, risk and ROI.
TOTAL: 30 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Identify and formulate the problem
Describe the background of the problem.
Assess the needs of stakeholders.
Make estimates like cost, risk, ROI etc., to justify the business opportunity.
Describe the industry standards and procedures.
Predict the business opportunity.
Suggest system implications.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √
√ √
2.
√
3. √ √
√ √
4. √
√ √ √
5. √
√ √
6
√ √
7 √
CP5090 ADVANCED DATABASE TECHNOLOGY AND DESIGN LT PC
3 0 24
OBJECTIVES:
To comprehend the underlying principles of Relational Database Management System.
To develop database models using parallel and distributed databases.
To understand the concepts of XML and Web databases.
To apprehend the design and implementation of active temporal and deductive databases.
To develop applications based on NoSQL database.
REFERENCES:
1. R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Addison-Wesley, 2011.
2. Han, Jiawei, Jian Pei, and MichelineKamber. Data mining: Concepts and Techniques.
2011.
3. Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design,
Implementation and Management”, Third Edition, Pearson Education, 2007.
4. Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Fifth
Edition, McGraw Hill, 2006.
5. C.J.Date, A.KannanandS.Swamynathan, “An Introduction to Database Systems”, Eighth
Edition, Pearson Education, 2006.
6. V.S.Subramanian, “Principles of Multimedia Database Systems”, Harcourt India Pvt.
Ltd.,2001.
7. ShashankTiwari, ”Professional NoSQL”, Wiley, 2011.
8. David Lane, Hugh.E.Williums, Web Database Applications with PHP and MySQL, O’Reilly
Media; 2nd edition, 2004
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √ √
1. √ √
√ √ √ √ √ √
2. √
√ √ √ √ √ √
3. √
√ √ √ √ √ √
4. √
√ √ √ √ √
5. √ √
REFERENCES:
1. Thomas Erl, ZaighamMahood, Ricardo Puttini, “Cloud Computing, Concept, Technology &
Architecture”, Prentice Hall, 2013.
2. RajkumarBuyya, Christian Vecchiola, S. ThamaraiSelvi, “Mastering Cloud Computing”,
Tata McGraw-Hill, 2013.
3. Toby Velte, Anthony Velte, Robert C. Elsenpeter, “Cloud Computing, A Practical
Approach”,Tata McGraw-Hill Edition, 2010.
4. ArshdeepBahga, Vijay Madisetti, “Cloud Computing: A Hands-On Approach”, Universities
Press(India) Private Limited, 2014.
5. Tom White, “Hadoop: The Definitive Guide”, O’Reilly Media, 4th Edition, 2015.
6. James E Smith and Ravi Nair, “Virtual Machines”, Elsevier, 2005.
7. John Rittinghouse& James Ransome, “Cloud Computing, Implementation,Management
and Strategy”, CRC Press, 2010.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √
1. √
√ √ √ √ √
2.
√ √ √ √ √
3.
√ √ √ √
4. √ √
√ √ √ √ √
5. √ √
CP5080 ETHICAL HACKING LTPC
3 024
OBJECTIVES:
To learn about the importance of information security.
To learn different scanning and enumeration methodologies and tools.
To understand various hacking techniques and attacks.
To be exposed to programming languages for security professionals.
To understand the different phases in penetration testing.
OUTCOMES:
Upon completion of the course, the students will be able to
Identify threats to computers.
Defend hacking attacks.
Protect data assets .
Defend a computer against a variety of security attacks using various tools.
Practice and use safe techniques on the World Wide Web.
REFERENCES:
1. EC-Council, “Ethical Hacking and Countermeasures: Attack Phases”, Cengage Learning,
2010.
2. Jon Erickson, “Hacking, 2nd Edition: The Art of Exploitation”, No Starch Press Inc., 2008.
3. Michael T. Simpson, Kent Backman, James E. Corley, “Hands-On Ethical Hacking and
Network Defense”, Cengage Learning, 2013.
4. Patrick Engebretson, “The Basics of Hacking and Penetration Testing – Ethical Hacking
and Penetration Testing Made Easy”, Second Edition, Elsevier, 2013.
5. RafayBoloch, “Ethical Hacking and Penetration Testing Guide”, CRC Press, 2014.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √
1. √
√ √ √
2. √ √
√ √ √ √ √
3.
√ √ √ √ √
4. √ √
√ √ √ √ √ √
5. √ √
REFERENCES:
1. Rafael C.Gonzalez and Richard E.Woods, “Digital Image Processing”, Third Edition,
Pearson Education, 2008, New Delhi.
2. S.Sridhar, “Digital Image Processing”, Oxford University Press, 2011, New Delhi.
3. A l Bovik (Alan C Bovik ), “The Essential Guide to Video Processing”, Academic Press,
Second Edition, 2009.
4. A. Murat Tekalp “Digital Video Processing”, Prentice Hall, 1995
5. Oges Marques, “Practical Image and Video Processing Using MATLAB”, Wiley-IEEE
Press, 2011.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √
√ √ √ √ √ √
2.
√ √ √ √ √
3.
√ √ √ √ √ √
4.
√ √ √ √ √
5. √ √
CP5085 PRINCIPLES OF CRYPTOGRAPHY LTPC
3024
OBJECTIVES:
To understand the mathematical foundations of security principles.
To appreciate the different aspects of encryption techniques.
To understand various attacks present over encryption and authentications techniques.
To understand the role played by authentication in security.
To appreciate the current trends of security practices.
REFERENCES:
1. MihirBellare and Phillip Rogaway, “Introduction to Modern Cryptography”, 2005.
2. Jonathan Katz and Yehuda Lindell, “Introduction to Modern Cryptography”, Chapman and
Hall, CRC Press Second Edition,2015.
3. Hans Delfts and Helmut Knebl, “Introduction to Cryptography – Principles and Applications”,
Springer, Third Edition, 2015.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √
√
2. √ √
√ √
3.
√ √ √
4. √
√ √ √
5. √
REFERENCES:
1. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and Jerome Henry, “IoT
Fundamentals: Networking Technologies, Protocols and Use Cases for Internet of Things”,
Cisco Press, 2017
2. Olivier Hersent, David Boswarthick, Omar Elloum, “The Internet of Things – Key
applications and Protocols”, Wiley, 2012.
3. Michael Miller, “The Internet of Things”, Pearson Education, 2015.
4. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”, Universities
Press, 2015.
5. Jan Ho¨ ller, VlasiosTsiatsis, Catherine Mulligan, Stamatis , Karnouskos, Stefan Avesand.
David Boyle,"From Machine - to-Machine to the Internet of Things - Introduction to a New
Age of Intelligence", Elsevier, 2014.
6. Dieter Uckelmann, Mark Harrison, Michahelles, Florian (Eds), “Architecting the Internet of
Things”, Springer, 2011.
CO PO PSO
1 2 3 4 5 6 1 2 3
1.
2.
3.
4.
5.
OBJECTIVES:
To understand the basic ideas and principles of Neural Networks
To understand the basic concepts of Big Data and Statistical Data Analysis
To familiarize the student with The Image Processing facilities like Tensorflow and Keras
To appreciate the use of Deep Learning Applications
To understand and implement Deep Learning Architectures
UNIT I BASICS OF NEURAL NETWORKS 9
Basic concept of Neurons – Perceptron Algorithm – Feed Forward and Back Propagation
Networks.
Suggested Activities:
Discussion of role of Neural Networks.
External learning – Boltzmann Machine and Perceptron.
Practical – Installation of TensorFlow and Keras.
Suggested Activities:
Discussion of role of Gradient Descent in Deep Learning.
External learning – Feature extraction and feature learning.
Survey of Deep Learning Development Frameworks.
Discussion of Gradient Descent Problem.
Suggested Evaluation Methods
Tutorial – Gradient descent in deep learning.
Assignment problems in optimization.
Quizzes on deep learning regularization and optimization.
Suggested Activities:
Discussion of role of Deep Learning architectures.
External learning – Compression of features using Autoencoders.
Suggested Activities:
Discussion of role of Deep Learning in Image and NLP applications.
External learning – NLP concepts.
PRACTICAL EXERCISES:
1. Implement Simple Programs like vector addition in TensorFlow.
2. Implement a simple problem like regression model in Keras.
3. Implement a perceptron in TensorFlow/Keras Environment.
4. Implement a Feed-Forward Network in TensorFlow/Keras.
5. Implement an Image Classifier using CNN in TensorFlow/Keras.
6. Implement a Transfer Learning concept in Image Classification.
7. Implement an Autoencoder in TensorFlow/Keras.
8. Implement a SimpleLSTM using TensorFlow/Keras.
9. Implement an Opinion Mining in Recurrent Neural network.
10. Implement an Object Detection using CNN.
11. Mini Project
TOTAL: 75 PERIODS
OUTCOMES:
On completion of the course, the students will be able to:
1. Understand the role of Deep learning in Machine Learning Applications.
2. To get familiar with the use of TensorFlow/Keras in Deep Learning Applications.
3. To design and implement Deep Learning Applications.
4. Critically Analyse Different Deep Learning Models in Image Related Projects.
5. To design and implement Convolutional Neural Networks.
6. To know about applications of Deep Learning in NLP and Image Processing.
REFERENCES:
1. Ian Good Fellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2017.
2. Francois Chollet, “Deep Learning with Python”, Manning Publications, 2018.
3. Phil Kim, “Matlab Deep Learning: With Machine Learning, Neural Networks and Artificial
Intelligence”, Apress , 2017.
4. Ragav Venkatesan, Baoxin Li, “Convolutional Neural Networks in Visual Computing”, CRC
Press, 2018.
5. Navin Kumar Manaswi, “Deep Learning with Applications Using Python”, Apress, 2018.
6. Joshua F. Wiley, “R Deep Learning Essentials”, Packt Publications, 2016.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √
√ √ √ √ √ √
2.
√ √ √
3. √
√ √ √ √
4. √ √
√ √ √
5. √
√ √ √ √
6. √ √
REFERENCES:
1. Patrich J. Lynch, Sarah Horton, “Web Style Guide-Foundations of User ExperienceDesign”,
Yale University Press, 4th Edition, 2016.
2. Thomas A. Powell, “The Complete Reference– Web Design”, Tata McGraw Hill,Second
Edition, 2003.
3. Joel Sklar, ― Principles of Web Design, Cengage Learning –Web Warrior Series, 6th
Edition,2015.
4. Deane Barker, “Web Content management-Systems, Features and Best Practices”, O’reilly
Media, 1st Edition, 2016.
5. Brian Clifton, “Advanced web Metrics with Google Analytics”, Third Edition, Sybex
Publishers, 2012.
6. AvinashKaushik, Web Analytics 2.0: The Art of Online Accountability and Science of
Customer Centricity, 1st edition, Sybex publishers, 2009.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √ √ √
1. √
√ √ √ √ √ √ √
2.
√ √ √ √ √ √
3.
√ √ √ √ √ √
4. √
√ √ √
5. √ √ √
IF8090 SEMANTIC WEB LTPC
3 02 4
OBJECTIVES:
To learn the fundamentals of semantic web and to conceptualize and depict Ontology for
semantic web.
To understand the languages for semantic web.
To learn about the ontology learning algorithms and to utilize in the development of an
application.
To know the fundamental concepts of ontology management.
To learn the applications related to semantic web.
Suggested Activities:
Flipped classroom on semantic web background and tutorial activity in class.
Brainstorming session on various knowledge representation formats in class.
Suggested Activities:
Flipped classroom on comparison of various semantic web related languages and
tutorial activity in class.
Suggested Activities:
Flipped classroom on natural language processing techniques like statistical text
analysis, term extraction, Word sense disambiguation, concept extraction and tutorial
activity in class.
External reading – https://nlp.stanford.edu/fsnlp/
Suggested Activities:
Flipped classroom on study of various ontology related tools.
UNIT V APPLICATIONS 9
Web Services – Semantic Web Services – Case Study for specific domain – Security issues –
Web Data Exchange and Syndication – Semantic Wikis – Semantic Portals – Semantic Metadata
in Data Formats – Semantic Web in Life Sciences – Ontologies for Standardizations – Rule
Interchange Format.
Suggested Activities:
Flipped classroom on other applications of semantic web.
PRACTICAL EXERCISES: 30
1. Design of simple ontology on their domain of interest using Protege like tool.
2. Create RDF document using PHP library EasyRdf.
3. Use OWL language to represent relationships, properties and to provide inferences from
created ontology.
4. Term extraction and Term disambiguation from corpus using Alchemy like API.
5. Use of any tool to apply SAPRQL queries and implement reasoning for avoiding
inconsistencies.
6. Exercises on Merging two ontologies, Applying association rules and Applying clustering
algorithms.
7. Development of Simple application like chat bot, semantic search engine creation using
Topic map data models extracted from Ontopia/Mappa.
8. Creating intelligent expert systems using semantic Wikis like SMW+.
TOTAL: 75 PERIODS
OUTCOMES:
On completion of the course, the students will be able to:
1. Create ontology for a given domain.
2. Develop an application using ontology languages and tools.
3. Understand the concepts of semantic Web.
4. Use ontology related tools and technologies for application creation.
5. Design and develop applications using semantic web.
6. Understand the standards related to semantic web.
REFERENCES:
1. Pascal Hitzler, Markus Krötzsch, Sebastian Rudolph, “Foundations of Semantic Web
Technologies”, Chapman & Hall/CRC, 2009.
2. Asuncion Gomez-Perez, Oscar Corcho, Mariano Fernandez-Lopez, “Ontological
Engineering: with Examples from the Areas of Knowledge Management, e-Commerce and
the Semantic Web”, Springer, 2004.
3. Grigoris Antoniou, Frank van Harmelen, “A Semantic Web Primer (Cooperative Information
Systems)”, MIT Press, 2004.
4. Alexander Maedche, “Ontology Learning for the Semantic Web”, First Edition, Springer.
2002.
5. John Davies, Dieter Fensel, Frank Van Harmelen, “Towards the Semantic Web: Ontology
Driven Knowledge Management”, John Wiley, 2003.
6. John Davies, Rudi Studer, Paul Warren, (Editor), “Semantic Web Technologies: Trends
and Research in Ontology-Based Systems”, Wiley, 2006.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √
√ √ √
2. √ √
√ √ √
3.
√ √ √ √ √ √
4.
√ √ √ √ √
5. √
√ √
6. √
UNIT I INTRODUCTION 9
Mobile applications – Characteristics and Benefits – Application Model – Infrastructure and
Managing Resources – Mobile Device Profiles – Frameworks and Tools.
Suggested Activities:
Flipped classroom on survey on mobile application models.
External learning – mobile application design using frameworks and tools.
Suggested Activities:
Flipped classroom on discussion on memory constraints for mobile application design.
External learning – survey on resource management and concurrent operations.
Suggested Activities:
Simple Android application development like user account creation.
Android application accessing the mobile database to view user data.
Suggested Activities:
Application accessing Internet for communication like web application.
Android application accessing GPS for location based service.
PRACTICAL EXERCISES: 30
1. Develop an application that uses GUI components, Font and Colours.
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. Write an application that makes use of internet for communication (mobile web app).
7. Develop a native application that uses GPS location information.
8. Implement an application that writes data to the SD card.
9. Implement an application that creates an alert upon receiving a message.
10. Write a mobile application that creates alarm clock.
TOTAL: 75 PERIODS
OUTCOMES:
On completion of the course, the students will be able to:
1. Design the right user interface for mobile application.
2. Implement mobile application using UI toolkits and frameworks.
3. Design a mobile application that is aware of the resource constraints of mobile devices.
4. Develop web based mobile application that accesses internet and location data.
5. Implement android application to use telephony for SMS communication.
6. Implement android application with multimedia support.
REFERENCES:
1. Reto Meier, “Professional Android 4 Application Development”, Wiley, 2012.
2. Zigurd Mednieks, Laird Dornin, G. Blake Meike, Masumi Nakamura, “Programming Android”,
O’Reilly, 2011.
3. Alasdair Allan, “iPhone Programming”, O’Reilly, 2010.
OBJECTIVES:
To study the basic concepts of crytocurrencies and blockchains.
To explain the details of Bitcoin and its different components.
To study the basics Hyperledger and Web3.
To analyse the position of Web 3 and Hyperledger with different aspects of blockchain
technologies.
To differentiate between alternate blockchains and their advantages in application areas.
To understand the Ethereum development environment and the application development
process.
UNIT I INTRODUCTION 9
Cryptographic hash functions – hash pointers – digital signatures – public keys as identities – an
example cryptocurrency. Bitcoin, history of blockchain and Bitcoin – Types of Blockchain –
Consensus – Decentralization.
UNIT II BITCOIN 9
Bitcoin – Digital Keys and Addresses – Transactions, life cycle, data structure, types – Structure of
the blockchain – Mining – Bitcoin Networks and Payments – Wallets – Alternative coins – Smart
Contracts – Definition – Recardian contracts.
UNIT V ETHEREUM 9
Setting up Ethereum development tools – Solidity language. – Ethereum accounts, key pairs,
working with Externally Owned Accounts (EOA), contract accounts – Smart contracts, structure,
setting up and interaction, examples – Decentralised applications, implementation, case studies –
Whisper protocol – Swarm architecture and concepts.
TOTAL : 45 PERIODS
OUTCOMES:
On Completion of the course, the students should be able to:
Explain cryptocurrencies and their relationship with the blockchain technology.
Explain the different steps in the use of Bitcoins.
Relate Web 3 and Hyperledger to concepts in blockchain technologies.
Apply blockchains to different real-life problems
Implement a simple application using Ethereum.
REFERENCES:
1. Imran Bashir, “Mastering Blockchain: Distributed Ledger Technology, Decentralization, and
Smart Contracts Explained”, Second Edition, Packt Publishing, 2018.
2. A. Narayanan, J. Bonneau, E. Felten, A. Miller, S. Goldfeder, “Bitcoin and Cryptocurrency
Technologies: A Comprehensive Introduction” Princeton University Press, 2016.
3. Arshdeep Bahga and Vijay Madisetti, “Blockchain Applications : A Hands-On Approach”, 2017
4. Andreas Antonopoulos, Satoshi Nakamoto, “Mastering Bitcoin”, O’Reilly Publishing, 2014.
5. Roger Wattenhofer, “The Science of the Blockchain” Create Space Independent Publishing
Platform, 2016.
6. Alex Leverington, “Ethereum Programming” Packt Publishing Limited, 2017.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √
√ √ √
2. √
√ √ √ √
3.
√ √ √ √ √ √ √
4.
√ √ √ √ √
5. √
PRACTICAL EXERCISES:
1. Editing various images (Image restoration, Changing colour image to Grey scale and vice
versa) and adding special effects to images using tools like Photoshop, Gimp and flash
2. Creating and Editing various video clippings and adding special effects using tools like Adobe
Premier Pro
3. Creating and Editing various audio files and adding special effects using tools like Sound Forge
and Audacity
4. Creating three dimensional models and animations using tools like Blender, 3DS Max, Unity
5. Working on Text compression algorithms like Run length and Huffman
6. Implementation of transformations like DCT and FFT
Designing User Interfaces and developing simple games using multimedia tools
7. Creating simple multimedia applications using any popular Authoring tools
8. Mini Project(4 Periods)
OUTCOMES:
On Completion of the course, the students should be able to:
Handle the multimedia elements effectively
Use Multimedia Hardware and Software for Editing and Authoring
Use Compression algorithms for various multimedia applications
Develop effective strategies to deliver Quality-of-Experience in networked Multimedia
applications
Design and develop multimedia applications in various domains
TEXTBOOKS:
1. Ze-Nian Li, Mark S. Drew, Jiangchuan Liu, “Fundamentals of Multimedia”, Second Edition,
Springer Nature (Texts in Computer Science), 2014.
2. Prabhat K. Andleigh, KiranThakrar, “Multimedia Systems Design”, Pearson Education India,
Ist Edition, 2015
3. Ralf Steinmetz and KlaraNahrstedt, “Multimedia computing, communications, and
applications”, Pearson India, Pearson, 2002.
REFERENCES:
1. Fred Halsall, “Multimedia Communications: Applications, Networks, Protocols and
Standards”, Pearson Education, 2002.
2. Khalid Sayood, “Introduction to Data Compression”, 4th Edition, Morgan Kauffman, 2012.
3. K.R. Rao, Zoran S. Bojkovic, Bojan M. Bakmaz, “ Wireless Multimedia Communication
systems: Design, Analysis and Implementation”, CRC press, 2017.
4. V.S. Subrahmanian, “Principles of Multimedia Database Systems”, Elsevier / Morgan
Kauffmann, 2008.
CO PO PSO
1 2 3 4 5 6 1 2 3
1. √ √
√ √
2. √ √
√ √ √ √ √
3.
√ √ √
4. √ √ √
√ √ √ √
5. √ √ √
REFERENCES
1. Daniel Galin, ―Software Quality Assurance – from Theory to Implementation‖, Pearson
Education, 2009
2. Yogesh Singh, "Software Testing", Cambridge University Press, 2012
3. Aditya Mathur, ―Foundations of Software Testing‖, Pearson Education, 2008
4. Ron Patton, ―Software Testing‖ , Second Edition, Pearson Education, 2007
5. Srinivasan Desikan, Gopalaswamy Ramesh, ―Software Testing – Principles and Practices‖,
Pearson Education, 2006
6. Alan C Gillies, ―Software Quality Theory and Management‖, Cengage Learning,
Second Edition, 2003.
7. Robert Furtell, Donald Shafer, and Linda Shafer, "Quality Software Project Management",
Pearson Education Asia, 2002.
CO PO PSO
1 2 3 4 5 6 1 2 3
1. √ √ √
√ √
2.
√ √ √
3. √
√ √
4. √
√ √
5.
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Build an Information Retrieval system using the available tools
Identify and design the various components of an Information Retrieval system
Measure effectiveness and efficiency of information retrieval techniques
Use parallel Information Retrieval approaches in real world problems
Design an efficient search engine and analyze the Web content structure
REFERENCES:
1. Ricardo Baeza – Yates, BerthierRibeiro – Neto, “Modern Information Retrieval: The Concepts
and Technology behind Search”, (ACM Press Books), Second Edition, 2011.
2. Christopher D. Manning, PrabhakarRaghavan, HinrichSchutze, “Introduction to Information
Retrieval”, Cambridge University Press, First South Asian Edition, 2008.
3. S Stefan Buttcher, Charles L. A. Clarke, Gordon V. Cormack, “Information Retrieval
Implementing and Evaluating Search Engines”, The MIT Press, Cambridge, Massachusetts
London, England, 2010.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √ √ √ √
√ √ √ √
2. √ √
3. √ √ √ √ √ √
4. √ √ √ √ √ √
√
5. √ √ √ √ √
√ √
UNIT III EXTRACTION AND MINING COMMUNITIES IN WEB SOCIAL NETWORKS 9+6
Extracting evolution of Web Community from a Series of Web Archive – Detecting Communities in
Social Networks – Definition of Community – Evaluating Communities – Methods for Community
Detection & Mining – Applications of Community Mining Algorithms – Tools for Detecting
Communities – Social Network Infrastructure and Communities – Decentralized Online Social
Networks – Multi-Relational Characterization of Dynamic Social Network Communities
UNIT IV HUMAN BEHAVIOR ANALYSIS AND PRIVACY ISSUES 9+6
Understanding and Predicting Human Behavior for Social Communities – User Data Management,
Inference and Distribution – Enabling New Human Experiences – Reality Mining – Context-
Awareness – Privacy in Online Social Networks – Trust in Online Environment – Trust Models
Based on Subjective Logic – Trust Network Analysis – Trust Transitivity Analysis – Combining
Trust and Reputation – Trust Derivation Based on Trust Comparisons – Attack Spectrum and
Countermeasures.
REFERENCES:
1. Peter Mika, “Social networks and the Semantic Web”, Springer, 2007.
2. BorkoFurht, “Handbook of Social Network Technologies and Applications”, Springer, 2010.
3. Bing Liu, “Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data (Data- Centric
Systems and Applications)”, Springer; Second Edition, 2011.
4. Reza Zafarani, Mohammad Ali Abbasi, Huan Liu, ”Social Media Mining”, Cambridge University
Press, 2014.
5. GuandongXu, Yanchun Zhang and Lin Li, “Web Mining and Social Networking Techniques and
applications”, Springer, 2011.
6. Dion Goh and Schubert Foo, “Social information retrieval systems: emerging technologies and
Applications for searching the Web effectively”, Idea Group, 2007.
CO PO
PSO
1 2 3 4 5 6
1 2 3
1. √ √ √ √ √
2. √ √ √ √
3. √ √ √ √ √ √
4. √ √ √ √ √ √
5. √ √ √ √ √ √
CP5084 PARALLEL ALGORITHMS LTPC
3 0 0 3
OBJECTIVES:
To learn parallel algorithms development techniques for shared memory and DCM models.
To study the main classes of fundamental parallel algorithms.
Learn to design efficient parallel algorithms.
To study the complexity and correctness models for parallel algorithms.
To understand parallel solutions for bitwise computation.
UNIT I INTRODUCTION 9
Introduction to Parallel Algorithms – Models of Computation – Selection – Merging on EREW and
CREW – Median of two sorted sequence – Fast Merging on EREW – Analyzing Parallel
Algorithms
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Understand the difference between sequential and parallel algorithms.
Design parallel algorithms in various models of parallel computation.
Apply a suitable model for developing a parallel algorithm.
Know the basic issues associated with implementing parallel algorithms.
Understand the differences among several algorithms used for solving the same problem
and recognize which one is better under different conditions.
REFERENCES:
1. Selim G. Akl, “The Design and Analysis of Parallel Algorithms”, Prentice Hall, New Jercy, 1989.
2. Michael J. Quinn, “Parallel Computing: Theory & Practice”, Tata McGraw Hill Edition, 2003.
3. Joseph JaJa, “Introduction to Parallel Algorithms”, Addison-Wesley, 1992.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √
√ √ √ √ √
2.
√ √ √ √ √ √
3.
√ √ √ √
4. √
√ √ √ √
5. √ √
OBJECTIVES:
To understand the nature of threats and cyber security management goals and technology
To understand the landscape of hacking and perimeter defense mechanisms
To develop strategies for cyber security and protecting critical infrastructure
To understand policies to mitigate cyber risks
To understand the IT Act, scheme, amendments and emerging cyber law and desired cyber
ecosystem capabilities
UNIT I OVERVIEW OF CYBER SECURITY 9
Introduction – Cyberspace – Cyber Crime – Nature of Threat – Cyber security – Policy, Mission
and Vision of Cyber security Program. Cyber security management system – goals, technology
categories – perimeter defense and encryption. Cyber security management framework.
UNIT II ATTACKS AND COUNTERMEASURES 9
Malicious Attacks, Threats, and Vulnerabilities – Scope of cyber-attacks – Tools used to attack
computer systems – security breach – Risks, vulnerabilities and threats. Malware – malicious
software attack – social engineering attack – wireless network attack – web application attack –
Countermeasures– Types of Network Security Devices –Firewalls, Intrusion Detection Systems,
Content Filtering, Virtual Private Networks – Encryption
REFERENCES:
1. David Kim and Michael G. Solomon, Fundamentals of Information Systems Security, Third
Edition Transition Guide, Jones &Bartlett Learning, 2018.
2. Peter Trim and Yang - Im Lee, ―Cyber Security Management- A Governance, Risk and
Compliance Framework, Gower Publishing, England 2014.
3. Institute for Defence Studies and Analysis Report, India’s Cyber Security Challenge, 2012
https://idsa.in/system/files/book/book_indiacybersecurity.pdf
4. John G. Voeller, Cyber Security, John Wiley & Sons, England, 2014.
5. Carol C. Woody, Nancy R. Mead, Cyber Security Engineering: A Practical Approach for
Systems and Software Assurance, Addison-Wesley, 2016.
6. Edward Griffor, Handbook of System Safety and Security, Syngress an Elsevier Publications,
1st edition, 2017.
7. Thomas A. Johnson Cyber Security- Protecting Critical Infrastructures from Cyber Attack and
Cyber Warfare, CRC Press, 2015.
8. NIST Cyber security Framework, Version 1.0, 2014.
9. CGI, ―Cyber security in Modern Critical Infrastructure Environments, 2014.
10. Stuart Broderick J, Cyber Security Program, Cisco Security Solutions, June 2016.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √
√ √ √
2. √
√ √ √ √ √ √
3. √
√ √ √ √ √
4. √
√ √ √ √ √
5. √
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Differentiate Conventional AI and Computational Intelligence.
Discuss on machine learning through neural networks.
Apply knowledge in developing a Fuzzy expert system.
Model Neuro Fuzzy system for clustering and classification.
Discover knowledge to develop Genetic Algorithm and Support vector machine based
machine learning system.
REFERENCES:
1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft Computing”,
Prentice-Hall of India, 2002.
2. KwangH.Lee, “First course on Fuzzy Theory and Applications”, Springer, 2005.
3. George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice
Hall, 1996.
4. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Addison Wesley, 2003.
5. David E.Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”,
Addison Wesley, 1989.
6. Mitchell Melanie, “An Introduction to Genetic Algorithm”, MIT Press, 1996.
7. S.N.Sivanandam, S.N.Deepa, “Introduction to Genetic Algorithms”, Springer, 2008.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √
√ √
2. √ √
√ √ √ √ √ √ √
3. √
√ √ √
4. √
√ √ √ √ √
5. √ √
OUTCOMES:
Upon completion of the course, the student will be able to
Understand the basics of human computer interactions via usability engineering and
cognitive modeling.
Understand the basic design paradigms, complex interaction styles.
Understand the fundamental design issues.
Examine the evaluation of interaction designs and implementations.
Use models and theories for user interaction.
Use above concepts for above concepts for web and mobile applications.
REFERENCES:
1. Ben Shneiderman, Catherine Plaisant, Maxine Cohen, Steven Jacobs, NiklasElmqvist,
“Designing the User Interface: Strategies for Effective Human-Computer Interaction”, Sixth
Edition, Pearson Education, 2016.
2. Jenny Preece, Helen Sharp, Yvonne Rogers, “Interaction Design: Beyond Human Computer
Interaction”, Wiley Student Edition, 4th Edition, Wiley, 2015.
3. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer Interaction”, Third
Edition, Pearson Education, 2004.
4. Alan Cooper, Robert Reimann, David Cronin, Christopher Noessel, “About Face: The
Essentials of Interaction Design”, 4th Edition, Wiley, 2014.
5. Donald A. Norman, “Design of Everyday Things”, MIT Press, 2013.
6. Cameron Banga, Josh Weinhold, “Essential Mobile Interaction Design: Perfecting Interface
Design in Mobile Apps”, Addison-Wesley Professional, 1 edition, 2014.
7. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O‟Reilly, 2009.
8. Steven Hoober, Eric Berkman, “Designing Mobile InterfacesPatterns for Interaction Design”,
O'Reilly, 2011.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √
√ √
2. √
√ √ √
3.
√ √ √ √ √
4.
√ √
5. √ √
√ √ √ √
6. √ √
REFERENCES:
1. Elfriede Dustin, Jeff Rashka, "Automated software testing: Introduction, Management and
Performance", Pearson Education, 2008.
2. C. Titus Brown, Gheorghe Gheorghiu, Jason Huggins, " An Introduction to Testing Web
Applications with twill and Selenium ", O'Reilly Media, Inc., 2007.
3. Dorothy Graham, Mark Fewster, "Experiences of Test Automation: Case Studies of
Software Test Automation", illustrated Edition, Addison-Wesley Professional, 2012.
4. Julian Harty, "A Practical Guide to Testing Mobile Smartphone Applications", Vol. 6 of
Synthesis Lectures on Mobile and Pervasive Computing Series‖, Morgan & Claypool
Publishers, 2009.
5. Kanglin Li, Mengqi Wu, "Effective Software Test Automation: Developing an Automated
Software Testing Tool", John Wiley & Sons, 2006.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √
√ √ √
2. √
√ √ √ √ √ √
3.
√ √ √
4. √
√ √ √ √
5. √ √
BD5001 STATISTICAL NATURAL LANGUAGE PROCESSING LTPC
3024
OBJECTIVES:
To understand the representation and processing of Morphology and Part-of Speech
Taggers.
To appreciate various techniques used for speech synthesis and recognition.
To understand different aspects of natural language syntax and the various methods used
for processing syntax and disambiguating word senses.
To appreciate the various representations of semantics and discourse.
To know about various applications of natural language processing.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √
√ √ √
2. √ √
√ √ √
3. √ √
√ √ √
4. √ √
√ √ √
5. √ √
√ √ √ √
6. √ √
REFERENCES:
1. Tom Heath, Christian Bizer, “Linked Data: Evolving the Web into a Global Data Space”,
Morgan & Claypool Publishers, 2011.
2. David Wood, “Linking Government Data”, Springer Science & Business Media, 2011.
3. Jure Leskovec, AnandRajaraman, Jeffrey David Ullman, “Mining of Massive Datasets”,
Cambridge University Press, 2014.
4. Olivier Curé, Guillaume Blin, “RDF Database Systems: Triples Storage and SPARQL Query
Processing”, Morgan Kaufmann, 2014.
5. Bob DuCharme, “Learning SPARQL”, "O'Reilly Media, Inc.", 2011.
CO PO
PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √ √
√ √ √
2. √ √ √ √
3. √ √ √ √ √
4. √ √ √ √ √ √
5. √ √ √ √ √ √ √ √
BD5003 DATA INTENSIVE COMPUTING LTPC
3003
OBJECTIVES:
To understand the basics of the various database systems including databases for Big data.
To learn about the architecture of data intensive computing.
To learn about parallel processing for data intensive computing.
To learn about Security in Data Intensive Computing Systems.
To learn about the applications that involve Data intensive computing.
UNIT I INTRODUCTION 9
Introduction to Distributed systems – Databases Vs. File Systems - Distributed file systems(HDFS)
– Distributed Machine-Learning System - Data Parallelism – Characteristics -Hadoop –Execution
Engines -Map Reduce- Distributed Storage System for Structured Data – NoSQL databases -
Casandra, Mongo DB-Developing a Distributed Application
UNIT IV SECURITY 9
Security in Data Intensive Computing Systems - Data Security and Privacy in Data-Intensive
Supercomputing Clusters - Information Security in Large Scale Distributed Systems -Privacy and
Security Requirements of Data Intensive Applications in Clouds
REFERENCES:
1. Tom White, “Hadoop: The Definitive Guide”, O'Reilly Media. October 2010.
2. Hector Garcia-Molina, Jeffrey D. Ullman, and Jennifer Widom., “Database Systems: The
Complete Book”, Pearson, 2013.
3. Furht, Borko, Escalante, Armando, “Handbook of Data Intensive Computing”, Springer 2011.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √ √ √
√ √
2. √ √ √
√ √ √
3. √ √ √ √
√
4. √ √ √
√ √ √
5. √ √ √ √
REFERENCES:
1. Neil Stillings, Steven E. Weisler, Christopher H. Chase and Mark H. Feinstein, Jay L. Garfield
and Edwin L. Rissland, “Cognitive Science: An Introduction”, Second Edition, MIT press 1995.
2. José Luis Bermúdez, “Cognitive Science: An Introduction to the Science of the Mind”,
Cambridge University Press, New York, 2014.
3. Robert L. Solso, Otto H. MacLin and M. Kimberly MacLin, “Cognitive Psychology, Pearson
Education, 2007.
4. J. Friedenberg and G. Silverman, “Cognitive Science: An Introduction to the Study of Mind”,
2011.
5. Steven Pinker, “How the Mind Works”, W. W. Norton & Company; Reissue edition, 2009.
6. Carolyn Panzer Sobel and Paul Li, “Cognitive Science: An Interdisciplinary Approach”, 2013.
7. Paul Thagard, “Mind: Introduction to Cognitive Science”, 2nd Edition, MIT Press, 2005.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √ √ √
√ √ √ √
2. √ √
√ √ √ √
3.
√ √ √ √ √ √ √
4. √
√ √ √ √ √ √
5. √ √
BD5004 DATA VISUALIZATION LTPC
3003
OBJECTIVES:
To understand how to accurately represent voluminous complex data set in web and from
other data sources.
To understand the methodologies used to visualize large data sets.
To understand the various process involved in data visualization.
To get used to with using interactive data visualization.
To understand the different security aspects involved in data visualization.
UNIT I INTRODUCTION 9
Context of data visualization – Definition, Methodology, Visualization design objectives. Key
Factors – Purpose, visualization function and tone, visualization design options – Data
representation, Data Presentation, Seven stages of data visualization, widgets, data visualization
tools.
OUTCOMES:
Upon completion of the course, the students will be able to
Understand the representation of complex and voluminous data.
Design and use various methodologies present in data visualization.
Understand the various process and tools used for data visualization.
Use interactive data visualization to make inferences.
Discuss the process involved and security issues present in data visualization.
REFERENCES:
1. Scott Murray, “Interactive data visualizationfor the web”, O‟Reilly Media, Inc., 2013.
2. Ben Fry, “Visualizing Data”, O‟Reilly Media, Inc., 2007.
3. Greg Conti, “Security Data Visualization: Graphical Techniques for Network Analysis”,
NoStarch Press Inc, 2007.
CO PO PSO
1 2 3 4 5 6 1 2 3
√
1. √ √ √
√ √
2. √ √ √ √ √
√ √ √
3. √ √ √
√ √
4. √ √
√
5. √ √ √
REFERENCES:
1. Charu C. Aggarwal, “Data Streams: Models and Algorithms”, Kluwer Academic Publishers,
Springer 2007 Edition.
2. Joao Gama, “Knowledge Discovery from Data Streams”, CRC Press, 2010.
3. Byron Ellis, “Real Time Analytics: Techniques to Analyze and Visualize Streaming Data”,
John Wiley and Sons, 2014.
4. Shilpi Saxena, Saurabh Gupta, “Practical Real-time Data Processing and Analytics”, Pack
publishing 2017.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √ √
√
2. √ √ √ √
√ √
3. √ √ √
√ √ √ √ √ √
4.
√ √ √ √ √
5.
OBJECTIVES:
To understand the complexity and volume of Big Data and their challenges.
To analyse the various methods of data collection.
To comprehend the necessity for pre-processing Big Data and their issues.
To understand predictive analytics and descriptive analytics.
To understand and implement Big Data Analytics with data convergence and Business
Maturity Model.
UNIT I INTRODUCTION TO BIG DATA ACQUISITION 6
Big Data framework - fundamental concepts of Big Data management and analytics - Current
challenges and trends in Big Data Acquisition.
REFERENCES:
1. Bart Baesens, "Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications", John Wiley & Sons, 2014
2. Min Chen, Shiwen Mao, Yin Zhang, Victor CM Leung,Big Data: Related Technologies,
Challenges and Future Prospects, Springer, 2014.
3. Michael Minelli, Michele Chambers, AmbigaDhiraj ,“Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends”, John Wiley & Sons, 2013.
4. Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big Data Analytics”, IGI
Global.
CO PO
PSO
1 2 3 4 5 6
1 2 3
1. √ √ √ √
2. √ √ √ √ √ √
3. √ √ √ √ √ √
4. √ √ √ √ √ √
5. √ √ √ √ √ √
BD5007 TEXT PROCESSING AND MINING LTPC
3 003
OBJECTIVES:
To understand the basic issues and types of text mining.
To appreciate the different aspects of text categorization and clustering.
To understand the role played by text mining in Information retrieval and extraction.
To appreciate the use of probabilistic models for text mining.
To appreciate the current trends in text mining.
UNIT I INTRODUCTION 8
Overview of text mining- definition- general architecture – algorithms – core operations – Pre-
processing – types of problems- basics of document classification - information retrieval- clustering
and organizing documents - information extraction - prediction and evaluation-textual information
to numerical vectors -collecting documents- document standardization – tokenization-
lemmatization-vector generation for prediction - sentence boundary determination -evaluation
performance
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √ √
1. √
√ √ √ √ √ √
2. √
√ √ √ √ √ √
3.
√ √ √ √ √ √ √
4.
√ √ √ √ √ √ √ √
5.
TOTAL: 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
To use cryptographic security algorithms to secure big data in transmissions and storage
To design algorithms in a secure manner for Big data applications
To use available security practices in big-data computation.
To use big-data analytics principles to build security applications.
To detect security threats and vulnerabilities using security analytics
REFERENCES:
1. William Stallings, “Crpyptography and Network security: Principles and Practices”,
Pearson/PHI, 5th Edition, 2010.
2. Behrouz A. Forouzan, “Cryptography and Network Security”, Tata McGraw Hill Education,
2nd Edition, 2010.
3. Douglas R. Stinson ,“Cryptography Theory and Practice ”, Chapman & Hall/CRC, 3rd Edition,
2006.
4. Mark Talabis, Robert McPherson, I Miyamoto and Jason Martin, “Information Security
Analytics: Finding Security Insights, Patterns, and Anomalies in Big Data”, Syngress Media,
U.S., 2014.
CO PO PSO
1 2 3 4 5 6 1 2 3
√ √
1. √ √ √
2. √ √ √ √ √ √
√
3. √ √ √ √
√ √ √
4. √ √ √ √
√ √
5. √ √ √ √
OBJECTIVES:
To understand the need for sentiment analysis.
To explore the various methodologies involved in text sentiment classification.
To learn the fusion of Natural Language processing with sentiment analysis.
To explore available sentiment summarization methods.
To learn the various tools used for sentiment analysis.
UNIT I INTRODUCTION 9
Need for Sentiment Analysis – Problem of Sentiment Analysis - Subjectivity – Stance – Words to
Discourse – Pragmatics – Natural Language Processing issues – Opinion Definition – Sentiment
analysis Tasks – Opinion Summarization – Types of opinion – Subjectivity and emotion – Author
and Reader Standpoint
TOTAL : 45 PERIODS
OUTCOMES:
Upon completion of the course, the students will be able to
Apply the various algorithms to perform opinion mining and classification.
Learn various supervised and unsupervised machine learning methods for sentiment analysis.
Generate sentiment lexicons by applying NLP techniques.
Solve problems on opinion summarization.
Learn to use tools for sentiment analysis.
REFERENCES:
1. Bing Liu, “Sentiment Analysis and Opinion Mining”, Morgan and Claypool publishers, 2012.
2. Bing Liu, “Sentiment Analysis – Mining opinion, Sentiments and Emotions”, Cambridge
University Press, 2015.
3. Bo Pang and Lillian Lee, “Opinion Mining and Sentiment Analysis”, Now Publishers Inc,2008.
4. Roy De Groot, “Data mining for Tweet Sentiment Classification – Twitter Sentiment
Analysis”, LAP Lambert Academic Publishing, 2012.
CO PO PSO
1 2 3 4 5 6 1 2 3
1. √ √ √ √ √
2. √ √ √ √ √
3. √ √ √ √
4. √ √ √ √ √
5. √ √ √ √
OE5091 BUSINESS DATA ANALYTICS LTPC
3 003
OBJECTIVES:
To understand the basics of business analytics and its life cycle.
To gain knowledge about fundamental business analytics.
To learn modeling for uncertainty and statistical inference.
To understand analytics using Hadoop and Map Reduce frameworks.
To acquire insight on other analytical frameworks.
Suggested Activities:
Case studies on applications involving business analytics.
Converting real time decision making problems into hypothesis.
Group discussion on entrepreneurial opportunities in Business Analytics.
Suggested Activities:
Solve numerical problems on basic statistics.
Explore chart wizard in MS Excel Case using sample real time data for data visualization.
Use R tool for data visualization.
Suggested Activities:
Solving numerical problems in sampling, probability, probability distributions and hypothesis
testing.
Converting real time decision making problems into hypothesis.
Suggested Evaluation Methods:
Assignments on hypothesis testing.
Group presentation on real time applications involving data sampling and hypothesis
testing.
Quizzes on topics like sampling and probability.
UNIT IV ANALYTICS USING HADOOP AND MAPREDUCE FRAMEWORK 9
Introducing Hadoop – RDBMS versus Hadoop – Hadoop Overview – HDFS (Hadoop Distributed
File System) – Processing Data with Hadoop – Introduction to MapReduce – Features of
MapReduce – Algorithms Using Map-Reduce: Matrix-Vector Multiplication, Relational Algebra
Operations, Grouping and Aggregation – Extensions to MapReduce.
Suggested Activities:
TOTAL: 45 PERIODS
OUTCOMES:
On completion of the course, the student will be able to:
Identify the real world business problems and model with analytical solutions.
Solve analytical problem with relevant mathematics background knowledge.
Convert any real world decision making problem to hypothesis and apply suitable statistical
testing.
Write and Demonstrate simple applications involving analytics using Hadoop and
MapReduce
Use open source frameworks for modeling and storing data.
Apply suitable visualization technique using R for visualizing voluminous data.
REFERENCES:
1. Vignesh Prajapati, “Big Data Analytics with R and Hadoop”, Packt Publishing, 2013.
2. Umesh R Hodeghatta, Umesha Nayak, “Business Analytics Using R – A Practical
Approach”, Apress, 2017.
3. Anand Rajaraman, Jeffrey David Ullman, “Mining of Massive Datasets”, Cambridge
University Press, 2012.
4. Jeffrey D. Camm, James J. Cochran, Michael J. Fry, Jeffrey W. Ohlmann, David R.
Anderson, “Essentials of Business Analytics”, Cengage Learning, second Edition, 2016.
5. U. Dinesh Kumar, “Business Analytics: The Science of Data-Driven Decision Making”,
Wiley, 2017.
6. A. Ohri, “R for Business Analytics”, Springer, 2012
7. Rui Miguel Forte, “Mastering Predictive Analytics with R”, Packt Publication, 2015.
CO2 2 1 1 2 1 1
CO3 1 1 2 3 3 1
CO4 2 2 1 2 1 1
CO5 1 1 2 2 1 1
CO6 1 1 1 3 2 1
OBJECTIVES:
Summarize basics of industrial safety
Describe fundamentals of maintenance engineering
Explain wear and corrosion
Illustrate fault tracing
Identify preventive and periodic maintenance
UNIT I INTRODUCTION 9
Accident, causes, types, results and control, mechanical and electrical hazards, types, causes and
preventive steps/procedure, describe salient points of factories act 1948 for health and safety,
wash rooms, drinking water layouts, light, cleanliness, fire, guarding, pressure vessels, etc, Safety
color codes. Fire prevention and firefighting, equipment and methods.
TOTAL: 45 PERIODS
OUTCOMES:
Students will be able to:
CO1: Ability to summarize basics of industrial safety
CO2: Ability to describe fundamentals of maintenance engineering
CO3: Ability to explain wear and corrosion
CO4: Ability to illustrate fault tracing
CO5: Ability to identify preventive and periodic maintenance
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES:
1. Audels, Pump-hydraulic Compressors, Mcgrew Hill Publication, 1978.
2. Garg H P,Maintenance Engineering, S. Chand and Company,1987.
3. Hans F. Winterkorn, Foundation Engineering Handbook, Chapman & Hall London, 2013.
4. Higgins & Morrow, Maintenance Engineering Handbook, Eighth Edition,2008
OE5093 OPERATIONS RESEARCH LTPC
30 03
OBJECTIVES:
Solve linear programming problem and solve using graphical method.
Solve LPP using simplex method
Solve transportation, assignment problems
Solve project management problems
Solve scheduling problems
TOTAL: 45 PERIODS
OUTCOMES:
Students will be able to:
CO1: To formulate linear programming problem and solve using graphical method.
CO2: To solve LPP using simplex method
CO3: To formulate and solve transportation, assignment problems
CO4: To solve project management problems
CO5: To solve scheduling problems
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES:
1. Harvey M Wagner, Principles of Operations Research: Prentice Hall of India 2010
2. Hitler Libermann, Operations Research: McGraw Hill Pub. 2009
3. Pant J C, Introduction to Optimisation: Operations Research, Jain Brothers, Delhi, 2008
4. Pannerselvam, Operations Research: Prentice Hall of India 2010
5. Taha H A, Operations Research, An Introduction, PHI, 2008
OE5094 COST MANAGEMENT OF ENGINEERING PROJECTS LT PC
30 0 3
OBJECTIVES:
Summarize the costing concepts and their role in decision making
Infer the project management concepts and their various aspects in selection
Interpret costing concepts with project execution
Develop knowledge of costing techniques in service sector and various budgetary control
techniques
Illustrate with quantitative techniques in cost management
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES:
1.Ashish K. Bhattacharya, Principles & Practices of Cost Accounting A. H. Wheeler publisher,
1991
2. Charles T. Horngren and George Foster, Advanced Management Accounting, 1988
3. Charles T. Horngren et al Cost Accounting A Managerial Emphasis, Prentice Hall of India, New
Delhi, 2011
4. Robert S Kaplan Anthony A. Alkinson, Management & Cost Accounting, 2003
5. Vohra N.D., Quantitative Techniques in Management, Tata McGraw Hill Book Co. Ltd, 2007
UNIT I INTRODUCTION 9
Definition – Classification and characteristics of Composite materials - Advantages and application
of composites - Functional requirements of reinforcement and matrix - Effect of reinforcement
(size, shape, distribution, volume fraction) on overall composite performance.
UNIT II REINFORCEMENTS 9
Preparation-layup, curing, properties and applications of glass fibers, carbon fibers, Kevlar fibers
and Boron fibers - Properties and applications of whiskers, particle reinforcements - Mechanical
Behavior of composites: Rule of mixtures, Inverse rule of mixtures - Isostrain and Isostress
conditions.
UNIT V STRENGTH 9
Laminar Failure Criteria-strength ratio, maximum stress criteria, maximum strain criteria,
interacting failure criteria, hygrothermal failure. Laminate first play failure-insight strength;
Laminate strength-ply discount truncated maximum strain criterion; strength design using caplet
plots; stress concentrations.
TOTAL: 45 PERIODS
OUTCOMES:
Students will be able to:
CO1 - Know the characteristics of composite materials and effect of reinforcement in
composite materials.
CO2 – Know the various reinforcements used in composite materials.
CO3 – Understand the manufacturing processes of metal matrix composites.
CO4 – Understand the manufacturing processes of polymer matrix composites.
CO5 – Analyze the strength of composite materials.
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES:
1. Cahn R.W. - Material Science and Technology – Vol 13 – Composites, VCH, West
Germany.
2. Callister, W.D Jr., Adapted by Balasubramaniam R, Materials Science and Engineering, An
introduction, John Wiley & Sons, NY, Indian edition, 2007.
3. Chawla K.K., Composite Materials, 2013.
4. Lubin.G, Hand Book of Composite Materials, 2013.
OBJECTIVES:
Interpret the various types of wastes from which energy can be generated
Develop knowledge on biomass pyrolysis process and its applications
Develop knowledge on various types of biomass gasifiers and their operations
Invent knowledge on biomass combustors and its applications on generating energy
Summarize the principles of bio-energy systems and their features
OUTCOMES:
Students will be able to:
CO1 – Understand the various types of wastes from which energy can be generated
CO2 – Gain knowledge on biomass pyrolysis process and its applications
CO3 – Develop knowledge on various types of biomass gasifiers and their operations
CO4 – Gain knowledge on biomass combustors and its applications on generating energy
CO5 – Understand the principles of bio-energy systems and their features
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES:
1. Biogas Technology - A Practical Hand Book - Khandelwal, K. C. and Mahdi, S. S., Vol. I &
II, Tata McGraw Hill Publishing Co. Ltd., 1983.
2. Biomass Conversion and Technology, C. Y. WereKo-Brobby and E. B. Hagan, John Wiley &
Sons, 1996.
3. Food, Feed and Fuel from Biomass, Challal, D. S., IBH Publishing Co. Pvt. Ltd., 1991.
4. Non Conventional Energy, Desai, Ashok V., Wiley Eastern Ltd., 1990.
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES
1. Adrian Wallwork , English for Writing Research Papers, Springer New York Dordrecht
Heidelberg London, 2011
2. Day R How to Write and Publish a Scientific Paper, Cambridge University Press 2006
3. Goldbort R Writing for Science, Yale University Press (available on Google Books) 2006
4. Highman N, Handbook of Writing for the Mathematical Sciences, SIAM. Highman’s
book 1998.
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES
1. Goel S. L., Disaster Administration And Management Text And Case Studies”,Deep & Deep
Publication Pvt. Ltd., New Delhi,2009.
2. NishithaRai, Singh AK, “Disaster Management in India: Perspectives, issues and strategies
“’NewRoyal book Company,2007.
3. Sahni, PardeepEt.Al. ,” Disaster Mitigation Experiences And Reflections”, Prentice Hall
OfIndia, New Delhi,2001.
AX5093 SANSKRIT FOR TECHNICAL KNOWLEDGE L T P C
2 0 0 0
OBJECTIVES
Illustrate the basic sanskrit language.
Recognize sanskrit, the scientific language in the world.
Appraise learning of sanskrit to improve brain functioning.
Relate sanskrit to develop the logic in mathematics, science & other subjects enhancing the
memory power.
Extract huge knowledge from ancient literature.
UNIT I ALPHABETS 6
Alphabets in Sanskrit
UNIT II TENSES AND SENTENCES 6
Past/Present/Future Tense - Simple Sentences
UNIT III ORDER AND ROOTS 6
Order - Introduction of roots
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
CO5
REFERENCES
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, 2017.
UNIT III
Personality and Behavior Development-Soul and Scientific attitude. Positive Thinking. Integrity and
discipline. Punctuality, Love and Kindness. Avoid fault Thinking. Free from anger, Dignity of
labour.
Universal brother hood 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 IV
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.
TOTAL: 30 PERIODS
OUTCOMES
Students will be able to
Knowledge of self-development.
Learn the importance of Human values.
Developing the overall personality.
SUGGESTED READING
1. Chakroborty, S.K.“Values and Ethics for organizations Theory and practice”, Oxford University
Press, New Delhi
SUGGESTED READING
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.
SUGGESTED READING
1. Ackers J, HardmanF (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.
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: Amass scale, rapid, ‘learning to read’ campaign.
7. www.pratham.org/images/resource%20working%20paper%202.pdf
UNIT I
Definitions of Eight parts of yoga.(Ashtanga)
UNIT II
Yam and Niyam - Do`s and Don’t’s in life - i) Ahinsa, satya, astheya, bramhacharya and
aparigraha, ii) Ahinsa, satya, astheya, bramhacharya and aparigraha.
UNIT III
Asan and Pranayam - Various yog poses and their benefits for mind & body - Regularization of
breathing techniques and its effects-Types of pranayam
TOTAL: 30 PERIODS
OUTCOMES
Students will be able to:
Develop healthy mind in a healthy body thus improving social health also
Improve efficiency
SUGGESTED READING
1. ‘Yogic Asanas for Group Tarining-Part-I”:Janardan Swami Yoga bhyasi Mandal, Nagpur
2. “Rajayoga or conquering the Internal Nature” by Swami Vivekananda, Advaita Ashrama
(Publication Department), Kolkata
SUGGESTED READING
1. Gopinath, Rashtriya Sanskrit Sansthanam P, Bhartrihari’s Three Satakam, Niti-sringar-
vairagya, New Delhi,2010
2. Swami Swarupananda , Srimad Bhagavad Gita, Advaita Ashram, Publication Department,
Kolkata, 2016.