# DATA STRUCTURES

 Course Code : 13A05301 Author : uLektz University : Jawaharlal Nehru Technological University, Anantapur (JNTUA) Regulation : 2013 Categories : Computer Science Format : ePUB3 (DRM Protected) Type : eBook

FREE

Description :DATA STRUCTURES of 13A05301 covers the latest syllabus prescribed by Jawaharlal Nehru Technological University, Anantapur (JNTUA) for regulation 2013. Author: uLektz, Published by uLektz Learning Solutions Private Limited.

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

##### Topics
###### Unit I:Introduction and Overview

1.1 System Life Cycle-Definition

1.2 Overview of Data Structures Linked Lists,Single Linked Lists – Insertion and Deletion,Double Linked Lists – Insertion and Deletion

1.3 Stacks: Definition,The Abstract Data Type,Array Representation,Linked Representation,Applications

1.4 Queues: Definition,The Abstract Data Type,Array Representation ,Linked Representation ,Circular Queues,Applications

###### Unit II:Sorting

2.1 Motivation,Quick Sort, Merge Sort, Insertion Sort, and Heap Sort

2.2 Trees: Introduction,Representation of Trees,Binary Trees,Binary Tree Traversal and Tree Iterators,Additional Binary Tree Operations

2.3 Threaded Binary Trees,Binary Search Trees,Selection Trees

###### Unit III:Graphs

3.1 The Graph Abstract Data Type,Elementary Graph Operations

3.2 Skip Lists and Hashing: Dictionaries,Linear List Representation,Skip List Representation,Hash Table Representation,Static and Dynamic Hashing

###### Unit IV:Priority Queues

4.1 Definition and Applications,Single and Double Ended Priority Queues,Linear Lists

4.2 Heaps,Leftist Trees,Binomial Heaps, Fibonacci Heaps, Pairing Heaps

###### Unit V:Efficient Binary Search Trees

5.1 Optimal Binary Search Trees,AVL Trees, Red – Black Trees, Splay Trees

5.2 Multi way Search Trees: m – way Search Trees, B – Trees, B + - Trees