Data Structure Training

Data Structure / DS Course Content

Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers. Data structures provide a means to manage large amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory.

INTRODUCTION

• Introduction to Data Structure
• Pointers and Dynamic Memory allocation.
• Algorithm Analysis.

STACK AND QUEUE

• Stack.
• Evaluation of Expressions.
• Queue.

LINKED LIST

• Representation
• Singly Linked List
• Doubly Linked list
• Circular singly linked list

TREES

• Trees
• Binary Tree
• Binary search Tree
• Heap
• AVL/Height balanced Tree

HASHING

• Hashing Basic concept
• Hash Table
• Hash function
• Overflow Handling

SORTING

• Bubble sort
• Insertion sort
• Selection sort
• Quick sort
• Heap sort
• Merge sort.

GRAPHS

• Graphs
• Graphs operation
• Spanning Tree