Thursday, August 20, 2009

DS index for theory

Introduction to Data Structures
Primitive Data Structures
Types of Data Structures
Stack
Queue
List
Operations on the Data Structures
Stack
Definitions
Operations
Applications – Infix, Postfix, Prefix.



Queues and Lists
Introduction to Queues
Application of Queues
Type of Queues
Basic Queues Operations
Linked Lists
Application of Linked List
Basic Operation of Linked List
Types of Linked List
Simulation Using Linked lists
Simulation process
Data Structures Implementing Simulation
Other List Structures
Stack as a Circular List
Queue as a Circular List
Simulation Program




Trees
Introduction to Trees
Trees
Application of Trees
Basic Structure of Trees
Types of Trees
Introduction to Binary Trees
Binary Tree Representations
Conversion of General Tree to Binary Tree
Application of Trees
The Huffman Algorithm


Sorting
Introduction to Sorting
General Background
Exchange sort
Bubble sort
Quick sort
Selection and Tree sorting
Selection sort
Heap Sort
Insertion Sort
Simple Insertion Sorts
Shell sort
Address Calculation Sort
Merge sort
Radix Sort
Bucket Sort


Searching
Introduction to Searching
Searching
Basic Search Techniques
Sequential Search
Binary Search
Searching an Ordered Table
Indexed Sequential Search
Interpolation Search
Tree Searching
Inserting into a Binary Search Tree
Deleting from a Binary Search Tree
General Search Trees
Multiway Search Tree
Searching a Multiway Tree
Implementing a Multiway Tree
Traversing a Multiway Tree
Insertion in a Multiway Search Tree
Hashing
Hashing Tables
Handling the Collisions

No comments:

Post a Comment