CURRICULUM

M.E Computer Science and Engineering

Semester I

Cat Periods/Week Maximum Marks

Course
Course Title e C CI ES
Code L T P Total
gory A E

Theory

GEA170
Applied Probability and Statistics BS 4 0 0 4 40 60 100
1

CSB170
Advanced Computer Architecture PC 3 0 0 3 40 60 100
1

CSB170 Advanced Data Structures and

PC 4 0 0 4 40 60 100
2 Algorithms

CSA170
Research Methodology and IPR ES 2 0 0 2 40 60 100
1

CSB170
Machine Learning Techniques PC 3 0 0 3 40 60 100
3

CSB170
Principles of Programming Languages PC 3 0 0 3 40 60 100
4

Practical

CSB171 Advanced Data Structures and

PC 0 0 4 2 60 40 100
1 Algorithms Laboratory

2
Total Credits
1
 Semester II

Cat Periods/Week Maximum Marks

Course Code Course Title e C ES
gory L T P CIA Total
E

Theory

CSB1721 Big Data Analytics PC 3 0 0 3 40 60 100

CSB1722 Internet of Things PC 3 0 0 3 40 60 100

Network Design and

CSB1723 PC 3 0 0 3 40 60 100
Technologies

CSB1724 Advanced Software Engineering PC 3 0 0 3 40 60 100

CSC17** Professional Elective –I PE 3 0 3 3 40 60 100

CSC17** Professional Elective –II PE 3 0 0 3 40 60 100

Practical

CSB1731 Big Data Computing Laboratory PC 0 0 4 2 60 40 100

CSB1732 Term Paper Writing and Seminar EE 0 0 2 1 - - -

Total Credits 21

Semester III

Cat Periods/Week Maximum Marks

Course Code Course Title e C ES
gory L T P CIA Total
E

Theory

CSB1801 Security Practices PC 3 0 0 3 40 60 100

 CSC18** Professional Elective –III PE 3 0 3 3 40 60 100

CSC18** Professional Elective –IV PE 3 0 0 3 40 60 100

CSC18** Open Elective OE 3 0 0 3 40 60 100

Practical

CSB1811 Project Work Phase – I EE 0 0 12 6 60 40 100

Total Credits 18

Semester IV

Cat Periods/Week Maximum Marks

Course Code Course Title e C ES
gory L T P CIA Total
E

Practical

CSB1831 Project Work Phase – II EE 0 0 24 12 60 40 100

Total Credits 12

PROFESSIONAL ELECTIVE-I
Sl. Course
Course Title Category L T P C
No. Code
1 CSC1741 Advanced Databases PE 3 0 0 3
2 CSC1742 Cloud Computing Technologies PE 3 0 0 3
3 CSC1743 Image Processing and Analysis PE 3 0 0 3
4 CSC1744 Principles of Programming Languages PE 3 0 0 3
5 CSC1745 Web Engineering PE 3 0 0 3

PROFESSIONAL ELECTIVE-II
Sl. Course
Course Title Category L T P C
No. Code
1 CSC1771 Computer Vision PE 3 0 0 3
2 CSC1772 Mobile and Pervasive Computing PE 3 0 0 3
3 CSC1773 Parallel Programming Paradigms PE 3 0 0 3
4 CSC1774 Real Time Systems PE 3 0 0 3
5 CSC1775 Software Architectures and Design PE 3 0 0 3

PROFESSIONAL ELECTIVE-III
Sl. Course
Course Title Category L T P C
No. Code
1 CSC1841 Information Retrieval Techniques PE 3 0 0 3
2 CSC1842 Language Technologies PE 3 0 0 3
 3 CSC1843 Performance Analysis of Computer Systems PE 3 0 0 3
4 CSC1844 Software Quality Assurance and Testing PE 3 0 0 3
5 CSC1845 Speech Processing and Synthesis PE 3 0 0 3

PROFESSIONAL ELECTIVE-IV
Sl. Course
Course Title Category L T P C
No. Code
1 CSC1846 Bio-inspired Computing PE 3 0 0 3
2 CSC1847 Compiler Optimization Techniques PE 3 0 0 3
3 CSC1848 Embedded Software Development PE 3 0 0 3
4 CSC1849 Formal models of software systems PE 3 0 0 3
5 CSC1850 Social Network Analysis PE 3 0 0 3

OPEN ELECTIVE

Sl. Course
Course Title Category L T P C
No. Code
1 CSC1851 IoT for Smart Systems OE 3 0 0 3
2 CSC1852 Machine Learning and Deep Learning OE 3 0 0 3
3 CSC1853 Big Data Analytics OE 3 0 0 3
4 CSC1854 Smart Grid OE 3 0 0 3
5 CSC1855 Internet of Things and Cloud OE 3 0 0 3

Total Credits:
Semester Credits
1 21
2 21
3 18
4 12
Total 72
 Course Cate Periods/Week
Course Title Sem C
Code gory L T P S
GEA1701 APPLIED PROBABILITY AND STATISTICS I BS 4 0 0 2 4
Course Learning BTL
Pre-requisite Probability and Queuing Theory Theory
Type Level 4
Course Objectives:
To encourage students to develop a working knowledge of the central ideas of Linear Algebra, Probability and
Random Variables.
Course Outcomes:
Upon completion of the course, the students will be able to:
CO Course Outcomes
CO1 Apply the concepts of Linear Algebra to solve practical problems.
CO2 Use the ideas of probability and random variables in solving engineering problems.
Be familiar with some of the commonly encountered two dimensional random variables and be equipped
CO3
for a possible extension to multivariate analysis.
CO4 Use statistical tests in testing hypotheses on data.
Develop critical thinking based on empirical evidence and the scientific approach to knowledge
CO5
development.
Syllabus
Module I LINEAR ALGEBRA 12
Vector spaces – norms – Inner Products – Eigen values using QR transformations – QR factorization –
generalized eigenvectors – Canonical forms – singular value decomposition and applications – pseudo inverse –
least square approximations.
Module II PROBABILITY AND RANDOM VARIABLES 12
Probability – Axioms of probability – Conditional probability – Baye’s theorem – Random variables – Probability
function – Moments – Moment generating functions and their properties – Binomial, Poisson , Geometric, Uniform,
Exponential, Gamma and Normal distributions – Function of a random variable.
Module III TWO DIMENSIONAL RANDOM VARIABLES 12
Joint distributions – Marginal and conditional distributions – Functions of two-dimensional random variables –
Regression curve – Correlation.
Module IV TESTING OF HYPOTHESIS 12
Sampling distributions – Type I and Type II errors – Small and Large samples – Tests based on Normal, t, Chi
square and F distributions for testing of mean , variance and proportions – Tests for independence of attributes
and goodness of fit.
Module V MULTIVARIATE ANALYSIS 12
Random vectors and matrices – Mean vectors and covariance matrices – Multivariate normal density and its
properties – Principal components – Population principal components – Principal components from standardized
variables.
Total Hours 60
Learning Resources:
Reference Books:
Dallas E Johnson, “Applied multivariate methods for data Analysis”, Thomson and Duxbury press,
1
Singapore, 1998..
Richard A. Johnson and Dean W. Wichern, “Applied multivariate statistical Analysis”, Pearson Education,
2
Fifth Edition, 6th Edition, New Delhi, 2013.
3 Bronson, R.,”Matrix Operation” Schaum’s outline series, Tata McGraw Hill, New York, 2011.
Oliver C. Ibe, “Fundamentals of Applied probability and Random Processes”, Academic Press, Boston,
4
2014.
Johnson R. A. and Gupta C.B., “Miller and Freund’s Probability and Statistics for Engineers”, Pearson India
5
Education, Asia, 9th Edition, New Delhi, 2017
 Course Cate Periods/Week
Course Title Sem C
Code gory L T P S
CSB1701 ADVANCED COMPUTER ARCHITECTURE I PC 3 0 0 1 3
Course Learning BTL
Pre-requisite Computer Organization and Architecture Theory
Type Level 4
Course Objectives:
To introduce the students to the recent trends in the field of Computer Architecture and identify performance
related parameters.
Course Outcomes:
Upon completion of the course, the students will be able to:
CO Course Outcomes
CO1 Identify the limitations of ILP
Discuss the issues related to multiprocessing and suggest solutions, Point out the salient features of
CO2
different multicore architectures and how they exploit parallelism
CO3 Discuss the various techniques used for optimising the cache performance.
CO4 Design hierarchal memory system
CO5 Point out how data level parallelism is exploited in architectures, interfaces
Syllabus
Module I FUNDAMENTALS OF COMPUTER DESIGN AND ILP 9
Fundamentals of Computer Design – Measuring and Reporting Performance – Instruction Level Parallelism and its
Exploitation – Concepts and Challenges –Exposing ILP - Advanced Branch Prediction - Dynamic Scheduling -
Hardware-Based Speculation - Exploiting ILP - Instruction Delivery and Speculation - Limitations of ILP -
Multithreading
Module II MEMORY HIERARCHY DESIGN 9
. Introduction – Optimizations of Cache Performance – MemoryTechnology and
Optimizations – Protection: Virtual Memory and Virtual Machines – Design of Memory Hierarchies – Case Studies
Module III MULTIPROCESSOR ISSUES 9
Introduction- Centralized, Symmetric and Distributed Shared Memory Architectures –Cache Coherence Issues –
Performance Issues – Synchronization – Models of Memory Consistency – Case Study-Interconnection Networks
– Buses, Crossbar and Multi-stage Interconnection Networks
Module IV MULTICORE ARCHITECTURES 9
Parallel processing challenges – Flynn‘s classification – SISD, MIMD, SIMD, SPMD, and Vector Architectures -
Hardware multithreading – Multi-core processors and other Shared Memory Multiprocessors - Introduction to
Graphics Processing Units, Clusters, Warehouse Scale Computers and other Message-Passing Multiprocessors
Module V VECTOR, SIMD AND GPU ARCHITECTURES 9
Introduction-Vector Architecture – SIMD Extensions for Multimedia – Graphics Processing Units – Case Studies –
GPGPU Computing – Detecting and Enhancing Loop Level Parallelism-Case Studies.
Total Hours 45
Learning Resources:
Reference Books:
Darryl Gove, “Multicore Application Programming: For Windows, Linux, and Oracle Solaris”, Pearson,
1
2011.
2 David B. Kirk, Wen-mei W. Hwu, “Programming Massively Parallel Processors”, Morgan Kauffman, 2010.
David E. Culler, Jaswinder Pal Singh, “Parallel computing architecture: A hardware/software approach” ,
3
Morgan Kaufmann /Elsevier Publishers, 1999.
John L. Hennessey and David A. Patterson, “Computer Architecture – A Quantitative Approach”, Morgan
4
Kaufmann / Elsevier, 5th edition, 2012.
5 Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw Hill, NewDelhi, 2003.

Course Cate Periods/Week

Course Title Sem C
Code gory L T P S
ADVANCED DATA STRUCTURES AND I
CSB1702 PC 3 0 0 1 3
ALGORITHMS
Course Learning BTL
Pre-requisite Data Structures Theory
Type Level 4
Course Objectives:

To select and design data structures and algorithms that is appropriate for problems.

Course Outcomes:
Upon completion of the course, the students will be able to:
CO Course Outcomes
CO1 Design data structures and algorithms to solve computing problems.
CO2 Choose and implement efficient data structures and apply them to solve problems.
Design algorithms using graph structure and various string-matching algorithms to solve real-life
CO3
problems.
CO4 Design one’s own algorithm for an unknown problem.
CO5 Apply suitable design strategy for problem solving.
Syllabus
Module I ROLE OF ALGORITHMS IN COMPUTING & COMPLEXITY ANALYSIS 9
Algorithms – Algorithms as a Technology -Time and Space complexity of algorithms- Asymptotic 14 analysis-
Average and worst-case analysis-Asymptotic notation-Importance of efficient algorithms- Program performance
measurement - Recurrences: The Substitution Method – The Recursion-Tree Method- Data structures and
algorithms.
Module II HIERARCHICAL DATA STRUCTURES 9
Binary Search Trees: Basics – Querying a Binary search tree – Insertion and Deletion- Red Black trees: Properties
of Red-Black Trees – Rotations – Insertion – Deletion -B-Trees: Definition of B -trees – Basic operations on B-
Trees – Deleting a key from a B-Tree- Heap – Heap Implementation – Disjoint Sets - Fibonacci Heaps: structure –
Mergeable-heap operationsDecreasing a key and deleting a node-Bounding the maximum degree.
Module III GRAPHS 9
Elementary Graph Algorithms: Representations of Graphs – Breadth-First Search – Depth-First Search –
Topological Sort – Strongly Connected Components- Minimum Spanning Trees: Growing a Minimum Spanning
Tree – Kruskal and Prim- Single-Source Shortest Paths: The Bellman-Ford algorithm – Single-Source Shortest
paths in Directed Acyclic Graphs – Dijkstra‘s Algorithm; Dynamic Programming - All-Pairs Shortest Paths: Shortest
Paths and Matrix Multiplication – The Floyd-Warshall Algorithm
 Module IV ALGORITHM DESIGN TECHNIQUES 9
Dynamic Programming: Matrix-Chain Multiplication – Elements of Dynamic Programming – Longest Common
Subsequence- Greedy Algorithms: – Elements of the Greedy Strategy- An Activity-Selection Problem - Huffman
Coding.
Module V NP COMPLETE AND NP HARD 9
NP-Completeness: Polynomial Time – Polynomial-Time Verification – NP- Completeness and Reducibility – NP-
Completeness Proofs – NP-Complete Problems.
Total Hours 45
Learning Resources:
Reference Books:
1 S.Sridhar,” Design and Analysis of Algorithms”, Oxford University Press, 1st Edition, 2014.
2 Adam Drozdex, “Data Structures and algorithms in C++”, Cengage Learning, 4th Edition, 2013.
T.H. Cormen, C.E.Leiserson, R.L. Rivest and C.Stein, "Introduction to Algorithms", Prentice Hall of India,
3
3rd Edition, 2012.
4 Mark Allen Weiss, “Data Structures and Algorithms in C++”, Pearson Education, 3rd Edition, 2009.
E. Horowitz, S. Sahni and S. Rajasekaran, “Fundamentals of Computer Algorithms”, University Press, 2nd
5
Edition, 2008.
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson Education,
6
Reprint 2006.
 Course Cate Periods/Week
Course Title Sem C
Code gory L T P S
CSA1701 RESEARCH METHODOLOGY AND IPR I ES 2 0 0 0 2
Course Learning BTL
Pre-requisite Nil Theory
Type Level 4
Syllabus
Module I RESEARCH DESIGN 6
Overview of research process and design, Use of Secondary and exploratory data to answer the research
question, Qualitative research, Observation studies, Experiments and Surveys.
Module II DATA COLLECTION AND SOURCES 6
Measurements, Measurement Scales, Questionnaires and Instruments, Sampling and methods. Data - Preparing,
Exploring, examining and displaying.
Module III DATA ANALYSIS AND REPORTING 6
Overview of Multivariate analysis, Hypotheses testing and Measures of Association. Presenting Insights and
findings using written reports and oral presentation.
Module IV INTELLECTUAL PROPERTY RIGHTS 6
Intellectual Property – The concept of IPR, Evolution and development of concept of IPR, IPR development
process, Trade secrets, utility Models, IPR & Biodiversity, Role of WIPO and WTO in 13 IPR establishments, Right
of Property, Common rules of IPR practices, Types and Features of IPR Agreement, Trademark, Functions of
UNESCO in IPR maintenance.
Module V PATENTS 6
Patents – objectives and benefits of patent, Concept, features of patent, Inventive step, Specification, Types of
patent application, process E-filing, Examination of patent, Grant of patent, Revocation, Equitable Assignments,
Licenses, Licensing of related patents, patent agents, Registration of patent agents.
Total Hours 30
Learning Resources:
Reference Books:
Cooper Donald R, Schindler Pamela S and Sharma JK, “Business Research Methods”, Tata McGraw Hill
1
Education, 11e (2012).
Catherine J. Holland, “Intellectual property: Patents, Trademarks, Copyrights, Trade Secrets”, Entrepreneur
2
Press, 2007.
3 David Hunt, Long Nguyen, Matthew Rodgers, “Patent searching: tools & techniques”, Wiley, 2007.
The Institute of Company Secretaries of India, Statutory body under an Act of parliament, “Professional
4
Programme Intellectual Property Rights, Law and practice”, September 2013.
 Course Cate Periods/Week
Course Title Sem C
Code gory L T P S
CSB1703 MACHINE LEARNING TECHNIQUES I PC 3 0 0 1 3
Course Learning BTL
Pre-requisite Theory
Type Level 4
Course Objectives:
To understand the concepts and mathematical foundations of machine learning and types of problems tackled by
machine learning
Course Outcomes:
Upon completion of the course, the students will be able to:
CO Course Outcomes
CO1 Understand and outline problems for each type of machine learning
CO2 Design a Decision tree and Random forest for an application
Implement Probabilistic Discriminative and Generative algorithms for an application and analyze the
CO3
results
CO4 Use a tool to implement typical Clustering algorithms for different types of applications
Design and implement an HMM for a Sequence Model type of application and identify applications
CO5
suitable for different types of Machine Learning with suitable justification.
Syllabus
Module I INTRODUCTION AND MATHEMATICAL FOUNDATIONS 9
What is Machine Learning? Need –History – Definitions – Applications - Advantages, Disadvantages & Challenges
-Types of Machine Learning Problems – Mathematical Foundations - Linear Algebra & Analytical Geometry -
Probability and Statistics- Bayesian Conditional Probability -Vector Calculus & Optimization - Decision Theory -
Information theory
Module II SUPERVISED LEARNING 9
Introduction-Discriminative and Generative Models -Linear Regression - Least Squares -Under-fitting / Overfitting -
Cross-Validation – Lasso Regression- Classification - Logistic Regression- Gradient Linear Models -Support
Vector Machines –Kernel Methods -Instance based Methods - K-Nearest Neighbors - Tree based Methods –
Decision Trees –ID3 – CART - Ensemble Methods –Random Forest - Evaluation of Classification Algorithms.
Module III UNSUPERVISED LEARNING AND REINFORCEMENT LEARNING 9
Introduction - Clustering Algorithms -K – Means – Hierarchical Clustering - Cluster Validity - Dimensionality
Reduction –Principal Component Analysis – Recommendation Systems - EM algorithm. Reinforcement Learning –
Elements -Model based Learning – Temporal Difference Learning
Module IV PROBABILISTIC METHODS FOR LEARNING 9
Introduction -Naïve Bayes Algorithm -Maximum Likelihood -Maximum Apriori -Bayesian Belief Networks -
Probabilistic Modelling of Problems -Inference in Bayesian Belief Networks – Probability Density Estimation -
Sequence Models – Markov Models – Hidden Markov Models.
Module V NEURAL NETWORKS AND DEEP LEARNING 9
Neural Networks – Biological Motivation- Perceptron – Multi-layer Perceptron – Feed Forward Network – Back
Propagation-Activation and Loss Functions- Limitations of Machine Learning – Deep Learning– Convolution
Neural Networks – Recurrent Neural Networks – Use cases.
 Total Hours 45
Learning Resources:
Reference Books:
Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, Chapman & Hall/CRC, 2nd Edition,
1
2014.
2 Kevin Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.
Ethem Alpaydin, “Introduction to Machine Learning”, Third Edition, Adaptive Computation and Machine
3
Learning Series, MIT Press, 2014.
4 Tom M Mitchell, “Machine Learning”, McGraw Hill Education, 2013.
Peter Flach, “Machine Learning: The Art and Science of Algorithms that Make Sense of Data”, First
5
Edition, Cambridge University Press, 2012
Shai Shalev-Shwartz and Shai Ben-David, “Understanding Machine Learning: From Theory to Algorithms”,
6
Cambridge University Press, 2015.
 Course Cate Periods/Week
Course Title Sem C
Code gory L T P S
PRINCIPLES OF PROGRAMMING I
CSB1704 PC 3 0 0 1 3
LANGUAGES
Course Learning BTL
Pre-requisite Theory
Type Level 4
Course Objectives:

To develop programs in non-procedural programming paradigms

Course Outcomes:
Upon completion of the course, the students will be able to:
CO Course Outcomes
CO1 Describe syntax and semantics of programming languages
CO2 Explain data, data types, and basic statements of programming languages
CO3 Design and implement subprogram constructs
CO4 Apply object-oriented, concurrency, and event handling programming constructs
CO5 Develop programs in Scheme, ML, and Prolog and Understand and adopt new programming language
Syllabus
Module I SYNTAX AND SEMANTICS 9
Evolution of programming languages – describing syntax – context – free grammars –attribute grammars –
describing semantics – lexical analysis – parsing – recursive-descent – bottom- up parsing
Module II DATA, DATA TYPES, AND BASIC STATEMENTS 9
Names – variables – binding – type checking – scope – scope rules – lifetime and garbage collection –primitive
data types–strings–array types– associative arrays–record types– union types – pointers and references –
Arithmetic expressions – overloaded operators – type conversions – relational and boolean expressions –
assignment statements – mixed- mode assignments – control structures – selection – iterations – branching –
guarded statements.
Module III SUBPROGRAMS AND IMPLEMENTATIONS 9
Subprograms – design issues – local referencing – parameter passing – overloaded methods – generic methods –
design issues for functions – semantics of call and return – implementing simple subprograms – stack and
dynamic local variables – nested subprograms – blocks – dynamic scoping.
Module IV OBJECT-ORIENTATION, CONCURRENCY, AND EVENT HANDLING 9
Object-orientation – design issues for OOP languages – implementation of object-oriented constructs –
concurrency – semaphores – monitors – message passing – threads – statement level concurrency – exception
handling – event handling.
Module V FUNCTIONAL AND LOGIC PROGRAMMING LANGUAGES 9
Introduction to lambda calculus – fundamentals of functional programming languages – Programming with
Scheme – Programming with ML – Introduction to logic and logic programming – Programming with Prolog – multi-
paradigm languages.
Total Hours 45
Learning Resources:
Reference Books:
1 Robert W. Sebesta, “Concepts of Programming Languages”, Eleventh Edition, Addison Wesley,2012
W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the ISO Standard”, Fifth Edition, Springer,
2
2003
3 Michael L.Scott, “Programming Language Pragmatics”, Fourth Edition, Morgan Kaufmann,2009.
4 R.KentDybvig,“TheSchemeprogramminglanguage”,FourthEdition,MITPress, 2009
5 Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009
6 W.F.ClocksinandC.S.Mellish,“ProgramminginProlog:UsingtheISOStandard”,Fifth Edition, Springer,2003
 Cate Periods/Week
Course Code Course Title Sem C
gory L T P
ADVANCED DATA STRUCTURES I
CSB1711 AND ALGORITHMS PC 0 0 2 1
LABORATORY
Course Learning
Pre-requisite Data structures Practical BTL 5
Type Level
Course Objectives:

To understand the necessary mathematical abstraction to solve problems

Course Outcomes:
Upon completion of the course, the students will be able to:
CO Number Course Outcomes
CO1 Design and implement basic and advanced data structures extensively
CO2 Design algorithms using graph structures
CO3 Design and develop efficient algorithms with minimum complexity using design techniques
CO4 Develop programs using various algorithms.
Choose appropriate data structures and algorithms, understand the ADT/libraries, and use it to
CO5
design algorithms for a specific problem.

Syllabus
List of Experiments / Exercises: 10
1 Implementation of recursive function for tree traversal and Fibonacci
2 Implementation of iteration function for tree traversal and Fibonacci
3 Implementation of Merge Sort and Quick Sort
4 Implementation of a Binary Search Tree
5 Red-Black Tree Implementation
6 Heap Implementation
7 Fibonacci Heap Implementation
8 Graph Traversals
9 Spanning Tree Implementation
10 Shortest Path Algorithms (Dijkstra's algorithm, Bellman Ford Algorithm)
Additional Experiments / Exercises:
1 Implementation of Matrix Chain Multiplication
2 Activity Selection and Huffman Coding Implementation
Total Hours 60
Learning Resources:
Reference Books:
 Lipschutz Seymour, “Data Structures Schaum's Outlines Series”, Tata McGraw Hill, 3rd Edition,
1
2014.
Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson
2
Education, Reprint 2006
3 http://www.coursera.org/specializations/data-structures-algorithms
4 http://www.tutorialspoint.com/data_structures_algorithms
5 http://www.geeksforgeeks.org/data-structures/