JNTU Hyderabad M Tech CSE Syllabus

The syllabus of M. Tech. (Computer Science) Program offered by JNTU (Jawaharlal Nehru Technological University), Hyderabad is as follows:


M.TECH (COMPUTER SCIENCE)

I YEAR I SEMESTER

Subject Code: CS1C10

DATA STRUCTURES AND ALGORITHMS
(CORE I)


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 NotationBig 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, Dequeue 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
SearchingLinear 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 Kruskals algorithm, Dijkstras 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, AddisonWesley (Pearson Education).


REFERENCES:
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.
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.
11. A Practical Guide to Data Structures and Algorithms using Java, S.Goldman &
K.Goldman, Chapman & Hall/CRC, Taylor & Francis Group.

__________________
Answered By StudyChaCha Member