Académique Documents
Professionnel Documents
Culture Documents
Course Outcomes : At the end of the course the student will be able to
CO1: Write C++ programs for the given computer science applications.
CO2: Understand linear data structures-arrays, lists, stacks and queues.
CO3: Explain non linear data structures -binary trees, binary search tree, AVL trees, B trees,
Red-Black trees and splay trees.
CO4: Describe the binary heaps, priority queues, d-heaps, leftist heaps, skew heaps, binomial
queues.
CO5: Understand hash functions including sorting techniques bubble sort, insertion sort, selection
sort, quick sort and heap sort.
Introduction to C++
Concepts of Object Oriented Programming, Parts of C++ program, data types, pointers, operators and
their precedence, Scope Access Operator, Memory Management Operators, Control Structures,
functions in C++, introducing Classes, constructor and destructor functions, parameterized constructors.
Linear Data Structures and Applications
Arrays: Array operations, Representation of Arrays in Memory, Applications. Linked Lists: Single,
Double and Circular Linked Lists, Applications. Stacks: Stack operations, Applications. Queues:
Operations on Queues, Circular Queues, Other Types of Queues, Applications.
Trees and Applications
Definition and Basic Terminologies, Representation of Trees, Binary Trees: Representation of Binary
Trees, Binary Tree Traversals, Threaded Binary Trees, Application. Binary Search Trees, AVL Trees:
Definition and Operations, B Trees: Definition and Operations Applications. Red-Black Trees and
Splay Trees, Applications.
Priority Queues (Heaps)
Model, Simple Implementation, Binary Heap, applications of priority queues, d-heaps, leftist heaps,
skew heaps, Binomial queues.
Hash tables and Sorting techniques
Definition, Hash function, Open hashing (separate chaining), Closed hashing (open addressing) linear
probing, quadratic probing, double hashing, Rehashing, Extendible hashing. Bubble Sort, Insertion
Sort, Selection Sort, Quick Sort, Heap Sort.
Text Books :
1. G.A.V.Pai, Data Structures and Algorithms, Tata McGraw Hill Edition.
2. Mark Allenweiss, Data Structures and Algorithms Analysis, Pearson Education.
Reference Books :
1. Jean Paul Tremblay, Paul G.Sorenson, An Introduction to Data Structures with Applications, TMH.
2. E.BalaguruSwamy, Object Oriented Programming with C++.TMH.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
SOFTWARE ENGINEERING(SE)
I Semester : CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS802
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Explain the software development life cycle models.
CO2: Understand the importance of software requirements.
CO3: Explain the Design process of a software, Testing strategies.
CO4: Learn Software estimation in projects; get an overview of different Size, Effort and Cost
estimation methodologies.
CO5: Estimate the Project schedule, Risk, Quality, Management for developing a new software.
Software Process
Introduction To Software Engineering, Generic view of process-A Process Framework, CMMI,
Prescriptive Models-The waterfall model, Incremental process models, Evolutionary process models,
Concurrent Development Model, The Unified process, An Agile View of Process-Introduction ,Agile
Process Models.Software Engineering Practice: Introduction, Communication practices, Modeling
Practices, Construction Practice, Deployment.
Requirements Engineering
Requirements Engineering Tasks, Initiating the Requirements Engineering Process Eliciting
Requirements, Developing Use Cases, Negotiating Requirements, Validating Requirements,
Building the Analysis model- Requirement Analysis and Analysis Modeling approaches, Data
Modeling Concepts, Object oriented Analysis, Scenario based Modeling, Flow Oriented Modeling,
Class Based Modeling, Creating a Behavioral Model.
Design Engineering
Introduction, Design process and Design Quality, Design Concepts, The Design Model, Pattern Based
Software Design. Testing Strategies-Strategic approach of Software Testing, Strategic issues, Test
strategies for Conventional Software, Test Strategies for Object-Oriented Software, Validation Testing,
System Testing, Debugging. Testing Tactic-Fundamentals, Black box and White Box Testing ,Basis
path Testing, Control Structure Testing.
Text Books :
1.RogerS.Pressman [2005], [6th Edition], Software Engineering, A Practitioners Approach, Mc
GrawHill International Edition.
Reference Books :
1. Sommerville [2008], [7th Edition], Software Engineering ,Pearson education.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand history of Internet including basics of ISPs, Internet Backbones.
CO2: Explain layered models, Internet addressing versions IPv4, IPv6.
CO3: Describe protocols TCP, UDP, Mobile TCP, HTTP, FTP, SMTP, DNS.
CO4: Understand IEEE 802.11 WLAN technologies including cellular networks, mobile IP.
CO5: Explain security schemes symmetric, asymmetric cryptography, firewalls, secure socket layer,
virtual private network including wired network simulation using NS2 tool.
Network Security
Cryptography, Firewalls, Secure Socket Layer (SSL) and Virtual Private Networks (VPN). Case
study:Study of various network simulators, Network performance analysis using NS2.
Text Books :
1. Behrouz A.Forouzan, [4th Edition], Data CommunicationsandNetworking,TataMcGrawHill,2007.
2. Jochen Schiller, [2011], Mobile Communications, Pearson Education.
Reference Books :
1. Computer Networks, Andrew S. Tanenbaum, Fourth Edition, Prentice Hall.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
ADVANCED DATABASE MANAGEMENT SYSTEMS (ADBMS)
I Semester : CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS804
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: To Measure the cost of selection, join and sort query operations.
CO2: To Understand the Complex Data Types and object oriented concepts in databases.
CO3: To Determine the difference between centralized and client-server architectures.
CO4: To Describe the need of Parallelism in distributed databases.
CO5: To Understand time series, spatial, geographic and multimedia databases.
CO6: To Understand real time transaction management.
Parallel Databases
Introduction, I/O Parallelism, Inter query Parallelism, Intra query Parallelism, Intra operation
parallelism, Inter operation parallelism, Design of Parallel Systems.
Distributed Databases : Homogeneous and Heterogeneous databases, Distributed data storage,
Distributed Transactions, Commit protocols, concurrency control in Distributed databases, Availability,
Distributed query processing, Heterogeneous Distributed Databases.
Text Books :
1. Henry F. Korth& Abraham Silberschatz [2006], Database System Concepts.
Reference Books :
1. RamezElmasri , Navathe [2009], Fundamentals of Database systems.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
C # &. NET FRAMEWORK
Elective-I for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS806
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Illustrate the usage of loops, conditional statements, Arrays, Collections and Generics using
console based applications.
CO2: Explain inheritance, polymorphism using classes, objects and interfaces.
CO3: Understand the working of Menus, Button, Label, Radio Button, Check Box, Text Box, List
Box, Checked List Box, List View and Tab Control using Windows applications.
CO4: Compare the features of SDI and MDI applications using windows forms.
CO5: Explain the process of writing insert, update, delete and select statements using ADO .NET.
CO6: Understand the creation, validation and post back mechanisms of an ASP page using ASP
.NET.
Introduction to C#
NET Framework, What is C#, writing a C# program, Variables and Expressions, Flow control -
Branching & Looping, Type conversion Implicit & Explicit, Complex variable types Arrays,
Structures & Enumerations, Functions, Error handling.
Object Oriented Aspects of C#
OOP Techniques Inheritance, Polymorphism, Interfaces,Defining classes, defining class members
Member definitions, Collections, Generics.
Basic windows programming
Controls Button, Label, Link Label, Textbox, Radio Button,Checkbox, Rich Textbox, List Box,
CheckedListBox, List View, Tab Control.
Advanced windows programming
Menus, Toolbars, Single Document Interface (SDI) and Multiple Document Interface (MDI)
applications, Building MDI applications.
Introduction to ADO.NET and ASP.NET
ADO.NET - Data Access components, Database programming with MSAccess, SQL SERVER,
ASP.NET ASP.NET Runtime, Creating a simple page, Server controls, ASP.NET Post back,
ASP.NET AJAX Post back.
Text Books :
1.Karli Watson, Christian Nagel, Jacob Vibe Hammer, Jon D. Reid, Morgan Skinner, DanielKemper,
Beginning Visual C# 2012 Programming, Published by John Wiley & Sons, Inc.
2. Harsh Bhasin, Programming in C#, Oxford University Press 2014, New Delhi.
Reference Books :
1. John Sharp, Microsoft Visual C# 2013 Step by Step, Microsoft Press, Washington, 2013.
2. E Balaguruswamy, Programming in C#, Tata McGraw-Hill Publisher 2010, New Delhi, 3rd
Edition.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
EMBEDDED SYSTEMS (ES)
Elective-I for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS807
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand design process of Embedded systems, Complex systems with formalisms.
CO3: Understand advanced processor architectures with real world Interfacing, Devices and
Communication Buses for Networked embedded systems.
CO4: Understand software programming concepts in Assembly language, High level languages and
embedded programming in C & C++.
CO6: Understand programming environment to develop embedded systems and its debugging
techniques.
Text Books :
1.Wayne Wolf (2008), Computers as Components-principles of embedded computer system design,
Elseveir, New Delhi, India.
2. The 8051 Microcontroller, Third Edition, Kenneth J.Ayala, Thomson
3. An Embedded Software Primer, David E. Simon, Pearson Education.
Reference Books :
1. Embedded/Real-Time Systems, Dr.K.V.K.K.Prasad, dreamTech press.
2.The 8051 Microcontroller and Embedded Systems, Muhammad Ali Mazidi, Pearson.
3. Embedded Systems, Raj Kamal, Second Edition TMH.
4.Micro Controllers, Ajay V Deshmukhi, TMH.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
ADVANCED COMPUTER ARCHITECHTURE (ACA)
Elective-I for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS808
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand Fengs, Handlers and Flynns Architectural classification Schemes.
CO2: Classify Pipeline Processors based on Processing levels, Configurations and Control
Strategies.
CO3: Understand SIMD Array processors.
CO4: Determine the importance of Loosely coupled and Tightly coupled Multiprocessor systems.
CO5: Understand Interconnection network in multiprocessor architecture.
CO6: Compare data flow design alternatives: dependency driven and multilevel driven approaches.
Text Books :
1. Kai Hwang, Faye Briggs [1993], Computerarchitecture and parallel processing, TMH edition.
2. John L. Hennessy & David A. Patterson Morgan Kufmann, [3 rd Edition], Computer Architecture A
quantitative approach (An Imprint of Elsevier).
Reference Books :
1. Kai Hwang [1993], Advanced computer architecture, TMH edition.
2. Parallel Computer Architecture, A Hardware / Software Approach, David E. Culler, JaswinderPal
singh with Anoop Gupta, Elsevier.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
DESIGN AND ANALYSIS OF ALGORITHMS (DAA)
Elective-I for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS809
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand time, spacecomplexities, notations and Divide and conquer technique to solve
problems.
CO2: Apply greedy method to solve the problems.
CO3: Develop Tree and graph traversals with complexities and biconnected components and
articulation points in a graph.
CO4: Apply Dynamic programming technique to solve various problems.
CO5: Analyze Backtracking technique to solve various problems.
CO6: Understand branch & bound techniques and Lower Bound Theory.
Introduction
What is an Algorithm? Analysis, Asymptotic notation.Divide and Conquer :- General method, Binary
search, Finding Maximum and Minimum, Merge sort, Quick sort, Strassens Matrix Multiplication.
Greedy Method
The General Method, Knapsack Problem,Job Sequencing with Deadlines, Minimum-Cost Spanning
Tree, Optimal Storage on Tapes, Optimal Merge Patterns, Single Source Shortest Path.Basic Traversal
and Search Techniques :- Techniques for Binary Trees, Techniques for Graphs, Biconnected
Components and DFS.
Dynamic Programming
The General Method, Multistage Graphs, All Pairs Shortest Paths, Optimal Binary Search Trees, 0/1-
Knapsack, Reliability Design, The Travelling Salesperson Problem .
Backtracking
The General Method, The 8-Queens Problem, Sum of Subsets, Graph Coloring, Hamiltonian cycles.
Branch and Bound
The Method, Travelling Salesperson, 15 Puzzle problem, Lower Bound Theory : Comparison Trees,
Oracles and Adversary arguments, Techniques for Algebraic problems.
Text Books :
1. Ellis Horowitz, SartazSahni&SanguthevarRajasekaran, Fundamentals of Computer Algorithms,
Galgotia Publications.
Reference Books :
1. Jon Kleinberg, Eva Tardos, Algorithm Design, Pearson Education.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the internal process of Compilation.
CO2: Describe Lexical Analyzer Techniques.
CO3:. Understands both top-down and bottom-up parsers.
CO4: Illustrate Semantic Analyzer.
CO5: Define intermediate code generation and optimization techniques.
INTRODUCTION TO COMPILERS
Overview of Compilers, Analysis of the Source Program, the Phases of a Complier, Pre-Processors,
Assemblers, Two Pass Assembly, Loaders and Link-Editors, Bootstrapping, The Grouping of Phases,
Compiler Construction Tools.
LEXICAL ANALYSIS
The Role of the Lexical Analyzer, Strings and Languages, Operations on Languages, Regular
Expressions, Regular Definitions, Notational Shorthand's, Recognition of Tokens, A Language for
specifying Lexical Analyzers(LEX).
SYNTAX ANALYSIS
The Role of the Parser, Context-free Grammars, Writing a Grammar. Top-Down Parsing: Recursive
Descent Parsing, Predictive Parsers, Non-Recursive Predictive Parsing, First and Follow, Construction
of Predictive Parsing Tables, LL(1) Grammars, Error Recovery in Predictive Parsing. Bottom-Up
Parsing: Handles, Handle Pruning, Stack Implementation, Operator-Precedence Parsing, LR Parsers-
SLR, Canonical LR, LALR. Using Ambiguous Grammars, Parser Generator (YACC). Syntax-Directed
Translation: Syntax-Directed Definition, Construction of Syntax Trees, S-Attributed definitions, L-
Attributed Definitions.
SEMANTIC ANALYSIS
Type Systems, Specification of a Type Checker, Equivalence of type-expressions, Type Conversions,
Overloading of functions and operators, Polymorphic functions, Algorithm for Unification. Run-Time
Environment: Source Language Issues, Storage Organization, Storage Allocation Strategies, Blocks,
Access Links, Procedure Parameters, Displays, Parameter Passing, Symbol Tables.
INTERMEDIATE CODE GENERATION
Intermediate Languages-Graphical Representations, Three Address Code,implementations, Boolean
Expressions. Code Optimization: Introduction, Principle sources of Optimization, Optimization of
Basic Blocks. Code Generation: Issues, the Target Machine, Run-Time Storage Management, Basic
Blocks and Flow graphs, Loops in Flow graphs, Data-Flow Analysis of Structured Flow graphs,
Peephole Optimization, DAG, Simple Code Generator.
Text Books :
1. Alfred V Aho, Ravi Sethi, Jeffrey D.Ullman, Compilers-Principles Techniques and Tools, 2 nd Edition,
Pearson Education, 2008.
Reference Books :
1. Raghavan, Principles of Compiler Design, 2nd Edition, TMH, 2011.
2. Kenneth C.Louden, Compiler Construction-Principles andPractice, 2ndEdition, Cengage, 2010.
3. Cooper and Linda, Engineering a Compiler, 4th Edition, Elsevier, 2008.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
ARTIFICIAL INTELLIGENCE(AI)
Elective-II for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS811
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the basic principles and applications of Artificial Intelligence.
CO2: Formalize a given problem in the language/framework of different AI methods (search
problem, as a constraint satisfaction problem).
CO3: Represent Knowledge using Predicate logic and rules.
CO4: Describe the basic notions of formal language involving automatic syntactic and semantic
analysis.
Text Books :
1. Elaine Richie Kevin Knight [2008], [2nd Edition], Artificial Intelligence, TMH.
2. Dan W.Patterson, Introduction to Artificial Intelligence and Expert Systems Prentice Hal
of India.
Reference Books :
1. Stuart Russell, Peter Norvig [2008], [2 nd Edition], Artificial Intelligence A Modern
Approach, Pearson Education.
2. Nils J. Nilsson: Principles of Artificial Intelligence Narosa Publication house.
3. Artificial Intelligence, Winston, Patrick, Henry, Pearson Education.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand Parallel and Cluster Computing.
CO2: Demonstrate Time complexity of Parallel Programs
CO3: Understand Computing Platform for Pipelined Applications.
CO4: Understand Dynamic Load Balancing and Distributed termination detection algorithms.
CO5: Demonstrate Parallelism constructs and Parallel programming Language Constructs.
CO6: Use Sorting and Numerical Algorithms for Solving matrices and Linear equations.
Introduction
Basic Techniques, Parallel Computers for increase Computation speed, Parallel & Cluster Computing.
Pipelining
Techniques, Computing platform, Pipeline programs examples. Synchronous Computations -Load
balancing, Dynamic Load Balancing, Distributed Termination Detection Algorithms and Examples.
Programming with shared memory
Shared memory multiprocessor constructs for specifying parallelism, sharing data, parallel
programming languages and constructs, open MP.
Text Books :
1. Parallel Programming, Barry Wilkinson, Michael Allen, Pearson Education, 2nd Edition.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
CLIENT SERVER COMPUTING(CSC)
Elective-II for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS813
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the evolution, benefits of client server computing.
CO2: Gain the knowledge on client components, client software products and client requirements.
CO3: Learn about categories of servers, network management and network computing
environment.
CO4: Understand the server requirements, server data management and access tools.
CO5: Understand the application development environments and reengineering of client and server
applications.
Introduction
Basics, Benefits of client/server computing, Evolution of client/server computing. Trends, Overview of
client/server applications- components, classes, categories. Understanding of client/server computing :
Dispelling the Myths, Obstacles Upfront and hidden, open systems and standards settings,
organizations, factors for success.
Client Hardware & Software
Client components, Client operating systems, What is GUI?, X-Windows versus Windowing, Database
access, Application logic, Client software products: GUI environments, converting 3260/5250 screens,
Database access tools. Client Requirements : GUI design standard, open GUI standards, Interface
independence, Testing interfaces, Development aids
Server Hardware
Bench marks, Categories of servers, Features of server machines, Classes of server machines, Eight
layers of software , Network management environment, Network computing environment, Extensions,
Network operating system, Loadable modules, Server operating systems: OS/2 2.0, Windows new
technology, Unix based operating system.
Server Requirements
Platform independence, Transaction processing, Collectivity, Intelligent database, Stored procedures,
Triggers, Load leveling, Optimizer, Testing and diagnostic tools, Reliability, Backup and recovery
mechanisms. Server data management and access tools: Data manager features. Data management
software, Database gateways, Overview of networking, LAN hardware, Network operating systems.
Development & Deployment Methodology
Convert existing screen interfaces, COBOL to COBOL migration, Reengineering existing applications,
Business reengineering, Methodology tools, Application development environments, Distributed
transaction management, Integrating multi vendor environments, Production requirements. Mobile
computing, More Robust servers, Integration of network and server operating systems, Use of object
technologies, ATM switching.
Text Books :
1. Dawna Travis Dewire ,James Martin [2003], Client/Server computing, McGraw-HILL
Productivity Series.
Reference Books :
1. Robert Orfali,DanHarken,JeriEdwards,Client/Server Survival Guide,Wiley India III Edition.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
PATTERN RECOGNITION (PR)
Elective-II for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS814
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Identify the possibilities and limitations of pattern recognition.
CO2: Apply tradeoffs involved in various classification techniques.
CO3: Validate and assess different clustering techniques.
CO4: Apply various dimensionality reduction methods whether through feature selection or feature
extraction.
CO5: Apply pattern recognition in decision making in several real time problems.
Introduction
Basic concepts, Applications, Fundamental problems in pattern Recognition system design, Design
concepts and methodologies, Examples of Automatic Pattern recognition systems, Simple pattern
recognition model. Decision And Distance Functions - Linear and generalized decision functions,
Pattern space and weight space, Geometrical properties, implementations of decision functions,
Minimum-distance pattern classifications.
Statistical Decision Making
Introduction, Bayes theorem, Multiple features, Conditionally independent features, Decision
boundaries, Unequal cost of error, estimation of error rates, the leaving-one-out-techniques,
characteristic curves, estimating the composition of populations. Bayes classifier for normal patterns.
Non Parametric Decision Making - Introduction, histogram, kernel and window estimation, nearest
neighbour classification techniques. Adaptive decision boundaries, adaptive discriminate functions,
Minimum squared error discriminate functions, choosing a decision making techniques.
Clustering And Partitioning
Hierarchical Clustering: Introduction, agglomerative clustering algorithm, the single-linkage, complete-
linkage and average-linkage algorithm. Wards method Partition clustering-Forgs algorithm, K-meanss
algorithm, Isodata algorithm.
Pattern Pre-processing And Feature Selection
Introduction, distance measures, clustering transformation and feature ordering, clustering in feature
selection through entropy minimization, features selection through orthogonal expansion, binary feature
selection.
Text Books :
1.Gose. Johnsonbaugh. Jost. Pattern recognition and Image Analysis, PHI.
2. Tou. Rafael. Gonzalez. Pattern Recognition Principle, Pearson Education.
Reference Books :
1. Richard duda, Hart, David Strok, Pattern Classification, John Wiley.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
DISTRIBUTED OPERATING SYSTEM (DOS)
Elective-II for M.Tech CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS815
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the goals, design issues and communication scenarios of a Distributed System.
CO2: Describe synchronization problems and deadlocks in distributed systems.
CO3: Understand the Concept of threads and scheduling in distributed systems.
CO4: Classify the system models, Processor Allocation algorithms.
CO5: Understand the File System and shared memory concepts in Distributed Systems.
CO6: Obtain the knowledge of Java RMI, NFS.
Text Books :
1. Andrew S. Tanenbaum [2008] Distributed Operating System, PE.
2. Herbert Schildt [2008],[5th Edition], The Complete Reference Java2, TATA McGrawHill.(Java
RMI).
Reference Books :
1. MukeshSinghal, Niranjan G. Shivaratri [1994], Advanced Concepts in Operating Systems.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
SOFTWARE PROJECT MANAGEMENT (SPM)
II Semester : CSE Scheme : 2017
Course Code Hours/Week Credits Maximum Marks
Continuous
L T P C Internal End Exam TOTAL
CS816
Assessment
3 - - 3 40 60 100
Sessional Exam Duration : 2 Hrs End Exam Duration: 3 Hrs
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the Processes, Project Management, Capability Maturity Model and Project
Planning Infrastructure.
CO2: Define standard process, process tailoring and change management process.
CO3: Estimate effort of software project using bottom-up, top-down and use case points approach.
CO4: Determine schedule of software project using overall scheduling and detailed scheduling.
CO5: Describe risk management activities, measurements and project tracking.
CO6: Explain team management, project management plan and configuration management process.
CO7: Understand review process, project monitoring and milestone analysis.
Text Books :
1. Pankaj Jalote [2002], Software Project Management in Practice, Pearson Education.
2. Walker Royce [1998], Software Project Management, Pearson Education.
Reference Books :
1.Sommerville [2008], [7th Edition], Software Engineering, Pearson Education.
2. Roger S.Pressman [2005], [6th Edition], Software Engineering, A Practitioners Approach, Mc
GrawHill International Edition.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the basic concepts of wireless communication & mobile computing .
CO2 Learning about wireless medium access controling mechanisms
:SDMA,FDMA,TDMA,CDMA
CO3: Understand the basic concepts of GSM, System Architecture, Protocol Architecture,
Handovers, DECT, TETRA.
CO4: Understand the WLAN System Architecture, ProtocolArchitecture, PhysicalLayer, Mac
Management
CO5: Acquiring knowlege on the structure & concepts of Mobile IP ,Encapsulation
Methods,DHCP.
CO6: Get knowledge about Traditional TCP and Classical Improvements of TCP.
Wireless transmission
Frequencies for radio transmission, Signals, Antennas, Signal propagation, Multiplexing, Modulation,
Spread spectrum, Cellular systemsMedium access control: Motivation for a Specialized MAC, SDMA,
FDMA, TDMA, CDMA, Comparison of S/T/F/CDMA.
GSM
GSM: Mobile services, System Architecture, Radio interface, Protocols, Localization and calling,
Handover, SecurityDECT System architecture, Protocol architecture, TETRA.
Wireless LAN
Infrared Vs Radio Transmission, Infra Red and ad-hoc network IEEE 802.11: System architecture,
Protocol architecture, Physical layer, Medium access control layer, MAC management, 802.11b,
802.11a, Bluetooth
Mobile IP
Goals & requirements, Entities and terminology, IP Packet delivery, Agent discovery, Registration,
Tunneling & encapsulation, Optimizations, Reverse tunneling, IPv6, IP micro- mobility support,
Dynamic host Configuration protocol.
Traditional TCP
Congestion control, Slow start, Fast retransmit/fast recovery, implications of mobility, Classical TCP
improvements.
Text Books :
1.Jochen Schiller, Mobile Communications, [Second Edition], Low price edition Pearson Education
Reference Books :
1.Talukder, Mobile Computing: Technology, Applications & service creation, TMH.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: State the roots, deployment models and features of cloud computing. .
CO2: Summarize the usage and characteristics of virtualization in a cloud computing environment.
CO3: Illustrate thread, task and map reduce programming models using Aneka.
CO4: Explain the steps involved in creating apps using Salesforce.com and Google App Engine.
CO5: Understand GrepTheWeb architecture and ECG using Amazon cloud.
Introduction to Cloud Computing
Roots of Cloud Computing, Layers and Types of Clouds, features of a Cloud, Challenges and Risks.
Virtualization
Introduction, Characteristics of Virtualized Environments, Virtualization and Cloud Computing, Pros
and Cons of Virtualization, Technology Examples.
Text Books :
1. "Cloud Computing: A Practical Approach" by Toby Velte, Anthony Velte, Robert
Elsenpeter.McGraw-Hill, Inc. New York, NY, USA.
2. RajkumarBuyya, Christian Vecchiola, S.ThamaraiSelvi, "Mastering Cloud Computing", 1st
Edition, McGraw Hill Publications.
Reference Books :
1. RajKumarBuyya, James Broberg, "Cloud Computing Principles and Paradigms", John
Wiley & Sons Publications.
2. Judith Hurwitz, R Bloor, M Kanfman, F Halper, "Cloud Computing for Dummies", 1st
Edition, Wiley Publishers, 2009.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
OOAD AND DESIGN PATTERNS (OOADDP)
Course Outcomes : At the end of the course the student will be able to
CO1: Understand UML importance in basic structural modeling.
CO2: Explain advanced concepts in modeling static view of a system.
CO3: Describe the Dynamic aspect scenarios using UML Behavioral Diagrams.
CO4: understand the importance of design patterns in solving object oriented design problems.
CO5: apply the design patterns inDesigning a Document Editor.
Introduction
Introducing UML, Conceptual Model of UML
Basic Structural Modeling: Classes, Class Diagrams, Instances and Object Diagrams
Text Books :
1. " Grady Booch, James Rumbaugh, Ivar Jacobson, The Unified Modeling Language User
Guide, Pearson Education.
2. Ali Bahrami Irwin [1999], Object Oriented Systems Development, McGraw Hill.
3. Erich Gamma [2008], Design Patterns elements of reusable object oriented software,
Pearson Education.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: State the artificial neural network architecture.
CO2: Design perceptron network with back propagation technique, auto associative network,
bidirectional associative network,Kohonen Self-Organizing Feature Map, Learning Vector
Quantization and Counter Propagation Network.
CO3: Explain the fuzzy logic, fuzzy relation, fuzzy arithmetic and fuzzy measures.
CO4: Understand fuzzy rule base system and approximate reasoning system.
CO5: Explain encoding, selection, crossover and mutation technique in genetic algorithm.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand core concepts, models and basic algorithms involved in processing and retrieval
of information.
CO2: Formulate queries to evaluate existing information retrieval systems.
CO3: Perform clustering, searching and visualization techniques on Retrieval Systems.
CO4: Understand software and hardware text search algorithms.
CO5: Assess the performance of Information systems.
CO6: Apply theories to effectively solve information retrieval problems in real world situations
Introduction
Basic Concepts, Past, Present and Future of IRS, Retrieval Process. Modeling: Introduction, A
taxonomy of IR Models, Retrieval: Ad-hoc and Filtering, A Formal Characterization of IR Models,
Classic IR, Alternative Set Theoretic Models, Alternative Algebraic Models.
Retrieval Evaluation
Introduction, Retrieval Performance Evaluation, Reference Collections. Query languages:
Introduction, Keyword-based querying, Pattern Matching, Structural Queries, Query Protocols.
Document and Term Clustering: Introduction, Thesaurus generation, Item clustering, Hierarchy of
Clusters User Search Techniques: Search Statements and Binding, Similarity measures and ranking,
Relevance Feedback, Selective Dissemination of Information Search, Weighted Searches of Boolean
Systems, Searching the INTERNET and Hypertext- Information Visualization: Introduction,
Cognition and perception, Information Visualization Technologies.
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the importance of software quality/software testing and apply software testing
techniques for information systems development.
CO2: Generate test cases from software requirements using various test processes for continuous
quality improvement.
CO3: Apply software testing techniques in commercial environments and assess the adequacy of
test suites using control flow, data flow, and program mutation.
CO4: Identify the graph and transaction flows implementation use of various testing techniques.
CO5: Understand the importance and limitations of domain testing. Differentiate ugly and nice
domains.
Software Quality
What is Software quality, Total Quality management.
Software quality metrics, product quality metrics, In-process quality metrics, metrics for software
quality maintenance, Examples.
Software Testing
Introduction, Purpose of testing, Some Dichotomies, Model for testing, Consequences of bugs,
Taxonomy for bugs.
Flow Graphs and Path Testing
Path testing basics, Path Predicates and Achievable paths, Path Sensitizing, Path Instrumentation.
Fuzzy Rule Base and Approximate Reasoning Transaction Flow Testing
Flows, Transaction Flow Testing Techniques
Data Flow Testing : Basics and Testing Strategies.
Genetic Algorithm Domain Testing
Domains and paths, Domain Testing, Domains and Interface Testing, Domains and Testability.
Text Books :
1. Stephen H. Kan [2008], Metrics and Models in Software Quality Engineering, Pearson
Education
2. Boris Beizer, Software Tesing Techniques, Dreamtech Press
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: understand basic neural network architecture and algorithms.
CO2: understand data pre and post processing.
Introduction
- what is a neural network? Human Brain, Models of a Neuron, Neural networks viewed as Directed
Graphs, Feedback, Network Architectures, Knowledge Representation, Artificial Intelligence and
Neural Networks.
Learning Process
Error Correction learning, Memory based learning, Hebbian learning, Competitive, Boltzmann
learning, Credit Assignment Problem, Supervised and Unsupervised Learning, Memory, Adaption,
Statistical nature of the learning process.
Multilayer Perceptron
Back propagation algorithm, XOR problem, Heuristics for Making the Back-propagation Algorithm
Perform Better, Output representation and decision rule, Computer experiment, feature detection,- Back
Propagation and differentiation, Hessian matrix, Generalization, Cross validation, Network pruning
Techniques, Virtues and limitations of back propagation learning.
Text Books :
1.Simon Haykin,[2nd edition], [2005] Neural networks A comprehensive foundations, Pearson
Education.
Reference Books :
1.Neural networks in Computer intelligence, Li Min Fu TMH 2003
2.Artificial neural networks - B.Vegnanarayana Prentice Hall of India P Ltd 2005
3.Neural networks James A Freeman David M.Skapura Pearson education 2004
4.Neural Networks for Applied Sciences and Engineering, Sandhya Samarasinghe,Auerbach
Publications 2006
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each.
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the vision of IoT from a global context.
CO2: Understand the application of IoT.
CO3: Determine the Market perspective of IoT.
CO4: Use of Devices, Gateways and Data Management in IoT.
CO5: Building state of the art architecture in IoT.
CO6: Understand the application of IoT in Industrial and Commercial Building Automation and
Real World Design Constraints.
CO7: Understand the application of IoT.
IoT& Web Technology
The Internet of Things Today, Time for Convergence, Towards the IoT Universe, Internet of Things
Vision, IoT Strategic Research and Innovation Directions, IoT Applications, Future Internet
Technologies, Infrastructure, Networks and Communication, Processes, Data Management, Security,
Privacy & Trust, Device Level Energy Issues, IoT Related Standardization, Recommendations on
Research Topics.
M2M to IoT
A Basic Perspective Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An
emerging industrial structure for IoT, The international driven global value chain and global
information monopolies.
M2M to IoT-An Architectural Overview Building an architecture, Main design principles and needed
capabilities, An IoT architecture outline, standards considerations.
IoT Architecture
State of the Art Introduction, State of the art, Architecture Reference Model- Introduction, Reference
Model and architecture, IoT reference Model, IoT Reference Architecture- Introduction, Functional
View, Information View, Deployment and Operational View, Other Relevant architectural views.
Text Books :
Vijay Madisetti and ArshdeepBahga, Internet of Things (A Hands-on-Approach), 1st Edition, VPT,
2014
Francis daCosta, Rethinking the Internet of Things: A Scalable Approach to Connecting Everything,
1st Edition, Apress Publications, 2013
3. CunoPfister, Getting Started with the Internet of Things, OReilly Media, 2011, ISBN: 978-1-4493-
9357-1
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
DISTRIBUTED DATABASES (DD)
Text Books :
1.Distributed Databases Principles &Systems ,StefanoCeri,GiuseppePelagatti, TMH.
Reference Books :
1.Principles of Distributed Database Systems. M. TemerOzsu, Patrick Valduriez, pearson
Education,2nd Edition.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the Principles of Distributed Databases. Upon the completion of this course,
students should have achieved the following objectives.
CO2: Have a fundamental understanding of the objectives of cryptography and network security.
CO3: Apply Substitution and Transposition Encryption Techniques.
CO4: Compare the performance of Symmetric and AsymmetricEncryption Techniques.
CO5: Understand Hash function and Message Authentication code.
CO6: Understand the need of Digital Signatures andKerberos its techniques.
Overview
Services, Mechanisms and Attack, The OSI Security Architecture: Security Services, Availability
Services, Security Mechanisms and Security Attacks, A model for Network Security.
Translation of Global Queries to Fragment Queries ClassicalEncryption Techniques
SymmetricCipher Model, Substitution Techniques : Caesar Cipher, MonoalphabeticCipher, Playfair
Cipher, Hill Cipher, MonoalphabeticCipher, One-Time Pad, Transposition Techniques. Block Ciphers
and the Data Encryption Standard: Simplified DES, Block Cipher Principles, The DES, The Strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles, Block Cipher modes of
Operation.
Public Key Cryptography and RSA
Principles of Public Key Cryptosystems, The RSA Algorithm. Key Management: Key Management,
Diffie Hellman Key Exchange.
Message Authentication and Hash Functions
Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash
Functions, Security of Hash Functions and MACs. Hash Algorithms: MD5 Message Digest Algorithm:
MD5 Logic, MD5 Compression function, MD4, Strength of MD5, Secure Hash algorithm: SHA-1
Logic, Compression function, Comparison of SHA-1 and MD5, Revised Secure Hash Standard.
Digital Signatures and Authentication Protocols
Digital Signatures, Authentication Protocols: Mutual Authentication, Symmetric Authentication
approaches, Public-key Encryption approaches and One-Way Authentication, Digital Signature
Standard.
Authentication Applications: Kerberos: Motivation, Kerberos Version 4, Kerberos Version 5, X.509.
Text Books :
1.William Stallings [2008], [4th Edition], Cryptography and Network Security: Principles and
Practices, Pearson Education.
Reference Books :
1.William Stallings [2008], [3rd Edition], Network Security Essentials (Applications and Standards),
Pearson Education.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand Data mining, its issues, applications, trends, techniques and algorithms.
CO2: Determine the use of classification and prediction techniques and cluster analysis.
CO3: Use statistical techniques to carry out the visual analysis of data.
CO4: Compare static graphics and interactive graphics.
Introduction to Data mining
What is Data Mining, Integration of Data Mining system with a Database or a Data Warehouse
System, Major issues in Data Mining, Applications and Trends in Data Mining.
Algorithms & Data mining
Mining Frequent Patterns, Associations, Basic Concepts, Efficient and Scalable Frequent Itemset
Mining methods Mining various kinds of association rules, from association analysis to Correlation
analysis, constraint-based association mining.
Classification and Prediction
What is classification, What is Prediction, Classification by Decision tree Induction, Bayesian
classification, Rule based classification, Prediction: Linear Regression, non-linear regression
Cluster Analysis
Types of data in cluster analysis, classical Partitioning methods : k-Means and k-Medoids.
Interactive Visual Data Analysis
Challenges faced by everyday data analysts, A brief history of interactive visual data analysis,
Differences between statics graphics and interactive graphics.
Text Books :
1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Second Edition,
Elsevier.
2. Michael Berry and Gordon Linoff, Data Mining Techniques, Wiley Publishing, 2004.
3. Kimball and Ross, The Data Warehouse Toolkit, Second Edition, John Wiley & Sons, 2002.
4. T. Davenport, Competing on Analytics, Harvard Business Review (Decision Making), January
2006.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
DATA WAREHOUSING AND MINING (DWM)
Course Outcomes : At the end of the course the student will be able to
CO1: Understand the delivery process, process flow and overall architecture of a data warehouse.
CO2 Understand the ETL process of a data warehouse and each component in detail in the
architecture.
CO3: Determine Business, Design, Technical and implementation considerations, Benefits of a Data
warehouse DBMS schemas and tool requirements.
CO4: Perform Extract, transform and Load process of some sample data to some target table using
informatics tool.
CO5: Identify the process of data mining, its major issues and applications
CO6: Apply the decision trees, Nearest Neighbor and clustering techniques in case studies.
Introduction
Delivery Process, System Process Process flow, Extraction and Loading of Data, Clean and
Transform Data, Backup and Query Management process.Process Architecture Various types of
Managers and information.
Data Warehousing Components: Overall Architecture, Datawarehouse database, Sourcing, Acquisition
Cleanup and Transformation Tools,Meta Data, Access tools, Data Marts, Data warehouse
Administration and Management.
Building a Data Warehouse
Business considerations, Design considerations, Technical considerations, Implementation
considerations, Integrated solutions, Benefits of data warehousing. Mapping Data warehouse to
Multiprocessor Architecture.
DBMS Schemas for Decision Support
Data layout for best access, Multidimensional data model, Star schema, Star Join and StarIndex,
Bitmapped Indexing, Column Local storage, Complex Data types. Data Extraction, Cleanup and
Transformation Tools: Tool Requirements, Access to Legacy data, Transformation Engines, Metadata:
Metadata Defined, Metadata Interchange Initiative, Metadata Repository, Metadata Management,
Implementation Examples, Metadata Trends.
Reporting and Query Tools
Reporting Tools, Managed Query Tools, Executive Information system Tools, OLAP Tools, Data
Mining Tools. OLAP Need for OLAP, Guidelines, Categorization. Patterns and Models Where and
What of a Model, Sampling, Experimental Design.
Introduction to Data mining
What is Data Mining, Integration of Data Mining system with a Database or a Data Warehouse
System, Major issues in Data Mining, Applications and Trends in Data Mining. Decision Trees
What and where How of Decision Trees, Nearest Neighbour and Clustering, General Idea. Case
Studies.
Text Books :
1. 1. Sam Anahory and Dennis Murray [2008], Data Warehousing in the Real World, Pearson
Education.
2. Alex Berson, Stephen J. Smith [2008], Data Warehousing, Data Mining & OLAP, TMH.
Reference Books :
1. Jiawei Han, Micheline Kamber, Elsevier [2008], Data Mining concepts and techniques.
2. Margaret H. Dunham, S. Sridhar [2003], Data Mining Introductory and Advanced Topics
,Pearson Education.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
DATA ANALYTICS (DA)
Course Outcomes : At the end of the course the student will be able to
CO1: Illustrate 6 Phases Of Data Analytics Life Cycle.
CO2: Make an initial analysis of the data using R.
CO3: Determine The Number of Clusters for a Given Use Case Using K-Means
Clustering algorithm.
CO4: Identify The Frequent Item Sets For A Given Data Using Apriori Algorithm.
CO5: Describe Linear And Logistic Regression Models.
CO6: Classify The Given Data Using Decision Tree And Naive Bayes Classifier.
CO7: Demonstrate Time Series Analysis Using ARIMA Model.
CO8: Describe the Challenges and Tools for Analyzing Text and other Unstructured Data.
Introduction to Big Data Analytics, Data Analytics Lifecycle
Overview, Discovery, Data Preparation, Model Planning, Model Building, Communicate Results,
Operationalize, Case Study: Global Innovation Network and Analysis (GINA). Review of Basic Data
Analytic Methods Using R: Introduction to R, Exploratory Data Analysis, Statistical Methods for
Evaluation.
Advanced Analytical Theory and Methods
Clustering: Overview, K-means, Additional Algorithms. Association Rules: Overview, A priori
Algorithm, Evaluation of Candidate Rules, Applications of Association Rules, An Example: Transactions
in a Grocery Store, Validation and Testing, Diagnostics.
Advanced Analytical Theory and Methods: Regression
Linear Regression, Logistic Regression, Reasons to Choose and Cautions, Additional Regression
Models. Classification: Decision Trees, Naive Bayes, Diagnostics of Classifiers, Additional
Classification Methods.
Advanced Analytical Theory and Methods: Time Series Analysis
Overview of Time Series Analysis, ARIMA Model. Additional Methods. Text Analysis: Text Analysis
Steps, A Text Analysis Example, Collecting Raw Text, Representing Text, Term Frequency-Inverse
Document Frequency (TFIDF), Categorizing Documents by Topics, Determining Sentiments, Gaining
Insights.
Advanced Analytics-Technology and Tools: Map Reduce and Hadoop
Analytics for Unstructured Data, The Hadoop Ecosystem.
Text Books :
1.Data Science & Big Data Analytics Discovering, Analyzing, Visualizing and Presenting Data EMC
Education Services ,Wiley Publishers.
Reference Books :
1. Mark Gardener, Beginning R - The Statistical Programming Language, John Wiley & Sons, Inc.,
2012.
2. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques, Morgan Kaufmann
Publishers, 3rd ed, 2010.
3. Thomas A. Runkler , Data Analytics: Models and Algorithms for Intelligent Data Analysis,
Springer Science & Business Media, 2012.
Question Paper Pattern:
Internal Assessment: The question paper for internal examination shall consist of Six questions and
has to answer any Four questions for 10 marks each
End Exam: The question paper for end examination shall consist of Eight questions and has to
answer any Five questions for 12 marks each
Course Outcomes : At the end of the course the student will be able to
CO1: Understand overview of research process, state the research problem and conduct a literature
review of the concepts comprising the research questions.
CO2: Study the data collection methods and process the data statistically.
CO3: Understand the basic properties of estimators, analyse the estimated data and interpret the data in
a research paper.