Book Details

Data Structures

Data Structures

Published by uLektz

Course Code : ULZ0425
Author : uLektz
University : General for All University
Regulation : 2017
Categories : Computer Science
Format : ico_bookePUB3 (DRM Protected)
Type :

eBook

FREE

Buy Now

Description :Data Structures of ULZ0425 covers the latest syllabus prescribed by General for All University for regulation 2017. 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 LINEAR DATA STRUCTURES – LIST

1.1 Abstract Data Types (ADT’s)

1.2 List ADT

1.3 Array-based implementation

1.4 Linked list implementation - Singly linked list - Circularly linked list - Doubly-linked list

1.5 Applications of lists - Polynomial manipulation - All operations (Insertion, deletion, merge and traversal)

UNIT II LINEAR DATA STRUCTURES – STACKS, QUEUES

2.1 Stack ADT– Operations - Applications

2.2 Evaluating arithmetic expressions - Conversion of infix to postfix expression

2.3 Queue ADT – Operations

2.4 Circular queue

2.5 Priority queue

2.6 De Queue

2.7 Applications of queues

UNIT III NON LINEAR DATA STRUCTURES – TREES

3.1 Tree ADT - Tree traversal

3.2 Binary tree ADT

3.3 Expression trees

3.4 Applications of trees

3.5 Binary search tree ADT

3.6 Threaded binary trees

3.7 AVL trees

3.8 B - tree

3.9 B+ Tree

3.10 Heap - Applications of heap

UNIT IV NON LINEAR DATA STRUCTURES - GRAPHS

4.1 Definition of graph - Representation of graph - Types of graph

4.2 Breadth-first traversal

4.3 Depth-first traversal

4.4 Topological sort

4.5 Bi-connectivity

4.6 Cut vertex

4.7 Euler circuits

4.8 Applications of graphs

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES

5.1 Searching- Linear search

5.2 Binary search

5.3 Sorting - Bubble sort - Selection sort - Insertion sort - Shell sort - Radix sort

5.4 Hashing - Hash functions - Separate chaining - Open addressing

5.5 Rehashing

5.6 Extensible hashing

loading