4-4 Autonomous Syllabus R-15 250418
4-4 Autonomous Syllabus R-15 250418
4-4 Autonomous Syllabus R-15 250418
Tech IT R(15)
SEM-1
1 IV/IV B.Tech IT Autonomous Syllabus R-15
CRYPTOGRAPHY & NETWORK SECURITY
COURSE IT412 CREDITS: 3
Instruction: 3 Periods & 1 Tut /week Sessional Marks: 40M
End Exam: 3 Hours End Exam Marks: 60M
COURSE OBJECTIVE:
1. Learn fundamentals of cryptography and its application to network security.
2. Understand network security threats, security services, and countermeasures. Including
basic encryption techniques, cryptographic algorithms, authentication and digital signature,
public key infrastructure, access control, security models, as well as their applications to IP
security, Web security, trusted operating systems.
3. Understand vulnerability analysis of network security.
4. Acquire background on hash functions; authentication; firewalls; intrusion detection
techniques.
COURSE OUTCOMES:
On completing this course student will be able to
CO1 Able to encrypt and decrypt information using some of the standard algorithms
CO2 To develop strategies to protect organization information assets from common attacks.
CO3 Understand how authentication is implemented in wireless systems
CO4 Acquire knowledge on the role of a “professional computing practitioner” with particular
regard to an understanding of legal and ethical issues
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 3
CO 2 3 2
CO 3 3 2
CO 4 3
Text Book:
I. William Stallings, Cryptography And Network Security, 4th Edition, (Pearson
Education/PHI).
II. Cryptography and Network security, Atul Kahate, Tata McGraw-Hill Pub company Ltd.,
New Delhi
Course Outcomes:
On completing this course student will be able to
CO PO CO PO PO PO PO PO PO PO PO PO PO1 PO1 PO
RELATIO 1 2 3 4 5 6 7 8 9 0 1 12
N MATRIX
CO 1 3 2 2 2 2 2
CO 2 2 2 2 2
CO 3 2 2 2 2
CO 4 2 2 2 2
SYLLABUS
UNIT IV (8 Periods)
Introduction to Hive : Hive and Hive Architecture, Hive Data Types, Hive File Format ,Hive
Query Language (HQL) , RCFile Implementation ,SerDe , User-Defined Function (UDF)
Introduction to Pig : Pig and Anatomy of Pig ,Pig on Hadoop ,Pig Philosophy ,Use Case for Pig:
ETL Processing ,Pig Latin Overview ,Data Types in Pig ,Running Pig , Execution Modes of
Pig,HDFS Commands ,Relational Operators , Eval Function ,Complex Data Types, Piggy Bank
User-Defined Functions (UDF) ,Parameter Substitution ,Diagnostic Operator , Word Count
Example using Pig , When to use Pig?, When not to use Pig? , Pig at Yahoo!, Pig versus Hive
Textbooks:
1. Seema Acharya and Subhashini Chellappan , Big Data and Analytics , Wiley publication
Reference Books:
1. Dirk deRoos, Chris Eaton, George Lapis, Paul Zikopoulos, Tom Deutsch ,“Understanding Big
Data Analytics for Enterprise Class Hadoop and Streaming Data”, 1st Edition, TMH,2012.
2. Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’reilly
COURSE OBJECTIVE:
This course has been designed to:
Explain how heuristics offer ways to pursue goals in exponentially large search spaces
Describe the representation and use of knowledge in inference-based problem solving by
knowledge-based agents
Apply probability theory to describe and model agents operating in uncertain
environments
Describe ways to supervise agents to learn and improve their behavior
Explain adaptive learning from the environment
Relate theories of mind and the future of AI to ethical issues raised by artificial
cognitive systems
COURSE OUTCOMES:
A student completing this course will be able to:
CO1 Understand the concepts of State Space and Heuristic Search Algorithms.
CO2 Solve problems in propositional logic, predicate calculus and other axiomatic systems.
CO3 Understand the role of knowledge representation, problem solving and learning in
intelligent systems.
CO4 Differentiate traditional systems and various Rule-based and Expert Systems.
CO5 Understand the working of different categories of Neural Networks.
CO PO CO
RELATION
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
PO1
CO 1 1 2 3 3 3
CO 2 1 2 3 3 3 2
CO 3 1 2 2 3 3 3 2
CO 4 1 3 3 2
Text Books:
1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning,
2. Robert J. Schilling, Fundamentals of Robotics Analysis and Control, PHI Learning.,
2009.
Reference Books:
I. Artificial intelligence, structures and Strategies for Complex problem solving,
George.F.Lugar, 5th edition, PEA
II. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
III. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier
COURSE OBJECTIVE:
This course covers the design of advanced modern computing systems. In particular, the design
of modern microprocessors, characteristics of the memory hierarchy, and issues involved in
multi-threading and multi-processing are discussed. The main objective of this course is to
provide students with an understanding and appreciation of the fundamental issues and tradeoffs
involved in the design and evaluation of modern computers
COURSE OUTCOMES:
Understand the concepts and terminology of high performance computing
CO1 Can analyze the need for high performance and parallel programming models.
CO2 Can write and analyze the behavior of high performance parallel programs for distributed
memory architectures (using MPI).
CO3 Can write and analyze the behavior of high performance parallel programs for shared
memory architectures (using Pthreads and OpenMP).
CO4 Can write simple programs for the GPU.
CO PO CO
RELATION
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
PO1
CO 1 3 2 2 2 2 2 3 2
CO 2 2 2 2 2 2
CO 3 3 2 2 2 2 2 3 2
CO 4 3 2 2 2 2 2 3 2
Text Books:
1. An Introduction to Parallel Programming, Peter S Pacheco, Elsevier, 2011
2. Programming Massively Parallel Processors A hands‐on Approach By David B. Kirk and
Wen‐mei W. Hwu, Morgan Kaufmann, 2010.
3. Programming Massively Parallel Processors, Kirk & Hwu, Elsevier, 2012
Reference Books:
I. CUDA by example: An introduction to General Purpose GPU Programming, Jason, Sanders, .
Edward Kandrit, Perason, 2011
II. CUDA Programming, Shame Cook, Elsevier
III. High Performance Heterogeneous Computing, Jack Dongarra, Alexey & Lastovetsky, Wiley
IV. Parallel computing theory and practice, Michel J.Quinn, TMH
COURSE OBJECTIVE:
1. To introduce the basic concepts of Data Warehouse and Data Mining techniques.
2. Examine the types of the data to be mined and apply preprocessing methods on raw data.
3. Discover interesting patterns, analyze supervised and unsupervised models and estimate the
accuracy of the algorithms.
COURSE OUTCOMES:
Students who complete this course should be able to:
CO1 Understand why there is a need for data warehouse in addition to traditional operational
database systems.
CO2 Identify components in typical data warehouse architectures.
CO3 Understand why there is a need for data mining and in what ways it is different from
traditional statistical techniques.
CO4 Understand the details of different algorithms made available by popular commercial data
mining software.
CO PO CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
RELATION
MATRIX
CO 1 3 2 2 2 2 2 3 2
CO 2 2 2 2 2 2
CO 3 3 2 2 2 2 2 3 2
CO 4 3 2 2 2 2 2 3 2
Cluster Analysis: What is Cluster Analysis, Types of Data in Cluster Analysis, A Categorization of Major
Clustering Methods, Partitioning algorithms
Text Books:
1. Data Mining Concepts and Techniques Jiawei Han and Micheline Kamber Morgan Kaufman
Publications
Reference Books:
I. Data Mining Introductory and Advanced Topics, Margaret H Dunhan, Pearson Education.
II. Data Mining, Ian H. Witten Eibe Frank, Morgan Kaufman Publications.
III. Data Mining by Tan, Steinbach, Vipin Kumar, Pearson Education.
COURSE OBJECTIVE:
1. To outline the need for Software Project Management
2. To highlight different techniques for software cost estimation and activity planning
COURSE OUTCOMES:
Upon the successful completion of the course, students will be able to:
CO1 Understand the principles of software project management
CO2 Demonstrate cost estimation
CO3 Understand risk management and control the project
CO4 Manage the software project
CO PO CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
RELATION
MATRIX
CO 1 3 2 2 2 2 3 - 3 1 - 1 3
CO 2 3 3 3 3 3 2 - 3 3 - 3 3
CO 3 2 3 3 3 3 3 - 3 2 - 2 3
CO 4 2 2 2 2 3 2 - 2 2 - 2 3
Activity planning and risk management: Objectives of Activity planning – Project schedules –
Activities – Sequencing and scheduling – Network Planning models – Forward Pass &
Backward Pass techniques – Critical path (CRM) method – Risk identification – Assessment –
Monitoring – PERT technique – Monte Carlo simulation – Resource Allocation – Creation of
critical patterns – Cost schedules.
Text Books:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth
Edition, Tata McGraw Hill, New Delhi, 2012.
Reference Books:
I. Robert K. Wysocki “Effective Software Project Management” – Wiley Publication,2011.
II. Walker Royce: “Software Project Management”- Addison-Wesley, 1998.
COURSE OBJECTIVE:
I. The objective of this course is to give students basic knowledge about the key algorithms
and theory that form the foundation of machine learning.
II. Identify and apply the appropriate Machine learning technique to classification, Pattern
Recognition, and Optimization and Decision problems.
COURSE OUTCOMES:
Student will be able to
CO 1 Identify the applications of Machine learning and able to state the developing of Learning
System.
CO 2 Classify Decision Tree Learning Algorithms for learning of appropriate problems.
CO 3 Use Learning Algorithms to classify text by applying various Classification Algorithms.
CO 4 Formulate Computational Learning Theory for Finite and Infinite hypothesis spaces.
CO 5 Generate Rule Sets and setup First Order Rules.
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 2 3 3 3
CO 2 2 3 3 3
CO 3 2 3 3 3
CO 4 2 3 3 3
Text Books:
1. Machine Learning, Tom M.Mitchell, MGH
Reference Books:
I. Introduction to machine Learning, 2nd ed, Ethem Alpaydin, PHI
II. Baldi, P. and Brunak, S. (2002). Bioinformatics: A Machine Learning Approach.
Cambridge, MA: MIT Press.
III. Kearns, M. and Vazirani, U. (1994). Computational Learning Theory. Cambridge, MA:
MIT Press.
COURSE OBJECTIVE:
Ability to demonstrate storage area networks and their products and to provide the mechanisms
for backup/recovery.
COURSE OUTCOMES:
Understand the concepts and terminology of high performance computing
CO 1 Understand Storage Area Networks characteristics and components.
CO 2 Become familiar with the SAN application environment, network storage and topologies
CO 3 Identifying the issues and down time’s in relation with the SAN failure
CO 4 Understand the technology related to back up’s
CO 5 Analyze and understand the security and monitoring aspects in SAN’s
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 1 1 1 1 2
CO 2 2 2 2 1 1 2
CO 3 2 2 1 1 2
CO 4 2 3 1 2 1 2
Text Books:
1. EMC Corporation, Information Storage and Management, Wiley.
Reference Books:
I. Robert Spalding, “Storage Networks: The Complete Reference”, Tata McGraw Hill, Osborne,
2003.
II. Marc Farley, “Building Storage Networks”, Tata McGraw Hill, Osborne, 2001.
III. Meeta Gupta, Storage Area Network Fundamentals, Pearson Education Limited, 2002.
COURSE OBJECTIVE:
COURSE OUTCOMES:
Understand the concepts and terminology of high performance computing
CO 1 analyze users’ needs, usability goals and user experience goals of a software application
CO 2 use software prototyping tools to design user interfaces that take into account human
capabilities and constraints, users’ needs, usability goals
CO 3 implement functional user interface prototypes based on the design process
CO 4 critically evaluate the usability of software application
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 1 2 3 3 2 3 3
CO 2 1 3 3 3 2 3 3
CO 3 1 3 3 3 2 3 3
CO 4 1 2 3 3 2 3 3
Text Book:
1. Ben Sheiderman, “Design The User Interface”, Pearson Education, 1998.
Reference Books:
I. Wilbent. O. Galitz ,“The Essential Guide To User Interface Design”, John Wiley& Sons, 2001.
Alan Cooper, “The Essential Of User Interface Design”, Wiley – Dream Tech Ltd., 2002
COURSE OBJECTIVE:
Identify Big Data and its Business Implications.
List the components of Hadoop and Hadoop Eco-System
Access and Process Data on Distributed File System
Manage Job Execution in Hadoop Environment
COURSE OUTCOMES:
CO PO CO
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1
RELATIO
1 2 3 4 5 6 7 8 9 0 1 2
N MATRIX
CO 1 3 2 2 2 2 2 3
CO 2 2 2 2 2 2
CO 3 2 2 2 2 2
CO 4 2 2 2 2 2
Reference Book:
1. Hadoop Map Reduce Cookbook, Srinath Perera & Thilina Gunarathne, 2013, PACKT
PUBLISHING.
COURSE OBJECTIVES:
1) Learn to implement the algorithms DES, RSA,MD5,SHA-1
2) Learn to use network security tools like GnuPG, KFsensor, Net Strumbler
COURSE OUTCOMES:
At the end of the course, the student should be able to:
1) Implement the cipher techniques
2) Develop the various security algorithms
3) Use different open source tools for network security and analysis
LIST OF EXPERIMENTS:
1. Implement the following SUBSTITUTION & TRANSPOSITION TECHNIQUES concepts:
a) Caesar Cipher
b) Playfair Cipher
c) Hill Cipher
SOFTWARE REQUIREMENTS
Java or equivalent compiler GnuPG
KF Sensor or Equivalent
Snort
Net Stumbler or Equivalent
FireHOL
Nmap
HARDWARE REQUIREMENTS
SEM-2
26 IV/IV B.Tech IT Autonomous Syllabus R-15
SOFT COMPUTING
COURSE IT421(A) CREDITS: 4
Instruction: 4 Periods & 1 Tut. /Week Sessional Marks: 40
End- Exam: 3 Hours End Exam Marks: 60
COURSE OBJECTIVE:
The course would aim to make the student understand the basic idea of problem solving through
the principles of soft computing, which would be seen as a well-balanced integration of fuzzy
logic, evolutionary computing, and neural information processing.
To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human
experience.
To familiarize with genetic algorithms.
To become familiar with neural networks that can learn from available examples and
generalize to form appropriate rules for inferencing systems.
To provide the mathematical background for carrying out the optimization associated with neural
network learning.
COURSE OUTCOMES:
Upon completion of the course, students should:
CO1 Identify and describe soft computing techniques and their roles in building intelligent
systems.
CO2 Recognize the feasibility of applying a soft computing methodology for a particular
problem.
CO3 Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems.
CO4 Apply genetic algorithms to combinatorial optimization problems.
CO5 Apply neural networks to pattern classification and regression problems.
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 3 2 2 3 2 2
CO 2 3 3 3 3 2 3 3 3 3
CO 3 3 3 3 3 3 3 3 3 3
CO 4 3 3 3 3 3 3 3 3 3
CO 5 3 3 3 3 3 3 3 3 3
Text Books:
1. J.S.R. Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing” PHI/Pearson
Education, New Delhi 2004.
Reference Books:
I. T. J. Ross, “Fuzzy Logic with Engineering Applications.” TMH, New York, 1997.
II. D. E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning,
Addison Wesley, 3rd Ed.
III. B. Kosko, Neural Network and fuzzy systems, Prentice Hall of India, 2006
IV. Kecman, Learning and Soft Computing, Pearson, 1st Ed, 2001.
Instructor
COURSE OBJECTIVE:
Use the Innovation Canvas to justify potentially successful products.
Explain various ways in which to develop a product idea.
COURSE OUTCOMES:
Upon successful completion of the course, the student will be able to:
1. Understand applications in Cognitive Computing.
2. Understand Natural language processor role in Cognitive computing .
3. Learn future directions of Cognitive Computing.
4. Evaluate the process of taking a product to market.
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 1 2 3 3 2 3 3
CO 2 1 3 3 3 2 3 3
CO 3 1 3 3 3 2 3 3
CO 4 1 2 3 3 2 3 3
CO 5 1 2 3 3 2 3 3
SYLLABUS
UNIT I (chapter 1 & 2) (13 Periods)
Foundation of Cognitive Computing: cognitive computing as a new generation, the uses of
cognitive systems, system cognitive, gaining insights from data, Artificial Intelligence as the
foundation of cognitive computing, understanding cognition
Design Principles for Cognitive Systems:
Components of a cognitive system, building the corpus, bringing data into cognitive system,
machine learning, hypotheses generation and scoring, presentation and visualization services
TEXTBOOK:
I. Judith H Hurwitz, Marcia Kaufman, Adrian Bowles , “Cognitive computing and Big
Data Analytics” , Wiley
COURSE OBJECTIVE:
The objective of this course is to provide graduate students of B.Tech Information Technology with the
comprehensive and in-depth knowledge of Cloud Computing concepts, technologies, architecture and
applications by introducing and researching state of the art in Cloud Computing fundamental issues,
technologies, applications and implementations.
COURSE OUTCOMES:
Upon successful completion of the course, the student will be able to:
CO1 Understand the evolution of cloud computing paradigm and its architecture
CO2 Explain and characterize different cloud deployment models, service models and technological
drivers
CO3 Understand the programming model and application environment including the role of the
Operating systems
CO4 Analyze open source support and networking of cloud
CO5 Identify the security issues in cloud computing
CO PO CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
RELATION
MATRIX
CO 1 3 1 1 1
CO 2 3 2 1 1 2 3
CO 3 3 2 3 2 3
CO 4 3 2 2 1 2 1 2 3
CO 5 3 1 1 1 2 2 3
SYLLABUS
UNIT I : (Text Book 1) (15 Periods)
Computing Paradigms: High-Performance Computing, Parallel Computing, Distributed Computing,
Cluster Computing, Grid Computing, Cloud Computing, Biocomputing, Mobile Computing, Quantum
Computing, Optical Computing, Nano computing, Network Computing
Cloud Computing Fundamentals: Motivation for Cloud Computing: The Need for Cloud Computing.
Defining Cloud Computing: NIST Definition of Cloud Computing, Cloud Computing Is a Service, Cloud
Computing Is a Platform 5-4-3 Principles of Cloud computing: Five Essential Characteristics, Four Cloud
Deployment Models, Three Service Offering Models Cloud Ecosystem, Requirements for Cloud
Services, Cloud Application, Benefits and Drawbacks Cloud Computing Architecture and
Management : Cloud Architecture, Anatomy of the Cloud, Network Connectivity in Cloud Computing,
Applications on the Cloud, Managing the Cloud, Migrating Application to Cloud
Course Objectives:
To provide knowledge about the protocols, methods, security issues in electronic commerce
as well as about enterprise resource planning tools, models and techniques.
Course Outcomes:
Upon the successful completion of the course, students will be able to:
CO1 Understand the fundamental concepts of Electronic commerce environment and modes
CO2 Identify the approaches and authenticative methods for safe E-Commerce
CO3 Apply secure E-mail technologies for E-Commerce
CO4 Use the key aspects of Internet Resources for Commerce, internet Access
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 3 2 2 2 2 3 - 3 1 - 1 3
CO 2 3 3 3 3 3 2 - 3 3 - 3 3
CO 3 2 3 3 3 3 3 - 3 2 - 2 3
CO 4 2 2 2 2 3 2 - 2 2 - 2 3
CO 5 3 2 2 2 2 3 - 3 1 - 1 3
SYLLABUS
UNIT-I: PERIODS-14
Electronic commerce environment and opportunities: Back ground – The Electronic commerce
Environment – Electronic Market Place Technologies.
Modes of electronic commerce: Overview – EDI – Migration to open EDI – E commerce with
WWW/Internet – Commerce Net Advocacy – Web commerce going forward.
UNIT-II: PERIODS-12
Approaches to safe electronic Commerce – Overview – Source – Transport Protocols – Secure
Transactions – Secure Electronic Payment Protocol – Secure Electronic Transaction –
Certificates for Authentication – Security on Web Servers and enterprise networks.
UNIT-III: PERIODS-14
Electronic cash and electronic payment schemes – Internet Monitory Payment and Security
requirements – payment and purchase order process – online electronic cash.
Master card/ Visa Secure electronic transaction: Introduction – Business requirements - Concepts
- Payment Processing.
UNIT-V: PERIODS-12
Internet Resources for Commerce: Introduction – Technologies for Web Servers – Internet
Applications for commerce – Internet Charges – Internet Access and Architecture – Searching
the Internet.
Text Books:
I. Web Commerce Technology Hand Book Daniel Minoli, Emma Minoli McGraw Hill, First
Edition.
Reference Books:
I. Frontiers of Electronic Commerce Ravi Kalakotar, Andrew B.Whinston, Pearson
Education.
Course Objectives:
Cover the basic theory and algorithms that are widely used in digital image processing.
Expose students to current technologies and issues that are specific to image processing
systems.
Hands-on experience in using computers to process images.
Formulate solutions to general image processing problems
Familiar with image manipulations and analysis
Course Outcomes:
Upon the successful completion of the course, students will be able to:
CO1 Explain Basic Concepts in Image Processing and various color models
CO2 Apply Spatial Domain Techniques for Image Enhancement
CO3 List the Image Compression Techniques
CO4 Discuss Various Morphological Algorithms
CO5 Classify Various Image Segmentation Techniques
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 2 3 3 3 3 3 3 3 3
CO 2 2 2 3 3 3 3 3 3 3
CO 3 2 3 3 3 3 3 3 3 3
CO 4 2 3 3 3 3 3 3 3 3
CO 5 2 3 3 3 3 3 3 3 3
Text Books:
1. Digital Image Processing – R.C. Gonzalez & R.E. Woods, Addison Wesley / Pearson
Education, 3rd Edition, 2010.
Reference Books:
I. Fundamentals of Digital Image Processing-A.K. Jain, PHI.
COURSE OUTCOMES:
Understand the concepts and terminology of high performance computing
CO 1 Understand cyber crimes and types of cyber attacks
CO 2 Know how to prevent themselves from cyber attacks
CO 3 Identify applicable cyber laws
CO PO CO
RELATION PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
MATRIX
CO 1 1 2 2 3
CO 2 3 3 3 3 3
CO 3 2 3 3 3 3
Text Books:
1. Nina Godbole & Sunit Belapure “Cyber Security”, Wiley India, 2012.
Reference Books:
II. Harish Chander, “cyber laws & IT protection”, PHI learning pvt.ltd, 2012.
III. Dhiren R Patel, “Information security theory & practice”,PHI learning pvt ltd,2010.
IV. MS.M.K.Geetha & Ms.Swapne Raman”Cyber Crimes and Fraud Management, ”MACMILLAN,
2012.
V. Pankaj Agarwal : Information Security & Cyber Laws (Acme Learning), Excel, 2013.
VI. Vivek Sood, Cyber Law Simplified, TMH, 2012.
COURSE OUTCOMES:
After completion of this course, a student will be able to:
CO 1 Understand the fundamental concepts of ERP systems their architecture, and working of different
modules in ERP.
CO 2 Know how to implement activities of ERP project management cycle
CO 3 Understand the emerging trends in ERP developments.
CO PO
CO
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
RELATI
1 2 3 4 5 6 7 8 9 0 1 2 1 2
ON
MATRIX
CO 1 2 3 2
CO 2 3 3 3 3 3
CO 3 3 3 3 3
Text Books:
1. Alexis Leon, ERP demystified, second Edition Tata McGraw-Hill, 2008.
Reference Books:
I. Sinha P. Magal and Jeffery Word, Essentials of Business Process and Information System, Wiley
India, 2012
II. Jagan Nathan Vaman, ERP in Practice, Tata McGraw-Hill, 2008
III. Alexis Leon, Enterprise Resource Planning, second edition, Tata McGraw-Hill, 2008.
IV. Mahadeo Jaiswal and Ganesh Vanapalli, ERP Macmillan India, 2009
V. Vinod Kumar Grag and N.K. Venkitakrishnan, ERP- Concepts and Practice, Prentice Hall of
India, 2006.
VI. Summer, ERP, Pearson Education, 2008
COURSE OUTCOMES:
After completion of this course, a student will be able to:
CO 1 Understand the concepts of Internet of Things
CO 2 Know basic communication protocols in IoT
CO 3 Design IoT applications in different domains and Implement basic IoT applications on embedded
platforms
CO4 Learn real world application scenarios of IoT along with its societal and economic impact using case
studies.
CO PO
CO
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO
RELATI
1 2 3 4 5 6 7 8 9 0 1 2 1 2
ON
MATRIX
CO 1 1 2 1
CO 2 2 2 2
CO 3 3 3 3 3 3
CO 4 3 3 3 2 2 3
Text books
1. Arshdeep Bahga, Vijay Madisetti, “Internet of Things – A hands-on approach”,
Universities Press, ISBN: 0: 0996025510, 13: 978-0996025515
2. Honbo Zhou, “The Internet of Things in the Cloud: A Middleware Perspective”, CRC
Press, 2012.
ISBN : 9781439892992
3. Dieter Uckelmann, Mark Harrison, Florian Michahelles, “Architecting the Internet
of Things”, Springer, 2011. ISBN: 978-3-642-19156-5
Reference Books:
I. David Easley and Jon Kleinberg, “Networks, Crowds, and Markets: Reasoning About a Highly
Connected World”, Cambridge University Press, 2010, ISBN:10: 0521195330