#1




JNTU Hyderabad M Tech CSE Syllabus
Here I am sharing the detailed syllabus of M Tech Computer Science & Engg (CSE) which is offered under Jawaharlal Nehru Technological University, Hyderabad M Tech Computer Science & Engg (CSE) Syllabus: I Year – I Sem. (Computer Science & Engg) Advanced Data Structures And Algorithms UNIT I Algorithms, Performance analysis time complexity and space complexity, Asymptotic NotationBig Oh, Omega and Theta notations, Complexity Analysis Examples. Data structuresLinear 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 listsinsertion, 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 queueinsertion 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 packageArrayList, Linked List, Vector classes, Stacks and Queues in java.util, Iterators in java.util. UNIT III Searching–Linear and binary search methods, HashingHash functions, Collision Resolution methodsOpen Addressing, Chaining, Hashing in java.utilHashMap, 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 methodsdfs and bfs, Java code for graph traversals, Applications of GraphsMinimum cost spanning tree using Kruskal’s algorithm, Dijkstra’s algorithm for Single Source Shortest Path Problem. UNIT V Search trees Binary search treeBinary search tree ADT, insertion, deletion and searching operations, Balanced search trees, AVL treesDefinition and examples only, Red Black trees – Definition and examples only, BTreesdefinition, insertion and searching operations, Trees in java.util TreeSet, Tree Map Classes, Tries(examples only),Comparison of Search trees. Text compressionHuffman coding and decoding, Pattern matchingKMP algorithm. Rest of the detailed syllabus is attached in below pdf file 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 structuresLinear 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 listsinsertion, 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 queueinsertion 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 packageArrayList, Linked List, Vector classes, Stacks and Queues in java.util, Iterators in java.util. UNIT III SearchingLinear and binary search methods, HashingHash functions, Collision Resolution methodsOpen Addressing, Chaining, Hashing in java.utilHashMap, 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 methodsdfs and bfs, Java code for graph traversals, Applications of GraphsMinimum cost spanning tree using Kruskals algorithm, Dijkstras algorithm for Single Source Shortest Path Problem. UNIT V Search trees Binary search treeBinary search tree ADT, insertion, deletion and searching operations, Balanced search trees, AVL treesDefinition and examples only, Red Black trees Definition and examples only, BTreesdefinition, insertion and searching operations, Trees in java.util TreeSet, Tree Map Classes, Tries(examples only),Comparison of Search trees. Text compressionHuffman coding and decoding, Pattern matchingKMP 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, AddisonWesley (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 ObjectOriented 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. Address: Jawaharlal Nehru Technological University Kukatpally Housing Board Colony, Kukatpally, Hyderabad, Andhra Pradesh 500085 Map: Last edited by Aakashd; December 5th, 2019 at 06:01 PM. 
#2




Re: JNTU Hyderabad M Tech CSE Syllabus
You want syllabus of the M.Tech CSE for the Jawahar Lal technical university.
We have already uploaded it on our website which link is given here: http://studychacha.com/discuss/449m...tu2011a.html
__________________
Answered By StudyChaCha Member 
#4




Re: JNTU Hyderabad M Tech CSE Syllabus
I need m.tech cse syllabus copy.this is my swapnamylaram36@gmail.com

#6




Re: JNTU Hyderabad M Tech CSE Syllabus
Jawaharlal Nehru Technological University Hyderabad has been accredited with ‘A’ Grade accreditation by NAAC (National Assessment and Accreditation Council.
M Tech CSE Syllabus As you asked for the M Tech CSE Syllabus, here I am uploading a pdf file having the same. I have taken following content from the attachment: UNIT I Algorithms, Performance analysis time complexity and space complexity, Asymptotic NotationBig Oh, Omega and Theta notations, Complexity Analysis Examples. Data structuresLinear 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 listsinsertion, 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 queueinsertion 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 packageArrayList, Linked List, Vector classes, Stacks and Queues in java.util, Iterators in java.util. UNIT III Searching–Linear and binary search methods, HashingHash functions, Collision Resolution methodsOpen Addressing, Chaining, Hashing in java.utilHashMap, HashSet, Hashtable. Sorting –Bubble sort, Insertion sort, Quick sort, Merge sort, Heap sort, Radix sort, comparison of sorting methods. Complete syllabus is in the attachment, please click on it… Address Jawaharlal Nehru Technological University Andhra Pradesh 533003 
#7




Re: JNTU Hyderabad M Tech CSE Syllabus
Quote:
