CHRIST (Deemed to University), Bangalore

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

School of Engineering and Technology

Syllabus for
Master of Technology (Data Science)
Academic Year  (2024)

 
1 Semester - 2024 - Batch
Course Code
Course
Type
Hours Per
Week
Credits
Marks
MTAC121 CYBER SECURITY Audit Courses 2 0 0
MTCS132 ADVANCED DATABASE SYSTEMS Core Courses 3 3 100
MTCS152 ADVANCED DATABASE SYSTEMS LAB Core Courses 4 2 50
MTDS131 ADVANCED DATA STRUCTURES AND ALGORITHMS Core Courses 4 3 100
MTDS131E02 PYTHON & R PROGRAMMING Core Courses 6 4 100
MTDS131E06 BIGDATA TECHNOLOGY Core Courses 6 4 100
MTDS151 ADVANCED DATA STRUCTURES AND ALGORITHMS LAB Core Courses 4 2 50
MTMC125 RESEARCH METHODOLOGY AND IPR Core Courses 3 3 100
2 Semester - 2024 - Batch
Course Code
Course
Type
Hours Per
Week
Credits
Marks
MTAC224 ETHICAL HACKING - 2 0 0
MTDS231E06 ADV BIGDATA TECHNOLOGY - 6 4 100
MTDS231E07 DATA VISUALIZATION - ANALYSIS & REPORTING - 6 4 100
MTDS232 BUSINESS INTELLIGENCE AND ITS APPLICATIONS - 4 3 100
MTDS233 MACHINE LEARNING FOR DATA SCIENCE - 4 3 100
MTDS281 PROJECT WORK - 6 3 100
3 Semester - 2023 - Batch
Course Code
Course
Type
Hours Per
Week
Credits
Marks
MTDS343E02 IOT ARCHITECTURE & COMPUTING Interdisciplinary Elective Courses 3 3 100
MTDS381 INTERNSHIP Project 4 2 50
MTDS382 DISSERTATION PHASE I Project 16 08 200
MTVL342E01 COMPRESSION AND ENCRYPTION TECHNIQUES Interdisciplinary Elective Courses 3 3 100
4 Semester - 2023 - Batch
Course Code
Course
Type
Hours Per
Week
Credits
Marks
MTDS483 DISSERTATION PHASE - II - 30 15 200
    

    

Introduction to Program:

M. Tech in Data Science is a two year, four semester post-graduate programme with an objective to impart the knowledge on methodologies, techniques and concepts related to data science which includes mathematics, statistics, data warehousing, data mining, machine learning and visualization techniques. The main objective of this program is to provide one of the best post graduate education to students so that they can meet the growing regional, national and international need for highly qualified personnel in the fields of data science, natural language processing and artificial intelligence. The curriculum is framed by experienced academic and industrial expertise, by considering current as well as future demands of enterprises. 

 

Programme Outcome/Programme Learning Goals/Programme Learning Outcome:

PO1: PO1: Acquire in-depth knowledge of specific discipline or professional area, including wider and global perspective, with an ability to discriminate, evaluate, analyze and synthesize existing and new knowledge, and integration of the same for enhancement of knowledge.

PO2: PO2: Analyze complex engineering problems critically, apply independent judgment for synthesizing information to make intellectual and/or creative advances for conducting research in a wider theoretical, practical and policy context.

PO3: PO3: Think laterally and originally, conceptualize and solve engineering problems, evaluate a wide range of potential solutions for those problems and arrive at feasible, optimal solutions after considering public health and safety, cultural, societal and environmental factors in the core areas of expertise.

PO4: PO4: Apply basic and advanced Data Science knowledge that prepares for efficiency, leadership roles in a variety of career paths and integrates ethics.

PO5: PO5: Develop domain knowledge in mathematical, statistical, Data Science and AI techniques to create modelling, analysis and processing of large multidimensional data sets.

PO6: PO6: Analyze, evaluate and build complex data models using suitable software tools to process large amount of streaming datasets.

Assesment Pattern

Theory Courses (Assessment Pattern)

 

CIA I  - 25 Marks

 

CIA II - 25 Marks

 

Test I - 25 Marks

 

Test II - 25 Marks

 

Total Marks - 100 Marks

 

 

 

Practical Courses (Assessment Pattern)

 

CIA - 20 Marks

 

Test 1 - 15 Marks

 

Test 2 - 15 Marks

 

Total Marks = 50 Marks

 

Examination And Assesments

Assessments(Theory & Practical)

  •  Continuous Internal Assessment (CIA) for Theory = 100 Marks
  •  Continuous Internal Assessment (CIA) for Practical  = 50 Marks

 

MTAC121 - CYBER SECURITY (2024 Batch)

Total Teaching Hours for Semester:30
No of Lecture Hours/Week:2
Max Marks:0
Credits:0

Course Objectives/Course Description

 

This course is aimed at providing a comprehensive overview of the different facets of Cyber Security.  In addition, the course will detail into specifics of Cyber Security with Cyber Laws both in Global and Indian Legal environments.

Course Outcome

CO1: Summarize the network security concepts and cyber laws

CO2: Explain different cyber attacks with relevant examples

CO3: Illustrate risk management process handled in the organization with business continuity planning

CO4: Outline the vulnerabilities that affect the organizational network

CO5: Demonstrate cryptography algorithms for authentication purposes in the organizational network

Unit-1
Teaching Hours:6
Security Fundamentals
 

Security Fundamentals-4 As Architecture Authentication Authorization Accountability, Social Media, Social Networking and Cyber Security. Cyber Laws, IT Act 2000-IT Act 2008-Laws for Cyber-Security, Comprehensive National Cyber-Security Initiative CNCI – Legalities.

Unit-2
Teaching Hours:6
Cyber Attack and Cyber Services
 

Cyber Attack and Cyber Services Computer Virus – Computer Worms – Trojan horse. Vulnerabilities -  Phishing -  Online Attacks – Pharming - Phoarging    Cyber Attacks  -  Cyber Threats -  Zombie- stuxnet - Denial of Service Vulnerabilities  - Server Hardening-TCP/IP attack-SYN Flood.

Text Books And Reference Books:

T1. Matt Bishop, “Introduction to Computer Security”, Pearson, 6th impression, 2005

Essential Reading / Recommended Reading

R1. Thomas R, Justin Peltier, John, “Information Security Fundamentals”, Auerbach Publications.

R2. AtulKahate, “Cryptography and Network Security”, 2nd Edition, Tata McGrawHill.

R3. Nina Godbole, SunitBelapure, “Cyber Security”, Wiley India 1st Edition 2011.

R4. .Jennifer L. Bayuk and Jason Healey and Paul Rohmeyer and Marcus Sachs, “Cyber Security Policy Guidebook”, Wiley; 1 edition , 2012

R5. Dan Shoemaker and Wm. Arthur Conklin, “Cybersecurity: The Essential Body Of Knowledge”,   Delmar Cengage Learning; 1 edition (May 17, 2011) .

R6.William Stallings, “Cryptography & Network Security - Principles & Practice”, Prentice Hall, 3rdEdition2002.

Evaluation Pattern

NA

MTCS132 - ADVANCED DATABASE SYSTEMS (2024 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

Data-driven decision making is becoming more common in organizations and businesses. In fact, database systems are at the center of the information systems strategies of most organizations. Users at any level of an organization can expect to work with and use database systems often. So, the ability to use these systems, which includes knowing what they can do and what they can't do, figuring out whether to access data directly or through technical experts, and knowing how to find and use the information well, became essential in every industry. Also, being able to design new systems and applications for them is a clear advantage and a necessity in the modern world. One type of database system that is widely used and the main focus of this course is the Relational Database Management System (RDBMS).

Course Outcome

CO1: Explain the fundamentals of Database systems.

CO2: Apply the bottom-up method to build the database.

CO3: Examine the basics and advanced concepts of SQL.

CO4: Examine the usage of Constraints and Triggers on database tables

CO5: Explain the various concepts of transactional processing and Object-Orientation in Query Languages.

Unit-1
Teaching Hours:9
Introduction to DBS
 

Database Management systems Application of DBMS, Advantages of DBMS-ER model, Components of E-R diagram, Cardinality – Relational databases, Converting ER Diagram into Relations/Tables.

 

Unit-2
Teaching Hours:9
Normalization Database Design Theory
 

Introduction to Normalization using Functional and Multivalued Dependencies: Informal design guidelines for relation schema, Functional Dependencies, Normal Forms based on Primary Keys, Second and Third Normal Forms

Text Books And Reference Books:

T1. Fundamentals of Database Management systems by Ramez Elmasri and Shamkant B. Navathe, 7th Edition, 2017, Pearson.

Essential Reading / Recommended Reading

R1. Database Systems: The Complete Book by  Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom, Pearson Education India; 2nd edition (1 January 2013)

Evaluation Pattern

Assessment Details:

 

  1. Continuous Internal Assessment (CIA)       :  50  marks

  2. End Semester Examination(ESE) - Theory   : 50 marks

MTCS152 - ADVANCED DATABASE SYSTEMS LAB (2024 Batch)

Total Teaching Hours for Semester:60
No of Lecture Hours/Week:4
Max Marks:50
Credits:2

Course Objectives/Course Description

 

Course will give students a chance to use what they learn in the lectures, homework, SQL assignments, and a database implementation project.

Course Outcome

CO1: Examine the basics and advanced concepts of SQL.

CO2: Analyze the transaction processing through PL/SQL programs

CO3: Implement database management process using cursors and triggers

Unit-1
Teaching Hours:60
Experiments on DBMS
 

Title1: Study of all SQL commands.  

7hours

Title2: Study of all SQL commands.

7hours

Title3:Study of all SQL commands.

7hours

Title4:Implementation of PL/SQL Programs.

7hours

Title5: Implementation of PL/SQL Programs.

7hours

Title6:Implementation of PL/SQL Programs.

7hours

Title7: Implementation of Cursor, Trigger.  

18hours

Text Books And Reference Books:

T1. Fundamentals of Database Management systems by Ramez Elmasri and Shamkant B. Navathe, 7th Edition, 2017, Pearson.

Essential Reading / Recommended Reading

R1. Database Systems: The Complete Book by  Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom, Pearson Education India; 2nd edition (1 January 2013)

Evaluation Pattern

Assessment Details:

CIA 50 %

ESE 50 %

Total Marks= 50

MTDS131 - ADVANCED DATA STRUCTURES AND ALGORITHMS (2024 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:4
Max Marks:100
Credits:3

Course Objectives/Course Description

 

Course Description:

This course helps students to understand the basic concept of data structures for storing and retrieving ordered or unordered data. It describes the data structures including arrays, linked lists, binary trees, heaps, and hash tables.

Course Objective:

1. To analyse the asymptotic performance of algorithms

2. To demonstrate their familiarity with major data structures, rule to manipulate those, and their canonical applications

3. To construct efficient algorithms for some common computer engineering design problems

Course Outcome

CO1: Summarize the efficiency of algorithms.

CO2: Experiment with various operations on Linear Data structures.

CO3: Analyze various Non- Linear Data structures and Hashing techniques

CO4: Compare different sorting techniques with respect to time complexity.

CO5: Examine the graph algorithms in various applications of graph traversal, shortest path and sorting techniques

Unit-1
Teaching Hours:9
COMPLEXITY ANALYSIS
 

Time and Space complexity of algorithms, asymptotic analysis, average and worst case analysis, asymptotic notation, the importance of efficient algorithms.

Unit-2
Teaching Hours:9
LISTS, STACKS AND QUEUES
 

The Queue ADT: Definition, Array representation of queue, Types of queues: Simple queue, circular queue, double ended queue (de-queue) priority queue, operations on all types of Queues. The List ADT: singly linked list implementation, insertion, deletion and searching operations on linear list, circular linked list implementation, Double linked list implementation, insertion, deletion and searching operations. Applications of Linked List.

Text Books And Reference Books:

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education.

Essential Reading / Recommended Reading

R1. Fundamentals of data structure in C by Ellis Horowitz, Sarataj Shani 3rd edition, Galgotia book source PVT, 2010.

R2. NPTEL Course on “Data Structure and Algorithms Using JAVA” by Debasis Samanta, IIT Kharagpur.

R3. NPTEL Course on “Design and Analysis of Algorithms” by Madhavan Mukund, IIT Madras

Evaluation Pattern

Assessment Details:

  1. Continuous Internal Assessment (CIA)       :  50  marks

  2. End Semester Examination(ESE) - Theory   : 50 marks

MTDS131E02 - PYTHON & R PROGRAMMING (2024 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:6
Max Marks:100
Credits:4

Course Objectives/Course Description

 

To introduce the student to Python programming & R programming concepts.

Course Outcome

CO1: Write Python and R programs to solve real-world data analysis problems.

CO2: Apply the strengths of Python and R for different data analysis tasks.

CO3: Develop reusable functions and scripts in Python and R to automate data analysis workflows.

Unit-1
Teaching Hours:40
Python Programming
 

Introduction to Python: Basic Syntax, Data Types, Variables, Operators, Input/output, Flow of Control (Modules, Branching, Looping), Strings, Dictionaries, Lists, Function and Methods, Anonymous functions(Lambda, Map, List comprehension), Global and local variables, Concepts of Modules, Tuples, Object Oriented Python, Object Oriented Linux Environment, Exception Handling, Working with Pandas and Numpy, Working with beautiful soup, matplotlib, seaborn, ggplot, plotly, Load Images using pillow, Load audio files using scikit-learn(scipy.io), Connecting DB’s with Python, Creation of Python virtual Environment

Unit-2
Teaching Hours:35
R Programming
 

Introduction & Installation of R, Data Objects- Data Types & Data Structures (e.g. lists. Arrays, matrices, data frames), Packages in R, Introduction to tidy verse (group of packages), Manipulating and Processing Data in R, Creating, Accessing and Sorting data frames, Extracting, Combining, Merging, reshaping data frames, Functions, Built in functions in R (numeric, character, statistical), Interactive reporting with R markdown, 

Text Books And Reference Books:

Text Book:

1. Python for Everybody Exploring Data using Python, Charles R. Severance, Shroff Publishers & Distributors, 1st Edition.

Essential Reading / Recommended Reading

Reference Book:

1. Introduction to Computer Science using Python, Charles/ Wiley

2. Python Power!: The Comprehensive Guide

3. Python Crash Course: A Hands-on, Project-Based Introduction to Programming

4. Beginning Programming with Python For DummiesLearning Python by: Fabrizio Romano

5. Python Projects by Laura Cassell , Alan Gauld / Wiley

6. Python Cookbook by David B. Brain K. Jones / Shroff / O'reilly Publisher

7. Head First Python by Paul Barry / Shroff / O'reilly Publisher

8. Professional Iron Python by John Paul Muller / Wiley India Pvt Ltd

9. Beginning Programming with Python for Dummies by John Paul Muller / Wiley India Pvt Ltd

Evaluation Pattern

CIA - 70 %

ESE - 30 %

MTDS131E06 - BIGDATA TECHNOLOGY (2024 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:6
Max Marks:100
Credits:4

Course Objectives/Course Description

 

To reinforce knowledge of BigData Technologies such as Hadoop, Map reduce, HBase, PIG, Spark (PySpark) 

Course Outcome

CO1: Identify the importance of data curation for scientific data at risk of loss and frame data rescue and dissemination strategies.

CO2: Design and implement complex MapReduce programs using partitioners, combiners, and advanced techniques.

CO3: Design and implement an ETL data pipeline using Hadoop or Spark, considering data storage, processing, and dissemination

Unit-1
Teaching Hours:35
Introduction to Big Data
 

Research and Changing Nature of Data Repositories, Overlooked and Overrated Data Sharing, Curation of Scientific Data at Risk of Loss: Data Rescue And Dissemination, Introduction to Hadoop and its components, Hadoop Distributed File System (HDFS), HDFS Architecture, Hadoop Installation and Cluster Configuration, HDFS – Monitoring & Maintenance, Hadoop benchmarks, HDFS Data Storage Process, Hadoop Map Reduce paradigm, Partitioners and Combiners, Complex Map Reduce programming,ETL Process in Hadoop.

Unit-2
Teaching Hours:40
Overview of HBase, Hive, Spark
 

Overview of HBase: architecture, Installation, The HBaseAdmin and HBase Security, The Hive Data-ware House, Working with Hive QL, Data manipulation with Hive,Designing Data warehousing for an ETL Data Pipeline, Designing Data Lakes for an ETL Data Pipeline, Fundamentals of Airflow, Apache Spark APIs for large-scale data processing, Working with Kafka using Spark,Predictive Analysis.

Text Books And Reference Books:

1. Big Data, Black Book: Covers Hadoop 2, MapReduce, Hive, YARN, Pig, R and Data Visualization, DT Editorial Services , Wiley India,Latest.

Essential Reading / Recommended Reading

1. Big Data, Black Book by DreamTech

2. Programming Hive by O’Rellay (Author:- Edward Capriolo, Dean Wampler, and Jason RutherglenEdward Capriolo, Dean Wampler, and Jason Rutherglen)

3. Hadoop The Definitive Guide 4 thEdition by O’Rellay (Author: - Tom White)

4. Hadoop In Practice by Manning (Author: - ALEX HOLMES)

5. Pro Hadoop by Aprss(Author:-Jason Venner)

6. Hadoop with python

7. Hadoop Real-World Solutions Cookbook by Packet publication (Author: Jonathan R. Owens, Jon Lentz,Brian Femiano)

8. Hadoop In Action by Manning Publications (Author: - CHUCK LAM)

9. Data Architecture: A Primer for the Data Scientist: Big Data, Data Warehouse and Data Vault

10. Big Data Made Easy: A Working Guide to the Complete Hadoop Toolset

11. Big Data Analytics with Spark: A Practitioner's Guide to Using Spark for Large-Scale Data Processing, Machine Learning, and Graph Analytics, and High-Velocity Data Stream Processing

Evaluation Pattern

CIA - 70%

ESE - 30%

MTDS151 - ADVANCED DATA STRUCTURES AND ALGORITHMS LAB (2024 Batch)

Total Teaching Hours for Semester:60
No of Lecture Hours/Week:4
Max Marks:50
Credits:2

Course Objectives/Course Description

 

Course Description:

The Advanced Data Structures and Algorithms Lab is an intensive hands-on course designed to complement the theoretical understanding gained in the corresponding lecture-based course. Students will strengthen their practical skills in implementing and analysing complex data structures and algorithms. 

Course Objective:

  1. To implement the basic concepts of linear and non-linear data structures.
  2. To provide the students with various kinds of searching and sorting mechanisms.

To work with different tree traversal techniques. 

Course Outcome

CO1: Examine the basics and advanced concepts of Data Structure and Algorithms.

CO2: Experiment with the various operations of data structures

Unit-1
Teaching Hours:60
LIST OF EXPERIMENTS
 

1. Write programs for implementing the following searching techniques. a. Linear search b. Binary search c. Fibonacci search.

2. Write programs for implementing the following sorting techniques to arrange a list of integers in ascending order. a. Bubble sort b. Insertion sort c. Selection sort d. Quick sort e. Merge sort.

3. Write programs to a. Design and implement Stack and its operations using List. b. Design and implement Queue and its operations using List.

4. Write programs for the following: a. Uses Stack operations to convert infix expression into postfix expression. b. Uses Stack operations for evaluating the postfix expression.

5. Write programs for the following operations on Single Linked List. (i) Creation (ii) insertion (iii) deletion (iv) traversal b. To store a polynomial expression in memory using single linked list.

6. Write programs for the following operations on Circular Linked List. (i) Creation (ii)insertion (iii) deletion (iv) traversal.

7. Write programs for the following: Uses functions to perform the following operations on Double Linked List. (i) Creation (ii) insertion (iii) deletion (iv) traversal in both ways..

8. Write a program to implement Stack using linked list.

9. Write a program to implement Linear Queue using linked list.

10. Write programs to implement graph traversal algorithms: a. Depth-first search. b. Breadth-first search.

11. Write a program to perform the following: a. Create a binary search tree. b. Traverse the above binary search tree recursively in pre-order, post-order and in-order. c. Count the number of nodes in the binary search tree.

Text Books And Reference Books:

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education.

Essential Reading / Recommended Reading

R1. Fundamentals of data structure in C by Ellis Horowitz, Sarataj Shani 3rd edition, Galgotia book source PVT, 2010.

R2. NPTEL Course on “Data Structure and Algorithms Using JAVA” by Debasis Samanta, IIT Kharagpur.

R3. NPTEL Course on “Design and Analysis of Algorithms” by Madhavan Mukund, IIT Madras.

Evaluation Pattern

Assessment Details:

CIA 50 %

ESE 50 %

Total Marks= 50

MTMC125 - RESEARCH METHODOLOGY AND IPR (2024 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

To introduce the research methodology, the understanding on the research, methods, designs, data collection methods, report writing styles and various dos and don’ts in research

Course Outcome

CO1: Explain the principles and concepts of research methodology.

CO2: Understand the different methods of data collection

CO3: Apply appropriate method of data collection and analyze using statistical/software tools.

CO4: Present research output in a structured report as per the technical and ethical standards.

CO5: Analyze research design for a given engineering and management problem /situation

Unit-1
Teaching Hours:9
INTRODUCTION TO RESEARCH METHODOLOGY
 

 Meaning, Objectives and Characteristics of research - Research methods Vs Methodology, Different Research Design: Types of research - Descriptive Vs. Analytical, Applied Vs. Fundamental, Quantitative Vs. Qualitative, Conceptual Vs. Empirical, Research process - Criteria of good research - Developing a research plan

Unit-2
Teaching Hours:9
LITERATURE REVIEW AND RESEARCH PROBLEM IDENTIFICATION
 

 Defining the research problem - Selecting the problem - Necessity of defining the problem - Techniques involved in defining the problem - Importance of literature review in defining a problem - Survey of literature - Primary and secondary sources - Reviews, treatise, monographs, thesis reports, patents - web as a source - searching the web - Identifying gap areas from literature review - Development of working hypothesis.

Text Books And Reference Books:

1.      Kothari C.R., “Research Methodology Methods and techniques”, New Age International, New Delhi, 2004.

2.      Garg, B.L., Karadia, R., Agarwal, F. and Agarwal, “An introduction to Research Methodology”, RBSA Publishers, 2002.

3.      Day, R.A., “How to Write and Publish a Scientific Paper”, Cambridge University Press, 1992

Essential Reading / Recommended Reading
  1. Bjorn Gustavii, “How to Write and Illustrate Scientific Papers “ Cambridge University Press, 2/e.
  2. Sarah J Tracy, “Qualitative Research Methods” Wiley Balckwell- John wiley & sons, 1/e, 2013
  3.  James Hartley, “Academic Writing and Publishing”, Routledge Pub., 2008.r.
Evaluation Pattern

Assessment Details:

 1.  Continuous Internal Assessment (CIA)       :  50  marks

2. End Semester Examination(ESE) - Theory   : 50 marks

MTAC224 - ETHICAL HACKING (2024 Batch)

Total Teaching Hours for Semester:30
No of Lecture Hours/Week:2
Max Marks:0
Credits:0

Course Objectives/Course Description

 

This course helps to understand computer-based vulnerabilities and explore different footprinting, reconnaissance, and scanning methods. The course also exposes the enumeration and vulnerability analysis methods and explores options for network protection.

1. To understand the basics of computer-based vulnerabilities.

2. To understand hacking options available in Web and wireless applications.

3. To practice tools to perform ethical hacking to expose the vulnerabilities.

Course Outcome

CO1: Explain the different computer based Vulnerabilities

CO2: Utilize different foot printing, reconnaissance and scanning methods.

CO3: Demonstrate the enumeration and vulnerability analysis methods.

CO4: Identify different hacking options available in Web and wireless applications.

CO5: Make use of the options for network protection.

Unit-1
Teaching Hours:6
Introduction
 

Ethical Hacking Overview - Role of Security and Penetration Testers - Penetration-Testing Methodologies- Laws of the Land - Overview of TCP/IP- The Application Layer - The Transport Layer - The Internet Layer - IP Addressing. - Network and Computer Attacks - Malware - Protecting Against Malware Attacks.- Intruder Attacks - Addressing Physical Security

 Experiment 1: Install Kali or Backtrack Linux / Metasploitable/ Windows XP and basic operations.

Unit-2
Teaching Hours:6
Foot printing, Reconnaissance and Scanning Networks
 

Footprinting Concepts - Footprinting through Search Engines, Web Services, Social Networking Sites, Websites, and Email - Competitive Intelligence - Footprinting through Social Engineering - Footprinting Tools - Network Scanning Concepts - Port-Scanning Tools - Scanning Techniques - Scanning Beyond IDS and Firewall.

Experiment 2: Practice the basics of reconnaissance.

Experiment 3: Using FOCA / SearchDiggity tools, extract metadata and expand the target list.

Experiment 4: Aggregates information from public databases using online free tools like Paterva’s Maltego.

Experiment 5: Scan the target using tools like Nessus.

Text Books And Reference Books:

 1. Michael T. Simpson, Kent Backman, and James E. Corley, Hands-On Ethical Hacking and Network Defense, Course Technology, Delmar Cengage Learning, 2010.

 

Essential Reading / Recommended Reading

1. The Basics of Hacking and Penetration Testing - Patrick Engebretson, SYNGRESS, Elsevier, 2013.

Evaluation Pattern

NA

MTDS231E06 - ADV BIGDATA TECHNOLOGY (2024 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:6
Max Marks:100
Credits:4

Course Objectives/Course Description

 

To reinforce knowledge of BigData Technologies such as Hadoop, Map reduce, HBase, PIG, Spark (PySpark) 

Course Outcome

CO1: Identify the importance of data curation for scientific data at risk of loss and frame data rescue and dissemination strategies.

CO2: Design and implement complex MapReduce programs using partitioners, combiners, and advanced techniques.

CO3: Design and implement an ETL data pipeline using Hadoop or Spark, considering data storage, processing, and dissemination

Unit-1
Teaching Hours:35
Introduction to Big Data
 

Research and Changing Nature of Data Repositories, Overlooked and Overrated Data Sharing, Curation of Scientific Data at Risk of Loss: Data Rescue And Dissemination, Introduction to Hadoop and its components, Hadoop Distributed File System (HDFS), HDFS Architecture, Hadoop Installation and Cluster Configuration, HDFS – Monitoring & Maintenance, Hadoop benchmarks, HDFS Data Storage Process, Hadoop Map Reduce paradigm, Partitioners and Combiners, Complex Map Reduce programming,ETL Process in Hadoop.

Unit-2
Teaching Hours:40
Overview of HBase, Hive, Spark
 

Overview of HBase: architecture, Installation, The HBaseAdmin and HBase Security, The Hive Data-ware House, Working with Hive QL, Data manipulation with Hive,Designing Data warehousing for an ETL Data Pipeline, Designing Data Lakes for an ETL Data Pipeline, Fundamentals of Airflow, Apache Spark APIs for large-scale data processing, Working with Kafka using Spark,Predictive Analysis.

Text Books And Reference Books:

1. Big Data, Black Book: Covers Hadoop 2, MapReduce, Hive, YARN, Pig, R and Data Visualization, DT Editorial Services , Wiley India,Latest.

Essential Reading / Recommended Reading

1. Big Data, Black Book by DreamTech

2. Programming Hive by O’Rellay (Author:- Edward Capriolo, Dean Wampler, and Jason RutherglenEdward Capriolo, Dean Wampler, and Jason Rutherglen)

3. Hadoop The Definitive Guide 4 thEdition by O’Rellay (Author: - Tom White)

4. Hadoop In Practice by Manning (Author: - ALEX HOLMES)

5. Pro Hadoop by Aprss(Author:-Jason Venner)

6. Hadoop with python

7. Hadoop Real-World Solutions Cookbook by Packet publication (Author: Jonathan R. Owens, Jon Lentz,Brian Femiano)

8. Hadoop In Action by Manning Publications (Author: - CHUCK LAM)

9. Data Architecture: A Primer for the Data Scientist: Big Data, Data Warehouse and Data Vault

10. Big Data Made Easy: A Working Guide to the Complete Hadoop Toolset

11. Big Data Analytics with Spark: A Practitioner's Guide to Using Spark for Large-Scale Data Processing, Machine Learning, and Graph Analytics, and High-Velocity Data Stream Processing

Evaluation Pattern

Overall CIA = 100 Marks

MTDS231E07 - DATA VISUALIZATION - ANALYSIS & REPORTING (2024 Batch)

Total Teaching Hours for Semester:75
No of Lecture Hours/Week:6
Max Marks:100
Credits:4

Course Objectives/Course Description

 

To introduce students in Data Analytics, Visualization and Reporting

Course Outcome

CO1: Identify the different data visualization techniques and potential biases within the data.

CO2: Compare and contrast the effectiveness of different data visualizations for a specific audience and purpose.

CO3: Independently design a comprehensive data visualization report to effectively communicate a chosen data story.

Unit-1
Teaching Hours:75
DATA VISUALIZATION - ANALYSIS & REPORTING
 

Business Intelligence basic, Information gathering, Decision making, Managing BI, BI User Segmentation, Gathering BI Requirements, Content and Knowledge Management, Strategic Approach to BI, Significance of visual analytics Information Visualization,  Data Representation, Data collection and binding: Structured Data, Unstructured data, MS EXCEL: Functions, Formula, Charts, Pivots and Lookups, Data Analysis Tool pack-Descriptive Summaries, Correlation, Regression, Data analytics Life Cycle: Discovery, Data preparation, Model planning, Model building implementation, Quality assurance, Documentation, Management approval, Installation, Acceptance and operation, Introduction to Tableau: Intelligent data analysis, Nature of Data, Analytics Processes and tools, Analysis vs. Reporting, Modern Data Analytic Tools, Data sources in Tableau, Visualization Algorithms: Visual Encodings, Taxonomy of data visualization, Choosing appropriate visuals, Applying calculations using functions, statistics, Data sorting, filters, Interactive visualization, Dashboard Design

 

 

Text Books And Reference Books:

1. Communicating Data with Tableau, Ben Jones, O'Reilly, Shroff Publishers & Distributors, Tableau 8.1. 

Essential Reading / Recommended Reading

1. Mastering Microsoft Power BI: Expert Techniques for Effective Data Analytics and Business Intelligence Book by Brett Powell

2. Designing Data Visualizations, by Steele,O'Reilly

3. Tableau your data, by Daniel G/ Wiley

4. Graphs Cookbook, Hrishi V. Mittal, Packt Publishing

5. Python Data Visualization Cookbook,Igor Milovanović, Packt Publishing

6. Learning Python Data Visualization, Chad Adams, Packt Publishing

7. Data Visualization with D3.js Cookbook,Nick Qui Zhu,Packt Publishing

8. Getting Started with D3,Mike Dewar,O'Reilly 9. Data Visualization with JavaScript

10. Data Visualization for Dummies

11. High Impact Data Visualization with Power View, Power Map, and Power BI

12. The Visual Organization: Data Visualization, Big Data, and the Quest for Better Decisions

13. Mastering Tableau 2021:- by Marleen Meie

Evaluation Pattern

Overall CIA = 100 Marks

MTDS232 - BUSINESS INTELLIGENCE AND ITS APPLICATIONS (2024 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:4
Max Marks:100
Credits:3

Course Objectives/Course Description

 

Course Description:   

This course elaborates on the basics of business intelligence concepts and the knowledge delivery. Students shall also examine the efficacy and the business applications in real world.  

Course Objective:

1. Be exposed with the basic rudiments of business intelligence system

2. Understand the modeling aspects behind Business Intelligence

3. Understand of the business intelligence life cycle and the techniques used in it 

 

Course Outcome

CO 1: Understand the basics of business intelligence.

CO 2: Infer the examples of the knowledge delivery in BI applications

CO 3: Choose a model based on efficiency needed.

CO 4: Model real world BI applications

CO 5: Identify the future of BI in real world

Unit-1
Teaching Hours:9
Business Intelligence
 

Effective and timely decisions – Data, information and knowledge – Role of mathematical models – Business intelligence architectures: Cycle of a business intelligence analysis – Enabling factors in business intelligence projects – Development of a business intelligence system – Ethics and business intelligence.

Unit-2
Teaching Hours:9
Knowledge Delivery
 

The business intelligence user types, Standard reports, Interactive Analysis and Ad Hoc Querying, Parameterized Reports and Self-Service Reporting, dimensional analysis, Alerts/Notifications, Visualization: Charts, Graphs, Widgets, Scorecards and Dashboards, Geographic Visualization, Integrated Analytics, Considerations: Optimizing the Presentation for the Right Message.

Text Books And Reference Books:

T1. Efraim Turban, Ramesh Sharda, Dursun Delen, “Decision Support and Business Intelligence Systems”, 9th Edition, Pearson 2013.

T2. Carlo Vercellis, “Business Intelligence: Data Mining and Optimization for Decision Making”, Wiley Publications, 2009.

 

Essential Reading / Recommended Reading

-

Evaluation Pattern

CIA - 50

ESE - 50

 

MTDS233 - MACHINE LEARNING FOR DATA SCIENCE (2024 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:4
Max Marks:100
Credits:3

Course Objectives/Course Description

 

Course Description:

This course provides the concepts and algorithms in machine learning and the methods to apply them in real time problems. 

Course Objective:

1.To gain knowledge in the basics of Python Machine Learning Libraries.

2.To analyze the applicability, benefits, and drawbacks of the Supervised and Unsupervised machine learning techniques.

3.To acquire knowledge on the recommendation systems and their working methodology 

 

Course Outcome

CO1: Describe the basic concepts of machine learning data, concept learning and life cycle.

CO2: Interpret the similarity-based learning and regression analysis for the given data.

CO3: Demonstrate decision tree learning and Bayesian learning concepts

CO4: Construct clustering algorithms and Reinforcement learning models

CO5: Solve the data exploration and measures using R programming

Unit-1
Teaching Hours:9
Introduction to Machine Learning and Learning Theory
 

Need for Machine Learning, Machine Learning in relation to other fields, Types of Machine Learning, Challenges of Machine Learning, Machine Learning Process and Applications, Data, Data Analytics, Descriptive Statistics, Univariate, Bivariate and Multivariate Data, Feature Engineering, Dimensionality Reduction techniques, Learning and its Types.

Unit-2
Teaching Hours:9
Similarity based Learning and Regression Analysis
 

Introduction to Similarity based Learning, Nearest Neighbor Learning, Weighted K-Nearest Neighbor Algorithm, Nearest Centroid Classifier, Locally weighted Regression, Introduction to Regression, Linearity, Correlation and Causation, Linear Regression, Multiple Linear Regression

Experiment 1: Implementation of Linear Regression, KNN Algorithm

Text Books And Reference Books:

T1.  S.Sridhar, M.Vijayalakshmi, “Machine Learning”, 1st Edition, Oxford University Press, 2021.

T2. Brett Lantz, “Machine Learning with R: Expert techniques for predictive modeling”, 3rd Edition, Packt Publishing, 2019. ISBN : 978-1788295864.

Essential Reading / Recommended Reading

R1. Manaranjan Pradhan, U. Dinesh Kumar, “Machine Learning Using Python”, Wiley india Pvt. Ltd, 2019 Edition, ISBN: 9788126579907.

R2. David Forsyth, “Applied Machine Learning”, Springer, 2019.

R3. M.Gopal, “Applied Machine Learning”, McGraw-Hill Education, 1st edition, 2019.

Evaluation Pattern

CIA - 50

ESE - 50

MTDS281 - PROJECT WORK (2024 Batch)

Total Teaching Hours for Semester:90
No of Lecture Hours/Week:6
Max Marks:100
Credits:3

Course Objectives/Course Description

 

During this project phase I session, each student is expected to prepare and present a topic on engineering/ technology on their domain interest to persue the project work, it is designed to: 

  • Review and increase their understanding of the specific topics identified.
  • Improve their ability to communicate that understanding to the grader.
  • Increase the effectiveness with which they use the limited examination time.

Course Outcome

CO1: Students will be understanding concepts.

CO2: Understanding the identified domain

CO3: Framing the research problem

CO4: Project design analysis

CO5: Research literature writing

Unit-1
Teaching Hours:90
Project Work
 

Project Work

Text Books And Reference Books:

Journal Papers, Online Lectures

Essential Reading / Recommended Reading

-

Evaluation Pattern

Continuous Internal Assessment:100 Marks

♦        Presentation assessed by Panel Members

♦        Guide

♦        Mid semester Project Report

End semester Examination :100 Marks

MTDS343E02 - IOT ARCHITECTURE & COMPUTING (2023 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

To have the better understanding of:

1. To expose the students to the prevalent IoT architecture and the associated hardware and software technology.

2. To enable the students to develop full-fledged IoT systems leveraging the state-of-the-art computing environments.

Course Outcome

CO1: Explain the IoT landscape and applications

CO2: Elaborate the generic IoT system architecture and its components

CO3: Make use of the Architecture Reference Model (ARM) model and System.

CO4: Analyze an IoT system with respect to standards, protocols, interoperability, discoverability, security and privacy.

CO5: Experiment with cloud and fog computing for IoT systems.

CO6: Design and develop IoT systems using state-of-the art hardware, software and computing technologies.

Unit-1
Teaching Hours:3
Introduction to IoT landscape and applications
 

Introduction, Architectures, Applications, Devices, Security and privacy

Unit-2
Teaching Hours:3
IoT architecture and standards
 

Introduction to generic IoT architecture, Protocols, Standards, Databases, Time Bases, IoT Devices

Text Books And Reference Books:

1.      Serpanos, Dimitrios, and Marilyn Wolf. Internet-of-Things (IoT) Systems Architectures, Algorithms, Methodologies. by Springer Nature, 2018.

2.      Bassi, Alessandro, et al. Enabling things to talk. Springer Nature, 2013.

3.      Cirani, Simone, et al. Internet of things: architectures, protocols and standards. John Wiley & Sons, 2018.

Essential Reading / Recommended Reading

1.      Vijay Madisetti and Arshdeep Bahga, “Internet of Things (A Hands-on-Approach)”, 1st Edition, VPT, 2014.

2.      Lea, Perry. Internet of Things for Architects: Architecting IoT solutions by implementing sensors, communication infrastructure, edge computing, analytics, and security. Packt Publishing Ltd, 2018.

3.      Buyya, Rajkumar, and Satish Narayana Srirama, eds. Fog and edge computing: principles and paradigms. John Wiley & Sons, 2019.

Evaluation Pattern

Overall CIA = 100 Marks

MTDS381 - INTERNSHIP (2023 Batch)

Total Teaching Hours for Semester:60
No of Lecture Hours/Week:4
Max Marks:50
Credits:2

Course Objectives/Course Description

 

Course Description:

Students need to learn from textbooks, lectures, and other study materials to build a strong foundation. But if you want them to understand the real business world, you need to give them a taste of the practical side of things. So, industrial learning is a big part of managerial studies. It gives students hands-on experience and helps them figure out where they want to work in the organization as a whole. As a result, the department offers summer internships at well-known companies that give students an all-around look at the business world for one month. At the end of their second semester, students take part in this internship. This chance also helps lay the groundwork for the next semester's placement season.

Course Objective:

1. To perform a task involving research or design, that is carefully planned to achieve a particular aim.

2. To learn modular programming - analyze problems, design solutions, learn new tools and implement the system as a team/ individual.

Course Outcome

CO 1: Design solutions to real time complex engineering problems using the concepts of Computer Science and Information Technology through independent study.

CO 2: Demonstrate teamwork and leadership skills with professional ethics.

CO 3: Prepare an internship report in the prescribed format and demonstrate oral communication through presentation of the internship work.

Unit-1
Teaching Hours:60
Regulations
 

1.The student shall undergo an Internship for 30 days  starting from the end of 2nd semester examination and completing it during the initial period of 3rd semester.

2.The department shall nominate a faculty as a mentor for a group of students to prepare and monitor the progress of  the students

3. The students shall report the progress of the internship to the mentor/guide at regular intervals and may seek his/her advise.

4. The Internship shall be completed by the end of  7th semesters.

5. The students are permitted to carry out the internship outside India with the following conditions, the entire expenses are to be borne by the student and the University will not give any financial assistance.

6. Students can also undergo internships arranged by the department during vacation.

7. After completion of Internship, students shall submit a report to the department with the approval of both internal and external guides/mentors.

8. There will be an assessment for the internship for 2 credits, in the form of report assessment by the guide/mentor  and a presentation on the internship given to department constituted panel.

Text Books And Reference Books:

Related to the Internship domain text books are sugessted.

Essential Reading / Recommended Reading

Readings Related to the Internship domain

Evaluation Pattern

CIA = 50 Marks

MTDS382 - DISSERTATION PHASE I (2023 Batch)

Total Teaching Hours for Semester:240
No of Lecture Hours/Week:16
Max Marks:200
Credits:08

Course Objectives/Course Description

 

During this project phase I session, each student is expected to prepare and present a topic on engineering/ technology on their domain interest to persue the project work, it is designed to: 

  • Review and increase their understanding of the specific topics identified.
  • Improve their ability to communicate that understanding to the grader.
  • Increase the effectiveness with which they use the limited examination time.

Course Outcome

CO 1: Students will be understanding concepts.

CO 2: Understanding the identified domain.

CO 3: Framing the research problem.

CO 4: Project design analysis.

CO 5: Research literature writing.

Unit-1
Teaching Hours:240
DISSERTATION PHASE -1
 

Assessment of Project Work(Phase I)

Continuous Internal Assessment:100 Marks

Presentation assessed by Panel Members

Guide

Mid semester Project Report

Text Books And Reference Books:

Journal article, industry white papers text books basedon the domain on which the student will be doing his/her work.

Essential Reading / Recommended Reading

Recommendation will be given Based on the domian in which student will be interested and planning to do the dissertation work

Evaluation Pattern

CIA - 100 Marks

End Semester Review - 100 Marks

MTVL342E01 - COMPRESSION AND ENCRYPTION TECHNIQUES (2023 Batch)

Total Teaching Hours for Semester:45
No of Lecture Hours/Week:3
Max Marks:100
Credits:3

Course Objectives/Course Description

 

This course aims at making the students get an understanding of the compression techniques available for multimedia applications and also get an understanding of the encryption that can be implemented along with the compression.

Course Outcome

CO-1: Explain the taxonomy of multimedia compression techniques

CO-2: Explain the concept of text compression through the coding techniques

CO-3: Describe the motion estimation techniques used in video compression

CO-4: Explain the concept of encryption with the models employed

CO-5: Explain the symmetric ciphers and their techniques & standards

Unit-1
Teaching Hours:9
INTRODUCTION TO COMPRESSION
 

Special features of Multimedia – Graphics and Image Data Representations – Fundamental Concepts in Video and Digital Audio – Storage requirements for multimedia applications -Need for Compression - Taxonomy of compression techniques – Overview of source coding

Unit-2
Teaching Hours:9
TEXT COMPRESSION
 

Compaction techniques – Huffmann coding – Adaptive Huffmann Coding – Arithmatic coding – Shannon-Fano coding – Dictionary techniques – LZW family algorithms

Text Books And Reference Books:

NIL

Essential Reading / Recommended Reading

1. Khalid Sayood : Introduction to Data Compression, Morgan Kauffman Harcourt India, 2nd Edition, 2000

2. David Salomon : Data Compression – The Complete Reference, Springer Verlag New York Inc., 4th Edition, 2006

3. Yun Q.Shi, HuifangSun : Image and Video Compression for Multimedia Engineering -  Fundamentals, Algorithms & Standards, CRC press, 2008

4.Jan Vozer : Video Compression for Multimedia, AP Profes, NewYork, 1995.

5. William Stallings, “Cryptography and Network Security”, 6th. Ed, Prentice Hall of India, New Delhi ,2013

6. William Stallings, “Network Security Essentials”, 5thed. Prentice Hall of India, New Delhi

Evaluation Pattern

CIA-50

ESE-50

MTDS483 - DISSERTATION PHASE - II (2023 Batch)

Total Teaching Hours for Semester:450
No of Lecture Hours/Week:30
Max Marks:200
Credits:15

Course Objectives/Course Description

 

During this project phase I session, each student is expected to prepare and present a topic on engineering/ technology on their domain interest to persue the project work, it is designed to: 

  • Review and increase their understanding of the specific topics identified.
  • Improve their ability to communicate that understanding to the grader.
  • Increase the effectiveness with which they use the limited examination time.

Course Outcome

CO 1: Design engineering solutions to complex real world problems using research literature.

CO 2: Use appropriate hardware and software depending on the nature of the project with an understanding of their limitations.

CO3: Implementation and testing of the project

CO 4: Understand the impact of the developed projects on environmental factors.

CO 5: Demonstrate project management skills including handling the finances in doing projects for given real world societal problems

Unit-1
Teaching Hours:450
DISSERTATION PHASE -II
 

Project Work 

Text Books And Reference Books:

Journal article, industry white papers text books basedon the domain on which the student will be doing his/her work.

Essential Reading / Recommended Reading

Recommendation will be given Based on the domian in which student will be interested and planning to do the dissertation work

Evaluation Pattern

Assessment of Project Work(Phase II) and Dissertation

▪ Continuous Internal Assessment:100 Marks

♦ Presentation assessed by Panel Members

♦ Assessed by Guide

♦ Mid Semester Project Report

▪ End Semester Examination:100 Marks

♦ Viva Voce

♦ Demonstration

♦ Project Report

▪ Dissertation (Exclusive assessment of Project Report): 100 Marks

♦ Internal Review : 50 Marks

♦ External review : 50 Marks