JNTUK 3-1 CSE Syllabus Paper

Hy Dear here I am searching for the Jawaharlal Nehru Technological University Kakinada 3-1 CSE Syllabus Paper so please can you give me the papers and provide me the page where I can download the papers?

[Pathak]

Here I am giving you Jawaharlal Nehru Technological University Kakinada
III Year B. Tech. Computer Science and Engineering – I Sem.
ADVANCED DATA STRUCTURES
(Note: C++ and Java implementation is not included in the syllabus)
Unit I : Dictionaries : Sets, Dictionaries, Hash Tables, Open Hashing, Closed Hashing (Rehashing Methods), Hashing Functions( Division Method, Multiplication Method, Universal Hashing), Analysis of Closed Hashing Result (Unsuccessful Search, Insertion, Successful Search, Deletion), Hash Table Restructuring, Skip Lists, Analysis
of Skip Lists. (Reference 1)

Unit II : Balanced Trees : AVL Trees: Maximum Height of an AVL Tree, Insertions and Deletions. 2-3 Trees : Insertion, Deletion.

Unit III : Priority Queues : Binary Heaps : Implementation of Insert and Delete min, Creating Heap. Binomial Queues : Binomial Queue Operations, Binomial Amortized Analysis, Lazy Binomial Queues

Unit IV : Graphs : Operations on Graphs: Vertex insertion, vertex deletion, find vertex, edge addition, edge deletion, Graph Traversals- Depth First Search and Breadth First
Search(Non recursive) . Graph storage Representation- Adjacency matrix, adjacency lists.

Unit V : Graph algorithms : Minimum-Cost Spanning Trees- Prim's Algorithm, Kruskal's Algorithm Shortest Path Algorithms: Dijkstra's Algorithm, All Pairs Shortest
Paths Problem: Floyd's Algorithm, Warshall's Algorithm,

Unit VI : Sorting Methods : Order Statistics: Lower Bound on Complexity for Sorting Methods: Lower Bound on Worst Case Complexity, Lower Bound on Average Case
Complexity, Heap Sort, Quick Sort, Radix Sorting, Merge Sort.

Unit VII : Pattern matching and Tries : Pattern matching algorithms- the Boyer – Moore algorithm, the Knuth-Morris-Pratt algorithm Tries: Definitions and concepts of digital search tree, Binary trie, Patricia , Multi-way trie

Unit VIII : File Structures: Fundamental File Processing Operations-opening files, closing files, Reading and Writing file contents, Special characters in files.
Fundamental File Structure Concepts- Field and record organization, Managing fixed length, fixed-field buffers.


If you want to get whole syllabus paper then download given below zip file which contents whole paper.