MACHINE LEARNING

UNIT I
INTRODUCTION:

1)Well posed Learning Problems. NOTE

2) Perspectives and Issues in Machine Learning
NOTE.
3)Concept Learning Task NOTE
4)Find S -Version Spaces and Candidate
Elimination Algorithm NOTE
5) Inductive bias NOTE
6)Decision Tree learning. NOTE
7)Algorithm
8)Heuristic Space Search in Decision Tree
Learning.

UNIT II
NEURAL NETWORKS AND GENETIC ALGORITHMS:

1)Neural Network Representation

2)Problems–
3)Perceptrons– NOTE
4)Multilayer Networks and Back Propagation
Algorithms NOTE
5)Advanced Topics in ANN
6)Evaluating Hypothesis
7) Estimating Hypothesis Accuracy
8) Sampling Theory
9)Deriving Confidence Intervals NOTE
10) Difference in error of two hypothesis.

UNIT III
BAYESIAN AND COMPUTATIONAL LEARNING:
1)Bayes Theorem –
2)Concept Learning– NOTE
3)Maximum Likelihood–
4)Minimum Description Length Principle–
5)Bayes Optimal Classifier–
6)Gibbs Algorithm–
7)Naïve Bayes Classifier –
8)Bayesian Belief Network –
9)EM Algorithm – NOTE
10)Probability Learning– NOTE
11)Sample Complexity for Finite and Infinite Hypothesis
Spaces – NOTE
12)Mistake Bound Model of Learning. NOTE

UNIT IV
INSTANT BASED LEARNING:

1)K- Nearest Neighbor Learning NOTE

2)Locally weighted Regression Ass
3)Radial Basis Functions Ass
4)Case Based Learning. NOTE
5)Genetic Algorithms– NOTE
6)Hypothesis Space Search
7)GeneticProgramming
8)Models of Evaluation and Learning.

UNIT V
ADVANCED LEARNING:

1)Learning Sets of Rules

2)Sequential Covering Algorithm
3)Learning Rule Set
4)First Order Rules Ass
5)Sets of First Order Rules
6)Induction on Inverted Deduction
7)Inverting Resolution
8)Analytical Learning
9)Perfect Domain Theories NOTE
10)Explanation Base Learning
11)FOCL Algorithm
12)Reinforcement Learning
13)Task
14)Q-Learning
15)Temporal Difference Learning.

CryptographY
Unit I
Introduction:
1)Security Goals-Cryptographic Attacks-
2)Services and Mechanism-
3)Techniques for security goals-
4)Implementation-
5)Traditional Symmetric -key ciphers: Symmetric key
cipherscategories of traditional ciphers-stream and
block ciphers
6)Introduction to modern symmetric-key ciphers:
Modern block ciphers-
7)Components of a modern block cipher –
8)two classes of product ciphers-
9) designed for block ciphers-
10)Modern stream ciphers.

Unit II
1)Encipherment using modern symmetric key ciphers:
2)Use of modern block ciphers
3)Use of stream ciphers
4)other issues
5)Asymmetric key Cryptography:
6)Difference between symmetric key and asymmetric
key Cryptosystems
7)RSA Cryptosystem
8)Rabin Cryptosystem
9)ElGamal Cryptosystem
10)Elliptic Curve Cryptosystems.

Unit III

1)Digital Signature:
2)Comparison- Process-Services
3)Attacks on Digital Signature
4)Digital Signature Schemes
5)Variations and Applications
6)Entity Authentication:
7)Entity Authentication and message authentication-
8)password
9)based Authentication
10)Challenge
11)Response Protocols
12)Zero-Knowledge Protocols
13)Biometrics
14)Key Management:
15)Symmetric Key Distribution
16)Kerberos
17) Symmetric Key Agreement
18)Public key distribution
19)Hijacking.

Unit IV

Security at the Application layer:

1)PGP and S/MIME: E-mail system
2)Pretty Good Privacy (PGP)
3)Secure/Multipurpose Internet Mail
Extension(S/MIME)
Security at the Transport Layer:
1)SSL and TLS: Security Service at the Transport Layer-
2)SSL Architecture
3)Four protocols
4)SSL Message Formats
5)Transport Layer Security.

Unit V

Security at the Network Layer: (IPSec)

1)IP Security (IPSec)
2)Modes of IPSec
3)Two Security Protocols
4)Security Association
5)Security Policy
Internet Key Exchange (IKE)-System Security:
1)Description of the system
2)Buffer overflow and Malicious Software
3)Malicious Programs
Intrusion Detection Systems (IDS)-Firewalls:
Definitions, Construction, and working principles.

ADSA
Unit I
Introduction:
1)General Trees
2)Binary Trees
3)Implementing Trees
4)Tree Traversal Algorithms
5)The Priority Queue Abstract Data Type
6)Implementing a Priority Queue
7)Heaps
8)Binary Search Trees
9)Balanced Search Trees.

Unit II
1)Algorithm Definition
2) Algorithm Specification
3)Performance Analysis
4)Asymptotic Notations.
Divide and Conquer:
1)The General Method
2)Defective Chessboard
3)Binary Search
4)Finding the Maximum and Minimum
5)Merge Sort
6)Quick Sort.

Unit III
The Greedy Method:
1)General Method
2)Knapsack Problem
3)Tree Vertex Splitting
4)Job Sequencing with Deadlines
5)Minimum Cost Spanning Trees
6)Single Source Shortest Paths.

Unit IV
Dynamic Programming:
1)The General Method
2)Multistage Graphs
3)All-Pairs Shortest Paths
4)Single- Source Shortest Paths
5)Optimal Binary Search Trees
6)String Editing
7)0/1 Knapsack
8)The Traveling Salesperson Problem.
9)Connected Components and Spanning Trees
10)Biconnected Components and DFS.

Unit V
Backtracking:
1)The General Method
2)The 8-Queens Problem
3)Sum of Subsets
4)Graph Coloring
5)Hamiltonian Cycles
Knapsack Problem Branch and Bound:
1)Least Cost search - 0/1 Knapsack Problem.

BDA
Unit I
Introduction to Big Data Analytics:
1)Big Data Overview
2)Data Structures
3)Analyst Perspective on Data Repositories
4)State of the Practice in Analytics
5)BIVersus Data Science
6)Current Analytical Architecture
7)Drivers of Big Data
8)Big Data Ecosystem
Data Analytics Lifecycle:
1)Data Discovery
Data Preparation
1)Model Planning
2)Model Building
3)Communicate Results
4)Operationalize
Case Study:
1)Global Innovation Network and Analysis (GINA).

Unit II

HADOOP Fundamentals:
1)History of Hadoop
2)Apache Hadoop and the Hadoop Ecosystem
MapReduce:
1)A weather dataset
2)Analyzing the data with Unix Tools
3)Analyzing the Data with Hadoop
4)Scaling Out
5)Hadoop Streaming
6)Hadoop Pipes
The Hadoop Distributed File System:
1) The Design of HDFS
2)HDFS Concepts
3)The command line Interface
4)Hadoop Filesystems
5)The Java Interface
6)Data flow
7)Parallel Copying with distcp
8)Hadoop Archives.

Unit III
Developing a Map Reduce Application:
1)The Configuration API
2)Configuring the Development Environment
3)Writing Unit Test
4)Running Locally on Test Data
5)Running on a Cluster
6)Tuning a Job
7)MapReduce Work flows
How Map Reduce Works:

1)Anatomy of a Map Reduce Job run

2)Failures

3)Job Scheduling-Shuffle and Sort

4)Task execution.

Unit IV

1)Setting up a Hadoop Cluster

2)Cluster specification

3)Cluster Setup and Installation

4)Hadoop Configuration
5)Security in Hadoop

6)Benchmarking a Hadoop Cluster

7)Hadoop in the cloud

Administering Hadoop:

1)HDFS - Monitoring-Maintenance.

Unit V

FRAMEWORKS Applications on Big Data Using

Pig and Hive:
1)Installing and Running Pig

2)Comparison with Databases

3)Pig Latin

4)User-define Function
5)Data processing operators

Hive :

1)Installing Hive

2)Running Hive

3)Comparison with Traditional Databases

4)HiveQL

5)Tables

6)Querying Data

7)User defined functions.

OPEN SOURCE SYSTEM

Unit I
1)Introduction-Getting Started

2)Documents-Collections

3)Databases
4)Getting and Starting MongoDB-
5)MongoDB Shell

6)Data Types

7)Basic Data Types

8)Numbers

9)Dates

10)Arrays

11)Embedded Documents _id and Object Ids

Unit II
1)Creating, Updating, and Deleting Documents
Inserting and Saving Documents

2)Removing Documents

3)Updating Documents

4)The Fastest Write This Side of Mississippi

Requests and Connections-Querying:

1)Introduction to find

2)Query Criteria

3)Type Specific Queries

4)$where Queries

5)Cursors

6)Cursor Internals.
Unit III
Indexing:
1)Introduction to Indexing

2)Unique Indexes

3)Using explain and hint

4)Index Administration

5)Geospatial Indexing

Aggregation:
1)count

2)distinct

3)group

4)MapReduce.

Unit IV
AdvancedTopics:
1)Database Commands

2)Capped Collections

GridFS:

1)Storing Files

2)Server-Side Scripting

3)Database References

Administration:

1)Starting and Stopping MongoDB

2)Monitoring

3)Security and Authentication

4)Backup and Repair.

Unit V

Replication:
1)Master-Slave Replication
2)Replica Sets
3)Performing operations on slave
How it works
4)Administration
Sharding:
1)Introduction
2)The key to sharding
3)setting up shardingproduction configuration
4)sharding administration.