Go Back   2019-2020 StudyChaCha > >




  #1  
Old October 21st, 2012, 02:02 PM
Aakashd
Super Moderator
 
Join Date: Jun 2013
Default JNTU Hyderabad M Tech CSE Syllabus

How I can get the M Tech CSE course syllabus from net of Jawahar Lal technical university tell me about this because I have need of this courses syllabus so want to get it from net and so I ask you about this

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 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, 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
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.

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 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.

Address:
Jawaharlal Nehru Technological University
Kukatpally Housing Board Colony,
Kukatpally, Hyderabad,
Andhra Pradesh 500085 ‎

Map:


Attached Files Available for Download
File Type: pdf JNTUH M Tech CSE Syllabus.pdf (174.3 KB, 132 views)

Last edited by Aakashd; December 5th, 2019 at 06:01 PM.
Reply With Quote Quick reply to this message
Other Discussions related to this topic
Thread
JNTU Hyderabad syllabus for CSE R09
Rank Cutoff for M.Tech admission in JNTU Hyderabad
JNTU MBA Syllabus Hyderabad
M Tech Syllabus for JNTU
JNTU MCA Syllabus Hyderabad
M tech admission in JNTU Hyderabad
JNTU Hyderabad CSE Syllabus
B.Tech CSE syllabus JNTU Hyderabad
JNTU Hyderabad Syllabus For ECE
JNTU Hyderabad MBA Syllabus
Sponsored List of M Tech in JNTU Hyderabad
JNTU Hyderabad B.Tech Syllabus
JNTU Hyderabad Results B.Tech 1st Year
JNTU Hyderabad ECE 2-2 Syllabus
JNTU Hyderabad B Tech Syllabus
Class timings for M. Tech biotech in JNTU, Hyderabad
JNTU Syllabus DFT M.Tech
JNTU Hyderabad Syllabus For CSE
JNTU Syllabus For EEE Hyderabad
JNTU Hyderabad Syllabus For CSE R07






  #2  
Old October 22nd, 2012, 04:45 PM
Sashwat's Avatar
Sashwat
Super Moderator
 
Join Date: Jun 2011
Default 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/449-m...tu-2011-a.html
__________________
Answered By StudyChaCha Member
Reply With Quote Quick reply to this message
  #3  
Old December 15th, 2012, 02:43 PM
Unregistered
Guest
 
Default Re: JNTU Hyderabad M Tech CSE Syllabus

M Tech Machine Design Syllabus for JNTU Hyderabad
Reply With Quote Quick reply to this message
  #4  
Old March 25th, 2013, 10:15 PM
Unregistered
Guest
 
Default Re: JNTU Hyderabad M Tech CSE Syllabus

I need m.tech cse syllabus copy.this is my swapnamylaram36@gmail.com
Reply With Quote Quick reply to this message
  #5  
Old September 10th, 2013, 05:35 PM
Unregistered
Guest
 
Default Re: JNTU Hyderabad M Tech CSE Syllabus

I wnt to kno abt st marys college hyderabad...how s d colg I took admission in dat colg for mtech in computer science
Reply With Quote Quick reply to this message
  #6  
Old December 21st, 2013, 04:37 PM
Aakashd
Super Moderator
 
Join Date: Jun 2013
Default 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 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, 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
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.

Complete syllabus is in the attachment, please click on it…

Address

Jawaharlal Nehru Technological University
Andhra Pradesh 533003 ‎
Attached Files Available for Download
File Type: pdf JNTUKH M Tech CSE Syllabus.pdf (174.3 KB, 116 views)
Reply With Quote Quick reply to this message
  #7  
Old January 27th, 2014, 02:49 PM
Unregistered
Guest
 
Default Re: JNTU Hyderabad M Tech CSE Syllabus

Quote:
Originally Posted by Unregistered View Post
I need m.tech cse syllabus copy.this is my swapnamylaram36@gmail.com
i need mtech cse syllbus copy.....
Reply With Quote Quick reply to this message
  #8  
Old January 6th, 2015, 12:31 PM
Unregistered
Guest
 
Default jntuh mtech cse 1st year syllabus

can u post cse (mtech jntuh 1st year)syllabus & exam time table
Reply With Quote Quick reply to this message
  #9  
Old January 18th, 2015, 11:50 AM
Unregistered
Guest
 
Default Re: JNTU Hyderabad M Tech CSE Syllabus

v have a syllabus like r13 but v dont finding for 2015 sylllabus
Reply With Quote Quick reply to this message
  #10  
Old August 10th, 2019, 04:48 PM
Unregistered
Guest
 
Default Re: JNTU Hyderabad M Tech CSE Syllabus

Can you provide me the syllabus of M. Tech. (Computer Science) Program offered by JNTU (Jawaharlal Nehru Technological University), Hyderabad?
Reply With Quote Quick reply to this message
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options

Forum Jump


All times are GMT +6.5. The time now is 03:18 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2019, vBulletin Solutions, Inc.
Search Engine Optimisation provided by DragonByte SEO v2.0.42 (Pro) - vBulletin Mods & Addons Copyright © 2019 DragonByte Technologies Ltd.