J.B.

INSTITUTE OF ENGINEERING AND TECHNOLOGY

M.TECH. (COMPUTER SCIENCE AND ENGINEERING)
COURSE STRUCTURE AND SYLLABUS
I Year – I Semester
Course Title Int. Ext. L P C
marks marks
Core Course I Data Structures and Algorithms 25 75 4 -- 4
Core Course II Database Internals 25 75 4 -- 4
Core Course III Distributed Systems 25 75 4 -- 4
Core Elective I 1. Network Security 25 75 4 -- 4
2. Android Application Development
3. Cloud Computing
4. Internet of Things
Core Elective II 1. Machine Learning 25 75 4 -- 4
2. Parallel and Distributed Algorithms
3. Software Architecture and Design Patterns
4. Embedded Systems
Open Elective I Open Elective – 1 25 75 4 -- 4
Laboratory I Data Structures and Algorithms Lab 25 75 -- 4 2
Seminar I Seminar 50 -- -- 4 2
Total Credits 24 8 28
I Year – II Semester
Course Title Int. Ext. L P C
marks marks
Core Course IV Network Programming 25 75 4 -- 4
Core Course V Information Retrieval Systems 25 75 4 -- 4
Core Course VI Internet Technologies and Services 25 75 4 -- 4
Core Elective III Core Elective– 3 25 75 4 -- 4
1. Data Mining
2. Storage Area Networks
3. Semantic Web and Social Networks
4. Cyber Security
Core Elective IV Core Elective– 4 25 75 4 -- 4
1. Big Data Analytics
2. Soft Computing
3. Software Process and Project Management
4. Distributed Computing
Open Elective II Open Elective – 2 25 75 4 -- 4
Laboratory II Internet Technologies and Services Lab 25 75 -- 4 2
Seminar II Seminar 50 -- -- 4 2
Total Credits 24 8 28
II Year - I Semester
Course Title Int. Ext. L P C
marks marks
Comprehensive Viva-Voce -- 100 -- -- 4
Project work Review I 50 -- -- 24 12
Total Credits -- 24 16
II Year - II Semester
Course Title Int. Ext. L P C
marks marks
Project work Review II 50 -- -- 8 4
Project Evaluation (Viva-Voce) -- 150 -- 16 12
Total Credits -- 24 16
 Open Electives
1. Basic Computer Programming skills are required for all open electives. Additionally, knowledge on the
specified area mentioned in prerequisites is required for opting the open elective
2. Note: A student can register for any open elective subject provided that he has not already registered for
the same subject

S.NO Open Electives Prerequisites

1. “R” Programming Maths, Statistics
2. Android Application Development Java
3. Algorithmics ----
4. Big Data Analytics Data Bases , Maths
5. Bioinformatics Data Structures
6. Biometrics ----
7. Cyber Security Internet Technologies
8. Computer Forensics Maths, Data Structures
9. Distributed Systems Security Information Security
10. E-Commerce Internet Technologies
11. Embedded Systems Digital logic
12. Information Security Maths
13. Intellectual Property Rights ---
14. Internet of Things Java
15. Java Programming ---
16. Linux Programming ---
17. Mobile Computing Java
18. Mobile Application Security Mobile Application Development
19. OpenStack cloud computing Linux Programming
20. Operations Research Maths, Data Structures
21. Principles of Information Security -----
22. Scripting Languages ---
23. Social Media Intelligence ---
24. Software Engineering ---
25. Storage Area Networks Computer Networks
26. Web Usability ------
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
M. Tech-CSE – I Year – I Sem

DATA STRUCTURES AND ALGORITHMS

Objectives:
The fundamental design, analysis, and implementation of basic data structures. Basic concepts in
the specification and analysis of programs. Principles for good program design, especially the uses
of data abstraction. Significance of algorithms in the computer field Various aspects of algorithm
development Qualities of a good solution.

UNIT I
Algorithms, Performance analysis- time complexity and space complexity, Asymptotic Notation-Big Oh,
Omega and Theta notations, Complexity Analysis Examples.
Data structures-Linear and non linear data structures, ADT concept, Linear List ADT, Array representation,
Linked representation, Vector representation, singly linked lists -insertion, deletion, search operations,
doubly linked lists-insertion, deletion operations, circular lists. Representation of single, two dimensional
arrays, Sparse matrices and their representation.

UNIT II
Stack and Queue ADTs, array and linked list representations, infix to postfix conversion using stack,
implementation of recursion, Circular queue-insertion and deletion, Desuetude ADT, array and linked list
representations, Priority queue ADT, implementation using Heaps, Insertion into a Max Heap, Deletion from
a Max Heap, java.util package-ArrayList, Linked List, Vector classes, Stacks and Queues in java.util,
Iterators in java.util.

UNIT III
Searching–Linear and binary search methods, Hashing-Hash functions, Collision Resolution methods-Open
Addressing, Chaining, Hashing in java.util-HashMap, HashSet, Hashtable.
Sorting –Bubble sort, Insertion sort, Quick sort, Merge sort, Heap sort, Radix sort, comparison of sorting
methods.

UNIT IV
Trees- Ordinary and Binary trees terminology, Properties of Binary trees, Binary tree ADT, representations,
recursive and non recursive traversals, Java code for traversals, Threaded binary trees.
Graphs- Graphs terminology, Graph ADT, representations, graph traversals/search methods-dfs and bfs,
Java code for graph traversals, Applications of Graphs-Minimum cost spanning tree using Kruskal’s
algorithm, Dijkstra’s algorithm for Single Source Shortest Path Problem.

UNIT V
Search trees- Binary search tree-Binary search tree ADT, insertion, deletion and searching operations,
Balanced search trees, AVL trees-Definition and examples only, Red Black trees –Definition and examples
only, B-Trees-definition, insertion and searching operations, Trees in java.util- TreeSet, Tree Map Classes,
Tries(examples only),Comparison of Search trees.
Text compression-Huffman coding and decoding, Pattern matching-KMP algorithm.

TEXT BOOKS:
1. Data structures, Algorithms and Applications in Java, S.Sahni, Universities Press.
2. Data structures and Algorithms in Java, Adam Drozdek, 3rd edition, Cengage Learning.
3. Data structures and Algorithm Analysis in Java, M.A.Weiss, 2nd edition, Addison-Wesley
(Pearson Education).

REFERENCE BOOKS:
1. Java for Programmers, Deitel and Deitel, Pearson education.
2. Data structures and Algorithms in Java, R.Lafore, Pearson education.
3. Java: The Complete Reference, 8th editon, Herbert Schildt, TMH.
4. Data structures and Algorithms in Java, M.T.Goodrich, R.Tomassia, 3rd edition, Wiley India Edition.
5. Data structures and the Java Collection Frame work,W.J.Collins, Mc Graw Hill.
6. Classic Data structures in Java, T.Budd, Addison-Wesley (Pearson Education).
7. Data structures with Java, Ford and Topp, Pearson Education.
8. Data structures using Java, D.S.Malik and P.S.Nair, Cengage learning.
9. Data structures with Java, J.R.Hubbard and A.Huray, PHI Pvt. Ltd.
10. Data structures and Software Development in an Object-Oriented Domain, J.P.Tremblay and
G.A.Cheston, Java edition, Pearson Education
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
M. Tech-CSE – I Year – I Sem
DATABASE INTERNALS
Objectives:
By the end of the course, you will know:
 History and Structure of databases
 How to design a database
 How to convert the design into the appropriate tables
 Handling Keys appropriately
 Enforcing Integrity Constraints to keep the database consistent
 Normalizing the tables to eliminate redundancies
 Querying relational data and processing the queries
 Storage Optimizing Strategies for easy retrieval of data through index
 Triggers, Procedures and Cursors, Transaction Management
 Distributed databases management system concepts and Implementation

UNIT I
Database System Applications, Purpose of Database Systems, View of Data – Data Abstraction, Instances
and Schemas, Data Models – the ER Model, Relational Model, Other Models – Database Languages –
DDL,DML, Database Access from Applications Programs, Transaction Management, Data Storage and
Querying, Database Architecture, Database Users and Administrators, ER diagrams,. Relational Model:
Introduction to the Relational Model – Integrity Constraints Over Relations, Enforcing Integrity constraints,
Querying relational data, Logical data base Design, Introduction to Views –Altering Tables and Views,
Relational Algebra, Basic SQL Queries, Nested Queries, Complex Integrity Constraints in SQL, Triggers

UNIT II
Introduction to Schema Refinement – Problems Caused by redundancy, Decompositions – Problem related
to decomposition, Functional Dependencies - Reasoning about FDS, Normal Forms – FIRST, SECOND,
THIRD Normal forms – BCNF –Properties of Decompositions- Loss less- join Decomposition, Dependency
preserving Decomposition, Schema Refinement in Data base Design – Multi valued Dependencies –
FOURTH Normal Form, Join Dependencies, FIFTH Normal form.

UNIT III
Transaction Management: The ACID Properties, Transactions and Schedules, Concurrent Execution of
Transactions – Lock Based Concurrency Control, Deadlocks – Performance of Locking – Transaction
Support in SQL.
Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock
Conversions, Dealing with Deadlocks, Specialized Locking Techniques – Concurrency Control without
Locking.
Crash recovery: Introduction to Crash recovery, Introduction to ARIES, the Log, and Other Recovery related
Structures, the Write-Ahead Log Protocol, Check pointing, recovering from a System Crash, Media recovery

UNIT IV
Overview of Storage and Indexing: Data on External Storage, File Organization and Indexing – Clustered
Indexes, Primary and Secondary Indexes, Index data Structures – Hash Based Indexing, Tree based
Indexing
Storing data: Disks and Files: -The Memory Hierarchy – Redundant Arrays of Independent
Disks. Tree Structured Indexing: Intuitions for tree Indexes, Indexed Sequential Access Methods
(ISAM) B+ Trees: A Dynamic Index Structure, Search, Insert, Delete.
Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing, Extendable Vs Linear Hashing.

UNIT V
Distributed databases: Introduction to distributed databases, Distributed DBMS architectures, Storing data
in a distributed DBMS, Distributed catalog management, Distributed query processing Updating distributed
data, Distributed transactions, Distributed concurrency control, Distributed recovery

TEXT BOOKS:

1. Data base Management Systems, Raghu Ramakrishna, Johannes Gehrke, TMH, 3rd Edition, 2003.
2. Data base System Concepts, A.Silberschatz, H.F. Korth, S.Sudarshan, McGraw hill, VI
edition, 2006.
3. Fundamentals of Database Systems 5th edition, Ramez Elmasri, Shamkant B.Navathe,
Pearson Education, 2008.
REFERENCE BOOKS:

1. Introduction to Database Systems, C.J.Date, Pearson Education.

2. Database Management System Oracle SQL and PL/SQL, P.K.Das Gupta, PHI.
3. Database System Concepts, Peter Rob & Carlos Coronel, Cengage Learning, 2008.
4. Database Systems, A Practical approach to Design Implementation and Management
Fourth edition, Thomas Connolly, Carolyn Begg, Pearson education.
5. Database-Principles, Programming, and Performance, P.O’Neil & E.O’Neil, 2nd ed, ELSEVIER
6. Fundamentals of Relational Database Management Systems, S.Sumathi, S.Esakkirajan,
Springer.
7. Introduction to Database Management, M.L.Gillenson and others, Wiley Student Edition.
8. Database Development and Management, Lee Chao, Auerbach publications, Taylor & Francis
Group.
9. Distributed Databases Principles & Systems, Stefano Ceri, Giuseppe Pelagatti, TMH.
10. Principles of Distributed Database Systems, M. Tamer Ozsu, Patrick Valduriez , Pearson
Education, 2nd Edition.
11.Distributed Database Systems, Chhanda Ray, Pearson.
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
M. Tech-CSE – I Year – I Sem
DISTRIBUTED SYSTEMS


Objectives:
 Understand the need for distributed systems and their applications.
 Understand the concepts of remote procedure calls, remote file systems, distributed agreement,
clock synchronization, and security.

UNIT I
Characterization of Distributed Systems-Introduction, Examples of Distributed systems, Resource sharing
and web, challenges, System models-Introduction, Architectural and Fundamental models, Networking and
Internetworking, Interposes Communication.
Distributed objects and Remote Invocation-Introduction, Communication between distributed objects, RPC,
Events and notifications, Case study-Java RMI.

UNIT II
Operating System Support- Introduction, OS layer, Protection, Processes and Threads, Communication
and Invocation, Operating system architecture, Distributed File Systems-Introduction, File Service
architecture, case study- SUN network file systems.
Name Services-Introduction, Name Services and the Domain Name System, Case study of the Global
Name Service, Case study of the X.500 Directory Service.

UNIT III
Peer to Peer Systems–Introduction, Napster and its legacy, Peer to Peer middleware, Routing overlays,
Overlay case studies-Pastry, Tapestry, Application case studies-Squirrel, Ocean Store, Time and Global
States-Introduction, Clocks, events and Process states, Synchronizing physical clocks, logical time and
logical clocks, global states, distributed debugging.
Coordination and Agreement-Introduction, Distributed mutual exclusion, Elections, Multicast
communication, consensus and related problems.

UNIT IV
Transactions and Concurrency control-Introduction, Transactions, Nested Transactions, Locks, Optimistic
concurrency control, Timestamp ordering, Comparison of methods for concurrency control. Distributed
Transactions-Introduction, Flat and Nested Distributed Transactions, Atomic commit protocols,
Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery. Replication-
Introduction, System model and group communication, Fault tolerant services, Transactions with replicated
data.

UNIT V
Security-Introduction, Overview of Security techniques, Cryptographic algorithms, Digital signatures, Case
studies-Kerberos, TLS, 802.11 Wi-Fi.
Distributed shared memory, Design and Implementation issues, Sequential consistency and Ivy case study,
Release consistency and Munin case study, Other consistency models, CORBA case study-Introduction,
CORBA RMI, CORBA Services.

TEXT BOOKS:
1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Fourth Edition,
Pearson Education.
2. Distributed Systems, S.Ghosh, Chapman& Hall/CRC, Taylor & Francis Group, 2010.

REFERENCE BOOKS:
1. Distributed Computing, S.Mahajan and S.Shah, Oxford University Press.
2. Distributed Operating Systems Concepts and Design, Pradeep K.Sinha, PHI.
3. Advanced Concepts in Operating Systems, M Singhal, N G Shivarathri, TMH.
4. Reliable Distributed Systems, K.P.Birman, Springer.
5. Distributed Systems – Principles and Paradigms, A.S. Tanenbaum and M.V. Steen, Pearson
Education.
6. Distributed Operating Systems and Algorithm Analysis, R.Chow, T.Johnson, Pearson.
7. Distributed Operating Systems, A.S.Tanenbaum, Pearson education.
8. Distributed Computing, Principles, Algorithms and Systems, Ajay D.Kshemakalyani
and Mukesh Singhal, Cambridge, rp 2010.
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
M. Tech-CSE – I Year – I Sem
NETWORK SECURITY
(CORE ELECTIVE-I)
Objectives:
 Understand the basic categories of threats to computers and networks
 Understand various cryptographic algorithms.
 Describe public-key cryptosystem.
 Describe the enhancements made to IPv4 by IPSec
 Understand Intrusions and intrusion detection
 Discuss the fundamental ideas of public-key cryptography.
 Generate and distribute a PGP key pair and use the PGP package to send
an encrypted e-mail message.
 Discuss Web security and Firewalls

UNIT – I
Attacks on Computers and Computer Security: Introduction, The need for security, Security approaches,
Principles of security, Types of Security attacks, Security services, Security Mechanisms, A model for
Network Security Cryptography: Concepts and Techniques: Introduction, plain text and cipher text,
substitution techniques, transposition techniques, encryption and decryption, symmetric and asymmetric key
cryptography, steganography, key range and key size, possible types of attacks.

UNIT – II
Symmetric key Ciphers: Block Cipher principles & Algorithms(DES, AES,Blowfish), Differential and Linear
Cryptanalysis, Block cipher modes of operation, Stream ciphers, RC4,Location and placement of encryption
function, Key distribution Asymmetric key Ciphers: Principles of public key cryptosystems,
Algorithms(RSA, Diffie-Hellman,ECC), Key Distribution

UNIT – III
Message Authentication Algorithms and Hash Functions: Authentication requirements, Functions,
Message authentication codes, Hash Functions, Secure hash algorithm, Whirlpool, HMAC, CMAC, Digital
signatures, knapsack algorithm Authentication Applications: Kerberos, X.509 Authentication Service,
Public – Key Infrastructure, Biometric Authentication

UNIT – IV
E-Mail Security: Pretty Good Privacy, S/MIME IP Security: IP Security overview, IP Security architecture,
Authentication Header, Encapsulating security payload, combining security associations, key management

UNIT – V
Web Security: Web security considerations, Secure Socket Layer and Transport Layer Security, Secure
electronic transaction Intruders, Virus and Firewalls: Intruders, Intrusion detection, password
management, Virus and related threats, Countermeasures, Firewall design principles, Types of firewalls
Case Studies on Cryptography and security: Secure Inter-branch Payment Transactions, Cross site
Scripting Vulnerability, Virtual Elections.

TEXT BOOKS:
1. Cryptography and Network Security : William Stallings, Pearson Education,5 th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 2nd Edition.
3. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning

REFERENCE BOOKS:
1. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan, Wiley India, 1st
Edition.
2. Cryptography and Network Security : Forouzan Mukhopadhyay, Mc Graw Hill, 2 nd Edition
3. Information Security, Principles and Practice : Mark Stamp, Wiley India.
4. Principles of Computer Sceurity: WM.Arthur Conklin, Greg White, TMH
5. Introduction to Network Security: Neal Krawetz, CENGAGE Learning.
6. Principles of Information security by Michael E Whitman and Herbert J.Mattord.
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
M. Tech-CSE – I Year – I Sem

SOFTWARE ARCHITECTURE AND DESIGN PATTERNS

(CORE ELECTIVE –II)

Objectives:
After completing this course, the student should be able to:
 To understand the concept of patterns and the Catalog.
 To discuss the Presentation tier design patterns and their affect on: sessions, client
access, validation and consistency.
 To understand the variety of implemented bad practices related to the Business and
Integration tiers.
 To highlight the evolution of patterns.
 To how to add functionality to designs while minimizing complexity
 To understand what design patterns really are, and are not
 To learn about specific design patterns.
 To learn how to use design patterns to keep code quality high without overdesign.
UNIT I
Envisioning Architecture
The Architecture Business Cycle, What is Software Architecture, Architectural patterns, reference models,
reference architectures, architectural structures and views.
Creating an Architecture
Quality Attributes, Achieving qualities, Architectural styles and patterns, designing the Architecture,
Documenting software architectures, Reconstructing Software Architecture.

UNIT II
Analyzing Architectures
Architecture Evaluation, Architecture design decision making, ATAM, CBAM.
Moving from one system to many
Software Product Lines, Building systems from off the shelf components, Software architecture in future.

UNIT III
Patterns
Pattern Description, Organizing catalogs, role in solving design problems, Selection and usage.
Creational and Structural patterns
Abstract factory, builder, factory method, prototype, singleton, adapter, bridge, composite, façade, flyweight.

UNIT IV
Behavioral patterns
Chain of responsibility, command, Interpreter, iterator, mediator, memento, observer, state, strategy,
template method, visitor.

UNIT V
Case Studies
A-7E – A case study in utilizing architectural structures, The World Wide Web - a case study in
interoperability, Air Traffic Control – a case study in designing for high availability, Celsius Tech – a
case study in product line development,

TEXT BOOKS:
1. Software Architecture in Practice, second edition, Len Bass, Paul Clements & Rick Kazman,
Pearson Education, 2003.
2. Design Patterns, Erich Gamma, Pearson Education, 1995.

REFERENCE BOOKS:
1. Beyond Software architecture, Luke Hohmann, Addison wesley, 2003.
2. Software architecture, David M. Dikel, David Kane and James R. Wilson, Prentice Hall PTR, 2001
3. Software Design, David Budgen, second edition, Pearson education, 2003
4. Head First Design patterns, Eric Freeman & Elisabeth Freeman, O’REILLY, 2007.
5. Design Patterns in Java, Steven John Metsker & William C. Wake, Pearson education, 2006
6. J2EE Patterns, Deepak Alur, John Crupi & Dan Malks, Pearson education, 2003.
7. Design Patterns in C#, Steven John metsker, Pearson education, 2004.
8. Pattern Oriented Software Architecture, F.Buschmann & others, John Wiley & Sons.
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY
M. Tech-CSE
I YEAR I SEM

JAVA PROGRAMMING

Objectives:

 To familiar with constructors and string handling functions

 To explain Inheritance and Polymorphism
 To familiar with Packages and Interfaces
 To familiar with Exception handling and Multithreading
 To familiar with Applet Programming, Event Handling and scripting.
Outcomes:

 Be familiar with constructors and string handling

 Able to understand Inheritance and Polymorphism
 Be able to understand Packages and Interfaces
 Be able to understand Exception handling and Multithreading
 Be able to understand Applet Programming
 Be able to implement Event Handling

UNIT I :

Object oriented thinking :- Need for oop paradigm, A way of viewing world – Agents, responsibility,
messages, methods, classes and instances, class hierarchies (Inheritance), method binding, overriding and
exceptions, summary of oop concepts, coping with complexity, abstraction mechanisms.

Java Basics History of Java, Java buzzwords, data types, variables, scope and life time of variables, arrays,
operators, expressions, control statements, type conversion and casting, simple java program, concepts of
classes, objects, constructors, methods, access control, this keyword, garbage collection, overloading
methods and constructors, parameter passing, recursion, nested and inner classes, exploring string class.

UNIT II :

Inheritance – Hierarchical abstractions, Base class object, subclass, subtype, substitutability, forms of
inheritance- specialization, specification, construction, extension, limitation, combination, benefits of
inheritance, costs of inheritance. Member access rules, super uses, using final with inheritance,
polymorphism- method overriding, abstract classes, the Object class.

Packages and Interfaces : Defining, Creating and Accessing a Package, Understanding CLASSPATH,
importing packages, differences between classes and interfaces, defining an interface, implementing interface,
applying interfaces, variables in interface and extending interfaces.

Exploring java.io.

UNIT III :

Exception handling - Concepts of exception handling, benefits of exception handling, Termination or

resumptive models, exception hierarchy, usage of try, catch, throw, throws and finally, built in exceptions,
creating own exception sub classes.

String handling,Exploring java.util

Multithreading- Differences between multi threading and multitasking, thread life cycle, creating threads,
thread priorities, synchronizing threads, interthread communication, thread groups, daemon
threads.Enumerations, autoboxing, annotations ,generics.
UNIT IV :

Event Handling : Events, Event sources, Event classes, Event Listeners, Delegation event model, handling
mouse and keyboard events, Adapter classes.

The AWT class hierarchy, user interface components- labels, button, canvas, scrollbars, text components,
check box, check box groups, choices, lists panels – scrollpane, dialogs, menubar, graphics, layout manager –
layout manager types – border, grid, flow, card and grid bag.

UNIT V :

Applets – Concepts of Applets, differences between applets and applications, life cycle of an applet, types of
applets, creating applets, passing parameters to applets.

Swing – Introduction, limitations of AWT, MVC architecture, components, containers, exploring swing-
JApplet, JFrame and JComponent, Icons and Labels, text fields, buttons – The JButton class, Check boxes,
Radio buttons, Combo boxes, Tabbed Panes, Scroll Panes, Trees, and Tables.

TEXT BOOKS :

1. Java; the complete reference, 7th editon, Herbert schildt, TMH.

2. Understanding OOP with Java, updated edition, T. Budd, pearson eduction.

REFERENCES :

1. An Introduction to programming and OO design using Java, J.Nino and F.A. Hosch, John wiley
& sons.

2. An Introduction to OOP, third edition, T. Budd, pearson education.

3. Introduction to Java programming , Y. Daniel Liang, pearson education.
4. An introduction to Java programming and object oriented application development, R.A.
Johnson- Thomson.

5. Core Java 2, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell, eighth Edition, Pearson
Education.

6. Core Java 2, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell, eighth Edition, Pearson
Education

7. Object Oriented Programming with Java, R.Buyya,S.T.Selvi,X.Chu,TMH.

8. Java and Object Orientation, an introduction, John Hunt, second edition, Springer.
9. Maurach’s Beginning Java2 JDK 5 , SPD.
10. Programming and Problem Solving with Java, JM Slack, B S Publications.
 J.B. INSTITUTE OF ENGINEERING AND TECHNOLOGY

M. Tech-CSE – I Year – I Sem

DATA STRUCTURES AND ALGORITHMS LAB

Objectives:
 The fundamental design, analysis, and implementation of basic data structures.
 Basic concepts in the specification and analysis of programs.
 Principles for good program design, especially the uses of data abstraction.
Sample Problems on Data structures:

1. Write Java programs that use both recursive and non-recursive functions for implementing the following
searching methods:
a) Linear search b) Binary search

2. Write Java programs to implement the following using arrays and linked lists
a) List ADT

3. Write Java programs to implement the following using an array.

a) Stack ADT b) Queue ADT

4. Write a Java program that reads an infix expression and converts the expression to postfix form. (Use
stack ADT).

5. Write a Java program to implement circular queue ADT using an array.

6. Write a Java program that uses both a stack and a queue to test whether the given string is a palindrome
or not.

7. Write Java programs to implement the following using a singly linked list.
a) Stack ADT b) Queue ADT

8. Write Java programs to implement the deque (double ended queue) ADT
using a) Array b) Singly linked list c) Doubly linked list.

9. Write a Java program to implement priority queue ADT.

10. Write a Java program to perform the following operations:

a) Construct a binary search tree of elements.
b) Search for a key element in the above binary search tree.
d) Delete an element from the above binary search tree.

11. Write a Java program to implement all the functions of a dictionary (ADT) using Hashing.

12. Write a Java program to implement Dijkstra’s algorithm for Single source shortest path problem.
13. Write Java programs that use recursive and non-recursive functions to traverse the given binary tree in
a) Preorder b) Inorder c) Postorder.
14. Write Java programs for the implementation of bfs and dfs for a given graph.

15. Write Java programs for implementing the following sorting methods:
a) Bubble sort d) Merge sort g) Binary tree sort
b) Insertion sort e) Heap sort
c) Quick sort f) Radix sort

16. Write a Java program to perform the following operations:

a) Insertion into a B-tree b) Searching in a B-tree

17. Write a Java program that implements Kruskal’s algorithm to generate minimum cost
spanning tree.

18. Write a Java program that implements KMP algorithm for pattern matching.
REFERENCE BOOKS:

1. Data Structures and Algorithms in java, 3rd edition, A.Drozdek, Cengage Learning.
2. Data Structures with Java, J.R.Hubbard, 2nd edition, Schaum’s Outlines, TMH.
3. Data Structures and algorithms in Java, 2nd Edition, R.Lafore, Pearson Education.
4. Data Structures using Java, D.S.Malik and P.S. Nair, Cengage Learning.
5. Data structures, Algorithms and Applications in java, 2nd Edition, S.Sahani, Universities Press.
6. Design and Analysis of Algorithms, P.H.Dave and H.B.Dave, Pearson education.
7. Data Structures and java collections frame work, W.J.Collins, Mc Graw Hill.
8. Java: the complete reference, 7th editon, Herbert Schildt, TMH.
9. Java for Programmers, P.J.Deitel and H.M.Deitel, Pearson education / Java: How to Program
P.J.Deitel and H.M.Deitel, 8th edition, PHI.
10. Java Programming, D.S.Malik,Cengage Learning.
11. A Practical Guide to Data Structures and Algorithms using Java, S.Goldman & K.Goldman,
Chapman & Hall/CRC, Taylor & Francis Group.

( Note: Use packages like java.io, java.util, etc)