Book Details

ADVANCED DATA STRUCTURES

ADVANCED DATA STRUCTURES

Published by uLektz

Course Code:R162214

Author:uLektz

University: JNTU Kakinada

Regulation:2016

Categories:Computer Science

Format : ico_bookePUB3 (DRM Protected)

Type :eBook

Rs.307 Rs.231 Rs.25% off

Preview Buy Now

Note : No printed book. Only ebook. Access eBook using uLektz apps for Android, iOS and Windows Desktop PC.

Topics
UNIT I SORTING

1.1 External Sorting, Introduction, K-way Merging

1.2 Buffer Handling for parallel Operation

1.3 Run Generation

1.4 Optimal Merging of Runs

UNIT II HASHING

2.1 Introduction-Static Hashing- Hash Table-Hash Function-Secure Hash Function

2.2 Overflow Handling

2.3 Dynamic Hashing- Theoretical Evaluation of Overflow Techniques- Motivation for Dynamic Hashing

2.4 Dynamic Hashing Using Directories and Directory less Dynamic Hashing

UNIT III PRIORITY QUEUES (HEAPS)

3.1 Model, Simple Implementation, Binary Heap- Heap Structure Property- Heap-Order Property

3.2 Basic Heap Operations- Other Heap Operation- Applications of Priority Queues- The Selection Problem and Event Simulation Problem

3.3 Binomial Queue Structure- Binomial Queue Operation- Implementation of Binomial Queues.

UNIT IV EFFICIENT BINARY SEARCH TREES

4.1 Optimal Binary Search Trees- AVL Trees

4.2 Red - Black Trees - Definition- Representation of a Red- Black Tree- Inserting and searching in Red-Black- Deletion from a Red-Black Tree- Joining Red-Black Trees- Splitting a Red-Black tree

UNIT V MULTIWAY SEARCH TREES

5.1 M-Way Search Trees, Definition and Properties- Searching an M-Way Search Tree

5.2 B- Trees, Definition and Properties, Number of Elements in a B-tree- Insertion into a B-Tree- Deletion from a B-Tree- B +- Trees- Inserting and searching in B+-Tree- Deletion from a B+-Tree

UNIT VI DIGITAL SEARCH STRUCTURES

6.1 Digital Search Trees, Definition, Search, Insert and Delete- Binary tries and Patricia- Compressed Binary Tries- Patricia

6.2 Multiway Tries- Definitions- Searching a Trie, Sampling Strategies- Insertion into a Trie- Deletion from a Trie- Keys with Different Length- Height of a Trie- Space Required and Alternative Node Structure- Prefix Search and Applications

6.3 Compressed Tries- Compressed Tries With Skip Fields- Compressed Tries With Labeled Edges- Space Required by a Compressed Trie

6.4 Tries and Internet Packet Forwarding , IP Routing- 1-Bit Tries -Variable-Stride Tries

loading